GATE CS 2016 Set 1 — Question 52

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MCQ+2 / -0.67EasyContext-Free GrammarsContext-Free LanguagesTheory of Computation

Theory of Computation → Context-Free Languages → Context-Free Grammars

Last updated

Question

Consider the following context-free grammars:
G1:SaSB,BbbBG_1: S \to aS \mid B, B \to b \mid bB
G2:SaAbB,AaABϵ,BbBϵG_2: S \to aA \mid bB, A \to aA \mid B \mid \epsilon, B \to bB \mid \epsilon
Which one of the following pairs of languages is generated by G1G_1 and G2G_2, respectively?
Your answer

Choose one option, then check your answer.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Context-Free Languages