GATE 2018
Consider the following parse tree for the expression a # b $ c $ d # e # f, involving two binary operators $ and #.
Which one of the following is correct for the given parse tree?
Related Compiler Design PYQs
A lexical analyzer uses the following patterns to recognize three tokens T1, T2 and T3 over the alphabet {a, b, c}: T1: a? (b | c)…
Which one of the following statements 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.