The regular grammar for the language L = {anbm | n + m is even} is given by

M

Mr. Dubey

🎓 Coach ⭐ 104.58K Points

📊 Theory of Computation and Compiler Design

Q. The regular grammar for the language L = {anbm | n + m is even} is given by

(A) S → S1 | S2 S1 → a S1| A1 A1 → b A1| λ S2 → aaS2| A2 A2 → b A2| λ
(B) S → S1 | S2 S1 → a S1| aA1 S2 → aaS2| A2 A1 → b A1| λ A2 → b A2| λ
(C) S → S1 | S2 S1 → aaa S1| aA1 S2 → aaS2| A2 A1 → b A1| λ A2 → b A2| λ
(D) S → S1 | S2 S1 → aa S1| A1 S2 → aaS2| A2 A1 → bb A1| λ A2 → bb A2| λ

💬 Discuss

✅ Correct Answer: (D) S → S1 | S2 S1 → aa S1| A1 S2 → aaS2| A2 A1 → bb A1| λ A2 → bb A2| λ

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

209

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

87%

Success Rate