Need help with number 3 thank you.

Question 3 [17 points]

a/ [4/17] Let G be a context-free grammar.

Is G necessarily LL(1) just because it is context-free? Explain.

b/ [5/17] Consider the following context-free grammar:

A a b C | a b D

C C c | d | e

D d D |

c/ [4/17] Eliminate the common subexpressions and the left recursion of G.

d/ [4/17] LL(3) means that we can look ahead 3 tokens on the input in order to determine which right hand side to take. Is G LL(3), i.e., parsable with 3 lookaheads in a predicatable parser? If not, explain why not.