infix: Infix expression re-parsing (for HsParser library)

[ library, parsing ] [ Propose Tags ]

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.




Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 0.1, 0.1.1
Dependencies base, containers, haskell-src [details]
License LicenseRef-GPL
Author Bernie Pope <>
Maintainer none
Category Parsing
Home page
Uploaded by GwernBranwen at 2008-03-05T22:44:34Z
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 1801 total (5 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]