You are not logged in.

Pages:: **1**

## #1 2016-10-20 06:47:33

### Pumping lemma is generally used for proving that?

# Programming Languages Quizzes Theory Of Computation

**Question:**

Pumping lemma is generally used for proving that

**Option A):**

given grammar is regular**Option B):**

given grammar is not regular**Option C):**

whether two given regular expressions are equivalent or not**Option D):**

None of these

**Correct Answer is Option B):**

given grammar is not regular

**Online Web Tutorials And Interview Questions With Answers Forum:**

https://globalguideline.com/forum/

Offline

## 2016-10-20 06:47:33

**Advertisement****Ads By Google**

### Re: Pumping lemma is generally used for proving that?

\n