Consider the expression . Let be the minimum number of registers required by an optimal code generation (without any register spill) algorithm for a load/store architecture, in which (i) only load and store instructions can have memory operands and (ii) arithmetic instructions can have only register or immediate operands. The value of is ________.
GATE CS 2017 (Forenoon) — Question 52
Compiler DesignIntermediate Code Generation & Local Code OptimizationNAT2 marksMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.
More on Intermediate Code Generation & Local Code Optimization
- GATE CS 2025 (Forenoon) · Q52Refer to the given 3-address code sequence. This code sequence is split into basic blocks. The number of basic blocks is . (Answer in integ…
- GATE CS 2025 (Afternoon) · Q21Consider the following statements about the use of backpatching in a compiler for intermediate code generation: (I) Backpatching can be use…
- GATE CS 2024 (Forenoon) · Q39Consider the following pseudo-code. 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…
- GATE CS 2024 (Afternoon) · Q43Consider the following expression: x[i] = (p + r) - s[i] + u/w . The following sequence shows the list of triples representing the given ex…
- GATE CS 2021 (Forenoon) · Q60Consider the following C code segment: c a = b + c; e = a + 1; d = b + c; f = d + 1; g = e + f; In a compiler, this code segment is represe…
- GATE CS 2021 (Afternoon) · Q23In the context of compilers, which of the following is/are NOT an intermediate representation of the source program?

