infix: Infix expression re-parsing (for HsParser library)
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.
| Versions [faq] | 0.1, 0.1.1 |
|---|---|
| Dependencies | base, containers, haskell-src [details] |
| License | LicenseRef-GPL |
| Author | Bernie Pope <bjpop@csse.unimelb.edu.au> |
| Maintainer | none |
| Category | Parsing |
| Home page | http://www.cs.mu.oz.au/~bjpop/code.html |
| Uploaded | by GwernBranwen at Wed Mar 5 22:44:34 UTC 2008 |
| Distributions | NixOS:0.1.1 |
| Downloads | 1051 total (20 in the last 30 days) |
| Rating | (no votes yet) [estimated by rule of succession] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |
Downloads
- infix-0.1.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)