{-# OPTIONS_GHC -w #-}
{-# OPTIONS -XMagicHash -XBangPatterns -XTypeSynonymInstances -XFlexibleInstances -cpp #-}
#if __GLASGOW_HASKELL__ >= 710
{-# OPTIONS_GHC -XPartialTypeSignatures #-}
#endif
{-# OPTIONS_GHC -fno-warn-incomplete-patterns -fno-warn-overlapping-patterns #-}
module Sit.Par
  ( happyError
  , myLexer
  , pPrg
  , pDecl
  , pQualId
  , pListDecl
  , pIdU
  , pBind
  , pListBind
  , pListIdent
  , pListIdU
  , pExp2
  , pExp1
  , pExp
  ) where
import qualified Sit.Abs
import Sit.Lex
import qualified Data.Array as Happy_Data_Array
import qualified Data.Bits as Bits
import qualified GHC.Exts as Happy_GHC_Exts
import Control.Applicative(Applicative(..))
import Control.Monad (ap)

-- parser produced by Happy Version 1.20.1.1

newtype HappyAbsSyn  = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
newtype HappyWrap15 = HappyWrap15 (Sit.Abs.Ident)
happyIn15 :: (Sit.Abs.Ident) -> (HappyAbsSyn )
happyIn15 :: Ident -> HappyAbsSyn
happyIn15 Ident
x = HappyWrap15 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (Ident -> HappyWrap15
HappyWrap15 Ident
x)
{-# INLINE happyIn15 #-}
happyOut15 :: (HappyAbsSyn ) -> HappyWrap15
happyOut15 :: HappyAbsSyn -> HappyWrap15
happyOut15 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap15
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut15 #-}
newtype HappyWrap16 = HappyWrap16 (Integer)
happyIn16 :: (Integer) -> (HappyAbsSyn )
happyIn16 :: Integer -> HappyAbsSyn
happyIn16 Integer
x = HappyWrap16 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (Integer -> HappyWrap16
HappyWrap16 Integer
x)
{-# INLINE happyIn16 #-}
happyOut16 :: (HappyAbsSyn ) -> HappyWrap16
happyOut16 :: HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap16
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut16 #-}
newtype HappyWrap17 = HappyWrap17 (Sit.Abs.Prg)
happyIn17 :: (Sit.Abs.Prg) -> (HappyAbsSyn )
happyIn17 :: Prg -> HappyAbsSyn
happyIn17 Prg
x = HappyWrap17 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (Prg -> HappyWrap17
HappyWrap17 Prg
x)
{-# INLINE happyIn17 #-}
happyOut17 :: (HappyAbsSyn ) -> HappyWrap17
happyOut17 :: HappyAbsSyn -> HappyWrap17
happyOut17 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap17
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut17 #-}
newtype HappyWrap18 = HappyWrap18 (Sit.Abs.Decl)
happyIn18 :: (Sit.Abs.Decl) -> (HappyAbsSyn )
happyIn18 :: Decl -> HappyAbsSyn
happyIn18 Decl
x = HappyWrap18 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (Decl -> HappyWrap18
HappyWrap18 Decl
x)
{-# INLINE happyIn18 #-}
happyOut18 :: (HappyAbsSyn ) -> HappyWrap18
happyOut18 :: HappyAbsSyn -> HappyWrap18
happyOut18 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap18
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut18 #-}
newtype HappyWrap19 = HappyWrap19 (Sit.Abs.QualId)
happyIn19 :: (Sit.Abs.QualId) -> (HappyAbsSyn )
happyIn19 :: QualId -> HappyAbsSyn
happyIn19 QualId
x = HappyWrap19 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (QualId -> HappyWrap19
HappyWrap19 QualId
x)
{-# INLINE happyIn19 #-}
happyOut19 :: (HappyAbsSyn ) -> HappyWrap19
happyOut19 :: HappyAbsSyn -> HappyWrap19
happyOut19 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap19
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut19 #-}
newtype HappyWrap20 = HappyWrap20 ([Sit.Abs.Decl])
happyIn20 :: ([Sit.Abs.Decl]) -> (HappyAbsSyn )
happyIn20 :: [Decl] -> HappyAbsSyn
happyIn20 [Decl]
x = HappyWrap20 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([Decl] -> HappyWrap20
HappyWrap20 [Decl]
x)
{-# INLINE happyIn20 #-}
happyOut20 :: (HappyAbsSyn ) -> HappyWrap20
happyOut20 :: HappyAbsSyn -> HappyWrap20
happyOut20 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap20
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut20 #-}
newtype HappyWrap21 = HappyWrap21 (Sit.Abs.IdU)
happyIn21 :: (Sit.Abs.IdU) -> (HappyAbsSyn )
happyIn21 :: IdU -> HappyAbsSyn
happyIn21 IdU
x = HappyWrap21 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (IdU -> HappyWrap21
HappyWrap21 IdU
x)
{-# INLINE happyIn21 #-}
happyOut21 :: (HappyAbsSyn ) -> HappyWrap21
happyOut21 :: HappyAbsSyn -> HappyWrap21
happyOut21 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap21
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut21 #-}
newtype HappyWrap22 = HappyWrap22 (Sit.Abs.Bind)
happyIn22 :: (Sit.Abs.Bind) -> (HappyAbsSyn )
happyIn22 :: Bind -> HappyAbsSyn
happyIn22 Bind
x = HappyWrap22 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (Bind -> HappyWrap22
HappyWrap22 Bind
x)
{-# INLINE happyIn22 #-}
happyOut22 :: (HappyAbsSyn ) -> HappyWrap22
happyOut22 :: HappyAbsSyn -> HappyWrap22
happyOut22 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap22
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut22 #-}
newtype HappyWrap23 = HappyWrap23 ([Sit.Abs.Bind])
happyIn23 :: ([Sit.Abs.Bind]) -> (HappyAbsSyn )
happyIn23 :: [Bind] -> HappyAbsSyn
happyIn23 [Bind]
x = HappyWrap23 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([Bind] -> HappyWrap23
HappyWrap23 [Bind]
x)
{-# INLINE happyIn23 #-}
happyOut23 :: (HappyAbsSyn ) -> HappyWrap23
happyOut23 :: HappyAbsSyn -> HappyWrap23
happyOut23 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap23
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut23 #-}
newtype HappyWrap24 = HappyWrap24 ([Sit.Abs.Ident])
happyIn24 :: ([Sit.Abs.Ident]) -> (HappyAbsSyn )
happyIn24 :: [Ident] -> HappyAbsSyn
happyIn24 [Ident]
x = HappyWrap24 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([Ident] -> HappyWrap24
HappyWrap24 [Ident]
x)
{-# INLINE happyIn24 #-}
happyOut24 :: (HappyAbsSyn ) -> HappyWrap24
happyOut24 :: HappyAbsSyn -> HappyWrap24
happyOut24 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap24
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut24 #-}
newtype HappyWrap25 = HappyWrap25 ([Sit.Abs.IdU])
happyIn25 :: ([Sit.Abs.IdU]) -> (HappyAbsSyn )
happyIn25 :: [IdU] -> HappyAbsSyn
happyIn25 [IdU]
x = HappyWrap25 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([IdU] -> HappyWrap25
HappyWrap25 [IdU]
x)
{-# INLINE happyIn25 #-}
happyOut25 :: (HappyAbsSyn ) -> HappyWrap25
happyOut25 :: HappyAbsSyn -> HappyWrap25
happyOut25 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap25
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut25 #-}
newtype HappyWrap26 = HappyWrap26 (Sit.Abs.Exp)
happyIn26 :: (Sit.Abs.Exp) -> (HappyAbsSyn )
happyIn26 :: Exp -> HappyAbsSyn
happyIn26 Exp
x = HappyWrap26 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (Exp -> HappyWrap26
HappyWrap26 Exp
x)
{-# INLINE happyIn26 #-}
happyOut26 :: (HappyAbsSyn ) -> HappyWrap26
happyOut26 :: HappyAbsSyn -> HappyWrap26
happyOut26 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap26
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut26 #-}
newtype HappyWrap27 = HappyWrap27 (Sit.Abs.Exp)
happyIn27 :: (Sit.Abs.Exp) -> (HappyAbsSyn )
happyIn27 :: Exp -> HappyAbsSyn
happyIn27 Exp
x = HappyWrap27 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (Exp -> HappyWrap27
HappyWrap27 Exp
x)
{-# INLINE happyIn27 #-}
happyOut27 :: (HappyAbsSyn ) -> HappyWrap27
happyOut27 :: HappyAbsSyn -> HappyWrap27
happyOut27 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap27
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut27 #-}
newtype HappyWrap28 = HappyWrap28 (Sit.Abs.Exp)
happyIn28 :: (Sit.Abs.Exp) -> (HappyAbsSyn )
happyIn28 :: Exp -> HappyAbsSyn
happyIn28 Exp
x = HappyWrap28 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (Exp -> HappyWrap28
HappyWrap28 Exp
x)
{-# INLINE happyIn28 #-}
happyOut28 :: (HappyAbsSyn ) -> HappyWrap28
happyOut28 :: HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap28
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut28 #-}
happyInTok :: (Token) -> (HappyAbsSyn )
happyInTok :: Token -> HappyAbsSyn
happyInTok Token
x = Token -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# Token
x
{-# INLINE happyInTok #-}
happyOutTok :: (HappyAbsSyn ) -> (Token)
happyOutTok :: HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
x = HappyAbsSyn -> Token
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOutTok #-}


happyExpList :: HappyAddr
happyExpList :: HappyAddr
happyExpList = Addr# -> HappyAddr
HappyA# Addr#
"\x00\x00\x00\x00\x00\x00\x10\x04\x00\x00\x00\x00\x00\x00\x82\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x08\x02\x00\x00\x00\x00\x80\x00\x40\x00\x00\x00\x20\x0c\x00\x00\x00\x00\x00\x00\x84\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x08\x00\x04\x00\x00\x00\x02\x78\x65\x99\x01\x00\x00\x40\x00\xaf\x2c\x33\x00\x00\x00\x08\xe0\xbf\x65\x06\x00\x00\x00\x00\x00\x00\x40\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\x40\x05\xaf\x2c\x33\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\xfc\xb7\xcc\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\x01\xa0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\xe0\xbf\x65\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x0c\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\x01\xbc\xb2\xcc\x00\x00\x00\x20\x80\xff\x96\x19\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa0\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x02\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x20\x08\x00\x00\x00\x04\xf0\xdf\x32\x03\x00\x00\x80\x00\xfe\x5b\x66\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x82\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\xf0\xdf\x32\x03\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\x40\x00\xff\x2d\x33\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x01\xfc\xb7\xcc\x00\x00\x00\x20\x80\xff\x96\x19\x00\x00\x00\x04\xf0\xdf\x32\x03\x00\x00\x80\x00\xfe\x5b\x66\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\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x20\x80\xff\x96\x19\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x02\xf8\x6f\x99\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\xe0\xbf\x65\x06\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x08\x00\x04\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x08\xe0\xbf\x65\x06\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#

{-# NOINLINE happyExpListPerState #-}
happyExpListPerState :: Int -> [String]
happyExpListPerState Int
st =
    [String]
token_strs_expected
  where token_strs :: [String]
token_strs = [String
"error",String
"%dummy",String
"%start_pPrg",String
"%start_pDecl",String
"%start_pQualId",String
"%start_pListDecl",String
"%start_pIdU",String
"%start_pBind",String
"%start_pListBind",String
"%start_pListIdent",String
"%start_pListIdU",String
"%start_pExp2",String
"%start_pExp1",String
"%start_pExp",String
"Ident",String
"Integer",String
"Prg",String
"Decl",String
"QualId",String
"ListDecl",String
"IdU",String
"Bind",String
"ListBind",String
"ListIdent",String
"ListIdU",String
"Exp2",String
"Exp1",String
"Exp",String
"'('",String
"')'",String
"'+'",String
"'--;'",String
"'->'",String
"'.'",String
"'..'",String
"':'",String
"';'",String
"'='",String
"'Nat'",String
"'Set'",String
"'Set1'",String
"'Set2'",String
"'\\\\'",String
"'_'",String
"'case'",String
"'fix'",String
"'forall'",String
"'import'",String
"'lsuc'",String
"'lzero'",String
"'of'",String
"'oo'",String
"'open'",String
"'return'",String
"'suc'",String
"'zero'",String
"'{'",String
"'}'",String
"L_Ident",String
"L_integ",String
"%eof"]
        bit_start :: Int
bit_start = Int
st Int -> Int -> Int
forall a. Num a => a -> a -> a
Prelude.* Int
61
        bit_end :: Int
bit_end = (Int
st Int -> Int -> Int
forall a. Num a => a -> a -> a
Prelude.+ Int
1) Int -> Int -> Int
forall a. Num a => a -> a -> a
Prelude.* Int
61
        read_bit :: Int -> Bool
read_bit = HappyAddr -> Int -> Bool
readArrayBit HappyAddr
happyExpList
        bits :: [Bool]
bits = (Int -> Bool) -> [Int] -> [Bool]
forall a b. (a -> b) -> [a] -> [b]
Prelude.map Int -> Bool
read_bit [Int
bit_start..Int
bit_end Int -> Int -> Int
forall a. Num a => a -> a -> a
Prelude.- Int
1]
        bits_indexed :: [(Bool, Int)]
bits_indexed = [Bool] -> [Int] -> [(Bool, Int)]
forall a b. [a] -> [b] -> [(a, b)]
Prelude.zip [Bool]
bits [Int
0..Int
60]
        token_strs_expected :: [String]
token_strs_expected = ((Bool, Int) -> [String]) -> [(Bool, Int)] -> [String]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
Prelude.concatMap (Bool, Int) -> [String]
f [(Bool, Int)]
bits_indexed
        f :: (Bool, Int) -> [String]
f (Bool
Prelude.False, Int
_) = []
        f (Bool
Prelude.True, Int
nr) = [[String]
token_strs [String] -> Int -> String
forall a. HasCallStack => [a] -> Int -> a
Prelude.!! Int
nr]

happyActOffsets :: HappyAddr
happyActOffsets :: HappyAddr
happyActOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\x47\x00\x47\x00\xf9\xff\x47\x00\xf1\xff\x03\x00\x03\x00\xf9\xff\xf1\xff\x4f\x00\x4f\x00\x19\x00\xf9\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x39\x00\x02\x00\x19\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf5\xff\x00\x00\x19\x00\x00\x00\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x19\x00\x02\x00\xf1\xff\x02\x00\x11\x00\x52\x00\x03\x00\x52\x00\x3f\x00\x3f\x00\x3f\x00\x7a\x00\x7a\x00\xfe\xff\x99\x00\x8b\x00\x9a\x00\x00\x00\xfd\xff\x9b\x00\x9b\x00\x00\x00\x98\x00\x98\x00\x47\x00\x19\x00\x19\x00\x00\x00\x00\x00\xb2\x00\x00\x00\x00\x00\x00\x00\xbb\x00\x00\x00\xba\x00\xae\x00\xc8\x00\xca\x00\x60\x00\xb0\x00\x19\x00\x00\x00\x00\x00\x00\x00\x19\x00\xbd\x00\x19\x00\x19\x00\x19\x00\x19\x00\x00\x00\x00\x00\x00\x00\xd6\x00\x00\x00\xcc\x00\x00\x00\xc7\x00\x00\x00\xcf\x00\xdf\x00\xe5\x00\xed\x00\x19\x00\x00\x00\x00\x00\xfa\x00\x19\x00\x00\x00\x19\x00\xe4\x00\xef\x00\xe7\x00\xe2\x00\xf1\xff\x02\x01\x00\x01\x19\x00\xe9\x00\x00\x00\x00\x00"#

happyGotoOffsets :: HappyAddr
happyGotoOffsets :: HappyAddr
happyGotoOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\x87\x00\x3d\x00\x07\x00\x95\x00\x63\x00\xff\x00\xf3\x00\x32\x00\x15\x00\x42\x00\xeb\x00\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf8\x00\x00\x00\x70\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2d\x00\x00\x00\x74\x00\x00\x00\xf5\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf8\x00\x82\x00\x00\x00\x4c\x00\x00\x00\x36\x00\x00\x00\xf9\x00\x00\x00\x41\x00\x08\x01\x09\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x01\x53\x00\xa6\x00\x85\x00\x93\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\x0b\x01\x96\x00\x00\x00\x00\x00\x00\x00\xa4\x00\x00\x00\xa7\x00\xb5\x00\xb8\x00\xc6\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\xc9\x00\x00\x00\x00\x00\x00\x00\xd7\x00\x00\x00\xda\x00\x00\x00\x00\x00\x00\x00\x00\x00\x7e\x00\x00\x00\x00\x00\xe8\x00\x00\x00\x00\x00\x00\x00"#

happyAdjustOffset :: Happy_GHC_Exts.Int# -> Happy_GHC_Exts.Int#
happyAdjustOffset :: Int# -> Int#
happyAdjustOffset Int#
off = Int#
off

happyDefActions :: HappyAddr
happyDefActions :: HappyAddr
happyDefActions = Addr# -> HappyAddr
HappyA# Addr#
"\xed\xff\xed\xff\x00\x00\xed\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf3\xff\xe8\xff\xdc\xff\xdd\xff\xcf\xff\xc7\xff\x00\x00\x00\x00\xda\xff\xd9\xff\xd8\xff\xd7\xff\x00\x00\xe7\xff\x00\x00\xd4\xff\x00\x00\xd2\xff\xd3\xff\xdb\xff\xd5\xff\xd6\xff\xf2\xff\x00\x00\x00\x00\x00\x00\xdf\xff\x00\x00\xe1\xff\x00\x00\xe3\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xea\xff\x00\x00\x00\x00\xec\xff\x00\x00\x00\x00\x00\x00\xf1\xff\x00\x00\x00\x00\xed\xff\x00\x00\x00\x00\xe5\xff\xe6\xff\x00\x00\xe2\xff\xe0\xff\xde\xff\x00\x00\xd0\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xcb\xff\xc9\xff\xd1\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xef\xff\xf0\xff\xe9\xff\xee\xff\xeb\xff\x00\x00\xcd\xff\x00\x00\xce\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe4\xff\xca\xff\x00\x00\x00\x00\xcc\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc8\xff"#

happyCheck :: HappyAddr
happyCheck :: HappyAddr
happyCheck = Addr# -> HappyAddr
HappyA# Addr#
"\xff\xff\x10\x00\x01\x00\x06\x00\x01\x00\x10\x00\x08\x00\x00\x00\x0a\x00\x06\x00\x07\x00\x04\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x1f\x00\x10\x00\x1d\x00\x12\x00\x1f\x00\x00\x00\x15\x00\x16\x00\x1f\x00\x18\x00\x01\x00\x06\x00\x1b\x00\x1c\x00\x21\x00\x0a\x00\x1f\x00\x20\x00\x21\x00\x21\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x00\x00\x15\x00\x16\x00\x1f\x00\x18\x00\x00\x00\x06\x00\x1b\x00\x1c\x00\x00\x00\x0a\x00\x1f\x00\x20\x00\x01\x00\x09\x00\x03\x00\x00\x00\x05\x00\x09\x00\x03\x00\x00\x00\x00\x00\x01\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x06\x00\x10\x00\x09\x00\x12\x00\x00\x00\x0b\x00\x15\x00\x16\x00\x01\x00\x18\x00\x06\x00\x00\x00\x1b\x00\x1c\x00\x0a\x00\x04\x00\x1f\x00\x20\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x1f\x00\x10\x00\x19\x00\x12\x00\x02\x00\x00\x00\x15\x00\x16\x00\x1f\x00\x18\x00\x08\x00\x06\x00\x1b\x00\x1c\x00\x00\x00\x01\x00\x1f\x00\x20\x00\x00\x00\x01\x00\x06\x00\x21\x00\x00\x00\x01\x00\x06\x00\x0b\x00\x0c\x00\x0d\x00\x06\x00\x0b\x00\x0c\x00\x0d\x00\x00\x00\x0b\x00\x0c\x00\x0d\x00\x00\x00\x01\x00\x06\x00\x00\x00\x01\x00\x00\x00\x06\x00\x02\x00\x03\x00\x06\x00\x05\x00\x0b\x00\x0c\x00\x0d\x00\x0b\x00\x0c\x00\x0d\x00\x00\x00\x01\x00\x00\x00\x00\x00\x01\x00\x03\x00\x06\x00\x05\x00\x21\x00\x06\x00\x04\x00\x0b\x00\x0c\x00\x0d\x00\x0b\x00\x0c\x00\x0d\x00\x00\x00\x01\x00\x00\x00\x00\x00\x01\x00\x03\x00\x06\x00\x05\x00\x21\x00\x06\x00\x14\x00\x0b\x00\x0c\x00\x0d\x00\x0b\x00\x0c\x00\x0d\x00\x00\x00\x01\x00\x1f\x00\x00\x00\x01\x00\x08\x00\x06\x00\x21\x00\x02\x00\x06\x00\x05\x00\x0b\x00\x0c\x00\x0d\x00\x0b\x00\x0c\x00\x0d\x00\x00\x00\x01\x00\x1a\x00\x00\x00\x01\x00\x01\x00\x06\x00\x05\x00\x02\x00\x06\x00\x20\x00\x0b\x00\x0c\x00\x0d\x00\x0b\x00\x0c\x00\x0d\x00\x00\x00\x01\x00\x1c\x00\x00\x00\x01\x00\x06\x00\x06\x00\x17\x00\x10\x00\x06\x00\x02\x00\x0b\x00\x0c\x00\x0d\x00\x0b\x00\x0c\x00\x0d\x00\x00\x00\x01\x00\x05\x00\x00\x00\x01\x00\x09\x00\x06\x00\x02\x00\x01\x00\x06\x00\x10\x00\x0b\x00\x0c\x00\x0d\x00\x0b\x00\x0c\x00\x00\x00\x01\x00\x07\x00\x08\x00\x07\x00\x08\x00\x06\x00\x05\x00\x07\x00\x08\x00\x1b\x00\x0b\x00\x02\x00\x05\x00\x07\x00\x1e\x00\x00\x00\x00\x00\x00\x00\xff\xff\x01\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\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"#

happyTable :: HappyAddr
happyTable :: HappyAddr
happyTable = Addr# -> HappyAddr
HappyA# Addr#
"\x00\x00\x1b\x00\x26\x00\x3c\x00\x2e\x00\x1b\x00\x3f\x00\x36\x00\x40\x00\x2f\x00\x30\x00\x37\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0e\x00\x1b\x00\x4c\x00\x1d\x00\x0e\x00\x0e\x00\x1f\x00\x20\x00\x0e\x00\x21\x00\x15\x00\x27\x00\x22\x00\x23\x00\xff\xff\x28\x00\x0e\x00\x24\x00\xff\xff\xff\xff\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x0e\x00\x1f\x00\x20\x00\x0e\x00\x21\x00\x29\x00\x27\x00\x22\x00\x23\x00\x29\x00\x4a\x00\x0e\x00\x24\x00\x26\x00\x2a\x00\x4e\x00\x32\x00\x4f\x00\x44\x00\x38\x00\x29\x00\x0e\x00\x0f\x00\x16\x00\x17\x00\x18\x00\x19\x00\x10\x00\x1b\x00\x42\x00\x1d\x00\x0e\x00\x26\x00\x1f\x00\x20\x00\x26\x00\x21\x00\x27\x00\x36\x00\x22\x00\x23\x00\x45\x00\x5b\x00\x0e\x00\x24\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0e\x00\x1b\x00\x36\x00\x1d\x00\x52\x00\x0e\x00\x1f\x00\x20\x00\x0e\x00\x21\x00\x53\x00\x31\x00\x22\x00\x23\x00\x0e\x00\x0f\x00\x0e\x00\x24\x00\x0e\x00\x0f\x00\x10\x00\xff\xff\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x10\x00\x11\x00\x12\x00\x4c\x00\x0e\x00\x11\x00\x12\x00\x49\x00\x0e\x00\x0f\x00\x71\x00\x0e\x00\x0f\x00\x32\x00\x10\x00\x39\x00\x33\x00\x10\x00\x3a\x00\x11\x00\x12\x00\x46\x00\x11\x00\x12\x00\x59\x00\x0e\x00\x0f\x00\x32\x00\x0e\x00\x0f\x00\x33\x00\x10\x00\x34\x00\xff\xff\x10\x00\x3e\x00\x11\x00\x12\x00\x58\x00\x11\x00\x12\x00\x4f\x00\x0e\x00\x0f\x00\x32\x00\x0e\x00\x0f\x00\x33\x00\x10\x00\x5a\x00\xff\xff\x10\x00\x3d\x00\x11\x00\x12\x00\x62\x00\x11\x00\x12\x00\x60\x00\x0e\x00\x0f\x00\x0e\x00\x0e\x00\x0f\x00\x58\x00\x10\x00\xff\xff\x52\x00\x10\x00\x57\x00\x11\x00\x12\x00\x5f\x00\x11\x00\x12\x00\x5e\x00\x0e\x00\x0f\x00\x56\x00\x0e\x00\x0f\x00\x54\x00\x10\x00\x55\x00\x67\x00\x10\x00\x24\x00\x11\x00\x12\x00\x5d\x00\x11\x00\x12\x00\x67\x00\x0e\x00\x0f\x00\x62\x00\x0e\x00\x0f\x00\x3c\x00\x10\x00\x66\x00\x65\x00\x10\x00\x64\x00\x11\x00\x12\x00\x6a\x00\x11\x00\x12\x00\x6c\x00\x0e\x00\x0f\x00\x6a\x00\x0e\x00\x0f\x00\x6e\x00\x10\x00\x69\x00\x6f\x00\x10\x00\x71\x00\x11\x00\x12\x00\x74\x00\x11\x00\x24\x00\x0e\x00\x0f\x00\x2b\x00\x2c\x00\x2b\x00\x48\x00\x10\x00\x6c\x00\x2b\x00\x43\x00\x70\x00\x47\x00\x73\x00\x74\x00\x30\x00\x76\x00\x41\x00\x40\x00\x5c\x00\x00\x00\x50\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#

happyReduceArr :: Array
  Int
  (Int#
   -> Token
   -> Int#
   -> Happy_IntList
   -> HappyStk HappyAbsSyn
   -> [Token]
   -> Either String HappyAbsSyn)
happyReduceArr = (Int, Int)
-> [(Int,
     Int#
     -> Token
     -> Int#
     -> Happy_IntList
     -> HappyStk HappyAbsSyn
     -> [Token]
     -> Either String HappyAbsSyn)]
-> Array
     Int
     (Int#
      -> Token
      -> Int#
      -> Happy_IntList
      -> HappyStk HappyAbsSyn
      -> [Token]
      -> Either String HappyAbsSyn)
forall i e. Ix i => (i, i) -> [(i, e)] -> Array i e
Happy_Data_Array.array (Int
12, Int
56) [
	(Int
12 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_12),
	(Int
13 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_13),
	(Int
14 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_14),
	(Int
15 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_15),
	(Int
16 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_16),
	(Int
17 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_17),
	(Int
18 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_18),
	(Int
19 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_19),
	(Int
20 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_20),
	(Int
21 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_21),
	(Int
22 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_22),
	(Int
23 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_23),
	(Int
24 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_24),
	(Int
25 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_25),
	(Int
26 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_26),
	(Int
27 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_27),
	(Int
28 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_28),
	(Int
29 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_29),
	(Int
30 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_30),
	(Int
31 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_31),
	(Int
32 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_32),
	(Int
33 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_33),
	(Int
34 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_34),
	(Int
35 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_35),
	(Int
36 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_36),
	(Int
37 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_37),
	(Int
38 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_38),
	(Int
39 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_39),
	(Int
40 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_40),
	(Int
41 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_41),
	(Int
42 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_42),
	(Int
43 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_43),
	(Int
44 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_44),
	(Int
45 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_45),
	(Int
46 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_46),
	(Int
47 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_47),
	(Int
48 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_48),
	(Int
49 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_49),
	(Int
50 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_50),
	(Int
51 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_51),
	(Int
52 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_52),
	(Int
53 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_53),
	(Int
54 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_54),
	(Int
55 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_55),
	(Int
56 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_56)
	]

happy_n_terms :: Int
happy_n_terms = Int
34 :: Prelude.Int
happy_n_nonterms :: Int
happy_n_nonterms = Int
14 :: Prelude.Int

happyReduce_12 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_12 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
0# HappyAbsSyn -> HappyAbsSyn
happyReduction_12
happyReduction_12 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_12 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { (PT Posn
_ (TV String
happy_var_1)) -> 
	Ident -> HappyAbsSyn
happyIn15
		 (String -> Ident
Sit.Abs.Ident String
happy_var_1
	)}

happyReduce_13 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_13 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
1# HappyAbsSyn -> HappyAbsSyn
happyReduction_13
happyReduction_13 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_13 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { (PT Posn
_ (TI String
happy_var_1)) -> 
	Integer -> HappyAbsSyn
happyIn16
		 ((String -> Integer
forall a. Read a => String -> a
read (String
happy_var_1)) :: Integer
	)}

happyReduce_14 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_14 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
2# HappyAbsSyn -> HappyAbsSyn
happyReduction_14
happyReduction_14 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_14 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap20
happyOut20 HappyAbsSyn
happy_x_1 of { (HappyWrap20 [Decl]
happy_var_1) -> 
	Prg -> HappyAbsSyn
happyIn17
		 ([Decl] -> Prg
Sit.Abs.Prg [Decl]
happy_var_1
	)}

happyReduce_15 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_15 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_3  Int#
3# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_15
happyReduction_15 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_15 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap15
happyOut15 HappyAbsSyn
happy_x_1 of { (HappyWrap15 Ident
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_3 of { (HappyWrap28 Exp
happy_var_3) -> 
	Decl -> HappyAbsSyn
happyIn18
		 (Ident -> Exp -> Decl
Sit.Abs.Sig Ident
happy_var_1 Exp
happy_var_3
	)}}

happyReduce_16 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_16 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_3  Int#
3# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_16
happyReduction_16 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_16 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap15
happyOut15 HappyAbsSyn
happy_x_1 of { (HappyWrap15 Ident
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_3 of { (HappyWrap28 Exp
happy_var_3) -> 
	Decl -> HappyAbsSyn
happyIn18
		 (Ident -> Exp -> Decl
Sit.Abs.Def Ident
happy_var_1 Exp
happy_var_3
	)}}

happyReduce_17 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_17 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_3  Int#
3# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p} {p}. HappyAbsSyn -> p -> p -> HappyAbsSyn
happyReduction_17
happyReduction_17 :: HappyAbsSyn -> p -> p -> HappyAbsSyn
happyReduction_17 HappyAbsSyn
happy_x_3
	p
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap19
happyOut19 HappyAbsSyn
happy_x_3 of { (HappyWrap19 QualId
happy_var_3) -> 
	Decl -> HappyAbsSyn
happyIn18
		 (QualId -> Decl
Sit.Abs.Open QualId
happy_var_3
	)}

happyReduce_18 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_18 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_0  Int#
3# HappyAbsSyn
happyReduction_18
happyReduction_18 :: HappyAbsSyn
happyReduction_18  =  Decl -> HappyAbsSyn
happyIn18
		 (Decl
Sit.Abs.Blank
	)

happyReduce_19 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_19 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
4# HappyAbsSyn -> HappyAbsSyn
happyReduction_19
happyReduction_19 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_19 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap15
happyOut15 HappyAbsSyn
happy_x_1 of { (HappyWrap15 Ident
happy_var_1) -> 
	QualId -> HappyAbsSyn
happyIn19
		 (Ident -> QualId
Sit.Abs.Sg Ident
happy_var_1
	)}

happyReduce_20 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_20 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_3  Int#
4# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_20
happyReduction_20 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_20 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap19
happyOut19 HappyAbsSyn
happy_x_1 of { (HappyWrap19 QualId
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap15
happyOut15 HappyAbsSyn
happy_x_3 of { (HappyWrap15 Ident
happy_var_3) -> 
	QualId -> HappyAbsSyn
happyIn19
		 (QualId -> Ident -> QualId
Sit.Abs.Cons QualId
happy_var_1 Ident
happy_var_3
	)}}

happyReduce_21 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_21 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
5# HappyAbsSyn -> HappyAbsSyn
happyReduction_21
happyReduction_21 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_21 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap18
happyOut18 HappyAbsSyn
happy_x_1 of { (HappyWrap18 Decl
happy_var_1) -> 
	[Decl] -> HappyAbsSyn
happyIn20
		 ((Decl -> [Decl] -> [Decl]
forall a. a -> [a] -> [a]
:[]) Decl
happy_var_1
	)}

happyReduce_22 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_22 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_3  Int#
5# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_22
happyReduction_22 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_22 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap18
happyOut18 HappyAbsSyn
happy_x_1 of { (HappyWrap18 Decl
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap20
happyOut20 HappyAbsSyn
happy_x_3 of { (HappyWrap20 [Decl]
happy_var_3) -> 
	[Decl] -> HappyAbsSyn
happyIn20
		 ((:) Decl
happy_var_1 [Decl]
happy_var_3
	)}}

happyReduce_23 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_23 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
6# HappyAbsSyn -> HappyAbsSyn
happyReduction_23
happyReduction_23 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_23 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap15
happyOut15 HappyAbsSyn
happy_x_1 of { (HappyWrap15 Ident
happy_var_1) -> 
	IdU -> HappyAbsSyn
happyIn21
		 (Ident -> IdU
Sit.Abs.Id Ident
happy_var_1
	)}

happyReduce_24 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_24 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
6# HappyAbsSyn -> HappyAbsSyn
forall {p}. p -> HappyAbsSyn
happyReduction_24
happyReduction_24 :: p -> HappyAbsSyn
happyReduction_24 p
happy_x_1
	 =  IdU -> HappyAbsSyn
happyIn21
		 (IdU
Sit.Abs.Under
	)

happyReduce_25 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_25 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_2  Int#
7# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_25
happyReduction_25 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_25 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap15
happyOut15 HappyAbsSyn
happy_x_2 of { (HappyWrap15 Ident
happy_var_2) -> 
	Bind -> HappyAbsSyn
happyIn22
		 (Ident -> Bind
Sit.Abs.BIrrel Ident
happy_var_2
	)}

happyReduce_26 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_26 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_2  Int#
7# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_26
happyReduction_26 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_26 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap15
happyOut15 HappyAbsSyn
happy_x_2 of { (HappyWrap15 Ident
happy_var_2) -> 
	Bind -> HappyAbsSyn
happyIn22
		 (Ident -> Bind
Sit.Abs.BRel Ident
happy_var_2
	)}

happyReduce_27 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_27 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce Int#
5# Int#
7# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_27
happyReduction_27 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_27 (HappyAbsSyn
happy_x_5 `HappyStk`
	HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> HappyWrap24
happyOut24 HappyAbsSyn
happy_x_2 of { (HappyWrap24 [Ident]
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_4 of { (HappyWrap28 Exp
happy_var_4) -> 
	Bind -> HappyAbsSyn
happyIn22
		 ([Ident] -> Exp -> Bind
Sit.Abs.BAnn [Ident]
happy_var_2 Exp
happy_var_4
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_28 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_28 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
8# HappyAbsSyn -> HappyAbsSyn
happyReduction_28
happyReduction_28 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_28 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap22
happyOut22 HappyAbsSyn
happy_x_1 of { (HappyWrap22 Bind
happy_var_1) -> 
	[Bind] -> HappyAbsSyn
happyIn23
		 ((Bind -> [Bind] -> [Bind]
forall a. a -> [a] -> [a]
:[]) Bind
happy_var_1
	)}

happyReduce_29 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_29 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_2  Int#
8# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_29
happyReduction_29 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_29 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap22
happyOut22 HappyAbsSyn
happy_x_1 of { (HappyWrap22 Bind
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap23
happyOut23 HappyAbsSyn
happy_x_2 of { (HappyWrap23 [Bind]
happy_var_2) -> 
	[Bind] -> HappyAbsSyn
happyIn23
		 ((:) Bind
happy_var_1 [Bind]
happy_var_2
	)}}

happyReduce_30 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_30 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
9# HappyAbsSyn -> HappyAbsSyn
happyReduction_30
happyReduction_30 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_30 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap15
happyOut15 HappyAbsSyn
happy_x_1 of { (HappyWrap15 Ident
happy_var_1) -> 
	[Ident] -> HappyAbsSyn
happyIn24
		 ((Ident -> [Ident] -> [Ident]
forall a. a -> [a] -> [a]
:[]) Ident
happy_var_1
	)}

happyReduce_31 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_31 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_2  Int#
9# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_31
happyReduction_31 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_31 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap15
happyOut15 HappyAbsSyn
happy_x_1 of { (HappyWrap15 Ident
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap24
happyOut24 HappyAbsSyn
happy_x_2 of { (HappyWrap24 [Ident]
happy_var_2) -> 
	[Ident] -> HappyAbsSyn
happyIn24
		 ((:) Ident
happy_var_1 [Ident]
happy_var_2
	)}}

happyReduce_32 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_32 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
10# HappyAbsSyn -> HappyAbsSyn
happyReduction_32
happyReduction_32 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_32 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap21
happyOut21 HappyAbsSyn
happy_x_1 of { (HappyWrap21 IdU
happy_var_1) -> 
	[IdU] -> HappyAbsSyn
happyIn25
		 ((IdU -> [IdU] -> [IdU]
forall a. a -> [a] -> [a]
:[]) IdU
happy_var_1
	)}

happyReduce_33 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_33 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_2  Int#
10# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_33
happyReduction_33 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_33 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap21
happyOut21 HappyAbsSyn
happy_x_1 of { (HappyWrap21 IdU
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap25
happyOut25 HappyAbsSyn
happy_x_2 of { (HappyWrap25 [IdU]
happy_var_2) -> 
	[IdU] -> HappyAbsSyn
happyIn25
		 ((:) IdU
happy_var_1 [IdU]
happy_var_2
	)}}

happyReduce_34 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_34 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
happyReduction_34
happyReduction_34 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_34 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap21
happyOut21 HappyAbsSyn
happy_x_1 of { (HappyWrap21 IdU
happy_var_1) -> 
	Exp -> HappyAbsSyn
happyIn26
		 (IdU -> Exp
Sit.Abs.Var IdU
happy_var_1
	)}

happyReduce_35 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_35 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
happyReduction_35
happyReduction_35 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_35 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
happy_x_1 of { (HappyWrap16 Integer
happy_var_1) -> 
	Exp -> HappyAbsSyn
happyIn26
		 (Integer -> Exp
Sit.Abs.Int Integer
happy_var_1
	)}

happyReduce_36 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_36 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
forall {p}. p -> HappyAbsSyn
happyReduction_36
happyReduction_36 :: p -> HappyAbsSyn
happyReduction_36 p
happy_x_1
	 =  Exp -> HappyAbsSyn
happyIn26
		 (Exp
Sit.Abs.Infty
	)

happyReduce_37 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_37 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
forall {p}. p -> HappyAbsSyn
happyReduction_37
happyReduction_37 :: p -> HappyAbsSyn
happyReduction_37 p
happy_x_1
	 =  Exp -> HappyAbsSyn
happyIn26
		 (Exp
Sit.Abs.Nat
	)

happyReduce_38 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_38 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
forall {p}. p -> HappyAbsSyn
happyReduction_38
happyReduction_38 :: p -> HappyAbsSyn
happyReduction_38 p
happy_x_1
	 =  Exp -> HappyAbsSyn
happyIn26
		 (Exp
Sit.Abs.Set
	)

happyReduce_39 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_39 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
forall {p}. p -> HappyAbsSyn
happyReduction_39
happyReduction_39 :: p -> HappyAbsSyn
happyReduction_39 p
happy_x_1
	 =  Exp -> HappyAbsSyn
happyIn26
		 (Exp
Sit.Abs.Set1
	)

happyReduce_40 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_40 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
forall {p}. p -> HappyAbsSyn
happyReduction_40
happyReduction_40 :: p -> HappyAbsSyn
happyReduction_40 p
happy_x_1
	 =  Exp -> HappyAbsSyn
happyIn26
		 (Exp
Sit.Abs.Set2
	)

happyReduce_41 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_41 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
forall {p}. p -> HappyAbsSyn
happyReduction_41
happyReduction_41 :: p -> HappyAbsSyn
happyReduction_41 p
happy_x_1
	 =  Exp -> HappyAbsSyn
happyIn26
		 (Exp
Sit.Abs.Zero
	)

happyReduce_42 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_42 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
forall {p}. p -> HappyAbsSyn
happyReduction_42
happyReduction_42 :: p -> HappyAbsSyn
happyReduction_42 p
happy_x_1
	 =  Exp -> HappyAbsSyn
happyIn26
		 (Exp
Sit.Abs.Suc
	)

happyReduce_43 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_43 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
forall {p}. p -> HappyAbsSyn
happyReduction_43
happyReduction_43 :: p -> HappyAbsSyn
happyReduction_43 p
happy_x_1
	 =  Exp -> HappyAbsSyn
happyIn26
		 (Exp
Sit.Abs.Fix
	)

happyReduce_44 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_44 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
forall {p}. p -> HappyAbsSyn
happyReduction_44
happyReduction_44 :: p -> HappyAbsSyn
happyReduction_44 p
happy_x_1
	 =  Exp -> HappyAbsSyn
happyIn26
		 (Exp
Sit.Abs.LZero
	)

happyReduce_45 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_45 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
forall {p}. p -> HappyAbsSyn
happyReduction_45
happyReduction_45 :: p -> HappyAbsSyn
happyReduction_45 p
happy_x_1
	 =  Exp -> HappyAbsSyn
happyIn26
		 (Exp
Sit.Abs.LSuc
	)

happyReduce_46 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_46 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_3  Int#
11# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p} {p}. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_46
happyReduction_46 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_46 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_2 of { (HappyWrap28 Exp
happy_var_2) -> 
	Exp -> HappyAbsSyn
happyIn26
		 (Exp
happy_var_2
	)}

happyReduce_47 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_47 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_2  Int#
12# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_47
happyReduction_47 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_47 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap27
happyOut27 HappyAbsSyn
happy_x_1 of { (HappyWrap27 Exp
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap26
happyOut26 HappyAbsSyn
happy_x_2 of { (HappyWrap26 Exp
happy_var_2) -> 
	Exp -> HappyAbsSyn
happyIn27
		 (Exp -> Exp -> Exp
Sit.Abs.App Exp
happy_var_1 Exp
happy_var_2
	)}}

happyReduce_48 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_48 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
12# HappyAbsSyn -> HappyAbsSyn
happyReduction_48
happyReduction_48 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_48 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap26
happyOut26 HappyAbsSyn
happy_x_1 of { (HappyWrap26 Exp
happy_var_1) -> 
	Exp -> HappyAbsSyn
happyIn27
		 (Exp
happy_var_1
	)}

happyReduce_49 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_49 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce Int#
4# Int#
13# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_49
happyReduction_49 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_49 (HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> HappyWrap25
happyOut25 HappyAbsSyn
happy_x_2 of { (HappyWrap25 [IdU]
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_4 of { (HappyWrap28 Exp
happy_var_4) -> 
	Exp -> HappyAbsSyn
happyIn28
		 ([IdU] -> Exp -> Exp
Sit.Abs.Lam [IdU]
happy_var_2 Exp
happy_var_4
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_50 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_50 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce Int#
4# Int#
13# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_50
happyReduction_50 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_50 (HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> HappyWrap23
happyOut23 HappyAbsSyn
happy_x_2 of { (HappyWrap23 [Bind]
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_4 of { (HappyWrap28 Exp
happy_var_4) -> 
	Exp -> HappyAbsSyn
happyIn28
		 ([Bind] -> Exp -> Exp
Sit.Abs.Forall [Bind]
happy_var_2 Exp
happy_var_4
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_51 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_51 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce Int#
7# Int#
13# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_51
happyReduction_51 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_51 (HappyAbsSyn
happy_x_7 `HappyStk`
	HappyAbsSyn
happy_x_6 `HappyStk`
	HappyAbsSyn
happy_x_5 `HappyStk`
	HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_2 of { (HappyWrap28 Exp
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_4 of { (HappyWrap28 Exp
happy_var_4) -> 
	case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_7 of { (HappyWrap28 Exp
happy_var_7) -> 
	Exp -> HappyAbsSyn
happyIn28
		 (Exp -> Exp -> Exp -> Exp
Sit.Abs.Pi Exp
happy_var_2 Exp
happy_var_4 Exp
happy_var_7
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_52 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_52 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_3  Int#
13# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_52
happyReduction_52 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_52 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap27
happyOut27 HappyAbsSyn
happy_x_1 of { (HappyWrap27 Exp
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_3 of { (HappyWrap28 Exp
happy_var_3) -> 
	Exp -> HappyAbsSyn
happyIn28
		 (Exp -> Exp -> Exp
Sit.Abs.Arrow Exp
happy_var_1 Exp
happy_var_3
	)}}

happyReduce_53 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_53 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce Int#
6# Int#
13# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_53
happyReduction_53 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_53 (HappyAbsSyn
happy_x_6 `HappyStk`
	HappyAbsSyn
happy_x_5 `HappyStk`
	HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_2 of { (HappyWrap28 Exp
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_4 of { (HappyWrap28 Exp
happy_var_4) -> 
	case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_6 of { (HappyWrap28 Exp
happy_var_6) -> 
	Exp -> HappyAbsSyn
happyIn28
		 (Exp -> Exp -> Exp -> Exp
Sit.Abs.Case Exp
happy_var_2 Exp
happy_var_4 Exp
happy_var_6
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_54 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_54 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_3  Int#
13# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_54
happyReduction_54 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_54 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap27
happyOut27 HappyAbsSyn
happy_x_1 of { (HappyWrap27 Exp
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
happy_x_3 of { (HappyWrap16 Integer
happy_var_3) -> 
	Exp -> HappyAbsSyn
happyIn28
		 (Exp -> Integer -> Exp
Sit.Abs.Plus Exp
happy_var_1 Integer
happy_var_3
	)}}

happyReduce_55 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_55 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce Int#
17# Int#
13# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_55
happyReduction_55 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_55 (HappyAbsSyn
happy_x_17 `HappyStk`
	HappyAbsSyn
happy_x_16 `HappyStk`
	HappyAbsSyn
happy_x_15 `HappyStk`
	HappyAbsSyn
happy_x_14 `HappyStk`
	HappyAbsSyn
happy_x_13 `HappyStk`
	HappyAbsSyn
happy_x_12 `HappyStk`
	HappyAbsSyn
happy_x_11 `HappyStk`
	HappyAbsSyn
happy_x_10 `HappyStk`
	HappyAbsSyn
happy_x_9 `HappyStk`
	HappyAbsSyn
happy_x_8 `HappyStk`
	HappyAbsSyn
happy_x_7 `HappyStk`
	HappyAbsSyn
happy_x_6 `HappyStk`
	HappyAbsSyn
happy_x_5 `HappyStk`
	HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_8 of { (HappyWrap28 Exp
happy_var_8) -> 
	case HappyAbsSyn -> HappyWrap21
happyOut21 HappyAbsSyn
happy_x_13 of { (HappyWrap21 IdU
happy_var_13) -> 
	case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_16 of { (HappyWrap28 Exp
happy_var_16) -> 
	Exp -> HappyAbsSyn
happyIn28
		 (Exp -> IdU -> Exp -> Exp
Sit.Abs.ELam Exp
happy_var_8 IdU
happy_var_13 Exp
happy_var_16
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_56 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyReduce_56 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happySpecReduce_1  Int#
13# HappyAbsSyn -> HappyAbsSyn
happyReduction_56
happyReduction_56 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_56 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap27
happyOut27 HappyAbsSyn
happy_x_1 of { (HappyWrap27 Exp
happy_var_1) -> 
	Exp -> HappyAbsSyn
happyIn28
		 (Exp
happy_var_1
	)}

happyNewToken :: Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyNewToken Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk [] =
	Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyDoAction Int#
33# Token
forall a. a
notHappyAtAll Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk []

happyNewToken Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk (Token
tk:[Token]
tks) =
	let cont :: Int# -> Either String HappyAbsSyn
cont Int#
i = Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Either String HappyAbsSyn
happyDoAction Int#
i Token
tk Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk [Token]
tks in
	case Token
tk of {
	PT Posn
_ (TS String
_ Int
1) -> Int# -> Either String HappyAbsSyn
cont Int#
1#;
	PT Posn
_ (TS String
_ Int
2) -> Int# -> Either String HappyAbsSyn
cont Int#
2#;
	PT Posn
_ (TS String
_ Int
3) -> Int# -> Either String HappyAbsSyn
cont Int#
3#;
	PT Posn
_ (TS String
_ Int
4) -> Int# -> Either String HappyAbsSyn
cont Int#
4#;
	PT Posn
_ (TS String
_ Int
5) -> Int# -> Either String HappyAbsSyn
cont Int#
5#;
	PT Posn
_ (TS String
_ Int
6) -> Int# -> Either String HappyAbsSyn
cont Int#
6#;
	PT Posn
_ (TS String
_ Int
7) -> Int# -> Either String HappyAbsSyn
cont Int#
7#;
	PT Posn
_ (TS String
_ Int
8) -> Int# -> Either String HappyAbsSyn
cont Int#
8#;
	PT Posn
_ (TS String
_ Int
9) -> Int# -> Either String HappyAbsSyn
cont Int#
9#;
	PT Posn
_ (TS String
_ Int
10) -> Int# -> Either String HappyAbsSyn
cont Int#
10#;
	PT Posn
_ (TS String
_ Int
11) -> Int# -> Either String HappyAbsSyn
cont Int#
11#;
	PT Posn
_ (TS String
_ Int
12) -> Int# -> Either String HappyAbsSyn
cont Int#
12#;
	PT Posn
_ (TS String
_ Int
13) -> Int# -> Either String HappyAbsSyn
cont Int#
13#;
	PT Posn
_ (TS String
_ Int
14) -> Int# -> Either String HappyAbsSyn
cont Int#
14#;
	PT Posn
_ (TS String
_ Int
15) -> Int# -> Either String HappyAbsSyn
cont Int#
15#;
	PT Posn
_ (TS String
_ Int
16) -> Int# -> Either String HappyAbsSyn
cont Int#
16#;
	PT Posn
_ (TS String
_ Int
17) -> Int# -> Either String HappyAbsSyn
cont Int#
17#;
	PT Posn
_ (TS String
_ Int
18) -> Int# -> Either String HappyAbsSyn
cont Int#
18#;
	PT Posn
_ (TS String
_ Int
19) -> Int# -> Either String HappyAbsSyn
cont Int#
19#;
	PT Posn
_ (TS String
_ Int
20) -> Int# -> Either String HappyAbsSyn
cont Int#
20#;
	PT Posn
_ (TS String
_ Int
21) -> Int# -> Either String HappyAbsSyn
cont Int#
21#;
	PT Posn
_ (TS String
_ Int
22) -> Int# -> Either String HappyAbsSyn
cont Int#
22#;
	PT Posn
_ (TS String
_ Int
23) -> Int# -> Either String HappyAbsSyn
cont Int#
23#;
	PT Posn
_ (TS String
_ Int
24) -> Int# -> Either String HappyAbsSyn
cont Int#
24#;
	PT Posn
_ (TS String
_ Int
25) -> Int# -> Either String HappyAbsSyn
cont Int#
25#;
	PT Posn
_ (TS String
_ Int
26) -> Int# -> Either String HappyAbsSyn
cont Int#
26#;
	PT Posn
_ (TS String
_ Int
27) -> Int# -> Either String HappyAbsSyn
cont Int#
27#;
	PT Posn
_ (TS String
_ Int
28) -> Int# -> Either String HappyAbsSyn
cont Int#
28#;
	PT Posn
_ (TS String
_ Int
29) -> Int# -> Either String HappyAbsSyn
cont Int#
29#;
	PT Posn
_ (TS String
_ Int
30) -> Int# -> Either String HappyAbsSyn
cont Int#
30#;
	PT Posn
_ (TV String
happy_dollar_dollar) -> Int# -> Either String HappyAbsSyn
cont Int#
31#;
	PT Posn
_ (TI String
happy_dollar_dollar) -> Int# -> Either String HappyAbsSyn
cont Int#
32#;
	Token
_ -> ([Token], [String]) -> Either String HappyAbsSyn
forall a. ([Token], [String]) -> Either String a
happyError' ((Token
tkToken -> [Token] -> [Token]
forall a. a -> [a] -> [a]
:[Token]
tks), [])
	}

happyError_ :: [String] -> Int# -> Token -> [Token] -> Either String a
happyError_ [String]
explist Int#
33# Token
tk [Token]
tks = ([Token], [String]) -> Either String a
forall a. ([Token], [String]) -> Either String a
happyError' ([Token]
tks, [String]
explist)
happyError_ [String]
explist Int#
_ Token
tk [Token]
tks = ([Token], [String]) -> Either String a
forall a. ([Token], [String]) -> Either String a
happyError' ((Token
tkToken -> [Token] -> [Token]
forall a. a -> [a] -> [a]
:[Token]
tks), [String]
explist)

happyThen :: () => Either String a -> (a -> Either String b) -> Either String b
happyThen :: forall a b.
Either String a -> (a -> Either String b) -> Either String b
happyThen = (Either String a -> (a -> Either String b) -> Either String b
forall a b.
Either String a -> (a -> Either String b) -> Either String b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
(>>=))
happyReturn :: () => a -> Either String a
happyReturn :: forall a. a -> Either String a
happyReturn = (a -> Either String a
forall a. a -> Either String a
forall (m :: * -> *) a. Monad m => a -> m a
return)
happyThen1 :: m t -> (t -> t -> m b) -> t -> m b
happyThen1 m t
m t -> t -> m b
k t
tks = (forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
(>>=)) m t
m (\t
a -> t -> t -> m b
k t
a t
tks)
happyReturn1 :: () => a -> b -> Either String a
happyReturn1 :: forall a b. a -> b -> Either String a
happyReturn1 = \a
a b
tks -> (forall (m :: * -> *) a. Monad m => a -> m a
return) a
a
happyError' :: () => ([(Token)], [Prelude.String]) -> Either String a
happyError' :: forall a. ([Token], [String]) -> Either String a
happyError' = (\([Token]
tokens, [String]
_) -> [Token] -> Either String a
forall a. [Token] -> Either String a
happyError [Token]
tokens)
pPrg :: [Token] -> Either String Prg
pPrg [Token]
tks = Either String Prg
happySomeParser where
 happySomeParser :: Either String Prg
happySomeParser = Either String HappyAbsSyn
-> (HappyAbsSyn -> Either String Prg) -> Either String Prg
forall a b.
Either String a -> (a -> Either String b) -> Either String b
happyThen (Int# -> [Token] -> Either String HappyAbsSyn
happyParse Int#
0# [Token]
tks) (\HappyAbsSyn
x -> Prg -> Either String Prg
forall a. a -> Either String a
happyReturn (let {(HappyWrap17 Prg
x') = HappyAbsSyn -> HappyWrap17
happyOut17 HappyAbsSyn
x} in Prg
x'))

pDecl :: [Token] -> Either String Decl
pDecl [Token]
tks = Either String Decl
happySomeParser where
 happySomeParser :: Either String Decl
happySomeParser = Either String HappyAbsSyn
-> (HappyAbsSyn -> Either String Decl) -> Either String Decl
forall a b.
Either String a -> (a -> Either String b) -> Either String b
happyThen (Int# -> [Token] -> Either String HappyAbsSyn
happyParse Int#
1# [Token]
tks) (\HappyAbsSyn
x -> Decl -> Either String Decl
forall a. a -> Either String a
happyReturn (let {(HappyWrap18 Decl
x') = HappyAbsSyn -> HappyWrap18
happyOut18 HappyAbsSyn
x} in Decl
x'))

pQualId :: [Token] -> Either String QualId
pQualId [Token]
tks = Either String QualId
happySomeParser where
 happySomeParser :: Either String QualId
happySomeParser = Either String HappyAbsSyn
-> (HappyAbsSyn -> Either String QualId) -> Either String QualId
forall a b.
Either String a -> (a -> Either String b) -> Either String b
happyThen (Int# -> [Token] -> Either String HappyAbsSyn
happyParse Int#
2# [Token]
tks) (\HappyAbsSyn
x -> QualId -> Either String QualId
forall a. a -> Either String a
happyReturn (let {(HappyWrap19 QualId
x') = HappyAbsSyn -> HappyWrap19
happyOut19 HappyAbsSyn
x} in QualId
x'))

pListDecl :: [Token] -> Either String [Decl]
pListDecl [Token]
tks = Either String [Decl]
happySomeParser where
 happySomeParser :: Either String [Decl]
happySomeParser = Either String HappyAbsSyn
-> (HappyAbsSyn -> Either String [Decl]) -> Either String [Decl]
forall a b.
Either String a -> (a -> Either String b) -> Either String b
happyThen (Int# -> [Token] -> Either String HappyAbsSyn
happyParse Int#
3# [Token]
tks) (\HappyAbsSyn
x -> [Decl] -> Either String [Decl]
forall a. a -> Either String a
happyReturn (let {(HappyWrap20 [Decl]
x') = HappyAbsSyn -> HappyWrap20
happyOut20 HappyAbsSyn
x} in [Decl]
x'))

pIdU :: [Token] -> Either String IdU
pIdU [Token]
tks = Either String IdU
happySomeParser where
 happySomeParser :: Either String IdU
happySomeParser = Either String HappyAbsSyn
-> (HappyAbsSyn -> Either String IdU) -> Either String IdU
forall a b.
Either String a -> (a -> Either String b) -> Either String b
happyThen (Int# -> [Token] -> Either String HappyAbsSyn
happyParse Int#
4# [Token]
tks) (\HappyAbsSyn
x -> IdU -> Either String IdU
forall a. a -> Either String a
happyReturn (let {(HappyWrap21 IdU
x') = HappyAbsSyn -> HappyWrap21
happyOut21 HappyAbsSyn
x} in IdU
x'))

pBind :: [Token] -> Either String Bind
pBind [Token]
tks = Either String Bind
happySomeParser where
 happySomeParser :: Either String Bind
happySomeParser = Either String HappyAbsSyn
-> (HappyAbsSyn -> Either String Bind) -> Either String Bind
forall a b.
Either String a -> (a -> Either String b) -> Either String b
happyThen (Int# -> [Token] -> Either String HappyAbsSyn
happyParse Int#
5# [Token]
tks) (\HappyAbsSyn
x -> Bind -> Either String Bind
forall a. a -> Either String a
happyReturn (let {(HappyWrap22 Bind
x') = HappyAbsSyn -> HappyWrap22
happyOut22 HappyAbsSyn
x} in Bind
x'))

pListBind :: [Token] -> Either String [Bind]
pListBind [Token]
tks = Either String [Bind]
happySomeParser where
 happySomeParser :: Either String [Bind]
happySomeParser = Either String HappyAbsSyn
-> (HappyAbsSyn -> Either String [Bind]) -> Either String [Bind]
forall a b.
Either String a -> (a -> Either String b) -> Either String b
happyThen (Int# -> [Token] -> Either String HappyAbsSyn
happyParse Int#
6# [Token]
tks) (\HappyAbsSyn
x -> [Bind] -> Either String [Bind]
forall a. a -> Either String a
happyReturn (let {(HappyWrap23 [Bind]
x') = HappyAbsSyn -> HappyWrap23
happyOut23 HappyAbsSyn
x} in [Bind]
x'))

pListIdent :: [Token] -> Either String [Ident]
pListIdent [Token]
tks = Either String [Ident]
happySomeParser where
 happySomeParser :: Either String [Ident]
happySomeParser = Either String HappyAbsSyn
-> (HappyAbsSyn -> Either String [Ident]) -> Either String [Ident]
forall a b.
Either String a -> (a -> Either String b) -> Either String b
happyThen (Int# -> [Token] -> Either String HappyAbsSyn
happyParse Int#
7# [Token]
tks) (\HappyAbsSyn
x -> [Ident] -> Either String [Ident]
forall a. a -> Either String a
happyReturn (let {(HappyWrap24 [Ident]
x') = HappyAbsSyn -> HappyWrap24
happyOut24 HappyAbsSyn
x} in [Ident]
x'))

pListIdU :: [Token] -> Either String [IdU]
pListIdU [Token]
tks = Either String [IdU]
happySomeParser where
 happySomeParser :: Either String [IdU]
happySomeParser = Either String HappyAbsSyn
-> (HappyAbsSyn -> Either String [IdU]) -> Either String [IdU]
forall a b.
Either String a -> (a -> Either String b) -> Either String b
happyThen (Int# -> [Token] -> Either String HappyAbsSyn
happyParse Int#
8# [Token]
tks) (\HappyAbsSyn
x -> [IdU] -> Either String [IdU]
forall a. a -> Either String a
happyReturn (let {(HappyWrap25 [IdU]
x') = HappyAbsSyn -> HappyWrap25
happyOut25 HappyAbsSyn
x} in [IdU]
x'))

pExp2 :: [Token] -> Either String Exp
pExp2 [Token]
tks = Either String Exp
happySomeParser where
 happySomeParser :: Either String Exp
happySomeParser = Either String HappyAbsSyn
-> (HappyAbsSyn -> Either String Exp) -> Either String Exp
forall a b.
Either String a -> (a -> Either String b) -> Either String b
happyThen (Int# -> [Token] -> Either String HappyAbsSyn
happyParse Int#
9# [Token]
tks) (\HappyAbsSyn
x -> Exp -> Either String Exp
forall a. a -> Either String a
happyReturn (let {(HappyWrap26 Exp
x') = HappyAbsSyn -> HappyWrap26
happyOut26 HappyAbsSyn
x} in Exp
x'))

pExp1 :: [Token] -> Either String Exp
pExp1 [Token]
tks = Either String Exp
happySomeParser where
 happySomeParser :: Either String Exp
happySomeParser = Either String HappyAbsSyn
-> (HappyAbsSyn -> Either String Exp) -> Either String Exp
forall a b.
Either String a -> (a -> Either String b) -> Either String b
happyThen (Int# -> [Token] -> Either String HappyAbsSyn
happyParse Int#
10# [Token]
tks) (\HappyAbsSyn
x -> Exp -> Either String Exp
forall a. a -> Either String a
happyReturn (let {(HappyWrap27 Exp
x') = HappyAbsSyn -> HappyWrap27
happyOut27 HappyAbsSyn
x} in Exp
x'))

pExp :: [Token] -> Either String Exp
pExp [Token]
tks = Either String Exp
happySomeParser where
 happySomeParser :: Either String Exp
happySomeParser = Either String HappyAbsSyn
-> (HappyAbsSyn -> Either String Exp) -> Either String Exp
forall a b.
Either String a -> (a -> Either String b) -> Either String b
happyThen (Int# -> [Token] -> Either String HappyAbsSyn
happyParse Int#
11# [Token]
tks) (\HappyAbsSyn
x -> Exp -> Either String Exp
forall a. a -> Either String a
happyReturn (let {(HappyWrap28 Exp
x') = HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
x} in Exp
x'))

happySeq :: a -> b -> b
happySeq = a -> b -> b
forall a b. a -> b -> b
happyDontSeq


happyError :: [Token] -> Either String a
happyError :: forall a. [Token] -> Either String a
happyError [Token]
ts = String -> Either String a
forall a b. a -> Either a b
Left (String -> Either String a) -> String -> Either String a
forall a b. (a -> b) -> a -> b
$
  String
"syntax error at " String -> String -> String
forall a. [a] -> [a] -> [a]
++ [Token] -> String
tokenPos [Token]
ts String -> String -> String
forall a. [a] -> [a] -> [a]
++
  case [Token]
ts of
    []      -> []
    [Err Posn
_] -> String
" due to lexer error"
    Token
t:[Token]
_     -> String
" before `" String -> String -> String
forall a. [a] -> [a] -> [a]
++ (Token -> String
prToken Token
t) String -> String -> String
forall a. [a] -> [a] -> [a]
++ String
"'"

myLexer :: String -> [Token]
myLexer = String -> [Token]
tokens
{-# LINE 1 "templates/GenericTemplate.hs" #-}
-- $Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp $













-- 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)) :: Prelude.Bool)
#define GTE(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.>=# m)) :: Prelude.Bool)
#define EQ(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.==# m)) :: Prelude.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



















data Happy_IntList = HappyCons Happy_GHC_Exts.Int# Happy_IntList








































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 ERROR_TOK, 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 (happyExpListPerState ((Happy_GHC_Exts.I# (st)) :: Prelude.Int)) 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    = happyAdjustOffset (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 Prelude.False
         action
          | check     = indexShortOffAddr happyTable off_i
          | Prelude.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#




{-# INLINE happyLt #-}
happyLt x y = LT(x,y)


readArrayBit arr bit =
    Bits.testBit (Happy_GHC_Exts.I# (indexShortOffAddr arr ((unbox_int bit) `Happy_GHC_Exts.iShiftRA#` 4#))) (bit `Prelude.mod` 16)
  where unbox_int (Happy_GHC_Exts.I# x) = x






data HappyAddr = HappyA# Happy_GHC_Exts.Addr#


-----------------------------------------------------------------------------
-- HappyState data type (not arrays)













-----------------------------------------------------------------------------
-- 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 = happyAdjustOffset (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 = happyAdjustOffset (indexShortOffAddr happyGotoOffsets st)
         off_i = (off Happy_GHC_Exts.+# nt)
         new_state = indexShortOffAddr happyTable off_i




-----------------------------------------------------------------------------
-- Error recovery (ERROR_TOK is the error token)

-- parse error if we are in recovery and we fail again
happyFail explist 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_ explist 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  ERROR_TOK tk old_st CONS(HAPPYSTATE(action),sts) 
                                                (saved_tok `HappyStk` _ `HappyStk` stk) =
--      trace ("discarding state, depth " ++ show (length stk))  $
        DO_ACTION(action,ERROR_TOK,tk,sts,(saved_tok`HappyStk`stk))
-}

-- Enter error recovery: generate an error token,
--                       save the old token and carry on.
happyFail explist 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 = Prelude.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 `Prelude.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.