Home » MCQs » Theory of Computation MCQs

A grammar is said to be ambiguous if ____

47. A grammar is said to be ambiguous if ____.

1. There exists more than one leftmost derivation
2. More than one rightmost derivation
3. More than one parse tree for the given input string
4. None
5. All of the above

Answer: E) All of the above

Explanation:

A grammar is said to be ambiguous if there exists more than one leftmost derivation or more than one rightmost derivation or more than one parse tree for the given input string.