An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Theory of Computation and Compiler Design

Q. An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if

(A) the SLR(1) parser for G has S-R conflicts
(B) the LR(1) parser for G has S-R conflicts
(C) the LR(0) parser for G has S-R conflicts
(D) the LALR(1) parser for G has reduce-reduce conflicts

💬 Discuss

✅ Correct Answer: (B) the LR(1) parser for G has S-R conflicts

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

799

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

86%

Success Rate