Consider the following grammar G.

S -> i -> V = E V -> i -> i [ E ] E -> V

a) Construct the DFA of LR( 1) items for G.

b) Construct the LR( 1) parsing table for G.

c) Construct the DFA of LALR( 1) items for G.

d) Construct the LALR( 1) parsing table for G.

e) Trace the parse for the input 'i [ i ] = i'

Use the state numbers as assigned by the parser generator yacc, but note that yacc builds a LALR( 1) parser, so use the notation n, n', n'' for states with the same core when building the LR( 1) DFA. Also note that when a state contains a single reduce item, yacc reduces without regard to the lookahead. In the LALR( 1) table indicate a reduction only for tokends in the lookahead set.