 The parsing tables of the LR(1) parser are parameterized with a lookahead terminal.Simple parsing tables, like those used by the LR(0) parser represent grammar rules of the form

which means that if we go from state "A" to state "B" then we will go to state "A1" .After parameterizing such a rule with a lookahead we have