Consider the following grammar for Boolean expression:
$E$ $\rightarrow$ $E$ OR $E$
$E$ $\rightarrow$ $E$ AND$E$
$E$ $\rightarrow$ NOT $E$
$E$ $\rightarrow$ $\left ( E \right )$
$E$ $\rightarrow$ TRUE
$E$$\rightarrow$ FALSE
$E$ $\rightarrow$ $ID$
The above grammar is
- Ambiguous
- Non-ambiguous
- $LL$ $\left ( 1 \right )$
- Both$\left ( A \right )$ and $\left ( C \right )$