Symantic.Parser.Grammar.Combinators

Semantic of the grammar combinators used to express parsers, in the convenient tagless-final encoding.

Type TermGrammar

type TermGrammar = Term ValueCode

Class Applicable

class Applicable repr where

This is like the usual Functor and Applicative type classes from the base package, but using (TermGrammar 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

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

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

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

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

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

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

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

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

pure :: TermGrammar a -> repr a

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

pure :: Liftable repr => Applicable (Output repr) => TermGrammar 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 :: TermGrammar (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 (WriteGrammar sN)

Defined in Symantic.Parser.Grammar.Write

Methods

(<$>) :: TermGrammar (a -> b) -> WriteGrammar sN a -> WriteGrammar sN b

(<&>) :: WriteGrammar sN a -> TermGrammar (a -> b) -> WriteGrammar sN b

(<$) :: TermGrammar a -> WriteGrammar sN b -> WriteGrammar sN a

($>) :: WriteGrammar sN a -> TermGrammar b -> WriteGrammar sN b

pure :: TermGrammar a -> WriteGrammar sN a

(<*>) :: WriteGrammar sN (a -> b) -> WriteGrammar sN a -> WriteGrammar sN b

liftA2 :: TermGrammar (a -> b -> c) -> WriteGrammar sN a -> WriteGrammar sN b -> WriteGrammar sN c

(<*) :: WriteGrammar sN a -> WriteGrammar sN b -> WriteGrammar sN a

(*>) :: WriteGrammar sN a -> WriteGrammar sN b -> WriteGrammar sN b

(<**>) :: WriteGrammar sN a -> WriteGrammar sN (a -> b) -> WriteGrammar sN b

Applicable (ViewGrammar sN)

Defined in Symantic.Parser.Grammar.View

Methods

(<$>) :: TermGrammar (a -> b) -> ViewGrammar sN a -> ViewGrammar sN b

(<&>) :: ViewGrammar sN a -> TermGrammar (a -> b) -> ViewGrammar sN b

(<$) :: TermGrammar a -> ViewGrammar sN b -> ViewGrammar sN a

($>) :: ViewGrammar sN a -> TermGrammar b -> ViewGrammar sN b

pure :: TermGrammar a -> ViewGrammar sN a

(<*>) :: ViewGrammar sN (a -> b) -> ViewGrammar sN a -> ViewGrammar sN b

liftA2 :: TermGrammar (a -> b -> c) -> ViewGrammar sN a -> ViewGrammar sN b -> ViewGrammar sN c

(<*) :: ViewGrammar sN a -> ViewGrammar sN b -> ViewGrammar sN a

(*>) :: ViewGrammar sN a -> ViewGrammar sN b -> ViewGrammar sN b

(<**>) :: ViewGrammar sN a -> ViewGrammar sN (a -> b) -> ViewGrammar sN b

(Applicable repr, Alternable repr, Lookable repr, Matchable repr, Selectable repr) => Applicable (SomeComb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

(<$>) :: TermGrammar (a -> b) -> SomeComb repr a -> SomeComb repr b

(<&>) :: SomeComb repr a -> TermGrammar (a -> b) -> SomeComb repr b

(<$) :: TermGrammar a -> SomeComb repr b -> SomeComb repr a

($>) :: SomeComb repr a -> TermGrammar b -> SomeComb repr b

pure :: TermGrammar a -> SomeComb repr a

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

liftA2 :: TermGrammar (a -> b -> c) -> SomeComb repr a -> SomeComb repr b -> SomeComb repr c

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

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

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

Applicable repr => Applicable (CleanDefs letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

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

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

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

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

pure :: TermGrammar a -> CleanDefs letName repr a

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

liftA2 :: TermGrammar (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

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

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

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

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

pure :: TermGrammar a -> ObserveSharing letName repr a

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

liftA2 :: TermGrammar (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

Stackable repr => Applicable (Program repr inp)

Defined in Symantic.Parser.Machine.Program

Methods

(<$>) :: TermGrammar (a -> b) -> Program repr inp a -> Program repr inp b

(<&>) :: Program repr inp a -> TermGrammar (a -> b) -> Program repr inp b

(<$) :: TermGrammar a -> Program repr inp b -> Program repr inp a

($>) :: Program repr inp a -> TermGrammar b -> Program repr inp b

pure :: TermGrammar a -> Program repr inp a

(<*>) :: Program repr inp (a -> b) -> Program repr inp a -> Program repr inp b

liftA2 :: TermGrammar (a -> b -> c) -> Program repr inp a -> Program repr inp b -> Program repr inp c

(<*) :: Program repr inp a -> Program repr inp b -> Program repr inp a

(*>) :: Program repr inp a -> Program repr inp b -> Program repr inp b

(<**>) :: Program repr inp a -> Program repr inp (a -> b) -> Program repr inp b

Applicable repr => Trans (Comb Applicable repr) repr

Defined in Symantic.Parser.Grammar.Optimize

Methods

trans :: Comb Applicable repr a -> repr a

data Comb Applicable repr

Defined in Symantic.Parser.Grammar.Optimize

data Comb Applicable repr where

• Pure :: forall a (repr :: ReprComb). TermGrammar a -> Comb Applicable repr a
• (:<*>:) :: forall (repr :: ReprComb) a b. SomeComb repr (a -> b) -> SomeComb repr a -> Comb Applicable repr b
• (:<*:) :: forall (repr :: ReprComb) a b. SomeComb repr a -> SomeComb repr b -> Comb Applicable repr a
• (:*>:) :: forall (repr :: ReprComb) a b. SomeComb repr a -> SomeComb repr b -> Comb Applicable 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 (WriteGrammar sN)

Defined in Symantic.Parser.Grammar.Write

Methods

(<|>) :: WriteGrammar sN a -> WriteGrammar sN a -> WriteGrammar sN a

empty :: WriteGrammar sN a

try :: WriteGrammar sN a -> WriteGrammar sN a

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

Alternable (ViewGrammar sN)

Defined in Symantic.Parser.Grammar.View

Methods

(<|>) :: ViewGrammar sN a -> ViewGrammar sN a -> ViewGrammar sN a

empty :: ViewGrammar sN a

try :: ViewGrammar sN a -> ViewGrammar sN a

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

(Alternable repr, Applicable repr, Lookable repr, Matchable repr, Selectable repr) => Alternable (SomeComb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

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

empty :: SomeComb repr a

try :: SomeComb repr a -> SomeComb repr a

(<+>) :: (Applicable (SomeComb repr), Alternable (SomeComb repr)) => SomeComb repr a -> SomeComb repr b -> SomeComb repr (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)

(Cursorable (Cursor inp), Branchable repr, Failable repr, Inputable repr, Joinable repr, Stackable repr) => Alternable (Program repr inp)

Defined in Symantic.Parser.Machine.Program

Methods

(<|>) :: Program repr inp a -> Program repr inp a -> Program repr inp a

empty :: Program repr inp a

try :: Program repr inp a -> Program repr inp a

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

Alternable repr => Trans (Comb Alternable repr) repr

Defined in Symantic.Parser.Grammar.Optimize

Methods

trans :: Comb Alternable repr a -> repr a

data Comb Alternable repr

Defined in Symantic.Parser.Grammar.Optimize

data Comb Alternable repr where

• Empty :: forall (repr :: ReprComb) a. Comb Alternable repr a
• (:<|>:) :: forall (repr :: ReprComb) a. SomeComb repr a -> SomeComb repr a -> Comb Alternable repr a
• Try :: forall (repr :: ReprComb) a. SomeComb repr a -> Comb Alternable repr a

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

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

option :: Applicable repr => Alternable repr => TermGrammar 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 (WriteGrammar sN)

Defined in Symantic.Parser.Grammar.Write

Methods

branch :: WriteGrammar sN (Either a b) -> WriteGrammar sN (a -> c) -> WriteGrammar sN (b -> c) -> WriteGrammar sN c

Selectable (ViewGrammar sN)

Defined in Symantic.Parser.Grammar.View

Methods

branch :: ViewGrammar sN (Either a b) -> ViewGrammar sN (a -> c) -> ViewGrammar sN (b -> c) -> ViewGrammar sN c

(Applicable repr, Alternable repr, Lookable repr, Selectable repr, Matchable repr) => Selectable (SomeComb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

branch :: SomeComb repr (Either a b) -> SomeComb repr (a -> c) -> SomeComb repr (b -> c) -> SomeComb repr 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

(Branchable repr, Joinable repr, Stackable repr) => Selectable (Program repr inp)

Defined in Symantic.Parser.Machine.Program

Methods

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

Selectable repr => Trans (Comb Selectable repr) repr

Defined in Symantic.Parser.Grammar.Optimize

Methods

trans :: Comb Selectable repr a -> repr a

data Comb Selectable repr

Defined in Symantic.Parser.Grammar.Optimize

data Comb Selectable repr where

• Branch :: forall (repr :: ReprComb) a b c. SomeComb repr (Either a b) -> SomeComb repr (a -> c) -> SomeComb repr (b -> c) -> Comb Selectable repr c

Class Matchable

class Matchable repr where

Minimal complete definition

Nothing

Methods

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

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

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

Instances

Matchable (WriteGrammar sN)

Defined in Symantic.Parser.Grammar.Write

Methods

conditional :: Eq a => WriteGrammar sN a -> [TermGrammar (a -> Bool)] -> [WriteGrammar sN b] -> WriteGrammar sN b -> WriteGrammar sN b

match :: Eq a => WriteGrammar sN a -> [TermGrammar a] -> (TermGrammar a -> WriteGrammar sN b) -> WriteGrammar sN b -> WriteGrammar sN b

Matchable (ViewGrammar sN)

Defined in Symantic.Parser.Grammar.View

Methods

conditional :: Eq a => ViewGrammar sN a -> [TermGrammar (a -> Bool)] -> [ViewGrammar sN b] -> ViewGrammar sN b -> ViewGrammar sN b

match :: Eq a => ViewGrammar sN a -> [TermGrammar a] -> (TermGrammar a -> ViewGrammar sN b) -> ViewGrammar sN b -> ViewGrammar sN b

(Applicable repr, Alternable repr, Lookable repr, Selectable repr, Matchable repr) => Matchable (SomeComb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

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

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

Matchable repr => Matchable (CleanDefs letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

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

match :: Eq a => CleanDefs letName repr a -> [TermGrammar a] -> (TermGrammar 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 => ObserveSharing letName repr a -> [TermGrammar (a -> Bool)] -> [ObserveSharing letName repr b] -> ObserveSharing letName repr b -> ObserveSharing letName repr b

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

(Branchable repr, Joinable repr) => Matchable (Program repr inp)

Defined in Symantic.Parser.Machine.Program

Methods

conditional :: Eq a => Program repr inp a -> [TermGrammar (a -> Bool)] -> [Program repr inp b] -> Program repr inp b -> Program repr inp b

match :: Eq a => Program repr inp a -> [TermGrammar a] -> (TermGrammar a -> Program repr inp b) -> Program repr inp b -> Program repr inp b

Matchable repr => Trans (Comb Matchable repr) repr

Defined in Symantic.Parser.Grammar.Optimize

Methods

trans :: Comb Matchable repr a -> repr a

data Comb Matchable repr

Defined in Symantic.Parser.Grammar.Optimize

data Comb Matchable repr where

• Conditional :: forall a (repr :: ReprComb) b. Eq a => SomeComb repr a -> [TermGrammar (a -> Bool)] -> [SomeComb repr b] -> SomeComb repr b -> Comb Matchable 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 (WriteGrammar sN)

Defined in Symantic.Parser.Grammar.Write

Methods

chainPre :: WriteGrammar sN (a -> a) -> WriteGrammar sN a -> WriteGrammar sN a

chainPost :: WriteGrammar sN a -> WriteGrammar sN (a -> a) -> WriteGrammar sN a

Foldable (ViewGrammar sN)

Defined in Symantic.Parser.Grammar.View

Methods

chainPre :: ViewGrammar sN (a -> a) -> ViewGrammar sN a -> ViewGrammar sN a

chainPost :: ViewGrammar sN a -> ViewGrammar sN (a -> a) -> ViewGrammar sN a

Foldable repr => Foldable (SomeComb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

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

chainPost :: SomeComb repr a -> SomeComb repr (a -> a) -> SomeComb repr 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

(Cursorable (Cursor inp), Branchable repr, Failable repr, Inputable repr, Joinable repr, Stackable repr) => Foldable (Program repr inp)

Defined in Symantic.Parser.Machine.Program

Methods

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

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

Foldable repr => Trans (Comb Foldable repr) repr

Defined in Symantic.Parser.Grammar.Optimize

Methods

trans :: Comb Foldable repr a -> repr a

data Comb Foldable repr

Defined in Symantic.Parser.Grammar.Optimize

data Comb Foldable repr where

• ChainPreC :: forall (repr :: ReprComb) a. SomeComb repr (a -> a) -> SomeComb repr a -> Comb Foldable repr a
• ChainPostC :: forall (repr :: ReprComb) a. SomeComb repr a -> SomeComb repr (a -> a) -> Comb Foldable repr a

Class Satisfiable

class Satisfiable tok repr where

Minimal complete definition

Nothing

Methods

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

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

item :: repr tok

Instances

Satisfiable tok (WriteGrammar sN)

Defined in Symantic.Parser.Grammar.Write

Methods

satisfy :: [ErrorItem tok] -> TermGrammar (tok -> Bool) -> WriteGrammar sN tok

item :: WriteGrammar sN tok

Satisfiable tok (ViewGrammar sN)

Defined in Symantic.Parser.Grammar.View

Methods

satisfy :: [ErrorItem tok] -> TermGrammar (tok -> Bool) -> ViewGrammar sN tok

item :: ViewGrammar sN tok

(Satisfiable tok repr, Typeable tok) => Satisfiable tok (SomeComb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

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

item :: SomeComb repr tok

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

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

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

item :: CleanDefs letName repr tok

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

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

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

item :: ObserveSharing letName repr tok

(tok ~ InputToken inp, Readable tok repr, Typeable tok) => Satisfiable tok (Program repr inp)

Defined in Symantic.Parser.Machine.Program

Methods

satisfy :: [ErrorItem tok] -> TermGrammar (tok -> Bool) -> Program repr inp tok

item :: Program repr inp tok

Satisfiable tok repr => Trans (Comb (Satisfiable tok) repr) repr

Defined in Symantic.Parser.Grammar.Optimize

Methods

trans :: Comb (Satisfiable tok) repr a -> repr a

data Comb (Satisfiable tok) repr

Defined in Symantic.Parser.Grammar.Optimize

data Comb (Satisfiable tok) repr where

• Satisfy :: forall tok (repr :: Type -> Type). Satisfiable tok repr => [ErrorItem tok] -> TermGrammar (tok -> Bool) -> Comb (Satisfiable tok) repr tok
• Item :: forall tok (repr :: Type -> Type). Satisfiable tok repr => Comb (Satisfiable tok) repr tok

Type ErrorItem

data ErrorItem tok

Constructors

ErrorItemToken tok

ErrorItemLabel String

ErrorItemHorizon Int

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 (WriteGrammar sN)

Defined in Symantic.Parser.Grammar.Write

Methods

look :: WriteGrammar sN a -> WriteGrammar sN a

negLook :: WriteGrammar sN a -> WriteGrammar sN ()

eof :: WriteGrammar sN ()

Lookable (ViewGrammar sN)

Defined in Symantic.Parser.Grammar.View

Methods

look :: ViewGrammar sN a -> ViewGrammar sN a

negLook :: ViewGrammar sN a -> ViewGrammar sN ()

eof :: ViewGrammar sN ()

(Alternable repr, Applicable repr, Lookable repr, Selectable repr, Matchable repr) => Lookable (SomeComb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

look :: SomeComb repr a -> SomeComb repr a

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

eof :: SomeComb repr ()

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 ()

(Ord (InputToken inp), Cursorable (Cursor inp), Branchable repr, Failable repr, Inputable repr, Joinable repr, Readable (InputToken inp) repr, Typeable (InputToken inp), Stackable repr) => Lookable (Program repr inp)

Defined in Symantic.Parser.Machine.Program

Methods

look :: Program repr inp a -> Program repr inp a

negLook :: Program repr inp a -> Program repr inp ()

eof :: Program repr inp ()

Lookable repr => Trans (Comb Lookable repr) repr

Defined in Symantic.Parser.Grammar.Optimize

Methods

trans :: Comb Lookable repr a -> repr a

data Comb Lookable repr

Defined in Symantic.Parser.Grammar.Optimize

data Comb Lookable repr where

• Look :: forall (repr :: ReprComb) a. SomeComb repr a -> Comb Lookable repr a
• NegLook :: forall (repr :: ReprComb) a. SomeComb repr a -> Comb Lookable repr ()
• Eof :: forall (repr :: ReprComb). Comb Lookable 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 => Alternable repr => Satisfiable Char repr => [Char] -> repr [Char]

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

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

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

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

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

anyChar :: Satisfiable Char repr => repr Char

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

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

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

unit :: Applicable repr => repr ()

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

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

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

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

chainl1' :: Applicable repr => Foldable repr => TermGrammar (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) -> TermGrammar 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]