If a language is context free, after some length k, every word can be split in a 5 part way uvwxy where |vx| >= 1 and |vwx| <= k, such that no matter how many (equal) times v and x are repeated, the word is valid
To prove a language is not context free: choose legal word with length > k, argue that every splitting |vx| >= 1 and |vwx| <= k, some uv^iwx^iy is not legal
