rere
recursive regular expressions (by phadej)
Earley
Parsing all context-free grammars using Earley's algorithm in Haskell. (by ollef)
| rere | Earley | |
|---|---|---|
| - | 1 | |
| 4 | 361 | |
| - | - | |
| 2.7 | 3.9 | |
| 3 months ago | 12 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
rere
Posts with mentions or reviews of rere.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning rere yet.
Tracking mentions began in Dec 2020.
Earley
Posts with mentions or reviews of Earley.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-04-08.
-
Why is Haskell considered good for writing a Compiler/Interpreter?
It is not nearly as annoying to left-factor parser combinators than it is to left factor CFGs, you just need to use appropriate combinators like chainl and chainr. And you'd want to abstract over common patterns in your CFG anyway, that is a strength of parser combinators! Compare this Earley example and my parser combinator example below.
What are some alternatives?
When comparing rere and Earley you can also consider the following projects:
inchworm - Simple parser combinators for lexical analysis.
parsec - A monadic parser combinator library
diff-parse - Haskell diff file parsing library
parser-combinators - Lightweight package providing commonly useful parser combinators
cron - Cron data structure and parser for Haskell
parsers - Generic parser combinators
trifecta - Parser combinators with highlighting, slicing, layout, literate comments, Clang-style diagnostics and the kitchen sink
parsec-permutation
pipes-aeson
megaparsec - Industrial-strength monadic parser combinator library
pipes-attoparsec - Utilities to convert a parser into a pipe