MCQOPTIONS
Saved Bookmarks
| 1. |
Non-deterministic pushdown automaton that accepts the language generated by the grammar: S?aSS | ab is |
| A. | d(q0, ?, z) = { (q1, z)};nd(q0, a, S) = { (q1, SS)}, (q1, B) }nd(q0, b, B) = { (q1, ?)},nd(q1, ?, z) = { (qf, ?)} |
| B. | d(q0, ?, z) = { (q1, Sz)};nd(q0, a, S) = { (q1, SS)}, (q1, B) }nd(q0, b, B) = { (q1, ?)},nd(q1, ?, z) = { (qf, ?)} |
| C. | d(q0, ?, z) = { (q1, Sz)};nd(q0, a, S) = { (q1, S)}, (q1, B) }nd(q0, b, ?) = { (q1, B)},nd(q1, ?, z) = { (qf, ?)} |
| D. | d(q0, ?, z) = { (q1, z)};nd(q0, a, S) = { (q1, SS)}, (q1, B) }nd(q0, b, ?) = { (q1, B)},nd(q1, ?, z) = { (qf, ?)} |
| Answer» C. d(q0, ?, z) = { (q1, Sz)};nd(q0, a, S) = { (q1, S)}, (q1, B) }nd(q0, b, ?) = { (q1, B)},nd(q1, ?, z) = { (qf, ?)} | |