incremental-parser 0.2.5 → 0.2.5.1
raw patch · 2 files changed
+10/−2 lines, 2 filesdep ~tasty-quickcheckPVP ok
version bump matches the API change (PVP)
Dependency ranges changed: tasty-quickcheck
API changes (from Hackage documentation)
Files
- README.md +8/−0
- incremental-parser.cabal +2/−2
README.md view
@@ -10,8 +10,10 @@ In order to make the incremental parsing easier, the combinator set is optimized for monoidal results. Apart from the usual combinators `many` and `some`, for example, there are `concatMany` and `concatSome` operators. +```haskell many :: Parser s r -> Parser s [r] concatMany :: (Monoid s, Monoid r) => Parser s r -> Parser s r+``` #### Arbitrary monoidal inputs @@ -22,21 +24,27 @@ In Parsec: +```haskell string :: Stream s m Char => String -> ParsecT s u m String char :: Stream s m Char => Char -> ParsecT s u m Char anyToken :: (Stream s m t, Show t) => ParsecT s u m t+``` In Attoparsec: +```haskell string :: ByteString -> Parser ByteString word8 :: Word8 -> Parser Word8 anyWord8 :: Parser Word8+``` In incremental-parser and Picoparsec: +```haskell string :: (LeftCancellativeMonoid s, MonoidNull s) => s -> Parser s s token :: (Eq s, FactorialMonoid s) => s -> Parser s s anyToken :: FactorialMonoid s => Parser s s+``` #### Two `Alternative` alternatives
incremental-parser.cabal view
@@ -1,5 +1,5 @@ Name: incremental-parser-Version: 0.2.5+Version: 0.2.5.1 Cabal-Version: >= 1.10 Build-Type: Simple Synopsis: Generic parser library capable of providing partial results from partial input.@@ -38,7 +38,7 @@ Default-Language: Haskell2010 Build-Depends: base < 5, monoid-subclasses < 0.5, QuickCheck >= 2 && < 3, checkers >= 0.3.2 && < 0.5,- tasty >= 0.7 && < 0.12, tasty-quickcheck >= 0.7 && < 0.9+ tasty >= 0.7 && < 0.12, tasty-quickcheck >= 0.7 && < 1.0 Main-is: Test/TestIncrementalParser.hs Other-Modules: Text.ParserCombinators.Incremental, Text.ParserCombinators.Incremental.LeftBiasedLocal, Text.ParserCombinators.Incremental.Symmetric,