GATE 2017 · CS2 - Afternoon
Consider the expression grammar G:
EE - T | T
TT + F | F
F(E) | id
Which of the following grammars is not left recursive, but is equivalent to G?
Related Compiler Design PYQs
Match each compiler input in List I with the compiler phase in List II that processes it. | List I: Input | List II: Compiler pha…
Which of the following statements about parser is/are CORRECT? I. Canonical LR is more powerful than SLR. II. SLR is more powerful…
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.