incremental-parser
This package defines yet another parser combinator library. This one is implemented using the concept of Brzozowski derivatives, tweaked and optimized to work with any monoidal input type. Lists, ByteString, and Text are supported out of the box, as well as any other data type for which the monoid-subclasses package defines instances. If the parser result is also a monoid, its chunks can be extracted incrementally, before the complete input is parsed.
Ecosystem
hackage.haskell.org
hackage.haskell.org
Latest Release
over 2 years ago
0.5.1
over 2 years ago
Versions
33
33
Downloads
21,855 total
21,855 total
Dependent Packages
1
1
Dependent Repos
147
147
Loading...
Readme
Loading...
Links
| Registry | hackage.haskell.org |
| Source | Repository |
| JSON API | View JSON |
| CodeMeta | codemeta.json |
Package Details
| PURL |
pkg:hackage/incremental-parser
spec |
| License | GPL-3.0-only |
| First Release | about 15 years ago |
| Last Synced | about 2 months ago |
Repository
| Stars | 23 on GitHub |
| Forks | 3 on GitHub |
| Commits | 118 |
| Committers | 7 |
| Avg per Author | 16.857 |
| DDS | 0.61 |
Rankings on hackage.haskell.org
Downloads
Top 7.3%
Dependent repos
Top 3.6%