Context-Free Languages and Grammars

1. Motivation: Recursive Structure
2. Definition and Derivations
3. Parse Trees
4. Ambiguity
5. Simple Grammars (s-Grammars)
6. Normal Forms for CFGs
7. Properties of Context-Free Languages
8. The Pumping Lemma for CFLs
9. Applications and Grammar Notation

Slide Deck

Key Takeaways

• Exercises and Review