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

Module documentation for

Depends on 1 package(full list with versions):


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.


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


Changelog for reorder-expression

  • Initial release.