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

View solution

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

View solution

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

View solution

Q. A basic block can be analyzed by?

View solution

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

View solution

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?

View solution

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