LR
Family of parsing algorithms. LR - first L stands for left-to-right. R stands for rightmost derivation. Aka:
- bottom-up. In bottom-up parsers, construction of parse tree starts at the leaves and proceeds towards the root.
- shift/reduce.
Includes following algorithms (not an exhaustive list):
- LR(k)
- SLR: Simple LR
- LALR
- GLR: Generalised LR(k)
- LAR(m)
- GLR*
- SGLR: Scannerless GLR
- RIGLR: Reduction Incorporated GLR
- RNGLR: Right nulled GLR
- BRNGLR: Binary Right Nulled GLR
- IGLR: Incremental GLR
- MSGLR: Modular SGLR
- ISGLR: Incremental Scannerless GLR
Related: