GATE 2016 · CS1 - Forenoon
SDTS:
Sa A { print 1 }
Sa { print 2 }
AS b { print 3 }
Using the above SDTS, the output printed by a bottom-up parser for input "aab" is:
Related Compiler Design PYQs
Consider the following code segment: x = u - t; y = x * v; x = y + w; y = t - z; y = x * y; The minimum number of total variables …
Operator attributes: '+' (High precedence, Left associative), '-' (Medium precedence, Right associative), '*' (Low precedence, Lef…
Match the following. | List I | List II | | --- | --- | | (P) Lexical analysis | (i) Leftmost derivation | | (Q) Top-down parsing…
Which one of the following grammars is free from left recursion?
A student defines two context-free grammars \(G_1\) and \(G_2\) for generating C-style array declarations having at least one dime…
Consider the following C statements: char *str1 = "Hello; /* Statement S1 */ char *str2 = "Hello;"; /* Statement S2 …
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.