Source: wikibot/ogden-s-lemma
= Ogden's lemma
{wiki=Ogden's_lemma}
Ogden's lemma is a result in formal language theory, specifically concerning context-free languages (CFLs). It is a generalization of the well-known Pumping Lemma for context-free languages. Ogden's lemma provides a method for proving that certain languages are not context-free by demonstrating that a language does not satisfy the conditions required by the lemma.