GATE Compiler Design: Intermediate Code Generation – Previous Year Questions
9 GATE previous year questions on Intermediate Code Generation (Compiler Design, Computer Science) with answers and explanations, from every paper.
- GATE 2017 CS Q22 – Consider the following intermediate program in three address code Which one of the following corresponds to a *static single assignment* form of the…
- GATE 2017 CS Q62 – Consider the expression (a - 1) * (((b + c) / 3) + d). Let X be the minimum number of registers required by an *optimal* code generation (without any…
- GATE 2016 CS Q29 – Consider the following code segment. The minimum number of *total* variables required to convert the above code segment to *static single assignment*…
- GATE 2015 CS Q47 – The least number of temporary variables required to create a three-address code in static single assignment form for the expression q + r/3 + s - t *…
- GATE 2025 CS (CS2) Q21 – Consider the following statements about the use of backpatching in a compiler for intermediate code generation: (I) Backpatching can be used to…
- GATE 2025 CS (CS1) Q52 – Refer to the given 3-address code sequence. This code sequence is split into basic blocks. The number of basic blocks is . (Answer in integer)
- GATE 2024 CS (CS2) Q21 – Consider two sets. Set X: P. Lexical Analyzer, Q. Syntax Analyzer, R. Intermediate Code Generator, S. Code Optimizer. Set Y: 1. Abstract Syntax Tree,…
- GATE 2024 CS (CS2) Q43 – Consider the expression x[i]=(p+r)*-s[i]+u/w. The triples are: (0) + p r; (1) ?; (2) uminus (1); (3) ?; (4) / u w; (5) + (3) (4); (6) ?; (7) = (6)…
- GATE 2024 CS (CS1) Q39 – Consider the pseudo-code with lines L1: t1=−1; L2: t2=0; L3: t3=0; L4: t4=4*t3; L5: t5=4*t2; L6: t6=t5*M; L7: t7=t4+t6; L8: t8=a[t7]; L9: if t8<=max…