infix

Infix expression re-parsing (for HsParser library)

http://www.cs.mu.oz.au/~bjpop/code.html

Latest on Hackage:

0.1.1

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

LicenseRef-GPL licensed by Bernie Pope

Maintained by None

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.