12. Pushdown Automata: PDA-DPDA
The goal of section 3.4 in the textbook is to prove that CFLs and PDAs are equivalent, namely, for every CFL, G, there is a PDA M such that L(G) = L(M) and vice versa. The author splits this into two lemmas: Lemma 3.4.1: given a grammar, construct a PDA and show the equivalence
