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
- A.
Ambiguous
- B.
Non-ambiguous
- C.
LL(1)
- D.
Both (A) & (C)
Attempted by 229 students.
Sign up free to check your answer
Sign up freeLoading lesson…

