An ambiguous grammar is one which has:
A. More than one derivation
B. More than one leftmost derivation
C. More than one rightmost derivation
D. More than one parse tree
E. More than one syntax tree
Choose the correct answer from the options given below:
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. D and E Only
Explanation
A grammar is ambiguous if some string has more than one parse (syntax) tree (equivalently, more than one leftmost or rightmost derivation). Merely having several derivations is normal. The keyed answer chooses the parse-tree/syntax-tree definitions.More Theory of Computation and Compilers questions
- Arrange in appropriate order the construction of a finite automaton: A. Minimum-state DFA B. Regular expression C. NFA-ε D. Problem stateme…
- The grammar stmt → if expr then stmt else stmt | if expr then stmt suffers from:
- The language of the following PDA would be: δ(q0, a, z0) = (q0, aaaz0) δ(q0, a, a) = (q0, aaaa) δ(q0, b, a) = (q1, λ) δ(q1, b, a) = (q1, λ)…
- For the given two machines over {a, b}, which of the following is correct? Machine 1: states A (start), B (final); A –a→ A, A –a→ B, B –b→…
- The number of tokens in the line ' for i in range (begin; end ; step) : ' is:
- In the pumping lemma for context-free languages, for a string uvwxy, what is the minimum length of vx together?