GATE CS Compiler Design Previous Year Questions

9 solved GATE CS questions on Compiler Design, drawn from 1 exam year and grouped by year. Every question shows the official answer and a step-by-step solution.

GATE CS 20249 questions

  1. Set 1 Q26Which of the following is/are Bottom-Up Parser(s)?MSQ · +1 marks · Easy
  2. Set 1 Q37Consider the following syntax-directed definition (SDD). | Production | Semantic Rules | | ------ | ------ | | S → DHTU |…MCQ · +2 marks · Medium
  3. Set 1 Q38Consider the following grammar GG, with SS as the start symbol. The grammar GG has three incomplete productions denoted by (1), (2), and (3).…MCQ · +2 marks · Medium
  4. Set 1 Q39Consider the following pseudo-code. [code] Which one of the following options CORRECTLY specifies the number of basic blocks and the number of instructions in…MCQ · +2 marks · Medium
  5. Set 2 Q21Consider the following two sets: | Set X | Set Y | | :--- | :--- | | P. Lexical Analyzer | 1. Abstract Syntax Tree | | Q. Syntax Analyzer | 2. Token | | R.…MCQ · +1 marks · Easy
  6. Set 2 Q29Which of the following statements is/are FALSE?MSQ · +1 marks · Medium
  7. Set 2 Q40Consider the following context-free grammar where the start symbol is SS and the set of terminals is {a,b,c,d}\{a,b,c,d\}. SAaAbBbBaS \rightarrow AaAb \mid BbBaMCQ · +2 marks · Medium
  8. Set 2 Q43Consider the following expression: x[i]=(p+r)s[i]+u/wx[i] = (p + r) * -s[i] + u/w. The following sequence shows the list of triples representing the given expression, with…MCQ · +2 marks · Medium
  9. Set 2 Q65Consider the following augmented grammar, which is to be parsed with a SLR parser. The set of terminals is {a,b,c,d,#,@}\{a, b, c, d, \#, @\} SSS' \rightarrow SNAT · +2 marks · Hard

Other GATE CS topics

Practice Compiler Design with adaptive difficulty

Timed practice, skill tracking, and AI explanations — free to start.

Start practicing free