Which of the following context-free grammars generates the language represented by the regular expression (a + b) abb (a + b), where ∈ represents the null string?

Question

Computer Science · Theory of Computation

Verified Solution4 OptionsUpdated: October 2026👁️1 View

Share:

Correct answer

S → AabbA, A → aA | bA | ∈

Save this question and verified answer as a clean study sheet with live clickable link.

👥

Challenge your peer aspirants on WhatsApp or Telegram to solve this question!

Online Test Series

Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.

Chapter Practice

Want more practice questions on Theory of Computation?

Solve complete topic-wise tests with detailed solutions on GkGet.

Recommended practice questions in Computer Science · Theory of Computation

Mahatma Gandhi's last fast unto death in 1948 was primarily against which of the following?

What was the primary meaning of 'Swaraj' as popularized by Mahatma Gandhi during India's independence movement?

What was one major impact of India’s independence on its economy?

Answer 1

S → Aabb, A → aA | bA | ∈

Answer 2

S → AabbA, A → aA | bA | ∈

Answer 3

S → abbA, A → aA | ∈ | bA

Answer 4

S → AabbB, A → aA | ∈, B → bB | ∈

Related Practice Questions