parser-combinators
Lightweight package providing commonly useful parser combinators (by mrkkrp)
Earley
Parsing all context-free grammars using Earley's algorithm in Haskell. (by ollef)
Our great sponsors
parser-combinators | Earley | |
---|---|---|
- | 1 | |
51 | 361 | |
- | - | |
5.5 | 3.9 | |
about 1 month 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.
parser-combinators
Posts with mentions or reviews of parser-combinators.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning parser-combinators 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 parser-combinators and Earley you can also consider the following projects:
parsec - A monadic parser combinator library
syntactical - Haskell library for distfix expression parsing
parsers - Generic parser combinators
attoparsec - A fast Haskell library for parsing ByteStrings
parsec-permutation
parsec-parsers - Orphan instances so you can use `parsers` with `parsec`.
rere - recursive regular expressions
megaparsec - Industrial-strength monadic parser combinator library
trifecta - Parser combinators with highlighting, slicing, layout, literate comments, Clang-style diagnostics and the kitchen sink
parser-combinators vs parsec
Earley vs parsec
parser-combinators vs syntactical
Earley vs parsers
parser-combinators vs attoparsec
Earley vs parsec-permutation
parser-combinators vs parsec-parsers
Earley vs rere
parser-combinators vs parsers
Earley vs megaparsec
parser-combinators vs megaparsec
Earley vs trifecta