parser-combinators
parser-combinators copied to clipboard
mrkkrp
Lightweight package providing commonly useful parser combinators
Bumps [actions/cache](https://github.com/actions/cache) from 4.0.0 to 4.0.2. Release notes Sourced from actions/cache's releases. v4.0.2 What's Changed Fix fail-on-cache-miss not working by @cdce8p in actions/cache#1327 Full Changelog: https://github.com/actions/cache/compare/v4.0.1...v4.0.2 v4.0.1 What's Changed Update...
![dependabot[bot] avatar](https://avatars.githubusercontent.com/in/29110?v=4 "dependabot[bot] avatar"){kind=avatar}
Hi! may you consider adding `manyEndingWith` (name subject to change)? The code would be like: ```haskell -- copy paste from manyTill_. It takes a parser p and a finalizer end....
Main.hs: ```haskell import Text.Earley import Control.Applicative.Combinators main :: IO () main = print $ fullParses (parser grammar) "a;a" grammar :: Grammar r (Prod r () Char String) grammar = return...
Hi ! Is it possible to add the `chainl`, `chainl1`, `chainr`, `chainr1` combinators ? Although `Control.Monad.Combinators.Expr` does exists, it feels overkill to use when there's only one layer to the...
Would be nice to have something like this. @recursion-ninja do you think this makes sense? ```haskell manyPerm :: Functor m => m a -> Permutation m [a] manyPerm parser =...
Thanks for the library! I was looking for something like sepBy but requiring an exact number of separated elements. If it's not here yet, maybe it could be added: ```haskell...
I'm running in to trouble with makeExprParser. I would like to conditionally return an error if something in an operator is wrong. I am making an assign operator, and the...
