distributors-0.6.0.0: Unifying Parsers, Printers & Grammars
Copyright(C) 2026 - Eitan Chatav
LicenseBSD-style (see the file LICENSE)
MaintainerEitan Chatav <eitan.chatav@gmail.com>
Stabilityprovisional
Portabilitynon-portable
Safe HaskellNone
LanguageHaskell2010

Control.Lens.Grammar.Kleene

Description

Regular expressions form a Kleene star algebra. See Kleene, Representation of Events in Nerve Nets and Finite Automata

Synopsis

KleeneStarAlgebra

class Monoid k => KleeneStarAlgebra k where Source #

A KleeneStarAlgebra is a ring with a generally non-commutative multiplication, the Monoid concatenation operator <> with identity mempty; and an idempotent addition, the alternation operator >|< with identity zeroK.

It has three unary operators optK, plusK and the eponymous starK.

starK x = optK (plusK x)
plusK x = x <> starK x
optK x = mempty >|< x

The following invariants should hold.

x >|< x = x
zeroK >|< x = x = x >|< zeroK
mempty >|< x = optK x = x >|< mempty
zeroK <> x = zeroK = x <> zeroK
mempty <> x = x = x <> mempty

Minimal complete definition

Nothing

Methods

starK :: k -> k Source #

plusK :: k -> k Source #

optK :: k -> k Source #

(>|<) :: k -> k -> k infixl 3 Source #

default (>|<) :: forall (f :: Type -> Type) a. (k ~ f a, Alternative f) => k -> k -> k Source #

zeroK :: k Source #

default zeroK :: forall (f :: Type -> Type) a. (k ~ f a, Alternative f) => k Source #

Instances

Instances details
KleeneStarAlgebra RegBnf Source # 
Instance details

Defined in Control.Lens.Grammar

Methods

starK :: RegBnf -> RegBnf Source #

plusK :: RegBnf -> RegBnf Source #

optK :: RegBnf -> RegBnf Source #

(>|<) :: RegBnf -> RegBnf -> RegBnf Source #

zeroK :: RegBnf Source #

KleeneStarAlgebra RegString Source # 
Instance details

Defined in Control.Lens.Grammar

Methods

starK :: RegString -> RegString Source #

plusK :: RegString -> RegString Source #

optK :: RegString -> RegString Source #

(>|<) :: RegString -> RegString -> RegString Source #

zeroK :: RegString Source #

(Ord rule, KleeneStarAlgebra rule) => KleeneStarAlgebra (Bnf rule) Source # 
Instance details

Defined in Control.Lens.Grammar.BackusNaur

Methods

starK :: Bnf rule -> Bnf rule Source #

plusK :: Bnf rule -> Bnf rule Source #

optK :: Bnf rule -> Bnf rule Source #

(>|<) :: Bnf rule -> Bnf rule -> Bnf rule Source #

zeroK :: Bnf rule Source #

Categorized token => KleeneStarAlgebra (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

starK :: RegEx token -> RegEx token Source #

plusK :: RegEx token -> RegEx token Source #

optK :: RegEx token -> RegEx token Source #

(>|<) :: RegEx token -> RegEx token -> RegEx token Source #

zeroK :: RegEx token Source #

(Alternative f, Monoid k) => KleeneStarAlgebra (Ap f k) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

starK :: Ap f k -> Ap f k Source #

plusK :: Ap f k -> Ap f k Source #

optK :: Ap f k -> Ap f k Source #

(>|<) :: Ap f k -> Ap f k -> Ap f k Source #

zeroK :: Ap f k Source #

orK :: (Foldable f, KleeneStarAlgebra k) => f k -> k Source #

cumulative alternation

anyK :: (Foldable f, KleeneStarAlgebra k) => (a -> k) -> f a -> k Source #

existential

TokenAlgebra

class Tokenized token p => TokenAlgebra token p where Source #

TokenAlgebra extends Tokenized methods to support BooleanAlgebra operations within a tokenClass. When a TokenAlgebra is an Alternative, then tokenClass is expected to act homomorphically on disjunction.

empty = tokenClass falseB
tokenClass x <|> tokenClass y = tokenClass (x >||< y)

Minimal complete definition

Nothing

Methods

tokenClass :: TokenClass token -> p Source #

default tokenClass :: forall (q :: Type -> Type -> Type). (p ~ q token token, Alternator q, Cochoice q) => TokenClass token -> p Source #

Instances

Instances details
TokenAlgebra Char RegBnf Source # 
Instance details

Defined in Control.Lens.Grammar

Methods

tokenClass :: TokenClass Char -> RegBnf Source #

TokenAlgebra Char RegString Source # 
Instance details

Defined in Control.Lens.Grammar

Methods

tokenClass :: TokenClass Char -> RegString Source #

TokenAlgebra Char (ReadP Char) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

tokenClass :: TokenClass Char -> ReadP Char Source #

(Categorized token, Arbitrary token) => TokenAlgebra token (Gen token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

tokenClass :: TokenClass token -> Gen token Source #

(Ord rule, TokenAlgebra token rule) => TokenAlgebra token (Bnf rule) Source # 
Instance details

Defined in Control.Lens.Grammar.BackusNaur

Methods

tokenClass :: TokenClass token -> Bnf rule Source #

Categorized token => TokenAlgebra token (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

tokenClass :: TokenClass token -> RegEx token Source #

Categorized token => TokenAlgebra token (TokenClass token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

tokenClass :: TokenClass token -> TokenClass token Source #

Categorized token => TokenAlgebra token (RegExam token (TokenClass token)) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

tokenClass :: TokenClass token -> RegExam token (TokenClass token) Source #

Categorized token => TokenAlgebra token (token -> Bool) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

tokenClass :: TokenClass token -> token -> Bool Source #

TokenAlgebra a k => TokenAlgebra a (Grammor k a b) Source # 
Instance details

Defined in Data.Profunctor.Grammar

Methods

tokenClass :: TokenClass a -> Grammor k a b Source #

(Categorized token, Item s ~ token, Cons s s token token, Snoc s s token token) => TokenAlgebra token (Parsector s token token) Source # 
Instance details

Defined in Data.Profunctor.Grammar.Parsector

Methods

tokenClass :: TokenClass token -> Parsector s token token Source #

(RandomGen g, Monad m, Categorized token, Random token) => TokenAlgebra token (StateT g m token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

tokenClass :: TokenClass token -> StateT g m token Source #

(Categorized a, a ~ Item s, IsList s, Cons s s a a, Snoc s s a a, Filterable m, Alternative m, Monad m) => TokenAlgebra a (Parsor s m a a) Source # 
Instance details

Defined in Data.Profunctor.Grammar

Methods

tokenClass :: TokenClass a -> Parsor s m a a Source #

(Categorized a, a ~ Item s, IsList s, Cons s s a a, Filterable m, Alternative m, Monad m) => TokenAlgebra a (Printor s m a a) Source # 
Instance details

Defined in Data.Profunctor.Grammar

Methods

tokenClass :: TokenClass a -> Printor s m a a Source #

TokenAlgebra token (f token) => TokenAlgebra token (Joker f token token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

tokenClass :: TokenClass token -> Joker f token token Source #

RegEx & TokenClass

data RegEx token Source #

The RegExpression type forms the prototypical KleeneStarAlgebra. It is also a TokenAlgebra, such that the following invariants hold.

zeroK = tokenClass falseB
tokenClass x >|< tokenClass y = tokenClass (x >||< y)

Constructors

SeqEmpty 
Sequence (RegEx token) (RegEx token) 
NonTerminal String 
KleeneStar (RegEx token) 
KleeneOpt (RegEx token) 
KleenePlus (RegEx token) 
RegExam (RegExam token (RegEx token)) 

Instances

Instances details
Categorized token => TokenAlgebra token (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

tokenClass :: TokenClass token -> RegEx token Source #

Categorized token => TerminalSymbol token (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

terminal :: [token] -> RegEx token Source #

Categorized token => Tokenized token (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

anyToken :: RegEx token Source #

token :: token -> RegEx token Source #

oneOf :: Foldable f => f token -> RegEx token Source #

notOneOf :: Foldable f => f token -> RegEx token Source #

asIn :: Categorize token -> RegEx token Source #

notAsIn :: Categorize token -> RegEx token Source #

(Categorized token, HasTrie token) => HasTrie (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Associated Types

data (RegEx token) :->: b 
Instance details

Defined in Control.Lens.Grammar.Kleene

data (RegEx token) :->: b = RegExTrie {}

Methods

trie :: (RegEx token -> b) -> RegEx token :->: b #

untrie :: (RegEx token :->: b) -> RegEx token -> b #

enumerate :: (RegEx token :->: b) -> [(RegEx token, b)] #

Categorized token => Monoid (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

mempty :: RegEx token #

mappend :: RegEx token -> RegEx token -> RegEx token #

mconcat :: [RegEx token] -> RegEx token #

Categorized token => Semigroup (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

(<>) :: RegEx token -> RegEx token -> RegEx token #

sconcat :: NonEmpty (RegEx token) -> RegEx token #

stimes :: Integral b => b -> RegEx token -> RegEx token #

Generic (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Associated Types

type Rep (RegEx token) 
Instance details

Defined in Control.Lens.Grammar.Kleene

type Rep (RegEx token) = D1 ('MetaData "RegEx" "Control.Lens.Grammar.Kleene" "distributors-0.6.0.0-GKdjtvrzrF55FdERGi3FK3" 'False) ((C1 ('MetaCons "SeqEmpty" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "Sequence" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RegEx token)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RegEx token))) :+: C1 ('MetaCons "NonTerminal" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)))) :+: ((C1 ('MetaCons "KleeneStar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RegEx token))) :+: C1 ('MetaCons "KleeneOpt" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RegEx token)))) :+: (C1 ('MetaCons "KleenePlus" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RegEx token))) :+: C1 ('MetaCons "RegExam" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RegExam token (RegEx token)))))))

Methods

from :: RegEx token -> Rep (RegEx token) x #

to :: Rep (RegEx token) x -> RegEx token #

(Categorized token, Read token, Read (Categorize token)) => Read (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

readsPrec :: Int -> ReadS (RegEx token) #

readList :: ReadS [RegEx token] #

readPrec :: ReadPrec (RegEx token) #

readListPrec :: ReadPrec [RegEx token] #

(Categorized token, Show token, Show (Categorize token)) => Show (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

showsPrec :: Int -> RegEx token -> ShowS #

show :: RegEx token -> String #

showList :: [RegEx token] -> ShowS #

Categorized token => KleeneStarAlgebra (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

starK :: RegEx token -> RegEx token Source #

plusK :: RegEx token -> RegEx token Source #

optK :: RegEx token -> RegEx token Source #

(>|<) :: RegEx token -> RegEx token -> RegEx token Source #

zeroK :: RegEx token Source #

NonTerminalSymbol (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

nonTerminal :: String -> RegEx token Source #

Categorized token => Eq (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

(==) :: RegEx token -> RegEx token -> Bool #

(/=) :: RegEx token -> RegEx token -> Bool #

Categorized token => Ord (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

compare :: RegEx token -> RegEx token -> Ordering #

(<) :: RegEx token -> RegEx token -> Bool #

(<=) :: RegEx token -> RegEx token -> Bool #

(>) :: RegEx token -> RegEx token -> Bool #

(>=) :: RegEx token -> RegEx token -> Bool #

max :: RegEx token -> RegEx token -> RegEx token #

min :: RegEx token -> RegEx token -> RegEx token #

Categorized token => Matching [token] (Bnf (RegEx token)) Source # 
Instance details

Defined in Control.Lens.Grammar.Machine

Methods

(=~) :: [token] -> Bnf (RegEx token) -> Bool Source #

Categorized token => Matching [token] (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Machine

Methods

(=~) :: [token] -> RegEx token -> Bool Source #

data (RegEx token) :->: b Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

data (RegEx token) :->: b = RegExTrie {}
type Rep (RegEx token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

type Rep (RegEx token) = D1 ('MetaData "RegEx" "Control.Lens.Grammar.Kleene" "distributors-0.6.0.0-GKdjtvrzrF55FdERGi3FK3" 'False) ((C1 ('MetaCons "SeqEmpty" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "Sequence" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RegEx token)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RegEx token))) :+: C1 ('MetaCons "NonTerminal" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)))) :+: ((C1 ('MetaCons "KleeneStar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RegEx token))) :+: C1 ('MetaCons "KleeneOpt" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RegEx token)))) :+: (C1 ('MetaCons "KleenePlus" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RegEx token))) :+: C1 ('MetaCons "RegExam" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RegExam token (RegEx token)))))))

newtype TokenClass token Source #

TokenClass forms a Tokenized BooleanAlgebra, such that the following invariants hold.

trueB = anyToken
trueB = notOneOf []
falseB = oneOf []
notB . oneOf = notOneOf
notB . notOneOf = oneOf
notB . asIn = notAsIn
notB . notAsIn = asIn

Constructors

TokenClass (RegExam token (TokenClass token)) 

Instances

Instances details
Categorized token => TokenAlgebra token (TokenClass token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

tokenClass :: TokenClass token -> TokenClass token Source #

Categorized token => Tokenized token (TokenClass token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

anyToken :: TokenClass token Source #

token :: token -> TokenClass token Source #

oneOf :: Foldable f => f token -> TokenClass token Source #

notOneOf :: Foldable f => f token -> TokenClass token Source #

asIn :: Categorize token -> TokenClass token Source #

notAsIn :: Categorize token -> TokenClass token Source #

Categorized token => TokenAlgebra token (RegExam token (TokenClass token)) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

tokenClass :: TokenClass token -> RegExam token (TokenClass token) Source #

Generic (TokenClass token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Associated Types

type Rep (TokenClass token) 
Instance details

Defined in Control.Lens.Grammar.Kleene

type Rep (TokenClass token) = D1 ('MetaData "TokenClass" "Control.Lens.Grammar.Kleene" "distributors-0.6.0.0-GKdjtvrzrF55FdERGi3FK3" 'True) (C1 ('MetaCons "TokenClass" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RegExam token (TokenClass token)))))

Methods

from :: TokenClass token -> Rep (TokenClass token) x #

to :: Rep (TokenClass token) x -> TokenClass token #

(Categorized token, Read token, Read (Categorize token)) => Read (TokenClass token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

readsPrec :: Int -> ReadS (TokenClass token) #

readList :: ReadS [TokenClass token] #

readPrec :: ReadPrec (TokenClass token) #

readListPrec :: ReadPrec [TokenClass token] #

(Categorized token, Show token, Show (Categorize token)) => Show (TokenClass token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

showsPrec :: Int -> TokenClass token -> ShowS #

show :: TokenClass token -> String #

showList :: [TokenClass token] -> ShowS #

Categorized token => BooleanAlgebra (TokenClass token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

(>&&<) :: TokenClass token -> TokenClass token -> TokenClass token Source #

(>||<) :: TokenClass token -> TokenClass token -> TokenClass token Source #

notB :: TokenClass token -> TokenClass token Source #

trueB :: TokenClass token Source #

falseB :: TokenClass token Source #

Categorized token => Eq (TokenClass token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

(==) :: TokenClass token -> TokenClass token -> Bool #

(/=) :: TokenClass token -> TokenClass token -> Bool #

Categorized token => Ord (TokenClass token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

compare :: TokenClass token -> TokenClass token -> Ordering #

(<) :: TokenClass token -> TokenClass token -> Bool #

(<=) :: TokenClass token -> TokenClass token -> Bool #

(>) :: TokenClass token -> TokenClass token -> Bool #

(>=) :: TokenClass token -> TokenClass token -> Bool #

max :: TokenClass token -> TokenClass token -> TokenClass token #

min :: TokenClass token -> TokenClass token -> TokenClass token #

Categorized token => BooleanAlgebra (RegExam token (TokenClass token)) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

(>&&<) :: RegExam token (TokenClass token) -> RegExam token (TokenClass token) -> RegExam token (TokenClass token) Source #

(>||<) :: RegExam token (TokenClass token) -> RegExam token (TokenClass token) -> RegExam token (TokenClass token) Source #

notB :: RegExam token (TokenClass token) -> RegExam token (TokenClass token) Source #

trueB :: RegExam token (TokenClass token) Source #

falseB :: RegExam token (TokenClass token) Source #

type Rep (TokenClass token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

type Rep (TokenClass token) = D1 ('MetaData "TokenClass" "Control.Lens.Grammar.Kleene" "distributors-0.6.0.0-GKdjtvrzrF55FdERGi3FK3" 'True) (C1 ('MetaCons "TokenClass" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RegExam token (TokenClass token)))))

data RegExam token alg Source #

A component of both RegExpressions and TokenClasses, so that the latter can be embedded in the former with tokenClass.

Constructors

OneOf (Set token) 
NotOneOf (Set token) (CategoryTest token) 
Alternate alg alg 

Instances

Instances details
Generic1 (RegExam token :: Type -> Type) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Associated Types

type Rep1 (RegExam token :: Type -> Type) 
Instance details

Defined in Control.Lens.Grammar.Kleene

type Rep1 (RegExam token :: Type -> Type) = D1 ('MetaData "RegExam" "Control.Lens.Grammar.Kleene" "distributors-0.6.0.0-GKdjtvrzrF55FdERGi3FK3" 'False) (C1 ('MetaCons "OneOf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set token))) :+: (C1 ('MetaCons "NotOneOf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set token)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (CategoryTest token))) :+: C1 ('MetaCons "Alternate" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1)))

Methods

from1 :: RegExam token a -> Rep1 (RegExam token) a #

to1 :: Rep1 (RegExam token) a -> RegExam token a #

Categorized token => TokenAlgebra token (RegExam token (TokenClass token)) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

tokenClass :: TokenClass token -> RegExam token (TokenClass token) Source #

Categorized token => Tokenized token (RegExam token alg) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

anyToken :: RegExam token alg Source #

token :: token -> RegExam token alg Source #

oneOf :: Foldable f => f token -> RegExam token alg Source #

notOneOf :: Foldable f => f token -> RegExam token alg Source #

asIn :: Categorize token -> RegExam token alg Source #

notAsIn :: Categorize token -> RegExam token alg Source #

Foldable (RegExam token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

fold :: Monoid m => RegExam token m -> m #

foldMap :: Monoid m => (a -> m) -> RegExam token a -> m #

foldMap' :: Monoid m => (a -> m) -> RegExam token a -> m #

foldr :: (a -> b -> b) -> b -> RegExam token a -> b #

foldr' :: (a -> b -> b) -> b -> RegExam token a -> b #

foldl :: (b -> a -> b) -> b -> RegExam token a -> b #

foldl' :: (b -> a -> b) -> b -> RegExam token a -> b #

foldr1 :: (a -> a -> a) -> RegExam token a -> a #

foldl1 :: (a -> a -> a) -> RegExam token a -> a #

toList :: RegExam token a -> [a] #

null :: RegExam token a -> Bool #

length :: RegExam token a -> Int #

elem :: Eq a => a -> RegExam token a -> Bool #

maximum :: Ord a => RegExam token a -> a #

minimum :: Ord a => RegExam token a -> a #

sum :: Num a => RegExam token a -> a #

product :: Num a => RegExam token a -> a #

Traversable (RegExam token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

traverse :: Applicative f => (a -> f b) -> RegExam token a -> f (RegExam token b) #

sequenceA :: Applicative f => RegExam token (f a) -> f (RegExam token a) #

mapM :: Monad m => (a -> m b) -> RegExam token a -> m (RegExam token b) #

sequence :: Monad m => RegExam token (m a) -> m (RegExam token a) #

Functor (RegExam token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

fmap :: (a -> b) -> RegExam token a -> RegExam token b #

(<$) :: a -> RegExam token b -> RegExam token a #

Generic (RegExam token alg) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Associated Types

type Rep (RegExam token alg) 
Instance details

Defined in Control.Lens.Grammar.Kleene

type Rep (RegExam token alg) = D1 ('MetaData "RegExam" "Control.Lens.Grammar.Kleene" "distributors-0.6.0.0-GKdjtvrzrF55FdERGi3FK3" 'False) (C1 ('MetaCons "OneOf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set token))) :+: (C1 ('MetaCons "NotOneOf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set token)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (CategoryTest token))) :+: C1 ('MetaCons "Alternate" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 alg) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 alg))))

Methods

from :: RegExam token alg -> Rep (RegExam token alg) x #

to :: Rep (RegExam token alg) x -> RegExam token alg #

(Categorized token, Read token, Read alg, Read (Categorize token)) => Read (RegExam token alg) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

readsPrec :: Int -> ReadS (RegExam token alg) #

readList :: ReadS [RegExam token alg] #

readPrec :: ReadPrec (RegExam token alg) #

readListPrec :: ReadPrec [RegExam token alg] #

(Categorized token, Show token, Show alg, Show (Categorize token)) => Show (RegExam token alg) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

showsPrec :: Int -> RegExam token alg -> ShowS #

show :: RegExam token alg -> String #

showList :: [RegExam token alg] -> ShowS #

Categorized token => BooleanAlgebra (RegExam token (TokenClass token)) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

(>&&<) :: RegExam token (TokenClass token) -> RegExam token (TokenClass token) -> RegExam token (TokenClass token) Source #

(>||<) :: RegExam token (TokenClass token) -> RegExam token (TokenClass token) -> RegExam token (TokenClass token) Source #

notB :: RegExam token (TokenClass token) -> RegExam token (TokenClass token) Source #

trueB :: RegExam token (TokenClass token) Source #

falseB :: RegExam token (TokenClass token) Source #

(Categorized token, Eq alg) => Eq (RegExam token alg) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

(==) :: RegExam token alg -> RegExam token alg -> Bool #

(/=) :: RegExam token alg -> RegExam token alg -> Bool #

(Categorized token, Ord alg) => Ord (RegExam token alg) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

compare :: RegExam token alg -> RegExam token alg -> Ordering #

(<) :: RegExam token alg -> RegExam token alg -> Bool #

(<=) :: RegExam token alg -> RegExam token alg -> Bool #

(>) :: RegExam token alg -> RegExam token alg -> Bool #

(>=) :: RegExam token alg -> RegExam token alg -> Bool #

max :: RegExam token alg -> RegExam token alg -> RegExam token alg #

min :: RegExam token alg -> RegExam token alg -> RegExam token alg #

type Rep1 (RegExam token :: Type -> Type) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

type Rep1 (RegExam token :: Type -> Type) = D1 ('MetaData "RegExam" "Control.Lens.Grammar.Kleene" "distributors-0.6.0.0-GKdjtvrzrF55FdERGi3FK3" 'False) (C1 ('MetaCons "OneOf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set token))) :+: (C1 ('MetaCons "NotOneOf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set token)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (CategoryTest token))) :+: C1 ('MetaCons "Alternate" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1)))
type Rep (RegExam token alg) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

type Rep (RegExam token alg) = D1 ('MetaData "RegExam" "Control.Lens.Grammar.Kleene" "distributors-0.6.0.0-GKdjtvrzrF55FdERGi3FK3" 'False) (C1 ('MetaCons "OneOf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set token))) :+: (C1 ('MetaCons "NotOneOf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set token)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (CategoryTest token))) :+: C1 ('MetaCons "Alternate" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 alg) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 alg))))

data CategoryTest token Source #

CategoryTests for Categorized tokens.

Constructors

AndAsIn (Categorize token) 
AndNotAsIn (Set (Categorize token)) 

Instances

Instances details
Generic (CategoryTest token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Associated Types

type Rep (CategoryTest token) 
Instance details

Defined in Control.Lens.Grammar.Kleene

type Rep (CategoryTest token) = D1 ('MetaData "CategoryTest" "Control.Lens.Grammar.Kleene" "distributors-0.6.0.0-GKdjtvrzrF55FdERGi3FK3" 'False) (C1 ('MetaCons "AndAsIn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Categorize token))) :+: C1 ('MetaCons "AndNotAsIn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set (Categorize token)))))

Methods

from :: CategoryTest token -> Rep (CategoryTest token) x #

to :: Rep (CategoryTest token) x -> CategoryTest token #

(Categorized token, Read token, Read (Categorize token)) => Read (CategoryTest token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

readsPrec :: Int -> ReadS (CategoryTest token) #

readList :: ReadS [CategoryTest token] #

readPrec :: ReadPrec (CategoryTest token) #

readListPrec :: ReadPrec [CategoryTest token] #

(Categorized token, Show token, Show (Categorize token)) => Show (CategoryTest token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

showsPrec :: Int -> CategoryTest token -> ShowS #

show :: CategoryTest token -> String #

showList :: [CategoryTest token] -> ShowS #

Categorized token => Eq (CategoryTest token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

(==) :: CategoryTest token -> CategoryTest token -> Bool #

(/=) :: CategoryTest token -> CategoryTest token -> Bool #

Categorized token => Ord (CategoryTest token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

Methods

compare :: CategoryTest token -> CategoryTest token -> Ordering #

(<) :: CategoryTest token -> CategoryTest token -> Bool #

(<=) :: CategoryTest token -> CategoryTest token -> Bool #

(>) :: CategoryTest token -> CategoryTest token -> Bool #

(>=) :: CategoryTest token -> CategoryTest token -> Bool #

max :: CategoryTest token -> CategoryTest token -> CategoryTest token #

min :: CategoryTest token -> CategoryTest token -> CategoryTest token #

type Rep (CategoryTest token) Source # 
Instance details

Defined in Control.Lens.Grammar.Kleene

type Rep (CategoryTest token) = D1 ('MetaData "CategoryTest" "Control.Lens.Grammar.Kleene" "distributors-0.6.0.0-GKdjtvrzrF55FdERGi3FK3" 'False) (C1 ('MetaCons "AndAsIn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Categorize token))) :+: C1 ('MetaCons "AndNotAsIn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set (Categorize token)))))