reorder-expression
Reorder expressions in a syntax tree according to operator fixities.
https://github.com/1Computer1/reorder-expression
| Version on this page: | 0.1.0.1 |
| LTS Haskell 23.1: | 0.1.0.2 |
| Stackage Nightly 2024-12-22: | 0.1.0.2 |
| Latest on Hackage: | 0.1.0.2 |
Maintained by [email protected]
This version can be pinned in stack with:
reorder-expression-0.1.0.1@sha256:07c4ad69e98868d5d0a695079a5bed3d5c549a54b6a1f9245fb1e913d754768a,1893Module documentation for 0.1.0.1
- Expression
Depends on 1 package(full list with versions):
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.