Which of the following is true with respect to LR parsers?
S1 : LR(1) requires less space for its parsing table
S2 : LALR(1) requires less space for its parsing table
S3 : SLR(1) requires more space for its parsing table
Answer given : S1 - false, S2 - true, S3 - false
We know SLR(1) and LALR(1) have equal number of states in their parsing tables. Then how will LALR(1) require less space than SLR(1) ?