Reduce Move (using N  α) Symbols in α and their following states are removed from stack New state computed based on GOTO table (using top of stack, before pushing N) N is pushed on the stack New state pushed on top of N 12 +id$ input q0 stack idq5 Reduce: T  id +id$ input q0 stack Tq6 Stateid+()$ETaction q0q5q7q1q6shift q5reduce: T  i
{}