Actions of a Shift-Reduce Parser: Shift to s n Push input token into the symbol stack Push s n into state stack Advance to next input symbol Reduce r n Pop both stacks as many times as the number of symbols on the RHS of rule n Push LHS of rule n into symbol stack Lookup [top of the state stack][top of symbol stack] Push that state (in goto k) into state stack