Questions for LL parser please!!... (will be very appreciatated if there`s any comments of description for each questions!!)

P rightarrow PL | L L rightarrow N; | M; | C N rightarrow print E M rightarrow print "W" W rightarrow TW | epsilon C rightarrow if E {P} | if E{P} else {P} E rightarrow (EOE) | V O rightarrow + | - | * V rightarrow 0 | 1 | 2| 3 T rightarrow a | b | c | d Define G Show the set of variables of G Show the set of terminals of G What is the start variable of G? Proving G is not LL(1) Prove that G is not an LL(1) grammar. Transforming G Find an equivalent grammar G' which is LL(1), by using the grammar transformation techniques shown in lectures, or otherwise. Describe the process and show your working. LL(1) parse table Complete the LL(1) parse table for G. Describe the process and show your working, including: FIRST sets for all the production rules of G' FOLLOW sets for variables of G' only if they are needed