Context-free grammars
A context-free grammar has finite variables, terminal alphabet, rules A→w with one variable on the left, and a start variable.
Key knowledge
A context-free grammar has finite variables, terminal alphabet, rules A→w with one variable on the left, and a start variable. Its language contains terminal strings derived from the start; S→0S1|ε generates {0ⁿ1ⁿ:n≥0}.
Conditions and scope
- A derivation applies a rule to a variable in the current string.
- Ambiguous derivations and membership are different questions.
Sources · 1
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Lecture 4 CFG tuple, derivation examples and start-symbol language.
2026-10-10 · Independent AI editorial review: All241 compact claims, hypotheses, displayed equations/conventions and all596 origin semantic links read; entire241-entry author exact-source inspection matrix and declared limitations reviewed. Prior105 actual inherited Mathematics/Information records read for whole-inventory breadth. Targeted independent primary sections are listed below; this does NOT claim every cited source body or every proof was independently re-read. This is AI reference-content review, not human disciplinary certification, exhaustive textbook reproduction or experimental replication. Receipt: mathematics-information-independent-content-review.1.
Entry details
Permanent link to this entry ↗- Record identity
- info-context-free-grammars
- Revision
- university-core.1
- Structured reference record
- University core expansion