unparse-attoparsec
An attoparsec roundtrip (by Lysxia)
Earley
Parsing all context-free grammars using Earley's algorithm in Haskell. (by ollef)
Our great sponsors
| unparse-attoparsec | Earley | |
|---|---|---|
| - | 1 | |
| 16 | 361 | |
| - | - | |
| 0.0 | 3.9 | |
| about 4 years ago | 12 months ago | |
| Haskell | Haskell | |
| MIT 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.
unparse-attoparsec
Posts with mentions or reviews of unparse-attoparsec.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning unparse-attoparsec 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 unparse-attoparsec and Earley you can also consider the following projects:
parser-combinators - Lightweight package providing commonly useful parser combinators
parsec - A monadic parser combinator library
uulib - The UUlib libraries
parsec-free
parsers - Generic parser combinators
incremental-parser - Haskell parsing combinator liibrary that can be fed the input and emit the parsed output incrementally
parsec-permutation
yoctoparsec - A truly tiny monadic parsing library
rere - recursive regular expressions
weighted-regexp - Regular Expression Matching in Haskell
megaparsec - Industrial-strength monadic parser combinator library
unparse-attoparsec vs parser-combinators
Earley vs parsec
unparse-attoparsec vs uulib
Earley vs parser-combinators
unparse-attoparsec vs parsec-free
Earley vs parsers
unparse-attoparsec vs incremental-parser
Earley vs parsec-permutation
unparse-attoparsec vs yoctoparsec
Earley vs rere
unparse-attoparsec vs weighted-regexp
Earley vs megaparsec