reorder-expression

Reorder expressions in a syntax tree according to operator fixities.

https://github.com/1Computer1/reorder-expression

LTS Haskell 23.7:0.1.0.2
Stackage Nightly 2025-02-05:0.1.0.2
Latest on Hackage:0.1.0.2

See all snapshots reorder-expression appears in

MIT licensed by comp
Maintained by [email protected]
This version can be pinned in stack with:reorder-expression-0.1.0.2@sha256:aee0898723246420c713bf0806d63e4b067169289cb595a2e186cda4da970cf9,1842

Module documentation for 0.1.0.2

Depends on 1 package(full list with versions):

reorder-expression

License MIT Hackage

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.

Changes

Changelog for reorder-expression

0.1.0.2

  • Updated for GHC 9.10.

0.1.0.1

  • Updated for GHC 9.4, 9.6, 9.8.

0.1.0.0

  • Initial release.