Multiple choice Pumping lemma is generally used for proving a given grammar is regular a given grammar is not regular whether two given regular expressions are equivalent or not none of these Reveal answer Fill a bubble to check yourself B Correct answer Explanation The Pumping Lemma is a proof technique used to show that a language is not regular by demonstrating that it fails the conditions required for regular languages.