For those of you who don't know what a PDA (Push Down Automaton) is, it is basically a standard finite automaton but with a stack that you can push things to and pop things of -- you can then react differently if you get input a in state B versus getting input a in state Q.
Many parsers make use of PDAs when they parse source code.
Many parsers make use of PDAs when they parse source code.