Success TrackerSuccess Tracker
Log inSign up

GATE CS 2016 Set 2 — Question 56

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

Compiler Design → Context-Free Languages → CFGs for Parsing

Last updated

Question

A student wrote two context-free grammars G1 and G2 for generating a single C-like array declaration. The dimension of the array is at least one. For example,
int a[10][3];
The grammars use DD as the start symbol, and use six terminal symbols int ; id [ ] num.
Grammar G1
D→int L;D \to \textbf{int } L;
L→id [EL \to \textbf{id } [ E
E→num ]E \to \textbf{num ]}
E→num ] [EE \to \textbf{num ] } [ E
Grammar G2
D→int L;D \to \textbf{int } L;
L→id EL \to \textbf{id } E
E→E[num ]E \to E [ \textbf{num ]}
E→[num ]E \to [ \textbf{num ]}
Which of the grammars correctly generate the declaration mentioned above?
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.

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…