parser-combinators
Lightweight package providing commonly useful parser combinators (by mrkkrp)
parsec
A monadic parser combinator library (by haskell)
Our great sponsors
parser-combinators | parsec | |
---|---|---|
- | 12 | |
51 | 831 | |
- | -0.1% | |
5.5 | 4.7 | |
about 1 month ago | 24 days ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | BSD 2-clause "Simplified" 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.
parser-combinators
Posts with mentions or reviews of parser-combinators.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning parser-combinators yet.
Tracking mentions began in Dec 2020.
parsec
Posts with mentions or reviews of parsec.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2024-01-15.
-
Revisiting Haskell after 10 years
Writing Haskell programs that rely on third-party packages is still an issue when it’s a not actively maintained package. They get out of date with the base library (Haskell’s standard library), and you might see yourself in a situation where you need to downgrade to an older version. This is not exclusive to Haskell, but it happens more often than I’d like to assume. However, if you only rely on known well-maintained libraries/frameworks such as Aeson, Squeleto, Yesod, and Parsec, to name a few, it’s unlikely you will face troubles at all, you just need to be more mindful of what you add as a dependency. There’s stackage.org now, a repository that works with Stack, providing a set of packages that are proven to work well together and help us to have reproducible builds in a more manageable way—not the solution for all the cases but it’s good to have it as an option.
- Show HN: I wrote a RDBMS (SQLite clone) from scratch in pure Python
-
Just write the f*****g parser.
The Parsec library for Haskell uses combinators, and there are a few good resources around the internet which explore it, if you know Haskell.
-
Summing polynomials in Haskell
Parse the expression using parsec library ( if you're unfamiliar with it please check out https://hackage.haskell.org/package/parsec) it's a strong library for parer combinators. Once you parse the expression u need to define and sum up the similar terms. Check this example out - https://fpunfold.com/2020/05/18/making-a-calculator-in-haskell-with-parsec.html
-
Konbini: a new multiplatform parser library
Konbini is a functional parser combinator library inspired by Haskell parsing libraries like Parsec. It's (hopefully) fairly easy to use, and is about as performant as the better-parse library. In fact, it's quite similar to better-parse in many aspects. The main difference is in how parsers are composed. Where better-parse prefers operators and infix functions, Konbini instead uses plain functions.
-
Traverse/mapM for Computation Expressions
Hi everyone, I'm learning F# and currently trying to do a Parsec-like CE, just to get comfortable with computation expressions.
- Is there good introduction to the parsec library for newbies?
-
On a daily base in this sub
good libraries for parsing: parsec, attoparsec etc.
-
Unity to acquire Parsec for $320m
Thank you! When I read the title I only knew about https://hackage.haskell.org/package/parsec, and for a moment I was very confused…
-
Splitting html tags string into list of string
The more "idiomatic" way would be to use a parser library, e.g. parsec, attoparsec, or megaparsec. But even then I think it would be a lot easier to maintain if you could preserve the angle brackets <> in the input.
What are some alternatives?
When comparing parser-combinators and parsec you can also consider the following projects:
Earley - Parsing all context-free grammars using Earley's algorithm in Haskell.
rustdesk - An open-source remote desktop, and alternative to TeamViewer.
syntactical - Haskell library for distfix expression parsing
Sunshine - Self-hosted game stream host for Moonlight.
attoparsec - A fast Haskell library for parsing ByteStrings
megaparsec - Industrial-strength monadic parser combinator library
parsec-parsers - Orphan instances so you can use `parsers` with `parsec`.
sunshine - Host for Moonlight Streaming Client
parsers - Generic parser combinators
parser-combinators vs Earley
parsec vs rustdesk
parser-combinators vs syntactical
parsec vs Sunshine
parser-combinators vs attoparsec
parsec vs megaparsec
parser-combinators vs parsec-parsers
parsec vs sunshine
parser-combinators vs parsers
parsec vs attoparsec
parser-combinators vs megaparsec
parsec vs parsec-parsers