incremental-parser
Haskell parsing combinator liibrary that can be fed the input and emit the parsed output incrementally (by blamario)
Earley
Parsing all context-free grammars using Earley's algorithm in Haskell. (by ollef)
incremental-parser | Earley | |
---|---|---|
- | 1 | |
21 | 361 | |
- | - | |
5.3 | 3.9 | |
5 months ago | 12 months ago | |
Haskell | Haskell | |
GNU General Public License v3.0 only | 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.
incremental-parser
Posts with mentions or reviews of incremental-parser.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning incremental-parser 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 incremental-parser and Earley you can also consider the following projects:
ping-parser-attoparsec - Attoparsec parser for the output of the ping utility
parsec - A monadic parser combinator library
megaparsec - Industrial-strength monadic parser combinator library
parser-combinators - Lightweight package providing commonly useful parser combinators
attoparsec - A fast Haskell library for parsing ByteStrings
parsers - Generic parser combinators
unparse-attoparsec - An attoparsec roundtrip
parsec-permutation
rere - recursive regular expressions
uulib - The UUlib libraries
incremental-parser vs ping-parser-attoparsec
Earley vs parsec
incremental-parser vs megaparsec
Earley vs parser-combinators
incremental-parser vs attoparsec
Earley vs parsers
incremental-parser vs unparse-attoparsec
Earley vs parsec-permutation
incremental-parser vs parser-combinators
Earley vs rere
incremental-parser vs uulib
Earley vs megaparsec