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$ 0 S->S.S 3 - S->ID S>(S) S->.ID s(s) ID S->.ID S->ID 1-EET 2-ET Action State id 2 S4 accept R2 S7 R2 R2 6 - F id R4 R4 R4 R4 8 2 3 R6 R6 R6R6 9 10 R1 S7 R3 R3 R5 RS R1 R R3 R3 RSRS 10