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.

81. Which of the following is a phase of a compilation process ?
a. Lexical analysis
b. Code generation
c. Both (a) and (b)
d. None of these
View Answer Report Discuss Too Difficult!
Answer: (c).Both (a) and (b)

82. Uniform symbol table
a. contains all constants in the program
b. a permanent table which lists all key words and special symbols of the language in symbolic form.
c. is a permanent table of decision rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure.
d. consists of full or partial list of the token's as they appear in the program created by Lexical analysis and used for syntax analysis and interpretation.
View Answer Report Discuss Too Difficult!
Answer: (d).consists of full or partial list of the token's as they appear in the program created by Lexical analysis and used for syntax analysis and interpretation.

83. In operator precedence parsing, precedence relations are defined
a. to delimit the handle
b. for all pair of terminals
c. for all pair of non-terminals
d. none of these
View Answer Report Discuss Too Difficult!
Answer: (c).for all pair of non-terminals

84. LR parsers are attractive because
a. it does not back track
b. it can be constructed to recognize CFG corresponding to almost all programming constructs
c. both (a) and (b)
d. none of these
View Answer Report Discuss Too Difficult!
Answer: (c).both (a) and (b)

85. The most powerful parser is
a. SLR
b. LALR
c. Canonical LR
d. Operator-precedence
View Answer Report Discuss Too Difficult!
Answer: (c).Canonical LR

86. 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, * ) ?
a. ( Z,* ) is a group
b. ( Z,* ) is a monoid
c. ( Z,* ) is an algebraic group
d. none of these
View Answer Report Discuss Too Difficult!
Answer: (d).none of these

87. The identification of common sub-expression and replacement of run-time computations by compile-time computations is
a. constant folding
b. data flow analysis
c. loop optimization
d. local optimization
View Answer Report Discuss Too Difficult!
Answer: (a).constant folding

88. An intermediate code form is
a. syntax trees
b. postfix notation
c. three address codes
d. all of these
View Answer Report Discuss Too Difficult!
Answer: (d).all of these

89. The best way to compare the different implementations of symbol table is to compare the time required to
a. make an inquiry
b. add a new name
c. add a new name and make an inquiry
d. all of these
View Answer Report Discuss Too Difficult!
Answer: (d).all of these

90. To recover from an error, the operator precedence parser may
a. delete symbols from the input
b. delete symbols from the stack
c. insert symbols onto the stack and onto the input
d. all of these
View Answer Report Discuss Too Difficult!
Answer: (d).all of these