Copyright | (c) Niklas Broberg 2004 |
---|---|
License | BSD-style (see the file LICENSE.txt) |
Maintainer | Niklas Broberg, d00nibro@dtek.chalmers.se |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Functions that simulate the behavior of regular patterns using a Match monad for parsing lists.
Synopsis
- data Match e a
- runMatch :: Match e a -> [e] -> Maybe a
- baseMatch :: (a -> Maybe b) -> Match a (a, b)
- manyMatch :: Match e a -> Match e [a]
- gManyMatch :: Match e a -> Match e [a]
- foldComp :: [[a] -> [a]] -> [a] -> [a]
- unzip0 :: [()] -> ()
- unzip1 :: [a] -> [a]
- unzip2 :: [(a, b)] -> ([a], [b])
- unzip3 :: [(a, b, c)] -> ([a], [b], [c])
- unzip4 :: [(a, b, c, d)] -> ([a], [b], [c], [d])
- unzip5 :: [(a, b, c, d, e)] -> ([a], [b], [c], [d], [e])
- unzip6 :: [(a, b, c, d, e, f)] -> ([a], [b], [c], [d], [e], [f])
- unzip7 :: [(a, b, c, d, e, f, g)] -> ([a], [b], [c], [d], [e], [f], [g])
- (+++) :: Match e a -> Match e a -> Match e a
Documentation
The Match monad
gManyMatch :: Match e a -> Match e [a] Source #