A grammar that is both left and right recursive for a non-terminal is
PYQ GATE 1999
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
Attempted by 856 students.
Sign up free to check your answer
Sign up freeLoading lesson…

