Q9

Translate the arithmetic expression $a^\ast -(b+c)$ into syntax tree.

A grammar is said to have cycles if it is the case that $A \overset{+}{\Rightarrow} A$ Show that no grammar that has cycles can be $\text{LL(1)}.$