LL

Family of parsing algorithms. LL - first L stands for left-to-right. Second L stands for leftmost derivation. Aka:

• top-down. In top-down parsers, construction of parse tree starts at the root and prceeds towards the leaves.
• recursive descent

Includes following algorithms (not an exhaustive list):

• LL(k)
• LL(1)
• Efficient LL(k)
• GLL: Generalised LL
• LL(*)
• ALL(*): Adaptive LL(*)

Related:

• PEG
• PEGLL: PEG + GLL
• LLLR: a Combination of LL and LR
• PwD: Parsing with derivatives
• PwZ: Parsing with zippers