Success TrackerSuccess Tracker
Log inSign up

GATE CS 2025 Set 2 — Question 51

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MSQ+2 / -0HardLL(1) ParsingSyntax AnalysisCompiler DesignAmbiguityContext-Free LanguagesTheory of Computation

Compiler Design → Context-Free Languages → Ambiguity

Last updated

Question

Consider two grammars G1G_1 and G2G_2 with the production rules given below:G1:S→if E then S∣if E then S else S∣aG_1: S \to if\ E\ then\ S \mid if\ E\ then\ S\ else\ S \mid aE→b\quad \quad E \to bG2:S→if E then S∣MG_2: S \to if\ E\ then\ S \mid MM→if E then M else S∣c\quad \quad M \to if\ E\ then\ M\ else\ S \mid cE→b\quad \quad E \to bwhere if,then,else,a,b,cif, then, else, a, b, c are the terminals.
Which of the following option(s) is/are CORRECT?
Your answer

Select all that apply, 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.

Start with a free accountView plans and allowances

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

2026 Set 2 Q13Which one of the following statements is equivalent to the following assertion? Turing machine MM…2026 Set 2 Q17In C runtime environment, which one of the following is stored in heap?2026 Set 2 Q19Consider the following three ANSI-C programs, P1, P2, and P3. P1 [code] P2 [code] **P3**…2026 Set 1 Q25Consider the following grammar where SS is the start symbol, and aa and bb are terminal symbols.…2026 Set 1 Q26Let MM be a nondeterministic finite automaton (NFA) with 6 states over a finite alphabet. Which of…