III Reading bottom up tables Using the given a grammar, table, and the following trace of the process of parsing a given string id +id *id" Perform 3 more steps tack Input did id ion Shift 5 Reduce 6 (goto [O FI) d5 F3 Grammar 2. E-> T 3. T->T*F 4. T->F Bottom up Parsing LR(1) Action Goto State id S4 6. F->id accept 2.E T R2 57 R2 R2 The given LR table 4.T F 5F ( E ) 6P id R4 R4 R4 R4 R6 R6 R6 R6 S4 10 S11 R1 R3 R RS RS S6 R1 R3 R3 RS RS Top Parse Stack Input Sm ai aie1 Initial configuration: (0, a.. .aS) Parser Parsing Code Table -If ACTION [Sm. a,-SN ( ie Shift N. the next configuration is -If ACTION[Sm, aJ = Reduce A and S = GOTO[Smr, A], where r = the length of a the next configuration