Problem
Let G be the CFG with productions S → S + T | T T → [S] |
a. Both parts of the question refer to the moves made by the nondeterministic bottom-up PDA NB(G) in the process of accepting the input string [a + [a]] If the configuration at some point is (q0, +[a]], S[Z0), what is the configuration one move later?
b. If the configuration at some point is (q0, +[a]], T [Z0), what is the configuration one move later?