Abstract
This is a basic library of definitions and results about context-free grammars and languages.
It includes context-free grammars and languages, parse trees, Chomsky normal form,
pumping lemmas and the relationship of right-linear grammars to finite automata.
License
Topics
Session Context_Free_Grammar
- Context_Free_Grammar
- Parse_Tree
- Renaming_CFG
- Disjoint_Union_CFG
- Context_Free_Language
- Unit_Elimination
- Epsilon_Elimination
- Chomsky_Normal_Form
- Pumping_Lemma_CFG
- AnBnCn_not_CFL
- CFL_Not_Intersection_Closed
- Inlining1Prod
- Binarize
- Right_Linear
- NDA_rlin2
- Right_Linear_Automata
- Pumping_Lemma_Regular
- AnBn_Not_Regular