antlr-haskell: A Haskell implementation of the ANTLR top-down parser generator

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]

Please see the README on Github at https://github.com/cronburg/antlr-haskell#readme and https://www.cronburg.com/2018/antlr-haskell-project/.

[Skip to Readme]

Properties

Versions	0.1.0.0, 0.1.0.0, 0.1.0.1
Change log	ChangeLog.md
Dependencies	base (>=4.11 && <5), containers (>=0.6 && <0.7), deepseq (>=1.4 && <1.5), hashable (>=1.2 && <1.3), haskell-src-meta (>=0.8 && <0.9), mtl (>=2.2 && <2.3), template-haskell (>=2.14 && <2.15), text (>=1.2 && <1.3), th-lift (>=0.7.11 && <0.8), transformers (>=0.5 && <0.6), unordered-containers (>=0.2 && <0.3) [details]
License	BSD-3-Clause
Copyright	MIT
Author	Karl Cronburg & Matthew Ahrens
Maintainer	karl@cs.tufts.edu
Category	Library
Home page	https://github.com/cronburg/antlr-haskell#readme
Bug tracker	https://github.com/cronburg/antlr-haskell/issues
Source repo	head: git clone https://github.com/cronburg/antlr-haskell
Uploaded	by KarlCronburg at 2018-11-27T18:37:27Z

Modules

[Index] [Quick Jump]

Downloads

antlr-haskell-0.1.0.0.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

KarlCronburg

For package maintainers and hackage trustees

edit package information

Readme for antlr-haskell-0.1.0.0

[back to package description]

antlr-haskell

A Haskell implementation of ANTLR.

In implementing ANTLR we referenced the behavior of the original Java version (ANTLR4): The definitive ANTLR4 Reference. However we have taken much liberty in the design of this library compared to the workflow of the original Java version. In particular in implementing ANTLR for Haskell we have followed the following principles:

Parsing backends should be interchangeable
- GLR, LR, SLR, LL, ALL(*)
Code should be first class and declarative
- The implementation of G4 is metacircular
- Regular expressions are interpreted
Implement algorithms from first principles
- Set notation is used in implementing LL and LR algorithms.
- Pure functional implementations of parsing algorithms can eventually support embedding of arbitrary (including IO) actions without breaking the predictive parsing abstraction.

Build instructions

The library can be built with:

stack build # stack version 1.9.1.1
stack test antlr-haskell:simpl

Or with cabal-2.4.0.1 like:

cabal configure
cabal install --only-dependencies --enable-tests
cabal build
cabal test sexpression

sample grammar for ALL(*)

S -> Ac | Ad

A -> aA | b

ALL(*) Input/output examples

*Test.AllStarTests> parse ['a', 'b', 'c'] (NT 'S') atnEnv
(Just True, Node 'S' [Node 'A' [Leaf 'a', Node 'A' [Leaf 'b']], Leaf 'c'])

*Test.AllStarTests> parse ['b', 'd'] (NT 'S') atnEnv
(Just True, Node 'S' [Node 'A' [Leaf 'b'], Leaf 'd'])

*Test.AllStarTests> parse ['a', 'a', 'a', 'a', 'b', 'c'] (NT 'S') atnEnv
(Just True, Node 'S' [Node 'A' [Leaf 'a', Node 'A' [Leaf 'a', Node 'A' [Leaf 'a', Node 'A' [Leaf 'a', Node 'A' [Leaf 'b']]]]], Leaf 'c'])