uulib-0.9.10: Haskell Utrecht Tools Library Source code Contents Index

UU.Parsing.MachineInterface

Synopsis

class InputState state s pos | state -> s, state -> pos where splitStateE :: state -> Either' state s splitState :: state -> (#s, state#) getPosition :: state -> pos reportError :: Message s pos -> state -> state insertSymbol :: s -> state -> state deleteSymbol :: s -> state -> state class OutputState r where acceptR :: v -> rest -> r v rest nextR :: (a -> rest -> rest') -> (b -> a) -> r b rest -> rest' class Symbol s where deleteCost :: s -> Int# symBefore :: s -> s symAfter :: s -> s data Either' state s = Left' !s state | Right' state data Steps val s p = forall a . OkVal (a -> val) (Steps a s p) | Ok { rest :: Steps val s p } | Cost { costing :: Int# rest :: Steps val s p } | StRepair { costing :: Int# m :: !(Message s p) rest :: Steps val s p } | Best (Steps val s p) (Steps val s p) (Steps val s p) | NoMoreSteps val data Action s = Insert s | Delete s | Other String val :: (a -> b) -> Steps a s p -> Steps b s p evalSteps :: Steps a s p -> a getMsgs :: Steps a s p -> [Message s p] data Message sym pos = Msg (Expecting sym) !pos (Action sym) data Expecting s = ESym (SymbolR s) | EStr String | EOr [Expecting s] | ESeq [Expecting s] data SymbolR s = Range !s !s | EmptyR

Documentation

class InputState state s pos | state -> s, state -> pos where Source

The InputState class contains the interface that the AnaParser parsers expect for the input. A minimal complete instance definition consists of splitStateE, splitState and getPosition. Methods splitStateE :: state -> Either' state s Source Splits the state in a strict variant of Either, with Left' if a symbol can be split off and Right' if none can splitState :: state -> (#s, state#) Source Splits the state in the first symbol and the remaining state getPosition :: state -> pos Source Gets the current position in the input reportError :: Message s pos -> state -> state Source Reports an error insertSymbol :: s -> state -> state Source Modify the state as the result of inserting a symbol s in the input. The symbol that has already been considered as having been inserted is passed. It should normally not be added to the state. deleteSymbol :: s -> state -> state Source Modify the state as the result of deleting a symbol s from the input. The symbol that has already been deleted from the input state is passed. It should normally not be deleted from the state.

class OutputState r where Source

Methods acceptR :: v -> rest -> r v rest Source nextR :: (a -> rest -> rest') -> (b -> a) -> r b rest -> rest' Source

class Symbol s where Source

Methods deleteCost :: s -> Int# Source symBefore :: s -> s Source symAfter :: s -> s Source

data Either' state s Source

Constructors Left' !s state Right' state

data Steps val s p Source

Constructors forall a . OkVal (a -> val) (Steps a s p) Ok rest :: Steps val s p Cost costing :: Int# rest :: Steps val s p StRepair costing :: Int# m :: !(Message s p) rest :: Steps val s p Best (Steps val s p) (Steps val s p) (Steps val s p) NoMoreSteps val

data Action s Source

Constructors Insert s Delete s Other String

val :: (a -> b) -> Steps a s p -> Steps b s p Source

evalSteps :: Steps a s p -> a Source

getMsgs :: Steps a s p -> [Message s p] Source

data Message sym pos Source

Constructors Msg (Expecting sym) !pos (Action sym)

data Expecting s Source

Constructors ESym (SymbolR s) EStr String EOr [Expecting s] ESeq [Expecting s]

data SymbolR s Source

Constructors Range !s !s EmptyR

Produced by Haddock version 2.6.0