1 - We want to design an LR(0) parser for the following grammar, in this grammar S is the start symbol. You can use index 0 if you introduce a new rule. Create a complete parsing DFA, showing the closure for all states including the parsing marker in every rule, and transitions between the states.

1 - S ::= ( L )

2 - S ::= x

3 - L ::= S

4 - L ::= L , S

2 Create the LR(0) parse table for the following DFA. Please note, in this DFA the marker to present the position of parsing in rules, is dot character instead of @, therefore, S -> . S $ is equivalent to S -> @ S $

3 Show the stack trace and input consumption for parsing the expression id*id using the following grammar and parse table.

1-S'->S$ 5 0 3 - S->ID ID S->.ID S->ID 4