Compilers Questions and Answers – Data Structure for Representing Parsing Table – 2

This set of Compilers online quiz focuses on “Data Structure for Representing Parsing Table – 2”.

1. In operator precedence parsing whose precedence relations are defined _________
a) For all pair of non-terminals
b) For all pair of terminals
c) To delimit the handle
d) None of the mentioned
View Answer

2. LR parsers are attractive because _________
a) It can be constructed to recognize CFG corresponding to almost all programming constructs
b) It does not backtrack
c) It can be constructed to recognize CFG corresponding to almost all programming constructs & It does not backtrack
d) None of the mentioned
View Answer

3. Which is the most powerful parser?
a) SLR
b) LALR
c) Canonical LR
d) Operator Precedence
View Answer

4. ( Z,* ) be a structure, and * is defined by n * m =maximum (n, m) Which of the following statements is true for ( Z, * )?
a) ( Z,* ) is a monoid
b) ( Z,* ) is an algebraic group
c) ( Z,* ) is a group
d) None of the mentioned
View Answer

5. The address code involves _____________
a) Exactly 3 address
b) At most Three address
c) No unary operators
d) None of the mentioned
View Answer

6. An intermediate code form is ___________
a) Postfix Notation
b) Syntax Trees
c) Three address code
d) All of the mentioned
View Answer

Sanfoundry Global Education & Learning Series – Compilers.

To practice all areas of Compilers for online Quizzes, here is complete set of 1000+ Multiple Choice Questions and Answers.

If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]