Time Left - 10:00 mins
Mission ISRO 2017 Day-27: Compiler Design Quiz -2
Attempt now to get your rank among 577 students!
Question 1
Peephole optimization is a form of
Question 2
Consider the following psuedocode:
x : integer := 1
y : integer := 2
f
procedure add
x := x + y
procedure second (P: procedure)
x : integer := 2
P()
procedure first
y : integer := 3
Second(add)
first()
write _integer (x)
What does it print if the language uses dynamic scoping with deep binding?
x : integer := 1
y : integer := 2
f
procedure add
x := x + y
procedure second (P: procedure)
x : integer := 2
P()
procedure first
y : integer := 3
Second(add)
first()
write _integer (x)
What does it print if the language uses dynamic scoping with deep binding?
Question 3
Which of the following class of statement usually produces no executable code when compiled?
Question 4
Which of the following statements about peephole optimizations is False?
Question 5
In compiler terminology, reduction in strength means
Question 6
Substitution of values for names (whose values are constants) is done in
Question 7
Which of the following symbol table is best suited for minimum access time.
Question 8
Given the relations employee (name, salary, deptno), and department (deptno, deptname, address)
Which of the following queries cannot be expressed using the basic relation alalgebra operations (σ,π,×, ,∪,∩,−)?
Which of the following queries cannot be expressed using the basic relation alalgebra operations (σ,π,×, ,∪,∩,−)?
Question 9
Which of the following is not type of intermediate code generation?
Question 10
A basic block can be annualized by .
- 577 attempts
- 3 upvotes
- 12 comments
Apr 9GATE & PSU CS
