parsec-permutation
Earley
| parsec-permutation | Earley | |
|---|---|---|
| - | 1 | |
| 3 | 361 | |
| - | - | |
| 0.0 | 3.9 | |
| about 11 years ago | 12 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
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.
parsec-permutation
We haven't tracked posts mentioning parsec-permutation yet.
Tracking mentions began in Dec 2020.
Earley
-
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?
parsec-parsers - Orphan instances so you can use `parsers` with `parsec`.
parsec - A monadic parser combinator library
record-syntax - A library for parsing and processing the Haskell syntax sprinkled with anonymous records
parser-combinators - Lightweight package providing commonly useful parser combinators
parsers - Generic parser combinators
parsec-free
rere - recursive regular expressions
parsec-numeric
megaparsec - Industrial-strength monadic parser combinator library
trifecta - Parser combinators with highlighting, slicing, layout, literate comments, Clang-style diagnostics and the kitchen sink
megalisp - megalisp is a compliant lisp parser written in megaparsec