GATE CS 2026 Set 1 — Question 53

MSQ+2 / -0MediumS- & L-Attributed GrammarsSemantic AnalysisCompiler DesignSyntax-Directed TranslationSymbol Tables

Compiler Design → Semantic Analysis → S- & L-Attributed Grammars

Last updated 5 September 2026

Question

D \rightarrow T \ V

Grammar (G1)	Semantic Rules
$D \rightarrow T \ V$	$D.type = T.type$ $V.type = T.type$
$T \rightarrow int$	$T.type = int$
$T \rightarrow float$	$T.type = float$
$V \rightarrow V_1 \ id$	$V_1.type = V.type$ $put(id.entry, V.type)$
$V \rightarrow id$	$put(id.entry, V.type)$

Grammar (G2)	Semantic Rules
$D \rightarrow D_1 \ id$	$D.type = D_1.type$ $put(id.entry, D_1.type)$
$D \rightarrow T \ id$	$D.type = T.type$ $put(id.entry, T.type)$
$T \rightarrow int$	$T.type = int$
$T \rightarrow float$	$T.type = float$

V \rightarrow V_1\ id \mid id

Review answer and solution without JavaScript

Interactive answer checking needs JavaScript. The published solution is available below.

V \rightarrow V_1\ id \mid id

Continue learning with Success Tracker

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.