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.0 |
| LTS Haskell 20.26: | 0.1.0.0 |
| Stackage Nightly 2024-04-19: | 0.1.0.1 |
| Latest on Hackage: | 0.1.0.1 |
Maintained by [email protected]
This version can be pinned in stack with:
reorder-expression-0.1.0.0@sha256:b35afe88205523e6fb31e0ae44c7f682912aabc23624535b4410eb4773c18dec,1795Module documentation for 0.1.0.0
- 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.