uulib-0.9.24: Haskell Utrecht Tools Library

Safe Haskell | None
Language | Haskell98

UU.Parsing.Interface

Contents

- Orphan instances

Synopsis

- data AnaParser state result s p a
- pWrap :: OutputState result => (forall r r''. (b -> r -> r'') -> state -> Steps (a, r) s p -> (state -> Steps r s p) -> (state, Steps r'' s p, state -> Steps r s p)) -> (forall r. state -> Steps r s p -> (state -> Steps r s p) -> (state, Steps r s p, state -> Steps r s p)) -> AnaParser state result s p a -> AnaParser state result s p b
- pMap :: OutputState result => (forall r r''. (b -> r -> r'') -> state -> Steps (a, r) s p -> (state, Steps r'' s p)) -> (forall r. state -> Steps r s p -> (state, Steps r s p)) -> AnaParser state result s p a -> AnaParser state result s p b
- module UU.Parsing.MachineInterface
- data Pair a r = Pair a r
- class (Applicative p, Alternative p, Functor p) => IsParser p s | p -> s where
  - pSucceed :: a -> p a
  - pLow :: a -> p a
  - pFail :: p a
  - pCostRange :: Int# -> s -> SymbolR s -> p s
  - pCostSym :: Int# -> s -> s -> p s
  - pSym :: s -> p s
  - pRange :: s -> SymbolR s -> p s
  - getfirsts :: p v -> Expecting s
  - setfirsts :: Expecting s -> p v -> p v
  - getzerop :: p v -> Maybe (p v)
  - getonep :: p v -> Maybe (p v)
- type Parser s = AnaParser [s] Pair s (Maybe s)
- pCost :: (OutputState out, InputState inp sym pos, Symbol sym, Ord sym) => Int# -> AnaParser inp out sym pos ()
- getInputState :: (InputState a c d, Symbol c, Ord c, OutputState b) => AnaParser a b c d a
- handleEof :: (InputState a s p, Symbol s) => a -> Steps (Pair a ()) s p
- parse :: (Symbol s, InputState inp s pos) => AnaParser inp Pair s pos a -> inp -> Steps (Pair a (Pair inp ())) s pos
- parseIOMessage :: (Symbol s, InputState inp s p) => (Message s p -> String) -> AnaParser inp Pair s p a -> inp -> IO a
- parseIOMessageN :: (Symbol s, InputState inp s p) => (Message s p -> String) -> Int -> AnaParser inp Pair s p a -> inp -> IO a
- evalStepsIO :: (Message s p -> String) -> Steps b s p -> IO b
- evalStepsIO' :: (Message s p -> String) -> Int -> Steps b s p -> IO b
- (<*>) :: Applicative f => f (a -> b) -> f a -> f b
- (<*) :: Applicative f => f a -> f b -> f a
- (*>) :: Applicative f => f a -> f b -> f b
- (<$>) :: Functor f => (a -> b) -> f a -> f b
- (<$) :: Functor f => a -> f b -> f a
- (<|>) :: Alternative f => f a -> f a -> f a

# Documentation

data AnaParser state result s p a Source #

#### Instances

Instances details

(Ord s, Symbol s, InputState state s p, OutputState result, Applicative (AnaParser state result s p)) => Functor (AnaParser state result s p) |
Instance details Defined in UU.Parsing.Interface Methods fmap :: (a -> b) -> AnaParser state result s p a -> AnaParser state result s p b (<$) :: a -> AnaParser state result s p b -> AnaParser state result s p a #
(Ord s, Symbol s, InputState state s p, OutputState result) => Applicative (AnaParser state result s p) |

Instance details

Defined in UU.Parsing.Interface

Methods

pure :: a -> AnaParser state result s p a

(<*>) :: AnaParser state result s p (a -> b) -> AnaParser state result s p a -> AnaParser state result s p b #

liftA2 :: (a -> b -> c) -> AnaParser state result s p a -> AnaParser state result s p b -> AnaParser state result s p c

(*>) :: AnaParser state result s p a -> AnaParser state result s p b -> AnaParser state result s p b #

(<*) :: AnaParser state result s p a -> AnaParser state result s p b -> AnaParser state result s p a #

(Ord s, Symbol s, InputState state s p, OutputState result) => Alternative (AnaParser state result s p) |
Instance details Defined in UU.Parsing.Interface Methods empty :: AnaParser state result s p a (<|>) :: AnaParser state result s p a -> AnaParser state result s p a -> AnaParser state result s p a # some :: AnaParser state result s p a -> AnaParser state result s p [a] many :: AnaParser state result s p a -> AnaParser state result s p [a]
(InputState inp s p, OutputState out) => StateParser (AnaParser (inp, st) out s p) st Source # |
Instance details Defined in UU.Parsing.StateParser Methods change :: (st -> st) -> AnaParser (inp, st) out s p st Source # set :: st -> AnaParser (inp, st) out s p st Source # get :: AnaParser (inp, st) out s p st Source #

(Ord s, Symbol s, InputState state s p, OutputState result) => IsParser (AnaParser state result s p) s Source #

The fast `AnaParser` instance of the `IsParser` class. Note that this requires a functioning `Ord` for the symbol type s, as tokens are often compared using the `compare` function in `Ord` rather than always using `==` rom `Eq`. The two do need to be consistent though, that is for any two `x1`, `x2` such that `x1 == x2` you must have `compare x1 x2 == EQ`.

Instance details

Defined in UU.Parsing.Interface

Methods

pSucceed :: a -> AnaParser state result s p a Source #

pLow :: a -> AnaParser state result s p a Source #

pFail :: AnaParser state result s p a Source #

pCostRange :: Int# -> s -> SymbolR s -> AnaParser state result s p s Source #

pCostSym :: Int# -> s -> s -> AnaParser state result s p s Source #

pSym :: s -> AnaParser state result s p s Source #

pRange :: s -> SymbolR s -> AnaParser state result s p s Source #

getfirsts :: AnaParser state result s p v -> Expecting s Source #

setfirsts :: Expecting s -> AnaParser state result s p v -> AnaParser state result s p v Source #

getzerop :: AnaParser state result s p v -> Maybe (AnaParser state result s p v) Source #

getonep :: AnaParser state result s p v -> Maybe (AnaParser state result s p v) Source #

pWrap :: OutputState result => (forall r r''. (b -> r -> r'') -> state -> Steps (a, r) s p -> (state -> Steps r s p) -> (state, Steps r'' s p, state -> Steps r s p)) -> (forall r. state -> Steps r s p -> (state -> Steps r s p) -> (state, Steps r s p, state -> Steps r s p)) -> AnaParser state result s p a -> AnaParser state result s p b Source #

pMap :: OutputState result => (forall r r''. (b -> r -> r'') -> state -> Steps (a, r) s p -> (state, Steps r'' s p)) -> (forall r. state -> Steps r s p -> (state, Steps r s p)) -> AnaParser state result s p a -> AnaParser state result s p b Source #

module UU.Parsing.MachineInterface

data Pair a r Source #

Constructors

Pair a r |

#### Instances

Instances details

OutputState Pair Source # |
Instance details Defined in UU.Parsing.Interface Methods acceptR :: v -> rest -> Pair v rest Source # nextR :: (a -> rest -> rest') -> (b -> a) -> Pair b rest -> rest' Source #

class (Applicative p, Alternative p, Functor p) => IsParser p s | p -> s where Source #

The `IsParser` class contains the base combinators with which to write parsers. A minimal complete instance definition consists of definitions for `(<*>)`, `(<|>)`, `pSucceed`, `pLow`, `pFail`, `pCostRange`, `pCostSym`, `getfirsts`, `setfirsts`, and `getzerop`. All operators available through `Applicative`, 'Functor", and `Alternative` have the same names suffixed with `:`.

Minimal complete definition

pLow, pCostRange, pCostSym, getfirsts, setfirsts, getzerop, getonep

Methods

pSucceed :: a -> p a Source #

Two variants of the parser for empty strings. `pSucceed` parses the empty string, and fully counts as an alternative parse. It returns the value passed to it.

pLow :: a -> p a Source #

`pLow` parses the empty string, but alternatives to pLow are always preferred over `pLow` parsing the empty string.

pFail :: p a Source #

This parser always fails, and never returns any value at all.

pCostRange :: Int# -> s -> SymbolR s -> p s Source #

Parses a range of symbols with an associated cost and the symbol to insert if no symbol in the range is present. Returns the actual symbol parsed.

pCostSym :: Int# -> s -> s -> p s Source #

Parses a symbol with an associated cost and the symbol to insert if the symbol to parse isn't present. Returns either the symbol parsed or the symbol inserted.

pSym :: s -> p s Source #

Parses a symbol. Returns the symbol parsed.

pRange :: s -> SymbolR s -> p s Source #

getfirsts :: p v -> Expecting s Source #

Get the firsts set from the parser, i.e. the symbols it expects.

setfirsts :: Expecting s -> p v -> p v Source #

Set the firsts set in the parser.

getzerop :: p v -> Maybe (p v) Source #

`getzerop` returns `Nothing` if the parser can not parse the empty string, and returns `Just p` with `p` a parser that parses the empty string and returns the appropriate value.

getonep :: p v -> Maybe (p v) Source #

`getonep` returns `Nothing` if the parser can only parse the empty string, and returns `Just p` with `p` a parser that does not parse any empty string.

#### Instances

Instances details

(Ord s, Symbol s, InputState state s p, OutputState result) => IsParser (AnaParser state result s p) s Source #

The fast `AnaParser` instance of the `IsParser` class. Note that this requires a functioning `Ord` for the symbol type s, as tokens are often compared using the `compare` function in `Ord` rather than always using `==` rom `Eq`. The two do need to be consistent though, that is for any two `x1`, `x2` such that `x1 == x2` you must have `compare x1 x2 == EQ`.

Instance details

Defined in UU.Parsing.Interface

Methods

pSucceed :: a -> AnaParser state result s p a Source #

pLow :: a -> AnaParser state result s p a Source #

pFail :: AnaParser state result s p a Source #

pCostRange :: Int# -> s -> SymbolR s -> AnaParser state result s p s Source #

pCostSym :: Int# -> s -> s -> AnaParser state result s p s Source #

pSym :: s -> AnaParser state result s p s Source #

pRange :: s -> SymbolR s -> AnaParser state result s p s Source #

getfirsts :: AnaParser state result s p v -> Expecting s Source #

setfirsts :: Expecting s -> AnaParser state result s p v -> AnaParser state result s p v Source #

getzerop :: AnaParser state result s p v -> Maybe (AnaParser state result s p v) Source #

getonep :: AnaParser state result s p v -> Maybe (AnaParser state result s p v) Source #

(Symbol s, Ord s, InputState i s p, OutputState o) => IsParser (OffsideParser i o s p) s Source # |

Instance details

Defined in UU.Parsing.Offside

Methods

pSucceed :: a -> OffsideParser i o s p a Source #

pLow :: a -> OffsideParser i o s p a Source #

pFail :: OffsideParser i o s p a Source #

pCostRange :: Int# -> s -> SymbolR s -> OffsideParser i o s p s Source #

pCostSym :: Int# -> s -> s -> OffsideParser i o s p s Source #

pSym :: s -> OffsideParser i o s p s Source #

pRange :: s -> SymbolR s -> OffsideParser i o s p s Source #

getfirsts :: OffsideParser i o s p v -> Expecting s Source #

setfirsts :: Expecting s -> OffsideParser i o s p v -> OffsideParser i o s p v Source #

getzerop :: OffsideParser i o s p v -> Maybe (OffsideParser i o s p v) Source #

getonep :: OffsideParser i o s p v -> Maybe (OffsideParser i o s p v) Source #

type Parser s = AnaParser [s] Pair s (Maybe s) Source #

pCost :: (OutputState out, InputState inp sym pos, Symbol sym, Ord sym) => Int# -> AnaParser inp out sym pos () Source #

getInputState :: (InputState a c d, Symbol c, Ord c, OutputState b) => AnaParser a b c d a Source #

handleEof :: (InputState a s p, Symbol s) => a -> Steps (Pair a ()) s p Source #

parse :: (Symbol s, InputState inp s pos) => AnaParser inp Pair s pos a -> inp -> Steps (Pair a (Pair inp ())) s pos Source #

parseIOMessage :: (Symbol s, InputState inp s p) => (Message s p -> String) -> AnaParser inp Pair s p a -> inp -> IO a Source #

parseIOMessageN :: (Symbol s, InputState inp s p) => (Message s p -> String) -> Int -> AnaParser inp Pair s p a -> inp -> IO a Source #

evalStepsIO :: (Message s p -> String) -> Steps b s p -> IO b Source #

evalStepsIO' :: (Message s p -> String) -> Int -> Steps b s p -> IO b Source #

(<*>) :: Applicative f => f (a -> b) -> f a -> f b #

(<*) :: Applicative f => f a -> f b -> f a #

(*>) :: Applicative f => f a -> f b -> f b #

(<$>) :: Functor f => (a -> b) -> f a -> f b #

(<$) :: Functor f => a -> f b -> f a #

(<|>) :: Alternative f => f a -> f a -> f a #

# Orphan instances

InputState [s] s (Maybe s) Source # |
Instance details Methods splitStateE :: [s] -> Either' [s] s Source # splitState :: [s] -> (# s, [s] #) Source # getPosition :: [s] -> Maybe s Source # reportError :: Message s (Maybe s) -> [s] -> [s] Source # insertSymbol :: s -> [s] -> [s] Source # deleteSymbol :: s -> [s] -> [s] Source #
(Ord s, Symbol s, InputState state s p, OutputState result, Applicative (AnaParser state result s p)) => Functor (AnaParser state result s p) Source # |
Instance details Methods fmap :: (a -> b) -> AnaParser state result s p a -> AnaParser state result s p b (<$) :: a -> AnaParser state result s p b -> AnaParser state result s p a #
(Ord s, Symbol s, InputState state s p, OutputState result) => Applicative (AnaParser state result s p) Source # |

Instance details

Methods

pure :: a -> AnaParser state result s p a

(<*>) :: AnaParser state result s p (a -> b) -> AnaParser state result s p a -> AnaParser state result s p b #

liftA2 :: (a -> b -> c) -> AnaParser state result s p a -> AnaParser state result s p b -> AnaParser state result s p c

(*>) :: AnaParser state result s p a -> AnaParser state result s p b -> AnaParser state result s p b #

(<*) :: AnaParser state result s p a -> AnaParser state result s p b -> AnaParser state result s p a #

(Ord s, Symbol s, InputState state s p, OutputState result) => Alternative (AnaParser state result s p) Source # |
Instance details Methods empty :: AnaParser state result s p a (<|>) :: AnaParser state result s p a -> AnaParser state result s p a -> AnaParser state result s p a # some :: AnaParser state result s p a -> AnaParser state result s p [a] many :: AnaParser state result s p a -> AnaParser state result s p [a]