 In state 8 the parser always performs a reduce with rule 2.The top 3 states on the stack correspond with the 3 symbols in the right-hand side of rule 2.This time we pop 3 elements off of the stack (since the right-hand side of the rule has 3 symbols) and look up the goto state for E and 0, thus pushing state 3 back onto the stack

Finally, the parser reads a '$' (end of input symbol) from the input stream, which means that according to the action table (the current state is 3) the parser accepts the input string.