reorder-expression: Reorder expressions in a syntax tree according to operator fixities.
A library for reordering expressions in a syntax tree generically according to operator associativity and precedence. This is useful for languages with custom operators which require reordering expressions after collecting their fixities.
[Skip to Readme]
Downloads
- reorder-expression-0.1.0.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1.0.0, 0.1.0.1, 0.1.0.2 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | base (>=4.12 && <4.21) [details] |
| Tested with | ghc ==9.2.8, ghc ==9.4.8, ghc ==9.6.6, ghc ==9.8.4, ghc ==9.10.1 |
| License | MIT |
| Copyright | (c) 2021- comp |
| Author | comp |
| Maintainer | onecomputer00@gmail.com |
| Category | Language |
| Home page | https://github.com/1Computer1/reorder-expression |
| Bug tracker | https://github.com/1Computer1/reorder-expression/issues |
| Source repo | head: git clone git@github.com:1Computer1/reorder-expression.git |
| Uploaded | by comp at 2024-12-10T04:56:07Z |
| Distributions | LTSHaskell:0.1.0.2, Stackage:0.1.0.2 |
| Downloads | 391 total (21 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] |
Readme for reorder-expression-0.1.0.2
[back to package description]reorder-expression
A library for reordering expressions in a syntax tree generically according to operator associativity and precedence. This is useful for languages with custom operators which require reordering expressions after collecting their fixities.
Supports:
- Any syntax tree data type, e.g. source position-annotated ones.
- Postfix, prefix, and infix operators, with any arity.
- Left, right, and non-associative operators and precedence with doubles.
See documentation for an example.