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
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.
This Project has No vulnerabilities Reported Against it
Did You Know...
-
...
in 2016, 47% of companies did not have formal process in place to track OS code
-
...
learn about Open Hub updates and features on the Open Hub blog
-
...
55% of companies leverage OSS for production infrastructure
-
...
you can subscribe to e-mail newsletters to receive update from the Open Hub blog
