UU.Parsing.Machine

Documentation

newtype RealParser state s p a

Source

Constructors

P (forall r' r''. (a -> r'' -> r') -> (state -> Steps r'' s p) -> state -> Steps r' s p)

newtype RealRecogn state s p

Source

Constructors

R (forall r. (state -> Steps r s p) -> state -> Steps r s p)

newtype RealAccept state result s p a

Source

Constructors

A (forall r. (state -> Steps r s p) -> state -> Steps (result a r) s p)

newtype ParsRec state result s p a

Source

Constructors

PR (RealParser state s p a, RealRecogn state s p, RealAccept state result s p a)

parseRecbasic :: (inp -> Steps (out c d) sym pos) -> ParsRec inp out sym pos a -> inp -> Steps (out a (out c d)) sym pos

Source

parsebasic :: (inp -> Steps (out c d) sym pos) -> AnaParser inp out sym pos a -> inp -> Steps (out a (out c d)) sym pos

Source

libAccept :: (OutputState a, InputState b s p) => ParsRec b a s p s

Source

libFail :: OutputState a => ParsRec b a c p d

Source

starting :: Steps a s p -> Expecting s

Source

hasSuccess :: Steps a s p -> Bool

Source

eor :: Ord a => Expecting a -> Expecting a -> Expecting a

Source

libBest :: Ord s => Steps b s p -> Steps b s p -> Steps b s p

Source

libBest' :: Ord s => Steps b s p -> Steps c s p -> (b -> d) -> (c -> d) -> Steps d s p

Source

lib_correct :: Ord s => (b -> c -> Steps d s p) -> (b -> c -> Steps d s p) -> b -> c -> Steps d s p

Source

libCorrect :: Ord s => Steps a s p -> Steps c s p -> (a -> d) -> (c -> d) -> Steps d s p

Source

data ToBeat a

Source

Constructors

ToBeat Int# a

traverse :: ToBeat (Steps a s p) -> (Steps v s p -> Steps a s p, Steps v s p) -> Int# -> Int# -> ToBeat (Steps a s p)

Source

data AnaParser state result s p a

Source

Constructors

AnaParser

pars :: ParsRec state result s p a
leng :: Nat
zerop :: Maybe (Bool, Either a (ParsRec state result s p a))
onep :: OneDescr state result s p a

data OneDescr state result s p a

Source

Constructors

OneDescr

firsts :: Expecting s
table :: [(SymbolR s, TableEntry state result s p a)]

data TableEntry state result s p a

Source

Constructors

TableEntry (ParsRec state result s p a) (Expecting s -> ParsRec state result s p a)

anaFail :: OutputState a => AnaParser b a c p d

Source

data Nat

Source

Constructors

Zero
Succ Nat
Infinite

libMap :: 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)) -> ParsRec state result s p a -> ParsRec 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

libWrap :: 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)) -> ParsRec state result s p a -> ParsRec state result s p b

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

lookupSym :: Ord a => BinSearchTree (SymbolR a, b) -> a -> Maybe b

Source

Produced by Haddock version 2.6.0