1 . Consider the following grammar.

S AB)

A B | a)

B aB | a

(a) Show that the grammar is not SLR(1).

( b ) Construct the LR(1) Automata for the grammar.

(c) Construct the LR parsing table for the grammar.

(d) Parse the string a)aaa). Show the stack, the input, and the action taken.

(e) Merge the LR(1) states and convert the LR(1) automata to LALR(1).

2 . Give example grammars for the following specifications.

(a) A grammar that is not SLR(5) but is SLR(6).

(b) A grammar that is LR(1), not LALR(1), and is LALR(2).