Compilers

Right Left Linear Grammar

Question 1
Marks : +2 | -2
Pass Ratio : 100%
A language is regular if and only if it is accepted by finite automata.
The given statement statement is true
Given statement is false
Statement is partially true
None of the mentioned
Explanation:
Regular Language is accepted by Finite Automata. Every regular language is Context free.
Question 2
Marks : +2 | -2
Pass Ratio : 100%
Grammars that can be translated to DFAs is __________
Left linear grammar
Right linear grammar
Generic grammar
All of the mentioned
Explanation:
Right Linear grammar can be translate to DFA.
Question 3
Marks : +2 | -2
Pass Ratio : 100%
A Push Down Automata is if there is at most one transition applicable to each configuration?
Deterministic
Non deterministic
Finite
Non finite
Explanation:
In every situation, only one transition is available as continuation then the result is deterministic push down automata.
Question 4
Marks : +2 | -2
Pass Ratio : 100%
What is CFG?
Compiler
A language expression
Regular Expression
None of the mentioned
Explanation:
They are defined by rule A->b where A is non terminal and b is terminal.
Question 5
Marks : +2 | -2
Pass Ratio : 100%
Which of the following statement is true?
Every language that is defined by regular expression can also be defined by finite automata
Every language defined by finite automata can also be defined by regular expression
We can convert regular expressions into finite automata
All of the mentioned
Explanation:
All these statements are true w.r.t regular expression.
Question 6
Marks : +2 | -2
Pass Ratio : 100%
Transition of finite automata is ___________
Finite Diagram
State Diagram
Node Diagram
E-R Diagram
Explanation:
Transition of finite automata is Finite Diagram.
Question 7
Marks : +2 | -2
Pass Ratio : 100%
Left Linear grammar can be converted to Right Linear grammar.
Yes
No
Explanation:
Since right-linear grammars are regular, it follows that left-linear grammars are also regular.
Question 8
Marks : +2 | -2
Pass Ratio : 100%
What is the idea of automation with a stack as auxiliary storage?
Finite automata
Push Down Automata
Deterministic Automata
None of the mentioned
Explanation:
Push Down Automata manipulate the Stack as a part of performing a transition.
Question 9
Marks : +2 | -2
Pass Ratio : 100%
Which of the following identity is wrong?
R + R = R
(R*)* = R*
ƐR = Rɛ = R
ØR = RØ = RR*
Explanation:
Regular grammar combined with empty does not give R* instead gives empty.
Question 10
Marks : +2 | -2
Pass Ratio : 100%
A context free language is called ambiguous if?
It has 2 or more than 2 left derivations for some terminal string Ñ¡ Ñ” L (G)
It has 2 or more than 2 right derivations for some terminal string Ñ¡ Ñ” L (G)
It has 2 or more than 2 left and right derivations for some terminal string Ñ¡ Ñ” L (G)
None of the mentioned
Explanation:
When two or more Left and right most derivative occur the grammar turn ambiguous .