Consider the following grammar for generating Boolean expressions: E → E OR E…

Consider the following grammar for generating Boolean expressions:

E → E OR E

E → E AND E

E → NOT E

E → (E) E → TRUE

E → FALSE

E → ID

The above grammar is

  1. A.

    Ambiguous

  2. B.

    Non-ambiguous

  3. C.

    LL(1)

  4. D.

    Both (A) & (C)

Attempted by 229 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…