GATE 2026 · CS1 - Forenoon
Related Compiler Design PYQs
Consider the following C statements: char *str1 = "Hello; /* Statement S1 */ char *str2 = "Hello;"; /* Statement S2 …
Consider the following two syntax-directed definitions for type declarations. | SDD1: Grammar \(G_1\) | Semantic rules | | --- | …
A lexical analyzer uses the following token definitions letter → [A-Za-z] digit → [0-9] id → letter (letter | digit)* number → dig…
Consider the canonical LR(0) parsing of the grammar below using terminals {a,b,c} and non-terminals {A,B,C,S} with S as the start …
Consider the control flow graph shown in the figure. Which one of the following options correctly lists the set of redundant expre…
Consider the control flow graph given below. Which one of the following options is the set of live variables at the exit point of …
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.