Which parser class is strictly the MOST POWERFUL among deterministic bottom-up parsers?
CLR(1) maintains distinct lookaheads across all states without state merging, recognizing the entire class of LR(1) deterministic languages.
How does LALR(1) reduce the number of states compared to CLR(1)?
LALR(1) merges CLR(1) states with identical cores, compressing state space to match LR(0) state counts.
Can merging CLR(1) states with identical cores to create LALR(1) states introduce NEW Shift-Reduce conflicts?
Shift-reduce actions depend strictly on core item dot positions; merging identical cores never creates new shift-reduce conflicts.
Can merging CLR(1) states with identical cores to create LALR(1) states introduce NEW Reduce-Reduce conflicts?
Combining lookaheads from distinct merged CLR(1) states can create overlapping reduce lookahead sets.
What is the hierarchical power relation among bottom-up parser classes?
Grammar recognition coverage grows strictly from LR(0) up to Canonical LR(1).