-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | A staged lexer generator
--   
--   Like <tt>alex</tt>, <tt>sasha</tt> is lexer/scanner generator; but it
--   is using Typed Template Haskell. . The generated scanners are
--   comparable in speed to <tt>alex</tt> generated ones.
@package sasha
@version 0.2

module Sasha.Internal.ERE

-- | Extended regular expression
data ERE

-- | Concatenation
EREAppend :: [ERE] -> ERE

-- | Union
EREUnion :: Word8Set -> Set ERE -> ERE

-- | Kleene star
EREStar :: ERE -> ERE

-- | Complement
ERENot :: ERE -> ERE

-- | Empty regex. Doesn't accept anything.
--   
--   <pre>
--   match empty s === False
--   </pre>
empty :: ERE

-- | Empty string. <i>Note:</i> different than <a>empty</a>.
--   
--   <pre>
--   match eps s === null s
--   </pre>
eps :: ERE

-- | Character.
char :: Word8 -> ERE

-- | Character range.
charRange :: Word8 -> Word8 -> ERE

-- | Character set.
charSet :: Word8Set -> ERE

-- | UTF8 character, i.e. may match multiple bytes.
utf8Char :: Char -> ERE

-- | Any character.
anyChar :: ERE
anyUtf8Char :: ERE

-- | Concatenate regular expressions.
--   
--   <pre>
--   r &lt;&gt; empty === empty
--   </pre>
--   
--   <pre>
--   empty &lt;&gt;  r === empty
--   </pre>
--   
--   <pre>
--   ( r &lt;&gt; s) &lt;&gt; t === r &lt;&gt; (s &lt;&gt; t)
--   </pre>
--   
--   <pre>
--   r &lt;&gt; eps === r
--   </pre>
--   
--   <pre>
--   eps &lt;&gt;  r === r
--   </pre>
appends :: [ERE] -> ERE

-- | Union of regular expressions.
--   
--   <pre>
--   r \/ r === r
--   </pre>
--   
--   <pre>
--   r \/ s === s \/ r
--   </pre>
--   
--   <pre>
--   ( r \/ s) \/ t === r \/ (s \/ t)
--   </pre>
--   
--   <pre>
--   empty \/  r === r
--   </pre>
--   
--   <pre>
--   r \/ empty === r
--   </pre>
--   
--   <pre>
--   everything \/  r === everything
--   </pre>
--   
--   <pre>
--   r \/ everything === everything
--   </pre>
unions :: [ERE] -> ERE

-- | Intersection of regular expressions.
--   
--   <pre>
--   r /\ r === r
--   </pre>
--   
--   <pre>
--   r /\ s === s /\ r
--   </pre>
--   
--   <pre>
--   ( r /\ s) /\ t === r /\ (s /\ t)
--   </pre>
--   
--   <pre>
--   empty /\  r === empty
--   </pre>
--   
--   <pre>
--   r /\ empty === empty
--   </pre>
--   
--   <pre>
--   everything /\  r === r
--   </pre>
--   
--   <pre>
--   r /\ everything === r
--   </pre>
intersections :: [ERE] -> ERE

-- | Kleene star.
--   
--   <pre>
--   star (star r) === star ( r)
--   </pre>
--   
--   <pre>
--   star eps     ===  eps
--   </pre>
--   
--   <pre>
--   star empty   ===  eps
--   </pre>
--   
--   <pre>
--   star anyChar ===  everything
--   </pre>
--   
--   <pre>
--   star (r \/ eps) === star r
--   </pre>
--   
--   <pre>
--   star (char c \/ eps) === star (char c)
--   </pre>
--   
--   <pre>
--   star (empty \/ eps) === eps
--   </pre>
star :: ERE -> ERE

-- | Kleene plus
--   
--   <pre>
--   <a>plus</a> r = r &lt;&gt; <a>star</a> r
--   </pre>
plus :: ERE -> ERE

-- | Literal string.
string :: [Word8] -> ERE

-- | UTF8 string
utf8String :: String -> ERE

-- | Complement.
--   
--   <pre>
--   complement (complement r) ===  r
--   </pre>
complement :: ERE -> ERE

-- | Everything.
--   
--   <pre>
--   match everything s === True
--   </pre>
everything :: ERE
satisfy :: (Word8 -> Bool) -> ERE
digit :: ERE
equivalent :: ERE -> ERE -> Bool

-- | We say that a regular expression r is nullable if the language it
--   defines contains the empty string.
--   
--   <pre>
--   &gt;&gt;&gt; nullable eps
--   True
--   </pre>
--   
--   <pre>
--   &gt;&gt;&gt; nullable (star "x")
--   True
--   </pre>
--   
--   <pre>
--   &gt;&gt;&gt; nullable "foo"
--   False
--   </pre>
--   
--   <pre>
--   &gt;&gt;&gt; nullable (complement eps)
--   False
--   </pre>
nullable :: ERE -> Bool

-- | Intuitively, the derivative of a language &lt;math&gt; with respect to
--   a symbol &lt;math&gt; is the language that includes only those
--   suffixes of strings with a leading symbol &lt;math&gt; in
--   &lt;math&gt;.
derivative :: Word8 -> ERE -> ERE
match :: ERE -> [Word8] -> Bool

-- | Whether <a>ERE</a> is (structurally) equal to <a>empty</a>.
isEmpty :: ERE -> Bool

-- | Whether <a>ERE</a> is (structurally) equal to <a>everything</a>.
isEverything :: ERE -> Bool
instance GHC.Show.Show Sasha.Internal.ERE.ERE
instance GHC.Classes.Ord Sasha.Internal.ERE.ERE
instance GHC.Classes.Eq Sasha.Internal.ERE.ERE
instance GHC.Base.Semigroup Sasha.Internal.ERE.ERE
instance GHC.Base.Monoid Sasha.Internal.ERE.ERE
instance Algebra.Lattice.Lattice Sasha.Internal.ERE.ERE
instance Algebra.Lattice.BoundedJoinSemiLattice Sasha.Internal.ERE.ERE
instance Algebra.Lattice.BoundedMeetSemiLattice Sasha.Internal.ERE.ERE
instance Data.String.IsString Sasha.Internal.ERE.ERE
instance Test.QuickCheck.Arbitrary.Arbitrary Sasha.Internal.ERE.ERE

module Sasha

-- | Lexer grammar specification: regular expression and result builder
--   function which takes a prefix (the matching part) and a suffix (the
--   rest of input).
type Sasha r = [(ERE, ByteString -> ByteString -> r)]

-- | Scan for a single token.
sasha :: forall r. r -> Sasha r -> ByteString -> r

-- | Extended regular expression
data ERE

-- | Empty regex. Doesn't accept anything.
--   
--   <pre>
--   match empty s === False
--   </pre>
empty :: ERE

-- | Empty string. <i>Note:</i> different than <a>empty</a>.
--   
--   <pre>
--   match eps s === null s
--   </pre>
eps :: ERE

-- | Character.
char :: Word8 -> ERE

-- | Character range.
charRange :: Word8 -> Word8 -> ERE

-- | Character set.
charSet :: Word8Set -> ERE

-- | UTF8 character, i.e. may match multiple bytes.
utf8Char :: Char -> ERE

-- | Any character.
anyChar :: ERE
anyUtf8Char :: ERE

-- | Concatenate regular expressions.
--   
--   <pre>
--   r &lt;&gt; empty === empty
--   </pre>
--   
--   <pre>
--   empty &lt;&gt;  r === empty
--   </pre>
--   
--   <pre>
--   ( r &lt;&gt; s) &lt;&gt; t === r &lt;&gt; (s &lt;&gt; t)
--   </pre>
--   
--   <pre>
--   r &lt;&gt; eps === r
--   </pre>
--   
--   <pre>
--   eps &lt;&gt;  r === r
--   </pre>
appends :: [ERE] -> ERE

-- | Union of regular expressions.
--   
--   <pre>
--   r \/ r === r
--   </pre>
--   
--   <pre>
--   r \/ s === s \/ r
--   </pre>
--   
--   <pre>
--   ( r \/ s) \/ t === r \/ (s \/ t)
--   </pre>
--   
--   <pre>
--   empty \/  r === r
--   </pre>
--   
--   <pre>
--   r \/ empty === r
--   </pre>
--   
--   <pre>
--   everything \/  r === everything
--   </pre>
--   
--   <pre>
--   r \/ everything === everything
--   </pre>
unions :: [ERE] -> ERE

-- | Intersection of regular expressions.
--   
--   <pre>
--   r /\ r === r
--   </pre>
--   
--   <pre>
--   r /\ s === s /\ r
--   </pre>
--   
--   <pre>
--   ( r /\ s) /\ t === r /\ (s /\ t)
--   </pre>
--   
--   <pre>
--   empty /\  r === empty
--   </pre>
--   
--   <pre>
--   r /\ empty === empty
--   </pre>
--   
--   <pre>
--   everything /\  r === r
--   </pre>
--   
--   <pre>
--   r /\ everything === r
--   </pre>
intersections :: [ERE] -> ERE

-- | Kleene star.
--   
--   <pre>
--   star (star r) === star ( r)
--   </pre>
--   
--   <pre>
--   star eps     ===  eps
--   </pre>
--   
--   <pre>
--   star empty   ===  eps
--   </pre>
--   
--   <pre>
--   star anyChar ===  everything
--   </pre>
--   
--   <pre>
--   star (r \/ eps) === star r
--   </pre>
--   
--   <pre>
--   star (char c \/ eps) === star (char c)
--   </pre>
--   
--   <pre>
--   star (empty \/ eps) === eps
--   </pre>
star :: ERE -> ERE

-- | Kleene plus
--   
--   <pre>
--   <a>plus</a> r = r &lt;&gt; <a>star</a> r
--   </pre>
plus :: ERE -> ERE

-- | Literal string.
string :: [Word8] -> ERE

-- | UTF8 string
utf8String :: String -> ERE

-- | Complement.
--   
--   <pre>
--   complement (complement r) ===  r
--   </pre>
complement :: ERE -> ERE
satisfy :: (Word8 -> Bool) -> ERE
digit :: ERE

module Sasha.Internal.Word8Set

-- | Optimized routing to check membership when <a>Word8Set</a> is
--   statically known.
--   
--   <pre>
--   <a>memberCode</a> c ws = [||<tt>member</tt> $$c $$(liftTyped ws) ||]
--   </pre>
memberCode :: Code Q Word8 -> Word8Set -> Code Q Bool

module Sasha.TTH

-- | Lexer grammar specification: regular expression and result builder
--   function which takes a prefix (the matching part) and a suffix (the
--   rest of input).
type SaTTH r = [(ERE, Code Q ByteString -> Code Q ByteString -> Code Q r)]

-- | Scan for a single token.
satth :: forall r. Code Q r -> SaTTH r -> Code Q (ByteString -> r)

-- | Extended regular expression
data ERE

-- | Empty regex. Doesn't accept anything.
--   
--   <pre>
--   match empty s === False
--   </pre>
empty :: ERE

-- | Empty string. <i>Note:</i> different than <a>empty</a>.
--   
--   <pre>
--   match eps s === null s
--   </pre>
eps :: ERE

-- | Character.
char :: Word8 -> ERE

-- | Character range.
charRange :: Word8 -> Word8 -> ERE

-- | Character set.
charSet :: Word8Set -> ERE

-- | UTF8 character, i.e. may match multiple bytes.
utf8Char :: Char -> ERE

-- | Any character.
anyChar :: ERE
anyUtf8Char :: ERE

-- | Concatenate regular expressions.
--   
--   <pre>
--   r &lt;&gt; empty === empty
--   </pre>
--   
--   <pre>
--   empty &lt;&gt;  r === empty
--   </pre>
--   
--   <pre>
--   ( r &lt;&gt; s) &lt;&gt; t === r &lt;&gt; (s &lt;&gt; t)
--   </pre>
--   
--   <pre>
--   r &lt;&gt; eps === r
--   </pre>
--   
--   <pre>
--   eps &lt;&gt;  r === r
--   </pre>
appends :: [ERE] -> ERE

-- | Union of regular expressions.
--   
--   <pre>
--   r \/ r === r
--   </pre>
--   
--   <pre>
--   r \/ s === s \/ r
--   </pre>
--   
--   <pre>
--   ( r \/ s) \/ t === r \/ (s \/ t)
--   </pre>
--   
--   <pre>
--   empty \/  r === r
--   </pre>
--   
--   <pre>
--   r \/ empty === r
--   </pre>
--   
--   <pre>
--   everything \/  r === everything
--   </pre>
--   
--   <pre>
--   r \/ everything === everything
--   </pre>
unions :: [ERE] -> ERE

-- | Intersection of regular expressions.
--   
--   <pre>
--   r /\ r === r
--   </pre>
--   
--   <pre>
--   r /\ s === s /\ r
--   </pre>
--   
--   <pre>
--   ( r /\ s) /\ t === r /\ (s /\ t)
--   </pre>
--   
--   <pre>
--   empty /\  r === empty
--   </pre>
--   
--   <pre>
--   r /\ empty === empty
--   </pre>
--   
--   <pre>
--   everything /\  r === r
--   </pre>
--   
--   <pre>
--   r /\ everything === r
--   </pre>
intersections :: [ERE] -> ERE

-- | Kleene star.
--   
--   <pre>
--   star (star r) === star ( r)
--   </pre>
--   
--   <pre>
--   star eps     ===  eps
--   </pre>
--   
--   <pre>
--   star empty   ===  eps
--   </pre>
--   
--   <pre>
--   star anyChar ===  everything
--   </pre>
--   
--   <pre>
--   star (r \/ eps) === star r
--   </pre>
--   
--   <pre>
--   star (char c \/ eps) === star (char c)
--   </pre>
--   
--   <pre>
--   star (empty \/ eps) === eps
--   </pre>
star :: ERE -> ERE

-- | Kleene plus
--   
--   <pre>
--   <a>plus</a> r = r &lt;&gt; <a>star</a> r
--   </pre>
plus :: ERE -> ERE

-- | Literal string.
string :: [Word8] -> ERE

-- | UTF8 string
utf8String :: String -> ERE

-- | Complement.
--   
--   <pre>
--   complement (complement r) ===  r
--   </pre>
complement :: ERE -> ERE
satisfy :: (Word8 -> Bool) -> ERE
digit :: ERE
instance GHC.Classes.Ord Sasha.TTH.Meas
instance GHC.Classes.Eq Sasha.TTH.Meas
instance GHC.Show.Show (Sasha.TTH.S tag)
instance GHC.Classes.Eq (Sasha.TTH.S tag)
instance GHC.Classes.Ord (Sasha.TTH.S tag)