--------------------------
01. Context-free languages
--------------------------
- ways of describing a CFL (grammars: CFG, CDG; PDA; descriptive - example)
- suitability of particular description (DPDA can be "programmed")

------------------
02. What is a CFG?
------------------
- mathematical definition
- CFG (not) accepting a string
- derivations
- sentential forms
- language of a grammar
- the Bachus-Naur Form (BNF) notation
- left- and rightmost derivations
- parse trees
	+ yields
	+ left- and rightmost derivations
- grammar (un)ambiguity
	+ LL(1) grammars
	+ inherent ambiguity
- "cleaning" the grammar
	+ ɛ-productions
	+ unit productions
	+ non-deriving variables
	+ unreachable variables
- Chomsky Normal Form (CNF)

------------------
03. What is a PDA?
------------------
- mathematical definition
- graphical representation (ɛ-NFA + stack)
- PDA - example
- instantaneous description (ID) & goes-to relation
- language of a PDA
	+ acceptance by final state L(P)
	+ acceptance by empty stack N(P)
	+ equivalence of L(P) and N(P) -- simulations

------------------------------------------
04. From one CFL representation to another
------------------------------------------
- CFG --> PDA
- PDA --> CFG

----------------
05. More on CFGs
----------------
- CFGs with attributes
- RE --> CFG