huff-0.1.0.1: dist/build/Huff/QQ/Parser.hs
{-# OPTIONS_GHC -w #-}
{-# OPTIONS -fglasgow-exts -cpp #-}
-- vim: ft=haskell
{-# OPTIONS_GHC -w #-}
{-# LANGUAGE PatternSynonyms #-}
{-# LANGUAGE RecordWildCards #-}
module Huff.QQ.Parser where
import Huff.Compile.AST
import Huff.QQ.Lexer (lexer,Lexeme(..),Token(..),Keyword(..),SourcePos,sourceFrom)
import qualified Data.Text as T
import qualified Data.Array as Happy_Data_Array
import qualified GHC.Exts as Happy_GHC_Exts
import Control.Applicative(Applicative(..))
import Control.Monad (ap)
-- parser produced by Happy Version 1.19.5
newtype HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35 = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
happyIn4 :: ([Domain T.Text]) -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn4 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn4 #-}
happyOut4 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> ([Domain T.Text])
happyOut4 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut4 #-}
happyIn5 :: (Domain T.Text) -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn5 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn5 #-}
happyOut5 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> (Domain T.Text)
happyOut5 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut5 #-}
happyIn6 :: (Domain T.Text -> Domain T.Text) -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn6 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn6 #-}
happyOut6 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> (Domain T.Text -> Domain T.Text)
happyOut6 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut6 #-}
happyIn7 :: (Domain T.Text -> Domain T.Text) -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn7 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn7 #-}
happyOut7 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> (Domain T.Text -> Domain T.Text)
happyOut7 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut7 #-}
happyIn8 :: (Type) -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn8 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn8 #-}
happyOut8 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> (Type)
happyOut8 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut8 #-}
happyIn9 :: (Domain T.Text -> Domain T.Text) -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn9 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn9 #-}
happyOut9 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> (Domain T.Text -> Domain T.Text)
happyOut9 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut9 #-}
happyIn10 :: (Domain T.Text -> Domain T.Text) -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn10 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn10 #-}
happyOut10 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> (Domain T.Text -> Domain T.Text)
happyOut10 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut10 #-}
happyIn11 :: (Domain T.Text -> Domain T.Text) -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn11 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn11 #-}
happyOut11 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> (Domain T.Text -> Domain T.Text)
happyOut11 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut11 #-}
happyIn12 :: (Param) -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn12 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn12 #-}
happyOut12 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> (Param)
happyOut12 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut12 #-}
happyIn13 :: (Term) -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn13 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn13 #-}
happyOut13 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> (Term)
happyOut13 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut13 #-}
happyIn14 :: (Effect) -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn14 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn14 #-}
happyOut14 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> (Effect)
happyOut14 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut14 #-}
happyIn15 :: (Literal) -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn15 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn15 #-}
happyOut15 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> (Literal)
happyOut15 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut15 #-}
happyIn16 :: (Atom) -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn16 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn16 #-}
happyOut16 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> (Atom)
happyOut16 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut16 #-}
happyIn17 :: (Arg) -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn17 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn17 #-}
happyOut17 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> (Arg)
happyOut17 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut17 #-}
happyIn18 :: t18 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn18 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn18 #-}
happyOut18 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t18
happyOut18 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut18 #-}
happyIn19 :: t19 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn19 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn19 #-}
happyOut19 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t19
happyOut19 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut19 #-}
happyIn20 :: t20 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn20 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn20 #-}
happyOut20 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t20
happyOut20 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut20 #-}
happyIn21 :: t21 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn21 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn21 #-}
happyOut21 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t21
happyOut21 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut21 #-}
happyIn22 :: t22 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn22 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn22 #-}
happyOut22 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t22
happyOut22 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut22 #-}
happyIn23 :: t23 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn23 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn23 #-}
happyOut23 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t23
happyOut23 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut23 #-}
happyIn24 :: t24 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn24 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn24 #-}
happyOut24 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t24
happyOut24 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut24 #-}
happyIn25 :: t25 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn25 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn25 #-}
happyOut25 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t25
happyOut25 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut25 #-}
happyIn26 :: t26 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn26 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn26 #-}
happyOut26 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t26
happyOut26 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut26 #-}
happyIn27 :: t27 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn27 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn27 #-}
happyOut27 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t27
happyOut27 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut27 #-}
happyIn28 :: t28 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn28 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn28 #-}
happyOut28 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t28
happyOut28 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut28 #-}
happyIn29 :: t29 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn29 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn29 #-}
happyOut29 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t29
happyOut29 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut29 #-}
happyIn30 :: t30 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn30 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn30 #-}
happyOut30 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t30
happyOut30 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut30 #-}
happyIn31 :: t31 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn31 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn31 #-}
happyOut31 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t31
happyOut31 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut31 #-}
happyIn32 :: t32 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn32 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn32 #-}
happyOut32 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t32
happyOut32 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut32 #-}
happyIn33 :: t33 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn33 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn33 #-}
happyOut33 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t33
happyOut33 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut33 #-}
happyIn34 :: t34 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn34 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn34 #-}
happyOut34 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t34
happyOut34 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut34 #-}
happyIn35 :: t35 -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyIn35 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn35 #-}
happyOut35 :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> t35
happyOut35 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut35 #-}
happyInTok :: (Lexeme Token) -> (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35)
happyInTok x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyInTok #-}
happyOutTok :: (HappyAbsSyn t18 t19 t20 t21 t22 t23 t24 t25 t26 t27 t28 t29 t30 t31 t32 t33 t34 t35) -> (Lexeme Token)
happyOutTok x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOutTok #-}
happyActOffsets :: HappyAddr
happyActOffsets = HappyA# "\x62\x00\x62\x00\x00\x00\x00\x00\x62\x00\x61\x00\x55\x00\x59\x00\x00\x00\x38\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x00\x38\x00\x5e\x00\x5c\x00\x5a\x00\x54\x00\x00\x00\x00\x00\x51\x00\x50\x00\x4c\x00\x00\x00\x00\x00\x00\x00\x53\x00\x52\x00\x4f\x00\x4e\x00\x00\x00\x4d\x00\x4b\x00\x47\x00\x00\x00\x00\x00\x4a\x00\x46\x00\x00\x00\x43\x00\x00\x00\x49\x00\x48\x00\x00\x00\x48\x00\x44\x00\x45\x00\x42\x00\x00\x00\x00\x00\x00\x00\x00\x00\x41\x00\x20\x00\x00\x00\x00\x00\x3f\x00\x40\x00\x3d\x00\x20\x00\x00\x00\x3e\x00\x20\x00\x3c\x00\x1e\x00\x00\x00\x00\x00\x3a\x00\x37\x00\x00\x00\x00\x00\x3e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x39\x00\x35\x00\x36\x00\x00\x00\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00"#
happyGotoOffsets :: HappyAddr
happyGotoOffsets = HappyA# "\x02\x00\x09\x00\x00\x00\x00\x00\x34\x00\x00\x00\x00\x00\x00\x00\x00\x00\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x31\x00\x29\x00\xfe\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x15\x00\xfd\xff\x3b\x00\x0d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x27\x00\x00\x00\x24\x00\x1a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1b\x00\x00\x00\x18\x00\x03\x00\x00\x00\xfb\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x23\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x2f\x00\x00\x00\x00\x00\x00\x00\x00\x00"#
happyDefActions :: HappyAddr
happyDefActions = HappyA# "\x00\x00\x00\x00\xe0\xff\xfe\xff\xe9\xff\x00\x00\x00\x00\x00\x00\xdf\xff\xeb\xff\xde\xff\xfc\xff\xfb\xff\xfa\xff\x00\x00\xea\xff\x00\x00\x00\x00\x00\x00\x00\x00\xd4\xff\xf7\xff\xe3\xff\x00\x00\x00\x00\xf8\xff\xdd\xff\xfd\xff\x00\x00\x00\x00\x00\x00\xe8\xff\xd6\xff\x00\x00\xe7\xff\x00\x00\xd3\xff\xd0\xff\x00\x00\xe1\xff\xf9\xff\xe6\xff\xdc\xff\x00\x00\x00\x00\xf6\xff\x00\x00\x00\x00\x00\x00\x00\x00\xd5\xff\xf4\xff\xcf\xff\xdb\xff\x00\x00\x00\x00\xd2\xff\xf3\xff\x00\x00\xe2\xff\x00\x00\x00\x00\xf2\xff\x00\x00\x00\x00\x00\x00\x00\x00\xd1\xff\xda\xff\x00\x00\xe5\xff\xed\xff\xec\xff\x00\x00\xee\xff\xd8\xff\xf1\xff\xf0\xff\x00\x00\xe4\xff\x00\x00\xef\xff\x00\x00\xf5\xff\xd9\xff\xd7\xff"#
happyCheck :: HappyAddr
happyCheck = HappyA# "\xff\xff\x04\x00\x00\x00\x01\x00\x06\x00\x0a\x00\x0b\x00\x0c\x00\x02\x00\x03\x00\x01\x00\x05\x00\x09\x00\x07\x00\x13\x00\x0c\x00\x0c\x00\x0f\x00\x14\x00\x16\x00\x0e\x00\x08\x00\x1b\x00\x09\x00\x0f\x00\x17\x00\x0c\x00\x1d\x00\x1f\x00\x10\x00\x18\x00\x01\x00\x17\x00\x01\x00\x08\x00\x15\x00\x09\x00\x0d\x00\x11\x00\x0c\x00\x04\x00\x1c\x00\x12\x00\x04\x00\x1e\x00\x04\x00\x19\x00\x11\x00\x0d\x00\x11\x00\x1a\x00\x02\x00\x03\x00\x01\x00\x05\x00\x01\x00\x07\x00\x0a\x00\x0b\x00\x0c\x00\x04\x00\x05\x00\x06\x00\x01\x00\x02\x00\x06\x00\x0d\x00\x0a\x00\x0d\x00\x01\x00\x0c\x00\x08\x00\x0b\x00\x07\x00\x02\x00\x02\x00\x10\x00\x0d\x00\x09\x00\x01\x00\x01\x00\x10\x00\x0f\x00\x0d\x00\x02\x00\x02\x00\x0c\x00\x10\x00\x0d\x00\x0c\x00\x0e\x00\x0b\x00\x02\x00\x01\x00\x0d\x00\x0b\x00\x02\x00\x0a\x00\x09\x00\x02\x00\xff\xff\x03\x00\xff\xff\x12\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"#
happyTable :: HappyAddr
happyTable = HappyA# "\x00\x00\x25\x00\x06\x00\x02\x00\x14\x00\x4b\x00\x4c\x00\x4d\x00\x0a\x00\x0b\x00\x02\x00\x0c\x00\x43\x00\x0d\x00\x4e\x00\x39\x00\x51\x00\x03\x00\x15\x00\x26\x00\x0e\x00\x20\x00\x4f\x00\x38\x00\x03\x00\x04\x00\x39\x00\x16\x00\x27\x00\x21\x00\x0f\x00\x3d\x00\x04\x00\x3d\x00\x32\x00\x3a\x00\x3e\x00\x44\x00\x28\x00\x39\x00\x33\x00\x22\x00\x45\x00\x34\x00\x3b\x00\x18\x00\x29\x00\x51\x00\x54\x00\x3e\x00\x46\x00\x1a\x00\x0b\x00\x08\x00\x0c\x00\x3d\x00\x0d\x00\x55\x00\x4c\x00\x4d\x00\x11\x00\x12\x00\x13\x00\x48\x00\x49\x00\x24\x00\x53\x00\x54\x00\x4a\x00\x24\x00\x4b\x00\x42\x00\x40\x00\x37\x00\x1a\x00\x36\x00\x43\x00\x41\x00\x32\x00\x24\x00\x18\x00\x38\x00\x2c\x00\x2d\x00\x1a\x00\x2b\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x1d\x00\x1e\x00\x14\x00\x18\x00\x1f\x00\x20\x00\x1a\x00\x1c\x00\x0a\x00\x08\x00\x00\x00\x06\x00\x00\x00\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#
happyReduceArr = Happy_Data_Array.array (1, 48) [
(1 , happyReduce_1),
(2 , happyReduce_2),
(3 , happyReduce_3),
(4 , happyReduce_4),
(5 , happyReduce_5),
(6 , happyReduce_6),
(7 , happyReduce_7),
(8 , happyReduce_8),
(9 , happyReduce_9),
(10 , happyReduce_10),
(11 , happyReduce_11),
(12 , happyReduce_12),
(13 , happyReduce_13),
(14 , happyReduce_14),
(15 , happyReduce_15),
(16 , happyReduce_16),
(17 , happyReduce_17),
(18 , happyReduce_18),
(19 , happyReduce_19),
(20 , happyReduce_20),
(21 , happyReduce_21),
(22 , happyReduce_22),
(23 , happyReduce_23),
(24 , happyReduce_24),
(25 , happyReduce_25),
(26 , happyReduce_26),
(27 , happyReduce_27),
(28 , happyReduce_28),
(29 , happyReduce_29),
(30 , happyReduce_30),
(31 , happyReduce_31),
(32 , happyReduce_32),
(33 , happyReduce_33),
(34 , happyReduce_34),
(35 , happyReduce_35),
(36 , happyReduce_36),
(37 , happyReduce_37),
(38 , happyReduce_38),
(39 , happyReduce_39),
(40 , happyReduce_40),
(41 , happyReduce_41),
(42 , happyReduce_42),
(43 , happyReduce_43),
(44 , happyReduce_44),
(45 , happyReduce_45),
(46 , happyReduce_46),
(47 , happyReduce_47),
(48 , happyReduce_48)
]
happy_n_terms = 19 :: Int
happy_n_nonterms = 32 :: Int
happyReduce_1 = happySpecReduce_1 0# happyReduction_1
happyReduction_1 happy_x_1
= case happyOut19 happy_x_1 of { happy_var_1 ->
happyIn4
(happy_var_1
)}
happyReduce_2 = happyReduce 5# 1# happyReduction_2
happyReduction_2 (happy_x_5 `HappyStk`
happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOutTok happy_x_2 of { (happy_var_2 @ Lexeme { lexemeToken = TConIdent {} }) ->
case happyOut18 happy_x_4 of { happy_var_4 ->
happyIn5
(foldr id (Domain (lexemeText happy_var_2) [] [] []) happy_var_4
) `HappyStk` happyRest}}
happyReduce_3 = happySpecReduce_1 2# happyReduction_3
happyReduction_3 happy_x_1
= case happyOut7 happy_x_1 of { happy_var_1 ->
happyIn6
(happy_var_1
)}
happyReduce_4 = happySpecReduce_1 2# happyReduction_4
happyReduction_4 happy_x_1
= case happyOut9 happy_x_1 of { happy_var_1 ->
happyIn6
(happy_var_1
)}
happyReduce_5 = happySpecReduce_1 2# happyReduction_5
happyReduction_5 happy_x_1
= case happyOut11 happy_x_1 of { happy_var_1 ->
happyIn6
(happy_var_1
)}
happyReduce_6 = happyReduce 4# 3# happyReduction_6
happyReduction_6 (happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOut8 happy_x_2 of { happy_var_2 ->
case happyOut21 happy_x_4 of { happy_var_4 ->
happyIn7
(let { objs = [ Typed lexemeText happy_var_2 | Lexeme { .. } <- happy_var_4 ] }
in \dom -> dom { domObjects = objs ++ domObjects dom }
) `HappyStk` happyRest}}
happyReduce_7 = happySpecReduce_1 4# happyReduction_7
happyReduction_7 happy_x_1
= case happyOutTok happy_x_1 of { (happy_var_1 @ Lexeme { lexemeToken = TConIdent {} }) ->
happyIn8
(lexemeText happy_var_1
)}
happyReduce_8 = happySpecReduce_2 5# happyReduction_8
happyReduction_8 happy_x_2
happy_x_1
= case happyOut24 happy_x_2 of { happy_var_2 ->
happyIn9
(foldr (.) id happy_var_2
)}
happyReduce_9 = happyReduce 4# 6# happyReduction_9
happyReduction_9 (happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOutTok happy_x_1 of { (happy_var_1 @ Lexeme { lexemeToken = TIdent {} }) ->
case happyOut26 happy_x_3 of { happy_var_3 ->
happyIn10
(\dom -> dom { domPreds = App (lexemeText happy_var_1) happy_var_3 : domPreds dom }
) `HappyStk` happyRest}}
happyReduce_10 = happyReduce 13# 7# happyReduction_10
happyReduction_10 (happy_x_13 `HappyStk`
happy_x_12 `HappyStk`
happy_x_11 `HappyStk`
happy_x_10 `HappyStk`
happy_x_9 `HappyStk`
happy_x_8 `HappyStk`
happy_x_7 `HappyStk`
happy_x_6 `HappyStk`
happy_x_5 `HappyStk`
happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOutTok happy_x_2 of { (happy_var_2 @ Lexeme { lexemeToken = TConIdent {} }) ->
case happyOut20 happy_x_4 of { happy_var_4 ->
case happyOut25 happy_x_9 of { happy_var_9 ->
case happyOut23 happy_x_12 of { happy_var_12 ->
happyIn11
(let { op = Operator { opName = lexemeText happy_var_2
, opDerived = False
, opParams = happy_var_4
, opVal = Just (lexemeText happy_var_2)
, opPrecond = TAnd happy_var_9
, opEffects = EAnd happy_var_12
} }
in \dom -> dom { domOperators = op : domOperators dom }
) `HappyStk` happyRest}}}}
happyReduce_11 = happySpecReduce_3 8# happyReduction_11
happyReduction_11 happy_x_3
happy_x_2
happy_x_1
= case happyOutTok happy_x_1 of { (happy_var_1 @ Lexeme { lexemeToken = TIdent {} }) ->
case happyOut8 happy_x_3 of { happy_var_3 ->
happyIn12
(Typed (lexemeText happy_var_1) happy_var_3
)}}
happyReduce_12 = happySpecReduce_1 9# happyReduction_12
happyReduction_12 happy_x_1
= case happyOut16 happy_x_1 of { happy_var_1 ->
happyIn13
(TLit (LAtom happy_var_1)
)}
happyReduce_13 = happySpecReduce_2 9# happyReduction_13
happyReduction_13 happy_x_2
happy_x_1
= case happyOut13 happy_x_2 of { happy_var_2 ->
happyIn13
(TNot happy_var_2
)}
happyReduce_14 = happySpecReduce_1 10# happyReduction_14
happyReduction_14 happy_x_1
= case happyOut15 happy_x_1 of { happy_var_1 ->
happyIn14
(ELit happy_var_1
)}
happyReduce_15 = happySpecReduce_1 11# happyReduction_15
happyReduction_15 happy_x_1
= case happyOut16 happy_x_1 of { happy_var_1 ->
happyIn15
(LAtom happy_var_1
)}
happyReduce_16 = happySpecReduce_2 11# happyReduction_16
happyReduction_16 happy_x_2
happy_x_1
= case happyOut16 happy_x_2 of { happy_var_2 ->
happyIn15
(LNot happy_var_2
)}
happyReduce_17 = happyReduce 4# 12# happyReduction_17
happyReduction_17 (happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOutTok happy_x_1 of { (happy_var_1 @ Lexeme { lexemeToken = TIdent {} }) ->
case happyOut22 happy_x_3 of { happy_var_3 ->
happyIn16
(App (lexemeText happy_var_1) happy_var_3
) `HappyStk` happyRest}}
happyReduce_18 = happySpecReduce_1 13# happyReduction_18
happyReduction_18 happy_x_1
= case happyOutTok happy_x_1 of { (happy_var_1 @ Lexeme { lexemeToken = TIdent {} }) ->
happyIn17
(AVar (lexemeText happy_var_1)
)}
happyReduce_19 = happySpecReduce_1 13# happyReduction_19
happyReduction_19 happy_x_1
= case happyOutTok happy_x_1 of { (happy_var_1 @ Lexeme { lexemeToken = TConIdent {} }) ->
happyIn17
(AName (lexemeText happy_var_1)
)}
happyReduce_20 = happySpecReduce_0 14# happyReduction_20
happyReduction_20 = happyIn18
([]
)
happyReduce_21 = happySpecReduce_1 14# happyReduction_21
happyReduction_21 happy_x_1
= case happyOut28 happy_x_1 of { happy_var_1 ->
happyIn18
(reverse happy_var_1
)}
happyReduce_22 = happySpecReduce_1 15# happyReduction_22
happyReduction_22 happy_x_1
= case happyOut27 happy_x_1 of { happy_var_1 ->
happyIn19
(reverse happy_var_1
)}
happyReduce_23 = happySpecReduce_0 16# happyReduction_23
happyReduction_23 = happyIn20
([]
)
happyReduce_24 = happySpecReduce_1 16# happyReduction_24
happyReduction_24 happy_x_1
= case happyOut32 happy_x_1 of { happy_var_1 ->
happyIn20
(reverse happy_var_1
)}
happyReduce_25 = happySpecReduce_1 17# happyReduction_25
happyReduction_25 happy_x_1
= case happyOut29 happy_x_1 of { happy_var_1 ->
happyIn21
(reverse happy_var_1
)}
happyReduce_26 = happySpecReduce_1 18# happyReduction_26
happyReduction_26 happy_x_1
= case happyOut30 happy_x_1 of { happy_var_1 ->
happyIn22
(reverse happy_var_1
)}
happyReduce_27 = happySpecReduce_1 19# happyReduction_27
happyReduction_27 happy_x_1
= case happyOut31 happy_x_1 of { happy_var_1 ->
happyIn23
(reverse happy_var_1
)}
happyReduce_28 = happySpecReduce_1 20# happyReduction_28
happyReduction_28 happy_x_1
= case happyOut33 happy_x_1 of { happy_var_1 ->
happyIn24
(reverse happy_var_1
)}
happyReduce_29 = happySpecReduce_1 21# happyReduction_29
happyReduction_29 happy_x_1
= case happyOut34 happy_x_1 of { happy_var_1 ->
happyIn25
(reverse happy_var_1
)}
happyReduce_30 = happySpecReduce_1 22# happyReduction_30
happyReduction_30 happy_x_1
= case happyOut35 happy_x_1 of { happy_var_1 ->
happyIn26
(reverse happy_var_1
)}
happyReduce_31 = happySpecReduce_1 23# happyReduction_31
happyReduction_31 happy_x_1
= case happyOut5 happy_x_1 of { happy_var_1 ->
happyIn27
([happy_var_1]
)}
happyReduce_32 = happySpecReduce_2 23# happyReduction_32
happyReduction_32 happy_x_2
happy_x_1
= case happyOut27 happy_x_1 of { happy_var_1 ->
case happyOut5 happy_x_2 of { happy_var_2 ->
happyIn27
(happy_var_2 : happy_var_1
)}}
happyReduce_33 = happySpecReduce_1 24# happyReduction_33
happyReduction_33 happy_x_1
= case happyOut6 happy_x_1 of { happy_var_1 ->
happyIn28
([happy_var_1]
)}
happyReduce_34 = happySpecReduce_2 24# happyReduction_34
happyReduction_34 happy_x_2
happy_x_1
= case happyOut28 happy_x_1 of { happy_var_1 ->
case happyOut6 happy_x_2 of { happy_var_2 ->
happyIn28
(happy_var_2 : happy_var_1
)}}
happyReduce_35 = happySpecReduce_1 25# happyReduction_35
happyReduction_35 happy_x_1
= case happyOutTok happy_x_1 of { (happy_var_1 @ Lexeme { lexemeToken = TConIdent {} }) ->
happyIn29
([happy_var_1]
)}
happyReduce_36 = happySpecReduce_3 25# happyReduction_36
happyReduction_36 happy_x_3
happy_x_2
happy_x_1
= case happyOut29 happy_x_1 of { happy_var_1 ->
case happyOutTok happy_x_3 of { (happy_var_3 @ Lexeme { lexemeToken = TConIdent {} }) ->
happyIn29
(happy_var_3 : happy_var_1
)}}
happyReduce_37 = happySpecReduce_1 26# happyReduction_37
happyReduction_37 happy_x_1
= case happyOut17 happy_x_1 of { happy_var_1 ->
happyIn30
([happy_var_1]
)}
happyReduce_38 = happySpecReduce_3 26# happyReduction_38
happyReduction_38 happy_x_3
happy_x_2
happy_x_1
= case happyOut30 happy_x_1 of { happy_var_1 ->
case happyOut17 happy_x_3 of { happy_var_3 ->
happyIn30
(happy_var_3 : happy_var_1
)}}
happyReduce_39 = happySpecReduce_1 27# happyReduction_39
happyReduction_39 happy_x_1
= case happyOut14 happy_x_1 of { happy_var_1 ->
happyIn31
([happy_var_1]
)}
happyReduce_40 = happySpecReduce_3 27# happyReduction_40
happyReduction_40 happy_x_3
happy_x_2
happy_x_1
= case happyOut31 happy_x_1 of { happy_var_1 ->
case happyOut14 happy_x_3 of { happy_var_3 ->
happyIn31
(happy_var_3 : happy_var_1
)}}
happyReduce_41 = happySpecReduce_1 28# happyReduction_41
happyReduction_41 happy_x_1
= case happyOut12 happy_x_1 of { happy_var_1 ->
happyIn32
([happy_var_1]
)}
happyReduce_42 = happySpecReduce_3 28# happyReduction_42
happyReduction_42 happy_x_3
happy_x_2
happy_x_1
= case happyOut32 happy_x_1 of { happy_var_1 ->
case happyOut12 happy_x_3 of { happy_var_3 ->
happyIn32
(happy_var_3 : happy_var_1
)}}
happyReduce_43 = happySpecReduce_1 29# happyReduction_43
happyReduction_43 happy_x_1
= case happyOut10 happy_x_1 of { happy_var_1 ->
happyIn33
([happy_var_1]
)}
happyReduce_44 = happySpecReduce_3 29# happyReduction_44
happyReduction_44 happy_x_3
happy_x_2
happy_x_1
= case happyOut33 happy_x_1 of { happy_var_1 ->
case happyOut10 happy_x_3 of { happy_var_3 ->
happyIn33
(happy_var_3 : happy_var_1
)}}
happyReduce_45 = happySpecReduce_1 30# happyReduction_45
happyReduction_45 happy_x_1
= case happyOut13 happy_x_1 of { happy_var_1 ->
happyIn34
([happy_var_1]
)}
happyReduce_46 = happySpecReduce_3 30# happyReduction_46
happyReduction_46 happy_x_3
happy_x_2
happy_x_1
= case happyOut34 happy_x_1 of { happy_var_1 ->
case happyOut13 happy_x_3 of { happy_var_3 ->
happyIn34
(happy_var_3 : happy_var_1
)}}
happyReduce_47 = happySpecReduce_1 31# happyReduction_47
happyReduction_47 happy_x_1
= case happyOut8 happy_x_1 of { happy_var_1 ->
happyIn35
([happy_var_1]
)}
happyReduce_48 = happySpecReduce_3 31# happyReduction_48
happyReduction_48 happy_x_3
happy_x_2
happy_x_1
= case happyOut35 happy_x_1 of { happy_var_1 ->
case happyOut8 happy_x_3 of { happy_var_3 ->
happyIn35
(happy_var_3 : happy_var_1
)}}
happyNewToken action sts stk [] =
happyDoAction 18# notHappyAtAll action sts stk []
happyNewToken action sts stk (tk:tks) =
let cont i = happyDoAction i tk action sts stk tks in
case tk of {
happy_dollar_dollar @ Lexeme { lexemeToken = TIdent {} } -> cont 1#;
happy_dollar_dollar @ Lexeme { lexemeToken = TConIdent {} } -> cont 2#;
KW K_domain happy_dollar_dollar -> cont 3#;
KW K_object happy_dollar_dollar -> cont 4#;
KW K_predicate happy_dollar_dollar -> cont 5#;
KW K_operator happy_dollar_dollar -> cont 6#;
KW K_requires happy_dollar_dollar -> cont 7#;
KW K_effect happy_dollar_dollar -> cont 8#;
KW K_lbrace happy_dollar_dollar -> cont 9#;
KW K_rbrace happy_dollar_dollar -> cont 10#;
KW K_lparen happy_dollar_dollar -> cont 11#;
KW K_rparen happy_dollar_dollar -> cont 12#;
KW K_comma happy_dollar_dollar -> cont 13#;
KW K_assign happy_dollar_dollar -> cont 14#;
KW K_pipe happy_dollar_dollar -> cont 15#;
KW K_colon happy_dollar_dollar -> cont 16#;
KW K_not happy_dollar_dollar -> cont 17#;
_ -> happyError' (tk:tks)
}
happyError_ 18# tk tks = happyError' tks
happyError_ _ tk tks = happyError' (tk:tks)
happyThen :: () => Parse a -> (a -> Parse b) -> Parse b
happyThen = (>>=)
happyReturn :: () => a -> Parse a
happyReturn = (return)
happyThen1 m k tks = (>>=) m (\a -> k a tks)
happyReturn1 :: () => a -> b -> Parse a
happyReturn1 = \a tks -> (return) a
happyError' :: () => [(Lexeme Token)] -> Parse a
happyError' = parseError
domains tks = happySomeParser where
happySomeParser = happyThen (happyParse 0# tks) (\x -> happyReturn (happyOut4 x))
happySeq = happyDontSeq
type Parse = Either ParseError
data ParseError = ParseError (Maybe SourcePos)
deriving (Show)
parseError :: [Lexeme Token] -> Parse a
parseError (tok:_) = Left (ParseError (Just (sourceFrom (lexemeRange tok))))
parseError [] = Left (ParseError Nothing)
pattern KW k loc <- Lexeme { lexemeToken = TKeyword k, lexemeRange = loc }
parseQQ :: SourcePos -> String -> Parse [Domain T.Text]
parseQQ start str = domains toks
where
toks = lexer start str
{-# LINE 1 "templates/GenericTemplate.hs" #-}
{-# LINE 1 "templates/GenericTemplate.hs" #-}
{-# LINE 1 "<built-in>" #-}
{-# LINE 19 "<built-in>" #-}
{-# LINE 1 "/Users/trevor/.stack/programs/x86_64-osx/ghc-8.0.1/lib/ghc-8.0.1/include/ghcversion.h" #-}
{-# LINE 20 "<built-in>" #-}
{-# LINE 1 "/var/folders/_9/ct_72t7n0c52k70jhkxm2n4w0000gp/T/ghc78870_0/ghc_2.h" #-}
{-# LINE 21 "<built-in>" #-}
{-# LINE 1 "templates/GenericTemplate.hs" #-}
-- Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp
{-# LINE 13 "templates/GenericTemplate.hs" #-}
-- Do not remove this comment. Required to fix CPP parsing when using GCC and a clang-compiled alex.
#if __GLASGOW_HASKELL__ > 706
#define LT(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.<# m)) :: Bool)
#define GTE(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.>=# m)) :: Bool)
#define EQ(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.==# m)) :: Bool)
#else
#define LT(n,m) (n Happy_GHC_Exts.<# m)
#define GTE(n,m) (n Happy_GHC_Exts.>=# m)
#define EQ(n,m) (n Happy_GHC_Exts.==# m)
#endif
{-# LINE 46 "templates/GenericTemplate.hs" #-}
data Happy_IntList = HappyCons Happy_GHC_Exts.Int# Happy_IntList
{-# LINE 67 "templates/GenericTemplate.hs" #-}
{-# LINE 77 "templates/GenericTemplate.hs" #-}
infixr 9 `HappyStk`
data HappyStk a = HappyStk a (HappyStk a)
-----------------------------------------------------------------------------
-- starting the parse
happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll
-----------------------------------------------------------------------------
-- Accepting the parse
-- If the current token is 0#, it means we've just accepted a partial
-- parse (a %partial parser). We must ignore the saved token on the top of
-- the stack in this case.
happyAccept 0# tk st sts (_ `HappyStk` ans `HappyStk` _) =
happyReturn1 ans
happyAccept j tk st sts (HappyStk ans _) =
(happyTcHack j (happyTcHack st)) (happyReturn1 ans)
-----------------------------------------------------------------------------
-- Arrays only: do the next action
happyDoAction i tk st
= {- nothing -}
case action of
0# -> {- nothing -}
happyFail i tk st
-1# -> {- nothing -}
happyAccept i tk st
n | LT(n,(0# :: Happy_GHC_Exts.Int#)) -> {- nothing -}
(happyReduceArr Happy_Data_Array.! rule) i tk st
where rule = (Happy_GHC_Exts.I# ((Happy_GHC_Exts.negateInt# ((n Happy_GHC_Exts.+# (1# :: Happy_GHC_Exts.Int#))))))
n -> {- nothing -}
happyShift new_state i tk st
where new_state = (n Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#))
where off = indexShortOffAddr happyActOffsets st
off_i = (off Happy_GHC_Exts.+# i)
check = if GTE(off_i,(0# :: Happy_GHC_Exts.Int#))
then EQ(indexShortOffAddr happyCheck off_i, i)
else False
action
| check = indexShortOffAddr happyTable off_i
| otherwise = indexShortOffAddr happyDefActions st
indexShortOffAddr (HappyA# arr) off =
Happy_GHC_Exts.narrow16Int# i
where
i = Happy_GHC_Exts.word2Int# (Happy_GHC_Exts.or# (Happy_GHC_Exts.uncheckedShiftL# high 8#) low)
high = Happy_GHC_Exts.int2Word# (Happy_GHC_Exts.ord# (Happy_GHC_Exts.indexCharOffAddr# arr (off' Happy_GHC_Exts.+# 1#)))
low = Happy_GHC_Exts.int2Word# (Happy_GHC_Exts.ord# (Happy_GHC_Exts.indexCharOffAddr# arr off'))
off' = off Happy_GHC_Exts.*# 2#
data HappyAddr = HappyA# Happy_GHC_Exts.Addr#
-----------------------------------------------------------------------------
-- HappyState data type (not arrays)
{-# LINE 170 "templates/GenericTemplate.hs" #-}
-----------------------------------------------------------------------------
-- Shifting a token
happyShift new_state 0# tk st sts stk@(x `HappyStk` _) =
let i = (case Happy_GHC_Exts.unsafeCoerce# x of { (Happy_GHC_Exts.I# (i)) -> i }) in
-- trace "shifting the error token" $
happyDoAction i tk new_state (HappyCons (st) (sts)) (stk)
happyShift new_state i tk st sts stk =
happyNewToken new_state (HappyCons (st) (sts)) ((happyInTok (tk))`HappyStk`stk)
-- happyReduce is specialised for the common cases.
happySpecReduce_0 i fn 0# tk st sts stk
= happyFail 0# tk st sts stk
happySpecReduce_0 nt fn j tk st@((action)) sts stk
= happyGoto nt j tk st (HappyCons (st) (sts)) (fn `HappyStk` stk)
happySpecReduce_1 i fn 0# tk st sts stk
= happyFail 0# tk st sts stk
happySpecReduce_1 nt fn j tk _ sts@((HappyCons (st@(action)) (_))) (v1`HappyStk`stk')
= let r = fn v1 in
happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
happySpecReduce_2 i fn 0# tk st sts stk
= happyFail 0# tk st sts stk
happySpecReduce_2 nt fn j tk _ (HappyCons (_) (sts@((HappyCons (st@(action)) (_))))) (v1`HappyStk`v2`HappyStk`stk')
= let r = fn v1 v2 in
happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
happySpecReduce_3 i fn 0# tk st sts stk
= happyFail 0# tk st sts stk
happySpecReduce_3 nt fn j tk _ (HappyCons (_) ((HappyCons (_) (sts@((HappyCons (st@(action)) (_))))))) (v1`HappyStk`v2`HappyStk`v3`HappyStk`stk')
= let r = fn v1 v2 v3 in
happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
happyReduce k i fn 0# tk st sts stk
= happyFail 0# tk st sts stk
happyReduce k nt fn j tk st sts stk
= case happyDrop (k Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#)) sts of
sts1@((HappyCons (st1@(action)) (_))) ->
let r = fn stk in -- it doesn't hurt to always seq here...
happyDoSeq r (happyGoto nt j tk st1 sts1 r)
happyMonadReduce k nt fn 0# tk st sts stk
= happyFail 0# tk st sts stk
happyMonadReduce k nt fn j tk st sts stk =
case happyDrop k (HappyCons (st) (sts)) of
sts1@((HappyCons (st1@(action)) (_))) ->
let drop_stk = happyDropStk k stk in
happyThen1 (fn stk tk) (\r -> happyGoto nt j tk st1 sts1 (r `HappyStk` drop_stk))
happyMonad2Reduce k nt fn 0# tk st sts stk
= happyFail 0# tk st sts stk
happyMonad2Reduce k nt fn j tk st sts stk =
case happyDrop k (HappyCons (st) (sts)) of
sts1@((HappyCons (st1@(action)) (_))) ->
let drop_stk = happyDropStk k stk
off = indexShortOffAddr happyGotoOffsets st1
off_i = (off Happy_GHC_Exts.+# nt)
new_state = indexShortOffAddr happyTable off_i
in
happyThen1 (fn stk tk) (\r -> happyNewToken new_state sts1 (r `HappyStk` drop_stk))
happyDrop 0# l = l
happyDrop n (HappyCons (_) (t)) = happyDrop (n Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#)) t
happyDropStk 0# l = l
happyDropStk n (x `HappyStk` xs) = happyDropStk (n Happy_GHC_Exts.-# (1#::Happy_GHC_Exts.Int#)) xs
-----------------------------------------------------------------------------
-- Moving to a new state after a reduction
happyGoto nt j tk st =
{- nothing -}
happyDoAction j tk new_state
where off = indexShortOffAddr happyGotoOffsets st
off_i = (off Happy_GHC_Exts.+# nt)
new_state = indexShortOffAddr happyTable off_i
-----------------------------------------------------------------------------
-- Error recovery (0# is the error token)
-- parse error if we are in recovery and we fail again
happyFail 0# tk old_st _ stk@(x `HappyStk` _) =
let i = (case Happy_GHC_Exts.unsafeCoerce# x of { (Happy_GHC_Exts.I# (i)) -> i }) in
-- trace "failing" $
happyError_ i tk
{- We don't need state discarding for our restricted implementation of
"error". In fact, it can cause some bogus parses, so I've disabled it
for now --SDM
-- discard a state
happyFail 0# tk old_st (HappyCons ((action)) (sts))
(saved_tok `HappyStk` _ `HappyStk` stk) =
-- trace ("discarding state, depth " ++ show (length stk)) $
happyDoAction 0# tk action sts ((saved_tok`HappyStk`stk))
-}
-- Enter error recovery: generate an error token,
-- save the old token and carry on.
happyFail i tk (action) sts stk =
-- trace "entering error recovery" $
happyDoAction 0# tk action sts ( (Happy_GHC_Exts.unsafeCoerce# (Happy_GHC_Exts.I# (i))) `HappyStk` stk)
-- Internal happy errors:
notHappyAtAll :: a
notHappyAtAll = error "Internal Happy error\n"
-----------------------------------------------------------------------------
-- Hack to get the typechecker to accept our action functions
happyTcHack :: Happy_GHC_Exts.Int# -> a -> a
happyTcHack x y = y
{-# INLINE happyTcHack #-}
-----------------------------------------------------------------------------
-- Seq-ing. If the --strict flag is given, then Happy emits
-- happySeq = happyDoSeq
-- otherwise it emits
-- happySeq = happyDontSeq
happyDoSeq, happyDontSeq :: a -> b -> b
happyDoSeq a b = a `seq` b
happyDontSeq a b = b
-----------------------------------------------------------------------------
-- Don't inline any functions from the template. GHC has a nasty habit
-- of deciding to inline happyGoto everywhere, which increases the size of
-- the generated parser quite a bit.
{-# NOINLINE happyDoAction #-}
{-# NOINLINE happyTable #-}
{-# NOINLINE happyCheck #-}
{-# NOINLINE happyActOffsets #-}
{-# NOINLINE happyGotoOffsets #-}
{-# NOINLINE happyDefActions #-}
{-# NOINLINE happyShift #-}
{-# NOINLINE happySpecReduce_0 #-}
{-# NOINLINE happySpecReduce_1 #-}
{-# NOINLINE happySpecReduce_2 #-}
{-# NOINLINE happySpecReduce_3 #-}
{-# NOINLINE happyReduce #-}
{-# NOINLINE happyMonadReduce #-}
{-# NOINLINE happyGoto #-}
{-# NOINLINE happyFail #-}
-- end of Happy Template.