Theorems · Inductive type · computer science
ContextFreeGrammar
Type u_1 → Type (max 1 u_1)
Context-free grammar that generates words over the alphabet T (a type of terminals).
- Defined in
- Mathlib.Computability.ContextFreeGrammar
- Cited by
- 39 results in Mathlib
- Foundations
- Depth 0 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by54
Results whose statement or proof uses this declaration.
- ContextFreeGrammar.NTstatement and proof · cited by 30
- ContextFreeGrammar.Derivesstatement and proof · cited by 19
- ContextFreeGrammar.reversestatement and proof · cited by 19
- ContextFreeGrammar.Producesstatement and proof · cited by 17
- ContextFreeGrammar.rulesstatement and proof · cited by 9
- ContextFreeGrammar.initialstatement and proof · cited by 7
- ContextFreeGrammar.languagestatement and proof · cited by 4
- Language.IsContextFreeproof · cited by 3
- ContextFreeGrammar.Derives.trans_producesstatement and proof · cited by 3
- ContextFreeGrammar.Generatesstatement and proof · cited by 3
- ContextFreeGrammar.Derives.transstatement and proof · cited by 2
- ContextFreeGrammar.Produces.singlestatement and proof · cited by 2