A, X A, X b,X pop pop start pop push(X) the language accepted by the empty-stack PDA is To transform the PDA into a C-F grammar, for each type of the PDA instructions, we need to construct the corresponding grammar productions. In the following, we list the PDA instructions on the left and you put the corresponding grammar productions in the blanks on the right. We start with Type 4 first. Type 4: The start state and the first PDA instruction AX/pop as shown below gives pop 01 start The start state and the second PDA instruction AX/pop as shown below gives