Show the
configurations of the PDA, and the contents
of its input tape, during the course of its accepting the
string.
Draw the tree licensed for the foregoing sentence by a Type 2
grammar with the rules you wrote for Part 1.
Then, number the nodes of this tree according to the order
in which the PDA experiences the corresponding states as
it accepts the sentence.
If you like, you may use the output from the
PDA transitions (pda_d.txt) and
PDA configurations (pda_c.txt)
examples in your responses to Parts 2 and 3, respectively.
Simply make whatever changes might be required to the clauses of the
rule/2 and rule/3 predicates in each example.
