Project Summary
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.
In a Nutshell, infix...
GNU General Public License v2.0 or later
Permitted
Commercial Use
Modify
Distribute
Place Warranty
Forbidden
Sub-License
Hold Liable
Required
Include Copyright
Include License
Distribute Original
Disclose Source
State Changes
These details are provided for information only. No information here is legal advice and should not be used as such.
This Project has No vulnerabilities Reported Against it
Did You Know...
-
...
Black Duck offers a free trial so you can discover if there are open source vulnerabilities in your code
-
...
anyone with an Open Hub account can update a project's tags
-
...
55% of companies leverage OSS for production infrastructure
-
...
data presented on the Open Hub is available through our API
