1

Consider the grammar S → (S) | a Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n1, n2 and n3 respectively. The following relationship holds good

Correct Answer: n1 = n3 < n2

Make the most of this question

This page focuses on one Theory of Computation and Compiler Design question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Theory of Computation and Compiler Design MCQ: Consider the grammar S → (S) | a Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n1, n2 and n3 respectively. The following relationship holds good | Extra Education