Compiler-Design

(a) Translate the arithmetic expression a*-(b+c) into syntax tree.
(b) A grammar is said to have cycles if it is the case that
A ⇒ +_A
Show that no grammar that has cycles can be LL(I).