adplus-dvertising
frame-decoration

Question

Which of the following technique can be used as intermediate code generation?

a.

Postfix notation and three address codes

b.

Quadruples

c.

Both a and b

d.

None of these

Answer: (a).Postfix notation and three address codes

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which of the following technique can be used as intermediate code generation?

Similar Questions

Discover Related MCQs

Q. Inputs to the code generator phase of compiler design are?

Q. The output of the code generator is a target program that includes?

Q. Replacement of an expensive operation by a cheaper one is termed as?

Q. A basic block can be analyzed by?

Q. What is the formal name of the method that performs optimizing loop execution speed, usually at the cost of code size?

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?

Q. The transfer vector is associated with?

Q. Which technique generates more optimal codes?

Q. Code generation can be done by?

Q. An optimizing Compiler?

Q. Local and loop optimization in turn provides motivation for?

Q. Live variable analysis is used as a technique for

Q. Which of the following is true regarding the above translation expression?

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??

Q. The grammar is not SLR (1) because it is having?

Q. What is E val for string 1 * 0?

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?

Q. Consider the following grammar:

A → cAd A → ab/ac/a

For Input string cad, how many times the recursive descent parser will backtrack ?

Q. Consider the following grammar:

S → Abc A → ab/ac/a

For Input string cad, how many times the recursive descent parser will backtrack?

Q. Consider the following grammar:

num → 10 ⁄ 1000 ⁄ numo ⁄ num num

Which of the following statement correctly represent the grammar?