Grammar E->E+T E-T T>T* F T->F F (E) Fid Parse Table State 0 1 2 3 4 5 10 6 7 8 9 10 11 id S5 S5 S5 S5 + S6 R2 R4 R6 Action R5 * S7 R4 R6 S6 R1 S7 R3 R3 R5 ( S4 S4 S4 S4 ) R2 R4 R6 S11 R1 R3 R5 $ accept R2 R4 R6 R1 R3 R5 w E 1 Goto T 2 82 F 3 3 9 3 10 Solution Rules 1. The stack is case sensitive and should contain no spaces. No partial credit will be given for stack solutions that contain spaces or use incorrect casing (upper and lower case letters have special meaning to our grammar). 2. The current input at each step may contain spaces but must be kept case sensitive and must display the correct termination symbol. Using the grammar, parsing table, and solution rules above, trace through the first 6 steps (first step is done for you) of the Shift-Reduce Algorithm for the sentence id * (id + id) Step Stack 1 10 2 ||3 4 5 ||6 7 8 0(4 0(4id5 0(4F3 0(4T2 0(4T2*7 Input id * (id + id)S id"id)+id *id)+id *id)+id *id)+id id)+id