Question

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 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).

          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 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).

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 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).

Added by Shelby B.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Paul Gabriel

Step 1

The LR(0) items for this grammar are: Show more…

Show all steps

Thanks for your feedback!

Consider the following grammar. S -> AB | a A -> BaB | a a) Show that the grammar is not SLR(1). b) Construct the LR(1) Automaton for the grammar. c) Construct the LR parsing table for the grammar. d) Parse the string aaaa. Show the stack, the input, and the action taken. e) Merge the LR(1) states and convert the LR(1) Automaton to LALR(1).