Compilers Questions and Answers – Error Recovery in LR phase – 2

This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Error Recovery in LR phase – 2”.

1. The grammar S → aSa | bS | c is?
a) LL(1) but not LR(1)
b) LR(1) but not LR(1)
c) Both LL(1) but not LR(1) & LR(1) but not LR(1)
d) None of the mentioned
View Answer

2. Recursive descent parsing is an example of ____________
a) Top down parsing
b) Bottom up parsing
c) Predictive parsing
d) None of the mentioned
View Answer

3. LR stands for ___________
a) Left to right
b) Left to right reduction
c) Right to left
d) Right most derivation and Left to right and a in reverse
View Answer

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

Sanfoundry Global Education & Learning Series – Compilers.

To practice all areas of Compilers, 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]