@hackage gll0.4.1.2
GLL parser with simple combinator interface
Categories
License
BSD-3-Clause
Maintainer
L. Thomas van Binsbergen <ltvanbinsbergen@acm.org>
Links
- Homepage
- Documentation
- No source repository
- Changelog
- Security
Versions
Installation
Tested Compilers
Dependencies (7)
- array >=0.5 && <0.6
- base >=4.3.1.0 && <6
- containers >=0.4 && <0.9
- pretty >=1.1 && <1.2
- regex-applicative >=0.3 && <0.4
- text >=2 && <3 Show all…
Dependents (6)
@hackage/fungll-combinators, @hackage/funcons-lambda-cbv-mp, @hackage/acme-everything, @hackage/funcons-tools, @hackage/funcons-intgen, @hackage/eflint
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.