Theory-of-Computation

Question 44

A grammar that is both left and right recursive for a non-terminal, is

A	Ambiguous
B	Unambiguous
C	Information is not sufficient to decide whether it is ambiguous or unambiguous
D	None of the above

Question 44 Explanation:

If a grammar is both left and right recursion, then grammar may or may not be ambiguous.

Correct Answer: C

Question 44 Explanation:

If a grammar is both left and right recursion, then grammar may or may not be ambiguous.