GATE 2020
Consider the following grammar:
Sa S B | d
Bb
The number of reduction steps taken by a bottom-up parser while accepting the string aaadbbb is _______
Related Compiler Design PYQs
Consider the following statements: I. Symbol table is accessed only during lexical analysis and syntax analysis. II. Compilers for…
Consider the productions A -> PQ and A -> XY. Each of the five non-terminals A, P, Q, X, and Y has two attributes: s (synthesized)…
Consider the following C statements: char *str1 = "Hello; /* Statement S1 */ char *str2 = "Hello;"; /* Statement S2 …
Which of the following statements is/are true?
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…
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.