Show that if the algorithm of Theorem 31 produces a deterministic PDA, then the language has only one word in it.

We shall now use the algorithm of Theorem 31 to tum this machine back into a CFG. First, we must put this PDA into conversion form:

START POP PUSH $ PUSH S PUSH $ PUSH A PUSH N POP POP PUSH S PUSH S A POP READ, POP HERE POP PUSH A PUSH A POP POP PUSH $ H READ, POP ACCEPT