Module Parser

Exported Datatypes

Exported Functions

(<|>) :: ([a] -> [a]) -> ([a] -> [a]) -> [a] -> [a]   

Combines two parsers without representation in an alternative manner.

Further infos:

• defined as right-associative infix operator with precedence 2

(<||>) :: (a -> [b] -> [b]) -> (a -> [b] -> [b]) -> a -> [b] -> [b]   

Combines two parsers with representation in an alternative manner.

Further infos:

• defined as right-associative infix operator with precedence 2

(<*>) :: Data a => ([a] -> [a]) -> ([a] -> [a]) -> [a] -> [a]   

Combines two parsers (with or without representation) in a sequential manner.

Further infos:

• defined as right-associative infix operator with precedence 4

(>>>) :: (Data a, Data b) => ([a] -> [a]) -> b -> b -> [a] -> [a]   

Attaches a representation to a parser without representation.

Further infos:

• defined as right-associative infix operator with precedence 3

empty :: [a] -> [a]   

The empty parser which recognizes the empty word.

Further infos:

• solution complete, i.e., able to compute all solutions

terminal :: Data a => a -> [a] -> [a]   

A parser recognizing a particular terminal symbol.

Further infos:

• partially defined

satisfy :: Data a => (a -> Bool) -> a -> [a] -> [a]   

A parser (with representation) recognizing a terminal satisfying a given predicate.

Further infos:

• partially defined

star :: (Data b, Data a) => (a -> [b] -> [b]) -> [a] -> [b] -> [b]   

A star combinator for parsers. The returned parser repeats zero or more times a parser p with representation and returns the representation of all parsers in a list.

some :: (Data b, Data a) => (a -> [b] -> [b]) -> [a] -> [b] -> [b]   

A some combinator for parsers. The returned parser repeats the argument parser (with representation) at least once.