Converting a context free grammar to a PDA -- is my solution correct?
Doesn't that language simply recognize any string in $\{0,1\}^*$ that has at least three $1$s in it?

If so, you just need a regular finite deterministic automaton with that can count up to three in order to recognize it.





This is because I'm not on the mood to do a direct translation of that grammar, if that is what you really wanted to check :P