DFA for shift /reduce decisions The states of the dfa are used to determine Grammar if a handle is on top of the stack S→C C→AB Stack Input Action $0 aas start in state 0 A SO aas shift(and goto state 3) B→a 0a3 as reduce A→a(goto2) $0A2 as shift(goto 5) State 1o: todos a $0A2a5 s reduce B→a(goto4) $0A2B4 s reduce C→AB(otol) →● -aState $0C1 C→·ABA→a s| accept(s→C A→·a