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

[ bsd3, library ] [ Propose Tags ]



  • Language
    • Language.ANTLR4
      • Boot
        • Language.ANTLR4.Boot.Quote
        • Language.ANTLR4.Boot.Syntax
      • Language.ANTLR4.FileOpener
      • Language.ANTLR4.G4
      • Language.ANTLR4.Syntax
  • Text
    • ANTLR
      • Text.ANTLR.Allstar
        • Text.ANTLR.Allstar.ATN
        • Text.ANTLR.Allstar.ParserGenerator
        • Text.ANTLR.Allstar.Stacks
      • Text.ANTLR.Grammar
      • Text.ANTLR.LL1
      • Text.ANTLR.LR
      • Text.ANTLR.Lex
        • Text.ANTLR.Lex.Automata
        • Text.ANTLR.Lex.DFA
        • Text.ANTLR.Lex.NFA
        • Text.ANTLR.Lex.Regex
        • Text.ANTLR.Lex.Tokenizer
      • Text.ANTLR.MultiMap
      • Text.ANTLR.Parser
      • Text.ANTLR.Pretty
      • Text.ANTLR.Set


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS],
Change log
Dependencies base (>=4.11 && <5), containers (>=0.6 && <0.7), deepseq (>=1.4 && <1.5), hashable (>=1.2 && <1.4), haskell-src-meta (>=0.8 && <0.9), mtl (>=2.2 && <2.3), template-haskell (>=2.14 && <2.16), text (>=1.2 && <1.3), th-lift (>=0.7.11 && <0.9), transformers (>=0.5 && <0.6), unordered-containers (>=0.2 && <0.3) [details]
License BSD-3-Clause
Copyright MIT
Author Karl Cronburg & Matthew Ahrens
Category Library
Home page
Bug tracker
Source repo head: git clone
Uploaded by KarlCronburg at 2020-09-25T04:36:06Z
Downloads 940 total (7 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for antlr-haskell-

[back to package description]


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.

More info can be found here:

Build instructions

The library can be built with:

stack build # stack version 2.3.3
stack test :simple

Or with cabal- like:

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

Here's a good one to run when making changes to the library, and you're unsure of what may become affected by those changes:

stack test :simple :atn :ll :lr :sexpression :allstar :c

And then compare the results with that of this upstream branch. Some of the GLR features (incremental and partial tokenization, notably) are still experimental, and so there are known test cases which currently fail.

Version History

  • September 25th, 2020. Released version bug fixes, documentation, and library versioning updates.