replace-attoparsec
Earley
replace-attoparsec | Earley | |
---|---|---|
- | 1 | |
14 | 361 | |
- | - | |
2.3 | 3.9 | |
11 months ago | 12 months ago | |
Haskell | Haskell | |
BSD 2-clause "Simplified" 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.
replace-attoparsec
We haven't tracked posts mentioning replace-attoparsec 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?
replace-megaparsec - Stream editing with Haskell Megaparsec parsers
parsec - A monadic parser combinator library
descriptive
parser-combinators - Lightweight package providing commonly useful parser combinators
tptp - Parser and pretty printer for the TPTP language
parsers - Generic parser combinators
attoparsec-base64 - Subset of the Text or ByteString character sets, restricted to base64 encodings
parsec-permutation
rere - recursive regular expressions
antlrc - Haskell binding to the ANTLR parser generator C runtime library http://www.antlr.org/wiki/display/ANTLR3/ANTLR3+Code+Generation+-+C
megaparsec - Industrial-strength monadic parser combinator library