Describe an algorithm that computes LALR(1) and then splits states as needed in an attempt to address conflicts. Take note of the issue raised in Exercise 34.
Exercise 34
Consider a grammar Gand its LALR(1) construction. Suppose that a shift/reduce conflict occurs in G's LALR(1) construction. Prove that G's LR(1) construction also contains a shift/reduce conflict.