The APLR(1) Algorithm for Generating Compact LR(1) Parsers is Simpler and More Capable than IELR(1)
Summary
An in-depth comparison of LR(1) parser generation algorithms, introducing APLR(1) as a simpler yet more capable alternative to IELR(1). The article explains how APLR(1) produces compact parsers by remerging isomorphic subgraphs while preserving LR(1) adequacy, and presents experimental results across multiple grammars using the Hocc tool. It argues that APLR(1) is viable for most grammars with conflict resolution enabled, while outlining tradeoffs and implementation notes.