Make it hand written

Draw diagrams on paper

$[25$ points$]$ Recall the CFG from homework $5$ #$1$:

$A0A1|0B1|$

$B11B0||$

$3$a$.[13$ points$]$ Use the procedure from class to convert this CFG to a PDA. Do not simplify the resulting PDA. Do not use the book's shorthand for pushing an entire string onto the stack with a single "transition".

$3$b$.[12$ points$]$ Say what the contents of the stack will be each time the PDA visits the main loop state, for input $0011011.($There should be only one accepting computation path for this input.$)$ Write the stack contents with the bottom of the stack on the right and the top of the stack on the left.