reorder-expression: Reorder expressions in a syntax tree according to operator fixities.

[ language, library, mit ] [ Propose Tags ]

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.


[Skip to Readme]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.1.0.1
Change log CHANGELOG.md
Dependencies base (>=4.12 && <4.20) [details]
License MIT
Copyright (c) 2021- comp
Author comp
Maintainer onecomputer00@gmail.com
Category Language
Home page https://github.com/1Computer1/reorder-expression
Bug tracker https://github.com/1Computer1/reorder-expression/issues
Source repo head: git clone git@github.com:1Computer1/reorder-expression.git
Uploaded by comp at 2023-12-26T15:02:51Z
Distributions Stackage:0.1.0.1
Downloads 330 total (9 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for reorder-expression-0.1.0.1

[back to package description]

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.