A special subclass of context-free languages are the deterministic context-free languages which are defined as the set of languages accepted by a deterministic pushdown automaton and can be parsed by a LR(k) parser.
An LR parser using tables derived from a grammar by a parser generator
Earley parser | LR parser | Operator-precedence parser | LR(k) parser | LALR parser |