Consider the following grammar, which is already suitable for LL(1) parsing:

1 Start → Value $

2 Value → num

3 | lparen Expr rparen

4 Expr → plus Value Value

5 | prod Values

6 Values → Value Values

7 | λ

(a) ConstructFirstandFollowsetsforeachnonterminalinthegrammar.

(b) Construct the Predict sets for the grammar.

(c) Construct a recursive-descent parser based on the grammar.

(d) Addcodeintotheparsertocomputesumsandproductsasindicated by the grammar. Note that a sum always involves exactly two Values, while a product is formed over 0 or more Values.

(e) Build an LL(1) parse table based on the grammar.