Q. Which table is a permanent databases that has an entry for each terminal symbol ?

View solution

Q. The output of lexical analyser is

View solution

Q. Machine independent phase of the compiler is

View solution

Q. Which of the following is used for grouping of characteristics into tokens ?

View solution

Q. which of the following grammer is LR(1) ?

a)A->aAa
A->bAb
A->a
A->b

b)A->aAa
A->aAb
A->c

c)A->A+A
A->a

d)both a and b

View solution

Q. Which of the following parser is the most powerful ?

View solution

Q. The optimization which avoids test at every iteration is

View solution

Q. A parser with valid prefix property is advantageous because it

View solution

Q. Back-patching is useful for handling

View solution

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