An LR parser is a parser for languages defined by a deterministic context-free grammars. $\mathrm{LR}(k)$ denotes a parser that requires at most $k$ symbols of lookahead. LR parsers are efficient, but not every context-free language can be recognized by this type of parser.