check-cfg-ambiguity: Checks context free grammar for ambiguity using brute force up to given limit
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.
See also: https://mail.haskell.org/pipermail/haskell-cafe/2021-May/134006.html
You don't need to be registered on SourceHut to create bug report.
If you think that this software is not needed or existing software already subsumes its functionality, please, tell me that, I will not be offended.
[Skip to Readme]
Downloads
- check-cfg-ambiguity-0.1.1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 0.0.0.1, 0.0.0.2, 0.1.0.0, 0.1.1.0 (info) |
---|---|
Change log | ChangeLog |
Dependencies | base (>=4.13.0.0 && <=4.19.1.0), containers (>=0.6.2.1 && <=0.6.8) [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 2024-06-02T14:32:27Z |
Distributions | |
Downloads | 396 total (10 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] All reported builds failed as of 2024-06-02 [all 1 reports] |