Since the grammar is already in Greibach normal form, we can use the
construction in the previous theorem immediately. In addition to rules
and
the pda will also have transition rules
The sequence of moves made by M in processing aaabc is
This corresponds to the derivation
In order to simplify the arguments, the proof in Theorem 7.1 assumed that