◦ Means for defining: Context-Free Grammar ◦ Machine for accepting: Pushdown Automata

• Every regular language is also a CFL . There are other languages in the class CFL as well

Ambiguity