The Haskell parser does not consider the fixity of operators when parsing infix applications. All infix applications are thus parsed as if the operators were all left associative with the same precedence. This module contains code for re-parsing infix applications taking into account the fixity of operators. The important algorithm is the well known operator precedence parsing algorithm. See comments in the code for more detailed information.
Commercial Use
Modify
Distribute
Place Warranty
Sub-License
Hold Liable
Distribute Original
Disclose Source
Include Copyright
State Changes
Include License
These details are provided for information only. No information here is legal advice and should not be used as such.