MIT licensed by comp
Maintained by [email protected]
This version can be pinned in stack with:reorder-expression-0.1.0.1@sha256:07c4ad69e98868d5d0a695079a5bed3d5c549a54b6a1f9245fb1e913d754768a,1893

Module documentation for 0.1.0.1

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.0

  • Initial release.