search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.

Recent questions tagged register-allocation

0 votes
1 answer 20 views
Errors violating the condition ‘any variable must be declared before its use’ are detected during semantic analysis. Why cannot it come under syntax analysis? Does declaration not fall under Syntax?
asked Jul 14 in Compiler Design GreyMatter 7 points 20 views
0 votes
0 answers 16 views
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 register spill) algorithm for a load/store architecture, in which only load and store instructions can have memory operands and arithmetic instructions can have only register or immediate operands. The value of $X$ is _____________ .
asked Apr 18, 2020 in Compiler Design admin 573 points 16 views
1 vote
0 answers 75 views
The program below uses six temporary variables $a, b, c, d, e, f$. a = 1 b = 10 c = 20 d = a + b e = c + d f = c + e b = c + e e = b + f d = 5 + e return d + f Assuming that all operations take their operands from registers, what is the minimum number of registers needed to execute this program without spilling? $2$ $3$ $4$ $6$
asked Apr 18, 2020 in Compiler Design admin 573 points 75 views
0 votes
0 answers 20 views
Consider evaluating the following expression tree on a machine with load-store architecture in which memory can be accessed only through load and store instructions. The variables $a, b, c, d,$ and $e$ are initially stored in memory. The binary operators used in this expression ... be stored in memory, what is the minimum number of registers needed to evaluate this expression? $2$ $9$ $5$ $3$
asked Apr 18, 2020 in Compiler Design admin 573 points 20 views
0 votes
0 answers 15 views
The expression $( a * b) * c \; op \dots$ where ‘op’ is one of ‘$+$’, ‘$*$’ and ‘$\uparrow$’ (exponentiation) can be evaluated on a CPU with single register without storing the value of ($a * b$) if $\text{‘op’}$ is ‘$+$’ or ‘$*$’ $\text{‘op’}$ is ‘$\uparrow$’ or ‘$*$’ $\text{‘op’}$ is ‘$\uparrow$’ or ‘$+$’ not possible to evaluate without storing
asked Apr 18, 2020 in Compiler Design admin 573 points 15 views
To see more, click for the full list of questions or popular tags.
...