Algorithmresearch
GLL parsing
Also called generalized LL parsing.
Generalized top-down parsing with descriptors and a graph-structured stack that handles all context-free grammars, due to Scott and Johnstone.
Generalized top-down parsing with descriptors and a graph-structured stack that handles all context-free grammars, due to Scott and Johnstone.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 0BHT8C Edit this page History Report an error