GATE | GATE CS 1999 | Question 40

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


Answer: (C)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.