gll: GLL parser with simple combinator interface

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]

Warnings:

The package gll provides generalised top-down parsing according to the (R)GLL parsing algorithm [Scott and Johnstone 2016].

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.

Properties

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, 0.4.0.13, 0.4.0.13
Change log changelog.txt
Dependencies array, base (>=4.3.1.0 && <=5), containers (>=0.4), pretty, regex-applicative (>=0.3), text, time (>=1.8), TypeCompose [details]
License BSD-3-Clause
Copyright Copyright (C) 2015-2020 L. Thomas van Binsbergen
Author L. Thomas van Binsbergen
Maintainer L. Thomas van Binsbergen <ltvanbinsbergen@acm.org>
Category Compilers
Uploaded by ltvanbinsbergen at 2020-05-03T12:15:31Z

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees