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

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Theory of Computation and Compiler Design

Q. 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

(A) n1 < n2 < n3
(B) n1 = n3 < n2
(C) n1 = n2 = n3
(D) n1 ≥ n3 ≥ n2

💬 Discuss

✅ Correct Answer: (B) n1 = n3 < n2

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

631

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

99%

Success Rate

Mr. Dubey

💬 Discussion

Related MCQs

📊 Question Analytics