A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

61. Semantic Analyser is used for?
a. Generating Object code
b. Maintaining symbol table
c. None of the mentioned
d. Both of the mentioned
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).Both of the mentioned

62. Task of the lexical analysis phase is
a. to parse the source program into basic elements or tockens of the language
b. to build a literal literal table and an identifier table
c. to build a uniform symbol table
d. all of these
View Answer Report Discuss Too Difficult! Search Google
Answer: all of these

63. Which is a permanent database in the general model of compiler
a. Literal table
b. Identifier table
c. Terminal table
d. Source code
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Terminal table

64. Which table is a permanent databases that has an entry for each terminal symbol ?
a. Terminal table
b. Literal table
c. Identifier table
d. Reductions
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).Terminal table

65. The output of lexical analyser is
a. a set of regular expressions
b. syntax tree
c. set of tokens
d. strings of characters
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).set of tokens

66. Machine independent phase of the compiler is
a. syntax analysis
b. lexical analysis
c. intermediate code generation
d. all of these
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).all of these

67. Which of the following is used for grouping of characteristics into tokens ?
a. parser
b. code optimization
c. code generator
d. lexical analyser
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).lexical analyser

68. 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
a. a
b. b
c. c
d. d
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).b

69. Which of the following parser is the most powerful ?
a. Operator precedence
b. Canonical LR
c. LALR
d. SLR
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Canonical LR

70. The optimization which avoids test at every iteration is
a. loop unrolling
b. loop jamming
c. constant folding
d. none of these
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).loop unrolling