GATE 2012
Which of the following grammar transformations is used to eliminate non-determinism and enable predictive top-down LL(1) parsing?
Related Compiler Design PYQs
Type checking and verification of type compatibility across expressions are primarily performed in which phase of a compiler?
Which of the following statements about LALR(1) parsers is FALSE?
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.