homepage: https://github.com/1Computer1/reorder-expression
changelog-type: markdown
hash: b35afe88205523e6fb31e0ae44c7f682912aabc23624535b4410eb4773c18dec
test-bench-deps:
  base: '>=4.12 && <4.17'
  hspec: '>=2.7 && <3'
  reorder-expression: -any
  parsec: '>=3.1 && <3.2'
  optics: '>=0.4 && <0.5'
maintainer: onecomputer00@gmail.com
synopsis: Reorder expressions in a syntax tree according to operator fixities.
changelog: |
  # Changelog for reorder-expression

  ## 0.1.0.0

  * Initial release.
basic-deps:
  base: '>=4.12 && <4.17'
all-versions:
- 0.1.0.0
author: comp
latest: 0.1.0.0
description-type: markdown
description: |
  # reorder-expression

  [![License MIT](https://img.shields.io/badge/license-MIT-blue.svg)](./LICENSE)
  [![Hackage](https://img.shields.io/hackage/v/reorder-expression.svg)](https://hackage.haskell.org/package/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.
license-name: MIT

Update from Hackage at 2021-04-26T17:41:31Z
Update from Hackage at 2021-04-26T17:41:31Z
