derp: Derivative Parsing

[ bsd3, library, parsing ] [ Propose Tags ]

A parser based on derivatives of parser combinators (Might and Darais). Our paper on Arxiv details the theory of parsing with derivatives: http://arxiv.org/abs/1010.5023. This implementation uses my latest work on the theory that brings the O(n*|G|^2) complexity bound to O(n) for parsing most not-painfully-ambiguous grammars. (|G| would be the size of the initial grammar, n would be size of the input. These bounds are based off of observation and intuition; they are not proven yet.) This implementation will not terminate if the resulting parse forest is infinite. We know how to extend the implementation to work for infinite parse forests with little effort. If this is something you would like to see, send me an email.

Versions 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.1.5, 0.1.6
Dependencies base (<5), containers [details]
License BSD-3-Clause
Author David Darais
Maintainer david.darais@gmail.com
Category Parsing
Uploaded by DavidDarais at Wed Mar 28 02:06:30 UTC 2012
Distributions NixOS:0.1.6
Downloads 2463 total (13 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees