Q. S -> C C
C -> eC | d

The grammar is

View solution

Q. S -> id: = E ”
newtemp ();

gen(t . place . place;); .place t} ”

.place .place;}

For the statement ‘X: = Y + Z ’,

the 3-address code sequence generated by this definition is

View solution

Q. If the programming language uses static scoping and call by need parameter passing mechanism, the values printed by the above program are

View solution

Q. If dynamic scoping is used and call by name mechanism is used, the values printed will be

View solution

Q. P x =new Q();

Q y =new Q();

P z =new Q();

x. f (1);((P) y). f (1);

z.f(1);

The output is

View solution

Q. Which of the following is NOT an advantage of using shared, dynamically linked libraries as compared to statically linked libraries?

View solution

Q. Which grammar violate rules of an operator grammar?
(i) P-> QR

(ii) P -> Q s R

(iii) P -> ε

(iv) P ->Q t

View solution

Q. Consider the grammar rule
E -> E1 − E2 for arithmetic expressions.

If E1 and E2 do not have any common sub expression, in order to get the shortest possible code

View solution

Q. The grammar
A ->AA |( A)| ε
is not suitable for predictive-parsing because the grammar is

View solution

Q. Consider the grammar
E ->E + n | E # n | n

For a sentence n + n, form of the reduction are

View solution

Q. S -> (S)| a
Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar n1 n2 and n3 respectively.

View solution

Q. Consider line 3:

Int main()

{ int 1,N;

Fro (I,1 N,1);

}

Identify the compiler’s response about this line while creating the object-module

View solution

Q. Which one of the following is true about the action of yacc for the given grammar?

View solution

Q. What precedence and associativity properties does the generated parser realize?

View solution

Q. Consider the following grammar.
S > S * E

S > E

E > F + E

E > F

F > id

Consider the following LR(0) items corresponding to the grammar above

(i) S -> S * .E

(ii) E -> F . + E

(iii) E -> F + .E

Given the items above, which two of them will appear in the same set in the canonical sets-of-items for the grammar?

View solution

Q. Consider the following grammar
S > FR

R > * S | ε

F > id

In the predictive parser table, M , of the grammar the entries M [ S, id] and M [ R,$] respectively

View solution

Q. Consider the following translation scheme.
S > ER

R > * E{print{’ * ’);

R | f

E > F + E{print(’ + ’); | F F > (S) | id{print(id.value);}

Here id is a taken that represents an integer and id, value represents the corresponding integer value. For an input ‘2 * 3 + 4’, this translation scheme prints

View solution

Q. Consider the following C code segment.
for if i # i } } }

Which one to the following false?

View solution

Q. E -> number Eval number val
E E .val E .VAL E .val
E # E E .val E .VAL E .val
;

The above grammar and the semantic rules are fed to a yacc tool (which is an LALR (1) parser generator) for parsing and evaluating arithmetic expressions. Which one of the following is true about the action of yacc for the given grammar?

View solution

Q. E -> number Eval number val
E E .val E .VAL E .val
E # E E .val E .VAL E .val
;

Assume the conflicts part (a) of this question are resolved and an LALR (1) parser is generated for parsing arithmetic expressions as per the given grammar.
Consider an expression 3 # 2 + 1. What precedence and associativity properties does the generated parser realize?

View solution