check-cfg-ambiguity: Checks context free grammar for ambiguity using brute force up to given limit

[ bsd3, library, parsing ] [ Propose Tags ]

Checks context free grammar for ambiguity using brute force up to given limit.

It is impossible to check arbitrary context free grammar for ambiguity on a Turing machine. So we provide you brute force algorithm up to a limit.

You can also use function "upTo" from package "Earley-0.13.0.1" for the same purpose, but it can freeze on infinitely ambiguous grammars: https://github.com/ollef/Earley/issues/54 . So I decided to write and publish this package.

You don't need to be registered on SourceHut to create bug report.


[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.0.0.1, 0.0.0.2, 0.1.0.0 (info)
Change log ChangeLog
Dependencies base (>=4.9.1 && <4.17), containers (>=0.5.7 && <0.7) [details]
License BSD-3-Clause
Author
Maintainer Askar Safin <safinaskar@mail.ru>
Category Parsing
Source repo head: git clone https://git.sr.ht/~safinaskar/check-cfg-ambiguity
Uploaded by safinaskar at 2021-05-23T22:50:42Z
Distributions
Downloads 278 total (16 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2021-05-23 [all 1 reports]

Readme for check-cfg-ambiguity-0.0.0.1

[back to package description]
See https://hackage.haskell.org/package/check-cfg-ambiguity

You don't need to be registered on SourceHut to create bug report