Compiler Design...

Generation of intermediate code based on an abstract machine model is useful in compilers because:

Consider the following the statements

S1: Static allocation bindings do not change at runtime

S2: Heap allocation allocates and de-allocates storage at run time

Consider the productions for the below given grammar?

S → Q | S # Q

Q → Q # P | P

P → R @ P | R

R → id

Consider the following C code fragment:

void main()

{

…

x()

}

int x()

{

…

y()

}

int y()

 {

…

}

Consider the following statements:

(i)  The symbol table contains information about the lexical and the syntactical structure of the program.

(ii)  Output of the semantic analysis is the annotated parse tree.

(iii) The intermediate code generator does not use the symbol table.

(iv) The intermediate code generation and the machine code generation can never be combined in a single step.

Which of the above statement/s is/are TRUE about the compilation?

Consider the following code segment:

p = q – r

s = r + t

p = s + p

s = a + s

What it the minimum number of total variables required to convert the above code segment to static single assignment?

Consider the statement 

do

{

i = i + 1;

}

While(a[i] < b);

Choose the equivalent prefix form of the following expression

(a + (b − c))* ((d − e)/(f + g − h))

Consider the following table:

Matching A, B, C, D in the same order gives: