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 AB $0 aas shift(and goto state 3) $0a3 as reduce A→a(goto2) $0A2 as shift(goto 5) $0A2a5 s reduce B→a(goto4) State gotO(o A $0A2B4 s reduce C→AB(otol) State l $0C1 s| accept(s→C C→AB|C→AB A→·a B →