Q. Access time of the symbol table will be logarithmic,if it is implemented by

View solution

Q. A shift reduce parser carries out the actions specified within braces immediately after reducing,with
the corresponding rule of the grammar

s->xxW{print “1”}
s->y{print “2”}
w->sz{print “3”}

what is the translation of “xxxxyzz” ?

View solution

Q. which of the following cannot be used an an intermediate code form ?

View solution

Q. A Language L is defined by L={xn yn |n>1} . Which of the following definitions generates the same
language as L

View solution

Q. pass 1

View solution

Q. Pass 2

View solution

Q. Forward reference table(FRT) is arranged like -

View solution

Q. Terminal table -

View solution

Q. Which of the following is a phase of a compilation process ?

View solution

Q. Uniform symbol table

View solution

Q. In operator precedence parsing, precedence relations are defined

View solution

Q. LR parsers are attractive because

View solution

Q. The most powerful parser is

View solution

Q. Let ( Z,* ) be an algebraic structure, where Z is set of integers and the operation * is defined by n * m =maximum ( n , m ) Which of the following statements is true for ( Z, * ) ?

View solution

Q. The identification of common sub-expression and replacement of run-time computations by compile-time computations is

View solution

Q. An intermediate code form is

View solution

Q. The best way to compare the different implementations of symbol table is to compare the time required to

View solution

Q. To recover from an error, the operator precedence parser may

View solution

Q. Reduction in strength means

View solution

Q. Substitution of values for names whose values are constant, is done in

View solution