Category
page 1Parsing algorithms
CYK algorithm
parsing algorithm for context-free grammars
LL parser
left-to-right, leftmost derivation top-down parser for a subset of context-free languages
shunting-yard algorithm
stack-based algorithm for parsing infix mathematical expression
LR parser
type of parser
top-down parsing
parsing technique
LALR parser
look-ahead left-to-right, rightmost derivation parser
Earley parser
an algorithm for parsing strings that belong to a given context-free language
recursive-descent parser
style of parser written as a recursive structure matching the grammar it parses
bottom-up parsing
parsing approach that starts from the leaf nodes of a tree and works in upward direction till it reaches the root node
Simple LR parser
type of LR parser with small parse tables and a relatively simple parser generator algorithm
GLR parser
extension of an LR parser algorithm to handle non-deterministic and ambiguous grammars
chart parser
type of parser for ambiguous grammars
history of compiler construction
Wikimedia history article
Canonical LR parser
LR(k) parser for k=1, i.e. with a single lookahead terminal