Recently changed
14.10.2024
30.09.2024
- Automata
- Parsers timeline
- Boolean languages
- Context free with lookahead
- Context sensetive languages
- Context free languages
- Conjuctive languages
- Deterministic context free languages
- Deterministic context sensetive languages
- Indexed languages
- Deterministic Indexed languages
- RE with backreferences and lookahead
- RE with lookahead
- PEG languages
- Languages with context
- Regular languages
- RE with backreferences
22.09.2024
- DPPDA
- IPDA
- LBA
- Scaffolding Automata
- TSA
- APDA
- 2SA
- 2DPDA
- AFA
- DFA
- IDPDA
- NESA
- FA
- DPDA
- NSA
- PDA
- SA
- SFA
- SAPDA
- TFA
21.09.2024
20.09.2024
17.09.2024
15.09.2024
09.09.2024
08.09.2024
- Language
- SGLR: Scannerless GLR
- Scannerless parser
- About
- Parse tree
- Zipper
- MOG: Multi-Ordered Grammars
07.09.2024
23.08.2024
- PEG
- Brzozowski derivative
- Implementations
- BRNGLR: Binary Right Nulled GLR
- IGLR: Incremental GLR
- ISGLR: Incremental Scannerless GLR
- MSGLR: Modular SGLR
- RIGLR: Reduction Incorporated GLR
- RNGLR: Right nulled GLR
- Incremental parsers
- ALL(*): Adaptive LL(*)
22.08.2024
- GLL: Generalised LL
- LLLR: a Combination of LL and LR
- GLC: Generalized left-corner parsing
- PEGLL: PEG + GLL
28.07.2024
04.07.2024
03.07.2024
01.07.2024
- Earley
- LALR
- GLR*
- GLR: Generalised LR(k)
- LAR(m)
- LL(1)
- LL(*)
- SLR: Simple LR
- CYK: Cocke–Younger–Kasami
- Efficient LL(k)
- LR(k)
- Parser combinators
- LL(k)
- Notation
- Dynamic programming
25.06.2024
16.09.2023