Question 1: Consider the PDA below that recognizes strings generated by the CFG G with rules $S \rightarrow bAa$; $A \rightarrow Aa \vert \epsilon$.
Which of the following is the correct list of stack elements (leftmost is top) when the b is matched from the input baa.
(3 points)
A. b A a \$
B. \$ a b A
C. A a b \$
D. b a A \$
Question 2: Consider the PDA below that recognizes strings generated by the CFG G with rules $S \rightarrow bAa$; $A \rightarrow Aa \vert \epsilon$.
Which of the following is the correct list of stack elements (leftmost is top) when the first a is matched from the input baa.
(3 points)
A. b A a \$
B. a a A \$
C. a A A \$
D. a a \$
Question 3: Consider the PDA below that recognizes strings generated by the CFG G with rules $S \rightarrow bAa$; $A \rightarrow Aa \vert \epsilon$.
Which of the following is the correct list of stack elements (leftmost is top) when the second a is matched from the input baa.
(3 points)
A. b a a \$
B. a \$
C. A a \$
D. a A \$