The derp package

[Tags:bsd3, library]

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.

Properties

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 BSD3
Author David Darais
Maintainer david.darais@gmail.com
Stability Experimental
Category Parsing
Uploaded Sun Mar 6 19:58:42 UTC 2011 by DavidDarais
Distributions NixOS:0.1.6
Downloads 1398 total (17 in the last 30 days)
Votes
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees