Theorems · Definition · computer science
ContextFreeGrammar.Generates
{T : Type u_1} → (g : ContextFreeGrammar T) → List (Symbol T g.NT) → PropGiven a context-free grammar g and a string s
g.Generates s means that g can transform its initial nonterminal to s in some number of
rewriting steps.
- Defined in
- Mathlib.Computability.ContextFreeGrammar
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 56 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Symbolstatement and proof · cited by 47
- ContextFreeGrammarstatement and proof · cited by 39
- ContextFreeGrammar.NTstatement and proof · cited by 30
- ContextFreeGrammar.Derivesproof · cited by 19
- ContextFreeGrammar.initialproof · cited by 7
Cited by4
Results whose statement or proof uses this declaration.
- ContextFreeGrammar.languageproof · cited by 4
- ContextFreeGrammar.generates_reversestatement · cited by 1
- ContextFreeGrammar.generates_reverse_commstatement · cited by 0
- ContextFreeGrammar.Generates.reversestatement · cited by 0