Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Documentation
class Classified c t | t -> c where Source #
data RegexResult o u Source #
RegexResult | |
|
Instances
newtype RegexInfo o u Source #
RegexInfo | |
|
Instances
(Show o, Show u) => Show (RegexInfo o u) Source # | |
(Eq o, Eq u) => Eq (RegexInfo o u) Source # | |
(Ord o, Ord u) => Ord (RegexInfo o u) Source # | |
Defined in UVMHS.Lib.Parser.Regex compare :: RegexInfo o u -> RegexInfo o u -> Ordering # (<) :: RegexInfo o u -> RegexInfo o u -> Bool # (<=) :: RegexInfo o u -> RegexInfo o u -> Bool # (>) :: RegexInfo o u -> RegexInfo o u -> Bool # (>=) :: RegexInfo o u -> RegexInfo o u -> Bool # | |
Ord u => Append (RegexInfo o u) Source # | |
Zero u => Eps (RegexInfo o u) Source # | |
Defined in UVMHS.Lib.Parser.Regex | |
(Ord u, Zero u) => Monoid (RegexInfo o u) Source # | |
Defined in UVMHS.Lib.Parser.Regex | |
Zero u => Null (RegexInfo o u) Source # | |
Defined in UVMHS.Lib.Parser.Regex | |
(Ord u, Plus u) => Seq (RegexInfo o u) Source # | |
(Ord u, Additive u) => Seqoid (RegexInfo o u) Source # | |
Defined in UVMHS.Lib.Parser.Regex | |
Pretty (𝑂 (RegexResult o u)) => Pretty (RegexInfo o u) Source # | |
newtype Regex c t o u Source #
Instances
(Show o, Show u, Show t, Show c) => Show (Regex c t o u) Source # | |
(Eq o, Eq u, Eq t, Eq c) => Eq (Regex c t o u) Source # | |
(Ord o, Ord u, Ord t, Ord c) => Ord (Regex c t o u) Source # | |
Defined in UVMHS.Lib.Parser.Regex compare :: Regex c t o u -> Regex c t o u -> Ordering # (<) :: Regex c t o u -> Regex c t o u -> Bool # (<=) :: Regex c t o u -> Regex c t o u -> Bool # (>) :: Regex c t o u -> Regex c t o u -> Bool # (>=) :: Regex c t o u -> Regex c t o u -> Bool # | |
(Ord c, Ord t, Ord o, Ord u, Plus u) => Append (Regex c t o u) Source # | |
(Ord c, Ord t, Ord o, Ord u, Zero u) => Eps (Regex c t o u) Source # | |
Defined in UVMHS.Lib.Parser.Regex | |
(Ord c, Ord t, Ord o, Ord u, Additive u) => Kleene (Regex c t o u) Source # | |
Defined in UVMHS.Lib.Parser.Regex | |
(Ord c, Ord t, Ord o, Ord u, Additive u) => Monoid (Regex c t o u) Source # | |
Defined in UVMHS.Lib.Parser.Regex | |
Zero u => Null (Regex c t o u) Source # | |
Defined in UVMHS.Lib.Parser.Regex | |
(Ord c, Ord t, Ord o, Ord u, Additive u) => Seq (Regex c t o u) Source # | |
(Ord c, Ord t, Ord o, Ord u, Additive u) => Seqoid (Regex c t o u) Source # | |
Defined in UVMHS.Lib.Parser.Regex | |
(Ord c, Ord t, Ord o, Ord u, Zero u) => Star (Regex c t o u) Source # | |
NullR | |
ResR (RegexResult o u) | |
AtomR (RegexResult o u) (RegexAtom c t o u) | |
SumsR (𝑃 (Regex c t o u)) | |
SeqsR (𝐿 (Regex c t o u)) | |
StarR (RegexResult o u) (Regex c t o u) |
Instances
(Show o, Show u, Show t, Show c) => Show (RegexU c t o u) Source # | |
(Eq o, Eq u, Eq t, Eq c) => Eq (RegexU c t o u) Source # | |
(Ord o, Ord u, Ord t, Ord c) => Ord (RegexU c t o u) Source # | |
Defined in UVMHS.Lib.Parser.Regex compare :: RegexU c t o u -> RegexU c t o u -> Ordering # (<) :: RegexU c t o u -> RegexU c t o u -> Bool # (<=) :: RegexU c t o u -> RegexU c t o u -> Bool # (>) :: RegexU c t o u -> RegexU c t o u -> Bool # (>=) :: RegexU c t o u -> RegexU c t o u -> Bool # | |
(Pretty (RegexResult o u), Pretty (RegexAtom c t o u), Pretty (𝑃 (Regex c t o u)), Pretty (𝐿 (Regex c t o u)), Pretty (Regex c t o u)) => Pretty (RegexU c t o u) Source # | |
data RegexAtom c t o u Source #
Instances
(Show t, Show c) => Show (RegexAtom c t o u) Source # | |
(Eq t, Eq c) => Eq (RegexAtom c t o u) Source # | |
(Ord t, Ord c) => Ord (RegexAtom c t o u) Source # | |
Defined in UVMHS.Lib.Parser.Regex compare :: RegexAtom c t o u -> RegexAtom c t o u -> Ordering # (<) :: RegexAtom c t o u -> RegexAtom c t o u -> Bool # (<=) :: RegexAtom c t o u -> RegexAtom c t o u -> Bool # (>) :: RegexAtom c t o u -> RegexAtom c t o u -> Bool # (>=) :: RegexAtom c t o u -> RegexAtom c t o u -> Bool # max :: RegexAtom c t o u -> RegexAtom c t o u -> RegexAtom c t o u # min :: RegexAtom c t o u -> RegexAtom c t o u -> RegexAtom c t o u # | |
(Pretty t, Pretty (𝑃 t), Pretty c) => Pretty (RegexAtom c t o u) Source # | |
retRegex :: (Ord c, Ord t, Ord o, Ord u, Zero u) => ℕ64 -> Formats -> 𝑂 o -> u -> Regex c t o u Source #
consEpsRegex :: (Ord c, Ord t, Ord o, Ord u, Plus u) => RegexResult o u -> Regex c t o u -> Regex c t o u Source #
consEpsRegexU :: (Ord c, Ord t, Ord o, Ord u, Plus u) => RegexResult o u -> RegexU c t o u -> RegexU c t o u Source #
snocEpsRegex :: (Ord c, Ord t, Ord o, Ord u, Plus u) => RegexResult o u -> Regex c t o u -> Regex c t o u Source #
snocEpsRegexU :: (Ord c, Ord t, Ord o, Ord u, Plus u) => RegexResult o u -> RegexU c t o u -> RegexU c t o u Source #
sumRegex :: (Ord c, Ord t, Ord o, Ord u, Plus u) => Regex c t o u -> Regex c t o u -> Regex c t o u Source #
seqRegex :: (Ord c, Ord t, Ord o, Ord u, Additive u) => Regex c t o u -> Regex c t o u -> Regex c t o u Source #
derRegex :: (Ord c, Ord t, Classified c t, Ord o, Ord u, Additive u) => (t ∨ c) -> Regex c t o u -> Regex c t o u Source #
derRegexAtom :: (Ord c, Ord t, Classified c t, Ord o, Ord u, Additive u) => (t ∨ c) -> RegexAtom c t o u -> Regex c t o u Source #
derRegexSequence :: (Ord t, Ord c, Classified c t, Ord o, Ord u, Additive u) => (t ∨ c) -> 𝐿 (Regex c t o u) -> Regex c t o u Source #
data RegexState c t o u Source #
RegexState | |
|
regexStateDeadL :: forall (c :: Type) (t :: Type) (o :: Type) (u :: Type). (⟢) (RegexState c t o u) ((⇰) ℕ64 𝔹) Source #
regexStateResultsL :: forall (c :: Type) (t :: Type) (o :: Type) (u :: Type). (⟢) (RegexState c t o u) ((⇰) ℕ64 (𝑂 (RegexResult o u))) Source #
regexStateTransitionsL :: forall (c :: Type) (t :: Type) (o :: Type) (u :: Type). (⟢) (RegexState c t o u) ((⇰) ((∨) t c) ((⇰) ℕ64 ℕ64)) Source #
regexStateMapL :: forall (c :: Type) (t :: Type) (o :: Type) (u :: Type). (⟢) (RegexState c t o u) ((⇰) (Regex c t o u) ℕ64) Source #
regexStateNextIDL :: forall (c :: Type) (t :: Type) (o :: Type) (u :: Type). (⟢) (RegexState c t o u) ℕ64 Source #
regexState₀ :: RegexState c t o u Source #
compileRegex :: forall c t o u. (Pretty t, Pretty o, Pretty u, Ord c, Ord t, Classified c t, All c, Ord o, Ord u, Additive u) => Regex c t o u -> DFA c t o u Source #
data LexDFAState t Source #
LexDFAState | |
|
Instances
(Pretty (WindowR Doc Doc), Pretty ParserContext, Pretty (𝑆 (ParserToken t)), Pretty (𝐼C t)) => Pretty (LexDFAState t) Source # | |
Defined in UVMHS.Lib.Parser.Regex pretty :: LexDFAState t -> Doc Source # |
Lexer | |
|
tokenize :: forall c t o u w. (Show u, Ord c, Ord t, Pretty t, Classified c t, Eq o, Eq u, Plus u) => Lexer c t o u w -> 𝕊 -> 𝕍 (ParserToken t) -> Doc ∨ 𝕍 (PreParserToken w) Source #
tokenizeFIO :: forall c t o u w w'. (Show u, Ord c, Ord t, Pretty t, Classified c t, Eq o, Eq u, Plus u) => Lexer c t o u w -> 𝕊 -> (𝕍 (PreParserToken w) -> 𝕍 (PreParserToken w')) -> 𝕍 (ParserToken t) -> IO (𝕍 (ParserToken w')) Source #
tokenizeIO :: forall c t o u w. (Show u, Ord c, Ord t, Pretty t, Classified c t, Eq o, Eq u, Plus u) => Lexer c t o u w -> 𝕊 -> 𝕍 (ParserToken t) -> IO (𝕍 (ParserToken w)) Source #
tokenizeFIOMain :: forall c t o u w w'. (Show u, Ord c, Ord t, Pretty t, Classified c t, Eq o, Eq u, Plus u, Pretty w') => Lexer c t o u w -> 𝕊 -> (𝕍 (PreParserToken w) -> 𝕍 (PreParserToken w')) -> 𝕍 (ParserToken t) -> IO () Source #
tokenizeIOMain :: forall c t o u w. (Show u, Ord c, Ord t, Pretty t, Classified c t, Eq o, Eq u, Plus u, Pretty w) => Lexer c t o u w -> 𝕊 -> 𝕍 (ParserToken t) -> IO () Source #
data TokenClassBasic Source #
SpaceCBasic | |
CommentCBasic | |
SyntaxCBasic | |
StringCBasic | |
NameCBasic | |
NaturalCBasic | |
IntegerCBasic | |
DoubleCBasic | |
CharCBasic |
Instances
Show TokenClassBasic Source # | |
Defined in UVMHS.Lib.Parser.Regex showsPrec :: Int -> TokenClassBasic -> ShowS # show :: TokenClassBasic -> String # showList :: [TokenClassBasic] -> ShowS # | |
Eq TokenClassBasic Source # | |
Defined in UVMHS.Lib.Parser.Regex (==) :: TokenClassBasic -> TokenClassBasic -> Bool # (/=) :: TokenClassBasic -> TokenClassBasic -> Bool # | |
Ord TokenClassBasic Source # | |
Defined in UVMHS.Lib.Parser.Regex compare :: TokenClassBasic -> TokenClassBasic -> Ordering # (<) :: TokenClassBasic -> TokenClassBasic -> Bool # (<=) :: TokenClassBasic -> TokenClassBasic -> Bool # (>) :: TokenClassBasic -> TokenClassBasic -> Bool # (>=) :: TokenClassBasic -> TokenClassBasic -> Bool # max :: TokenClassBasic -> TokenClassBasic -> TokenClassBasic # min :: TokenClassBasic -> TokenClassBasic -> TokenClassBasic # | |
Pretty TokenClassBasic Source # | |
Defined in UVMHS.Lib.Parser.Regex pretty :: TokenClassBasic -> Doc Source # |
data TokenBasic Source #
SpaceTBasic 𝕊 | |
CommentTBasic 𝕊 | |
SyntaxTBasic 𝕊 | |
StringTBasic 𝕊 | |
NameTBasic 𝕊 | |
NaturalTBasic ℕ | |
IntegerTBasic ℤ | |
DoubleTBasic 𝔻 | |
CharTBasic ℂ |
Instances
Show TokenBasic Source # | |
Defined in UVMHS.Lib.Parser.Regex showsPrec :: Int -> TokenBasic -> ShowS # show :: TokenBasic -> String # showList :: [TokenBasic] -> ShowS # | |
Eq TokenBasic Source # | |
Defined in UVMHS.Lib.Parser.Regex (==) :: TokenBasic -> TokenBasic -> Bool # (/=) :: TokenBasic -> TokenBasic -> Bool # | |
Ord TokenBasic Source # | |
Defined in UVMHS.Lib.Parser.Regex compare :: TokenBasic -> TokenBasic -> Ordering # (<) :: TokenBasic -> TokenBasic -> Bool # (<=) :: TokenBasic -> TokenBasic -> Bool # (>) :: TokenBasic -> TokenBasic -> Bool # (>=) :: TokenBasic -> TokenBasic -> Bool # max :: TokenBasic -> TokenBasic -> TokenBasic # min :: TokenBasic -> TokenBasic -> TokenBasic # | |
(Pretty 𝕊, Pretty ℕ, Pretty ℤ, Pretty 𝔻, Pretty ℂ) => Pretty TokenBasic Source # | |
Defined in UVMHS.Lib.Parser.Regex pretty :: TokenBasic -> Doc Source # |
charTBasicL :: (⌲) TokenBasic ℂ Source #
nameTBasicL :: (⌲) TokenBasic 𝕊 Source #
mkTokenBasic :: 𝐼C ℂ -> 𝑂 TokenClassBasic -> 𝔹 ∧ TokenBasic Source #
lSyntaxBasic :: (Ord u, Additive u) => 𝐿 𝕊 -> 𝐿 𝕊 -> 𝐿 𝕊 -> 𝐿 𝕊 -> Regex CharClass ℂ TokenClassBasic u Source #
blockifyTokens :: forall t. 𝐿 (AddBT Loc) -> (t -> 𝔹) -> (t -> 𝔹) -> (IndentCommand -> t) -> 𝕍 (PreParserToken t) -> 𝕍 (PreParserToken t) Source #
blockifyTokensTL :: (t -> 𝔹) -> (t -> 𝔹) -> (IndentCommand -> t) -> 𝕍 (PreParserToken t) -> 𝕍 (PreParserToken t) Source #
data TokenClassWSBasic Source #
SpaceCWSBasic | |
NewlineCWSBasic | |
CommentCWSBasic | |
SyntaxCWSBasic | |
BlockCWSBasic | |
StringCWSBasic | |
NameCWSBasic | |
NaturalCWSBasic | |
IntegerCWSBasic | |
DoubleCWSBasic |
Instances
Show TokenClassWSBasic Source # | |
Defined in UVMHS.Lib.Parser.Regex showsPrec :: Int -> TokenClassWSBasic -> ShowS # show :: TokenClassWSBasic -> String # showList :: [TokenClassWSBasic] -> ShowS # | |
Eq TokenClassWSBasic Source # | |
Defined in UVMHS.Lib.Parser.Regex (==) :: TokenClassWSBasic -> TokenClassWSBasic -> Bool # (/=) :: TokenClassWSBasic -> TokenClassWSBasic -> Bool # | |
Ord TokenClassWSBasic Source # | |
Defined in UVMHS.Lib.Parser.Regex compare :: TokenClassWSBasic -> TokenClassWSBasic -> Ordering # (<) :: TokenClassWSBasic -> TokenClassWSBasic -> Bool # (<=) :: TokenClassWSBasic -> TokenClassWSBasic -> Bool # (>) :: TokenClassWSBasic -> TokenClassWSBasic -> Bool # (>=) :: TokenClassWSBasic -> TokenClassWSBasic -> Bool # max :: TokenClassWSBasic -> TokenClassWSBasic -> TokenClassWSBasic # min :: TokenClassWSBasic -> TokenClassWSBasic -> TokenClassWSBasic # | |
Pretty TokenClassWSBasic Source # | |
Defined in UVMHS.Lib.Parser.Regex pretty :: TokenClassWSBasic -> Doc Source # |
data TokenWSBasic Source #
Instances
Show TokenWSBasic Source # | |
Defined in UVMHS.Lib.Parser.Regex showsPrec :: Int -> TokenWSBasic -> ShowS # show :: TokenWSBasic -> String # showList :: [TokenWSBasic] -> ShowS # | |
Eq TokenWSBasic Source # | |
Defined in UVMHS.Lib.Parser.Regex (==) :: TokenWSBasic -> TokenWSBasic -> Bool # (/=) :: TokenWSBasic -> TokenWSBasic -> Bool # | |
Ord TokenWSBasic Source # | |
Defined in UVMHS.Lib.Parser.Regex compare :: TokenWSBasic -> TokenWSBasic -> Ordering # (<) :: TokenWSBasic -> TokenWSBasic -> Bool # (<=) :: TokenWSBasic -> TokenWSBasic -> Bool # (>) :: TokenWSBasic -> TokenWSBasic -> Bool # (>=) :: TokenWSBasic -> TokenWSBasic -> Bool # max :: TokenWSBasic -> TokenWSBasic -> TokenWSBasic # min :: TokenWSBasic -> TokenWSBasic -> TokenWSBasic # | |
(Pretty 𝕊, Pretty ℕ, Pretty ℤ, Pretty 𝔻) => Pretty TokenWSBasic Source # | |
Defined in UVMHS.Lib.Parser.Regex pretty :: TokenWSBasic -> Doc Source # |
mkTokenWSBasic :: 𝐼C ℂ -> 𝑂 TokenClassWSBasic -> 𝔹 ∧ TokenWSBasic Source #
lSyntaxWSBasic :: (Ord u, Additive u) => 𝐿 𝕊 -> 𝐿 𝕊 -> 𝐿 𝕊 -> 𝐿 𝕊 -> Regex CharClass ℂ TokenClassWSBasic u Source #
lTokenWSBasic :: 𝐿 𝕊 -> 𝐿 𝕊 -> 𝐿 𝕊 -> 𝐿 𝕊 -> 𝐿 𝕊 -> Regex CharClass ℂ TokenClassWSBasic ℕ64 Source #
dfaWSBasic :: 𝐿 𝕊 -> 𝐿 𝕊 -> 𝐿 𝕊 -> 𝐿 𝕊 -> 𝐿 𝕊 -> ℕ64 -> DFA CharClass ℂ TokenClassWSBasic ℕ64 Source #