0 votes 0 votes How by Pumping Lemma we can prove that “context free grammar generate an infinite number of strings” and here what could be pumping length ? Theory of Computation theory-of-computation pumping-lemma + – srestha asked Apr 19, 2019 srestha 651 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes The pumping length would be $b^{V+1}$ where b is the maximum no of symbols on the right hand side of a production and V is the number of variables in the Grammar. Arkaprava answered May 9, 2019 Arkaprava comment Share Follow See all 2 Comments See all 2 2 Comments reply srestha commented Jun 15, 2019 reply Follow Share Can u explain more @Arkaprava I am unable to get u 0 votes 0 votes Arkaprava commented Jun 15, 2019 reply Follow Share Please see this video, it'd be clear https://youtu.be/IpgZB4elzX4 0 votes 0 votes Please log in or register to add a comment.