Q. Software that measures, monitors, and controls events is

View solution

Q. A linker is given object module for a set of programs that were compiled separately. What is not true about an object module

View solution

Q. Which loader function is accomplished by loader?

View solution

Q. In which of the following no information hiding is done?

View solution

Q. When a computer is rebooted, a special type of loader is executed called

View solution

Q. Disadvantage of ” Compile and GO ” loading scheme is that

View solution

Q. A relocatable program form is one which

View solution

Q. Which of the following module does not incorporate initialization of values changed by the module?

View solution

Q. Dynamic linking can cause security concerns because

View solution

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