GLL.Combinators.BinInterface

Documentation

type Parser a = (Visit1, Visit2, Visit3 a)

parse :: Parser a -> [Token] -> [a]

The semantic results of a parser, given a token string

parseString :: Parser a -> [Char] -> [a]

Parse a given string of characters

char :: Char -> Parser Char

A parser that recognises a given character

token :: Token -> Parser Token

A parser that recognises a given token

data Token

Constructors

Char Char

EOS

Epsilon

Int (Maybe Int)

Bool (Maybe Bool)

String (Maybe String)

Token String (Maybe String)

Instances

Eq Token

Ord Token

Show Token

epsilon :: Parser ()

A parser that always succeeds (and returns unit)

satisfy :: Ord a => a -> Parser a

A parser that always succeeds and returns a given value

many :: Ord a => Parser a -> Parser [a]

Apply the given parser many times, 0 or more times (Kleene closure)

some :: Ord a => Parser a -> Parser [a]

Apply the given parser some times, 1 or more times (positive closure)

optional :: Ord a => Parser a -> Parser (Maybe a)

Optionally use the given parser

(<::=>) :: String -> Parser a -> Parser a infixl 3

use ::= to enforce using parse context (to handle left-recursion)

(<:=>) :: String -> Parser a -> Parser a infixl 3

useful for non-recursive definitions (only internally)

(<$>) :: (Ord b, Ord a) => (a -> b) -> Parser a -> Parser b infixl 5

Application of a semantic action.

(<$) :: (Ord a, Ord b) => a -> Parser b -> Parser a infixl 5

Ignore all results and just return the given value

(<*>) :: (Ord a, Ord b) => Parser a -> Parser b -> Parser (a, b) infixl 6

Sequence two parsers, the results of the two parsers are tupled.

(*>) :: (Ord a, Ord b) => Parser a -> Parser b -> Parser b infixl 6

Sequencing, ignoring the result to the left

(<*) :: (Ord a, Ord b) => Parser a -> Parser b -> Parser a infixl 6

Sequencing, ignoring the result to the right

(<|>) :: Ord a => Parser a -> Parser a -> Parser a infixl 4

A choice between two parsers, results of the two are concatenated