0 votes 0 votes many examples are available for using pumping lemma to prove a language dies NOT belong to CFG. Is there any example for PUMPING LEMMA proves that L given IS a CFL? Please share it.. Theory of Computation theory-of-computation pumping-lemma context-free-language + – sh!va asked Jan 3, 2017 retagged May 20, 2021 by Shiva Sagar Rao sh!va 310 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes Language Fails Pumping Lemma --> Not CFL Pumping lemma is used to prove a given language is not CFL.Its a negative testing, you cannot prove that a language is context free by using Pumping lemma. Surajit answered Jan 3, 2017 edited Jan 4, 2017 by Vijay Thakur Surajit comment Share Follow See all 0 reply Please log in or register to add a comment.