Safe Haskell | None |
---|---|
Language | Haskell98 |
Contains things needed by BNFC-meta language definitions and by the code generated from those. Typical users don't need to browse this module.
Synopsis
- data HappyStk a = HappyStk a (HappyStk a)
- utf8Encode :: Char -> [Word8]
- data Posn = Pn !Int !Int !Int
- type AlexInput = (Posn, Char, [Word8], String)
- alexGetByte :: AlexInput -> Maybe (Word8, AlexInput)
- ord :: Char -> Int
- listArray :: Ix i => (i, i) -> [e] -> Array i e
- (!) :: Ix i => Array i e -> i -> e
- data Array i e
- printTree :: Print a => a -> String
- doc :: ShowS -> Doc
- concatD :: [Doc] -> Doc
- class Print a where
- prPrec :: Int -> Int -> Doc -> Doc
- newtype PrintPlain = MkPrintPlain String
- parseToQuoter :: (String -> ParseMonad BNFC_QQType) -> QuasiQuoter
- parseToMonQuoter :: (String -> ParseMonad BNFC_QQType) -> QuasiQuoter
- data ParseMonad a
- errq :: (String -> a) -> ParseMonad a -> Q a
- data Q a
- data BNFC_QQType
- appEPAll :: LocType -> String -> [BNFC_QQType] -> BNFC_QQType
- appEPAllL :: LocType -> [BNFC_QQType] -> BNFC_QQType
- fromString :: Literal a => LocType -> a -> BNFC_QQType
- fromLit :: Literal a => LocType -> a -> BNFC_QQType
- fromToken :: Literal a => LocType -> String -> a -> BNFC_QQType
- fromPositionToken :: LocType -> String -> ((Int, Int), String) -> BNFC_QQType
- class Lift t where
- type LocType = (String, String)
- class Literal a where
- class IsChar a where
- printAq :: Print a => a -> BNFC_QQType
- stringAq :: String -> BNFC_QQType
Happy and Alex
utf8Encode :: Char -> [Word8] Source #
listArray :: Ix i => (i, i) -> [e] -> Array i e #
Construct an array from a pair of bounds and a list of values in index order.
The type of immutable non-strict (boxed) arrays
with indices in i
and elements in e
.
Instances
Functor (Array i) | Since: base-2.1 |
Foldable (Array i) | Since: base-4.8.0.0 |
Defined in Data.Foldable fold :: Monoid m => Array i m -> m # foldMap :: Monoid m => (a -> m) -> Array i a -> m # foldr :: (a -> b -> b) -> b -> Array i a -> b # foldr' :: (a -> b -> b) -> b -> Array i a -> b # foldl :: (b -> a -> b) -> b -> Array i a -> b # foldl' :: (b -> a -> b) -> b -> Array i a -> b # foldr1 :: (a -> a -> a) -> Array i a -> a # foldl1 :: (a -> a -> a) -> Array i a -> a # elem :: Eq a => a -> Array i a -> Bool # maximum :: Ord a => Array i a -> a # minimum :: Ord a => Array i a -> a # | |
Ix i => Traversable (Array i) | Since: base-2.1 |
(Ix i, Eq e) => Eq (Array i e) | Since: base-2.1 |
(Data a, Data b, Ix a) => Data (Array a b) | Since: base-4.8.0.0 |
Defined in Data.Data gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Array a b -> c (Array a b) # gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Array a b) # toConstr :: Array a b -> Constr # dataTypeOf :: Array a b -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Array a b)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Array a b)) # gmapT :: (forall b0. Data b0 => b0 -> b0) -> Array a b -> Array a b # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Array a b -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Array a b -> r # gmapQ :: (forall d. Data d => d -> u) -> Array a b -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Array a b -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Array a b -> m (Array a b) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Array a b -> m (Array a b) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Array a b -> m (Array a b) # | |
(Ix i, Ord e) => Ord (Array i e) | Since: base-2.1 |
Defined in GHC.Arr | |
(Ix a, Read a, Read b) => Read (Array a b) | Since: base-2.1 |
(Ix a, Show a, Show b) => Show (Array a b) | Since: base-2.1 |
Pretty printing
Instances
Print Char Source # | |
Print Double Source # | |
Print Integer Source # | |
Print PrintPlain Source # | |
Defined in Language.LBNF.Runtime | |
Print Ident Source # | |
Print Reg Source # | |
Print MinimumSize Source # | |
Defined in Language.LBNF.Grammar | |
Print Exp Source # | |
Print Arg Source # | |
Print HsTyp Source # | |
Print MIdent Source # | |
Print Label Source # | |
Print Cat Source # | |
Print Item Source # | |
Print RHS Source # | |
Print Def Source # | |
Print Grammar Source # | |
Print a => Print [a] Source # | |
newtype PrintPlain Source #
Instances
Print PrintPlain Source # | |
Defined in Language.LBNF.Runtime |
Quasi quoting
parseToQuoter :: (String -> ParseMonad BNFC_QQType) -> QuasiQuoter Source #
parseToMonQuoter :: (String -> ParseMonad BNFC_QQType) -> QuasiQuoter Source #
data ParseMonad a Source #
Instances
Instances
Monad Q | |
Functor Q | |
MonadFail Q | |
Defined in Language.Haskell.TH.Syntax | |
Applicative Q | |
MonadIO Q | |
Defined in Language.Haskell.TH.Syntax | |
Quasi Q | |
Defined in Language.Haskell.TH.Syntax qNewName :: String -> Q Name # qReport :: Bool -> String -> Q () # qRecover :: Q a -> Q a -> Q a # qLookupName :: Bool -> String -> Q (Maybe Name) # qReifyFixity :: Name -> Q (Maybe Fixity) # qReifyInstances :: Name -> [Type] -> Q [Dec] # qReifyRoles :: Name -> Q [Role] # qReifyAnnotations :: Data a => AnnLookup -> Q [a] # qReifyModule :: Module -> Q ModuleInfo # qReifyConStrictness :: Name -> Q [DecidedStrictness] # qAddDependentFile :: FilePath -> Q () # qAddTempFile :: String -> Q FilePath # qAddTopDecls :: [Dec] -> Q () # qAddForeignFilePath :: ForeignSrcLang -> String -> Q () # qAddModFinalizer :: Q () -> Q () # qAddCorePlugin :: String -> Q () # qGetQ :: Typeable a => Q (Maybe a) # qPutQ :: Typeable a => a -> Q () # qIsExtEnabled :: Extension -> Q Bool # qExtsEnabled :: Q [Extension] # |
data BNFC_QQType Source #
appEPAll :: LocType -> String -> [BNFC_QQType] -> BNFC_QQType Source #
appEPAllL :: LocType -> [BNFC_QQType] -> BNFC_QQType Source #
fromString :: Literal a => LocType -> a -> BNFC_QQType Source #
fromPositionToken :: LocType -> String -> ((Int, Int), String) -> BNFC_QQType Source #
A Lift
instance can have any of its values turned into a Template
Haskell expression. This is needed when a value used within a Template
Haskell quotation is bound outside the Oxford brackets ([| ... |]
) but not
at the top level. As an example:
add1 :: Int -> Q Exp add1 x = [| x + 1 |]
Template Haskell has no way of knowing what value x
will take on at
splice-time, so it requires the type of x
to be an instance of Lift
.
A Lift
instance must satisfy $(lift x) ≡ x
for all x
, where $(...)
is a Template Haskell splice.
Lift
instances can be derived automatically by use of the -XDeriveLift
GHC language extension:
{-# LANGUAGE DeriveLift #-} module Foo where import Language.Haskell.TH.Syntax data Bar a = Bar1 a (Bar a) | Bar2 String deriving Lift
Nothing
Instances
Lift Bool | |
Lift Char | |
Lift Double | |
Lift Float | |
Lift Int | |
Lift Int8 | |
Lift Int16 | |
Lift Int32 | |
Lift Int64 | |
Lift Integer | |
Lift Natural | |
Lift Word | |
Lift Word8 | |
Lift Word16 | |
Lift Word32 | |
Lift Word64 | |
Lift () | |
Defined in Language.Haskell.TH.Syntax | |
Lift a => Lift [a] | |
Defined in Language.Haskell.TH.Syntax | |
Lift a => Lift (Maybe a) | |
Integral a => Lift (Ratio a) | |
(Lift a, Lift b) => Lift (Either a b) | |
(Lift a, Lift b) => Lift (a, b) | |
Defined in Language.Haskell.TH.Syntax | |
(Lift a, Lift b, Lift c) => Lift (a, b, c) | |
Defined in Language.Haskell.TH.Syntax | |
(Lift a, Lift b, Lift c, Lift d) => Lift (a, b, c, d) | |
Defined in Language.Haskell.TH.Syntax | |
(Lift a, Lift b, Lift c, Lift d, Lift e) => Lift (a, b, c, d, e) | |
Defined in Language.Haskell.TH.Syntax | |
(Lift a, Lift b, Lift c, Lift d, Lift e, Lift f) => Lift (a, b, c, d, e, f) | |
Defined in Language.Haskell.TH.Syntax | |
(Lift a, Lift b, Lift c, Lift d, Lift e, Lift f, Lift g) => Lift (a, b, c, d, e, f, g) | |
Defined in Language.Haskell.TH.Syntax |
Helper functions for defining Anti-quotation
printAq :: Print a => a -> BNFC_QQType Source #
stringAq :: String -> BNFC_QQType Source #