How would you go about proving that this Language is Context free. I'm having issues with drawing the PDA for this.
I need to prove Prove that the language L = {w | number of 11s in w is more than the number of 010s} is context free.
I so far assume that when a string of 11s occur add x to the stack and when 010s add y to the stack, but I'm having issues drawing that part out the part were you check to see if the number of x's in the stack is greater then the number of y's.
Update based on GoodDeeds answer, just need to clearify something Basic PDA Input, Pop -> Push
"Whenever a 11 is encountered, and the top of the stack is not a y, push an x. Else, pop a y."
So in this case whenever a 11 is encountered do I draw out the transition like example A or B?