Definitioncore
LL(1) grammar
Also called LL(1).
A grammar whose predictive parse table has at most one entry per cell, decided with one token of lookahead.
A grammar whose predictive parse table has at most one entry per cell, decided with one token of lookahead.
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 75P5FT Edit this page History Report an error