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

  1. A.

    Ambiguous

  2. B.

    Unambiguous

  3. C.

    Information is not sufficient to decide whether it is ambiguous or Unambiguous.

  4. D.

    None of the above

Attempted by 856 students.

Sign up free to check your answer

Sign up free

Explore the full course: Compiler Design

Loading lesson…