Context-free languages

Context-free grammars and derivations, normal forms, parsing algorithms, pushdown automata, deterministic and ambiguous languages, closure and non-closure properties, pumping and Ogden's lemmas, and Parikh images.

• Grammars, parsing and pushdown automata
• Closure properties and pumping lemmas

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.