Conceptintro
Grammar ambiguity
Also called ambiguous grammar.
A grammar is ambiguous if some string has two distinct parse trees or leftmost derivations.
A grammar is ambiguous if some string has two distinct parse trees or leftmost derivations.
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 RMZ192 Edit this page History Report an error