Question

1. (20 pts) Create an LR(0) parse table for the following grammar. Show all steps (creating closures, the DFA, the transition table, and finally the parse table):

E -> E + T | E * T | T

T -> ( E ) | id

2. (20 pts) Show a complete bottom-up parse, including the parse stack contents, input string, and action for the string below using the parse table you created in step 1. Think about how I went through this in class.

(id + id) * id

3. (10 pts) Show a rightmost derivation for the string above, and show how the bottom-up parse you completed in step 7 correctly finds all of the handles for the input string above.

Answer 1

1. Create an LR(0) parse table for the following grammar. Show all steps (creating closures, the DFA, the transition table, and finally the parse table):

E -> E + T | E * T | T

T -> ( E ) | id

2. Show a complete bottom-up parse, including the parse stack contents, input string, and action for the string below using the parse table you created in step 1. Think about how I went through this in class.

(id + id) * id

AS PER CHEGG RULE WHEN THERE ARE MULTIPLE BIG SOLVABLE QUESTIONS I CAN ANSWER UPTO THIS EXTENT.KINDLY REPOST REMAINING