Question
a.
Strength Reduction
b.
Peephole optimization
c.
Loop unwinding
d.
None of these
Posted under GATE cse question paper Compiler Design
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Multiplication of a positive integer by a power of two can be replaced by left shift, which executes faster on most machines, this is an example of?
Similar Questions
Discover Related MCQs
Q. The transfer vector is associated with?
View solution
Q. Which technique generates more optimal codes?
View solution
Q. Code generation can be done by?
View solution
Q. An optimizing Compiler?
View solution
Q. Local and loop optimization in turn provides motivation for?
View solution
Q. Live variable analysis is used as a technique for
View solution
Q. Which of the following is true regarding the above translation expression?
View solution
Q. Consider the following statements:
S1: An ambiguous grammar can be LL(1)
S2: An left recursive grammar can’t be LL(1)
Which of the following is true??
View solution
Q. The grammar is not SLR (1) because it is having?
View solution
Q. What is E val for string 1 * 0?
View solution
Q. Consider the following grammar:
Stmt → if expr then stmt else stmt | if expr then stmt
After removing left factoring the resulting grammar will be?
View solution
Q. Consider the following grammar:
A → cAd A → ab/ac/a
For Input string cad, how many times the recursive descent parser will backtrack ?
View solution
Q. Consider the following grammar:
S → Abc A → ab/ac/a
For Input string cad, how many times the recursive descent parser will backtrack?
View solution
Q. Consider the following grammar:
num → 10 ⁄ 1000 ⁄ numo ⁄ num num
Which of the following statement correctly represent the grammar?
View solution
Q. Consider the following grammar:
S → S+S
S → S*S
S → id
What we can say about precedence of operator + and * ?
View solution
Q. Suppose ↑ is a binary operation and consider the following:
E → T↑E⁄T
T → id
Which of the following statement is true?
View solution
Q. Consider the following simple context-free grammar:
S → Aa ⁄ bAc ⁄ dc ⁄ bda
Determine true (T), false (F) of the following statements:
i) The grammar is SLR (1)
ii) The grammar is LR (1)
iii) The grammar is LALR (1)?
View solution
Q. In some phase of a compiler:
Input:
temp1: = int to real (60)
temp2: = id3 * temp1
temp3: = id2 * temp2
id1: = temp3
Output:
temp1: = id3 * 60.0
id1: = id2 + temp1
Where temp1, temp2, temp3 are temporary storage id1, id2, id3 are identifiers. “int to real” is converting int 60 to a real number. The above phase is
View solution
Q. Consider the grammar:
S → ab/ac
Which of the following is true?
View solution
Q. How many bits are in the “tag” filed in the cache?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Compiler Design? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
