UGC NET CSE | September 2013 | Part 3 | Question: 22

Question

Non-deterministic pushdown automaton that accepts the language generated by the grammar: $S \rightarrow aSS \mid ab$ is

• A. $\delta (q_0, \lambda , z)= \{ (q_1, z) \};  \delta(q_0, a, S) = \{ (q_1, SS) \}, (q_1, B) \}   \delta (q_0, b, B) = \{ (q_1, \lambda) \},   \delta (q_1, \lambda , z) = \{ (q_f, \lambda ) \} $
• B. $\delta (q_0, \lambda , z)= \{ (q_1, Sz) \}; \delta(q_0, a, S) = \{ (q_1, SS) \}, (q_1, B) \} \delta (q_0, b, B) = \{ (q_1, \lambda) \},  \delta (q_1, \lambda , z) = \{ (q_f, \lambda ) \}$
• C. $\delta (q_0, \lambda , z)= \{ (q_1, Sz) \}; \delta(q_0, a, S) = \{ (q_1, S) \}, (q_1, B) \} \delta (q_0, b, \lambda) = \{ (q_1, B) \}, \delta (q_1, \lambda , z) = \{( q_f, \lambda ) \}$
• D. $\delta (q_0, \lambda , z)= \{ (q_1, z) \}; \delta(q_0, a, S) = \{ (q_1, SS) \}, (q_1, B) \} \delta (q_0, b, \lambda) = \{ (q_1,B) \}, \delta (q_1, \lambda , z) = \{ (q_f, \lambda ) \}$

Comments

productions seems to be incorrect , third production should have been  δ(q1, b, B) = { (q1, λ)},   instead of δ(q0, b, B) = { (q1, λ)}