antlr-haskell alternatives and similar packages

Based on the "Library" category.
Alternatively, view antlr-haskell alternatives based on common mentions on social networks and blogs.

tensors

7.7 5.1 antlr-haskell VS tensors

Tensors in Haskell
c-mosquitto

6.6 0.0 antlr-haskell VS c-mosquitto

Simple Amazon IoT compatible client

InfluxDB - Power Real-Time Data Analytics at Scale

Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

Promo www.influxdata.com

boots

4.4 0.0 antlr-haskell VS boots

IoC Monad in Haskell.
byteunits

3.1 0.0 antlr-haskell VS byteunits

Human friendly conversion between byte units (KB, MB, GB...)
rfc

2.8 0.0 antlr-haskell VS rfc

Robert Fischer's Common library for Haskell
par-dual

2.8 0.0 antlr-haskell VS par-dual

:repeat: ParDual class for a Parallel <-> Sequential relationship
bglib

1.0 0.0 antlr-haskell VS bglib

Haskell implementation of serial communication with BLED112 dongle
cfenv

1.0 0.0 antlr-haskell VS cfenv

A Haskell port of https://github.com/cloudfoundry-community/go-cfenv
glider-nlp

- - antlr-haskell VS glider-nlp

Natural Language Processing library

Do you think we are missing an alternative of antlr-haskell or a related project?

Add another 'Library' Package

README

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.

More info can be found here: https://www.cronburg.com/2018/antlr-haskell-project/

Build instructions

The library can be built with:

stack build # stack version 2.3.3
stack test :simple

Or with cabal-3.0.1.0 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.