Make a LL(1) parser-table for the grammar produced in 2.12. Consider the following grammar for postfix expressions: E → E E + E → E E ∗ E → num a) Eliminate left-recursion in the grammar. b) Do...

Make a LL(1) parser-table for the grammar produced in 2.12.

Consider the following grammar for postfix expressions:

E → E E +

E → E E ∗

E → num

a) Eliminate left-recursion in the grammar.

b) Do left-factorisation of the grammar produced in question a.

c) Calculate Nullable, FIRST for every production and FOLLOW for every nonterminal in the grammar produced in question b.

d) Make a LL(1) parse-table for the grammar produced in question b.