- LAC is a new mechanism within the parsing algorithm that completely
- solves these problems for canonical LR, IELR, and LALR without
- sacrificing %nonassoc, default reductions, or state mering. When
- LAC is in use, canonical LR and IELR behave exactly the same for
- both syntactically acceptable and syntactically unacceptable input.
+ LAC is a new mechanism within the parsing algorithm that solves
+ these problems for canonical LR, IELR, and LALR without sacrificing
+ %nonassoc, default reductions, or state merging. When LAC is in
+ use, canonical LR and IELR behave almost exactly the same for both
+ syntactically acceptable and syntactically unacceptable input.