For the following grammar, do the following:

a. Construct the canonical collection of sets of LR(1) items

b. Draw the go-to graph (DFA)

c. Build the Action and Goto tables

d. Indicate whether the grammar is LR(1)

e. Trace step-by-step the parsing of the given string indicating for each step whether it is a shift or a reduce and showing the contents of the stack after each step. If the grammar is not LR(1), use the partially constructed tables and stop when parsing fails.

Grammar:

(0) Goal → Expr

(1) Expr →Term + Expr

(2) Expr →Term

(3) Term → Factor * Term

(4) Term → Factor

(5) Factor → ident

String to parse: x*y+z