LL Parsing

Given the following grammar:

S uBDz

B Bv

B w

D EF

E y

E

F x

F

(a) Calculate nullable, FIRST, and FOLLOW for this grammar.

(b) Construct the LL(1) parsing table and give evidence that this grammar is not LL(1).

(c) Modify the grammar as little as possible to make an LL(1) grammar that accepts the same language.