Let L be an infinite Context Free Language, then there exists some positive integer n
Any ω ∊ L with |ω| ≥ n can be decomposed as (Where ω and L represent string and language correspondingly).
ω = uvxyz with conditions
So, one language violet above pumping lemma theorem then it is not CFL.
Prove that Language is not Context Free by pumping lemma.