1 . Consider the following grammar.
S → A−B)
A → B | a)
B → aB | a
(a) Show that the grammar is not SLR(1).
( b ) Construct the LR(1) Automata for thegrammar.
(c) Construct the LR parsing table for thegrammar.
(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 followingspecifications.
(a) A grammar that is not SLR(5) but isSLR(6).
(b) A grammar that is LR(1), not LALR(1), and isLALR(2).
Expert Answer
An answer will be send to you shortly. . . . .