weighted-regexp
Regular Expression Matching in Haskell (by sebfisch)
Earley
Parsing all context-free grammars using Earley's algorithm in Haskell. (by ollef)
weighted-regexp | Earley | |
---|---|---|
- | 1 | |
34 | 361 | |
- | - | |
0.0 | 3.9 | |
over 6 years 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.
weighted-regexp
Posts with mentions or reviews of weighted-regexp.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning weighted-regexp 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 weighted-regexp and Earley you can also consider the following projects:
pipes-aeson
parsec - A monadic parser combinator library
data-stm32 - ARM SVD and CubeMX XML parser and pretty printer for STM32 family
parser-combinators - Lightweight package providing commonly useful parser combinators
trifecta - Parser combinators with highlighting, slicing, layout, literate comments, Clang-style diagnostics and the kitchen sink
parsers - Generic parser combinators
parsec-permutation
uulib - The UUlib libraries
rere - recursive regular expressions
descriptive
megaparsec - Industrial-strength monadic parser combinator library
weighted-regexp vs pipes-aeson
Earley vs parsec
weighted-regexp vs data-stm32
Earley vs parser-combinators
weighted-regexp vs trifecta
Earley vs parsers
weighted-regexp vs parser-combinators
Earley vs parsec-permutation
weighted-regexp vs uulib
Earley vs rere
weighted-regexp vs descriptive
Earley vs megaparsec