homepage: ''
changelog-type: ''
hash: c04271c04e53b0b246149cc210fd1a8883f3f4da932058f5fa98cf8febd58133
test-bench-deps:
  test-framework-hunit: ==0.3.0.2
  test-framework: ==0.8.2.0
  base: ^>=4.15.1.0
  HUnit: ==1.6.2.0
  containers: '>=0.6.4 && <0.7'
  aasam: -any
maintainer: mobotsar@protonmail.com
synopsis: Convert distfix precedence grammars to unambiguous context-free grammars.
changelog: ''
basic-deps:
  base: ^>=4.15.1.0
  containers: '>=0.6.4 && <0.7'
all-versions:
- 0.1.0.0
author: Alexander Lucas
latest: 0.1.0.0
description-type: markdown
description: "# aasam\r\n\r\nThis project is a fully-extended implementation of the
  algorithm ℳ from Annika Aasa's \"Precedences in specifications and implementations
  of programming languages\". It provides an interface for converting distfix (mixfix)
  precedence grammars into unambiguous context-free grammars.\r\n"
license-name: Apache-2.0

homepage: ''
changelog-type: ''
hash: c4ee0e34f428292451f4f297a9d03a043981b0bb5876de50918b4c98923c00f5
test-bench-deps:
  test-framework-hunit: ==0.3.0.2
  test-framework: ==0.8.2.0
  base: ^>=4.15.1.0
  text: '>=1.2.5 && <1.3'
  HUnit: ==1.6.2.0
  containers: '>=0.6.4 && <0.7'
  aasam: -any
maintainer: mobotsar@protonmail.com
synopsis: Convert distfix precedence grammars to unambiguous context-free grammars.
changelog: ''
basic-deps:
  base: ^>=4.15.1.0
  text: '>=1.2.5 && <1.3'
  containers: '>=0.6.4 && <0.7'
all-versions:
- 0.1.0.0
- 0.2.0.0
author: Alexander Lucas
latest: 0.2.0.0
description-type: markdown
description: |
  # aasam

  This project is a fully-extended implementation of the algorithm ℳ from Annika Aasa's "Precedences in specifications and implementations of programming languages". It provides an interface for converting distfix (mixfix) precedence grammars into unambiguous context-free grammars.
license-name: Apache-2.0

Update from Hackage at 2022-08-18T02:50:27Z
Update from Hackage at 2022-08-18T02:50:27Z
