Pushdown Automata
(Contents)
-
Extending the Finite State Automaton with a Stack: Pushdown Automata (PDAs)
 |
Intuition |
|
Definition |
|
Animated Examples |
|
Exercises |
Nondeterministic PDAs
|
Intuition |
|
Definition |
|
Animated Examples |
|
Exercises |
Problems that can be Solved with PDAs
|
Intuition |
|
Problems that can be solved with DPDAs |
|
Problems that can be solved with NPDAs, but not with DPDAs |
|
Animated Examples |
|
Exercises |
Context Free Languages and Grammars
|
Intuition |
|
Definitions |
| |
|
A pumping lemma (animated) |
|
Exercises |
Equivalence of Context Free Grammars and PDAs
|
Intuition |
|
Converting PDAs to CFGs (animated) |
|
Converting CFGs to PDAs (animated) |
|
Exercises |
Practical Aspects
|
Compilers |
|
LL(k) parsing |
|
LR(k) parsing |
|
Exercises |
