Identify Context free languages using Pumping lemma
What is the main purpose of using the Pumping Lemma in the context of context-free grammars?
In the context of the Pumping Lemma, what does it mean for a language to be 'pumpable'?
What role does the Pumping Lemma play in proving the non-context-freeness of a language?