[Alphabetical Index | Tag Index]

LL parser

A table-driven top-down parser, similar to a recursive descent parser. Has trouble dealing with left recursion in production rules, so the grammar must typically be left factored prior to use. The LL parser reads its input in one direction (left-to-right) and produces a leftmost derivation, hence the name LL. Often referred to as LL(k), where the k indicates the number of tokens of lookahead the parser uses to avoid backtracking.

[Wikipedia]