gll: GLL parser with simple combinator interface

[ bsd3, compilers, library ] [ Propose Tags ]

The package gll provides generalised top-down parsing according to the GLL parsing algorithm [Scott and Johnstone 2010,2013].

The user can either invoke the GLL parser directly by importing GLL.Parser and providing a value of the Grammar datatype in (exported by GLL.Parser). Alternatively, the user can import GLL.Combinators to write combinator expressions from which a grammar of the required form is extracted. The combinators enable applying arbitrary semantic actions to parse results. The documentation of the respective packages provides more information.

The main motivation for this package is the development of Domain Specific Languages (DSLs). More specifically: designing DSLs with minimal differences between between abstract and concrete syntax (abstract syntax is often ambiguous).

Please email any questions, comments and suggestions to the maintainer.

Versions 0.1.0.0, 0.1.0.1, 0.2.0.0, 0.2.0.1, 0.2.0.2, 0.2.0.3, 0.3.0.0, 0.3.0.1, 0.3.0.6, 0.3.0.7, 0.3.0.9, 0.3.0.10, 0.4.0.2, 0.4.0.3, 0.4.0.4, 0.4.0.5, 0.4.0.11, 0.4.0.12 (info)
Dependencies array, base (>=4.3.1.0 && <=4.8.0.0), containers (>=0.4), pretty, TypeCompose [details]
License BSD-3-Clause
Copyright Copyright (C) 2015 L. Thomas van Binsbergen
Author L. Thomas van Binsbergen
Maintainer L. Thomas van Binsbergen <ltvanbinsbergen@acm.org>
Category Compilers
Uploaded by ltvanbinsbergen at Tue Sep 15 04:53:09 UTC 2015
Distributions NixOS:0.4.0.12
Downloads 4102 total (39 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2015-09-15 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees