The $LR(k)$ parsers

Any parser constructed using the above method will be a member of the family of $LR(k)$ parsers:

L

= scanning the input from Left to right

R

= Conducting a Rightmost derivation (in reverse)

k

= using $k$ symbols of lookahead.

As usual, lookahead is indicated by the presence of FIRST or FOLLOW somewhere in the construction. We did not use them above, so we have constructed a $LR(0)$ parser.