attoparsec
A fast Haskell library for parsing ByteStrings (by haskell)
parser-combinators
Lightweight package providing commonly useful parser combinators (by mrkkrp)
Our great sponsors
| attoparsec | parser-combinators | |
|---|---|---|
| 6 | - | |
| 509 | 51 | |
| 0.6% | - | |
| 3.7 | 5.5 | |
| 7 days ago | about 1 month 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.
attoparsec
Posts with mentions or reviews of attoparsec.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-03-24.
-
Functional Implementation of a parser?
The basic idea is to create a state monad (usually using the State monad transformer) which contains a string to be parsed, and which also lifts other monad transformers like Except for throwing syntax errors. Or you can use a parser combinator like Parser provided by a parsing library like Megaparsec or Attoparsec that defines an efficient State+Except monad transformer combination for you.
-
Haskell - Important Libraries
attoparsec
-
On a daily base in this sub
good libraries for parsing: parsec, attoparsec etc.
- Parser Combinators in Haskell
-
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.
-
Ditch regex for parser combinators, a Rust / nom step-by-step guide
- https://hackage.haskell.org/package/attoparsec - https://hackage.haskell.org/package/megaparsec
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.
What are some alternatives?
When comparing attoparsec and parser-combinators you can also consider the following projects:
megaparsec - Industrial-strength monadic parser combinator library
Earley - Parsing all context-free grammars using Earley's algorithm in Haskell.
parsec - A monadic parser combinator library
attoparsec-parsec - An Attoparsec compatibility layer for Parsec
syntactical - Haskell library for distfix expression parsing
attoparsec-data - Parsers for the standard Haskell data types
parsec-parsers - Orphan instances so you can use `parsers` with `parsec`.
parsers - Generic parser combinators
trifecta - Parser combinators with highlighting, slicing, layout, literate comments, Clang-style diagnostics and the kitchen sink
attoparsec vs megaparsec
parser-combinators vs Earley
attoparsec vs parsec
parser-combinators vs parsec
attoparsec vs attoparsec-parsec
parser-combinators vs syntactical
attoparsec vs attoparsec-data
parser-combinators vs parsec-parsers
attoparsec vs parsers
parser-combinators vs parsers
attoparsec vs trifecta
parser-combinators vs megaparsec