Symantic.Parser.Grammar.Combinators

Class Applicable

class Applicable repr where

This is like the usual Functor and Applicative type classes from the base package, but using (Haskell a) instead of just (a) to be able to use and pattern match on some usual terms of type (a) (like id) and thus apply some optimizations. (repr) , for "representation", is the usual tagless-final abstraction over the many semantics that this syntax (formed by the methods of type class like this one) will be interpreted.

Minimal complete definition

Nothing

Methods

(<$>) :: Haskell (a -> b) -> repr a -> repr b infixl 4

(a2b <$> ra) parses like (ra) but maps its returned value with (a2b).

(<&>) :: repr a -> Haskell (a -> b) -> repr b infixl 4

Like <$> but with its arguments flip-ped.

(<$) :: Haskell a -> repr b -> repr a infixl 4

(a <$ rb) parses like (rb) but discards its returned value by replacing it with (a).

($>) :: repr a -> Haskell b -> repr b infixl 4

(ra $> b) parses like (ra) but discards its returned value by replacing it with (b).

pure :: Haskell a -> repr a

(pure a) parses the empty string, always succeeding in returning (a).

pure :: Liftable repr => Applicable (Output repr) => Haskell a -> repr a

(pure a) parses the empty string, always succeeding in returning (a).

(<*>) :: repr (a -> b) -> repr a -> repr b infixl 4

(ra2b <*> ra) parses sequentially (ra2b) and then (ra), and returns the application of the function returned by (ra2b) to the value returned by (ra).

(<*>) :: Liftable2 repr => Applicable (Output repr) => repr (a -> b) -> repr a -> repr b infixl 4

(ra2b <*> ra) parses sequentially (ra2b) and then (ra), and returns the application of the function returned by (ra2b) to the value returned by (ra).

liftA2 :: Haskell (a -> b -> c) -> repr a -> repr b -> repr c

(liftA2 a2b2c ra rb) parses sequentially (ra) and then (rb), and returns the application of (a2b2c) to the values returned by those parsers.

(<*) :: repr a -> repr b -> repr a infixl 4

(ra <* rb) parses sequentially (ra) and then (rb), and returns like (ra), discarding the return value of (rb).

(*>) :: repr a -> repr b -> repr b infixl 4

(ra *> rb) parses sequentially (ra) and then (rb), and returns like (rb), discarding the return value of (ra).

(<**>) :: repr a -> repr (a -> b) -> repr b infixl 4

Like <*> but with its arguments flip-ped.

Instances

Applicable WriteComb

Defined in Symantic.Parser.Grammar.Write

Methods

(<$>) :: Haskell (a -> b) -> WriteComb a -> WriteComb b

(<&>) :: WriteComb a -> Haskell (a -> b) -> WriteComb b

(<$) :: Haskell a -> WriteComb b -> WriteComb a

($>) :: WriteComb a -> Haskell b -> WriteComb b

pure :: Haskell a -> WriteComb a

(<*>) :: WriteComb (a -> b) -> WriteComb a -> WriteComb b

liftA2 :: Haskell (a -> b -> c) -> WriteComb a -> WriteComb b -> WriteComb c

(<*) :: WriteComb a -> WriteComb b -> WriteComb a

(*>) :: WriteComb a -> WriteComb b -> WriteComb b

(<**>) :: WriteComb a -> WriteComb (a -> b) -> WriteComb b

Applicable DumpComb

Defined in Symantic.Parser.Grammar.Dump

Methods

(<$>) :: Haskell (a -> b) -> DumpComb a -> DumpComb b

(<&>) :: DumpComb a -> Haskell (a -> b) -> DumpComb b

(<$) :: Haskell a -> DumpComb b -> DumpComb a

($>) :: DumpComb a -> Haskell b -> DumpComb b

pure :: Haskell a -> DumpComb a

(<*>) :: DumpComb (a -> b) -> DumpComb a -> DumpComb b

liftA2 :: Haskell (a -> b -> c) -> DumpComb a -> DumpComb b -> DumpComb c

(<*) :: DumpComb a -> DumpComb b -> DumpComb a

(*>) :: DumpComb a -> DumpComb b -> DumpComb b

(<**>) :: DumpComb a -> DumpComb (a -> b) -> DumpComb b

Applicable (Comb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

(<$>) :: Haskell (a -> b) -> Comb repr a -> Comb repr b

(<&>) :: Comb repr a -> Haskell (a -> b) -> Comb repr b

(<$) :: Haskell a -> Comb repr b -> Comb repr a

($>) :: Comb repr a -> Haskell b -> Comb repr b

pure :: Haskell a -> Comb repr a

(<*>) :: Comb repr (a -> b) -> Comb repr a -> Comb repr b

liftA2 :: Haskell (a -> b -> c) -> Comb repr a -> Comb repr b -> Comb repr c

(<*) :: Comb repr a -> Comb repr b -> Comb repr a

(*>) :: Comb repr a -> Comb repr b -> Comb repr b

(<**>) :: Comb repr a -> Comb repr (a -> b) -> Comb repr b

Applicable (Machine inp)

Defined in Symantic.Parser.Machine.Instructions

Methods

(<$>) :: Haskell (a -> b) -> Machine inp a -> Machine inp b

(<&>) :: Machine inp a -> Haskell (a -> b) -> Machine inp b

(<$) :: Haskell a -> Machine inp b -> Machine inp a

($>) :: Machine inp a -> Haskell b -> Machine inp b

pure :: Haskell a -> Machine inp a

(<*>) :: Machine inp (a -> b) -> Machine inp a -> Machine inp b

liftA2 :: Haskell (a -> b -> c) -> Machine inp a -> Machine inp b -> Machine inp c

(<*) :: Machine inp a -> Machine inp b -> Machine inp a

(*>) :: Machine inp a -> Machine inp b -> Machine inp b

(<**>) :: Machine inp a -> Machine inp (a -> b) -> Machine inp b

Applicable repr => Applicable (CleanDefs letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

(<$>) :: Haskell (a -> b) -> CleanDefs letName repr a -> CleanDefs letName repr b

(<&>) :: CleanDefs letName repr a -> Haskell (a -> b) -> CleanDefs letName repr b

(<$) :: Haskell a -> CleanDefs letName repr b -> CleanDefs letName repr a

($>) :: CleanDefs letName repr a -> Haskell b -> CleanDefs letName repr b

pure :: Haskell a -> CleanDefs letName repr a

(<*>) :: CleanDefs letName repr (a -> b) -> CleanDefs letName repr a -> CleanDefs letName repr b

liftA2 :: Haskell (a -> b -> c) -> CleanDefs letName repr a -> CleanDefs letName repr b -> CleanDefs letName repr c

(<*) :: CleanDefs letName repr a -> CleanDefs letName repr b -> CleanDefs letName repr a

(*>) :: CleanDefs letName repr a -> CleanDefs letName repr b -> CleanDefs letName repr b

(<**>) :: CleanDefs letName repr a -> CleanDefs letName repr (a -> b) -> CleanDefs letName repr b

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName, Applicable repr) => Applicable (ObserveSharing letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

(<$>) :: Haskell (a -> b) -> ObserveSharing letName repr a -> ObserveSharing letName repr b

(<&>) :: ObserveSharing letName repr a -> Haskell (a -> b) -> ObserveSharing letName repr b

(<$) :: Haskell a -> ObserveSharing letName repr b -> ObserveSharing letName repr a

($>) :: ObserveSharing letName repr a -> Haskell b -> ObserveSharing letName repr b

pure :: Haskell a -> ObserveSharing letName repr a

(<*>) :: ObserveSharing letName repr (a -> b) -> ObserveSharing letName repr a -> ObserveSharing letName repr b

liftA2 :: Haskell (a -> b -> c) -> ObserveSharing letName repr a -> ObserveSharing letName repr b -> ObserveSharing letName repr c

(<*) :: ObserveSharing letName repr a -> ObserveSharing letName repr b -> ObserveSharing letName repr a

(*>) :: ObserveSharing letName repr a -> ObserveSharing letName repr b -> ObserveSharing letName repr b

(<**>) :: ObserveSharing letName repr a -> ObserveSharing letName repr (a -> b) -> ObserveSharing letName repr b

Applicable (OptimizeComb letName repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

(<$>) :: Haskell (a -> b) -> OptimizeComb letName repr a -> OptimizeComb letName repr b

(<&>) :: OptimizeComb letName repr a -> Haskell (a -> b) -> OptimizeComb letName repr b

(<$) :: Haskell a -> OptimizeComb letName repr b -> OptimizeComb letName repr a

($>) :: OptimizeComb letName repr a -> Haskell b -> OptimizeComb letName repr b

pure :: Haskell a -> OptimizeComb letName repr a

(<*>) :: OptimizeComb letName repr (a -> b) -> OptimizeComb letName repr a -> OptimizeComb letName repr b

liftA2 :: Haskell (a -> b -> c) -> OptimizeComb letName repr a -> OptimizeComb letName repr b -> OptimizeComb letName repr c

(<*) :: OptimizeComb letName repr a -> OptimizeComb letName repr b -> OptimizeComb letName repr a

(*>) :: OptimizeComb letName repr a -> OptimizeComb letName repr b -> OptimizeComb letName repr b

(<**>) :: OptimizeComb letName repr a -> OptimizeComb letName repr (a -> b) -> OptimizeComb letName repr b

Class Alternable

class Alternable repr where

Minimal complete definition

Nothing

Methods

(<|>) :: repr a -> repr a -> repr a infixl 3

(rl <|> rr) parses (rl) and return its return value or, if it fails, parses (rr) from where (rl) has left the input stream, and returns its return value.

empty :: repr a

(empty) parses nothing, always failing to return a value.

try :: repr a -> repr a

(try ra) records the input stream position, then parses like (ra) and either returns its value it it succeeds or fails if it fails but with a reset of the input stream to the recorded position. Generally used on the first alternative: (try rl <|> rr).

(<|>) :: Liftable2 repr => Alternable (Output repr) => repr a -> repr a -> repr a infixl 3

(rl <|> rr) parses (rl) and return its return value or, if it fails, parses (rr) from where (rl) has left the input stream, and returns its return value.

empty :: Liftable repr => Alternable (Output repr) => repr a

(empty) parses nothing, always failing to return a value.

try :: Liftable1 repr => Alternable (Output repr) => repr a -> repr a

(try ra) records the input stream position, then parses like (ra) and either returns its value it it succeeds or fails if it fails but with a reset of the input stream to the recorded position. Generally used on the first alternative: (try rl <|> rr).

(<+>) :: Applicable repr => Alternable repr => repr a -> repr b -> repr (Either a b) infixl 3

Like (<|>) but with different returning types for the alternatives, and a return value wrapped in an Either accordingly.

Instances

Alternable WriteComb

Defined in Symantic.Parser.Grammar.Write

Methods

(<|>) :: WriteComb a -> WriteComb a -> WriteComb a

empty :: WriteComb a

try :: WriteComb a -> WriteComb a

(<+>) :: (Applicable WriteComb, Alternable WriteComb) => WriteComb a -> WriteComb b -> WriteComb (Either a b)

Alternable DumpComb

Defined in Symantic.Parser.Grammar.Dump

Methods

(<|>) :: DumpComb a -> DumpComb a -> DumpComb a

empty :: DumpComb a

try :: DumpComb a -> DumpComb a

(<+>) :: (Applicable DumpComb, Alternable DumpComb) => DumpComb a -> DumpComb b -> DumpComb (Either a b)

Alternable (Comb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

(<|>) :: Comb repr a -> Comb repr a -> Comb repr a

empty :: Comb repr a

try :: Comb repr a -> Comb repr a

(<+>) :: (Applicable (Comb repr), Alternable (Comb repr)) => Comb repr a -> Comb repr b -> Comb repr (Either a b)

Cursorable (Cursor inp) => Alternable (Machine inp)

Defined in Symantic.Parser.Machine.Instructions

Methods

(<|>) :: Machine inp a -> Machine inp a -> Machine inp a

empty :: Machine inp a

try :: Machine inp a -> Machine inp a

(<+>) :: (Applicable (Machine inp), Alternable (Machine inp)) => Machine inp a -> Machine inp b -> Machine inp (Either a b)

Alternable repr => Alternable (CleanDefs letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

(<|>) :: CleanDefs letName repr a -> CleanDefs letName repr a -> CleanDefs letName repr a

empty :: CleanDefs letName repr a

try :: CleanDefs letName repr a -> CleanDefs letName repr a

(<+>) :: (Applicable (CleanDefs letName repr), Alternable (CleanDefs letName repr)) => CleanDefs letName repr a -> CleanDefs letName repr b -> CleanDefs letName repr (Either a b)

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName, Alternable repr) => Alternable (ObserveSharing letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

(<|>) :: ObserveSharing letName repr a -> ObserveSharing letName repr a -> ObserveSharing letName repr a

empty :: ObserveSharing letName repr a

try :: ObserveSharing letName repr a -> ObserveSharing letName repr a

(<+>) :: (Applicable (ObserveSharing letName repr), Alternable (ObserveSharing letName repr)) => ObserveSharing letName repr a -> ObserveSharing letName repr b -> ObserveSharing letName repr (Either a b)

Alternable (OptimizeComb letName repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

(<|>) :: OptimizeComb letName repr a -> OptimizeComb letName repr a -> OptimizeComb letName repr a

empty :: OptimizeComb letName repr a

try :: OptimizeComb letName repr a -> OptimizeComb letName repr a

(<+>) :: (Applicable (OptimizeComb letName repr), Alternable (OptimizeComb letName repr)) => OptimizeComb letName repr a -> OptimizeComb letName repr b -> OptimizeComb letName repr (Either a b)

optionally :: Applicable repr => Alternable repr => repr a -> Haskell b -> repr b

optional :: Applicable repr => Alternable repr => repr a -> repr ()

option :: Applicable repr => Alternable repr => Haskell a -> repr a -> repr a

choice :: Alternable repr => [repr a] -> repr a

maybeP :: Applicable repr => Alternable repr => repr a -> repr (Maybe a)

manyTill :: Applicable repr => Alternable repr => repr a -> repr b -> repr [a]

Class Selectable

class Selectable repr where

Minimal complete definition

Nothing

Methods

branch :: repr (Either a b) -> repr (a -> c) -> repr (b -> c) -> repr c

branch :: Liftable3 repr => Selectable (Output repr) => repr (Either a b) -> repr (a -> c) -> repr (b -> c) -> repr c

Instances

Selectable WriteComb

Defined in Symantic.Parser.Grammar.Write

Methods

branch :: WriteComb (Either a b) -> WriteComb (a -> c) -> WriteComb (b -> c) -> WriteComb c

Selectable DumpComb

Defined in Symantic.Parser.Grammar.Dump

Methods

branch :: DumpComb (Either a b) -> DumpComb (a -> c) -> DumpComb (b -> c) -> DumpComb c

Selectable (Comb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

branch :: Comb repr (Either a b) -> Comb repr (a -> c) -> Comb repr (b -> c) -> Comb repr c

Selectable (Machine inp)

Defined in Symantic.Parser.Machine.Instructions

Methods

branch :: Machine inp (Either a b) -> Machine inp (a -> c) -> Machine inp (b -> c) -> Machine inp c

Selectable repr => Selectable (CleanDefs letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

branch :: CleanDefs letName repr (Either a b) -> CleanDefs letName repr (a -> c) -> CleanDefs letName repr (b -> c) -> CleanDefs letName repr c

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName, Selectable repr) => Selectable (ObserveSharing letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

branch :: ObserveSharing letName repr (Either a b) -> ObserveSharing letName repr (a -> c) -> ObserveSharing letName repr (b -> c) -> ObserveSharing letName repr c

Selectable (OptimizeComb letName repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

branch :: OptimizeComb letName repr (Either a b) -> OptimizeComb letName repr (a -> c) -> OptimizeComb letName repr (b -> c) -> OptimizeComb letName repr c

Class Matchable

class Matchable repr where

Minimal complete definition

Nothing

Methods

conditional :: Eq a => [Haskell (a -> Bool)] -> [repr b] -> repr a -> repr b -> repr b

conditional :: Unliftable repr => Liftable2 repr => Matchable (Output repr) => Eq a => [Haskell (a -> Bool)] -> [repr b] -> repr a -> repr b -> repr b

match :: Eq a => [Haskell a] -> repr a -> (Haskell a -> repr b) -> repr b -> repr b

Instances

Matchable WriteComb

Defined in Symantic.Parser.Grammar.Write

Methods

conditional :: Eq a => [Haskell (a -> Bool)] -> [WriteComb b] -> WriteComb a -> WriteComb b -> WriteComb b

match :: Eq a => [Haskell a] -> WriteComb a -> (Haskell a -> WriteComb b) -> WriteComb b -> WriteComb b

Matchable DumpComb

Defined in Symantic.Parser.Grammar.Dump

Methods

conditional :: Eq a => [Haskell (a -> Bool)] -> [DumpComb b] -> DumpComb a -> DumpComb b -> DumpComb b

match :: Eq a => [Haskell a] -> DumpComb a -> (Haskell a -> DumpComb b) -> DumpComb b -> DumpComb b

Matchable (Comb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

conditional :: Eq a => [Haskell (a -> Bool)] -> [Comb repr b] -> Comb repr a -> Comb repr b -> Comb repr b

match :: Eq a => [Haskell a] -> Comb repr a -> (Haskell a -> Comb repr b) -> Comb repr b -> Comb repr b

Matchable (Machine inp)

Defined in Symantic.Parser.Machine.Instructions

Methods

conditional :: Eq a => [Haskell (a -> Bool)] -> [Machine inp b] -> Machine inp a -> Machine inp b -> Machine inp b

match :: Eq a => [Haskell a] -> Machine inp a -> (Haskell a -> Machine inp b) -> Machine inp b -> Machine inp b

Matchable repr => Matchable (CleanDefs letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

conditional :: Eq a => [Haskell (a -> Bool)] -> [CleanDefs letName repr b] -> CleanDefs letName repr a -> CleanDefs letName repr b -> CleanDefs letName repr b

match :: Eq a => [Haskell a] -> CleanDefs letName repr a -> (Haskell a -> CleanDefs letName repr b) -> CleanDefs letName repr b -> CleanDefs letName repr b

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName, Matchable repr) => Matchable (ObserveSharing letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

conditional :: Eq a => [Haskell (a -> Bool)] -> [ObserveSharing letName repr b] -> ObserveSharing letName repr a -> ObserveSharing letName repr b -> ObserveSharing letName repr b

match :: Eq a => [Haskell a] -> ObserveSharing letName repr a -> (Haskell a -> ObserveSharing letName repr b) -> ObserveSharing letName repr b -> ObserveSharing letName repr b

Matchable (OptimizeComb letName repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

conditional :: Eq a => [Haskell (a -> Bool)] -> [OptimizeComb letName repr b] -> OptimizeComb letName repr a -> OptimizeComb letName repr b -> OptimizeComb letName repr b

match :: Eq a => [Haskell a] -> OptimizeComb letName repr a -> (Haskell a -> OptimizeComb letName repr b) -> OptimizeComb letName repr b -> OptimizeComb letName repr b

Class Foldable

class Foldable repr where

Minimal complete definition

Nothing

Methods

chainPre :: repr (a -> a) -> repr a -> repr a

chainPost :: repr a -> repr (a -> a) -> repr a

chainPre :: Applicable repr => Alternable repr => repr (a -> a) -> repr a -> repr a

chainPost :: Applicable repr => Alternable repr => repr a -> repr (a -> a) -> repr a

Instances

Foldable WriteComb

Defined in Symantic.Parser.Grammar.Write

Methods

chainPre :: WriteComb (a -> a) -> WriteComb a -> WriteComb a

chainPost :: WriteComb a -> WriteComb (a -> a) -> WriteComb a

Foldable DumpComb

Defined in Symantic.Parser.Grammar.Dump

Methods

chainPre :: DumpComb (a -> a) -> DumpComb a -> DumpComb a

chainPost :: DumpComb a -> DumpComb (a -> a) -> DumpComb a

Foldable (Comb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

chainPre :: Comb repr (a -> a) -> Comb repr a -> Comb repr a

chainPost :: Comb repr a -> Comb repr (a -> a) -> Comb repr a

Cursorable (Cursor inp) => Foldable (Machine inp)

Defined in Symantic.Parser.Machine.Instructions

Methods

chainPre :: Machine inp (a -> a) -> Machine inp a -> Machine inp a

chainPost :: Machine inp a -> Machine inp (a -> a) -> Machine inp a

Foldable repr => Foldable (CleanDefs letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

chainPre :: CleanDefs letName repr (a -> a) -> CleanDefs letName repr a -> CleanDefs letName repr a

chainPost :: CleanDefs letName repr a -> CleanDefs letName repr (a -> a) -> CleanDefs letName repr a

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName, Foldable repr, Applicable repr, Alternable repr) => Foldable (ObserveSharing letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

chainPre :: ObserveSharing letName repr (a -> a) -> ObserveSharing letName repr a -> ObserveSharing letName repr a

chainPost :: ObserveSharing letName repr a -> ObserveSharing letName repr (a -> a) -> ObserveSharing letName repr a

Foldable (OptimizeComb letName repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

chainPre :: OptimizeComb letName repr (a -> a) -> OptimizeComb letName repr a -> OptimizeComb letName repr a

chainPost :: OptimizeComb letName repr a -> OptimizeComb letName repr (a -> a) -> OptimizeComb letName repr a

Class Satisfiable

class Satisfiable repr tok where

Minimal complete definition

Nothing

Methods

satisfy :: [ErrorItem tok] -> Haskell (tok -> Bool) -> repr tok

satisfy :: Liftable repr => Satisfiable (Output repr) tok => [ErrorItem tok] -> Haskell (tok -> Bool) -> repr tok

Instances

Satisfiable WriteComb tok

Defined in Symantic.Parser.Grammar.Write

Methods

satisfy :: [ErrorItem tok] -> Haskell (tok -> Bool) -> WriteComb tok

Satisfiable DumpComb tok

Defined in Symantic.Parser.Grammar.Dump

Methods

satisfy :: [ErrorItem tok] -> Haskell (tok -> Bool) -> DumpComb tok

Satisfiable repr tok => Satisfiable (Comb repr) tok

Defined in Symantic.Parser.Grammar.Optimize

Methods

satisfy :: [ErrorItem tok] -> Haskell (tok -> Bool) -> Comb repr tok

tok ~ InputToken inp => Satisfiable (Machine inp) tok

Defined in Symantic.Parser.Machine.Instructions

Methods

satisfy :: [ErrorItem tok] -> Haskell (tok -> Bool) -> Machine inp tok

Satisfiable repr tok => Satisfiable (CleanDefs letName repr) tok

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

satisfy :: [ErrorItem tok] -> Haskell (tok -> Bool) -> CleanDefs letName repr tok

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName, Satisfiable repr tok) => Satisfiable (ObserveSharing letName repr) tok

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

satisfy :: [ErrorItem tok] -> Haskell (tok -> Bool) -> ObserveSharing letName repr tok

Satisfiable repr tok => Satisfiable (OptimizeComb letName repr) tok

Defined in Symantic.Parser.Grammar.Optimize

Methods

satisfy :: [ErrorItem tok] -> Haskell (tok -> Bool) -> OptimizeComb letName repr tok

Type ErrorItem

data ErrorItem tok

Constructors

ErrorItemToken tok

ErrorItemLabel String

ErrorItemEnd

Instances

Lift tok => Lift (ErrorItem tok :: Type)

Defined in Symantic.Parser.Grammar.Combinators

Methods

lift :: Quote m => ErrorItem tok -> m Exp

liftTyped :: forall (m :: Type -> Type). Quote m => ErrorItem tok -> Code m (ErrorItem tok)

Eq tok => Eq (ErrorItem tok)

Defined in Symantic.Parser.Grammar.Combinators

Methods

(==) :: ErrorItem tok -> ErrorItem tok -> Bool

(/=) :: ErrorItem tok -> ErrorItem tok -> Bool

Ord tok => Ord (ErrorItem tok)

Defined in Symantic.Parser.Grammar.Combinators

Methods

compare :: ErrorItem tok -> ErrorItem tok -> Ordering

(<) :: ErrorItem tok -> ErrorItem tok -> Bool

(<=) :: ErrorItem tok -> ErrorItem tok -> Bool

(>) :: ErrorItem tok -> ErrorItem tok -> Bool

(>=) :: ErrorItem tok -> ErrorItem tok -> Bool

max :: ErrorItem tok -> ErrorItem tok -> ErrorItem tok

min :: ErrorItem tok -> ErrorItem tok -> ErrorItem tok

Show tok => Show (ErrorItem tok)

Defined in Symantic.Parser.Grammar.Combinators

Methods

showsPrec :: Int -> ErrorItem tok -> ShowS

show :: ErrorItem tok -> String

showList :: [ErrorItem tok] -> ShowS

Class Lookable

class Lookable repr where

Minimal complete definition

Nothing

Methods

look :: repr a -> repr a

negLook :: repr a -> repr ()

look :: Liftable1 repr => Lookable (Output repr) => repr a -> repr a

negLook :: Liftable1 repr => Lookable (Output repr) => repr a -> repr ()

eof :: repr ()

eof :: Liftable repr => Lookable (Output repr) => repr ()

Instances

Lookable WriteComb

Defined in Symantic.Parser.Grammar.Write

Methods

look :: WriteComb a -> WriteComb a

negLook :: WriteComb a -> WriteComb ()

eof :: WriteComb ()

Lookable DumpComb

Defined in Symantic.Parser.Grammar.Dump

Methods

look :: DumpComb a -> DumpComb a

negLook :: DumpComb a -> DumpComb ()

eof :: DumpComb ()

Lookable (Comb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

look :: Comb repr a -> Comb repr a

negLook :: Comb repr a -> Comb repr ()

eof :: Comb repr ()

(Ord (InputToken inp), Cursorable (Cursor inp)) => Lookable (Machine inp)

Defined in Symantic.Parser.Machine.Instructions

Methods

look :: Machine inp a -> Machine inp a

negLook :: Machine inp a -> Machine inp ()

eof :: Machine inp ()

Lookable repr => Lookable (CleanDefs letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

look :: CleanDefs letName repr a -> CleanDefs letName repr a

negLook :: CleanDefs letName repr a -> CleanDefs letName repr ()

eof :: CleanDefs letName repr ()

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName, Lookable repr) => Lookable (ObserveSharing letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

look :: ObserveSharing letName repr a -> ObserveSharing letName repr a

negLook :: ObserveSharing letName repr a -> ObserveSharing letName repr ()

eof :: ObserveSharing letName repr ()

Lookable (OptimizeComb letName repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

look :: OptimizeComb letName repr a -> OptimizeComb letName repr a

negLook :: OptimizeComb letName repr a -> OptimizeComb letName repr ()

eof :: OptimizeComb letName repr ()

(<:>) :: Applicable repr => repr a -> repr [a] -> repr [a] infixl 4

sequence :: Applicable repr => [repr a] -> repr [a]

traverse :: Applicable repr => (a -> repr b) -> [a] -> repr [b]

repeat :: Applicable repr => Int -> repr a -> repr [a]

between :: Applicable repr => repr o -> repr c -> repr a -> repr a

string :: Applicable repr => Satisfiable repr Char => [Char] -> repr [Char]

noneOf :: Lift tok => Eq tok => Satisfiable repr tok => [tok] -> repr tok

ofChars :: Lift tok => Eq tok => [tok] -> CodeQ tok -> CodeQ Bool

more :: Applicable repr => Satisfiable repr Char => Lookable repr => repr ()

char :: Applicable repr => Satisfiable repr Char => Char -> repr Char

anyChar :: Satisfiable repr Char => repr Char

token :: Lift tok => Eq tok => Applicable repr => Satisfiable repr tok => tok -> repr tok

tokens :: Lift tok => Eq tok => Applicable repr => Alternable repr => Satisfiable repr tok => [tok] -> repr [tok]

item :: Satisfiable repr tok => repr tok

void :: Applicable repr => repr a -> repr ()

unit :: Applicable repr => repr ()

pfoldr :: Applicable repr => Foldable repr => Haskell (a -> b -> b) -> Haskell b -> repr a -> repr b

pfoldr1 :: Applicable repr => Foldable repr => Haskell (a -> b -> b) -> Haskell b -> repr a -> repr b

pfoldl :: Applicable repr => Foldable repr => Haskell (b -> a -> b) -> Haskell b -> repr a -> repr b

pfoldl1 :: Applicable repr => Foldable repr => Haskell (b -> a -> b) -> Haskell b -> repr a -> repr b

chainl1' :: Applicable repr => Foldable repr => Haskell (a -> b) -> repr a -> repr (b -> a -> b) -> repr b

chainl1 :: Applicable repr => Foldable repr => repr a -> repr (a -> a -> a) -> repr a

chainl :: Applicable repr => Alternable repr => Foldable repr => repr a -> repr (a -> a -> a) -> Haskell a -> repr a

many :: Applicable repr => Foldable repr => repr a -> repr [a]

manyN :: Applicable repr => Foldable repr => Int -> repr a -> repr [a]

some :: Applicable repr => Foldable repr => repr a -> repr [a]

skipMany :: Applicable repr => Foldable repr => repr a -> repr ()

skipManyN :: Applicable repr => Foldable repr => Int -> repr a -> repr ()

skipSome :: Applicable repr => Foldable repr => repr a -> repr ()

sepBy :: Applicable repr => Alternable repr => Foldable repr => repr a -> repr b -> repr [a]

sepBy1 :: Applicable repr => Alternable repr => Foldable repr => repr a -> repr b -> repr [a]

endBy :: Applicable repr => Alternable repr => Foldable repr => repr a -> repr b -> repr [a]

endBy1 :: Applicable repr => Alternable repr => Foldable repr => repr a -> repr b -> repr [a]

sepEndBy :: Applicable repr => Alternable repr => Foldable repr => repr a -> repr b -> repr [a]

sepEndBy1 :: Applicable repr => Alternable repr => Foldable repr => repr a -> repr b -> repr [a]