{-# OPTIONS_GHC -w #-}
{-# OPTIONS -XMagicHash -XBangPatterns -XTypeSynonymInstances -XFlexibleInstances -cpp #-}
#if __GLASGOW_HASKELL__ >= 710
{-# OPTIONS_GHC -XPartialTypeSignatures #-}
#endif
{-# OPTIONS -fno-warn-overlapping-patterns #-}
module GF.Grammar.Parser
         ( P, runP, runPartial
         , pModDef
         , pModHeader
         , pTerm
         , pExp
         , pTopDef
         , pBNFCRules
         , pEBNFRules
         ) where

import GF.Infra.Ident
import GF.Infra.Option
import GF.Data.Operations
import GF.Grammar.Predef
import GF.Grammar.Grammar
import GF.Grammar.BNFC
import GF.Grammar.EBNF
import GF.Grammar.Macros
import GF.Grammar.Lexer
import GF.Compile.Update (buildAnyTree)
import Data.List(intersperse)
import Data.Char(isAlphaNum)
import qualified Data.Map as Map
import PGF(mkCId)
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.19.9

newtype HappyAbsSyn  = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
happyIn10 :: (SourceModule) -> (HappyAbsSyn )
happyIn10 :: SourceModule -> HappyAbsSyn
happyIn10 SourceModule
x = SourceModule -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# SourceModule
x
{-# INLINE happyIn10 #-}
happyOut10 :: (HappyAbsSyn ) -> (SourceModule)
happyOut10 :: HappyAbsSyn -> SourceModule
happyOut10 HappyAbsSyn
x = HappyAbsSyn -> SourceModule
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut10 #-}
happyIn11 :: (SourceModule) -> (HappyAbsSyn )
happyIn11 :: SourceModule -> HappyAbsSyn
happyIn11 SourceModule
x = SourceModule -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# SourceModule
x
{-# INLINE happyIn11 #-}
happyOut11 :: (HappyAbsSyn ) -> (SourceModule)
happyOut11 :: HappyAbsSyn -> SourceModule
happyOut11 HappyAbsSyn
x = HappyAbsSyn -> SourceModule
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut11 #-}
happyIn12 :: (ModuleStatus) -> (HappyAbsSyn )
happyIn12 :: ModuleStatus -> HappyAbsSyn
happyIn12 ModuleStatus
x = ModuleStatus -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ModuleStatus
x
{-# INLINE happyIn12 #-}
happyOut12 :: (HappyAbsSyn ) -> (ModuleStatus)
happyOut12 :: HappyAbsSyn -> ModuleStatus
happyOut12 HappyAbsSyn
x = HappyAbsSyn -> ModuleStatus
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut12 #-}
happyIn13 :: ((ModuleType,ModuleName)) -> (HappyAbsSyn )
happyIn13 :: (ModuleType, ModuleName) -> HappyAbsSyn
happyIn13 (ModuleType, ModuleName)
x = (ModuleType, ModuleName) -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (ModuleType, ModuleName)
x
{-# INLINE happyIn13 #-}
happyOut13 :: (HappyAbsSyn ) -> ((ModuleType,ModuleName))
happyOut13 :: HappyAbsSyn -> (ModuleType, ModuleName)
happyOut13 HappyAbsSyn
x = HappyAbsSyn -> (ModuleType, ModuleName)
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut13 #-}
happyIn14 :: (( [(ModuleName,MInclude)]
                   , Maybe (ModuleName,MInclude,[(ModuleName,ModuleName)])
                   , [OpenSpec]
                   )) -> (HappyAbsSyn )
happyIn14 :: ([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 [OpenSpec])
-> HappyAbsSyn
happyIn14 ([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 [OpenSpec])
x = ([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 [OpenSpec])
-> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 [OpenSpec])
x
{-# INLINE happyIn14 #-}
happyOut14 :: (HappyAbsSyn ) -> (( [(ModuleName,MInclude)]
                   , Maybe (ModuleName,MInclude,[(ModuleName,ModuleName)])
                   , [OpenSpec]
                   ))
happyOut14 :: HappyAbsSyn
-> ([(ModuleName, MInclude)],
    Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
    [OpenSpec])
happyOut14 HappyAbsSyn
x = HappyAbsSyn
-> ([(ModuleName, MInclude)],
    Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
    [OpenSpec])
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut14 #-}
happyIn15 :: ([OpenSpec]) -> (HappyAbsSyn )
happyIn15 :: [OpenSpec] -> HappyAbsSyn
happyIn15 [OpenSpec]
x = [OpenSpec] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [OpenSpec]
x
{-# INLINE happyIn15 #-}
happyOut15 :: (HappyAbsSyn ) -> ([OpenSpec])
happyOut15 :: HappyAbsSyn -> [OpenSpec]
happyOut15 HappyAbsSyn
x = HappyAbsSyn -> [OpenSpec]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut15 #-}
happyIn16 :: (( [(ModuleName,MInclude)]
             , Maybe (ModuleName,MInclude,[(ModuleName,ModuleName)])
             , Maybe ([OpenSpec],[(Ident,Info)],Options)
             )) -> (HappyAbsSyn )
happyIn16 :: ([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 Maybe ([OpenSpec], [(Ident, Info)], Options))
-> HappyAbsSyn
happyIn16 ([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 Maybe ([OpenSpec], [(Ident, Info)], Options))
x = ([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 Maybe ([OpenSpec], [(Ident, Info)], Options))
-> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 Maybe ([OpenSpec], [(Ident, Info)], Options))
x
{-# INLINE happyIn16 #-}
happyOut16 :: (HappyAbsSyn ) -> (( [(ModuleName,MInclude)]
             , Maybe (ModuleName,MInclude,[(ModuleName,ModuleName)])
             , Maybe ([OpenSpec],[(Ident,Info)],Options)
             ))
happyOut16 :: HappyAbsSyn
-> ([(ModuleName, MInclude)],
    Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
    Maybe ([OpenSpec], [(Ident, Info)], Options))
happyOut16 HappyAbsSyn
x = HappyAbsSyn
-> ([(ModuleName, MInclude)],
    Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
    Maybe ([OpenSpec], [(Ident, Info)], Options))
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut16 #-}
happyIn17 :: (([OpenSpec],[(Ident,Info)],Options)) -> (HappyAbsSyn )
happyIn17 :: ([OpenSpec], [(Ident, Info)], Options) -> HappyAbsSyn
happyIn17 ([OpenSpec], [(Ident, Info)], Options)
x = ([OpenSpec], [(Ident, Info)], Options) -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ([OpenSpec], [(Ident, Info)], Options)
x
{-# INLINE happyIn17 #-}
happyOut17 :: (HappyAbsSyn ) -> (([OpenSpec],[(Ident,Info)],Options))
happyOut17 :: HappyAbsSyn -> ([OpenSpec], [(Ident, Info)], Options)
happyOut17 HappyAbsSyn
x = HappyAbsSyn -> ([OpenSpec], [(Ident, Info)], Options)
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut17 #-}
happyIn18 :: ([Either [(Ident,Info)] Options]) -> (HappyAbsSyn )
happyIn18 :: [Either [(Ident, Info)] Options] -> HappyAbsSyn
happyIn18 [Either [(Ident, Info)] Options]
x = [Either [(Ident, Info)] Options] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [Either [(Ident, Info)] Options]
x
{-# INLINE happyIn18 #-}
happyOut18 :: (HappyAbsSyn ) -> ([Either [(Ident,Info)] Options])
happyOut18 :: HappyAbsSyn -> [Either [(Ident, Info)] Options]
happyOut18 HappyAbsSyn
x = HappyAbsSyn -> [Either [(Ident, Info)] Options]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut18 #-}
happyIn19 :: ([OpenSpec]) -> (HappyAbsSyn )
happyIn19 :: [OpenSpec] -> HappyAbsSyn
happyIn19 [OpenSpec]
x = [OpenSpec] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [OpenSpec]
x
{-# INLINE happyIn19 #-}
happyOut19 :: (HappyAbsSyn ) -> ([OpenSpec])
happyOut19 :: HappyAbsSyn -> [OpenSpec]
happyOut19 HappyAbsSyn
x = HappyAbsSyn -> [OpenSpec]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut19 #-}
happyIn20 :: (OpenSpec) -> (HappyAbsSyn )
happyIn20 :: OpenSpec -> HappyAbsSyn
happyIn20 OpenSpec
x = OpenSpec -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# OpenSpec
x
{-# INLINE happyIn20 #-}
happyOut20 :: (HappyAbsSyn ) -> (OpenSpec)
happyOut20 :: HappyAbsSyn -> OpenSpec
happyOut20 HappyAbsSyn
x = HappyAbsSyn -> OpenSpec
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut20 #-}
happyIn21 :: ([(ModuleName,ModuleName)]) -> (HappyAbsSyn )
happyIn21 :: [(ModuleName, ModuleName)] -> HappyAbsSyn
happyIn21 [(ModuleName, ModuleName)]
x = [(ModuleName, ModuleName)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(ModuleName, ModuleName)]
x
{-# INLINE happyIn21 #-}
happyOut21 :: (HappyAbsSyn ) -> ([(ModuleName,ModuleName)])
happyOut21 :: HappyAbsSyn -> [(ModuleName, ModuleName)]
happyOut21 HappyAbsSyn
x = HappyAbsSyn -> [(ModuleName, ModuleName)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut21 #-}
happyIn22 :: ((ModuleName,ModuleName)) -> (HappyAbsSyn )
happyIn22 :: (ModuleName, ModuleName) -> HappyAbsSyn
happyIn22 (ModuleName, ModuleName)
x = (ModuleName, ModuleName) -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (ModuleName, ModuleName)
x
{-# INLINE happyIn22 #-}
happyOut22 :: (HappyAbsSyn ) -> ((ModuleName,ModuleName))
happyOut22 :: HappyAbsSyn -> (ModuleName, ModuleName)
happyOut22 HappyAbsSyn
x = HappyAbsSyn -> (ModuleName, ModuleName)
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut22 #-}
happyIn23 :: ([(ModuleName,MInclude)]) -> (HappyAbsSyn )
happyIn23 :: [(ModuleName, MInclude)] -> HappyAbsSyn
happyIn23 [(ModuleName, MInclude)]
x = [(ModuleName, MInclude)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(ModuleName, MInclude)]
x
{-# INLINE happyIn23 #-}
happyOut23 :: (HappyAbsSyn ) -> ([(ModuleName,MInclude)])
happyOut23 :: HappyAbsSyn -> [(ModuleName, MInclude)]
happyOut23 HappyAbsSyn
x = HappyAbsSyn -> [(ModuleName, MInclude)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut23 #-}
happyIn24 :: ((ModuleName,MInclude)) -> (HappyAbsSyn )
happyIn24 :: (ModuleName, MInclude) -> HappyAbsSyn
happyIn24 (ModuleName, MInclude)
x = (ModuleName, MInclude) -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (ModuleName, MInclude)
x
{-# INLINE happyIn24 #-}
happyOut24 :: (HappyAbsSyn ) -> ((ModuleName,MInclude))
happyOut24 :: HappyAbsSyn -> (ModuleName, MInclude)
happyOut24 HappyAbsSyn
x = HappyAbsSyn -> (ModuleName, MInclude)
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut24 #-}
happyIn25 :: (Either [(Ident,Info)] Options) -> (HappyAbsSyn )
happyIn25 :: Either [(Ident, Info)] Options -> HappyAbsSyn
happyIn25 Either [(Ident, Info)] Options
x = Either [(Ident, Info)] Options -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Either [(Ident, Info)] Options
x
{-# INLINE happyIn25 #-}
happyOut25 :: (HappyAbsSyn ) -> (Either [(Ident,Info)] Options)
happyOut25 :: HappyAbsSyn -> Either [(Ident, Info)] Options
happyOut25 HappyAbsSyn
x = HappyAbsSyn -> Either [(Ident, Info)] Options
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut25 #-}
happyIn26 :: ([(Ident,Info)]) -> (HappyAbsSyn )
happyIn26 :: [(Ident, Info)] -> HappyAbsSyn
happyIn26 [(Ident, Info)]
x = [(Ident, Info)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, Info)]
x
{-# INLINE happyIn26 #-}
happyOut26 :: (HappyAbsSyn ) -> ([(Ident,Info)])
happyOut26 :: HappyAbsSyn -> [(Ident, Info)]
happyOut26 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, Info)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut26 #-}
happyIn27 :: ([(Ident,Info)]) -> (HappyAbsSyn )
happyIn27 :: [(Ident, Info)] -> HappyAbsSyn
happyIn27 [(Ident, Info)]
x = [(Ident, Info)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, Info)]
x
{-# INLINE happyIn27 #-}
happyOut27 :: (HappyAbsSyn ) -> ([(Ident,Info)])
happyOut27 :: HappyAbsSyn -> [(Ident, Info)]
happyOut27 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, Info)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut27 #-}
happyIn28 :: ([(Ident,Info)]) -> (HappyAbsSyn )
happyIn28 :: [(Ident, Info)] -> HappyAbsSyn
happyIn28 [(Ident, Info)]
x = [(Ident, Info)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, Info)]
x
{-# INLINE happyIn28 #-}
happyOut28 :: (HappyAbsSyn ) -> ([(Ident,Info)])
happyOut28 :: HappyAbsSyn -> [(Ident, Info)]
happyOut28 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, Info)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut28 #-}
happyIn29 :: ([(Ident,Info)]) -> (HappyAbsSyn )
happyIn29 :: [(Ident, Info)] -> HappyAbsSyn
happyIn29 [(Ident, Info)]
x = [(Ident, Info)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, Info)]
x
{-# INLINE happyIn29 #-}
happyOut29 :: (HappyAbsSyn ) -> ([(Ident,Info)])
happyOut29 :: HappyAbsSyn -> [(Ident, Info)]
happyOut29 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, Info)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut29 #-}
happyIn30 :: ([(Ident,Info)]) -> (HappyAbsSyn )
happyIn30 :: [(Ident, Info)] -> HappyAbsSyn
happyIn30 [(Ident, Info)]
x = [(Ident, Info)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, Info)]
x
{-# INLINE happyIn30 #-}
happyOut30 :: (HappyAbsSyn ) -> ([(Ident,Info)])
happyOut30 :: HappyAbsSyn -> [(Ident, Info)]
happyOut30 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, Info)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut30 #-}
happyIn31 :: ([(Ident,Info)]) -> (HappyAbsSyn )
happyIn31 :: [(Ident, Info)] -> HappyAbsSyn
happyIn31 [(Ident, Info)]
x = [(Ident, Info)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, Info)]
x
{-# INLINE happyIn31 #-}
happyOut31 :: (HappyAbsSyn ) -> ([(Ident,Info)])
happyOut31 :: HappyAbsSyn -> [(Ident, Info)]
happyOut31 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, Info)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut31 #-}
happyIn32 :: ([(Ident,Info)]) -> (HappyAbsSyn )
happyIn32 :: [(Ident, Info)] -> HappyAbsSyn
happyIn32 [(Ident, Info)]
x = [(Ident, Info)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, Info)]
x
{-# INLINE happyIn32 #-}
happyOut32 :: (HappyAbsSyn ) -> ([(Ident,Info)])
happyOut32 :: HappyAbsSyn -> [(Ident, Info)]
happyOut32 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, Info)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut32 #-}
happyIn33 :: ([(Ident,L Term)]) -> (HappyAbsSyn )
happyIn33 :: [(Ident, L Term)] -> HappyAbsSyn
happyIn33 [(Ident, L Term)]
x = [(Ident, L Term)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, L Term)]
x
{-# INLINE happyIn33 #-}
happyOut33 :: (HappyAbsSyn ) -> ([(Ident,L Term)])
happyOut33 :: HappyAbsSyn -> [(Ident, L Term)]
happyOut33 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, L Term)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut33 #-}
happyIn34 :: (Options) -> (HappyAbsSyn )
happyIn34 :: Options -> HappyAbsSyn
happyIn34 Options
x = Options -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Options
x
{-# INLINE happyIn34 #-}
happyOut34 :: (HappyAbsSyn ) -> (Options)
happyOut34 :: HappyAbsSyn -> Options
happyOut34 HappyAbsSyn
x = HappyAbsSyn -> Options
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut34 #-}
happyIn35 :: ([Ident]) -> (HappyAbsSyn )
happyIn35 :: [Ident] -> HappyAbsSyn
happyIn35 [Ident]
x = [Ident] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [Ident]
x
{-# INLINE happyIn35 #-}
happyOut35 :: (HappyAbsSyn ) -> ([Ident])
happyOut35 :: HappyAbsSyn -> [Ident]
happyOut35 HappyAbsSyn
x = HappyAbsSyn -> [Ident]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut35 #-}
happyIn36 :: (L Param) -> (HappyAbsSyn )
happyIn36 :: L Param -> HappyAbsSyn
happyIn36 L Param
x = L Param -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# L Param
x
{-# INLINE happyIn36 #-}
happyOut36 :: (HappyAbsSyn ) -> (L Param)
happyOut36 :: HappyAbsSyn -> L Param
happyOut36 HappyAbsSyn
x = HappyAbsSyn -> L Param
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut36 #-}
happyIn37 :: ([(Ident,Info)]) -> (HappyAbsSyn )
happyIn37 :: [(Ident, Info)] -> HappyAbsSyn
happyIn37 [(Ident, Info)]
x = [(Ident, Info)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, Info)]
x
{-# INLINE happyIn37 #-}
happyOut37 :: (HappyAbsSyn ) -> ([(Ident,Info)])
happyOut37 :: HappyAbsSyn -> [(Ident, Info)]
happyOut37 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, Info)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut37 #-}
happyIn38 :: ([(Ident,Info)]) -> (HappyAbsSyn )
happyIn38 :: [(Ident, Info)] -> HappyAbsSyn
happyIn38 [(Ident, Info)]
x = [(Ident, Info)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, Info)]
x
{-# INLINE happyIn38 #-}
happyOut38 :: (HappyAbsSyn ) -> ([(Ident,Info)])
happyOut38 :: HappyAbsSyn -> [(Ident, Info)]
happyOut38 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, Info)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut38 #-}
happyIn39 :: ([(Ident,Info)]) -> (HappyAbsSyn )
happyIn39 :: [(Ident, Info)] -> HappyAbsSyn
happyIn39 [(Ident, Info)]
x = [(Ident, Info)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, Info)]
x
{-# INLINE happyIn39 #-}
happyOut39 :: (HappyAbsSyn ) -> ([(Ident,Info)])
happyOut39 :: HappyAbsSyn -> [(Ident, Info)]
happyOut39 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, Info)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut39 #-}
happyIn40 :: ([(Ident,Info)]) -> (HappyAbsSyn )
happyIn40 :: [(Ident, Info)] -> HappyAbsSyn
happyIn40 [(Ident, Info)]
x = [(Ident, Info)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, Info)]
x
{-# INLINE happyIn40 #-}
happyOut40 :: (HappyAbsSyn ) -> ([(Ident,Info)])
happyOut40 :: HappyAbsSyn -> [(Ident, Info)]
happyOut40 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, Info)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut40 #-}
happyIn41 :: ([(Ident,Info)]) -> (HappyAbsSyn )
happyIn41 :: [(Ident, Info)] -> HappyAbsSyn
happyIn41 [(Ident, Info)]
x = [(Ident, Info)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, Info)]
x
{-# INLINE happyIn41 #-}
happyOut41 :: (HappyAbsSyn ) -> ([(Ident,Info)])
happyOut41 :: HappyAbsSyn -> [(Ident, Info)]
happyOut41 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, Info)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut41 #-}
happyIn42 :: ([(Ident,Info)]) -> (HappyAbsSyn )
happyIn42 :: [(Ident, Info)] -> HappyAbsSyn
happyIn42 [(Ident, Info)]
x = [(Ident, Info)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, Info)]
x
{-# INLINE happyIn42 #-}
happyOut42 :: (HappyAbsSyn ) -> ([(Ident,Info)])
happyOut42 :: HappyAbsSyn -> [(Ident, Info)]
happyOut42 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, Info)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut42 #-}
happyIn43 :: ([(Ident,Info)]) -> (HappyAbsSyn )
happyIn43 :: [(Ident, Info)] -> HappyAbsSyn
happyIn43 [(Ident, Info)]
x = [(Ident, Info)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, Info)]
x
{-# INLINE happyIn43 #-}
happyOut43 :: (HappyAbsSyn ) -> ([(Ident,Info)])
happyOut43 :: HappyAbsSyn -> [(Ident, Info)]
happyOut43 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, Info)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut43 #-}
happyIn44 :: ([(Ident,L Term)]) -> (HappyAbsSyn )
happyIn44 :: [(Ident, L Term)] -> HappyAbsSyn
happyIn44 [(Ident, L Term)]
x = [(Ident, L Term)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, L Term)]
x
{-# INLINE happyIn44 #-}
happyOut44 :: (HappyAbsSyn ) -> ([(Ident,L Term)])
happyOut44 :: HappyAbsSyn -> [(Ident, L Term)]
happyOut44 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, L Term)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut44 #-}
happyIn45 :: (Options) -> (HappyAbsSyn )
happyIn45 :: Options -> HappyAbsSyn
happyIn45 Options
x = Options -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Options
x
{-# INLINE happyIn45 #-}
happyOut45 :: (HappyAbsSyn ) -> (Options)
happyOut45 :: HappyAbsSyn -> Options
happyOut45 HappyAbsSyn
x = HappyAbsSyn -> Options
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut45 #-}
happyIn46 :: ([L Param]) -> (HappyAbsSyn )
happyIn46 :: [L Param] -> HappyAbsSyn
happyIn46 [L Param]
x = [L Param] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [L Param]
x
{-# INLINE happyIn46 #-}
happyOut46 :: (HappyAbsSyn ) -> ([L Param])
happyOut46 :: HappyAbsSyn -> [L Param]
happyOut46 HappyAbsSyn
x = HappyAbsSyn -> [L Param]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut46 #-}
happyIn47 :: ([Ident]) -> (HappyAbsSyn )
happyIn47 :: [Ident] -> HappyAbsSyn
happyIn47 [Ident]
x = [Ident] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [Ident]
x
{-# INLINE happyIn47 #-}
happyOut47 :: (HappyAbsSyn ) -> ([Ident])
happyOut47 :: HappyAbsSyn -> [Ident]
happyOut47 HappyAbsSyn
x = HappyAbsSyn -> [Ident]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut47 #-}
happyIn48 :: ([Ident]) -> (HappyAbsSyn )
happyIn48 :: [Ident] -> HappyAbsSyn
happyIn48 [Ident]
x = [Ident] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [Ident]
x
{-# INLINE happyIn48 #-}
happyOut48 :: (HappyAbsSyn ) -> ([Ident])
happyOut48 :: HappyAbsSyn -> [Ident]
happyOut48 HappyAbsSyn
x = HappyAbsSyn -> [Ident]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut48 #-}
happyIn49 :: (Ident) -> (HappyAbsSyn )
happyIn49 :: Ident -> HappyAbsSyn
happyIn49 Ident
x = Ident -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Ident
x
{-# INLINE happyIn49 #-}
happyOut49 :: (HappyAbsSyn ) -> (Ident)
happyOut49 :: HappyAbsSyn -> Ident
happyOut49 HappyAbsSyn
x = HappyAbsSyn -> Ident
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut49 #-}
happyIn50 :: (Ident) -> (HappyAbsSyn )
happyIn50 :: Ident -> HappyAbsSyn
happyIn50 Ident
x = Ident -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Ident
x
{-# INLINE happyIn50 #-}
happyOut50 :: (HappyAbsSyn ) -> (Ident)
happyOut50 :: HappyAbsSyn -> Ident
happyOut50 HappyAbsSyn
x = HappyAbsSyn -> Ident
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut50 #-}
happyIn51 :: ([Ident]) -> (HappyAbsSyn )
happyIn51 :: [Ident] -> HappyAbsSyn
happyIn51 [Ident]
x = [Ident] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [Ident]
x
{-# INLINE happyIn51 #-}
happyOut51 :: (HappyAbsSyn ) -> ([Ident])
happyOut51 :: HappyAbsSyn -> [Ident]
happyOut51 HappyAbsSyn
x = HappyAbsSyn -> [Ident]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut51 #-}
happyIn52 :: ([(Ident, Maybe Type, Maybe Term)]) -> (HappyAbsSyn )
happyIn52 :: [(Ident, Maybe Term, Maybe Term)] -> HappyAbsSyn
happyIn52 [(Ident, Maybe Term, Maybe Term)]
x = [(Ident, Maybe Term, Maybe Term)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, Maybe Term, Maybe Term)]
x
{-# INLINE happyIn52 #-}
happyOut52 :: (HappyAbsSyn ) -> ([(Ident, Maybe Type, Maybe Term)])
happyOut52 :: HappyAbsSyn -> [(Ident, Maybe Term, Maybe Term)]
happyOut52 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, Maybe Term, Maybe Term)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut52 #-}
happyIn53 :: ([(Ident, Maybe Type, Maybe Term)]) -> (HappyAbsSyn )
happyIn53 :: [(Ident, Maybe Term, Maybe Term)] -> HappyAbsSyn
happyIn53 [(Ident, Maybe Term, Maybe Term)]
x = [(Ident, Maybe Term, Maybe Term)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Ident, Maybe Term, Maybe Term)]
x
{-# INLINE happyIn53 #-}
happyOut53 :: (HappyAbsSyn ) -> ([(Ident, Maybe Type, Maybe Term)])
happyOut53 :: HappyAbsSyn -> [(Ident, Maybe Term, Maybe Term)]
happyOut53 HappyAbsSyn
x = HappyAbsSyn -> [(Ident, Maybe Term, Maybe Term)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut53 #-}
happyIn54 :: (Term) -> (HappyAbsSyn )
happyIn54 :: Term -> HappyAbsSyn
happyIn54 Term
x = Term -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Term
x
{-# INLINE happyIn54 #-}
happyOut54 :: (HappyAbsSyn ) -> (Term)
happyOut54 :: HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
x = HappyAbsSyn -> Term
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut54 #-}
happyIn55 :: (Term) -> (HappyAbsSyn )
happyIn55 :: Term -> HappyAbsSyn
happyIn55 Term
x = Term -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Term
x
{-# INLINE happyIn55 #-}
happyOut55 :: (HappyAbsSyn ) -> (Term)
happyOut55 :: HappyAbsSyn -> Term
happyOut55 HappyAbsSyn
x = HappyAbsSyn -> Term
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut55 #-}
happyIn56 :: (Term) -> (HappyAbsSyn )
happyIn56 :: Term -> HappyAbsSyn
happyIn56 Term
x = Term -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Term
x
{-# INLINE happyIn56 #-}
happyOut56 :: (HappyAbsSyn ) -> (Term)
happyOut56 :: HappyAbsSyn -> Term
happyOut56 HappyAbsSyn
x = HappyAbsSyn -> Term
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut56 #-}
happyIn57 :: (Term) -> (HappyAbsSyn )
happyIn57 :: Term -> HappyAbsSyn
happyIn57 Term
x = Term -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Term
x
{-# INLINE happyIn57 #-}
happyOut57 :: (HappyAbsSyn ) -> (Term)
happyOut57 :: HappyAbsSyn -> Term
happyOut57 HappyAbsSyn
x = HappyAbsSyn -> Term
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut57 #-}
happyIn58 :: (Term) -> (HappyAbsSyn )
happyIn58 :: Term -> HappyAbsSyn
happyIn58 Term
x = Term -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Term
x
{-# INLINE happyIn58 #-}
happyOut58 :: (HappyAbsSyn ) -> (Term)
happyOut58 :: HappyAbsSyn -> Term
happyOut58 HappyAbsSyn
x = HappyAbsSyn -> Term
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut58 #-}
happyIn59 :: (Term) -> (HappyAbsSyn )
happyIn59 :: Term -> HappyAbsSyn
happyIn59 Term
x = Term -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Term
x
{-# INLINE happyIn59 #-}
happyOut59 :: (HappyAbsSyn ) -> (Term)
happyOut59 :: HappyAbsSyn -> Term
happyOut59 HappyAbsSyn
x = HappyAbsSyn -> Term
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut59 #-}
happyIn60 :: (Term) -> (HappyAbsSyn )
happyIn60 :: Term -> HappyAbsSyn
happyIn60 Term
x = Term -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Term
x
{-# INLINE happyIn60 #-}
happyOut60 :: (HappyAbsSyn ) -> (Term)
happyOut60 :: HappyAbsSyn -> Term
happyOut60 HappyAbsSyn
x = HappyAbsSyn -> Term
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut60 #-}
happyIn61 :: ([Term]) -> (HappyAbsSyn )
happyIn61 :: [Term] -> HappyAbsSyn
happyIn61 [Term]
x = [Term] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [Term]
x
{-# INLINE happyIn61 #-}
happyOut61 :: (HappyAbsSyn ) -> ([Term])
happyOut61 :: HappyAbsSyn -> [Term]
happyOut61 HappyAbsSyn
x = HappyAbsSyn -> [Term]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut61 #-}
happyIn62 :: ([Term]) -> (HappyAbsSyn )
happyIn62 :: [Term] -> HappyAbsSyn
happyIn62 [Term]
x = [Term] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [Term]
x
{-# INLINE happyIn62 #-}
happyOut62 :: (HappyAbsSyn ) -> ([Term])
happyOut62 :: HappyAbsSyn -> [Term]
happyOut62 HappyAbsSyn
x = HappyAbsSyn -> [Term]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut62 #-}
happyIn63 :: (Patt) -> (HappyAbsSyn )
happyIn63 :: Patt -> HappyAbsSyn
happyIn63 Patt
x = Patt -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Patt
x
{-# INLINE happyIn63 #-}
happyOut63 :: (HappyAbsSyn ) -> (Patt)
happyOut63 :: HappyAbsSyn -> Patt
happyOut63 HappyAbsSyn
x = HappyAbsSyn -> Patt
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut63 #-}
happyIn64 :: (Patt) -> (HappyAbsSyn )
happyIn64 :: Patt -> HappyAbsSyn
happyIn64 Patt
x = Patt -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Patt
x
{-# INLINE happyIn64 #-}
happyOut64 :: (HappyAbsSyn ) -> (Patt)
happyOut64 :: HappyAbsSyn -> Patt
happyOut64 HappyAbsSyn
x = HappyAbsSyn -> Patt
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut64 #-}
happyIn65 :: (Patt) -> (HappyAbsSyn )
happyIn65 :: Patt -> HappyAbsSyn
happyIn65 Patt
x = Patt -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Patt
x
{-# INLINE happyIn65 #-}
happyOut65 :: (HappyAbsSyn ) -> (Patt)
happyOut65 :: HappyAbsSyn -> Patt
happyOut65 HappyAbsSyn
x = HappyAbsSyn -> Patt
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut65 #-}
happyIn66 :: (Patt) -> (HappyAbsSyn )
happyIn66 :: Patt -> HappyAbsSyn
happyIn66 Patt
x = Patt -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Patt
x
{-# INLINE happyIn66 #-}
happyOut66 :: (HappyAbsSyn ) -> (Patt)
happyOut66 :: HappyAbsSyn -> Patt
happyOut66 HappyAbsSyn
x = HappyAbsSyn -> Patt
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut66 #-}
happyIn67 :: ([(Label,Patt)]) -> (HappyAbsSyn )
happyIn67 :: [(Label, Patt)] -> HappyAbsSyn
happyIn67 [(Label, Patt)]
x = [(Label, Patt)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Label, Patt)]
x
{-# INLINE happyIn67 #-}
happyOut67 :: (HappyAbsSyn ) -> ([(Label,Patt)])
happyOut67 :: HappyAbsSyn -> [(Label, Patt)]
happyOut67 HappyAbsSyn
x = HappyAbsSyn -> [(Label, Patt)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut67 #-}
happyIn68 :: (Label) -> (HappyAbsSyn )
happyIn68 :: Label -> HappyAbsSyn
happyIn68 Label
x = Label -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Label
x
{-# INLINE happyIn68 #-}
happyOut68 :: (HappyAbsSyn ) -> (Label)
happyOut68 :: HappyAbsSyn -> Label
happyOut68 HappyAbsSyn
x = HappyAbsSyn -> Label
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut68 #-}
happyIn69 :: (Ident) -> (HappyAbsSyn )
happyIn69 :: Ident -> HappyAbsSyn
happyIn69 Ident
x = Ident -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Ident
x
{-# INLINE happyIn69 #-}
happyOut69 :: (HappyAbsSyn ) -> (Ident)
happyOut69 :: HappyAbsSyn -> Ident
happyOut69 HappyAbsSyn
x = HappyAbsSyn -> Ident
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut69 #-}
happyIn70 :: ([(Label,Patt)]) -> (HappyAbsSyn )
happyIn70 :: [(Label, Patt)] -> HappyAbsSyn
happyIn70 [(Label, Patt)]
x = [(Label, Patt)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Label, Patt)]
x
{-# INLINE happyIn70 #-}
happyOut70 :: (HappyAbsSyn ) -> ([(Label,Patt)])
happyOut70 :: HappyAbsSyn -> [(Label, Patt)]
happyOut70 HappyAbsSyn
x = HappyAbsSyn -> [(Label, Patt)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut70 #-}
happyIn71 :: ([Patt]) -> (HappyAbsSyn )
happyIn71 :: [Patt] -> HappyAbsSyn
happyIn71 [Patt]
x = [Patt] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [Patt]
x
{-# INLINE happyIn71 #-}
happyOut71 :: (HappyAbsSyn ) -> ([Patt])
happyOut71 :: HappyAbsSyn -> [Patt]
happyOut71 HappyAbsSyn
x = HappyAbsSyn -> [Patt]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut71 #-}
happyIn72 :: (Patt) -> (HappyAbsSyn )
happyIn72 :: Patt -> HappyAbsSyn
happyIn72 Patt
x = Patt -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Patt
x
{-# INLINE happyIn72 #-}
happyOut72 :: (HappyAbsSyn ) -> (Patt)
happyOut72 :: HappyAbsSyn -> Patt
happyOut72 HappyAbsSyn
x = HappyAbsSyn -> Patt
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut72 #-}
happyIn73 :: ([(BindType,Ident)]) -> (HappyAbsSyn )
happyIn73 :: [(BindType, Ident)] -> HappyAbsSyn
happyIn73 [(BindType, Ident)]
x = [(BindType, Ident)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(BindType, Ident)]
x
{-# INLINE happyIn73 #-}
happyOut73 :: (HappyAbsSyn ) -> ([(BindType,Ident)])
happyOut73 :: HappyAbsSyn -> [(BindType, Ident)]
happyOut73 HappyAbsSyn
x = HappyAbsSyn -> [(BindType, Ident)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut73 #-}
happyIn74 :: ([(BindType,Ident)]) -> (HappyAbsSyn )
happyIn74 :: [(BindType, Ident)] -> HappyAbsSyn
happyIn74 [(BindType, Ident)]
x = [(BindType, Ident)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(BindType, Ident)]
x
{-# INLINE happyIn74 #-}
happyOut74 :: (HappyAbsSyn ) -> ([(BindType,Ident)])
happyOut74 :: HappyAbsSyn -> [(BindType, Ident)]
happyOut74 HappyAbsSyn
x = HappyAbsSyn -> [(BindType, Ident)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut74 #-}
happyIn75 :: ([(BindType,Ident)]) -> (HappyAbsSyn )
happyIn75 :: [(BindType, Ident)] -> HappyAbsSyn
happyIn75 [(BindType, Ident)]
x = [(BindType, Ident)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(BindType, Ident)]
x
{-# INLINE happyIn75 #-}
happyOut75 :: (HappyAbsSyn ) -> ([(BindType,Ident)])
happyOut75 :: HappyAbsSyn -> [(BindType, Ident)]
happyOut75 HappyAbsSyn
x = HappyAbsSyn -> [(BindType, Ident)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut75 #-}
happyIn76 :: ([(BindType,Ident)]) -> (HappyAbsSyn )
happyIn76 :: [(BindType, Ident)] -> HappyAbsSyn
happyIn76 [(BindType, Ident)]
x = [(BindType, Ident)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(BindType, Ident)]
x
{-# INLINE happyIn76 #-}
happyOut76 :: (HappyAbsSyn ) -> ([(BindType,Ident)])
happyOut76 :: HappyAbsSyn -> [(BindType, Ident)]
happyOut76 HappyAbsSyn
x = HappyAbsSyn -> [(BindType, Ident)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut76 #-}
happyIn77 :: ([Hypo]) -> (HappyAbsSyn )
happyIn77 :: [Hypo] -> HappyAbsSyn
happyIn77 [Hypo]
x = [Hypo] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [Hypo]
x
{-# INLINE happyIn77 #-}
happyOut77 :: (HappyAbsSyn ) -> ([Hypo])
happyOut77 :: HappyAbsSyn -> [Hypo]
happyOut77 HappyAbsSyn
x = HappyAbsSyn -> [Hypo]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut77 #-}
happyIn78 :: ([Term]) -> (HappyAbsSyn )
happyIn78 :: [Term] -> HappyAbsSyn
happyIn78 [Term]
x = [Term] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [Term]
x
{-# INLINE happyIn78 #-}
happyOut78 :: (HappyAbsSyn ) -> ([Term])
happyOut78 :: HappyAbsSyn -> [Term]
happyOut78 HappyAbsSyn
x = HappyAbsSyn -> [Term]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut78 #-}
happyIn79 :: ([Patt]) -> (HappyAbsSyn )
happyIn79 :: [Patt] -> HappyAbsSyn
happyIn79 [Patt]
x = [Patt] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [Patt]
x
{-# INLINE happyIn79 #-}
happyOut79 :: (HappyAbsSyn ) -> ([Patt])
happyOut79 :: HappyAbsSyn -> [Patt]
happyOut79 HappyAbsSyn
x = HappyAbsSyn -> [Patt]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut79 #-}
happyIn80 :: (Case) -> (HappyAbsSyn )
happyIn80 :: Case -> HappyAbsSyn
happyIn80 Case
x = Case -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Case
x
{-# INLINE happyIn80 #-}
happyOut80 :: (HappyAbsSyn ) -> (Case)
happyOut80 :: HappyAbsSyn -> Case
happyOut80 HappyAbsSyn
x = HappyAbsSyn -> Case
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut80 #-}
happyIn81 :: ([Case]) -> (HappyAbsSyn )
happyIn81 :: [Case] -> HappyAbsSyn
happyIn81 [Case]
x = [Case] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [Case]
x
{-# INLINE happyIn81 #-}
happyOut81 :: (HappyAbsSyn ) -> ([Case])
happyOut81 :: HappyAbsSyn -> [Case]
happyOut81 HappyAbsSyn
x = HappyAbsSyn -> [Case]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut81 #-}
happyIn82 :: ((Term,Term)) -> (HappyAbsSyn )
happyIn82 :: (Term, Term) -> HappyAbsSyn
happyIn82 (Term, Term)
x = (Term, Term) -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Term, Term)
x
{-# INLINE happyIn82 #-}
happyOut82 :: (HappyAbsSyn ) -> ((Term,Term))
happyOut82 :: HappyAbsSyn -> (Term, Term)
happyOut82 HappyAbsSyn
x = HappyAbsSyn -> (Term, Term)
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut82 #-}
happyIn83 :: ([(Term,Term)]) -> (HappyAbsSyn )
happyIn83 :: [(Term, Term)] -> HappyAbsSyn
happyIn83 [(Term, Term)]
x = [(Term, Term)] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [(Term, Term)]
x
{-# INLINE happyIn83 #-}
happyOut83 :: (HappyAbsSyn ) -> ([(Term,Term)])
happyOut83 :: HappyAbsSyn -> [(Term, Term)]
happyOut83 HappyAbsSyn
x = HappyAbsSyn -> [(Term, Term)]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut83 #-}
happyIn84 :: ([Hypo]) -> (HappyAbsSyn )
happyIn84 :: [Hypo] -> HappyAbsSyn
happyIn84 [Hypo]
x = [Hypo] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [Hypo]
x
{-# INLINE happyIn84 #-}
happyOut84 :: (HappyAbsSyn ) -> ([Hypo])
happyOut84 :: HappyAbsSyn -> [Hypo]
happyOut84 HappyAbsSyn
x = HappyAbsSyn -> [Hypo]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut84 #-}
happyIn85 :: ([Hypo]) -> (HappyAbsSyn )
happyIn85 :: [Hypo] -> HappyAbsSyn
happyIn85 [Hypo]
x = [Hypo] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [Hypo]
x
{-# INLINE happyIn85 #-}
happyOut85 :: (HappyAbsSyn ) -> ([Hypo])
happyOut85 :: HappyAbsSyn -> [Hypo]
happyOut85 HappyAbsSyn
x = HappyAbsSyn -> [Hypo]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut85 #-}
happyIn86 :: ([BNFCRule]) -> (HappyAbsSyn )
happyIn86 :: [BNFCRule] -> HappyAbsSyn
happyIn86 [BNFCRule]
x = [BNFCRule] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [BNFCRule]
x
{-# INLINE happyIn86 #-}
happyOut86 :: (HappyAbsSyn ) -> ([BNFCRule])
happyOut86 :: HappyAbsSyn -> [BNFCRule]
happyOut86 HappyAbsSyn
x = HappyAbsSyn -> [BNFCRule]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut86 #-}
happyIn87 :: ([BNFCRule]) -> (HappyAbsSyn )
happyIn87 :: [BNFCRule] -> HappyAbsSyn
happyIn87 [BNFCRule]
x = [BNFCRule] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [BNFCRule]
x
{-# INLINE happyIn87 #-}
happyOut87 :: (HappyAbsSyn ) -> ([BNFCRule])
happyOut87 :: HappyAbsSyn -> [BNFCRule]
happyOut87 HappyAbsSyn
x = HappyAbsSyn -> [BNFCRule]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut87 #-}
happyIn88 :: ([[BNFCSymbol]]) -> (HappyAbsSyn )
happyIn88 :: [[BNFCSymbol]] -> HappyAbsSyn
happyIn88 [[BNFCSymbol]]
x = [[BNFCSymbol]] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [[BNFCSymbol]]
x
{-# INLINE happyIn88 #-}
happyOut88 :: (HappyAbsSyn ) -> ([[BNFCSymbol]])
happyOut88 :: HappyAbsSyn -> [[BNFCSymbol]]
happyOut88 HappyAbsSyn
x = HappyAbsSyn -> [[BNFCSymbol]]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut88 #-}
happyIn89 :: ([BNFCSymbol]) -> (HappyAbsSyn )
happyIn89 :: [BNFCSymbol] -> HappyAbsSyn
happyIn89 [BNFCSymbol]
x = [BNFCSymbol] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [BNFCSymbol]
x
{-# INLINE happyIn89 #-}
happyOut89 :: (HappyAbsSyn ) -> ([BNFCSymbol])
happyOut89 :: HappyAbsSyn -> [BNFCSymbol]
happyOut89 HappyAbsSyn
x = HappyAbsSyn -> [BNFCSymbol]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut89 #-}
happyIn90 :: (BNFCSymbol) -> (HappyAbsSyn )
happyIn90 :: BNFCSymbol -> HappyAbsSyn
happyIn90 BNFCSymbol
x = BNFCSymbol -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# BNFCSymbol
x
{-# INLINE happyIn90 #-}
happyOut90 :: (HappyAbsSyn ) -> (BNFCSymbol)
happyOut90 :: HappyAbsSyn -> BNFCSymbol
happyOut90 HappyAbsSyn
x = HappyAbsSyn -> BNFCSymbol
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut90 #-}
happyIn91 :: (Bool) -> (HappyAbsSyn )
happyIn91 :: Bool -> HappyAbsSyn
happyIn91 Bool
x = Bool -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Bool
x
{-# INLINE happyIn91 #-}
happyOut91 :: (HappyAbsSyn ) -> (Bool)
happyOut91 :: HappyAbsSyn -> Bool
happyOut91 HappyAbsSyn
x = HappyAbsSyn -> Bool
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut91 #-}
happyIn92 :: ([ERule]) -> (HappyAbsSyn )
happyIn92 :: [ERule] -> HappyAbsSyn
happyIn92 [ERule]
x = [ERule] -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# [ERule]
x
{-# INLINE happyIn92 #-}
happyOut92 :: (HappyAbsSyn ) -> ([ERule])
happyOut92 :: HappyAbsSyn -> [ERule]
happyOut92 HappyAbsSyn
x = HappyAbsSyn -> [ERule]
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut92 #-}
happyIn93 :: (ERule) -> (HappyAbsSyn )
happyIn93 :: ERule -> HappyAbsSyn
happyIn93 ERule
x = ERule -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ERule
x
{-# INLINE happyIn93 #-}
happyOut93 :: (HappyAbsSyn ) -> (ERule)
happyOut93 :: HappyAbsSyn -> ERule
happyOut93 HappyAbsSyn
x = HappyAbsSyn -> ERule
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut93 #-}
happyIn94 :: (ERHS) -> (HappyAbsSyn )
happyIn94 :: ERHS -> HappyAbsSyn
happyIn94 ERHS
x = ERHS -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ERHS
x
{-# INLINE happyIn94 #-}
happyOut94 :: (HappyAbsSyn ) -> (ERHS)
happyOut94 :: HappyAbsSyn -> ERHS
happyOut94 HappyAbsSyn
x = HappyAbsSyn -> ERHS
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut94 #-}
happyIn95 :: (ERHS) -> (HappyAbsSyn )
happyIn95 :: ERHS -> HappyAbsSyn
happyIn95 ERHS
x = ERHS -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ERHS
x
{-# INLINE happyIn95 #-}
happyOut95 :: (HappyAbsSyn ) -> (ERHS)
happyOut95 :: HappyAbsSyn -> ERHS
happyOut95 HappyAbsSyn
x = HappyAbsSyn -> ERHS
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut95 #-}
happyIn96 :: (ERHS) -> (HappyAbsSyn )
happyIn96 :: ERHS -> HappyAbsSyn
happyIn96 ERHS
x = ERHS -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ERHS
x
{-# INLINE happyIn96 #-}
happyOut96 :: (HappyAbsSyn ) -> (ERHS)
happyOut96 :: HappyAbsSyn -> ERHS
happyOut96 HappyAbsSyn
x = HappyAbsSyn -> ERHS
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut96 #-}
happyIn97 :: (ERHS) -> (HappyAbsSyn )
happyIn97 :: ERHS -> HappyAbsSyn
happyIn97 ERHS
x = ERHS -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ERHS
x
{-# INLINE happyIn97 #-}
happyOut97 :: (HappyAbsSyn ) -> (ERHS)
happyOut97 :: HappyAbsSyn -> ERHS
happyOut97 HappyAbsSyn
x = HappyAbsSyn -> ERHS
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut97 #-}
happyIn98 :: (ModuleName) -> (HappyAbsSyn )
happyIn98 :: ModuleName -> HappyAbsSyn
happyIn98 ModuleName
x = ModuleName -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ModuleName
x
{-# INLINE happyIn98 #-}
happyOut98 :: (HappyAbsSyn ) -> (ModuleName)
happyOut98 :: HappyAbsSyn -> ModuleName
happyOut98 HappyAbsSyn
x = HappyAbsSyn -> ModuleName
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut98 #-}
happyIn99 :: (Posn) -> (HappyAbsSyn )
happyIn99 :: Posn -> HappyAbsSyn
happyIn99 Posn
x = Posn -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Posn
x
{-# INLINE happyIn99 #-}
happyOut99 :: (HappyAbsSyn ) -> (Posn)
happyOut99 :: HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
x = HappyAbsSyn -> Posn
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut99 #-}
happyInTok :: (Token) -> (HappyAbsSyn )
happyInTok :: Token -> HappyAbsSyn
happyInTok Token
x = Token -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Token
x
{-# INLINE happyInTok #-}
happyOutTok :: (HappyAbsSyn ) -> (Token)
happyOutTok :: HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
x = HappyAbsSyn -> Token
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOutTok #-}


happyExpList :: HappyAddr
happyExpList :: HappyAddr
happyExpList = Addr# -> HappyAddr
HappyA# Addr#
"\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x7a\xf0\x4c\x00\x00\x00\x00\x00\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\x00\x00\x00\x00\x00\x0a\x00\xa2\x02\x5f\x00\x0c\xcc\x81\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x05\x00\x51\x8d\x2f\x10\x07\xe6\xc0\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0e\x01\x00\x00\x00\x00\x00\x00\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\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x09\x0c\x00\x01\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\x00\x04\x00\x00\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\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\x87\x00\x00\x00\x00\x00\x00\x00\x00\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\x00\x00\x00\x00\x02\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\x01\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\x20\x00\x00\x00\x00\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x38\x00\x01\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x20\x2a\xf0\x01\x00\x00\x00\x78\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\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x05\x00\x51\x11\x00\x00\x00\x00\xc0\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x02\x80\xa8\xce\x17\x88\x03\x73\xe0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x01\x40\x54\xe3\x0b\xc4\x81\x39\xf0\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\x08\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x44\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x22\x00\x00\x00\x00\x00\x04\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\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\x28\x00\x88\x6a\x7c\x81\x38\x30\x07\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x44\x05\x3e\x00\x00\x00\x00\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x04\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\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\x01\x40\x54\xe0\x03\x00\x00\x00\xf0\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x88\x0a\x7c\x00\x00\x00\x00\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\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\x08\x0e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x28\x00\x88\x6a\x7c\x81\x38\x30\x07\x1e\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\x20\x81\x01\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\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\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\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\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\x84\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\x00\x00\x00\x00\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\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\x80\x00\x00\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\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\x40\x00\x00\x00\x00\x00\x00\x02\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\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\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\x02\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\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\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\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\x00\x00\x00\x00\x00\x08\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\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\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x20\x00\x00\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\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\x00\x00\x00\x00\x00\x00\x00\x80\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\x00\x00\x00\x00\x00\x00\x00\x50\x00\x10\x15\xf8\x02\x60\x60\x0a\x3c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x28\x00\x88\x0a\x7c\x01\x30\x30\x05\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x14\x00\x44\x05\xbe\x00\x18\x98\x02\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\xa2\x02\x5f\x00\x0c\xcc\x81\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x05\x00\x51\x8d\x2f\x10\x07\xe6\xc0\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x05\x41\x54\x04\x00\x00\x00\x00\xf0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa0\x00\x20\xaa\xf1\x05\xe2\xc0\x1c\x78\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x50\x41\x10\x15\x01\x00\x00\x00\x00\x3c\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x44\x05\x3e\x00\x00\x00\x00\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\xa2\x02\x1f\x00\x00\x00\x80\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x02\x00\x00\x00\x00\x00\x00\x00\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\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\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\x80\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\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\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\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\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x51\x81\x0f\x00\x00\x00\xc0\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x21\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\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\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\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\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\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x0a\x82\xa8\x08\x00\x00\x00\x00\xe0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x05\x41\x54\x04\x00\x00\x00\x00\xf0\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa0\x00\x20\xaa\xf1\x05\xe2\xc0\x1c\x78\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x20\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x14\x00\x44\x35\xbe\x40\x1c\x98\x03\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\xa2\x1a\x5f\x20\x0e\xcc\x81\x07\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\x00\x00\x00\x00\x80\x02\x80\xa8\xc0\x17\x00\x03\x73\xe0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x01\x40\x54\xe3\x0b\xc4\x81\x39\xf0\x00\x00\x00\x00\x00\x00\x00\x00\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\x04\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\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\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\xc0\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\x20\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\x02\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x50\x00\x08\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\xc0\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\x04\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\x04\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\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x10\x00\x00\x00\x00\x00\xc0\x00\x00\x00\x00\x00\x00\x00\x00\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\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\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\x00\x00\x00\x00\x00\x01\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\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\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\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\x00\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\x40\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\x00\x00\x00\x00\x14\x00\x00\x01\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\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x20\x2a\xf0\x01\x00\x00\x00\x78\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x50\x00\x10\x15\x01\x00\x00\x00\x00\x3c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa8\x20\x88\x8b\x00\x00\x00\x00\x00\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x02\x00\x80\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\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\x90\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa0\x00\x20\xaa\xf1\x05\xe2\xc0\x1c\x78\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\x28\x00\x88\x6a\x7c\x81\x38\x30\x07\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x14\x00\x44\x35\xbe\x40\x1c\x98\x03\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\xa2\x02\x1f\x00\x00\x00\x80\x07\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\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\xa0\x00\x20\xaa\xf1\x05\xe2\xc0\x1c\x78\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\x28\x00\x88\x6a\x7c\x81\x38\x30\x07\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x44\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\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\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\x00\x00\x00\x00\x00\x00\x00\xa0\x00\x20\xaa\xf1\x05\xe2\xc0\x1c\x78\x00\x00\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\x28\x00\x88\x6a\x7c\x81\x38\x30\x07\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x14\x00\x44\x35\xbe\x40\x1c\x98\x03\x0f\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x02\x10\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\x40\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\x00\x00\x00\x00\xa8\x20\x8c\x8b\x00\x00\x00\x00\x00\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x0a\x83\xb8\x08\x00\x00\x00\x00\xe0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x01\x40\x54\xe3\x0b\xc4\x81\x39\xf0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa0\x82\x20\x2a\x02\x00\x00\x00\x00\x78\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x44\x05\x3e\x00\x00\x00\x00\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\xa2\x02\x1f\x00\x00\x00\x80\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x51\x81\x0f\x00\x00\x00\xc0\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\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\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\x00\x00\x00\x00\x00\x00\x00\x80\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\x40\x00\x00\x02\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\x01\x40\x54\xe0\x03\x00\x00\x00\xf0\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\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\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\x15\x06\x51\x11\x00\x00\x00\x00\xc0\x03\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe0\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\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\x08\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\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\x00\x80\x00\x40\x04\x00\x00\x00\x00\x80\x00\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\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\x10\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\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\x11\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x01\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\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\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\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\x00\xa0\x00\x20\xaa\xf1\x05\xe2\xc0\x1c\x78\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x50\x00\x10\xd5\xf8\x02\x71\x60\x0e\x3c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x88\x00\x00\x00\x00\x00\x10\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\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x04\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\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\x00\x00\x00\x00\x00\x00\x50\x00\x10\xd5\xf8\x02\x71\x60\x0e\x3c\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\x14\x00\x44\x35\xbe\x40\x1c\x98\x03\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\x80\x02\x80\xa8\xc6\x17\x88\x03\x73\xe0\x01\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\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\x04\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\x0a\x00\xa2\x1a\x5f\x20\x0e\xcc\x81\x07\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\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa0\x82\x20\x2a\x02\x00\x00\x00\x00\x78\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x50\x41\x10\x15\x01\x00\x00\x00\x00\x3c\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\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\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x05\x00\x51\x8d\x2f\x10\x07\xe6\xc0\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\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\x80\x00\x20\x2a\xf0\x01\x00\x00\x00\x78\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\x28\x00\x88\xea\x7c\x81\x38\x30\x07\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x44\x05\x3e\x00\x00\x00\x00\x0f\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\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\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\x10\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\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\x00\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa0\x00\x20\x2a\x02\x00\x00\x00\x00\x78\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\x14\x00\x44\x35\xbe\x40\x1c\x98\x03\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\xa2\x1a\x5f\x20\x0e\xcc\x81\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x05\x00\x51\x8d\x2f\x10\x07\xe6\xc0\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\x00\x00\x00\x00\x00\x00\x00\x00\x40\x05\x41\x54\x04\x00\x00\x00\x00\xf0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa0\x82\x20\x2a\x02\x00\x00\x00\x00\x78\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x50\x00\x10\xd5\xf8\x02\x71\x60\x0e\x3c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa8\x20\x88\x8a\x00\x00\x00\x00\x00\x1e\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\x04\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\x00\x00\x00\x04\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\x50\x41\x10\x15\x01\x00\x00\x00\x00\x3c\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\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\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\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\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\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\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\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\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\x2a\x08\xa2\x22\x00\x00\x00\x00\x80\x07\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\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa0\x82\x20\x2a\x02\x00\x00\x00\x00\x78\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x06\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\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\x10\x00\x00\x00\x00\x00\xc0\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\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\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x30\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\x02\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\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\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd0\x83\x67\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\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\x00\x01\x00\x00\x00\x00\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa0\x07\xcf\x04\x00\x00\x00\x00\x00\x00\x00\x00\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\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\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\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\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\x00\x00\x00\x00\x00\x00\x00\x00\x08\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\x02\x00\x80\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\x80\x0a\x82\xa8\x08\x00\x00\x00\x00\xe0\x01\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\x00\x00\x00\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\x14\x00\x44\x35\xbe\x40\x1c\x98\x03\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\xa2\x1a\x5f\x20\x0e\xcc\x81\x07\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\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\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\x00\x00\x00\x00\x00\x00\x04\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\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\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\x80\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\x00\x00\x00\x00\x00\x00\x02\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\x10\x00\x80\x00\x00\x00\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\x04\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\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x80\x08\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\x50\x00\x10\xd5\xf8\x02\x71\x60\x0e\x3c\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\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\x40\x01\x40\x54\xe3\x0b\xc4\x81\x39\xf0\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\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\x08\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\x05\x00\x51\x8d\x2f\x10\x07\xe6\xc0\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\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\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\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\xa2\x02\x1f\x00\x00\x00\x80\x07\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa0\x00\x20\xaa\xf1\x05\xe2\xc0\x1c\x78\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\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\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\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\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\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\x50\x00\x10\xd5\xf8\x02\x71\x60\x0e\x3c\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\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\x04\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\x00\x00\x00\x00\x00\x01\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\x80\x00\x00\x00\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\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\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\x0a\x00\xa2\x1a\x5f\x20\x0e\xcc\x81\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x05\x00\x51\x8d\x2f\x10\x07\xe6\xc0\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\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\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\x04\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\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\x80\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\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x0f\x9e\x09\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\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x08\x00\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\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\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\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\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\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\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\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\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\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\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\x00\x00\x00\x00\x00\x00\x00\x00\x08\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\x00\x00\x00\x00\x00\x00\x00\x00\x08\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\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\x02\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\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\x04\x00\x00\x00\x01\x00\x00\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\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\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\x00\x00\x00\x00\x00\x00\x00\x00\x00"#

{-# NOINLINE happyExpListPerState #-}
happyExpListPerState :: Int -> [[Char]]
happyExpListPerState Int
st =
    [[Char]]
token_strs_expected
  where token_strs :: [[Char]]
token_strs = [[Char]
"error",[Char]
"%dummy",[Char]
"%start_pModDef",[Char]
"%start_pTopDef",[Char]
"%start_pModHeader",[Char]
"%start_pTerm",[Char]
"%start_pExp",[Char]
"%start_pBNFCRules",[Char]
"%start_pEBNFRules",[Char]
"ModDef",[Char]
"ModHeader",[Char]
"ComplMod",[Char]
"ModType",[Char]
"ModHeaderBody",[Char]
"ModOpen",[Char]
"ModBody",[Char]
"ModContent",[Char]
"ListTopDef",[Char]
"ListOpen",[Char]
"Open",[Char]
"ListInst",[Char]
"Inst",[Char]
"ListIncluded",[Char]
"Included",[Char]
"TopDef",[Char]
"CatDef",[Char]
"FunDef",[Char]
"DefDef",[Char]
"DataDef",[Char]
"ParamDef",[Char]
"OperDef",[Char]
"LinDef",[Char]
"TermDef",[Char]
"FlagDef",[Char]
"ListDataConstr",[Char]
"ParConstr",[Char]
"ListLinDef",[Char]
"ListDefDef",[Char]
"ListOperDef",[Char]
"ListCatDef",[Char]
"ListFunDef",[Char]
"ListDataDef",[Char]
"ListParamDef",[Char]
"ListTermDef",[Char]
"ListFlagDef",[Char]
"ListParConstr",[Char]
"ListIdent",[Char]
"ListIdent2",[Char]
"LhsIdent",[Char]
"LhsName",[Char]
"LhsNames",[Char]
"LocDef",[Char]
"ListLocDef",[Char]
"Exp",[Char]
"Exp1",[Char]
"Exp2",[Char]
"Exp3",[Char]
"Exp4",[Char]
"Exp5",[Char]
"Exp6",[Char]
"ListExp",[Char]
"Exps",[Char]
"Patt",[Char]
"Patt1",[Char]
"Patt2",[Char]
"Patt3",[Char]
"PattAss",[Char]
"Label",[Char]
"Sort",[Char]
"ListPattAss",[Char]
"ListPatt",[Char]
"PattArg",[Char]
"Arg",[Char]
"ListArg",[Char]
"Bind",[Char]
"ListBind",[Char]
"Decl",[Char]
"ListTupleComp",[Char]
"ListPattTupleComp",[Char]
"Case",[Char]
"ListCase",[Char]
"Altern",[Char]
"ListAltern",[Char]
"DDecl",[Char]
"ListDDecl",[Char]
"ListCFRule",[Char]
"CFRule",[Char]
"ListCFRHS",[Char]
"ListCFSymbol",[Char]
"CFSymbol",[Char]
"NonEmpty",[Char]
"ListEBNFRule",[Char]
"EBNFRule",[Char]
"ERHS0",[Char]
"ERHS1",[Char]
"ERHS2",[Char]
"ERHS3",[Char]
"ModuleName",[Char]
"Posn",[Char]
"'!'",[Char]
"'#'",[Char]
"'$'",[Char]
"'('",[Char]
"')'",[Char]
"'~'",[Char]
"'*'",[Char]
"'**'",[Char]
"'+'",[Char]
"'++'",[Char]
"','",[Char]
"'-'",[Char]
"'->'",[Char]
"'.'",[Char]
"'/'",[Char]
"':'",[Char]
"';'",[Char]
"'<'",[Char]
"'='",[Char]
"'=>'",[Char]
"'>'",[Char]
"'?'",[Char]
"'@'",[Char]
"'['",[Char]
"']'",[Char]
"'{'",[Char]
"'}'",[Char]
"'\\\\'",[Char]
"'\\\\\\\\'",[Char]
"'_'",[Char]
"'|'",[Char]
"'::='",[Char]
"'PType'",[Char]
"'Str'",[Char]
"'Strs'",[Char]
"'Tok'",[Char]
"'Type'",[Char]
"'abstract'",[Char]
"'case'",[Char]
"'cat'",[Char]
"'concrete'",[Char]
"'data'",[Char]
"'def'",[Char]
"'flags'",[Char]
"'fun'",[Char]
"'in'",[Char]
"'incomplete'",[Char]
"'instance'",[Char]
"'interface'",[Char]
"'let'",[Char]
"'lin'",[Char]
"'lincat'",[Char]
"'lindef'",[Char]
"'linref'",[Char]
"'of'",[Char]
"'open'",[Char]
"'oper'",[Char]
"'param'",[Char]
"'pattern'",[Char]
"'pre'",[Char]
"'printname'",[Char]
"'resource'",[Char]
"'strs'",[Char]
"'table'",[Char]
"'variants'",[Char]
"'where'",[Char]
"'with'",[Char]
"'coercions'",[Char]
"'terminator'",[Char]
"'separator'",[Char]
"'nonempty'",[Char]
"Integer",[Char]
"Double",[Char]
"String",[Char]
"Ident",[Char]
"%eof"]
        bit_start :: Int
bit_start = Int
st Int -> Int -> Int
forall a. Num a => a -> a -> a
* Int
175
        bit_end :: Int
bit_end = (Int
st Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1) Int -> Int -> Int
forall a. Num a => a -> a -> a
* Int
175
        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]
map Int -> Bool
read_bit [Int
bit_start..Int
bit_end Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
1]
        bits_indexed :: [(Bool, Int)]
bits_indexed = [Bool] -> [Int] -> [(Bool, Int)]
forall a b. [a] -> [b] -> [(a, b)]
zip [Bool]
bits [Int
0..Int
174]
        token_strs_expected :: [[Char]]
token_strs_expected = ((Bool, Int) -> [[Char]]) -> [(Bool, Int)] -> [[Char]]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
concatMap (Bool, Int) -> [[Char]]
f [(Bool, Int)]
bits_indexed
        f :: (Bool, Int) -> [[Char]]
f (Bool
False, Int
_) = []
        f (Bool
True, Int
nr) = [[[Char]]
token_strs [[Char]] -> Int -> [Char]
forall a. [a] -> Int -> a
!! Int
nr]

happyActOffsets :: HappyAddr
happyActOffsets :: HappyAddr
happyActOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\x8a\x00\x84\x06\x8a\x00\x50\x01\x90\x00\x0e\x03\xea\xff\xe4\x00\x59\x01\x00\x00\xb9\x00\x8b\x00\x3d\x01\x20\x01\x0e\x03\x42\x01\xa5\x01\xa5\x01\x4e\x01\x77\x01\xd6\x01\xf5\x01\x1c\x01\xa9\x02\x12\x02\x00\x00\x00\x00\xfd\x01\xa2\x02\x50\x00\x90\x00\x00\x00\x92\x00\xd7\x01\x31\x00\x31\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x00\xbe\x02\x83\x00\xdd\x01\xdf\x01\xbe\x02\x18\x02\x1a\x02\xea\x02\x1c\x02\x00\x00\x00\x00\x00\x00\x00\x00\x38\x02\x1e\x03\x90\x00\x38\x02\x59\x01\xf2\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x77\x00\xf2\x01\x00\x00\x00\x00\x32\x02\x00\x00\xfe\x01\x3a\x02\x00\x00\x72\x00\x3c\x02\x00\x00\x72\x00\x00\x00\x00\x00\x4e\x02\x00\x00\x72\x00\x61\x02\x00\x00\x0c\x02\x70\x02\x00\x00\x47\x02\x85\x02\x00\x00\x72\x00\x89\x02\x00\x00\x53\x02\x97\x02\x00\x00\xaf\x00\x99\x02\x6e\x02\x6e\x02\x6e\x02\x6e\x02\x6e\x02\xbf\x02\x7c\x01\x7c\x01\x7c\x01\x50\x01\x90\x00\x19\x00\xf7\x01\x90\x00\xfc\x01\xbb\x02\xff\x02\xff\x02\x75\x01\xc6\x02\xa1\x02\x9e\x02\xe5\x02\x4c\x00\xca\x02\xf2\x02\xf6\x02\xc5\x02\x00\x00\x00\x00\x07\x03\xfb\x02\x00\x00\x12\x03\xff\x02\x43\x01\x18\x03\x21\x03\xeb\x02\xc0\x01\x00\x00\x2e\x03\xf7\x02\x1d\x02\x1d\x02\x00\x00\xfa\x02\x0a\x03\x00\x00\x00\x00\x00\x00\x00\x00\x38\x03\x90\x00\x1c\x00\x54\x03\xd0\x00\x10\x01\x5d\x03\x50\x01\x10\x01\x27\x03\x75\x00\x43\x03\x00\x00\x4a\x03\x51\x03\x00\x00\x35\x00\x00\x00\x8b\x03\xd1\x00\x91\x03\x8a\x03\x35\x00\xb3\x01\x35\x00\x00\x00\x00\x00\x9c\x03\x68\x03\x77\x03\xa5\x03\xa7\x03\x75\x00\x82\x03\x00\x00\x00\x00\xba\x03\x00\x00\x00\x00\xa0\x03\x00\x00\xd7\x03\xe1\x03\x00\x00\xae\x03\x00\x00\x00\x00\xe5\x03\xf2\x03\xec\x03\x0d\x04\x0c\x01\x00\x00\x00\x00\x23\x04\x12\x04\x26\x04\xff\x02\xa2\x02\xd3\x01\x1e\x00\x27\x04\x28\x04\xf9\x03\x60\x02\x10\x01\x00\x00\x10\x01\x10\x01\xff\x02\x1e\x04\x00\x00\x00\x00\x10\x01\x1f\x04\x10\x01\xe3\x00\x2b\x04\x00\x00\xfb\x03\x2c\x04\x10\x01\xff\x03\x10\x01\x10\x01\x4c\x04\x4c\x04\xda\x00\x54\x04\x4b\x04\x57\x04\xbc\x01\x59\x04\x55\x04\x65\x04\x30\x00\x10\x01\x1d\x02\x66\x04\x00\x00\x16\x03\x16\x03\x16\x03\x00\x00\x00\x00\x00\x00\x00\x00\x4e\x04\x4f\x04\x00\x00\xd6\x00\x37\x04\x2b\x03\x30\x03\x74\x04\x14\x01\x3c\x04\x00\x00\xdc\x01\x87\x04\x34\x04\x51\x04\x00\x00\x53\x03\x8e\x04\x69\x04\xa2\x04\x6e\x04\x9e\x00\xb1\x04\x67\x03\xba\x04\xb3\x04\x7b\x03\x9e\x00\x00\x02\x8f\x03\xb4\x04\x84\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x01\x10\x01\x22\x01\xb5\x04\xb0\x00\x7e\x04\x00\x00\x00\x00\x00\x00\x10\x01\x00\x00\x10\x01\xb7\x04\x00\x00\x10\x01\x00\x00\xf4\x00\x00\x00\xb6\x04\x00\x00\x10\x01\x00\x00\x00\x00\xb9\x04\x46\x02\x57\x02\x85\x01\x00\x00\x82\x04\x10\x01\x00\x00\x00\x00\x2b\x03\x00\x00\x50\x00\x2b\x03\x00\x00\x00\x00\xc6\x04\x15\x00\xfe\x00\x2b\x00\x85\x04\x85\x04\x00\x00\xc1\x04\xc4\x04\x00\x00\xa2\x02\x00\x00\x00\x00\x10\x01\x10\x01\x10\x01\x00\x00\x68\x02\x68\x02\x10\x01\x68\x02\x00\x00\xbe\x04\x00\x00\x00\x00\xa4\x04\x00\x00\x68\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc9\x04\xd4\x04\x00\x00\xdb\x04\x00\x00\x96\x04\x00\x00\x00\x00\x00\x00\x97\x04\x00\x00\x00\x00\x68\x02\x00\x00\x00\x00\xa1\x04\x68\x02\x00\x00\x00\x00\xd2\x04\x75\x00\xd5\x04\x00\x00\x75\x00\x00\x00\xde\x04\xdf\x04\x00\x00\xec\x04\x00\x00\x00\x00\x00\x00\x00\x00\x35\x00\x00\x00\xe1\x04\x00\x00\xf4\x04\x45\x00\x84\x06\x2b\x00\xcf\x04\xf3\x04\x00\x00\xc2\x04\xe4\x04\x84\x06\xc3\x04\xfc\x04\xd5\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf0\x04\x00\x00\xd7\x00\x00\x00\x00\x00\x91\x02\x00\x00\x00\x00\x00\x00\xe7\x04\x10\x01\x10\x01\x00\x00\x00\x00\x00\x00\x00\x00\xfd\x04\xfe\x04\xf5\x04\xf6\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfa\x04\xd1\x04\x19\x05\xd6\x00\x05\x05\x0f\x05\x00\x00\x00\x00\x00\x00\x00\x00\x01\x05\x26\x01\x00\x00\x10\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x01\x00\x00\x00\x00\x06\x05\xd7\x04\x00\x00\x10\x01\x00\x00\x00\x00\x1a\x05\x0d\x05\x00\x00\xe3\x04\x2b\x03\x00\x00\x00\x00\x00\x00\x10\x01\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\xe5\x04\x00\x00\x00\x00\x10\x01\x15\x05\x00\x00\xee\x04\x2a\x05\x31\x05\xf2\x04\x25\x05\xf7\x04\x00\x00\x00\x00\x10\x01\x10\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x09\x05\x37\x05\x00\x00\x35\x05\x00\x00\x00\x00\x2e\x05\x2b\x00\x33\x05\x84\x06\x00\x00\x03\x05\xe6\x00\x4b\x05\x00\x00\x00\x00\x39\x05\x00\x00\x3d\x05\x4d\x05\x24\x05\x59\x05\x00\x00\x16\x05\x5a\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x45\x05\x64\x05\x00\x00\x00\x00\x17\x05\x00\x00\x65\x05\x00\x00\x5c\x05\x53\x05\x00\x00\x00\x00\xe6\x00\x6a\x05\x3a\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#

happyGotoOffsets :: HappyAddr
happyGotoOffsets :: HappyAddr
happyGotoOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\xbf\x01\x61\x05\xb2\x01\x67\x04\xb8\x04\x97\x01\x9d\x01\x6f\x05\x79\x05\x00\x00\x00\x00\x26\x02\x00\x00\x00\x00\x98\x02\x00\x00\x2c\x05\x2d\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc6\x01\x00\x00\x00\x00\x00\x00\x00\x00\xe9\xff\x30\x04\x10\x04\x00\x00\x00\x00\x5a\x02\xd1\x02\xe8\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc8\x04\xff\x01\x2c\x03\x00\x00\x00\x00\x30\x02\x00\x00\x00\x00\x35\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd8\x04\x00\x00\x7c\x05\x00\x00\x0a\x00\x17\x00\x10\x00\x97\x00\xf8\xff\x03\x00\x7c\x00\x7e\x00\x85\x00\x6c\x00\x04\x00\x00\x00\x00\x00\x8c\x00\x8e\x00\x00\x00\x00\x00\x70\x00\x00\x00\x00\x00\xdf\x00\x00\x00\x00\x00\x12\x01\x00\x00\x00\x00\x00\x00\x00\x00\x2e\x01\x00\x00\x00\x00\x5b\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x3c\x01\x00\x00\x00\x00\x5d\x05\x00\x00\x00\x00\x00\x00\x00\x00\x29\x05\x34\x05\x36\x05\x44\x05\x46\x05\x00\x00\x4b\x01\xab\x01\x1f\x02\x4d\x04\x60\x04\x00\x00\x52\x02\x78\x04\xf6\x01\x00\x00\xac\x02\x36\x03\x00\x00\x00\x00\x00\x00\x60\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6b\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x59\x02\x00\x00\x00\x00\x00\x00\xef\x03\x00\x00\x00\x00\x00\x00\x47\x05\x1e\x02\x90\x02\x00\x00\x00\x00\xa8\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe8\x04\x55\x05\x00\x00\xd0\x03\xf8\x04\x00\x00\x7f\x04\x08\x05\x00\x00\x67\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc1\x03\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x7c\x02\x00\x00\x49\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf0\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x42\x04\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\x72\x01\xf5\xff\x74\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x05\x00\x00\x20\x04\x28\x05\x46\x03\x00\x00\x00\x00\x00\x00\x38\x05\x00\x00\x48\x05\x2a\x03\x00\x00\x00\x00\x6c\x05\x00\x00\x58\x05\x44\x04\x68\x05\x78\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x74\x01\x00\x00\x00\x00\x00\x00\x74\x01\x90\x04\x88\x03\x00\x00\x00\x00\x3e\x03\x3e\x03\x3e\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfd\xff\x00\x00\xc1\x01\x0b\x00\x00\x00\x00\x00\x2c\x00\x00\x00\xa1\x03\x00\x00\x52\x05\x7a\x00\x00\x00\x12\x00\x00\x00\xa3\x00\x00\x00\x0c\x00\x44\x03\x00\x00\x2e\x00\x00\x00\x00\x00\x9f\x00\x58\x03\x00\x00\x71\x00\x49\x05\x24\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x88\x05\x98\x05\x6c\x03\x00\x00\x51\x01\x77\x05\x00\x00\x00\x00\x00\x00\xa8\x05\x00\x00\xb8\x05\x00\x00\x00\x00\xc8\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd8\x05\x00\x00\x00\x00\x00\x00\xac\x03\x11\x01\x00\x00\x00\x00\x87\x05\xe8\x05\x00\x00\x00\x00\x51\x02\x54\x05\x48\x04\x73\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfb\xff\x56\x05\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa7\x00\x00\x00\x00\x00\xa8\x04\xe0\x03\xf0\x03\x00\x00\x9b\x03\x29\x01\xf8\x05\xe1\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x9f\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc0\x02\x00\x00\x00\x00\x7d\x01\xe6\x02\x00\x00\x00\x00\x00\x00\x8d\x03\x00\x00\x00\x00\xab\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x61\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x67\x01\x07\x00\x00\x00\x00\x00\x00\x00\x57\x05\x00\x00\xa6\x01\x08\x00\xbf\x03\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\xb0\x03\x00\x00\x00\x00\x00\x00\x00\x00\x08\x06\x18\x06\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\x6d\x05\xe4\x03\xfe\xff\x00\x00\x00\x00\x00\x00\x00\x00\x63\x05\x66\x05\x00\x00\x00\x00\x00\x00\x28\x06\x67\x05\x00\x00\x69\x05\x73\x05\x74\x05\x38\x06\x75\x05\x76\x05\x00\x00\x7b\x05\x00\x00\x48\x06\x00\x00\x83\x05\x84\x05\x00\x00\x85\x05\x00\x00\xb4\x02\x00\x00\x16\x00\x00\x00\x58\x06\x00\x00\x86\x05\x00\x00\x00\x00\x00\x00\x00\x00\x89\x05\x00\x00\x00\x00\x00\x00\x00\x00\x93\x05\x00\x00\x97\x05\x00\x00\x00\x00\x68\x06\x94\x05\x00\x00\x00\x00\x00\x00\x00\x00\x7a\x05\x00\x00\x8c\x05\x00\x00\x00\x00\x00\x04\x78\x06\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\x09\x00\x00\x00\xc9\x01\x00\x00\x96\x05\xa5\x05\xfa\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfe\x03\xad\x05\x19\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x99\x05\x00\x00\xa3\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa6\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb6\x05\x00\x00\xb9\x05\xa4\x05\x00\x00\x00\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#
"\xf6\xff\x00\x00\xf6\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf5\xff\x00\x00\xfe\xfe\x00\x00\x00\x00\x0e\xff\x00\x00\xff\xfe\xff\xfe\x00\x00\x00\x00\x7e\xff\x7c\xff\x7a\xff\x73\xff\x66\xff\x64\xff\x62\xff\x00\x00\x00\x00\x00\x00\x1e\xff\x5e\xff\x00\x00\x8a\xff\x00\x00\x00\x00\x35\xff\x33\xff\x32\xff\x34\xff\x36\xff\x00\x00\x00\x00\x8a\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xff\x5f\xff\x61\xff\x63\xff\x00\x00\x7a\xff\x00\x00\x00\x00\x00\x00\x00\x00\xef\xfe\xef\xfe\xef\xfe\xef\xfe\xef\xfe\xef\xfe\xef\xfe\xef\xfe\xef\xfe\xef\xfe\xef\xfe\x00\x00\x00\x00\xef\xfe\xef\xfe\x00\x00\xca\xff\xef\xfe\x00\x00\xc9\xff\xef\xfe\x00\x00\xc6\xff\xef\xfe\xc7\xff\xc8\xff\x00\x00\xc5\xff\xef\xfe\x00\x00\xcd\xff\x00\x00\x00\x00\xc2\xff\x00\x00\x00\x00\xcc\xff\xef\xfe\x00\x00\xcb\xff\x00\x00\x00\x00\xce\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\x56\xff\x00\x00\x8a\xff\x56\xff\x00\x00\x69\xff\x00\x00\x00\x00\x00\x00\x89\xff\x00\x00\x8a\xff\x97\xff\x00\x00\x00\x00\x22\xff\x00\x00\x00\x00\x24\xff\x25\xff\x00\x00\x00\x00\x5d\xff\x00\x00\x53\xff\x1d\xff\x00\x00\x00\x00\x8a\xff\x63\xff\x6a\xff\x00\x00\x00\x00\x00\x00\x1b\xff\x46\xff\x00\x00\x31\xff\x42\xff\x3f\xff\x3e\xff\x3d\xff\x41\xff\x00\x00\x00\x00\x72\xff\x8a\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x05\xff\x00\x00\x00\xff\x00\x00\x00\x00\x0d\xff\x00\x00\xfd\xfe\x00\x00\x00\x00\x00\x00\xfb\xfe\xf9\xfe\xf4\xfe\x00\x00\xf3\xfe\xf2\xfe\x00\x00\x00\x00\x00\x00\x00\x00\x07\xff\x05\xff\x00\x00\x03\xff\x02\xff\x00\x00\x87\xff\x7d\xff\x8a\xff\x83\xff\x00\x00\x63\xff\x65\xff\x00\x00\x38\xff\x84\xff\x00\x00\x30\xff\x00\x00\x00\x00\x1a\xff\x4f\xff\x4b\xff\x47\xff\x00\x00\x00\x00\x00\x00\x00\x00\x41\xff\x00\x00\x00\x00\x44\xff\x00\x00\x00\x00\x00\x00\x59\xff\x1e\xff\x00\x00\x53\xff\x00\x00\x5b\xff\x5a\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x7f\xff\x00\x00\x00\x00\x00\x00\x8a\xff\x00\x00\x00\x00\x67\xff\x68\xff\x00\x00\x17\xff\x00\x00\x3d\xff\x41\xff\x55\xff\x00\x00\x00\x00\x41\xff\x56\xff\x00\x00\x00\x00\x7b\xff\x74\xff\x75\xff\x79\xff\x57\xff\xf3\xff\xf0\xfe\xf2\xff\x00\x00\x00\x00\xf4\xff\xe8\xff\x00\x00\x10\xff\xef\xfe\x00\x00\x97\xff\xa1\xff\x91\xff\x8f\xff\x00\x00\x00\x00\xef\xfe\x93\xff\xef\xfe\x00\x00\x9b\xff\x00\x00\xa3\xff\x8f\xff\x00\x00\xef\xfe\x8f\xff\x00\x00\xef\xfe\x8f\xff\x00\x00\xef\xfe\xef\xfe\x9f\xff\xc3\xff\xc4\xff\x9e\xff\xb8\xff\xef\xfe\xa6\xff\x00\x00\x00\x00\x27\xff\x00\x00\xef\xfe\x00\x00\x29\xff\x2a\xff\x9c\xff\x00\x00\xaa\xff\x00\x00\x00\x00\xa2\xff\x00\x00\x9a\xff\x00\x00\xa8\xff\x00\x00\x92\xff\x00\x00\x2c\xff\x47\xff\x00\x00\x2e\xff\x31\xff\x41\xff\xa0\xff\x00\x00\x00\x00\xa4\xff\x11\xff\x10\xff\xef\xfe\x00\x00\x10\xff\xf7\xff\xe9\xff\xec\xff\xd3\xff\xd1\xff\x00\x00\x00\x00\x00\x00\x6f\xff\x00\x00\x00\x00\x4e\xff\x00\x00\x78\xff\x6b\xff\x56\xff\x00\x00\x00\x00\x6e\xff\x00\x00\x00\x00\x00\x00\x00\x00\x8c\xff\x8d\xff\x88\xff\x81\xff\x00\x00\x96\xff\x00\x00\x21\xff\x85\xff\x23\xff\x86\xff\x5c\xff\x52\xff\x00\x00\x1d\xff\x1c\xff\x00\x00\x40\xff\x00\x00\x3a\xff\x49\xff\x48\xff\x00\x00\x3b\xff\x4c\xff\x1b\xff\x45\xff\x3c\xff\x31\xff\x00\x00\x37\xff\x71\xff\x00\x00\x05\xff\x00\x00\x04\xff\x05\xff\x0b\xff\x00\x00\x00\x00\x0a\xff\x00\x00\xf7\xfe\xf6\xfe\xf5\xfe\xf8\xfe\x00\x00\xfc\xfe\xf8\xff\xe0\xff\xe3\xff\xd3\xff\xdc\xff\x00\x00\x00\x00\xda\xff\xd8\xff\x00\x00\x00\x00\xdc\xff\x00\x00\x00\x00\x00\x00\xdf\xff\xfa\xfe\xf1\xfe\x09\xff\x08\xff\x06\xff\x01\xff\x00\x00\x80\xff\x39\xff\x2f\xff\x19\xff\x40\xff\x43\xff\x20\xff\x58\xff\x00\x00\x00\x00\x00\x00\x51\xff\x18\xff\x50\xff\x16\xff\x00\x00\x14\xff\x00\x00\x00\x00\x54\xff\x4a\xff\x76\xff\x77\xff\xf0\xff\xf1\xff\xe7\xff\x00\x00\x00\x00\x00\x00\xe8\xff\x00\x00\x00\x00\xc1\xff\x0f\xff\xef\xfe\xef\xfe\xae\xff\x00\x00\x2d\xff\x00\x00\xef\xfe\x90\xff\xef\xfe\xef\xfe\xef\xfe\x00\x00\xef\xfe\xef\xfe\x00\x00\x95\xff\x8e\xff\x00\x00\x26\xff\xef\xfe\xef\xfe\x99\xff\xef\xfe\x00\x00\x10\xff\xb9\xff\xef\xfe\xb7\xff\x00\x00\xb6\xff\xef\xfe\x94\xff\x28\xff\xb1\xff\xb3\xff\xef\xfe\xbe\xff\xb0\xff\xaf\xff\xbd\xff\xef\xfe\x2b\xff\x00\x00\xbb\xff\xba\xff\x00\x00\xef\xfe\xed\xff\x00\x00\xea\xff\xd6\xff\x00\x00\x00\x00\x00\x00\x6c\xff\x6d\xff\x00\x00\x00\x00\x8b\xff\x82\xff\x70\xff\x4d\xff\x0c\xff\xe4\xff\x00\x00\xe1\xff\xd2\xff\xd3\xff\xdb\xff\xde\xff\x00\x00\x00\x00\x00\x00\xdc\xff\xd9\xff\x00\x00\x00\x00\x00\x00\x15\xff\x13\xff\x00\x00\xd0\xff\x00\x00\x00\x00\xe8\xff\x00\x00\xc0\xff\x00\x00\x00\x00\xad\xff\xbc\xff\xb2\xff\xb5\xff\xef\xfe\x98\xff\xef\xfe\xac\xff\xb4\xff\x12\xff\x00\x00\xee\xff\xeb\xff\xd5\xff\x00\x00\xcf\xff\xe5\xff\xe2\xff\x00\x00\x00\x00\xdd\xff\xd7\xff\x00\x00\x00\x00\xe8\xff\xef\xfe\xbf\xff\xef\xff\xd4\xff\xe6\xff"#

happyCheck :: HappyAddr
happyCheck :: HappyAddr
happyCheck = Addr# -> HappyAddr
HappyA# Addr#
"\xff\xff\x04\x00\x05\x00\x05\x00\x09\x00\x0a\x00\x07\x00\x06\x00\x07\x00\x11\x00\x0d\x00\x0e\x00\x0e\x00\x0e\x00\x0d\x00\x0e\x00\x09\x00\x0a\x00\x09\x00\x0a\x00\x0e\x00\x0d\x00\x0e\x00\x1f\x00\x14\x00\x16\x00\x10\x00\x10\x00\x1a\x00\x11\x00\x1b\x00\x03\x00\x0b\x00\x38\x00\x12\x00\x05\x00\x12\x00\x21\x00\x24\x00\x09\x00\x1e\x00\x1e\x00\x13\x00\x1f\x00\x1c\x00\x38\x00\x1c\x00\x04\x00\x1a\x00\x18\x00\x02\x00\x1a\x00\x04\x00\x4b\x00\x06\x00\x20\x00\x14\x00\x04\x00\x24\x00\x0b\x00\x0c\x00\x1f\x00\x0e\x00\x13\x00\x10\x00\x58\x00\x12\x00\x13\x00\x16\x00\x21\x00\x16\x00\x17\x00\x18\x00\x1b\x00\x1a\x00\x1a\x00\x20\x00\x58\x00\x1e\x00\x1e\x00\x0b\x00\x59\x00\x02\x00\x58\x00\x04\x00\x58\x00\x58\x00\x58\x00\x43\x00\x58\x00\x0e\x00\x59\x00\x59\x00\x59\x00\x58\x00\x58\x00\x58\x00\x58\x00\x12\x00\x59\x00\x59\x00\x59\x00\x16\x00\x4b\x00\x18\x00\x59\x00\x1a\x00\x59\x00\x1c\x00\x1d\x00\x1e\x00\x59\x00\x59\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x4b\x00\x27\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4b\x00\x59\x00\x2e\x00\x4a\x00\x4b\x00\x15\x00\x32\x00\x33\x00\x34\x00\x59\x00\x15\x00\x59\x00\x43\x00\x1d\x00\x18\x00\x3b\x00\x3c\x00\x18\x00\x1d\x00\x3f\x00\x40\x00\x41\x00\x02\x00\x17\x00\x04\x00\x17\x00\x4a\x00\x27\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x17\x00\x1a\x00\x22\x00\x28\x00\x22\x00\x27\x00\x12\x00\x17\x00\x2d\x00\x17\x00\x16\x00\x22\x00\x18\x00\x0b\x00\x1a\x00\x19\x00\x1c\x00\x1d\x00\x22\x00\x18\x00\x22\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x17\x00\x27\x00\x1a\x00\x2f\x00\x23\x00\x18\x00\x1e\x00\x4b\x00\x2e\x00\x4a\x00\x4b\x00\x22\x00\x32\x00\x33\x00\x34\x00\x59\x00\x23\x00\x18\x00\x18\x00\x59\x00\x59\x00\x3b\x00\x3c\x00\x25\x00\x4b\x00\x3f\x00\x40\x00\x41\x00\x02\x00\x59\x00\x04\x00\x59\x00\x4b\x00\x59\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4a\x00\x4b\x00\x59\x00\x38\x00\x09\x00\x39\x00\x12\x00\x09\x00\x3c\x00\x59\x00\x16\x00\x59\x00\x18\x00\x4b\x00\x1a\x00\x1a\x00\x1c\x00\x1d\x00\x14\x00\x1a\x00\x59\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x1f\x00\x27\x00\x59\x00\x1f\x00\x4b\x00\x4b\x00\x59\x00\x1a\x00\x2e\x00\x58\x00\x1a\x00\x1e\x00\x32\x00\x33\x00\x34\x00\x4c\x00\x27\x00\x28\x00\x29\x00\x38\x00\x0c\x00\x3b\x00\x3c\x00\x38\x00\x38\x00\x3f\x00\x40\x00\x41\x00\x02\x00\x2f\x00\x04\x00\x09\x00\x18\x00\x0b\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4b\x00\x01\x00\x38\x00\x0b\x00\x4b\x00\x4b\x00\x12\x00\x07\x00\x08\x00\x09\x00\x16\x00\x13\x00\x18\x00\x0d\x00\x1a\x00\x1f\x00\x1c\x00\x1d\x00\x4b\x00\x09\x00\x14\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x25\x00\x27\x00\x59\x00\x27\x00\x28\x00\x29\x00\x1a\x00\x49\x00\x2e\x00\x4b\x00\x1e\x00\x1b\x00\x32\x00\x33\x00\x34\x00\x1f\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3b\x00\x3c\x00\x3c\x00\x0b\x00\x3f\x00\x40\x00\x41\x00\x02\x00\x10\x00\x04\x00\x27\x00\x28\x00\x29\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x0e\x00\x20\x00\x42\x00\x36\x00\x37\x00\x38\x00\x12\x00\x27\x00\x28\x00\x29\x00\x16\x00\x32\x00\x18\x00\x58\x00\x1a\x00\x59\x00\x4c\x00\x4b\x00\x20\x00\x08\x00\x3b\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x0f\x00\x27\x00\x27\x00\x28\x00\x29\x00\x30\x00\x31\x00\x32\x00\x02\x00\x26\x00\x04\x00\x58\x00\x29\x00\x33\x00\x34\x00\x10\x00\x3b\x00\x59\x00\x13\x00\x30\x00\x31\x00\x3b\x00\x3c\x00\x4b\x00\x12\x00\x3f\x00\x40\x00\x41\x00\x16\x00\x0e\x00\x18\x00\x59\x00\x1a\x00\x3e\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x17\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x25\x00\x27\x00\x32\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x59\x00\x37\x00\x38\x00\x3b\x00\x08\x00\x33\x00\x34\x00\x3d\x00\x3e\x00\x01\x00\x02\x00\x0f\x00\x39\x00\x3b\x00\x3c\x00\x3c\x00\x07\x00\x3f\x00\x09\x00\x41\x00\x02\x00\x00\x00\x04\x00\x02\x00\x06\x00\x4c\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x0c\x00\x16\x00\x0e\x00\x0b\x00\x58\x00\x11\x00\x12\x00\x4b\x00\x10\x00\x08\x00\x16\x00\x17\x00\x18\x00\x02\x00\x1a\x00\x04\x00\x0f\x00\x06\x00\x1e\x00\x30\x00\x31\x00\x32\x00\x02\x00\x0c\x00\x04\x00\x0e\x00\x06\x00\x4c\x00\x4d\x00\x12\x00\x3b\x00\x0b\x00\x0c\x00\x16\x00\x17\x00\x18\x00\x47\x00\x1a\x00\x12\x00\x52\x00\x53\x00\x1e\x00\x16\x00\x32\x00\x18\x00\x1f\x00\x1a\x00\x31\x00\x32\x00\x02\x00\x1e\x00\x04\x00\x3b\x00\x06\x00\x02\x00\x0a\x00\x04\x00\x3b\x00\x06\x00\x0c\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x0c\x00\x12\x00\x0d\x00\x4a\x00\x4b\x00\x16\x00\x12\x00\x18\x00\x10\x00\x1a\x00\x16\x00\x13\x00\x18\x00\x1e\x00\x1a\x00\x36\x00\x37\x00\x38\x00\x1e\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x02\x00\x0e\x00\x04\x00\x4b\x00\x06\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4b\x00\x0c\x00\x4b\x00\x35\x00\x36\x00\x37\x00\x38\x00\x12\x00\x31\x00\x32\x00\x1a\x00\x16\x00\x1a\x00\x18\x00\x1a\x00\x1a\x00\x00\x00\x58\x00\x3b\x00\x1e\x00\x46\x00\x47\x00\x4c\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x11\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x02\x00\x4b\x00\x04\x00\x11\x00\x06\x00\x11\x00\x58\x00\x30\x00\x31\x00\x32\x00\x0c\x00\x35\x00\x36\x00\x37\x00\x38\x00\x4b\x00\x12\x00\x02\x00\x3b\x00\x04\x00\x16\x00\x06\x00\x18\x00\x11\x00\x1a\x00\x31\x00\x32\x00\x0c\x00\x1e\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x12\x00\x02\x00\x3b\x00\x04\x00\x16\x00\x06\x00\x18\x00\x10\x00\x1a\x00\x11\x00\x13\x00\x0c\x00\x1e\x00\x58\x00\x25\x00\x52\x00\x53\x00\x12\x00\x1b\x00\x2a\x00\x2b\x00\x16\x00\x25\x00\x18\x00\x11\x00\x1a\x00\x32\x00\x2a\x00\x2b\x00\x1e\x00\x35\x00\x36\x00\x37\x00\x38\x00\x32\x00\x3b\x00\x34\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4b\x00\x02\x00\x3b\x00\x04\x00\x11\x00\x06\x00\x46\x00\x47\x00\x11\x00\x4a\x00\x4b\x00\x0c\x00\x4b\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x12\x00\x02\x00\x32\x00\x04\x00\x16\x00\x11\x00\x18\x00\x58\x00\x1a\x00\x13\x00\x04\x00\x3b\x00\x1e\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x12\x00\x4e\x00\x4f\x00\x50\x00\x16\x00\x4b\x00\x18\x00\x12\x00\x1a\x00\x4a\x00\x4b\x00\x16\x00\x1e\x00\x18\x00\x04\x00\x1a\x00\x05\x00\x35\x00\x36\x00\x37\x00\x38\x00\x0e\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x2e\x00\x12\x00\x55\x00\x56\x00\x57\x00\x16\x00\x45\x00\x18\x00\x11\x00\x1a\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x31\x00\x32\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x4c\x00\x4d\x00\x32\x00\x3b\x00\x58\x00\x4b\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x04\x00\x3b\x00\x0b\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x35\x00\x36\x00\x37\x00\x38\x00\x4e\x00\x4f\x00\x50\x00\x12\x00\x0b\x00\x4a\x00\x4b\x00\x16\x00\x37\x00\x18\x00\x04\x00\x1a\x00\x45\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x14\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x4b\x00\x12\x00\x41\x00\x42\x00\x0d\x00\x16\x00\x1b\x00\x18\x00\x58\x00\x1a\x00\x04\x00\x35\x00\x36\x00\x37\x00\x38\x00\x01\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x07\x00\x08\x00\x09\x00\x12\x00\x41\x00\x42\x00\x19\x00\x16\x00\x15\x00\x18\x00\x04\x00\x1a\x00\x10\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4b\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x0e\x00\x12\x00\x58\x00\x4f\x00\x50\x00\x16\x00\x4b\x00\x18\x00\x4a\x00\x1a\x00\x0e\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x1b\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x25\x00\x44\x00\x45\x00\x46\x00\x4b\x00\x2a\x00\x2b\x00\x28\x00\x4b\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x0e\x00\x33\x00\x34\x00\x35\x00\x36\x00\x31\x00\x32\x00\x39\x00\x3a\x00\x41\x00\x42\x00\x3d\x00\x1b\x00\x31\x00\x32\x00\x3b\x00\x4b\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x1a\x00\x32\x00\x3b\x00\x34\x00\x28\x00\x4c\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x3b\x00\x1b\x00\x3f\x00\x40\x00\x25\x00\x33\x00\x34\x00\x35\x00\x36\x00\x2a\x00\x2b\x00\x39\x00\x3a\x00\x4b\x00\x28\x00\x3d\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x4b\x00\x1b\x00\x3f\x00\x40\x00\x48\x00\x33\x00\x34\x00\x35\x00\x36\x00\x13\x00\x4c\x00\x39\x00\x3a\x00\x11\x00\x28\x00\x3d\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x1f\x00\x1b\x00\x3f\x00\x40\x00\x11\x00\x33\x00\x34\x00\x35\x00\x36\x00\x4a\x00\x4c\x00\x39\x00\x3a\x00\x11\x00\x28\x00\x3d\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x35\x00\x36\x00\x37\x00\x38\x00\x4a\x00\x33\x00\x34\x00\x35\x00\x36\x00\x1f\x00\x4c\x00\x39\x00\x3a\x00\x0b\x00\x0c\x00\x3d\x00\x4b\x00\x46\x00\x47\x00\x35\x00\x36\x00\x37\x00\x38\x00\x35\x00\x36\x00\x37\x00\x38\x00\x37\x00\x38\x00\x20\x00\x4c\x00\x4f\x00\x50\x00\x3d\x00\x3e\x00\x58\x00\x46\x00\x47\x00\x37\x00\x38\x00\x46\x00\x47\x00\x37\x00\x38\x00\x3d\x00\x3e\x00\x4b\x00\x0b\x00\x3d\x00\x3e\x00\x0b\x00\x0c\x00\x10\x00\x1b\x00\x58\x00\x13\x00\x25\x00\x48\x00\x58\x00\x13\x00\x58\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x11\x00\x58\x00\x0b\x00\x0c\x00\x1b\x00\x58\x00\x0b\x00\x0c\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x25\x00\x54\x00\x55\x00\x56\x00\x57\x00\x2a\x00\x2b\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x0b\x00\x0c\x00\x19\x00\x15\x00\x48\x00\x49\x00\x07\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x0e\x00\x0e\x00\x0e\x00\x19\x00\x48\x00\x49\x00\x1b\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x4b\x00\x1a\x00\x4b\x00\x1b\x00\x48\x00\x49\x00\x4b\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x44\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x0e\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x44\x00\x11\x00\x1b\x00\x25\x00\x11\x00\x25\x00\x11\x00\x3b\x00\x2a\x00\x2b\x00\x2a\x00\x2b\x00\x1b\x00\x41\x00\x42\x00\x43\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x1b\x00\x1b\x00\x4b\x00\x3b\x00\x10\x00\x37\x00\x37\x00\x4b\x00\x3b\x00\x41\x00\x42\x00\x43\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x13\x00\x3b\x00\x4b\x00\x54\x00\x55\x00\x56\x00\x57\x00\x13\x00\x3b\x00\x43\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x10\x00\x3b\x00\x4b\x00\x54\x00\x55\x00\x56\x00\x57\x00\x4b\x00\x3b\x00\x43\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x13\x00\x0b\x00\x13\x00\x13\x00\x13\x00\x4b\x00\x13\x00\x3b\x00\x13\x00\x4b\x00\x08\x00\x19\x00\x4b\x00\x13\x00\x2e\x00\x43\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x1b\x00\x19\x00\x15\x00\x0b\x00\x05\x00\x4b\x00\x4b\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x4b\x00\x1b\x00\x19\x00\x11\x00\x11\x00\x05\x00\x11\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x08\x00\x2e\x00\x0b\x00\x1b\x00\x04\x00\x11\x00\x1b\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x0f\x00\x4b\x00\x4b\x00\x11\x00\x1b\x00\x1b\x00\x18\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x4b\x00\x04\x00\x19\x00\x10\x00\x1f\x00\x1b\x00\x4b\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x1f\x00\x13\x00\x4b\x00\x1a\x00\x4b\x00\x43\x00\x08\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x0b\x00\x4b\x00\x19\x00\x08\x00\x0b\x00\x13\x00\x4b\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x43\x00\x1a\x00\x4b\x00\x04\x00\x13\x00\x04\x00\x19\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x38\x00\x04\x00\x48\x00\x05\x00\x1b\x00\x05\x00\x4b\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x08\x00\x08\x00\x1b\x00\x05\x00\x0f\x00\x02\x00\x38\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x03\x00\x51\x00\x51\x00\x03\x00\x25\x00\x58\x00\x25\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x58\x00\x3b\x00\x58\x00\x3a\x00\x25\x00\x25\x00\x25\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x58\x00\x26\x00\x58\x00\x58\x00\x19\x00\x26\x00\x59\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x07\x00\x59\x00\x58\x00\x58\x00\x19\x00\x25\x00\x05\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x59\x00\x07\x00\x05\x00\x59\x00\x59\x00\xff\xff\x59\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x59\x00\x59\x00\x59\x00\x59\x00\xff\xff\xff\xff\x58\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x59\x00\x59\x00\x59\x00\x59\x00\xff\xff\xff\xff\x59\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x59\x00\x59\x00\x58\x00\xff\xff\xff\xff\xff\xff\x59\x00\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x59\x00\x59\x00\x58\x00\xff\xff\xff\xff\xff\xff\xff\xff\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x3b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x43\x00\x28\x00\xff\xff\x2a\x00\x2b\x00\x2c\x00\x2d\x00\xff\xff\x3b\x00\xff\xff\xff\xff\xff\xff\x33\x00\x34\x00\x35\x00\x36\x00\x43\x00\xff\xff\x39\x00\x3a\x00\xff\xff\xff\xff\x3d\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\xff\xff\xff\xff\xff\xff"#

happyTable :: HappyAddr
happyTable :: HappyAddr
happyTable = Addr# -> HappyAddr
HappyA# Addr#
"\x00\x00\x53\x01\x54\x01\x02\x02\xca\x01\xa1\x01\x12\x02\x9a\x01\x9b\x01\x5a\x00\x55\x01\x56\x01\x03\x02\x13\x02\x9c\x01\x9d\x01\xa0\x01\xa1\x01\x1d\x02\xa1\x01\xc8\x01\x15\x02\x16\x02\x5b\x00\x4c\x00\x57\x00\x66\x00\x66\x00\xe8\x01\x5a\x00\x58\x00\xcb\x00\xa7\x01\x92\x00\x60\x00\x7e\x01\x60\x00\x4d\x00\xe9\x01\x68\x01\x67\x00\x4d\x01\x63\x00\x3c\x01\x61\x00\x7e\x01\x40\x01\xa4\x01\xe8\x01\xff\x00\x95\x00\x00\x01\x96\x00\x0d\x00\xd8\x00\x64\x00\x4c\x00\xb7\x00\x31\x02\xee\x00\xd9\x00\x6a\x01\xf0\xfe\x63\x00\x97\xff\x93\x00\x97\x00\x97\xff\x57\x00\x2b\x01\x98\x00\x60\x01\x99\x00\x39\x01\x49\x01\x86\x00\x4a\x01\x93\x00\x9b\x00\x87\x00\xa7\x01\x5c\x00\x1d\x00\xa2\x01\x1e\x00\x57\x01\x57\x01\x57\x01\xce\x01\x57\x01\xa1\x00\xea\x01\x59\x00\x4e\x00\x57\x01\xa2\x01\x57\x01\xa2\x01\x1f\x00\x68\x00\x68\x00\x5c\x00\x20\x00\xcc\x00\x21\x00\x62\x00\x91\x00\x62\x00\x23\x00\x24\x00\x87\x00\xea\x01\x65\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x08\x01\x2a\x00\x9c\x00\x9d\x00\x9e\x00\x4a\x01\x88\x00\x4e\x00\x2b\x00\xb8\x00\xb9\x00\x4f\x00\x2c\x00\x2d\x00\x2e\x00\x65\x00\x4f\x00\x59\x00\xa8\x01\x50\x00\x18\x01\x2f\x00\x30\x00\xc0\x00\x2e\x01\x31\x00\x32\x00\x33\x00\x1d\x00\x52\x00\x1e\x00\x52\x00\xed\x00\x27\x01\x34\x00\x35\x00\x36\x00\x92\x00\x52\x00\x80\x00\x56\x00\x4b\x00\x55\x00\x41\x01\x1f\x00\x52\x00\x4c\x00\x52\x00\x20\x00\x53\x00\x21\x00\x34\x01\x22\x00\x8b\x00\x23\x00\x24\x00\x2a\x01\x5d\x00\x29\x01\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x52\x00\x2a\x00\x35\x01\x0a\x00\x5e\x00\x5d\x00\x36\x01\x19\x01\x2b\x00\xc1\x00\xc2\x00\x37\x01\x2c\x00\x2d\x00\x2e\x00\x51\x00\x3e\x01\x0e\x01\x18\x01\x16\x01\x51\x00\x2f\x00\x30\x00\xcd\x00\x81\x00\x31\x00\x32\x00\x33\x00\x1d\x00\x16\x01\x1e\x00\x54\x00\x0d\x00\x54\x00\x34\x00\x35\x00\x36\x00\x37\x00\x8c\x00\x8d\x00\x54\x00\xc5\x01\x68\x01\xce\x00\x1f\x00\x68\x01\xcf\x00\x54\x00\x20\x00\x54\x00\x21\x00\x37\x01\x22\x00\x9f\x01\x23\x00\x24\x00\x69\x01\x9f\x01\x5f\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x6a\x01\x2a\x00\x54\x00\x6a\x01\x0f\x01\x19\x01\x5f\x00\x86\x00\x2b\x00\x93\x00\x9f\x01\x87\x00\x2c\x00\x2d\x00\x2e\x00\xff\xff\x13\x01\x24\x01\x25\x01\xa0\x01\xcc\x01\x2f\x00\x30\x00\xa0\x01\x59\x01\x31\x00\x32\x00\x33\x00\x1d\x00\x0a\x00\x1e\x00\x68\x01\xcd\x01\x84\x01\x34\x00\x35\x00\x36\x00\xc9\x00\x08\x01\x71\x00\xa0\x01\xee\x00\x08\x01\x08\x01\x1f\x00\x72\x00\x73\x00\x74\x00\x20\x00\x4c\x01\x21\x00\x1f\xff\x22\x00\x6a\x01\x23\x00\x24\x00\x88\x00\x68\x01\xa4\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\xcd\x00\x2a\x00\x16\x01\x13\x01\x21\x01\x22\x01\x35\x01\xdc\x01\x2b\x00\xdd\x01\x36\x01\xfd\x01\x2c\x00\x2d\x00\x2e\x00\x6a\x01\xd6\x01\xd2\x00\xd3\x00\xd4\x00\xce\x00\x2f\x00\x30\x00\xcf\x00\xe2\x00\x31\x00\x32\x00\x33\x00\x1d\x00\xe3\x00\x3a\x00\x13\x01\x1e\x01\x1f\x01\x34\x00\x35\x00\x36\x00\x37\x00\xa8\x00\xaf\x00\xa5\x00\xbe\x01\xd3\x00\xd4\x00\x1f\x00\x13\x01\x14\x01\x15\x01\x20\x00\x75\x00\x21\x00\xd6\x00\x22\x00\x16\x01\xff\xff\x37\x01\xa9\x00\xa4\x01\x1a\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\xa5\x01\x2a\x00\x13\x01\x21\x01\xe3\x01\x04\x01\x18\x00\x19\x00\x1d\x00\x6b\x00\x3a\x00\xd6\x00\x6c\x00\x2d\x00\x2e\x00\xf2\x00\x1a\x00\x16\x01\xf3\x00\x6d\x00\x6e\x00\x2f\x00\x30\x00\xad\x00\x1f\x00\x31\x00\x32\x00\x33\x00\x20\x00\xf0\xfe\x21\x00\x16\x01\x22\x00\x6f\x00\x34\x00\x35\x00\x36\x00\x37\x00\x60\x01\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\xcd\x00\x2a\x00\x7f\x01\xef\xfe\xef\xfe\xef\xfe\xef\xfe\xef\xfe\x16\x01\x44\x01\x45\x01\x1a\x00\x17\x02\x2d\x00\x2e\x00\x5e\x01\x47\x01\x3a\x00\x3b\x00\xa5\x01\xce\x00\x2f\x00\x30\x00\xb3\x01\x95\x01\x31\x00\x96\x01\x33\x00\x95\x00\x49\x00\x96\x00\x08\x00\xd8\x00\xff\xff\x34\x00\x35\x00\x36\x00\x37\x00\xd9\x00\x97\x01\xf0\xfe\x25\xff\x93\x00\x64\x01\x97\x00\xef\xfe\x25\xff\x3f\x02\x98\x00\x60\x01\x99\x00\x95\x00\x49\x01\x96\x00\xa5\x01\xd8\x00\x9b\x00\x03\x01\x18\x00\x19\x00\x95\x00\xd9\x00\x96\x00\xf0\xfe\xd8\x00\x0d\x00\x0e\x00\x97\x00\x1a\x00\x34\x01\xd9\x00\x98\x00\x60\x01\x99\x00\xab\x00\x49\x01\x97\x00\x0a\x00\x0b\x00\x9b\x00\x98\x00\x4e\x01\x99\x00\xa7\x00\x49\x01\xa1\x00\x19\x00\x95\x00\x9b\x00\x96\x00\x1a\x00\xd8\x00\x95\x00\xa6\x00\x96\x00\x1a\x00\xd8\x00\xd9\x00\x9c\x00\x9d\x00\x9e\x00\x4a\x01\xd9\x00\x97\x00\xa0\x00\x4f\x01\x50\x01\x98\x00\x97\x00\x99\x00\x30\x01\x9a\x00\x98\x00\x31\x01\x99\x00\x9b\x00\x9a\x00\xbc\x01\xd3\x00\xd4\x00\x9b\x00\x9c\x00\x9d\x00\x9e\x00\x4a\x01\x95\x00\xa1\x00\x96\x00\x81\x00\xd8\x00\x9c\x00\x9d\x00\x9e\x00\x4a\x01\x7c\x00\xd9\x00\x7b\x00\xf5\x00\xd2\x00\xd3\x00\xd4\x00\x97\x00\x81\x00\x19\x00\x79\x00\x98\x00\x78\x00\x99\x00\x75\x00\x9a\x00\xff\xff\xd6\x00\x1a\x00\x9b\x00\xf6\x00\xf7\x00\xff\xff\x9c\x00\x9d\x00\x9e\x00\xfe\x00\x29\x01\x9c\x00\x9d\x00\xf9\x00\xfa\x00\x95\x00\x19\x01\x96\x00\x27\x01\xd8\x00\x24\x01\xd6\x00\x02\x01\x18\x00\x19\x00\xd9\x00\xda\x00\xd2\x00\xd3\x00\xd4\x00\x81\x00\x97\x00\x95\x00\x1a\x00\x96\x00\x98\x00\xd8\x00\x99\x00\x21\x01\x49\x01\x79\x00\x19\x00\xd9\x00\x9b\x00\x9c\x00\x9d\x00\x9e\x00\xda\x00\x97\x00\x95\x00\x1a\x00\x96\x00\x98\x00\xd8\x00\x99\x00\xf2\x00\x9a\x00\x1e\x01\xf3\x00\xd9\x00\x9b\x00\xd6\x00\x7c\x00\xaf\x00\x0b\x00\x97\x00\x74\x01\x7d\x00\x89\x00\x98\x00\x7c\x00\x99\x00\x1c\x01\x9a\x00\x4e\x01\x7d\x00\x89\x00\x9b\x00\xf5\x00\xd2\x00\xd3\x00\xd4\x00\xe3\x00\x1a\x00\xe4\x00\x9c\x00\x9d\x00\x9e\x00\x4a\x01\x1b\x01\x95\x00\x1a\x00\x96\x00\x1a\x01\xd8\x00\xf6\x00\xfc\x00\x13\x01\x4f\x01\xd2\x01\xd9\x00\x12\x01\x9c\x00\x9d\x00\x9e\x00\xfe\x00\x97\x00\x95\x00\x4e\x01\x96\x00\x98\x00\x10\x01\x99\x00\xd6\x00\x49\x01\x0d\x01\x3a\x00\x1a\x00\x9b\x00\x9c\x00\x9d\x00\x9e\x00\xda\x00\x97\x00\xbc\x00\xbd\x00\xbe\x00\x98\x00\x08\x01\x99\x00\x1f\x00\x9a\x00\x4f\x01\xcf\x01\x20\x00\x9b\x00\x21\x00\x3a\x00\xa3\x00\x06\x01\xd1\x00\xd2\x00\xd3\x00\xd4\x00\xa1\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\xf0\x00\x1f\x00\x97\x01\xb4\x00\xb5\x00\x20\x00\xd5\x00\x21\x00\xf1\x00\x22\x00\x9c\x00\x9d\x00\x9e\x00\x4a\x01\xf4\x00\x19\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\xad\x00\x0e\x00\x4e\x01\x1a\x00\xd6\x00\x81\x00\x9c\x00\x9d\x00\x9e\x00\x9f\x00\x3a\x00\x1a\x00\xee\x00\x34\x00\x35\x00\x36\x00\x37\x00\xd1\x00\xd2\x00\xd3\x00\xd4\x00\xae\x01\xbd\x00\xbe\x00\x1f\x00\xeb\x00\x4f\x01\x32\x02\x20\x00\xec\x00\x21\x00\x3a\x00\x77\x00\xb4\x01\x34\x00\x35\x00\x36\x00\x37\x00\xea\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x81\x00\x1f\x00\x83\x00\x88\x00\xe8\x00\x20\x00\xe7\x00\x21\x00\xd6\x00\x22\x00\x3a\x00\xb2\x01\xd2\x00\xd3\x00\xd4\x00\x71\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x72\x00\x73\x00\x74\x00\x1f\x00\x83\x00\x84\x00\xe6\x00\x20\x00\xe1\x00\x21\x00\x52\x01\xa3\x00\xe0\x00\x34\x00\x35\x00\x36\x00\x37\x00\x81\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\xde\x00\x1f\x00\xd6\x00\x8d\x01\xbe\x00\x20\x00\xdd\x00\x21\x00\xd1\x00\x22\x00\xf0\xfe\x34\x00\x35\x00\x36\x00\x37\x00\xa5\xff\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x7c\x00\x10\x00\x11\x00\x12\x00\x81\x00\x7d\x00\x7e\x00\xa5\xff\x13\x00\xa5\xff\xa5\xff\xa5\xff\xa5\xff\x34\x00\x35\x00\x36\x00\x37\x00\xa1\x00\xa5\xff\xa5\xff\xa5\xff\xa5\xff\xf3\x00\x19\x00\xa5\xff\xa5\xff\x83\x00\x71\x01\xa5\xff\xa9\xff\xa1\x00\x19\x00\x1a\x00\xc3\x00\x34\x00\x35\x00\x36\x00\x37\x00\xc6\x00\xe3\x00\x1a\x00\x76\x01\xa9\xff\xa5\xff\xa9\xff\xa9\xff\xa9\xff\xa9\xff\x1a\x00\xab\xff\x31\x01\x3b\x01\x7c\x00\xa9\xff\xa9\xff\xa9\xff\xa9\xff\x7d\x00\xee\x00\xa9\xff\xa9\xff\xbc\x00\xab\xff\xa9\xff\xab\xff\xab\xff\xab\xff\xab\xff\xbb\x00\x9d\xff\x31\x01\x32\x01\xba\x00\xab\xff\xab\xff\xab\xff\xab\xff\xb2\x00\xa9\xff\xab\xff\xab\xff\x9a\x01\x9d\xff\xab\xff\x9d\xff\x9d\xff\x9d\xff\x9d\xff\x99\x01\xa7\xff\x31\x01\xe5\x01\x93\x01\x9d\xff\x9d\xff\x9d\xff\x9d\xff\x92\x01\xab\xff\x9d\xff\x9d\xff\x90\x01\xa7\xff\x9d\xff\xa7\xff\xa7\xff\xa7\xff\xa7\xff\xf5\x00\xd2\x00\xd3\x00\xd4\x00\x91\x01\xa7\xff\xa7\xff\xa7\xff\xa7\xff\x8f\x01\x9d\xff\xa7\xff\xa7\xff\x14\x02\x05\x02\xa7\xff\x8d\x01\xf6\x00\x5c\x01\xf5\x00\xd2\x00\xd3\x00\xd4\x00\xf5\x00\xd2\x00\xd3\x00\xd4\x00\x44\x01\x45\x01\x8c\x01\xa7\xff\xb0\x01\xbe\x00\x46\x01\x47\x01\xd6\x00\xf6\x00\xbf\x01\x44\x01\x45\x01\xf6\x00\xb9\x01\x44\x01\x45\x01\xd7\x01\x47\x01\x81\x00\xee\x00\x10\x02\x47\x01\x04\x02\x05\x02\x97\xff\x8a\x01\xd6\x00\x97\xff\x7c\x00\x89\x01\xd6\x00\x88\x01\x93\x00\x7d\x00\x89\x00\xc7\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x87\x01\x93\x00\x3c\x02\x05\x02\x86\x01\x93\x00\x39\x02\x05\x02\x1a\x00\xc0\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\xde\x00\xb2\x00\xb3\x00\xb4\x00\xb5\x00\x7d\x00\x89\x00\x1a\x00\xc0\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x37\x02\x05\x02\x85\x01\x82\x01\xc1\x01\xc3\x01\x83\x01\x1a\x00\xc0\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x81\x01\x7d\x01\xf0\xfe\x76\x01\xc1\x01\xc2\x01\x74\x01\x1a\x00\x8d\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x7c\x01\x71\x01\x81\x00\x6f\x01\xc1\x01\x22\x02\x81\x00\x1a\x00\x78\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x8e\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\xa1\x00\x1a\x00\x6f\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x79\x01\x67\x01\x66\x01\x7c\x00\x65\x01\x7c\x00\x63\x01\x1a\x00\x7d\x00\x8a\x01\x7d\x00\x6c\x01\x62\x01\x83\x00\x8f\x00\x1b\x00\x6f\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x01\x01\x38\x00\x17\x00\x18\x00\x19\x00\x61\x01\x5c\x01\x53\x01\x1a\x00\x4d\x01\x5b\x01\x5a\x01\xef\xfe\x1a\x00\x83\x00\xd0\x01\x1b\x00\xfa\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x00\x01\x37\x00\x15\x00\x38\x00\x17\x00\x18\x00\x19\x00\x44\x01\x1a\x00\x19\x01\x93\x01\xb3\x00\xb4\x00\xb5\x00\x40\x01\x1a\x00\x1b\x00\xfa\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\xfb\x00\xc4\x00\x15\x00\x38\x00\x17\x00\x18\x00\x19\x00\x3e\x01\x1a\x00\xef\xfe\xaa\x01\xb3\x00\xb4\x00\xb5\x00\xef\xfe\x1a\x00\x1b\x00\xfa\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x5d\x01\x3b\x01\x34\x01\x39\x01\x2e\x01\xe5\x01\xe3\x01\xdf\x01\x1a\x00\xd9\x01\xd6\x01\xcf\x01\xdb\x01\x08\x01\xbc\x01\xbb\x01\x1b\x00\xfa\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\xc4\x01\xc8\x01\xc7\x01\xb9\x01\xe2\x00\xb8\x01\xb7\x01\xb6\x01\x1a\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x81\x00\xb2\x01\xb0\x01\xae\x01\xad\x01\xac\x01\xaa\x01\x1a\x00\x82\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\xa9\x01\x1c\x02\x1b\x02\x19\x02\x07\x02\x12\x02\x10\x02\x1a\x00\x6f\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x0d\x02\x08\x01\x08\x01\x0c\x02\x0b\x02\x0a\x02\x09\x02\x1a\x00\xcc\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x81\x00\x07\x02\x02\x02\x01\x02\xfe\x01\xf4\x01\xe3\x01\x1a\x00\xc6\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\xee\x01\xf0\x01\xec\x01\x2b\x02\xd6\x01\x29\x02\x28\x02\x1a\x00\xc3\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x27\x02\x08\x01\x25\x02\x20\x02\xa7\x01\x1f\x02\x81\x00\x1a\x00\x7a\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x21\x02\x1d\x02\x08\x01\x07\x02\x3b\x02\x07\x02\x3c\x02\x1a\x00\x77\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x59\x01\x07\x02\x37\x02\x36\x02\x46\x02\x42\x02\x08\x01\x1a\x00\x74\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x45\x02\x43\x02\x41\x02\x49\x02\x3c\x00\x08\x00\x59\x01\x1a\x00\x72\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\xb0\x00\xab\x00\xa9\x00\x69\x00\x1c\x01\x0b\x01\x10\x01\x1a\x00\x6d\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x0a\x01\x42\x01\x09\x01\xc9\x00\xe8\x00\x6f\x01\x07\x02\x1a\x00\x6b\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x08\x01\xe1\x01\x06\x01\xdb\x00\xd4\x01\xf2\x01\x2c\x01\x1a\x00\x6a\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x3d\x02\xd1\x01\xc9\x01\x19\x02\x2c\x02\x23\x02\x38\x02\x1a\x00\xe7\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\xff\x01\x49\x02\x47\x02\xfe\x01\xfa\x01\x00\x00\xf9\x01\x1a\x00\xe6\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\xf8\x01\xf7\x01\xf5\x01\xf4\x01\x00\x00\x00\x00\x25\x02\x1a\x00\xe0\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\xf0\x01\xee\x01\xec\x01\x2f\x02\x00\x00\x00\x00\x2e\x02\x1a\x00\xdf\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x2d\x02\x29\x02\x3e\x02\x00\x00\x00\x00\x00\x00\x34\x02\x1a\x00\xdd\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x33\x02\x46\x02\x43\x02\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x00\xd9\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x00\xd3\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x00\xbd\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x00\x0e\x02\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x00\x0d\x02\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x00\xfb\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x00\xf6\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x00\xf1\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x00\x30\x02\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x00\x2b\x02\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x00\x21\x02\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x3e\x00\x00\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x00\x00\x1a\x00\x00\x00\x00\x00\x00\x00\x43\x00\x44\x00\x45\x00\x46\x00\x1b\x00\x00\x00\x47\x00\x48\x00\x00\x00\x00\x00\x49\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\x00\x00\x00\x00\x00\x00"#

happyReduceArr :: Array
  Int
  (Int#
   -> Token
   -> Int#
   -> Happy_IntList
   -> HappyStk HappyAbsSyn
   -> P HappyAbsSyn)
happyReduceArr = (Int, Int)
-> [(Int,
     Int#
     -> Token
     -> Int#
     -> Happy_IntList
     -> HappyStk HappyAbsSyn
     -> P HappyAbsSyn)]
-> Array
     Int
     (Int#
      -> Token
      -> Int#
      -> Happy_IntList
      -> HappyStk HappyAbsSyn
      -> P HappyAbsSyn)
forall i e. Ix i => (i, i) -> [(i, e)] -> Array i e
Happy_Data_Array.array (Int
7, Int
272) [
	(Int
7 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_7),
	(Int
8 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_8),
	(Int
9 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_9),
	(Int
10 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_10),
	(Int
11 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_11),
	(Int
12 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_12),
	(Int
13 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_13),
	(Int
14 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_14),
	(Int
15 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_15),
	(Int
16 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_16),
	(Int
17 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_17),
	(Int
18 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_18),
	(Int
19 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_19),
	(Int
20 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_20),
	(Int
21 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_21),
	(Int
22 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_22),
	(Int
23 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_23),
	(Int
24 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_24),
	(Int
25 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_25),
	(Int
26 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_26),
	(Int
27 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_27),
	(Int
28 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_28),
	(Int
29 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_29),
	(Int
30 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_30),
	(Int
31 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_31),
	(Int
32 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_32),
	(Int
33 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_33),
	(Int
34 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_34),
	(Int
35 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_35),
	(Int
36 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_36),
	(Int
37 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_37),
	(Int
38 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_38),
	(Int
39 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_39),
	(Int
40 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_40),
	(Int
41 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_41),
	(Int
42 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_42),
	(Int
43 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_43),
	(Int
44 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_44),
	(Int
45 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_45),
	(Int
46 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_46),
	(Int
47 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_47),
	(Int
48 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_48),
	(Int
49 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_49),
	(Int
50 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_50),
	(Int
51 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_51),
	(Int
52 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_52),
	(Int
53 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_53),
	(Int
54 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_54),
	(Int
55 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_55),
	(Int
56 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_56),
	(Int
57 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_57),
	(Int
58 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_58),
	(Int
59 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_59),
	(Int
60 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_60),
	(Int
61 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_61),
	(Int
62 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_62),
	(Int
63 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_63),
	(Int
64 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_64),
	(Int
65 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_65),
	(Int
66 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_66),
	(Int
67 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_67),
	(Int
68 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_68),
	(Int
69 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_69),
	(Int
70 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_70),
	(Int
71 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_71),
	(Int
72 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_72),
	(Int
73 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_73),
	(Int
74 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_74),
	(Int
75 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_75),
	(Int
76 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_76),
	(Int
77 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_77),
	(Int
78 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_78),
	(Int
79 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_79),
	(Int
80 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_80),
	(Int
81 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_81),
	(Int
82 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_82),
	(Int
83 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_83),
	(Int
84 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_84),
	(Int
85 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_85),
	(Int
86 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_86),
	(Int
87 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_87),
	(Int
88 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_88),
	(Int
89 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_89),
	(Int
90 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_90),
	(Int
91 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_91),
	(Int
92 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_92),
	(Int
93 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_93),
	(Int
94 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_94),
	(Int
95 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_95),
	(Int
96 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_96),
	(Int
97 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_97),
	(Int
98 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_98),
	(Int
99 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_99),
	(Int
100 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_100),
	(Int
101 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_101),
	(Int
102 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_102),
	(Int
103 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_103),
	(Int
104 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_104),
	(Int
105 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_105),
	(Int
106 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_106),
	(Int
107 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_107),
	(Int
108 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_108),
	(Int
109 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_109),
	(Int
110 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_110),
	(Int
111 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_111),
	(Int
112 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_112),
	(Int
113 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_113),
	(Int
114 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_114),
	(Int
115 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_115),
	(Int
116 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_116),
	(Int
117 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_117),
	(Int
118 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_118),
	(Int
119 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_119),
	(Int
120 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_120),
	(Int
121 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_121),
	(Int
122 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_122),
	(Int
123 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_123),
	(Int
124 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_124),
	(Int
125 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_125),
	(Int
126 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_126),
	(Int
127 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_127),
	(Int
128 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_128),
	(Int
129 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_129),
	(Int
130 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_130),
	(Int
131 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_131),
	(Int
132 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_132),
	(Int
133 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_133),
	(Int
134 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_134),
	(Int
135 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_135),
	(Int
136 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_136),
	(Int
137 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_137),
	(Int
138 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_138),
	(Int
139 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_139),
	(Int
140 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_140),
	(Int
141 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_141),
	(Int
142 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_142),
	(Int
143 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_143),
	(Int
144 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_144),
	(Int
145 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_145),
	(Int
146 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_146),
	(Int
147 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_147),
	(Int
148 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_148),
	(Int
149 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_149),
	(Int
150 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_150),
	(Int
151 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_151),
	(Int
152 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_152),
	(Int
153 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_153),
	(Int
154 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_154),
	(Int
155 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_155),
	(Int
156 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_156),
	(Int
157 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_157),
	(Int
158 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_158),
	(Int
159 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_159),
	(Int
160 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_160),
	(Int
161 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_161),
	(Int
162 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_162),
	(Int
163 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_163),
	(Int
164 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_164),
	(Int
165 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_165),
	(Int
166 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_166),
	(Int
167 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_167),
	(Int
168 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_168),
	(Int
169 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_169),
	(Int
170 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_170),
	(Int
171 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_171),
	(Int
172 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_172),
	(Int
173 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_173),
	(Int
174 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_174),
	(Int
175 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_175),
	(Int
176 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_176),
	(Int
177 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_177),
	(Int
178 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_178),
	(Int
179 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_179),
	(Int
180 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_180),
	(Int
181 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_181),
	(Int
182 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_182),
	(Int
183 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_183),
	(Int
184 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_184),
	(Int
185 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_185),
	(Int
186 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_186),
	(Int
187 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_187),
	(Int
188 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_188),
	(Int
189 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_189),
	(Int
190 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_190),
	(Int
191 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_191),
	(Int
192 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_192),
	(Int
193 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_193),
	(Int
194 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_194),
	(Int
195 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_195),
	(Int
196 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_196),
	(Int
197 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_197),
	(Int
198 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_198),
	(Int
199 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_199),
	(Int
200 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_200),
	(Int
201 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_201),
	(Int
202 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_202),
	(Int
203 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_203),
	(Int
204 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_204),
	(Int
205 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_205),
	(Int
206 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_206),
	(Int
207 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_207),
	(Int
208 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_208),
	(Int
209 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_209),
	(Int
210 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_210),
	(Int
211 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_211),
	(Int
212 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_212),
	(Int
213 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_213),
	(Int
214 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_214),
	(Int
215 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_215),
	(Int
216 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_216),
	(Int
217 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_217),
	(Int
218 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_218),
	(Int
219 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_219),
	(Int
220 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_220),
	(Int
221 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_221),
	(Int
222 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_222),
	(Int
223 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_223),
	(Int
224 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_224),
	(Int
225 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_225),
	(Int
226 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_226),
	(Int
227 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_227),
	(Int
228 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_228),
	(Int
229 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_229),
	(Int
230 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_230),
	(Int
231 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_231),
	(Int
232 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_232),
	(Int
233 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_233),
	(Int
234 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_234),
	(Int
235 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_235),
	(Int
236 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_236),
	(Int
237 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_237),
	(Int
238 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_238),
	(Int
239 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_239),
	(Int
240 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_240),
	(Int
241 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_241),
	(Int
242 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_242),
	(Int
243 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_243),
	(Int
244 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_244),
	(Int
245 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_245),
	(Int
246 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_246),
	(Int
247 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_247),
	(Int
248 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_248),
	(Int
249 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_249),
	(Int
250 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_250),
	(Int
251 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_251),
	(Int
252 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_252),
	(Int
253 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_253),
	(Int
254 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_254),
	(Int
255 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_255),
	(Int
256 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_256),
	(Int
257 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_257),
	(Int
258 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_258),
	(Int
259 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_259),
	(Int
260 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_260),
	(Int
261 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_261),
	(Int
262 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_262),
	(Int
263 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_263),
	(Int
264 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_264),
	(Int
265 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_265),
	(Int
266 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_266),
	(Int
267 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_267),
	(Int
268 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_268),
	(Int
269 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_269),
	(Int
270 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_270),
	(Int
271 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_271),
	(Int
272 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_272)
	]

happy_n_terms :: Int
happy_n_terms = Int
77 :: Int
happy_n_nonterms :: Int
happy_n_nonterms = Int
90 :: Int

happyReduce_7 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_7 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_7 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyMonadReduce Int#
4# Int#
0# HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn
forall p. HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_7
happyReduction_7 :: HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_7 (HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest) p
tk
	 = P SourceModule -> (SourceModule -> P HappyAbsSyn) -> P HappyAbsSyn
forall a b. P a -> (a -> P b) -> P b
happyThen ((case HappyAbsSyn -> ModuleStatus
happyOut12 HappyAbsSyn
happy_x_1 of { ModuleStatus
happy_var_1 -> 
	case HappyAbsSyn -> (ModuleType, ModuleName)
happyOut13 HappyAbsSyn
happy_x_2 of { (ModuleType, ModuleName)
happy_var_2 -> 
	case HappyAbsSyn
-> ([(ModuleName, MInclude)],
    Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
    Maybe ([OpenSpec], [(Ident, Info)], Options))
happyOut16 HappyAbsSyn
happy_x_4 of { ([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 Maybe ([OpenSpec], [(Ident, Info)], Options))
happy_var_4 -> 
	(
                                   do let mstat :: ModuleStatus
mstat = ModuleStatus
happy_var_1
                                          (ModuleType
mtype,ModuleName
id) = (ModuleType, ModuleName)
happy_var_2
                                          ([(ModuleName, MInclude)]
extends,Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
with,Maybe ([OpenSpec], [(Ident, Info)], Options)
content) = ([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 Maybe ([OpenSpec], [(Ident, Info)], Options))
happy_var_4
                                          ([OpenSpec]
opens,[(Ident, Info)]
jments,Options
opts) = case Maybe ([OpenSpec], [(Ident, Info)], Options)
content of { Just ([OpenSpec], [(Ident, Info)], Options)
c -> ([OpenSpec], [(Ident, Info)], Options)
c; Maybe ([OpenSpec], [(Ident, Info)], Options)
Nothing -> ([],[],Options
noOptions) }
                                      [(Ident, Info)]
jments <- ((Ident, Info) -> P (Ident, Info))
-> [(Ident, Info)] -> P [(Ident, Info)]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM (ModuleType -> (Ident, Info) -> P (Ident, Info)
forall a. ModuleType -> (a, Info) -> P (a, Info)
checkInfoType ModuleType
mtype) [(Ident, Info)]
jments
                                      Map Ident Info
defs <- ModuleName -> [(Ident, Info)] -> P (Map Ident Info)
forall (m :: * -> *).
MonadFail m =>
ModuleName -> [(Ident, Info)] -> m (Map Ident Info)
buildAnyTree ModuleName
id [(Ident, Info)]
jments
                                      SourceModule -> P SourceModule
forall (m :: * -> *) a. Monad m => a -> m a
return (ModuleName
id, ModuleType
-> ModuleStatus
-> Options
-> [(ModuleName, MInclude)]
-> Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
-> [OpenSpec]
-> [ModuleName]
-> [Char]
-> Maybe (Array Int Sequence)
-> Map Ident Info
-> ModuleInfo
ModInfo ModuleType
mtype ModuleStatus
mstat Options
opts [(ModuleName, MInclude)]
extends Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
with [OpenSpec]
opens [] [Char]
"" Maybe (Array Int Sequence)
forall k1. Maybe k1
Nothing Map Ident Info
defs))}}})
	) (\SourceModule
r -> HappyAbsSyn -> P HappyAbsSyn
forall a. a -> P a
happyReturn (SourceModule -> HappyAbsSyn
happyIn10 SourceModule
r))

happyReduce_8 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_8 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_8 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
1# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_8
happyReduction_8 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_8 (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 -> ModuleStatus
happyOut12 HappyAbsSyn
happy_x_1 of { ModuleStatus
happy_var_1 -> 
	case HappyAbsSyn -> (ModuleType, ModuleName)
happyOut13 HappyAbsSyn
happy_x_2 of { (ModuleType, ModuleName)
happy_var_2 -> 
	case HappyAbsSyn
-> ([(ModuleName, MInclude)],
    Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
    [OpenSpec])
happyOut14 HappyAbsSyn
happy_x_4 of { ([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 [OpenSpec])
happy_var_4 -> 
	SourceModule -> HappyAbsSyn
happyIn11
		 (let { mstat :: ModuleStatus
mstat = ModuleStatus
happy_var_1 ;
                                               (ModuleType
mtype,ModuleName
id) = (ModuleType, ModuleName)
happy_var_2 ;
                                               ([(ModuleName, MInclude)]
extends,Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
with,[OpenSpec]
opens) = ([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 [OpenSpec])
happy_var_4 }
                                         in (ModuleName
id, ModuleType
-> ModuleStatus
-> Options
-> [(ModuleName, MInclude)]
-> Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
-> [OpenSpec]
-> [ModuleName]
-> [Char]
-> Maybe (Array Int Sequence)
-> Map Ident Info
-> ModuleInfo
ModInfo ModuleType
mtype ModuleStatus
mstat Options
noOptions [(ModuleName, MInclude)]
extends Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
with [OpenSpec]
opens [] [Char]
"" Maybe (Array Int Sequence)
forall k1. Maybe k1
Nothing Map Ident Info
forall k a. Map k a
Map.empty)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_9 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_9 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_9 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_0  Int#
2# HappyAbsSyn
happyReduction_9
happyReduction_9 :: HappyAbsSyn
happyReduction_9  =  ModuleStatus -> HappyAbsSyn
happyIn12
		 (ModuleStatus
MSComplete
	)

happyReduce_10 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_10 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_10 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
2# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_10
happyReduction_10 :: p -> HappyAbsSyn
happyReduction_10 p
happy_x_1
	 =  ModuleStatus -> HappyAbsSyn
happyIn12
		 (ModuleStatus
MSIncomplete
	)

happyReduce_11 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_11 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_11 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
3# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_11
happyReduction_11 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_11 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> ModuleName
happyOut98 HappyAbsSyn
happy_x_2 of { ModuleName
happy_var_2 -> 
	(ModuleType, ModuleName) -> HappyAbsSyn
happyIn13
		 ((ModuleType
MTAbstract,      ModuleName
happy_var_2)
	)}

happyReduce_12 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_12 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_12 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
3# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_12
happyReduction_12 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_12 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> ModuleName
happyOut98 HappyAbsSyn
happy_x_2 of { ModuleName
happy_var_2 -> 
	(ModuleType, ModuleName) -> HappyAbsSyn
happyIn13
		 ((ModuleType
MTResource,      ModuleName
happy_var_2)
	)}

happyReduce_13 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_13 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_13 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
3# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_13
happyReduction_13 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_13 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> ModuleName
happyOut98 HappyAbsSyn
happy_x_2 of { ModuleName
happy_var_2 -> 
	(ModuleType, ModuleName) -> HappyAbsSyn
happyIn13
		 ((ModuleType
MTInterface,     ModuleName
happy_var_2)
	)}

happyReduce_14 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_14 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_14 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
3# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_14
happyReduction_14 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_14 (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 -> ModuleName
happyOut98 HappyAbsSyn
happy_x_2 of { ModuleName
happy_var_2 -> 
	case HappyAbsSyn -> ModuleName
happyOut98 HappyAbsSyn
happy_x_4 of { ModuleName
happy_var_4 -> 
	(ModuleType, ModuleName) -> HappyAbsSyn
happyIn13
		 ((ModuleName -> ModuleType
MTConcrete ModuleName
happy_var_4,   ModuleName
happy_var_2)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_15 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_15 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_15 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
3# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_15
happyReduction_15 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_15 (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 -> ModuleName
happyOut98 HappyAbsSyn
happy_x_2 of { ModuleName
happy_var_2 -> 
	case HappyAbsSyn -> (ModuleName, MInclude)
happyOut24 HappyAbsSyn
happy_x_4 of { (ModuleName, MInclude)
happy_var_4 -> 
	(ModuleType, ModuleName) -> HappyAbsSyn
happyIn13
		 (((ModuleName, MInclude) -> ModuleType
MTInstance (ModuleName, MInclude)
happy_var_4,   ModuleName
happy_var_2)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_16 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_16 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_16 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
7# Int#
4# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_16
happyReduction_16 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_16 (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 -> [(ModuleName, MInclude)]
happyOut23 HappyAbsSyn
happy_x_1 of { [(ModuleName, MInclude)]
happy_var_1 -> 
	case HappyAbsSyn -> (ModuleName, MInclude)
happyOut24 HappyAbsSyn
happy_x_3 of { (ModuleName, MInclude)
happy_var_3 -> 
	case HappyAbsSyn -> [(ModuleName, ModuleName)]
happyOut21 HappyAbsSyn
happy_x_5 of { [(ModuleName, ModuleName)]
happy_var_5 -> 
	case HappyAbsSyn -> [OpenSpec]
happyOut15 HappyAbsSyn
happy_x_7 of { [OpenSpec]
happy_var_7 -> 
	([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 [OpenSpec])
-> HappyAbsSyn
happyIn14
		 (([(ModuleName, MInclude)]
happy_var_1, (ModuleName, MInclude, [(ModuleName, ModuleName)])
-> Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
forall k1. k1 -> Maybe k1
Just ((ModuleName, MInclude) -> ModuleName
forall a b. (a, b) -> a
fst (ModuleName, MInclude)
happy_var_3,(ModuleName, MInclude) -> MInclude
forall a b. (a, b) -> b
snd (ModuleName, MInclude)
happy_var_3,[(ModuleName, ModuleName)]
happy_var_5), [OpenSpec]
happy_var_7)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_17 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_17 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_17 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
4# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_17
happyReduction_17 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_17 (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 -> [(ModuleName, MInclude)]
happyOut23 HappyAbsSyn
happy_x_1 of { [(ModuleName, MInclude)]
happy_var_1 -> 
	case HappyAbsSyn -> (ModuleName, MInclude)
happyOut24 HappyAbsSyn
happy_x_3 of { (ModuleName, MInclude)
happy_var_3 -> 
	case HappyAbsSyn -> [(ModuleName, ModuleName)]
happyOut21 HappyAbsSyn
happy_x_5 of { [(ModuleName, ModuleName)]
happy_var_5 -> 
	([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 [OpenSpec])
-> HappyAbsSyn
happyIn14
		 (([(ModuleName, MInclude)]
happy_var_1, (ModuleName, MInclude, [(ModuleName, ModuleName)])
-> Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
forall k1. k1 -> Maybe k1
Just ((ModuleName, MInclude) -> ModuleName
forall a b. (a, b) -> a
fst (ModuleName, MInclude)
happy_var_3,(ModuleName, MInclude) -> MInclude
forall a b. (a, b) -> b
snd (ModuleName, MInclude)
happy_var_3,[(ModuleName, ModuleName)]
happy_var_5), [])
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_18 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_18 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_18 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
4# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_18
happyReduction_18 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_18 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(ModuleName, MInclude)]
happyOut23 HappyAbsSyn
happy_x_1 of { [(ModuleName, MInclude)]
happy_var_1 -> 
	case HappyAbsSyn -> [OpenSpec]
happyOut15 HappyAbsSyn
happy_x_3 of { [OpenSpec]
happy_var_3 -> 
	([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 [OpenSpec])
-> HappyAbsSyn
happyIn14
		 (([(ModuleName, MInclude)]
happy_var_1, Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
forall k1. Maybe k1
Nothing,                 [OpenSpec]
happy_var_3)
	)}}

happyReduce_19 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_19 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_19 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
4# HappyAbsSyn -> HappyAbsSyn
happyReduction_19
happyReduction_19 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_19 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(ModuleName, MInclude)]
happyOut23 HappyAbsSyn
happy_x_1 of { [(ModuleName, MInclude)]
happy_var_1 -> 
	([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 [OpenSpec])
-> HappyAbsSyn
happyIn14
		 (([(ModuleName, MInclude)]
happy_var_1, Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
forall k1. Maybe k1
Nothing,                 [])
	)}

happyReduce_20 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_20 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_20 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
4# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_20
happyReduction_20 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_20 (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 -> (ModuleName, MInclude)
happyOut24 HappyAbsSyn
happy_x_1 of { (ModuleName, MInclude)
happy_var_1 -> 
	case HappyAbsSyn -> [(ModuleName, ModuleName)]
happyOut21 HappyAbsSyn
happy_x_3 of { [(ModuleName, ModuleName)]
happy_var_3 -> 
	case HappyAbsSyn -> [OpenSpec]
happyOut15 HappyAbsSyn
happy_x_5 of { [OpenSpec]
happy_var_5 -> 
	([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 [OpenSpec])
-> HappyAbsSyn
happyIn14
		 (([], (ModuleName, MInclude, [(ModuleName, ModuleName)])
-> Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
forall k1. k1 -> Maybe k1
Just ((ModuleName, MInclude) -> ModuleName
forall a b. (a, b) -> a
fst (ModuleName, MInclude)
happy_var_1,(ModuleName, MInclude) -> MInclude
forall a b. (a, b) -> b
snd (ModuleName, MInclude)
happy_var_1,[(ModuleName, ModuleName)]
happy_var_3), [OpenSpec]
happy_var_5)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_21 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_21 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_21 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
4# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_21
happyReduction_21 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_21 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> (ModuleName, MInclude)
happyOut24 HappyAbsSyn
happy_x_1 of { (ModuleName, MInclude)
happy_var_1 -> 
	case HappyAbsSyn -> [(ModuleName, ModuleName)]
happyOut21 HappyAbsSyn
happy_x_3 of { [(ModuleName, ModuleName)]
happy_var_3 -> 
	([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 [OpenSpec])
-> HappyAbsSyn
happyIn14
		 (([], (ModuleName, MInclude, [(ModuleName, ModuleName)])
-> Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
forall k1. k1 -> Maybe k1
Just ((ModuleName, MInclude) -> ModuleName
forall a b. (a, b) -> a
fst (ModuleName, MInclude)
happy_var_1,(ModuleName, MInclude) -> MInclude
forall a b. (a, b) -> b
snd (ModuleName, MInclude)
happy_var_1,[(ModuleName, ModuleName)]
happy_var_3), [])
	)}}

happyReduce_22 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_22 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_22 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
4# HappyAbsSyn -> HappyAbsSyn
happyReduction_22
happyReduction_22 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_22 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [OpenSpec]
happyOut15 HappyAbsSyn
happy_x_1 of { [OpenSpec]
happy_var_1 -> 
	([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 [OpenSpec])
-> HappyAbsSyn
happyIn14
		 (([], Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
forall k1. Maybe k1
Nothing,                 [OpenSpec]
happy_var_1)
	)}

happyReduce_23 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_23 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_23 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_0  Int#
5# HappyAbsSyn
happyReduction_23
happyReduction_23 :: HappyAbsSyn
happyReduction_23  =  [OpenSpec] -> HappyAbsSyn
happyIn15
		 ([]
	)

happyReduce_24 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_24 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_24 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
5# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_24
happyReduction_24 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_24 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [OpenSpec]
happyOut19 HappyAbsSyn
happy_x_2 of { [OpenSpec]
happy_var_2 -> 
	[OpenSpec] -> HappyAbsSyn
happyIn15
		 ([OpenSpec]
happy_var_2
	)}

happyReduce_25 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_25 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_25 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
7# Int#
6# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_25
happyReduction_25 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_25 (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 -> [(ModuleName, MInclude)]
happyOut23 HappyAbsSyn
happy_x_1 of { [(ModuleName, MInclude)]
happy_var_1 -> 
	case HappyAbsSyn -> (ModuleName, MInclude)
happyOut24 HappyAbsSyn
happy_x_3 of { (ModuleName, MInclude)
happy_var_3 -> 
	case HappyAbsSyn -> [(ModuleName, ModuleName)]
happyOut21 HappyAbsSyn
happy_x_5 of { [(ModuleName, ModuleName)]
happy_var_5 -> 
	case HappyAbsSyn -> ([OpenSpec], [(Ident, Info)], Options)
happyOut17 HappyAbsSyn
happy_x_7 of { ([OpenSpec], [(Ident, Info)], Options)
happy_var_7 -> 
	([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 Maybe ([OpenSpec], [(Ident, Info)], Options))
-> HappyAbsSyn
happyIn16
		 (([(ModuleName, MInclude)]
happy_var_1, (ModuleName, MInclude, [(ModuleName, ModuleName)])
-> Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
forall k1. k1 -> Maybe k1
Just ((ModuleName, MInclude) -> ModuleName
forall a b. (a, b) -> a
fst (ModuleName, MInclude)
happy_var_3,(ModuleName, MInclude) -> MInclude
forall a b. (a, b) -> b
snd (ModuleName, MInclude)
happy_var_3,[(ModuleName, ModuleName)]
happy_var_5), ([OpenSpec], [(Ident, Info)], Options)
-> Maybe ([OpenSpec], [(Ident, Info)], Options)
forall k1. k1 -> Maybe k1
Just ([OpenSpec], [(Ident, Info)], Options)
happy_var_7)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_26 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_26 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_26 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
6# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_26
happyReduction_26 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_26 (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 -> [(ModuleName, MInclude)]
happyOut23 HappyAbsSyn
happy_x_1 of { [(ModuleName, MInclude)]
happy_var_1 -> 
	case HappyAbsSyn -> (ModuleName, MInclude)
happyOut24 HappyAbsSyn
happy_x_3 of { (ModuleName, MInclude)
happy_var_3 -> 
	case HappyAbsSyn -> [(ModuleName, ModuleName)]
happyOut21 HappyAbsSyn
happy_x_5 of { [(ModuleName, ModuleName)]
happy_var_5 -> 
	([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 Maybe ([OpenSpec], [(Ident, Info)], Options))
-> HappyAbsSyn
happyIn16
		 (([(ModuleName, MInclude)]
happy_var_1, (ModuleName, MInclude, [(ModuleName, ModuleName)])
-> Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
forall k1. k1 -> Maybe k1
Just ((ModuleName, MInclude) -> ModuleName
forall a b. (a, b) -> a
fst (ModuleName, MInclude)
happy_var_3,(ModuleName, MInclude) -> MInclude
forall a b. (a, b) -> b
snd (ModuleName, MInclude)
happy_var_3,[(ModuleName, ModuleName)]
happy_var_5), Maybe ([OpenSpec], [(Ident, Info)], Options)
forall k1. Maybe k1
Nothing)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_27 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_27 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_27 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
6# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_27
happyReduction_27 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_27 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(ModuleName, MInclude)]
happyOut23 HappyAbsSyn
happy_x_1 of { [(ModuleName, MInclude)]
happy_var_1 -> 
	case HappyAbsSyn -> ([OpenSpec], [(Ident, Info)], Options)
happyOut17 HappyAbsSyn
happy_x_3 of { ([OpenSpec], [(Ident, Info)], Options)
happy_var_3 -> 
	([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 Maybe ([OpenSpec], [(Ident, Info)], Options))
-> HappyAbsSyn
happyIn16
		 (([(ModuleName, MInclude)]
happy_var_1, Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
forall k1. Maybe k1
Nothing,                 ([OpenSpec], [(Ident, Info)], Options)
-> Maybe ([OpenSpec], [(Ident, Info)], Options)
forall k1. k1 -> Maybe k1
Just ([OpenSpec], [(Ident, Info)], Options)
happy_var_3)
	)}}

happyReduce_28 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_28 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_28 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
6# HappyAbsSyn -> HappyAbsSyn
happyReduction_28
happyReduction_28 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_28 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(ModuleName, MInclude)]
happyOut23 HappyAbsSyn
happy_x_1 of { [(ModuleName, MInclude)]
happy_var_1 -> 
	([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 Maybe ([OpenSpec], [(Ident, Info)], Options))
-> HappyAbsSyn
happyIn16
		 (([(ModuleName, MInclude)]
happy_var_1, Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
forall k1. Maybe k1
Nothing,                 Maybe ([OpenSpec], [(Ident, Info)], Options)
forall k1. Maybe k1
Nothing)
	)}

happyReduce_29 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_29 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_29 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
6# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_29
happyReduction_29 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_29 (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 -> (ModuleName, MInclude)
happyOut24 HappyAbsSyn
happy_x_1 of { (ModuleName, MInclude)
happy_var_1 -> 
	case HappyAbsSyn -> [(ModuleName, ModuleName)]
happyOut21 HappyAbsSyn
happy_x_3 of { [(ModuleName, ModuleName)]
happy_var_3 -> 
	case HappyAbsSyn -> ([OpenSpec], [(Ident, Info)], Options)
happyOut17 HappyAbsSyn
happy_x_5 of { ([OpenSpec], [(Ident, Info)], Options)
happy_var_5 -> 
	([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 Maybe ([OpenSpec], [(Ident, Info)], Options))
-> HappyAbsSyn
happyIn16
		 (([], (ModuleName, MInclude, [(ModuleName, ModuleName)])
-> Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
forall k1. k1 -> Maybe k1
Just ((ModuleName, MInclude) -> ModuleName
forall a b. (a, b) -> a
fst (ModuleName, MInclude)
happy_var_1,(ModuleName, MInclude) -> MInclude
forall a b. (a, b) -> b
snd (ModuleName, MInclude)
happy_var_1,[(ModuleName, ModuleName)]
happy_var_3), ([OpenSpec], [(Ident, Info)], Options)
-> Maybe ([OpenSpec], [(Ident, Info)], Options)
forall k1. k1 -> Maybe k1
Just ([OpenSpec], [(Ident, Info)], Options)
happy_var_5)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_30 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_30 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_30 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
6# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_30
happyReduction_30 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_30 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> (ModuleName, MInclude)
happyOut24 HappyAbsSyn
happy_x_1 of { (ModuleName, MInclude)
happy_var_1 -> 
	case HappyAbsSyn -> [(ModuleName, ModuleName)]
happyOut21 HappyAbsSyn
happy_x_3 of { [(ModuleName, ModuleName)]
happy_var_3 -> 
	([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 Maybe ([OpenSpec], [(Ident, Info)], Options))
-> HappyAbsSyn
happyIn16
		 (([], (ModuleName, MInclude, [(ModuleName, ModuleName)])
-> Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
forall k1. k1 -> Maybe k1
Just ((ModuleName, MInclude) -> ModuleName
forall a b. (a, b) -> a
fst (ModuleName, MInclude)
happy_var_1,(ModuleName, MInclude) -> MInclude
forall a b. (a, b) -> b
snd (ModuleName, MInclude)
happy_var_1,[(ModuleName, ModuleName)]
happy_var_3), Maybe ([OpenSpec], [(Ident, Info)], Options)
forall k1. Maybe k1
Nothing)
	)}}

happyReduce_31 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_31 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_31 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
6# HappyAbsSyn -> HappyAbsSyn
happyReduction_31
happyReduction_31 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_31 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> ([OpenSpec], [(Ident, Info)], Options)
happyOut17 HappyAbsSyn
happy_x_1 of { ([OpenSpec], [(Ident, Info)], Options)
happy_var_1 -> 
	([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 Maybe ([OpenSpec], [(Ident, Info)], Options))
-> HappyAbsSyn
happyIn16
		 (([], Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)])
forall k1. Maybe k1
Nothing,                 ([OpenSpec], [(Ident, Info)], Options)
-> Maybe ([OpenSpec], [(Ident, Info)], Options)
forall k1. k1 -> Maybe k1
Just ([OpenSpec], [(Ident, Info)], Options)
happy_var_1)
	)}

happyReduce_32 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_32 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_32 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
6# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_32
happyReduction_32 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_32 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn
-> ([(ModuleName, MInclude)],
    Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
    Maybe ([OpenSpec], [(Ident, Info)], Options))
happyOut16 HappyAbsSyn
happy_x_1 of { ([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 Maybe ([OpenSpec], [(Ident, Info)], Options))
happy_var_1 -> 
	([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 Maybe ([OpenSpec], [(Ident, Info)], Options))
-> HappyAbsSyn
happyIn16
		 (([(ModuleName, MInclude)],
 Maybe (ModuleName, MInclude, [(ModuleName, ModuleName)]),
 Maybe ([OpenSpec], [(Ident, Info)], Options))
happy_var_1
	)}

happyReduce_33 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_33 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_33 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
7# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_33
happyReduction_33 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_33 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [Either [(Ident, Info)] Options]
happyOut18 HappyAbsSyn
happy_x_2 of { [Either [(Ident, Info)] Options]
happy_var_2 -> 
	([OpenSpec], [(Ident, Info)], Options) -> HappyAbsSyn
happyIn17
		 (([],[(Ident, Info)
d | Left [(Ident, Info)]
ds <- [Either [(Ident, Info)] Options]
happy_var_2, (Ident, Info)
d <- [(Ident, Info)]
ds],[Options] -> Options
concatOptions [Options
o | Right Options
o <- [Either [(Ident, Info)] Options]
happy_var_2])
	)}

happyReduce_34 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_34 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_34 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
6# Int#
7# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_34
happyReduction_34 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_34 (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 -> [OpenSpec]
happyOut19 HappyAbsSyn
happy_x_2 of { [OpenSpec]
happy_var_2 -> 
	case HappyAbsSyn -> [Either [(Ident, Info)] Options]
happyOut18 HappyAbsSyn
happy_x_5 of { [Either [(Ident, Info)] Options]
happy_var_5 -> 
	([OpenSpec], [(Ident, Info)], Options) -> HappyAbsSyn
happyIn17
		 (([OpenSpec]
happy_var_2,[(Ident, Info)
d | Left [(Ident, Info)]
ds <- [Either [(Ident, Info)] Options]
happy_var_5, (Ident, Info)
d <- [(Ident, Info)]
ds],[Options] -> Options
concatOptions [Options
o | Right Options
o <- [Either [(Ident, Info)] Options]
happy_var_5])
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_35 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_35 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_35 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_0  Int#
8# HappyAbsSyn
happyReduction_35
happyReduction_35 :: HappyAbsSyn
happyReduction_35  =  [Either [(Ident, Info)] Options] -> HappyAbsSyn
happyIn18
		 ([]
	)

happyReduce_36 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_36 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_36 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
8# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_36
happyReduction_36 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_36 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Either [(Ident, Info)] Options
happyOut25 HappyAbsSyn
happy_x_1 of { Either [(Ident, Info)] Options
happy_var_1 -> 
	case HappyAbsSyn -> [Either [(Ident, Info)] Options]
happyOut18 HappyAbsSyn
happy_x_2 of { [Either [(Ident, Info)] Options]
happy_var_2 -> 
	[Either [(Ident, Info)] Options] -> HappyAbsSyn
happyIn18
		 (Either [(Ident, Info)] Options
happy_var_1 Either [(Ident, Info)] Options
-> [Either [(Ident, Info)] Options]
-> [Either [(Ident, Info)] Options]
forall k1. k1 -> [k1] -> [k1]
: [Either [(Ident, Info)] Options]
happy_var_2
	)}}

happyReduce_37 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_37 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_37 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
9# HappyAbsSyn -> HappyAbsSyn
happyReduction_37
happyReduction_37 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_37 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> OpenSpec
happyOut20 HappyAbsSyn
happy_x_1 of { OpenSpec
happy_var_1 -> 
	[OpenSpec] -> HappyAbsSyn
happyIn19
		 ([OpenSpec
happy_var_1]
	)}

happyReduce_38 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_38 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_38 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
9# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_38
happyReduction_38 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_38 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> OpenSpec
happyOut20 HappyAbsSyn
happy_x_1 of { OpenSpec
happy_var_1 -> 
	case HappyAbsSyn -> [OpenSpec]
happyOut19 HappyAbsSyn
happy_x_3 of { [OpenSpec]
happy_var_3 -> 
	[OpenSpec] -> HappyAbsSyn
happyIn19
		 (OpenSpec
happy_var_1 OpenSpec -> [OpenSpec] -> [OpenSpec]
forall k1. k1 -> [k1] -> [k1]
: [OpenSpec]
happy_var_3
	)}}

happyReduce_39 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_39 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_39 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
10# HappyAbsSyn -> HappyAbsSyn
happyReduction_39
happyReduction_39 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_39 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> ModuleName
happyOut98 HappyAbsSyn
happy_x_1 of { ModuleName
happy_var_1 -> 
	OpenSpec -> HappyAbsSyn
happyIn20
		 (ModuleName -> OpenSpec
OSimple ModuleName
happy_var_1
	)}

happyReduce_40 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_40 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_40 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
10# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_40
happyReduction_40 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_40 (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 -> ModuleName
happyOut98 HappyAbsSyn
happy_x_2 of { ModuleName
happy_var_2 -> 
	case HappyAbsSyn -> ModuleName
happyOut98 HappyAbsSyn
happy_x_4 of { ModuleName
happy_var_4 -> 
	OpenSpec -> HappyAbsSyn
happyIn20
		 (ModuleName -> ModuleName -> OpenSpec
OQualif ModuleName
happy_var_2 ModuleName
happy_var_4
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_41 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_41 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_41 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
happyReduction_41
happyReduction_41 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_41 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> (ModuleName, ModuleName)
happyOut22 HappyAbsSyn
happy_x_1 of { (ModuleName, ModuleName)
happy_var_1 -> 
	[(ModuleName, ModuleName)] -> HappyAbsSyn
happyIn21
		 ([(ModuleName, ModuleName)
happy_var_1]
	)}

happyReduce_42 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_42 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_42 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
11# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_42
happyReduction_42 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_42 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> (ModuleName, ModuleName)
happyOut22 HappyAbsSyn
happy_x_1 of { (ModuleName, ModuleName)
happy_var_1 -> 
	case HappyAbsSyn -> [(ModuleName, ModuleName)]
happyOut21 HappyAbsSyn
happy_x_3 of { [(ModuleName, ModuleName)]
happy_var_3 -> 
	[(ModuleName, ModuleName)] -> HappyAbsSyn
happyIn21
		 ((ModuleName, ModuleName)
happy_var_1 (ModuleName, ModuleName)
-> [(ModuleName, ModuleName)] -> [(ModuleName, ModuleName)]
forall k1. k1 -> [k1] -> [k1]
: [(ModuleName, ModuleName)]
happy_var_3
	)}}

happyReduce_43 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_43 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_43 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
12# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_43
happyReduction_43 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_43 (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 -> ModuleName
happyOut98 HappyAbsSyn
happy_x_2 of { ModuleName
happy_var_2 -> 
	case HappyAbsSyn -> ModuleName
happyOut98 HappyAbsSyn
happy_x_4 of { ModuleName
happy_var_4 -> 
	(ModuleName, ModuleName) -> HappyAbsSyn
happyIn22
		 ((ModuleName
happy_var_2,ModuleName
happy_var_4)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_44 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_44 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_44 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
13# HappyAbsSyn -> HappyAbsSyn
happyReduction_44
happyReduction_44 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_44 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> (ModuleName, MInclude)
happyOut24 HappyAbsSyn
happy_x_1 of { (ModuleName, MInclude)
happy_var_1 -> 
	[(ModuleName, MInclude)] -> HappyAbsSyn
happyIn23
		 ([(ModuleName, MInclude)
happy_var_1]
	)}

happyReduce_45 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_45 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_45 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
13# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_45
happyReduction_45 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_45 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> (ModuleName, MInclude)
happyOut24 HappyAbsSyn
happy_x_1 of { (ModuleName, MInclude)
happy_var_1 -> 
	case HappyAbsSyn -> [(ModuleName, MInclude)]
happyOut23 HappyAbsSyn
happy_x_3 of { [(ModuleName, MInclude)]
happy_var_3 -> 
	[(ModuleName, MInclude)] -> HappyAbsSyn
happyIn23
		 ((ModuleName, MInclude)
happy_var_1 (ModuleName, MInclude)
-> [(ModuleName, MInclude)] -> [(ModuleName, MInclude)]
forall k1. k1 -> [k1] -> [k1]
: [(ModuleName, MInclude)]
happy_var_3
	)}}

happyReduce_46 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_46 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_46 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
14# HappyAbsSyn -> HappyAbsSyn
happyReduction_46
happyReduction_46 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_46 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> ModuleName
happyOut98 HappyAbsSyn
happy_x_1 of { ModuleName
happy_var_1 -> 
	(ModuleName, MInclude) -> HappyAbsSyn
happyIn24
		 ((ModuleName
happy_var_1,MInclude
MIAll      )
	)}

happyReduce_47 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_47 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_47 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
14# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_47
happyReduction_47 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_47 (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 -> ModuleName
happyOut98 HappyAbsSyn
happy_x_1 of { ModuleName
happy_var_1 -> 
	case HappyAbsSyn -> [Ident]
happyOut47 HappyAbsSyn
happy_x_3 of { [Ident]
happy_var_3 -> 
	(ModuleName, MInclude) -> HappyAbsSyn
happyIn24
		 ((ModuleName
happy_var_1,[Ident] -> MInclude
MIOnly   [Ident]
happy_var_3)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_48 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_48 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_48 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
14# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_48
happyReduction_48 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_48 (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 -> ModuleName
happyOut98 HappyAbsSyn
happy_x_1 of { ModuleName
happy_var_1 -> 
	case HappyAbsSyn -> [Ident]
happyOut47 HappyAbsSyn
happy_x_4 of { [Ident]
happy_var_4 -> 
	(ModuleName, MInclude) -> HappyAbsSyn
happyIn24
		 ((ModuleName
happy_var_1,[Ident] -> MInclude
MIExcept [Ident]
happy_var_4)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_49 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_49 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_49 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
15# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_49
happyReduction_49 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_49 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut40 HappyAbsSyn
happy_x_2 of { [(Ident, Info)]
happy_var_2 -> 
	Either [(Ident, Info)] Options -> HappyAbsSyn
happyIn25
		 ([(Ident, Info)] -> Either [(Ident, Info)] Options
forall a b. a -> Either a b
Left  [(Ident, Info)]
happy_var_2
	)}

happyReduce_50 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_50 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_50 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
15# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_50
happyReduction_50 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_50 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut41 HappyAbsSyn
happy_x_2 of { [(Ident, Info)]
happy_var_2 -> 
	Either [(Ident, Info)] Options -> HappyAbsSyn
happyIn25
		 ([(Ident, Info)] -> Either [(Ident, Info)] Options
forall a b. a -> Either a b
Left  [(Ident, Info)]
happy_var_2
	)}

happyReduce_51 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_51 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_51 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
15# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_51
happyReduction_51 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_51 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut38 HappyAbsSyn
happy_x_2 of { [(Ident, Info)]
happy_var_2 -> 
	Either [(Ident, Info)] Options -> HappyAbsSyn
happyIn25
		 ([(Ident, Info)] -> Either [(Ident, Info)] Options
forall a b. a -> Either a b
Left  [(Ident, Info)]
happy_var_2
	)}

happyReduce_52 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_52 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_52 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
15# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_52
happyReduction_52 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_52 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut42 HappyAbsSyn
happy_x_2 of { [(Ident, Info)]
happy_var_2 -> 
	Either [(Ident, Info)] Options -> HappyAbsSyn
happyIn25
		 ([(Ident, Info)] -> Either [(Ident, Info)] Options
forall a b. a -> Either a b
Left  [(Ident, Info)]
happy_var_2
	)}

happyReduce_53 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_53 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_53 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
15# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_53
happyReduction_53 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_53 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut43 HappyAbsSyn
happy_x_2 of { [(Ident, Info)]
happy_var_2 -> 
	Either [(Ident, Info)] Options -> HappyAbsSyn
happyIn25
		 ([(Ident, Info)] -> Either [(Ident, Info)] Options
forall a b. a -> Either a b
Left  [(Ident, Info)]
happy_var_2
	)}

happyReduce_54 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_54 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_54 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
15# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_54
happyReduction_54 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_54 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut39 HappyAbsSyn
happy_x_2 of { [(Ident, Info)]
happy_var_2 -> 
	Either [(Ident, Info)] Options -> HappyAbsSyn
happyIn25
		 ([(Ident, Info)] -> Either [(Ident, Info)] Options
forall a b. a -> Either a b
Left  [(Ident, Info)]
happy_var_2
	)}

happyReduce_55 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_55 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_55 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
15# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_55
happyReduction_55 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_55 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, L Term)]
happyOut44 HappyAbsSyn
happy_x_2 of { [(Ident, L Term)]
happy_var_2 -> 
	Either [(Ident, Info)] Options -> HappyAbsSyn
happyIn25
		 ([(Ident, Info)] -> Either [(Ident, Info)] Options
forall a b. a -> Either a b
Left  [(Ident
f, Maybe (L Term)
-> Maybe (L Term)
-> Maybe (L Term)
-> Maybe (L Term)
-> Maybe PMCFG
-> Info
CncCat (L Term -> Maybe (L Term)
forall k1. k1 -> Maybe k1
Just L Term
e) Maybe (L Term)
forall k1. Maybe k1
Nothing  Maybe (L Term)
forall k1. Maybe k1
Nothing  Maybe (L Term)
forall k1. Maybe k1
Nothing Maybe PMCFG
forall k1. Maybe k1
Nothing) | (Ident
f,L Term
e) <- [(Ident, L Term)]
happy_var_2]
	)}

happyReduce_56 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_56 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_56 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
15# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_56
happyReduction_56 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_56 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, L Term)]
happyOut44 HappyAbsSyn
happy_x_2 of { [(Ident, L Term)]
happy_var_2 -> 
	Either [(Ident, Info)] Options -> HappyAbsSyn
happyIn25
		 ([(Ident, Info)] -> Either [(Ident, Info)] Options
forall a b. a -> Either a b
Left  [(Ident
f, Maybe (L Term)
-> Maybe (L Term)
-> Maybe (L Term)
-> Maybe (L Term)
-> Maybe PMCFG
-> Info
CncCat Maybe (L Term)
forall k1. Maybe k1
Nothing  (L Term -> Maybe (L Term)
forall k1. k1 -> Maybe k1
Just L Term
e) Maybe (L Term)
forall k1. Maybe k1
Nothing  Maybe (L Term)
forall k1. Maybe k1
Nothing Maybe PMCFG
forall k1. Maybe k1
Nothing) | (Ident
f,L Term
e) <- [(Ident, L Term)]
happy_var_2]
	)}

happyReduce_57 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_57 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_57 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
15# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_57
happyReduction_57 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_57 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, L Term)]
happyOut44 HappyAbsSyn
happy_x_2 of { [(Ident, L Term)]
happy_var_2 -> 
	Either [(Ident, Info)] Options -> HappyAbsSyn
happyIn25
		 ([(Ident, Info)] -> Either [(Ident, Info)] Options
forall a b. a -> Either a b
Left  [(Ident
f, Maybe (L Term)
-> Maybe (L Term)
-> Maybe (L Term)
-> Maybe (L Term)
-> Maybe PMCFG
-> Info
CncCat Maybe (L Term)
forall k1. Maybe k1
Nothing  Maybe (L Term)
forall k1. Maybe k1
Nothing  (L Term -> Maybe (L Term)
forall k1. k1 -> Maybe k1
Just L Term
e) Maybe (L Term)
forall k1. Maybe k1
Nothing Maybe PMCFG
forall k1. Maybe k1
Nothing) | (Ident
f,L Term
e) <- [(Ident, L Term)]
happy_var_2]
	)}

happyReduce_58 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_58 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_58 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
15# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_58
happyReduction_58 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_58 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut37 HappyAbsSyn
happy_x_2 of { [(Ident, Info)]
happy_var_2 -> 
	Either [(Ident, Info)] Options -> HappyAbsSyn
happyIn25
		 ([(Ident, Info)] -> Either [(Ident, Info)] Options
forall a b. a -> Either a b
Left  [(Ident, Info)]
happy_var_2
	)}

happyReduce_59 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_59 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_59 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
15# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. HappyAbsSyn -> p -> p -> HappyAbsSyn
happyReduction_59
happyReduction_59 :: HappyAbsSyn -> p -> p -> HappyAbsSyn
happyReduction_59 HappyAbsSyn
happy_x_3
	p
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, L Term)]
happyOut44 HappyAbsSyn
happy_x_3 of { [(Ident, L Term)]
happy_var_3 -> 
	Either [(Ident, Info)] Options -> HappyAbsSyn
happyIn25
		 ([(Ident, Info)] -> Either [(Ident, Info)] Options
forall a b. a -> Either a b
Left  [(Ident
f, Maybe (L Term)
-> Maybe (L Term)
-> Maybe (L Term)
-> Maybe (L Term)
-> Maybe PMCFG
-> Info
CncCat Maybe (L Term)
forall k1. Maybe k1
Nothing Maybe (L Term)
forall k1. Maybe k1
Nothing Maybe (L Term)
forall k1. Maybe k1
Nothing (L Term -> Maybe (L Term)
forall k1. k1 -> Maybe k1
Just L Term
e) Maybe PMCFG
forall k1. Maybe k1
Nothing) | (Ident
f,L Term
e) <- [(Ident, L Term)]
happy_var_3]
	)}

happyReduce_60 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_60 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_60 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
15# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. HappyAbsSyn -> p -> p -> HappyAbsSyn
happyReduction_60
happyReduction_60 :: HappyAbsSyn -> p -> p -> HappyAbsSyn
happyReduction_60 HappyAbsSyn
happy_x_3
	p
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, L Term)]
happyOut44 HappyAbsSyn
happy_x_3 of { [(Ident, L Term)]
happy_var_3 -> 
	Either [(Ident, Info)] Options -> HappyAbsSyn
happyIn25
		 ([(Ident, Info)] -> Either [(Ident, Info)] Options
forall a b. a -> Either a b
Left  [(Ident
f, Maybe (Ident, [Hypo], Term)
-> Maybe (L Term) -> Maybe (L Term) -> Maybe PMCFG -> Info
CncFun Maybe (Ident, [Hypo], Term)
forall k1. Maybe k1
Nothing Maybe (L Term)
forall k1. Maybe k1
Nothing (L Term -> Maybe (L Term)
forall k1. k1 -> Maybe k1
Just L Term
e) Maybe PMCFG
forall k1. Maybe k1
Nothing) | (Ident
f,L Term
e) <- [(Ident, L Term)]
happy_var_3]
	)}

happyReduce_61 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_61 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_61 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
15# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_61
happyReduction_61 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_61 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Options
happyOut45 HappyAbsSyn
happy_x_2 of { Options
happy_var_2 -> 
	Either [(Ident, Info)] Options -> HappyAbsSyn
happyIn25
		 (Options -> Either [(Ident, Info)] Options
forall a b. b -> Either a b
Right Options
happy_var_2
	)}

happyReduce_62 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_62 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_62 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
16# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_62
happyReduction_62 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_62 (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 -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { ((T_Ident   Ident
happy_var_2)) -> 
	case HappyAbsSyn -> [Hypo]
happyOut85 HappyAbsSyn
happy_x_3 of { [Hypo]
happy_var_3 -> 
	case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_4 of { Posn
happy_var_4 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn26
		 ([(Ident
happy_var_2, Maybe (L [Hypo]) -> Info
AbsCat (L [Hypo] -> Maybe (L [Hypo])
forall k1. k1 -> Maybe k1
Just (Posn -> Posn -> [Hypo] -> L [Hypo]
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_4 [Hypo]
happy_var_3)))]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_63 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_63 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_63 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
6# Int#
16# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_63
happyReduction_63 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_63 (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 -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { ((T_Ident   Ident
happy_var_3)) -> 
	case HappyAbsSyn -> [Hypo]
happyOut85 HappyAbsSyn
happy_x_4 of { [Hypo]
happy_var_4 -> 
	case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_6 of { Posn
happy_var_6 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn26
		 (L (Ident, [Hypo], Int) -> [(Ident, Info)]
listCatDef (Posn -> Posn -> (Ident, [Hypo], Int) -> L (Ident, [Hypo], Int)
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_6 (Ident
happy_var_3,[Hypo]
happy_var_4,Int
0))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_64 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_64 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_64 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
9# Int#
16# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_64
happyReduction_64 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_64 (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 -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { ((T_Ident   Ident
happy_var_3)) -> 
	case HappyAbsSyn -> [Hypo]
happyOut85 HappyAbsSyn
happy_x_4 of { [Hypo]
happy_var_4 -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_7 of { ((T_Integer Int
happy_var_7)) -> 
	case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_9 of { Posn
happy_var_9 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn26
		 (L (Ident, [Hypo], Int) -> [(Ident, Info)]
listCatDef (Posn -> Posn -> (Ident, [Hypo], Int) -> L (Ident, [Hypo], Int)
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_9 (Ident
happy_var_3,[Hypo]
happy_var_4,Int -> Int
forall a b. (Integral a, Num b) => a -> b
fromIntegral Int
happy_var_7))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}

happyReduce_65 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_65 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_65 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
17# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_65
happyReduction_65 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_65 (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 -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> [Ident]
happyOut47 HappyAbsSyn
happy_x_2 of { [Ident]
happy_var_2 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_4 of { Term
happy_var_4 -> 
	case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_5 of { Posn
happy_var_5 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn27
		 ([(Ident
fun, Maybe (L Term)
-> Maybe Int -> Maybe [L Equation] -> Maybe Bool -> Info
AbsFun (L Term -> Maybe (L Term)
forall k1. k1 -> Maybe k1
Just (Posn -> Posn -> Term -> L Term
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_5 Term
happy_var_4)) Maybe Int
forall k1. Maybe k1
Nothing ([L Equation] -> Maybe [L Equation]
forall k1. k1 -> Maybe k1
Just []) (Bool -> Maybe Bool
forall k1. k1 -> Maybe k1
Just Bool
True)) | Ident
fun <- [Ident]
happy_var_2]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_66 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_66 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_66 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
18# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_66
happyReduction_66 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_66 (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 -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> [Ident]
happyOut51 HappyAbsSyn
happy_x_2 of { [Ident]
happy_var_2 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_4 of { Term
happy_var_4 -> 
	case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_5 of { Posn
happy_var_5 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn28
		 ([(Ident
f, Maybe (L Term)
-> Maybe Int -> Maybe [L Equation] -> Maybe Bool -> Info
AbsFun Maybe (L Term)
forall k1. Maybe k1
Nothing (Int -> Maybe Int
forall k1. k1 -> Maybe k1
Just Int
0)           ([L Equation] -> Maybe [L Equation]
forall k1. k1 -> Maybe k1
Just [Posn -> Posn -> Equation -> L Equation
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_5 ([],Term
happy_var_4)]) Maybe Bool
forall k1. Maybe k1
Nothing) | Ident
f <- [Ident]
happy_var_2]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_67 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_67 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_67 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
6# Int#
18# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_67
happyReduction_67 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_67 (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 -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> Ident
happyOut50 HappyAbsSyn
happy_x_2 of { Ident
happy_var_2 -> 
	case HappyAbsSyn -> [Patt]
happyOut71 HappyAbsSyn
happy_x_3 of { [Patt]
happy_var_3 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_5 of { Term
happy_var_5 -> 
	case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_6 of { Posn
happy_var_6 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn28
		 ([(Ident
happy_var_2,Maybe (L Term)
-> Maybe Int -> Maybe [L Equation] -> Maybe Bool -> Info
AbsFun Maybe (L Term)
forall k1. Maybe k1
Nothing (Int -> Maybe Int
forall k1. k1 -> Maybe k1
Just ([Patt] -> Int
forall (t :: * -> *) a. Foldable t => t a -> Int
length [Patt]
happy_var_3)) ([L Equation] -> Maybe [L Equation]
forall k1. k1 -> Maybe k1
Just [Posn -> Posn -> Equation -> L Equation
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_6 ([Patt]
happy_var_3,Term
happy_var_5)]) Maybe Bool
forall k1. Maybe k1
Nothing)]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}

happyReduce_68 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_68 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_68 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
19# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_68
happyReduction_68 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_68 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { ((T_Ident   Ident
happy_var_2)) -> 
	case HappyAbsSyn -> [Ident]
happyOut35 HappyAbsSyn
happy_x_4 of { [Ident]
happy_var_4 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn29
		 ((Ident
happy_var_2,   Maybe (L [Hypo]) -> Info
AbsCat Maybe (L [Hypo])
forall k1. Maybe k1
Nothing) (Ident, Info) -> [(Ident, Info)] -> [(Ident, Info)]
forall k1. k1 -> [k1] -> [k1]
:
                                         [(Ident
fun, Maybe (L Term)
-> Maybe Int -> Maybe [L Equation] -> Maybe Bool -> Info
AbsFun Maybe (L Term)
forall k1. Maybe k1
Nothing Maybe Int
forall k1. Maybe k1
Nothing Maybe [L Equation]
forall k1. Maybe k1
Nothing  (Bool -> Maybe Bool
forall k1. k1 -> Maybe k1
Just Bool
True)) | Ident
fun <- [Ident]
happy_var_4]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_69 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_69 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_69 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
19# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_69
happyReduction_69 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_69 (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 -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> [Ident]
happyOut47 HappyAbsSyn
happy_x_2 of { [Ident]
happy_var_2 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_4 of { Term
happy_var_4 -> 
	case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_5 of { Posn
happy_var_5 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn29
		 (-- (snd (valCat happy_var_4), AbsCat Nothing) :
                                         [(Ident
fun, Maybe (L Term)
-> Maybe Int -> Maybe [L Equation] -> Maybe Bool -> Info
AbsFun (L Term -> Maybe (L Term)
forall k1. k1 -> Maybe k1
Just (Posn -> Posn -> Term -> L Term
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_5 Term
happy_var_4)) Maybe Int
forall k1. Maybe k1
Nothing Maybe [L Equation]
forall k1. Maybe k1
Nothing (Bool -> Maybe Bool
forall k1. k1 -> Maybe k1
Just Bool
True)) | Ident
fun <- [Ident]
happy_var_2]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_70 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_70 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_70 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
20# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_70
happyReduction_70 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_70 (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 -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> Ident
happyOut49 HappyAbsSyn
happy_x_2 of { Ident
happy_var_2 -> 
	case HappyAbsSyn -> [L Param]
happyOut46 HappyAbsSyn
happy_x_4 of { [L Param]
happy_var_4 -> 
	case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_5 of { Posn
happy_var_5 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn30
		 ((Ident
happy_var_2, Maybe (L [Param]) -> Maybe [Term] -> Info
ResParam (L [Param] -> Maybe (L [Param])
forall k1. k1 -> Maybe k1
Just (Posn -> Posn -> [Param] -> L [Param]
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_5 [Param
param | L Location
loc Param
param <- [L Param]
happy_var_4])) Maybe [Term]
forall k1. Maybe k1
Nothing) (Ident, Info) -> [(Ident, Info)] -> [(Ident, Info)]
forall k1. k1 -> [k1] -> [k1]
:
                                        [(Ident
f, L Term -> Info
ResValue (Location -> Term -> L Term
forall a. Location -> a -> L a
L Location
loc ([Hypo] -> Term -> Term
mkProdSimple [Hypo]
co (Ident -> Term
Cn Ident
happy_var_2)))) | L Location
loc (Ident
f,[Hypo]
co) <- [L Param]
happy_var_4]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_71 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_71 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_71 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
20# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_71
happyReduction_71 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_71 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Ident
happyOut49 HappyAbsSyn
happy_x_2 of { Ident
happy_var_2 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn30
		 ([(Ident
happy_var_2, Maybe (L [Param]) -> Maybe [Term] -> Info
ResParam Maybe (L [Param])
forall k1. Maybe k1
Nothing Maybe [Term]
forall k1. Maybe k1
Nothing)]
	)}

happyReduce_72 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_72 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_72 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
21# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_72
happyReduction_72 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_72 (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 -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> [Ident]
happyOut51 HappyAbsSyn
happy_x_2 of { [Ident]
happy_var_2 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_4 of { Term
happy_var_4 -> 
	case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_5 of { Posn
happy_var_5 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn31
		 ([(Ident
i, Info
info) | Ident
i <- [Ident]
happy_var_2,   Info
info <- Maybe (L Term) -> Maybe (L Term) -> [Info]
mkOverload (L Term -> Maybe (L Term)
forall k1. k1 -> Maybe k1
Just (Posn -> Posn -> Term -> L Term
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_5 Term
happy_var_4)) Maybe (L Term)
forall k1. Maybe k1
Nothing  ]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_73 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_73 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_73 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
21# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_73
happyReduction_73 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_73 (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 -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> [Ident]
happyOut51 HappyAbsSyn
happy_x_2 of { [Ident]
happy_var_2 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_4 of { Term
happy_var_4 -> 
	case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_5 of { Posn
happy_var_5 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn31
		 ([(Ident
i, Info
info) | Ident
i <- [Ident]
happy_var_2,   Info
info <- Maybe (L Term) -> Maybe (L Term) -> [Info]
mkOverload Maybe (L Term)
forall k1. Maybe k1
Nothing   (L Term -> Maybe (L Term)
forall k1. k1 -> Maybe k1
Just (Posn -> Posn -> Term -> L Term
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_5 Term
happy_var_4))]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_74 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_74 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_74 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
6# Int#
21# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_74
happyReduction_74 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_74 (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 -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> Ident
happyOut50 HappyAbsSyn
happy_x_2 of { Ident
happy_var_2 -> 
	case HappyAbsSyn -> [(BindType, Ident)]
happyOut74 HappyAbsSyn
happy_x_3 of { [(BindType, Ident)]
happy_var_3 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_5 of { Term
happy_var_5 -> 
	case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_6 of { Posn
happy_var_6 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn31
		 ([(Ident
i, Info
info) | Ident
i <- [Ident
happy_var_2], Info
info <- Maybe (L Term) -> Maybe (L Term) -> [Info]
mkOverload Maybe (L Term)
forall k1. Maybe k1
Nothing   (L Term -> Maybe (L Term)
forall k1. k1 -> Maybe k1
Just (Posn -> Posn -> Term -> L Term
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_6 ([(BindType, Ident)] -> Term -> Term
mkAbs [(BindType, Ident)]
happy_var_3 Term
happy_var_5)))]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}

happyReduce_75 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_75 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_75 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
7# Int#
21# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_75
happyReduction_75 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_75 (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 -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> [Ident]
happyOut51 HappyAbsSyn
happy_x_2 of { [Ident]
happy_var_2 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_4 of { Term
happy_var_4 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_6 of { Term
happy_var_6 -> 
	case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_7 of { Posn
happy_var_7 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn31
		 ([(Ident
i, Info
info) | Ident
i <- [Ident]
happy_var_2,   Info
info <- Maybe (L Term) -> Maybe (L Term) -> [Info]
mkOverload (L Term -> Maybe (L Term)
forall k1. k1 -> Maybe k1
Just (Posn -> Posn -> Term -> L Term
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_7 Term
happy_var_4)) (L Term -> Maybe (L Term)
forall k1. k1 -> Maybe k1
Just (Posn -> Posn -> Term -> L Term
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_7 Term
happy_var_6))]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}

happyReduce_76 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_76 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_76 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
22# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_76
happyReduction_76 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_76 (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 -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> [Ident]
happyOut51 HappyAbsSyn
happy_x_2 of { [Ident]
happy_var_2 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_4 of { Term
happy_var_4 -> 
	case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_5 of { Posn
happy_var_5 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn32
		 ([(Ident
f,  Maybe (Ident, [Hypo], Term)
-> Maybe (L Term) -> Maybe (L Term) -> Maybe PMCFG -> Info
CncFun Maybe (Ident, [Hypo], Term)
forall k1. Maybe k1
Nothing (L Term -> Maybe (L Term)
forall k1. k1 -> Maybe k1
Just (Posn -> Posn -> Term -> L Term
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_5 Term
happy_var_4)) Maybe (L Term)
forall k1. Maybe k1
Nothing Maybe PMCFG
forall k1. Maybe k1
Nothing) | Ident
f <- [Ident]
happy_var_2]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_77 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_77 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_77 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
6# Int#
22# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_77
happyReduction_77 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_77 (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 -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> Ident
happyOut50 HappyAbsSyn
happy_x_2 of { Ident
happy_var_2 -> 
	case HappyAbsSyn -> [(BindType, Ident)]
happyOut74 HappyAbsSyn
happy_x_3 of { [(BindType, Ident)]
happy_var_3 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_5 of { Term
happy_var_5 -> 
	case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_6 of { Posn
happy_var_6 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn32
		 ([(Ident
happy_var_2, Maybe (Ident, [Hypo], Term)
-> Maybe (L Term) -> Maybe (L Term) -> Maybe PMCFG -> Info
CncFun Maybe (Ident, [Hypo], Term)
forall k1. Maybe k1
Nothing (L Term -> Maybe (L Term)
forall k1. k1 -> Maybe k1
Just (Posn -> Posn -> Term -> L Term
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_6 ([(BindType, Ident)] -> Term -> Term
mkAbs [(BindType, Ident)]
happy_var_3 Term
happy_var_5))) Maybe (L Term)
forall k1. Maybe k1
Nothing Maybe PMCFG
forall k1. Maybe k1
Nothing)]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}

happyReduce_78 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_78 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_78 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
23# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_78
happyReduction_78 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_78 (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 -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> [Ident]
happyOut51 HappyAbsSyn
happy_x_2 of { [Ident]
happy_var_2 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_4 of { Term
happy_var_4 -> 
	case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_5 of { Posn
happy_var_5 -> 
	[(Ident, L Term)] -> HappyAbsSyn
happyIn33
		 ([(Ident
i,Posn -> Posn -> Term -> L Term
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_5 Term
happy_var_4) | Ident
i <- [Ident]
happy_var_2]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_79 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_79 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_79 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyMonadReduce Int#
5# Int#
24# HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn
forall p. HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_79
happyReduction_79 :: HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_79 (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) p
tk
	 = P Options -> (Options -> P HappyAbsSyn) -> P HappyAbsSyn
forall a b. P a -> (a -> P b) -> P b
happyThen ((case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { ((T_Ident   Ident
happy_var_2)) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_4 of { ((T_Ident   Ident
happy_var_4)) -> 
	( case [[Char]] -> Err Options
forall (err :: * -> *). ErrorMonad err => [[Char]] -> err Options
parseModuleOptions [[Char]
"--" [Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ Ident -> [Char]
showIdent Ident
happy_var_2 [Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ [Char]
"=" [Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ Ident -> [Char]
showIdent Ident
happy_var_4] of
                                    Ok  Options
x   -> Options -> P Options
forall (m :: * -> *) a. Monad m => a -> m a
return Options
x
                                    Bad [Char]
msg -> Posn -> [Char] -> P Options
forall a. Posn -> [Char] -> P a
failLoc Posn
happy_var_1 [Char]
msg)}}})
	) (\Options
r -> HappyAbsSyn -> P HappyAbsSyn
forall a. a -> P a
happyReturn (Options -> HappyAbsSyn
happyIn34 Options
r))

happyReduce_80 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_80 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_80 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyMonadReduce Int#
5# Int#
24# HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn
forall p. HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_80
happyReduction_80 :: HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_80 (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) p
tk
	 = P Options -> (Options -> P HappyAbsSyn) -> P HappyAbsSyn
forall a b. P a -> (a -> P b) -> P b
happyThen ((case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { ((T_Ident   Ident
happy_var_2)) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_4 of { ((T_Double  Double
happy_var_4)) -> 
	( case [[Char]] -> Err Options
forall (err :: * -> *). ErrorMonad err => [[Char]] -> err Options
parseModuleOptions [[Char]
"--" [Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ Ident -> [Char]
showIdent Ident
happy_var_2 [Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ [Char]
"=" [Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ Double -> [Char]
forall a. Show a => a -> [Char]
show Double
happy_var_4] of
                                    Ok  Options
x   -> Options -> P Options
forall (m :: * -> *) a. Monad m => a -> m a
return Options
x
                                    Bad [Char]
msg -> Posn -> [Char] -> P Options
forall a. Posn -> [Char] -> P a
failLoc Posn
happy_var_1 [Char]
msg)}}})
	) (\Options
r -> HappyAbsSyn -> P HappyAbsSyn
forall a. a -> P a
happyReturn (Options -> HappyAbsSyn
happyIn34 Options
r))

happyReduce_81 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_81 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_81 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
25# HappyAbsSyn -> HappyAbsSyn
happyReduction_81
happyReduction_81 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_81 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	[Ident] -> HappyAbsSyn
happyIn35
		 ([Ident
happy_var_1]
	)}

happyReduce_82 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_82 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_82 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
25# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_82
happyReduction_82 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_82 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	case HappyAbsSyn -> [Ident]
happyOut35 HappyAbsSyn
happy_x_3 of { [Ident]
happy_var_3 -> 
	[Ident] -> HappyAbsSyn
happyIn35
		 (Ident
happy_var_1 Ident -> [Ident] -> [Ident]
forall k1. k1 -> [k1] -> [k1]
: [Ident]
happy_var_3
	)}}

happyReduce_83 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_83 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_83 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
26# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_83
happyReduction_83 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_83 (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 -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { ((T_Ident   Ident
happy_var_2)) -> 
	case HappyAbsSyn -> [Hypo]
happyOut85 HappyAbsSyn
happy_x_3 of { [Hypo]
happy_var_3 -> 
	case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_4 of { Posn
happy_var_4 -> 
	L Param -> HappyAbsSyn
happyIn36
		 (Posn -> Posn -> Param -> L Param
forall x. Posn -> Posn -> x -> L x
mkL Posn
happy_var_1 Posn
happy_var_4 (Ident
happy_var_2,[Hypo]
happy_var_3)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_84 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_84 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_84 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
27# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_84
happyReduction_84 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_84 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut32 HappyAbsSyn
happy_x_1 of { [(Ident, Info)]
happy_var_1 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn37
		 ([(Ident, Info)]
happy_var_1
	)}

happyReduce_85 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_85 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_85 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
27# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_85
happyReduction_85 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_85 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut32 HappyAbsSyn
happy_x_1 of { [(Ident, Info)]
happy_var_1 -> 
	case HappyAbsSyn -> [(Ident, Info)]
happyOut37 HappyAbsSyn
happy_x_3 of { [(Ident, Info)]
happy_var_3 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn37
		 ([(Ident, Info)]
happy_var_1 [(Ident, Info)] -> [(Ident, Info)] -> [(Ident, Info)]
forall a. [a] -> [a] -> [a]
++ [(Ident, Info)]
happy_var_3
	)}}

happyReduce_86 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_86 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_86 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
28# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_86
happyReduction_86 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_86 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut28 HappyAbsSyn
happy_x_1 of { [(Ident, Info)]
happy_var_1 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn38
		 ([(Ident, Info)]
happy_var_1
	)}

happyReduce_87 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_87 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_87 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
28# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_87
happyReduction_87 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_87 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut28 HappyAbsSyn
happy_x_1 of { [(Ident, Info)]
happy_var_1 -> 
	case HappyAbsSyn -> [(Ident, Info)]
happyOut38 HappyAbsSyn
happy_x_3 of { [(Ident, Info)]
happy_var_3 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn38
		 ([(Ident, Info)]
happy_var_1 [(Ident, Info)] -> [(Ident, Info)] -> [(Ident, Info)]
forall a. [a] -> [a] -> [a]
++ [(Ident, Info)]
happy_var_3
	)}}

happyReduce_88 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_88 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_88 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
29# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_88
happyReduction_88 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_88 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut31 HappyAbsSyn
happy_x_1 of { [(Ident, Info)]
happy_var_1 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn39
		 ([(Ident, Info)]
happy_var_1
	)}

happyReduce_89 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_89 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_89 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
29# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_89
happyReduction_89 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_89 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut31 HappyAbsSyn
happy_x_1 of { [(Ident, Info)]
happy_var_1 -> 
	case HappyAbsSyn -> [(Ident, Info)]
happyOut39 HappyAbsSyn
happy_x_3 of { [(Ident, Info)]
happy_var_3 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn39
		 ([(Ident, Info)]
happy_var_1 [(Ident, Info)] -> [(Ident, Info)] -> [(Ident, Info)]
forall a. [a] -> [a] -> [a]
++ [(Ident, Info)]
happy_var_3
	)}}

happyReduce_90 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_90 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_90 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
30# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_90
happyReduction_90 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_90 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut26 HappyAbsSyn
happy_x_1 of { [(Ident, Info)]
happy_var_1 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn40
		 ([(Ident, Info)]
happy_var_1
	)}

happyReduce_91 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_91 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_91 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
30# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_91
happyReduction_91 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_91 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut26 HappyAbsSyn
happy_x_1 of { [(Ident, Info)]
happy_var_1 -> 
	case HappyAbsSyn -> [(Ident, Info)]
happyOut40 HappyAbsSyn
happy_x_3 of { [(Ident, Info)]
happy_var_3 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn40
		 ([(Ident, Info)]
happy_var_1 [(Ident, Info)] -> [(Ident, Info)] -> [(Ident, Info)]
forall a. [a] -> [a] -> [a]
++ [(Ident, Info)]
happy_var_3
	)}}

happyReduce_92 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_92 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_92 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
31# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_92
happyReduction_92 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_92 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut27 HappyAbsSyn
happy_x_1 of { [(Ident, Info)]
happy_var_1 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn41
		 ([(Ident, Info)]
happy_var_1
	)}

happyReduce_93 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_93 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_93 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
31# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_93
happyReduction_93 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_93 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut27 HappyAbsSyn
happy_x_1 of { [(Ident, Info)]
happy_var_1 -> 
	case HappyAbsSyn -> [(Ident, Info)]
happyOut41 HappyAbsSyn
happy_x_3 of { [(Ident, Info)]
happy_var_3 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn41
		 ([(Ident, Info)]
happy_var_1 [(Ident, Info)] -> [(Ident, Info)] -> [(Ident, Info)]
forall a. [a] -> [a] -> [a]
++ [(Ident, Info)]
happy_var_3
	)}}

happyReduce_94 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_94 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_94 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
32# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_94
happyReduction_94 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_94 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut29 HappyAbsSyn
happy_x_1 of { [(Ident, Info)]
happy_var_1 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn42
		 ([(Ident, Info)]
happy_var_1
	)}

happyReduce_95 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_95 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_95 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
32# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_95
happyReduction_95 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_95 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut29 HappyAbsSyn
happy_x_1 of { [(Ident, Info)]
happy_var_1 -> 
	case HappyAbsSyn -> [(Ident, Info)]
happyOut42 HappyAbsSyn
happy_x_3 of { [(Ident, Info)]
happy_var_3 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn42
		 ([(Ident, Info)]
happy_var_1 [(Ident, Info)] -> [(Ident, Info)] -> [(Ident, Info)]
forall a. [a] -> [a] -> [a]
++ [(Ident, Info)]
happy_var_3
	)}}

happyReduce_96 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_96 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_96 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
33# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_96
happyReduction_96 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_96 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut30 HappyAbsSyn
happy_x_1 of { [(Ident, Info)]
happy_var_1 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn43
		 ([(Ident, Info)]
happy_var_1
	)}

happyReduce_97 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_97 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_97 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
33# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_97
happyReduction_97 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_97 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Info)]
happyOut30 HappyAbsSyn
happy_x_1 of { [(Ident, Info)]
happy_var_1 -> 
	case HappyAbsSyn -> [(Ident, Info)]
happyOut43 HappyAbsSyn
happy_x_3 of { [(Ident, Info)]
happy_var_3 -> 
	[(Ident, Info)] -> HappyAbsSyn
happyIn43
		 ([(Ident, Info)]
happy_var_1 [(Ident, Info)] -> [(Ident, Info)] -> [(Ident, Info)]
forall a. [a] -> [a] -> [a]
++ [(Ident, Info)]
happy_var_3
	)}}

happyReduce_98 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_98 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_98 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
34# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_98
happyReduction_98 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_98 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, L Term)]
happyOut33 HappyAbsSyn
happy_x_1 of { [(Ident, L Term)]
happy_var_1 -> 
	[(Ident, L Term)] -> HappyAbsSyn
happyIn44
		 ([(Ident, L Term)]
happy_var_1
	)}

happyReduce_99 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_99 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_99 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
34# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_99
happyReduction_99 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_99 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, L Term)]
happyOut33 HappyAbsSyn
happy_x_1 of { [(Ident, L Term)]
happy_var_1 -> 
	case HappyAbsSyn -> [(Ident, L Term)]
happyOut44 HappyAbsSyn
happy_x_3 of { [(Ident, L Term)]
happy_var_3 -> 
	[(Ident, L Term)] -> HappyAbsSyn
happyIn44
		 ([(Ident, L Term)]
happy_var_1 [(Ident, L Term)] -> [(Ident, L Term)] -> [(Ident, L Term)]
forall a. [a] -> [a] -> [a]
++ [(Ident, L Term)]
happy_var_3
	)}}

happyReduce_100 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_100 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_100 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
35# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_100
happyReduction_100 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_100 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Options
happyOut34 HappyAbsSyn
happy_x_1 of { Options
happy_var_1 -> 
	Options -> HappyAbsSyn
happyIn45
		 (Options
happy_var_1
	)}

happyReduce_101 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_101 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_101 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
35# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_101
happyReduction_101 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_101 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Options
happyOut34 HappyAbsSyn
happy_x_1 of { Options
happy_var_1 -> 
	case HappyAbsSyn -> Options
happyOut45 HappyAbsSyn
happy_x_3 of { Options
happy_var_3 -> 
	Options -> HappyAbsSyn
happyIn45
		 (Options -> Options -> Options
addOptions Options
happy_var_1 Options
happy_var_3
	)}}

happyReduce_102 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_102 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_102 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
36# HappyAbsSyn -> HappyAbsSyn
happyReduction_102
happyReduction_102 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_102 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> L Param
happyOut36 HappyAbsSyn
happy_x_1 of { L Param
happy_var_1 -> 
	[L Param] -> HappyAbsSyn
happyIn46
		 ([L Param
happy_var_1]
	)}

happyReduce_103 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_103 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_103 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
36# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_103
happyReduction_103 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_103 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> L Param
happyOut36 HappyAbsSyn
happy_x_1 of { L Param
happy_var_1 -> 
	case HappyAbsSyn -> [L Param]
happyOut46 HappyAbsSyn
happy_x_3 of { [L Param]
happy_var_3 -> 
	[L Param] -> HappyAbsSyn
happyIn46
		 (L Param
happy_var_1 L Param -> [L Param] -> [L Param]
forall k1. k1 -> [k1] -> [k1]
: [L Param]
happy_var_3
	)}}

happyReduce_104 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_104 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_104 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
37# HappyAbsSyn -> HappyAbsSyn
happyReduction_104
happyReduction_104 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_104 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	[Ident] -> HappyAbsSyn
happyIn47
		 ([Ident
happy_var_1]
	)}

happyReduce_105 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_105 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_105 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
37# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_105
happyReduction_105 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_105 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	case HappyAbsSyn -> [Ident]
happyOut47 HappyAbsSyn
happy_x_3 of { [Ident]
happy_var_3 -> 
	[Ident] -> HappyAbsSyn
happyIn47
		 (Ident
happy_var_1 Ident -> [Ident] -> [Ident]
forall k1. k1 -> [k1] -> [k1]
: [Ident]
happy_var_3
	)}}

happyReduce_106 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_106 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_106 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
38# HappyAbsSyn -> HappyAbsSyn
happyReduction_106
happyReduction_106 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_106 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	[Ident] -> HappyAbsSyn
happyIn48
		 ([Ident
happy_var_1]
	)}

happyReduce_107 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_107 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_107 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
38# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_107
happyReduction_107 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_107 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	case HappyAbsSyn -> [Ident]
happyOut48 HappyAbsSyn
happy_x_2 of { [Ident]
happy_var_2 -> 
	[Ident] -> HappyAbsSyn
happyIn48
		 (Ident
happy_var_1 Ident -> [Ident] -> [Ident]
forall k1. k1 -> [k1] -> [k1]
: [Ident]
happy_var_2
	)}}

happyReduce_108 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_108 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_108 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
39# HappyAbsSyn -> HappyAbsSyn
happyReduction_108
happyReduction_108 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_108 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	Ident -> HappyAbsSyn
happyIn49
		 (Ident
happy_var_1
	)}

happyReduce_109 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_109 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_109 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyMonadReduce Int#
2# Int#
39# HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn
forall p. HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_109
happyReduction_109 :: HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_109 (HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest) p
tk
	 = P Ident -> (Ident -> P HappyAbsSyn) -> P HappyAbsSyn
forall a b. P a -> (a -> P b) -> P b
happyThen ((case HappyAbsSyn -> Posn
happyOut99 HappyAbsSyn
happy_x_1 of { Posn
happy_var_1 -> 
	case HappyAbsSyn -> Ident
happyOut69 HappyAbsSyn
happy_x_2 of { Ident
happy_var_2 -> 
	( Posn -> [Char] -> P Ident
forall a. Posn -> [Char] -> P a
failLoc Posn
happy_var_1 (Ident -> [Char]
showIdent Ident
happy_var_2[Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ [Char]
" is a predefined constant, it can not be redefined"))}})
	) (\Ident
r -> HappyAbsSyn -> P HappyAbsSyn
forall a. a -> P a
happyReturn (Ident -> HappyAbsSyn
happyIn49 Ident
r))

happyReduce_110 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_110 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_110 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
40# HappyAbsSyn -> HappyAbsSyn
happyReduction_110
happyReduction_110 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_110 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Ident
happyOut49 HappyAbsSyn
happy_x_1 of { Ident
happy_var_1 -> 
	Ident -> HappyAbsSyn
happyIn50
		 (Ident
happy_var_1
	)}

happyReduce_111 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_111 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_111 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
40# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_111
happyReduction_111 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_111 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Ident
happyOut49 HappyAbsSyn
happy_x_2 of { Ident
happy_var_2 -> 
	Ident -> HappyAbsSyn
happyIn50
		 (Ident -> Ident
mkListId Ident
happy_var_2
	)}

happyReduce_112 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_112 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_112 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
41# HappyAbsSyn -> HappyAbsSyn
happyReduction_112
happyReduction_112 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_112 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Ident
happyOut50 HappyAbsSyn
happy_x_1 of { Ident
happy_var_1 -> 
	[Ident] -> HappyAbsSyn
happyIn51
		 ([Ident
happy_var_1]
	)}

happyReduce_113 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_113 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_113 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
41# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_113
happyReduction_113 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_113 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Ident
happyOut50 HappyAbsSyn
happy_x_1 of { Ident
happy_var_1 -> 
	case HappyAbsSyn -> [Ident]
happyOut51 HappyAbsSyn
happy_x_3 of { [Ident]
happy_var_3 -> 
	[Ident] -> HappyAbsSyn
happyIn51
		 (Ident
happy_var_1 Ident -> [Ident] -> [Ident]
forall k1. k1 -> [k1] -> [k1]
: [Ident]
happy_var_3
	)}}

happyReduce_114 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_114 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_114 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
42# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_114
happyReduction_114 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_114 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [Ident]
happyOut47 HappyAbsSyn
happy_x_1 of { [Ident]
happy_var_1 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_3 of { Term
happy_var_3 -> 
	[(Ident, Maybe Term, Maybe Term)] -> HappyAbsSyn
happyIn52
		 ([(Ident
lab,Term -> Maybe Term
forall k1. k1 -> Maybe k1
Just Term
happy_var_3,Maybe Term
forall k1. Maybe k1
Nothing) | Ident
lab <- [Ident]
happy_var_1]
	)}}

happyReduce_115 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_115 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_115 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
42# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_115
happyReduction_115 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_115 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [Ident]
happyOut47 HappyAbsSyn
happy_x_1 of { [Ident]
happy_var_1 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_3 of { Term
happy_var_3 -> 
	[(Ident, Maybe Term, Maybe Term)] -> HappyAbsSyn
happyIn52
		 ([(Ident
lab,Maybe Term
forall k1. Maybe k1
Nothing,Term -> Maybe Term
forall k1. k1 -> Maybe k1
Just Term
happy_var_3) | Ident
lab <- [Ident]
happy_var_1]
	)}}

happyReduce_116 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_116 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_116 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
42# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_116
happyReduction_116 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_116 (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 -> [Ident]
happyOut47 HappyAbsSyn
happy_x_1 of { [Ident]
happy_var_1 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_3 of { Term
happy_var_3 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_5 of { Term
happy_var_5 -> 
	[(Ident, Maybe Term, Maybe Term)] -> HappyAbsSyn
happyIn52
		 ([(Ident
lab,Term -> Maybe Term
forall k1. k1 -> Maybe k1
Just Term
happy_var_3,Term -> Maybe Term
forall k1. k1 -> Maybe k1
Just Term
happy_var_5) | Ident
lab <- [Ident]
happy_var_1]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_117 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_117 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_117 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_0  Int#
43# HappyAbsSyn
happyReduction_117
happyReduction_117 :: HappyAbsSyn
happyReduction_117  =  [(Ident, Maybe Term, Maybe Term)] -> HappyAbsSyn
happyIn53
		 ([]
	)

happyReduce_118 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_118 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_118 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
43# HappyAbsSyn -> HappyAbsSyn
happyReduction_118
happyReduction_118 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_118 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Maybe Term, Maybe Term)]
happyOut52 HappyAbsSyn
happy_x_1 of { [(Ident, Maybe Term, Maybe Term)]
happy_var_1 -> 
	[(Ident, Maybe Term, Maybe Term)] -> HappyAbsSyn
happyIn53
		 ([(Ident, Maybe Term, Maybe Term)]
happy_var_1
	)}

happyReduce_119 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_119 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_119 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
43# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_119
happyReduction_119 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_119 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Ident, Maybe Term, Maybe Term)]
happyOut52 HappyAbsSyn
happy_x_1 of { [(Ident, Maybe Term, Maybe Term)]
happy_var_1 -> 
	case HappyAbsSyn -> [(Ident, Maybe Term, Maybe Term)]
happyOut53 HappyAbsSyn
happy_x_3 of { [(Ident, Maybe Term, Maybe Term)]
happy_var_3 -> 
	[(Ident, Maybe Term, Maybe Term)] -> HappyAbsSyn
happyIn53
		 ([(Ident, Maybe Term, Maybe Term)]
happy_var_1 [(Ident, Maybe Term, Maybe Term)]
-> [(Ident, Maybe Term, Maybe Term)]
-> [(Ident, Maybe Term, Maybe Term)]
forall a. [a] -> [a] -> [a]
++ [(Ident, Maybe Term, Maybe Term)]
happy_var_3
	)}}

happyReduce_120 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_120 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_120 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
44# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_120
happyReduction_120 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_120 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut55 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_3 of { Term
happy_var_3 -> 
	Term -> HappyAbsSyn
happyIn54
		 ([Term] -> Term
FV [Term
happy_var_1,Term
happy_var_3]
	)}}

happyReduce_121 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_121 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_121 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
44# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_121
happyReduction_121 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_121 (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 -> [(BindType, Ident)]
happyOut76 HappyAbsSyn
happy_x_2 of { [(BindType, Ident)]
happy_var_2 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_4 of { Term
happy_var_4 -> 
	Term -> HappyAbsSyn
happyIn54
		 ([(BindType, Ident)] -> Term -> Term
mkAbs [(BindType, Ident)]
happy_var_2 Term
happy_var_4
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_122 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_122 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_122 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
44# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_122
happyReduction_122 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_122 (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 -> [(BindType, Ident)]
happyOut76 HappyAbsSyn
happy_x_2 of { [(BindType, Ident)]
happy_var_2 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_4 of { Term
happy_var_4 -> 
	Term -> HappyAbsSyn
happyIn54
		 ([(BindType, Ident)] -> Term -> Term
mkCTable [(BindType, Ident)]
happy_var_2 Term
happy_var_4
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_123 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_123 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_123 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
44# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_123
happyReduction_123 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_123 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [Hypo]
happyOut77 HappyAbsSyn
happy_x_1 of { [Hypo]
happy_var_1 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_3 of { Term
happy_var_3 -> 
	Term -> HappyAbsSyn
happyIn54
		 ([Hypo] -> Term -> Term
mkProdSimple [Hypo]
happy_var_1 Term
happy_var_3
	)}}

happyReduce_124 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_124 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_124 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
44# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_124
happyReduction_124 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_124 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut57 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_3 of { Term
happy_var_3 -> 
	Term -> HappyAbsSyn
happyIn54
		 (Term -> Term -> Term
Table Term
happy_var_1 Term
happy_var_3
	)}}

happyReduce_125 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_125 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_125 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyMonadReduce Int#
6# Int#
44# HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn
forall p. HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_125
happyReduction_125 :: HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_125 (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) p
tk
	 = P Term -> (Term -> P HappyAbsSyn) -> P HappyAbsSyn
forall a b. P a -> (a -> P b) -> P b
happyThen ((case HappyAbsSyn -> [(Ident, Maybe Term, Maybe Term)]
happyOut53 HappyAbsSyn
happy_x_3 of { [(Ident, Maybe Term, Maybe Term)]
happy_var_3 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_6 of { Term
happy_var_6 -> 
	(
                                        do [(Ident, (Maybe Term, Term))]
defs <- ((Ident, Maybe Term, Maybe Term) -> P (Ident, (Maybe Term, Term)))
-> [(Ident, Maybe Term, Maybe Term)]
-> P [(Ident, (Maybe Term, Term))]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM (Ident, Maybe Term, Maybe Term) -> P (Ident, (Maybe Term, Term))
forall (m :: * -> *) a b.
MonadFail m =>
(Ident, a, Maybe b) -> m (Ident, (a, b))
tryLoc [(Ident, Maybe Term, Maybe Term)]
happy_var_3
                                           Term -> P Term
forall (m :: * -> *) a. Monad m => a -> m a
return (Term -> P Term) -> Term -> P Term
forall a b. (a -> b) -> a -> b
$ [(Ident, (Maybe Term, Term))] -> Term -> Term
mkLet [(Ident, (Maybe Term, Term))]
defs Term
happy_var_6)}})
	) (\Term
r -> HappyAbsSyn -> P HappyAbsSyn
forall a. a -> P a
happyReturn (Term -> HappyAbsSyn
happyIn54 Term
r))

happyReduce_126 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_126 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_126 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyMonadReduce Int#
4# Int#
44# HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn
forall p. HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_126
happyReduction_126 :: HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_126 (HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest) p
tk
	 = P Term -> (Term -> P HappyAbsSyn) -> P HappyAbsSyn
forall a b. P a -> (a -> P b) -> P b
happyThen ((case HappyAbsSyn -> [(Ident, Maybe Term, Maybe Term)]
happyOut53 HappyAbsSyn
happy_x_2 of { [(Ident, Maybe Term, Maybe Term)]
happy_var_2 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_4 of { Term
happy_var_4 -> 
	(
                                        do [(Ident, (Maybe Term, Term))]
defs <- ((Ident, Maybe Term, Maybe Term) -> P (Ident, (Maybe Term, Term)))
-> [(Ident, Maybe Term, Maybe Term)]
-> P [(Ident, (Maybe Term, Term))]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM (Ident, Maybe Term, Maybe Term) -> P (Ident, (Maybe Term, Term))
forall (m :: * -> *) a b.
MonadFail m =>
(Ident, a, Maybe b) -> m (Ident, (a, b))
tryLoc [(Ident, Maybe Term, Maybe Term)]
happy_var_2
                                           Term -> P Term
forall (m :: * -> *) a. Monad m => a -> m a
return (Term -> P Term) -> Term -> P Term
forall a b. (a -> b) -> a -> b
$ [(Ident, (Maybe Term, Term))] -> Term -> Term
mkLet [(Ident, (Maybe Term, Term))]
defs Term
happy_var_4)}})
	) (\Term
r -> HappyAbsSyn -> P HappyAbsSyn
forall a. a -> P a
happyReturn (Term -> HappyAbsSyn
happyIn54 Term
r))

happyReduce_127 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_127 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_127 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyMonadReduce Int#
5# Int#
44# HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn
forall p. HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_127
happyReduction_127 :: HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_127 (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) p
tk
	 = P Term -> (Term -> P HappyAbsSyn) -> P HappyAbsSyn
forall a b. P a -> (a -> P b) -> P b
happyThen ((case HappyAbsSyn -> Term
happyOut57 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	case HappyAbsSyn -> [(Ident, Maybe Term, Maybe Term)]
happyOut53 HappyAbsSyn
happy_x_4 of { [(Ident, Maybe Term, Maybe Term)]
happy_var_4 -> 
	(
                                        do [(Ident, (Maybe Term, Term))]
defs <- ((Ident, Maybe Term, Maybe Term) -> P (Ident, (Maybe Term, Term)))
-> [(Ident, Maybe Term, Maybe Term)]
-> P [(Ident, (Maybe Term, Term))]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM (Ident, Maybe Term, Maybe Term) -> P (Ident, (Maybe Term, Term))
forall (m :: * -> *) a b.
MonadFail m =>
(Ident, a, Maybe b) -> m (Ident, (a, b))
tryLoc [(Ident, Maybe Term, Maybe Term)]
happy_var_4
                                           Term -> P Term
forall (m :: * -> *) a. Monad m => a -> m a
return (Term -> P Term) -> Term -> P Term
forall a b. (a -> b) -> a -> b
$ [(Ident, (Maybe Term, Term))] -> Term -> Term
mkLet [(Ident, (Maybe Term, Term))]
defs Term
happy_var_1)}})
	) (\Term
r -> HappyAbsSyn -> P HappyAbsSyn
forall a. a -> P a
happyReturn (Term -> HappyAbsSyn
happyIn54 Term
r))

happyReduce_128 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_128 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_128 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
44# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_128
happyReduction_128 :: HappyAbsSyn -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_128 HappyAbsSyn
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut59 HappyAbsSyn
happy_x_2 of { Term
happy_var_2 -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { ((T_String  [Char]
happy_var_3)) -> 
	Term -> HappyAbsSyn
happyIn54
		 (Term -> [Char] -> Term
Example Term
happy_var_2 [Char]
happy_var_3
	)}}

happyReduce_129 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_129 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_129 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
44# HappyAbsSyn -> HappyAbsSyn
happyReduction_129
happyReduction_129 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_129 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut55 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	Term -> HappyAbsSyn
happyIn54
		 (Term
happy_var_1
	)}

happyReduce_130 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_130 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_130 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
45# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_130
happyReduction_130 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_130 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut56 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	case HappyAbsSyn -> Term
happyOut55 HappyAbsSyn
happy_x_3 of { Term
happy_var_3 -> 
	Term -> HappyAbsSyn
happyIn55
		 (Term -> Term -> Term
C Term
happy_var_1 Term
happy_var_3
	)}}

happyReduce_131 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_131 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_131 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
45# HappyAbsSyn -> HappyAbsSyn
happyReduction_131
happyReduction_131 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_131 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut56 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	Term -> HappyAbsSyn
happyIn55
		 (Term
happy_var_1
	)}

happyReduce_132 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_132 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_132 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
46# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_132
happyReduction_132 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_132 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut57 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	case HappyAbsSyn -> Term
happyOut56 HappyAbsSyn
happy_x_3 of { Term
happy_var_3 -> 
	Term -> HappyAbsSyn
happyIn56
		 (Term -> Term -> Term
Glue Term
happy_var_1 Term
happy_var_3
	)}}

happyReduce_133 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_133 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_133 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
46# HappyAbsSyn -> HappyAbsSyn
happyReduction_133
happyReduction_133 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_133 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut57 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	Term -> HappyAbsSyn
happyIn56
		 (Term
happy_var_1
	)}

happyReduce_134 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_134 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_134 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
47# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_134
happyReduction_134 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_134 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut57 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	case HappyAbsSyn -> Term
happyOut58 HappyAbsSyn
happy_x_3 of { Term
happy_var_3 -> 
	Term -> HappyAbsSyn
happyIn57
		 (Term -> Term -> Term
S Term
happy_var_1 Term
happy_var_3
	)}}

happyReduce_135 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_135 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_135 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
47# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_135
happyReduction_135 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_135 (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 -> [Case]
happyOut81 HappyAbsSyn
happy_x_3 of { [Case]
happy_var_3 -> 
	Term -> HappyAbsSyn
happyIn57
		 (TInfo -> [Case] -> Term
T TInfo
TRaw [Case]
happy_var_3
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}

happyReduce_136 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_136 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_136 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
47# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_136
happyReduction_136 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_136 (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 -> Term
happyOut60 HappyAbsSyn
happy_x_2 of { Term
happy_var_2 -> 
	case HappyAbsSyn -> [Case]
happyOut81 HappyAbsSyn
happy_x_4 of { [Case]
happy_var_4 -> 
	Term -> HappyAbsSyn
happyIn57
		 (TInfo -> [Case] -> Term
T (Term -> TInfo
TTyped Term
happy_var_2) [Case]
happy_var_4
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_137 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_137 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_137 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
47# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_137
happyReduction_137 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_137 (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 -> Term
happyOut60 HappyAbsSyn
happy_x_2 of { Term
happy_var_2 -> 
	case HappyAbsSyn -> [Term]
happyOut61 HappyAbsSyn
happy_x_4 of { [Term]
happy_var_4 -> 
	Term -> HappyAbsSyn
happyIn57
		 (Term -> [Term] -> Term
V Term
happy_var_2 [Term]
happy_var_4
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_138 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_138 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_138 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
47# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_138
happyReduction_138 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_138 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut57 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	case HappyAbsSyn -> Term
happyOut58 HappyAbsSyn
happy_x_3 of { Term
happy_var_3 -> 
	Term -> HappyAbsSyn
happyIn57
		 (case Term
happy_var_1 of
                                         RecType [Labelling]
xs -> [Labelling] -> Term
RecType ([Labelling]
xs [Labelling] -> [Labelling] -> [Labelling]
forall a. [a] -> [a] -> [a]
++ [(Int -> Label
tupleLabel ([Labelling] -> Int
forall (t :: * -> *) a. Foldable t => t a -> Int
length [Labelling]
xsInt -> Int -> Int
forall a. Num a => a -> a -> a
+Int
1),Term
happy_var_3)])
                                         Term
t          -> [Labelling] -> Term
RecType [(Int -> Label
tupleLabel Int
1,Term
happy_var_1), (Int -> Label
tupleLabel Int
2,Term
happy_var_3)]
	)}}

happyReduce_139 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_139 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_139 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
47# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_139
happyReduction_139 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_139 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut57 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	case HappyAbsSyn -> Term
happyOut58 HappyAbsSyn
happy_x_3 of { Term
happy_var_3 -> 
	Term -> HappyAbsSyn
happyIn57
		 (Term -> Term -> Term
ExtR Term
happy_var_1 Term
happy_var_3
	)}}

happyReduce_140 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_140 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_140 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
47# HappyAbsSyn -> HappyAbsSyn
happyReduction_140
happyReduction_140 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_140 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut58 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	Term -> HappyAbsSyn
happyIn57
		 (Term
happy_var_1
	)}

happyReduce_141 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_141 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_141 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
48# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_141
happyReduction_141 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_141 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut58 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	case HappyAbsSyn -> Term
happyOut59 HappyAbsSyn
happy_x_2 of { Term
happy_var_2 -> 
	Term -> HappyAbsSyn
happyIn58
		 (Term -> Term -> Term
App Term
happy_var_1 Term
happy_var_2
	)}}

happyReduce_142 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_142 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_142 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
48# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_142
happyReduction_142 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_142 (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 -> Term
happyOut58 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_3 of { Term
happy_var_3 -> 
	Term -> HappyAbsSyn
happyIn58
		 (Term -> Term -> Term
App Term
happy_var_1 (Term -> Term
ImplArg Term
happy_var_3)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_143 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_143 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_143 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
6# Int#
48# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_143
happyReduction_143 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_143 (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 -> Term
happyOut54 HappyAbsSyn
happy_x_2 of { Term
happy_var_2 -> 
	case HappyAbsSyn -> [Case]
happyOut81 HappyAbsSyn
happy_x_5 of { [Case]
happy_var_5 -> 
	Term -> HappyAbsSyn
happyIn58
		 (let annot :: TInfo
annot = case Term
happy_var_2 of
                                             Typed Term
_ Term
t -> Term -> TInfo
TTyped Term
t
                                             Term
_         -> TInfo
TRaw
                                       in Term -> Term -> Term
S (TInfo -> [Case] -> Term
T TInfo
annot [Case]
happy_var_5) Term
happy_var_2
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_144 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_144 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_144 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
48# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_144
happyReduction_144 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_144 (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 -> [Term]
happyOut61 HappyAbsSyn
happy_x_3 of { [Term]
happy_var_3 -> 
	Term -> HappyAbsSyn
happyIn58
		 ([Term] -> Term
FV [Term]
happy_var_3
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}

happyReduce_145 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_145 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_145 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyMonadReduce Int#
4# Int#
48# HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn
forall p. HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_145
happyReduction_145 :: HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_145 (HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest) p
tk
	 = P Term -> (Term -> P HappyAbsSyn) -> P HappyAbsSyn
forall a b. P a -> (a -> P b) -> P b
happyThen ((case HappyAbsSyn -> [Case]
happyOut81 HappyAbsSyn
happy_x_3 of { [Case]
happy_var_3 -> 
	( [Case] -> P Term
forall (m :: * -> *). MonadFail m => [Case] -> m Term
mkAlts [Case]
happy_var_3)})
	) (\Term
r -> HappyAbsSyn -> P HappyAbsSyn
forall a. a -> P a
happyReturn (Term -> HappyAbsSyn
happyIn58 Term
r))

happyReduce_146 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_146 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_146 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
6# Int#
48# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_146
happyReduction_146 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_146 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { ((T_String  [Char]
happy_var_3)) -> 
	case HappyAbsSyn -> [(Term, Term)]
happyOut83 HappyAbsSyn
happy_x_5 of { [(Term, Term)]
happy_var_5 -> 
	Term -> HappyAbsSyn
happyIn58
		 (Term -> [(Term, Term)] -> Term
Alts ([Char] -> Term
K [Char]
happy_var_3) [(Term, Term)]
happy_var_5
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_147 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_147 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_147 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
6# Int#
48# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_147
happyReduction_147 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_147 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { ((T_Ident   Ident
happy_var_3)) -> 
	case HappyAbsSyn -> [(Term, Term)]
happyOut83 HappyAbsSyn
happy_x_5 of { [(Term, Term)]
happy_var_5 -> 
	Term -> HappyAbsSyn
happyIn58
		 (Term -> [(Term, Term)] -> Term
Alts (Ident -> Term
Vr Ident
happy_var_3) [(Term, Term)]
happy_var_5
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_148 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_148 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_148 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
48# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_148
happyReduction_148 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_148 (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 -> [Term]
happyOut61 HappyAbsSyn
happy_x_3 of { [Term]
happy_var_3 -> 
	Term -> HappyAbsSyn
happyIn58
		 ([Term] -> Term
Strs [Term]
happy_var_3
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}

happyReduce_149 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_149 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_149 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
48# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_149
happyReduction_149 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_149 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Patt
happyOut66 HappyAbsSyn
happy_x_2 of { Patt
happy_var_2 -> 
	Term -> HappyAbsSyn
happyIn58
		 (Patt -> Term
EPatt Patt
happy_var_2
	)}

happyReduce_150 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_150 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_150 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
48# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_150
happyReduction_150 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_150 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut59 HappyAbsSyn
happy_x_2 of { Term
happy_var_2 -> 
	Term -> HappyAbsSyn
happyIn58
		 (Term -> Term
EPattType Term
happy_var_2
	)}

happyReduce_151 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_151 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_151 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
48# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_151
happyReduction_151 :: HappyAbsSyn -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_151 HappyAbsSyn
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { ((T_Ident   Ident
happy_var_2)) -> 
	case HappyAbsSyn -> Term
happyOut59 HappyAbsSyn
happy_x_3 of { Term
happy_var_3 -> 
	Term -> HappyAbsSyn
happyIn58
		 (Ident -> Term -> Term
ELincat Ident
happy_var_2 Term
happy_var_3
	)}}

happyReduce_152 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_152 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_152 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
48# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_152
happyReduction_152 :: HappyAbsSyn -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_152 HappyAbsSyn
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { ((T_Ident   Ident
happy_var_2)) -> 
	case HappyAbsSyn -> Term
happyOut59 HappyAbsSyn
happy_x_3 of { Term
happy_var_3 -> 
	Term -> HappyAbsSyn
happyIn58
		 (Ident -> Term -> Term
ELin Ident
happy_var_2 Term
happy_var_3
	)}}

happyReduce_153 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_153 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_153 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
48# HappyAbsSyn -> HappyAbsSyn
happyReduction_153
happyReduction_153 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_153 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut59 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	Term -> HappyAbsSyn
happyIn58
		 (Term
happy_var_1
	)}

happyReduce_154 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_154 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_154 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
49# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_154
happyReduction_154 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_154 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut59 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	case HappyAbsSyn -> Label
happyOut68 HappyAbsSyn
happy_x_3 of { Label
happy_var_3 -> 
	Term -> HappyAbsSyn
happyIn59
		 (Term -> Label -> Term
P  Term
happy_var_1 Label
happy_var_3
	)}}

happyReduce_155 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_155 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_155 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
49# HappyAbsSyn -> HappyAbsSyn
happyReduction_155
happyReduction_155 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_155 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut60 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	Term -> HappyAbsSyn
happyIn59
		 (Term
happy_var_1
	)}

happyReduce_156 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_156 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_156 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
50# HappyAbsSyn -> HappyAbsSyn
happyReduction_156
happyReduction_156 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_156 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	Term -> HappyAbsSyn
happyIn60
		 (Ident -> Term
Vr Ident
happy_var_1
	)}

happyReduce_157 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_157 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_157 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
50# HappyAbsSyn -> HappyAbsSyn
happyReduction_157
happyReduction_157 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_157 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Ident
happyOut69 HappyAbsSyn
happy_x_1 of { Ident
happy_var_1 -> 
	Term -> HappyAbsSyn
happyIn60
		 (Ident -> Term
Sort Ident
happy_var_1
	)}

happyReduce_158 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_158 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_158 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
50# HappyAbsSyn -> HappyAbsSyn
happyReduction_158
happyReduction_158 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_158 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_String  [Char]
happy_var_1)) -> 
	Term -> HappyAbsSyn
happyIn60
		 ([Char] -> Term
K [Char]
happy_var_1
	)}

happyReduce_159 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_159 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_159 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
50# HappyAbsSyn -> HappyAbsSyn
happyReduction_159
happyReduction_159 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_159 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Integer Int
happy_var_1)) -> 
	Term -> HappyAbsSyn
happyIn60
		 (Int -> Term
EInt Int
happy_var_1
	)}

happyReduce_160 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_160 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_160 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
50# HappyAbsSyn -> HappyAbsSyn
happyReduction_160
happyReduction_160 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_160 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Double  Double
happy_var_1)) -> 
	Term -> HappyAbsSyn
happyIn60
		 (Double -> Term
EFloat Double
happy_var_1
	)}

happyReduce_161 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_161 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_161 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
50# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_161
happyReduction_161 :: p -> HappyAbsSyn
happyReduction_161 p
happy_x_1
	 =  Term -> HappyAbsSyn
happyIn60
		 (Int -> Term
Meta Int
0
	)

happyReduce_162 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_162 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_162 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
50# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> p -> HappyAbsSyn
happyReduction_162
happyReduction_162 :: p -> p -> HappyAbsSyn
happyReduction_162 p
happy_x_2
	p
happy_x_1
	 =  Term -> HappyAbsSyn
happyIn60
		 (Term
Empty
	)

happyReduce_163 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_163 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_163 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
50# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_163
happyReduction_163 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_163 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { ((T_Ident   Ident
happy_var_2)) -> 
	case HappyAbsSyn -> [Term]
happyOut62 HappyAbsSyn
happy_x_3 of { [Term]
happy_var_3 -> 
	Term -> HappyAbsSyn
happyIn60
		 ((Term -> Term -> Term) -> Term -> [Term] -> Term
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl Term -> Term -> Term
App (Ident -> Term
Vr (Ident -> Ident
mkListId Ident
happy_var_2)) [Term]
happy_var_3
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_164 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_164 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_164 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
50# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_164
happyReduction_164 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_164 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { ((T_String  [Char]
happy_var_2)) -> 
	Term -> HappyAbsSyn
happyIn60
		 ([Char] -> Term
K [Char]
happy_var_2
	)}

happyReduce_165 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_165 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_165 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyMonadReduce Int#
3# Int#
50# HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn
forall p. HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_165
happyReduction_165 :: HappyStk HappyAbsSyn -> p -> P HappyAbsSyn
happyReduction_165 (HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest) p
tk
	 = P Term -> (Term -> P HappyAbsSyn) -> P HappyAbsSyn
forall a b. P a -> (a -> P b) -> P b
happyThen ((case HappyAbsSyn -> [(Ident, Maybe Term, Maybe Term)]
happyOut53 HappyAbsSyn
happy_x_2 of { [(Ident, Maybe Term, Maybe Term)]
happy_var_2 -> 
	( [(Ident, Maybe Term, Maybe Term)] -> P Term
forall (m :: * -> *).
MonadFail m =>
[(Ident, Maybe Term, Maybe Term)] -> m Term
mkR [(Ident, Maybe Term, Maybe Term)]
happy_var_2)})
	) (\Term
r -> HappyAbsSyn -> P HappyAbsSyn
forall a. a -> P a
happyReturn (Term -> HappyAbsSyn
happyIn60 Term
r))

happyReduce_166 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_166 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_166 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
50# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_166
happyReduction_166 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_166 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [Term]
happyOut78 HappyAbsSyn
happy_x_2 of { [Term]
happy_var_2 -> 
	Term -> HappyAbsSyn
happyIn60
		 ([Assign] -> Term
R ([Term] -> [Assign]
tuple2record [Term]
happy_var_2)
	)}

happyReduce_167 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_167 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_167 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
50# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_167
happyReduction_167 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_167 (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 -> Term
happyOut54 HappyAbsSyn
happy_x_2 of { Term
happy_var_2 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_4 of { Term
happy_var_4 -> 
	Term -> HappyAbsSyn
happyIn60
		 (Term -> Term -> Term
Typed Term
happy_var_2 Term
happy_var_4
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_168 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_168 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_168 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
50# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_168
happyReduction_168 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_168 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_2 of { Term
happy_var_2 -> 
	Term -> HappyAbsSyn
happyIn60
		 (Term
happy_var_2
	)}

happyReduce_169 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_169 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_169 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_0  Int#
51# HappyAbsSyn
happyReduction_169
happyReduction_169 :: HappyAbsSyn
happyReduction_169  =  [Term] -> HappyAbsSyn
happyIn61
		 ([]
	)

happyReduce_170 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_170 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_170 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
51# HappyAbsSyn -> HappyAbsSyn
happyReduction_170
happyReduction_170 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_170 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	[Term] -> HappyAbsSyn
happyIn61
		 ([Term
happy_var_1]
	)}

happyReduce_171 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_171 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_171 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
51# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_171
happyReduction_171 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_171 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	case HappyAbsSyn -> [Term]
happyOut61 HappyAbsSyn
happy_x_3 of { [Term]
happy_var_3 -> 
	[Term] -> HappyAbsSyn
happyIn61
		 (Term
happy_var_1 Term -> [Term] -> [Term]
forall k1. k1 -> [k1] -> [k1]
: [Term]
happy_var_3
	)}}

happyReduce_172 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_172 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_172 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_0  Int#
52# HappyAbsSyn
happyReduction_172
happyReduction_172 :: HappyAbsSyn
happyReduction_172  =  [Term] -> HappyAbsSyn
happyIn62
		 ([]
	)

happyReduce_173 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_173 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_173 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
52# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_173
happyReduction_173 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_173 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut60 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	case HappyAbsSyn -> [Term]
happyOut62 HappyAbsSyn
happy_x_2 of { [Term]
happy_var_2 -> 
	[Term] -> HappyAbsSyn
happyIn62
		 (Term
happy_var_1 Term -> [Term] -> [Term]
forall k1. k1 -> [k1] -> [k1]
: [Term]
happy_var_2
	)}}

happyReduce_174 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_174 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_174 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
53# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_174
happyReduction_174 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_174 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Patt
happyOut63 HappyAbsSyn
happy_x_1 of { Patt
happy_var_1 -> 
	case HappyAbsSyn -> Patt
happyOut64 HappyAbsSyn
happy_x_3 of { Patt
happy_var_3 -> 
	Patt -> HappyAbsSyn
happyIn63
		 (Patt -> Patt -> Patt
PAlt Patt
happy_var_1 Patt
happy_var_3
	)}}

happyReduce_175 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_175 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_175 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
53# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_175
happyReduction_175 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_175 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Patt
happyOut63 HappyAbsSyn
happy_x_1 of { Patt
happy_var_1 -> 
	case HappyAbsSyn -> Patt
happyOut64 HappyAbsSyn
happy_x_3 of { Patt
happy_var_3 -> 
	Patt -> HappyAbsSyn
happyIn63
		 (Patt -> Patt -> Patt
PSeq Patt
happy_var_1 Patt
happy_var_3
	)}}

happyReduce_176 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_176 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_176 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
53# HappyAbsSyn -> HappyAbsSyn
happyReduction_176
happyReduction_176 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_176 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Patt
happyOut64 HappyAbsSyn
happy_x_1 of { Patt
happy_var_1 -> 
	Patt -> HappyAbsSyn
happyIn63
		 (Patt
happy_var_1
	)}

happyReduce_177 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_177 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_177 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
54# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_177
happyReduction_177 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_177 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	case HappyAbsSyn -> [Patt]
happyOut71 HappyAbsSyn
happy_x_2 of { [Patt]
happy_var_2 -> 
	Patt -> HappyAbsSyn
happyIn64
		 (Ident -> [Patt] -> Patt
PC Ident
happy_var_1 [Patt]
happy_var_2
	)}}

happyReduce_178 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_178 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_178 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
54# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_178
happyReduction_178 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_178 (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 -> ModuleName
happyOut98 HappyAbsSyn
happy_x_1 of { ModuleName
happy_var_1 -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { ((T_Ident   Ident
happy_var_3)) -> 
	case HappyAbsSyn -> [Patt]
happyOut71 HappyAbsSyn
happy_x_4 of { [Patt]
happy_var_4 -> 
	Patt -> HappyAbsSyn
happyIn64
		 (QIdent -> [Patt] -> Patt
PP (ModuleName
happy_var_1,Ident
happy_var_3) [Patt]
happy_var_4
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_179 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_179 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_179 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
54# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_179
happyReduction_179 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_179 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Patt
happyOut66 HappyAbsSyn
happy_x_1 of { Patt
happy_var_1 -> 
	Patt -> HappyAbsSyn
happyIn64
		 (Patt -> Patt
PRep Patt
happy_var_1
	)}

happyReduce_180 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_180 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_180 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
54# HappyAbsSyn -> HappyAbsSyn
happyReduction_180
happyReduction_180 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_180 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Patt
happyOut65 HappyAbsSyn
happy_x_1 of { Patt
happy_var_1 -> 
	Patt -> HappyAbsSyn
happyIn64
		 (Patt
happy_var_1
	)}

happyReduce_181 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_181 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_181 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
55# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_181
happyReduction_181 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_181 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	case HappyAbsSyn -> Patt
happyOut66 HappyAbsSyn
happy_x_3 of { Patt
happy_var_3 -> 
	Patt -> HappyAbsSyn
happyIn65
		 (Ident -> Patt -> Patt
PAs Ident
happy_var_1 Patt
happy_var_3
	)}}

happyReduce_182 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_182 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_182 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
55# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_182
happyReduction_182 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_182 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Patt
happyOut66 HappyAbsSyn
happy_x_2 of { Patt
happy_var_2 -> 
	Patt -> HappyAbsSyn
happyIn65
		 (Patt -> Patt
PNeg Patt
happy_var_2
	)}

happyReduce_183 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_183 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_183 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
55# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_183
happyReduction_183 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_183 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut60 HappyAbsSyn
happy_x_2 of { Term
happy_var_2 -> 
	Patt -> HappyAbsSyn
happyIn65
		 (Term -> Patt
PTilde Term
happy_var_2
	)}

happyReduce_184 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_184 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_184 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
55# HappyAbsSyn -> HappyAbsSyn
happyReduction_184
happyReduction_184 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_184 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Patt
happyOut66 HappyAbsSyn
happy_x_1 of { Patt
happy_var_1 -> 
	Patt -> HappyAbsSyn
happyIn65
		 (Patt
happy_var_1
	)}

happyReduce_185 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_185 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_185 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
56# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_185
happyReduction_185 :: p -> HappyAbsSyn
happyReduction_185 p
happy_x_1
	 =  Patt -> HappyAbsSyn
happyIn66
		 (Patt
PChar
	)

happyReduce_186 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_186 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_186 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
56# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_186
happyReduction_186 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_186 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { ((T_String  [Char]
happy_var_2)) -> 
	Patt -> HappyAbsSyn
happyIn66
		 ([Char] -> Patt
PChars [Char]
happy_var_2
	)}

happyReduce_187 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_187 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_187 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
56# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_187
happyReduction_187 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_187 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { ((T_Ident   Ident
happy_var_2)) -> 
	Patt -> HappyAbsSyn
happyIn66
		 (Ident -> Patt
PMacro Ident
happy_var_2
	)}

happyReduce_188 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_188 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_188 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
56# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_188
happyReduction_188 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_188 (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 -> ModuleName
happyOut98 HappyAbsSyn
happy_x_2 of { ModuleName
happy_var_2 -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_4 of { ((T_Ident   Ident
happy_var_4)) -> 
	Patt -> HappyAbsSyn
happyIn66
		 (QIdent -> Patt
PM (ModuleName
happy_var_2,Ident
happy_var_4)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_189 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_189 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_189 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
56# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_189
happyReduction_189 :: p -> HappyAbsSyn
happyReduction_189 p
happy_x_1
	 =  Patt -> HappyAbsSyn
happyIn66
		 (Patt
PW
	)

happyReduce_190 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_190 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_190 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
56# HappyAbsSyn -> HappyAbsSyn
happyReduction_190
happyReduction_190 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_190 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	Patt -> HappyAbsSyn
happyIn66
		 (Ident -> Patt
PV Ident
happy_var_1
	)}

happyReduce_191 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_191 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_191 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
56# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_191
happyReduction_191 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_191 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> ModuleName
happyOut98 HappyAbsSyn
happy_x_1 of { ModuleName
happy_var_1 -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { ((T_Ident   Ident
happy_var_3)) -> 
	Patt -> HappyAbsSyn
happyIn66
		 (QIdent -> [Patt] -> Patt
PP (ModuleName
happy_var_1,Ident
happy_var_3) []
	)}}

happyReduce_192 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_192 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_192 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
56# HappyAbsSyn -> HappyAbsSyn
happyReduction_192
happyReduction_192 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_192 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Integer Int
happy_var_1)) -> 
	Patt -> HappyAbsSyn
happyIn66
		 (Int -> Patt
PInt Int
happy_var_1
	)}

happyReduce_193 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_193 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_193 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
56# HappyAbsSyn -> HappyAbsSyn
happyReduction_193
happyReduction_193 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_193 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Double  Double
happy_var_1)) -> 
	Patt -> HappyAbsSyn
happyIn66
		 (Double -> Patt
PFloat  Double
happy_var_1
	)}

happyReduce_194 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_194 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_194 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
56# HappyAbsSyn -> HappyAbsSyn
happyReduction_194
happyReduction_194 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_194 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_String  [Char]
happy_var_1)) -> 
	Patt -> HappyAbsSyn
happyIn66
		 ([Char] -> Patt
PString [Char]
happy_var_1
	)}

happyReduce_195 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_195 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_195 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
56# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_195
happyReduction_195 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_195 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [(Label, Patt)]
happyOut70 HappyAbsSyn
happy_x_2 of { [(Label, Patt)]
happy_var_2 -> 
	Patt -> HappyAbsSyn
happyIn66
		 ([(Label, Patt)] -> Patt
PR [(Label, Patt)]
happy_var_2
	)}

happyReduce_196 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_196 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_196 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
56# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_196
happyReduction_196 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_196 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [Patt]
happyOut79 HappyAbsSyn
happy_x_2 of { [Patt]
happy_var_2 -> 
	Patt -> HappyAbsSyn
happyIn66
		 (([(Label, Patt)] -> Patt
PR ([(Label, Patt)] -> Patt)
-> ([Patt] -> [(Label, Patt)]) -> [Patt] -> Patt
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Patt] -> [(Label, Patt)]
tuple2recordPatt) [Patt]
happy_var_2
	)}

happyReduce_197 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_197 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_197 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
56# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_197
happyReduction_197 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_197 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Patt
happyOut63 HappyAbsSyn
happy_x_2 of { Patt
happy_var_2 -> 
	Patt -> HappyAbsSyn
happyIn66
		 (Patt
happy_var_2
	)}

happyReduce_198 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_198 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_198 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
57# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_198
happyReduction_198 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_198 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [Ident]
happyOut47 HappyAbsSyn
happy_x_1 of { [Ident]
happy_var_1 -> 
	case HappyAbsSyn -> Patt
happyOut63 HappyAbsSyn
happy_x_3 of { Patt
happy_var_3 -> 
	[(Label, Patt)] -> HappyAbsSyn
happyIn67
		 ([(RawIdent -> Label
LIdent (Ident -> RawIdent
ident2raw Ident
i),Patt
happy_var_3) | Ident
i <- [Ident]
happy_var_1]
	)}}

happyReduce_199 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_199 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_199 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
58# HappyAbsSyn -> HappyAbsSyn
happyReduction_199
happyReduction_199 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_199 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	Label -> HappyAbsSyn
happyIn68
		 (RawIdent -> Label
LIdent (Ident -> RawIdent
ident2raw Ident
happy_var_1)
	)}

happyReduce_200 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_200 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_200 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
58# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_200
happyReduction_200 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_200 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { ((T_Integer Int
happy_var_2)) -> 
	Label -> HappyAbsSyn
happyIn68
		 (Int -> Label
LVar (Int -> Int
forall a b. (Integral a, Num b) => a -> b
fromIntegral Int
happy_var_2)
	)}

happyReduce_201 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_201 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_201 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
59# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_201
happyReduction_201 :: p -> HappyAbsSyn
happyReduction_201 p
happy_x_1
	 =  Ident -> HappyAbsSyn
happyIn69
		 (Ident
cType
	)

happyReduce_202 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_202 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_202 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
59# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_202
happyReduction_202 :: p -> HappyAbsSyn
happyReduction_202 p
happy_x_1
	 =  Ident -> HappyAbsSyn
happyIn69
		 (Ident
cPType
	)

happyReduce_203 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_203 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_203 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
59# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_203
happyReduction_203 :: p -> HappyAbsSyn
happyReduction_203 p
happy_x_1
	 =  Ident -> HappyAbsSyn
happyIn69
		 (Ident
cTok
	)

happyReduce_204 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_204 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_204 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
59# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_204
happyReduction_204 :: p -> HappyAbsSyn
happyReduction_204 p
happy_x_1
	 =  Ident -> HappyAbsSyn
happyIn69
		 (Ident
cStr
	)

happyReduce_205 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_205 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_205 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
59# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_205
happyReduction_205 :: p -> HappyAbsSyn
happyReduction_205 p
happy_x_1
	 =  Ident -> HappyAbsSyn
happyIn69
		 (Ident
cStrs
	)

happyReduce_206 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_206 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_206 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_0  Int#
60# HappyAbsSyn
happyReduction_206
happyReduction_206 :: HappyAbsSyn
happyReduction_206  =  [(Label, Patt)] -> HappyAbsSyn
happyIn70
		 ([]
	)

happyReduce_207 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_207 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_207 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
60# HappyAbsSyn -> HappyAbsSyn
happyReduction_207
happyReduction_207 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_207 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Label, Patt)]
happyOut67 HappyAbsSyn
happy_x_1 of { [(Label, Patt)]
happy_var_1 -> 
	[(Label, Patt)] -> HappyAbsSyn
happyIn70
		 ([(Label, Patt)]
happy_var_1
	)}

happyReduce_208 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_208 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_208 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
60# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_208
happyReduction_208 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_208 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(Label, Patt)]
happyOut67 HappyAbsSyn
happy_x_1 of { [(Label, Patt)]
happy_var_1 -> 
	case HappyAbsSyn -> [(Label, Patt)]
happyOut70 HappyAbsSyn
happy_x_3 of { [(Label, Patt)]
happy_var_3 -> 
	[(Label, Patt)] -> HappyAbsSyn
happyIn70
		 ([(Label, Patt)]
happy_var_1 [(Label, Patt)] -> [(Label, Patt)] -> [(Label, Patt)]
forall a. [a] -> [a] -> [a]
++ [(Label, Patt)]
happy_var_3
	)}}

happyReduce_209 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_209 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_209 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
61# HappyAbsSyn -> HappyAbsSyn
happyReduction_209
happyReduction_209 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_209 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Patt
happyOut72 HappyAbsSyn
happy_x_1 of { Patt
happy_var_1 -> 
	[Patt] -> HappyAbsSyn
happyIn71
		 ([Patt
happy_var_1]
	)}

happyReduce_210 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_210 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_210 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
61# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_210
happyReduction_210 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_210 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Patt
happyOut72 HappyAbsSyn
happy_x_1 of { Patt
happy_var_1 -> 
	case HappyAbsSyn -> [Patt]
happyOut71 HappyAbsSyn
happy_x_2 of { [Patt]
happy_var_2 -> 
	[Patt] -> HappyAbsSyn
happyIn71
		 (Patt
happy_var_1 Patt -> [Patt] -> [Patt]
forall k1. k1 -> [k1] -> [k1]
: [Patt]
happy_var_2
	)}}

happyReduce_211 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_211 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_211 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
62# HappyAbsSyn -> HappyAbsSyn
happyReduction_211
happyReduction_211 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_211 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Patt
happyOut65 HappyAbsSyn
happy_x_1 of { Patt
happy_var_1 -> 
	Patt -> HappyAbsSyn
happyIn72
		 (Patt
happy_var_1
	)}

happyReduce_212 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_212 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_212 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
62# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_212
happyReduction_212 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_212 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Patt
happyOut63 HappyAbsSyn
happy_x_2 of { Patt
happy_var_2 -> 
	Patt -> HappyAbsSyn
happyIn72
		 (Patt -> Patt
PImplArg Patt
happy_var_2
	)}

happyReduce_213 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_213 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_213 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
63# HappyAbsSyn -> HappyAbsSyn
happyReduction_213
happyReduction_213 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_213 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	[(BindType, Ident)] -> HappyAbsSyn
happyIn73
		 ([(BindType
Explicit,Ident
happy_var_1    )]
	)}

happyReduce_214 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_214 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_214 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
63# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_214
happyReduction_214 :: p -> HappyAbsSyn
happyReduction_214 p
happy_x_1
	 =  [(BindType, Ident)] -> HappyAbsSyn
happyIn73
		 ([(BindType
Explicit,Ident
identW)]
	)

happyReduce_215 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_215 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_215 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
63# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_215
happyReduction_215 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_215 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [Ident]
happyOut48 HappyAbsSyn
happy_x_2 of { [Ident]
happy_var_2 -> 
	[(BindType, Ident)] -> HappyAbsSyn
happyIn73
		 ([(BindType
Implicit,Ident
v) | Ident
v <- [Ident]
happy_var_2]
	)}

happyReduce_216 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_216 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_216 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
64# HappyAbsSyn -> HappyAbsSyn
happyReduction_216
happyReduction_216 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_216 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(BindType, Ident)]
happyOut73 HappyAbsSyn
happy_x_1 of { [(BindType, Ident)]
happy_var_1 -> 
	[(BindType, Ident)] -> HappyAbsSyn
happyIn74
		 ([(BindType, Ident)]
happy_var_1
	)}

happyReduce_217 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_217 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_217 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
64# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_217
happyReduction_217 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_217 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(BindType, Ident)]
happyOut73 HappyAbsSyn
happy_x_1 of { [(BindType, Ident)]
happy_var_1 -> 
	case HappyAbsSyn -> [(BindType, Ident)]
happyOut74 HappyAbsSyn
happy_x_2 of { [(BindType, Ident)]
happy_var_2 -> 
	[(BindType, Ident)] -> HappyAbsSyn
happyIn74
		 ([(BindType, Ident)]
happy_var_1 [(BindType, Ident)] -> [(BindType, Ident)] -> [(BindType, Ident)]
forall a. [a] -> [a] -> [a]
++ [(BindType, Ident)]
happy_var_2
	)}}

happyReduce_218 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_218 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_218 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
65# HappyAbsSyn -> HappyAbsSyn
happyReduction_218
happyReduction_218 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_218 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	[(BindType, Ident)] -> HappyAbsSyn
happyIn75
		 ([(BindType
Explicit,Ident
happy_var_1    )]
	)}

happyReduce_219 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_219 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_219 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
65# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_219
happyReduction_219 :: p -> HappyAbsSyn
happyReduction_219 p
happy_x_1
	 =  [(BindType, Ident)] -> HappyAbsSyn
happyIn75
		 ([(BindType
Explicit,Ident
identW)]
	)

happyReduce_220 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_220 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_220 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
65# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_220
happyReduction_220 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_220 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> [Ident]
happyOut47 HappyAbsSyn
happy_x_2 of { [Ident]
happy_var_2 -> 
	[(BindType, Ident)] -> HappyAbsSyn
happyIn75
		 ([(BindType
Implicit,Ident
v) | Ident
v <- [Ident]
happy_var_2]
	)}

happyReduce_221 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_221 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_221 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
66# HappyAbsSyn -> HappyAbsSyn
happyReduction_221
happyReduction_221 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_221 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(BindType, Ident)]
happyOut75 HappyAbsSyn
happy_x_1 of { [(BindType, Ident)]
happy_var_1 -> 
	[(BindType, Ident)] -> HappyAbsSyn
happyIn76
		 ([(BindType, Ident)]
happy_var_1
	)}

happyReduce_222 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_222 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_222 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
66# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_222
happyReduction_222 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_222 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [(BindType, Ident)]
happyOut75 HappyAbsSyn
happy_x_1 of { [(BindType, Ident)]
happy_var_1 -> 
	case HappyAbsSyn -> [(BindType, Ident)]
happyOut76 HappyAbsSyn
happy_x_3 of { [(BindType, Ident)]
happy_var_3 -> 
	[(BindType, Ident)] -> HappyAbsSyn
happyIn76
		 ([(BindType, Ident)]
happy_var_1 [(BindType, Ident)] -> [(BindType, Ident)] -> [(BindType, Ident)]
forall a. [a] -> [a] -> [a]
++ [(BindType, Ident)]
happy_var_3
	)}}

happyReduce_223 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_223 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_223 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
67# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_223
happyReduction_223 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_223 (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 -> [(BindType, Ident)]
happyOut76 HappyAbsSyn
happy_x_2 of { [(BindType, Ident)]
happy_var_2 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_4 of { Term
happy_var_4 -> 
	[Hypo] -> HappyAbsSyn
happyIn77
		 ([(BindType
b,Ident
x,Term
happy_var_4) | (BindType
b,Ident
x) <- [(BindType, Ident)]
happy_var_2]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_224 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_224 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_224 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
67# HappyAbsSyn -> HappyAbsSyn
happyReduction_224
happyReduction_224 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_224 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut57 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	[Hypo] -> HappyAbsSyn
happyIn77
		 ([Term -> Hypo
mkHypo Term
happy_var_1]
	)}

happyReduce_225 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_225 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_225 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_0  Int#
68# HappyAbsSyn
happyReduction_225
happyReduction_225 :: HappyAbsSyn
happyReduction_225  =  [Term] -> HappyAbsSyn
happyIn78
		 ([]
	)

happyReduce_226 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_226 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_226 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
68# HappyAbsSyn -> HappyAbsSyn
happyReduction_226
happyReduction_226 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_226 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	[Term] -> HappyAbsSyn
happyIn78
		 ([Term
happy_var_1]
	)}

happyReduce_227 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_227 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_227 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
68# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_227
happyReduction_227 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_227 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	case HappyAbsSyn -> [Term]
happyOut78 HappyAbsSyn
happy_x_3 of { [Term]
happy_var_3 -> 
	[Term] -> HappyAbsSyn
happyIn78
		 (Term
happy_var_1 Term -> [Term] -> [Term]
forall k1. k1 -> [k1] -> [k1]
: [Term]
happy_var_3
	)}}

happyReduce_228 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_228 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_228 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_0  Int#
69# HappyAbsSyn
happyReduction_228
happyReduction_228 :: HappyAbsSyn
happyReduction_228  =  [Patt] -> HappyAbsSyn
happyIn79
		 ([]
	)

happyReduce_229 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_229 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_229 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
69# HappyAbsSyn -> HappyAbsSyn
happyReduction_229
happyReduction_229 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_229 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Patt
happyOut63 HappyAbsSyn
happy_x_1 of { Patt
happy_var_1 -> 
	[Patt] -> HappyAbsSyn
happyIn79
		 ([Patt
happy_var_1]
	)}

happyReduce_230 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_230 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_230 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
69# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_230
happyReduction_230 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_230 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Patt
happyOut63 HappyAbsSyn
happy_x_1 of { Patt
happy_var_1 -> 
	case HappyAbsSyn -> [Patt]
happyOut79 HappyAbsSyn
happy_x_3 of { [Patt]
happy_var_3 -> 
	[Patt] -> HappyAbsSyn
happyIn79
		 (Patt
happy_var_1 Patt -> [Patt] -> [Patt]
forall k1. k1 -> [k1] -> [k1]
: [Patt]
happy_var_3
	)}}

happyReduce_231 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_231 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_231 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
70# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_231
happyReduction_231 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_231 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Patt
happyOut63 HappyAbsSyn
happy_x_1 of { Patt
happy_var_1 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_3 of { Term
happy_var_3 -> 
	Case -> HappyAbsSyn
happyIn80
		 ((Patt
happy_var_1,Term
happy_var_3)
	)}}

happyReduce_232 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_232 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_232 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
71# HappyAbsSyn -> HappyAbsSyn
happyReduction_232
happyReduction_232 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_232 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Case
happyOut80 HappyAbsSyn
happy_x_1 of { Case
happy_var_1 -> 
	[Case] -> HappyAbsSyn
happyIn81
		 ([Case
happy_var_1]
	)}

happyReduce_233 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_233 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_233 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
71# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_233
happyReduction_233 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_233 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Case
happyOut80 HappyAbsSyn
happy_x_1 of { Case
happy_var_1 -> 
	case HappyAbsSyn -> [Case]
happyOut81 HappyAbsSyn
happy_x_3 of { [Case]
happy_var_3 -> 
	[Case] -> HappyAbsSyn
happyIn81
		 (Case
happy_var_1 Case -> [Case] -> [Case]
forall k1. k1 -> [k1] -> [k1]
: [Case]
happy_var_3
	)}}

happyReduce_234 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_234 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_234 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
72# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_234
happyReduction_234 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_234 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_3 of { Term
happy_var_3 -> 
	(Term, Term) -> HappyAbsSyn
happyIn82
		 ((Term
happy_var_1,Term
happy_var_3)
	)}}

happyReduce_235 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_235 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_235 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
73# HappyAbsSyn -> HappyAbsSyn
happyReduction_235
happyReduction_235 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_235 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> (Term, Term)
happyOut82 HappyAbsSyn
happy_x_1 of { (Term, Term)
happy_var_1 -> 
	[(Term, Term)] -> HappyAbsSyn
happyIn83
		 ([(Term, Term)
happy_var_1]
	)}

happyReduce_236 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_236 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_236 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
73# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_236
happyReduction_236 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_236 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> (Term, Term)
happyOut82 HappyAbsSyn
happy_x_1 of { (Term, Term)
happy_var_1 -> 
	case HappyAbsSyn -> [(Term, Term)]
happyOut83 HappyAbsSyn
happy_x_3 of { [(Term, Term)]
happy_var_3 -> 
	[(Term, Term)] -> HappyAbsSyn
happyIn83
		 ((Term, Term)
happy_var_1 (Term, Term) -> [(Term, Term)] -> [(Term, Term)]
forall k1. k1 -> [k1] -> [k1]
: [(Term, Term)]
happy_var_3
	)}}

happyReduce_237 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_237 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_237 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
74# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_237
happyReduction_237 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_237 (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 -> [(BindType, Ident)]
happyOut76 HappyAbsSyn
happy_x_2 of { [(BindType, Ident)]
happy_var_2 -> 
	case HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
happy_x_4 of { Term
happy_var_4 -> 
	[Hypo] -> HappyAbsSyn
happyIn84
		 ([(BindType
b,Ident
x,Term
happy_var_4) | (BindType
b,Ident
x) <- [(BindType, Ident)]
happy_var_2]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_238 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_238 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_238 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
74# HappyAbsSyn -> HappyAbsSyn
happyReduction_238
happyReduction_238 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_238 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Term
happyOut60 HappyAbsSyn
happy_x_1 of { Term
happy_var_1 -> 
	[Hypo] -> HappyAbsSyn
happyIn84
		 ([Term -> Hypo
mkHypo Term
happy_var_1]
	)}

happyReduce_239 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_239 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_239 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_0  Int#
75# HappyAbsSyn
happyReduction_239
happyReduction_239 :: HappyAbsSyn
happyReduction_239  =  [Hypo] -> HappyAbsSyn
happyIn85
		 ([]
	)

happyReduce_240 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_240 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_240 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
75# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_240
happyReduction_240 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_240 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [Hypo]
happyOut84 HappyAbsSyn
happy_x_1 of { [Hypo]
happy_var_1 -> 
	case HappyAbsSyn -> [Hypo]
happyOut85 HappyAbsSyn
happy_x_2 of { [Hypo]
happy_var_2 -> 
	[Hypo] -> HappyAbsSyn
happyIn85
		 ([Hypo]
happy_var_1 [Hypo] -> [Hypo] -> [Hypo]
forall a. [a] -> [a] -> [a]
++ [Hypo]
happy_var_2
	)}}

happyReduce_241 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_241 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_241 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
76# HappyAbsSyn -> HappyAbsSyn
happyReduction_241
happyReduction_241 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_241 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [BNFCRule]
happyOut87 HappyAbsSyn
happy_x_1 of { [BNFCRule]
happy_var_1 -> 
	[BNFCRule] -> HappyAbsSyn
happyIn86
		 ([BNFCRule]
happy_var_1
	)}

happyReduce_242 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_242 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_242 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
76# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_242
happyReduction_242 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_242 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [BNFCRule]
happyOut87 HappyAbsSyn
happy_x_1 of { [BNFCRule]
happy_var_1 -> 
	case HappyAbsSyn -> [BNFCRule]
happyOut86 HappyAbsSyn
happy_x_2 of { [BNFCRule]
happy_var_2 -> 
	[BNFCRule] -> HappyAbsSyn
happyIn86
		 ([BNFCRule]
happy_var_1 [BNFCRule] -> [BNFCRule] -> [BNFCRule]
forall a. [a] -> [a] -> [a]
++ [BNFCRule]
happy_var_2
	)}}

happyReduce_243 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_243 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_243 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
6# Int#
77# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_243
happyReduction_243 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_243 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { ((T_Ident   Ident
happy_var_3)) -> 
	case HappyAbsSyn -> [BNFCSymbol]
happyOut89 HappyAbsSyn
happy_x_5 of { [BNFCSymbol]
happy_var_5 -> 
	[BNFCRule] -> HappyAbsSyn
happyIn87
		 ([[Char] -> [BNFCSymbol] -> CFTerm -> BNFCRule
BNFCRule (Ident -> [Char]
showIdent Ident
happy_var_3) [BNFCSymbol]
happy_var_5 (CId -> [CFTerm] -> CFTerm
CFObj ([Char] -> CId
mkCId (Ident -> [Char]
showIdent Ident
happy_var_1)) [])]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_244 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_244 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_244 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
77# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_244
happyReduction_244 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_244 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	case HappyAbsSyn -> [[BNFCSymbol]]
happyOut88 HappyAbsSyn
happy_x_3 of { [[BNFCSymbol]]
happy_var_3 -> 
	[BNFCRule] -> HappyAbsSyn
happyIn87
		 (let { cat :: [Char]
cat = Ident -> [Char]
showIdent Ident
happy_var_1;
                                                   mkFun :: [Char] -> [Symbol ([Char], b) [Char]] -> [Char]
mkFun [Char]
cat [Symbol ([Char], b) [Char]]
its =
                                                     case [Symbol ([Char], b) [Char]]
its of {
                                                       [] -> [Char]
cat [Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ [Char]
"_";
                                                       [Symbol ([Char], b) [Char]]
_  -> [[Char]] -> [Char]
forall (t :: * -> *) a. Foldable t => t [a] -> [a]
concat ([[Char]] -> [Char]) -> [[Char]] -> [Char]
forall a b. (a -> b) -> a -> b
$ [Char] -> [[Char]] -> [[Char]]
forall k1. k1 -> [k1] -> [k1]
intersperse [Char]
"_" ([Char]
cat [Char] -> [[Char]] -> [[Char]]
forall k1. k1 -> [k1] -> [k1]
: ([Char] -> Bool) -> [[Char]] -> [[Char]]
forall a. (a -> Bool) -> [a] -> [a]
filter (Bool -> Bool
not (Bool -> Bool) -> ([Char] -> Bool) -> [Char] -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Char] -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
null) ((Symbol ([Char], b) [Char] -> [Char])
-> [Symbol ([Char], b) [Char]] -> [[Char]]
forall a b. (a -> b) -> [a] -> [b]
map Symbol ([Char], b) [Char] -> [Char]
forall b. Symbol ([Char], b) [Char] -> [Char]
clean [Symbol ([Char], b) [Char]]
its)) -- CLE style
                                                     };
                                                   clean :: Symbol ([Char], b) [Char] -> [Char]
clean Symbol ([Char], b) [Char]
sym = 
                                                     case Symbol ([Char], b) [Char]
sym of {
                                                       Terminal    [Char]
c     -> (Char -> Bool) -> [Char] -> [Char]
forall a. (a -> Bool) -> [a] -> [a]
filter Char -> Bool
isAlphaNum [Char]
c;
                                                       NonTerminal ([Char]
t,b
_) -> [Char]
t
                                                     }
                                             } in ([BNFCSymbol] -> BNFCRule) -> [[BNFCSymbol]] -> [BNFCRule]
forall a b. (a -> b) -> [a] -> [b]
map (\[BNFCSymbol]
rhs -> [Char] -> [BNFCSymbol] -> CFTerm -> BNFCRule
BNFCRule [Char]
cat [BNFCSymbol]
rhs (CId -> [CFTerm] -> CFTerm
CFObj ([Char] -> CId
mkCId ([Char] -> [BNFCSymbol] -> [Char]
forall b. [Char] -> [Symbol ([Char], b) [Char]] -> [Char]
mkFun [Char]
cat [BNFCSymbol]
rhs)) [])) [[BNFCSymbol]]
happy_var_3
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_245 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_245 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_245 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
77# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_245
happyReduction_245 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_245 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { ((T_Ident   Ident
happy_var_2)) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { ((T_Integer Int
happy_var_3)) -> 
	[BNFCRule] -> HappyAbsSyn
happyIn87
		 ([[Char] -> Int -> BNFCRule
BNFCCoercions (Ident -> [Char]
showIdent Ident
happy_var_2) Int
happy_var_3]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_246 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_246 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_246 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
77# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_246
happyReduction_246 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_246 (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 -> Bool
happyOut91 HappyAbsSyn
happy_x_2 of { Bool
happy_var_2 -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { ((T_Ident   Ident
happy_var_3)) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_4 of { ((T_String  [Char]
happy_var_4)) -> 
	[BNFCRule] -> HappyAbsSyn
happyIn87
		 ([Bool -> [Char] -> [Char] -> BNFCRule
BNFCTerminator Bool
happy_var_2 (Ident -> [Char]
showIdent Ident
happy_var_3) [Char]
happy_var_4]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_247 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_247 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_247 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
5# Int#
77# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_247
happyReduction_247 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_247 (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 -> Bool
happyOut91 HappyAbsSyn
happy_x_2 of { Bool
happy_var_2 -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { ((T_Ident   Ident
happy_var_3)) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_4 of { ((T_String  [Char]
happy_var_4)) -> 
	[BNFCRule] -> HappyAbsSyn
happyIn87
		 ([Bool -> [Char] -> [Char] -> BNFCRule
BNFCSeparator Bool
happy_var_2 (Ident -> [Char]
showIdent Ident
happy_var_3) [Char]
happy_var_4]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_248 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_248 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_248 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
78# HappyAbsSyn -> HappyAbsSyn
happyReduction_248
happyReduction_248 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_248 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [BNFCSymbol]
happyOut89 HappyAbsSyn
happy_x_1 of { [BNFCSymbol]
happy_var_1 -> 
	[[BNFCSymbol]] -> HappyAbsSyn
happyIn88
		 ([[BNFCSymbol]
happy_var_1]
	)}

happyReduce_249 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_249 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_249 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
78# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_249
happyReduction_249 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_249 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> [BNFCSymbol]
happyOut89 HappyAbsSyn
happy_x_1 of { [BNFCSymbol]
happy_var_1 -> 
	case HappyAbsSyn -> [[BNFCSymbol]]
happyOut88 HappyAbsSyn
happy_x_3 of { [[BNFCSymbol]]
happy_var_3 -> 
	[[BNFCSymbol]] -> HappyAbsSyn
happyIn88
		 ([BNFCSymbol]
happy_var_1 [BNFCSymbol] -> [[BNFCSymbol]] -> [[BNFCSymbol]]
forall k1. k1 -> [k1] -> [k1]
: [[BNFCSymbol]]
happy_var_3
	)}}

happyReduce_250 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_250 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_250 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_0  Int#
79# HappyAbsSyn
happyReduction_250
happyReduction_250 :: HappyAbsSyn
happyReduction_250  =  [BNFCSymbol] -> HappyAbsSyn
happyIn89
		 ([]
	)

happyReduce_251 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_251 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_251 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
79# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_251
happyReduction_251 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_251 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> BNFCSymbol
happyOut90 HappyAbsSyn
happy_x_1 of { BNFCSymbol
happy_var_1 -> 
	case HappyAbsSyn -> [BNFCSymbol]
happyOut89 HappyAbsSyn
happy_x_2 of { [BNFCSymbol]
happy_var_2 -> 
	[BNFCSymbol] -> HappyAbsSyn
happyIn89
		 (BNFCSymbol
happy_var_1 BNFCSymbol -> [BNFCSymbol] -> [BNFCSymbol]
forall k1. k1 -> [k1] -> [k1]
: [BNFCSymbol]
happy_var_2
	)}}

happyReduce_252 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_252 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_252 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
80# HappyAbsSyn -> HappyAbsSyn
happyReduction_252
happyReduction_252 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_252 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_String  [Char]
happy_var_1)) -> 
	BNFCSymbol -> HappyAbsSyn
happyIn90
		 ([Char] -> BNFCSymbol
forall c t. t -> Symbol c t
Terminal [Char]
happy_var_1
	)}

happyReduce_253 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_253 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_253 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
80# HappyAbsSyn -> HappyAbsSyn
happyReduction_253
happyReduction_253 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_253 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	BNFCSymbol -> HappyAbsSyn
happyIn90
		 (([Char], Bool) -> BNFCSymbol
forall c t. c -> Symbol c t
NonTerminal (Ident -> [Char]
showIdent Ident
happy_var_1, Bool
False)
	)}

happyReduce_254 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_254 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_254 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
80# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_254
happyReduction_254 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_254 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { ((T_Ident   Ident
happy_var_2)) -> 
	BNFCSymbol -> HappyAbsSyn
happyIn90
		 (([Char], Bool) -> BNFCSymbol
forall c t. c -> Symbol c t
NonTerminal (Ident -> [Char]
showIdent Ident
happy_var_2, Bool
True)
	)}

happyReduce_255 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_255 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_255 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
81# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_255
happyReduction_255 :: p -> HappyAbsSyn
happyReduction_255 p
happy_x_1
	 =  Bool -> HappyAbsSyn
happyIn91
		 (Bool
True
	)

happyReduce_256 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_256 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_256 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_0  Int#
81# HappyAbsSyn
happyReduction_256
happyReduction_256 :: HappyAbsSyn
happyReduction_256  =  Bool -> HappyAbsSyn
happyIn91
		 (Bool
False
	)

happyReduce_257 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_257 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_257 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
82# HappyAbsSyn -> HappyAbsSyn
happyReduction_257
happyReduction_257 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_257 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> ERule
happyOut93 HappyAbsSyn
happy_x_1 of { ERule
happy_var_1 -> 
	[ERule] -> HappyAbsSyn
happyIn92
		 ([ERule
happy_var_1]
	)}

happyReduce_258 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_258 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_258 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
82# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_258
happyReduction_258 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_258 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> ERule
happyOut93 HappyAbsSyn
happy_x_1 of { ERule
happy_var_1 -> 
	case HappyAbsSyn -> [ERule]
happyOut92 HappyAbsSyn
happy_x_2 of { [ERule]
happy_var_2 -> 
	[ERule] -> HappyAbsSyn
happyIn92
		 (ERule
happy_var_1 ERule -> [ERule] -> [ERule]
forall k1. k1 -> [k1] -> [k1]
: [ERule]
happy_var_2
	)}}

happyReduce_259 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_259 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_259 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce Int#
4# Int#
83# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_259
happyReduction_259 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_259 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	case HappyAbsSyn -> ERHS
happyOut94 HappyAbsSyn
happy_x_3 of { ERHS
happy_var_3 -> 
	ERule -> HappyAbsSyn
happyIn93
		 (((Ident -> [Char]
showIdent Ident
happy_var_1,[]),ERHS
happy_var_3)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_260 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_260 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_260 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
84# HappyAbsSyn -> HappyAbsSyn
happyReduction_260
happyReduction_260 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_260 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> ERHS
happyOut95 HappyAbsSyn
happy_x_1 of { ERHS
happy_var_1 -> 
	ERHS -> HappyAbsSyn
happyIn94
		 (ERHS
happy_var_1
	)}

happyReduce_261 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_261 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_261 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
84# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_261
happyReduction_261 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_261 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> ERHS
happyOut95 HappyAbsSyn
happy_x_1 of { ERHS
happy_var_1 -> 
	case HappyAbsSyn -> ERHS
happyOut94 HappyAbsSyn
happy_x_3 of { ERHS
happy_var_3 -> 
	ERHS -> HappyAbsSyn
happyIn94
		 (ERHS -> ERHS -> ERHS
EAlt ERHS
happy_var_1 ERHS
happy_var_3
	)}}

happyReduce_262 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_262 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_262 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
85# HappyAbsSyn -> HappyAbsSyn
happyReduction_262
happyReduction_262 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_262 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> ERHS
happyOut96 HappyAbsSyn
happy_x_1 of { ERHS
happy_var_1 -> 
	ERHS -> HappyAbsSyn
happyIn95
		 (ERHS
happy_var_1
	)}

happyReduce_263 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_263 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_263 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
85# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_263
happyReduction_263 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_263 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> ERHS
happyOut96 HappyAbsSyn
happy_x_1 of { ERHS
happy_var_1 -> 
	case HappyAbsSyn -> ERHS
happyOut95 HappyAbsSyn
happy_x_2 of { ERHS
happy_var_2 -> 
	ERHS -> HappyAbsSyn
happyIn95
		 (ERHS -> ERHS -> ERHS
ESeq ERHS
happy_var_1 ERHS
happy_var_2
	)}}

happyReduce_264 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_264 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_264 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
86# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_264
happyReduction_264 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_264 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> ERHS
happyOut97 HappyAbsSyn
happy_x_1 of { ERHS
happy_var_1 -> 
	ERHS -> HappyAbsSyn
happyIn96
		 (ERHS -> ERHS
EStar ERHS
happy_var_1
	)}

happyReduce_265 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_265 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_265 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
86# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_265
happyReduction_265 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_265 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> ERHS
happyOut97 HappyAbsSyn
happy_x_1 of { ERHS
happy_var_1 -> 
	ERHS -> HappyAbsSyn
happyIn96
		 (ERHS -> ERHS
EPlus ERHS
happy_var_1
	)}

happyReduce_266 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_266 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_266 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_2  Int#
86# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_266
happyReduction_266 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_266 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> ERHS
happyOut97 HappyAbsSyn
happy_x_1 of { ERHS
happy_var_1 -> 
	ERHS -> HappyAbsSyn
happyIn96
		 (ERHS -> ERHS
EOpt ERHS
happy_var_1
	)}

happyReduce_267 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_267 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_267 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
86# HappyAbsSyn -> HappyAbsSyn
happyReduction_267
happyReduction_267 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_267 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> ERHS
happyOut97 HappyAbsSyn
happy_x_1 of { ERHS
happy_var_1 -> 
	ERHS -> HappyAbsSyn
happyIn96
		 (ERHS
happy_var_1
	)}

happyReduce_268 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_268 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_268 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
87# HappyAbsSyn -> HappyAbsSyn
happyReduction_268
happyReduction_268 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_268 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_String  [Char]
happy_var_1)) -> 
	ERHS -> HappyAbsSyn
happyIn97
		 ([Char] -> ERHS
ETerm [Char]
happy_var_1
	)}

happyReduce_269 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_269 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_269 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
87# HappyAbsSyn -> HappyAbsSyn
happyReduction_269
happyReduction_269 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_269 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	ERHS -> HappyAbsSyn
happyIn97
		 (ECat -> ERHS
ENonTerm (Ident -> [Char]
showIdent Ident
happy_var_1,[])
	)}

happyReduce_270 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_270 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_270 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_3  Int#
87# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_270
happyReduction_270 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_270 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> ERHS
happyOut94 HappyAbsSyn
happy_x_2 of { ERHS
happy_var_2 -> 
	ERHS -> HappyAbsSyn
happyIn97
		 (ERHS
happy_var_2
	)}

happyReduce_271 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_271 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_271 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happySpecReduce_1  Int#
88# HappyAbsSyn -> HappyAbsSyn
happyReduction_271
happyReduction_271 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_271 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { ((T_Ident   Ident
happy_var_1)) -> 
	ModuleName -> HappyAbsSyn
happyIn98
		 (Ident -> ModuleName
MN Ident
happy_var_1
	)}

happyReduce_272 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )
happyReduce_272 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyReduce_272 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyMonadReduce Int#
0# Int#
89# HappyStk HappyAbsSyn -> Token -> P HappyAbsSyn
forall p p. p -> p -> P HappyAbsSyn
happyReduction_272
happyReduction_272 :: p -> p -> P HappyAbsSyn
happyReduction_272 (p
happyRest) p
tk
	 = P Posn -> (Posn -> P HappyAbsSyn) -> P HappyAbsSyn
forall a b. P a -> (a -> P b) -> P b
happyThen ((( P Posn
getPosn))
	) (\Posn
r -> HappyAbsSyn -> P HappyAbsSyn
forall a. a -> P a
happyReturn (Posn -> HappyAbsSyn
happyIn99 Posn
r))

happyNewToken :: Int# -> Happy_IntList -> HappyStk HappyAbsSyn -> P HappyAbsSyn
happyNewToken Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk
	= (Token -> P HappyAbsSyn) -> P HappyAbsSyn
forall a. (Token -> P a) -> P a
lexer(\Token
tk -> 
	let cont :: Int# -> P HappyAbsSyn
cont Int#
i = Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyDoAction Int#
i Token
tk Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk in
	case Token
tk of {
	Token
T_EOF -> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> P HappyAbsSyn
happyDoAction Int#
76# Token
tk Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk;
	Token
T_exclmark -> Int# -> P HappyAbsSyn
cont Int#
1#;
	Token
T_patt -> Int# -> P HappyAbsSyn
cont Int#
2#;
	Token
T_int_label -> Int# -> P HappyAbsSyn
cont Int#
3#;
	Token
T_oparen -> Int# -> P HappyAbsSyn
cont Int#
4#;
	Token
T_cparen -> Int# -> P HappyAbsSyn
cont Int#
5#;
	Token
T_tilde -> Int# -> P HappyAbsSyn
cont Int#
6#;
	Token
T_star -> Int# -> P HappyAbsSyn
cont Int#
7#;
	Token
T_starstar -> Int# -> P HappyAbsSyn
cont Int#
8#;
	Token
T_plus -> Int# -> P HappyAbsSyn
cont Int#
9#;
	Token
T_plusplus -> Int# -> P HappyAbsSyn
cont Int#
10#;
	Token
T_comma -> Int# -> P HappyAbsSyn
cont Int#
11#;
	Token
T_minus -> Int# -> P HappyAbsSyn
cont Int#
12#;
	Token
T_rarrow -> Int# -> P HappyAbsSyn
cont Int#
13#;
	Token
T_dot -> Int# -> P HappyAbsSyn
cont Int#
14#;
	Token
T_alt -> Int# -> P HappyAbsSyn
cont Int#
15#;
	Token
T_colon -> Int# -> P HappyAbsSyn
cont Int#
16#;
	Token
T_semicolon -> Int# -> P HappyAbsSyn
cont Int#
17#;
	Token
T_less -> Int# -> P HappyAbsSyn
cont Int#
18#;
	Token
T_equal -> Int# -> P HappyAbsSyn
cont Int#
19#;
	Token
T_big_rarrow -> Int# -> P HappyAbsSyn
cont Int#
20#;
	Token
T_great -> Int# -> P HappyAbsSyn
cont Int#
21#;
	Token
T_questmark -> Int# -> P HappyAbsSyn
cont Int#
22#;
	Token
T_at -> Int# -> P HappyAbsSyn
cont Int#
23#;
	Token
T_obrack -> Int# -> P HappyAbsSyn
cont Int#
24#;
	Token
T_cbrack -> Int# -> P HappyAbsSyn
cont Int#
25#;
	Token
T_ocurly -> Int# -> P HappyAbsSyn
cont Int#
26#;
	Token
T_ccurly -> Int# -> P HappyAbsSyn
cont Int#
27#;
	Token
T_lam -> Int# -> P HappyAbsSyn
cont Int#
28#;
	Token
T_lamlam -> Int# -> P HappyAbsSyn
cont Int#
29#;
	Token
T_underscore -> Int# -> P HappyAbsSyn
cont Int#
30#;
	Token
T_bar -> Int# -> P HappyAbsSyn
cont Int#
31#;
	Token
T_cfarrow -> Int# -> P HappyAbsSyn
cont Int#
32#;
	Token
T_PType -> Int# -> P HappyAbsSyn
cont Int#
33#;
	Token
T_Str -> Int# -> P HappyAbsSyn
cont Int#
34#;
	Token
T_Strs -> Int# -> P HappyAbsSyn
cont Int#
35#;
	Token
T_Tok -> Int# -> P HappyAbsSyn
cont Int#
36#;
	Token
T_Type -> Int# -> P HappyAbsSyn
cont Int#
37#;
	Token
T_abstract -> Int# -> P HappyAbsSyn
cont Int#
38#;
	Token
T_case -> Int# -> P HappyAbsSyn
cont Int#
39#;
	Token
T_cat -> Int# -> P HappyAbsSyn
cont Int#
40#;
	Token
T_concrete -> Int# -> P HappyAbsSyn
cont Int#
41#;
	Token
T_data -> Int# -> P HappyAbsSyn
cont Int#
42#;
	Token
T_def -> Int# -> P HappyAbsSyn
cont Int#
43#;
	Token
T_flags -> Int# -> P HappyAbsSyn
cont Int#
44#;
	Token
T_fun -> Int# -> P HappyAbsSyn
cont Int#
45#;
	Token
T_in -> Int# -> P HappyAbsSyn
cont Int#
46#;
	Token
T_incomplete -> Int# -> P HappyAbsSyn
cont Int#
47#;
	Token
T_instance -> Int# -> P HappyAbsSyn
cont Int#
48#;
	Token
T_interface -> Int# -> P HappyAbsSyn
cont Int#
49#;
	Token
T_let -> Int# -> P HappyAbsSyn
cont Int#
50#;
	Token
T_lin -> Int# -> P HappyAbsSyn
cont Int#
51#;
	Token
T_lincat -> Int# -> P HappyAbsSyn
cont Int#
52#;
	Token
T_lindef -> Int# -> P HappyAbsSyn
cont Int#
53#;
	Token
T_linref -> Int# -> P HappyAbsSyn
cont Int#
54#;
	Token
T_of -> Int# -> P HappyAbsSyn
cont Int#
55#;
	Token
T_open -> Int# -> P HappyAbsSyn
cont Int#
56#;
	Token
T_oper -> Int# -> P HappyAbsSyn
cont Int#
57#;
	Token
T_param -> Int# -> P HappyAbsSyn
cont Int#
58#;
	Token
T_pattern -> Int# -> P HappyAbsSyn
cont Int#
59#;
	Token
T_pre -> Int# -> P HappyAbsSyn
cont Int#
60#;
	Token
T_printname -> Int# -> P HappyAbsSyn
cont Int#
61#;
	Token
T_resource -> Int# -> P HappyAbsSyn
cont Int#
62#;
	Token
T_strs -> Int# -> P HappyAbsSyn
cont Int#
63#;
	Token
T_table -> Int# -> P HappyAbsSyn
cont Int#
64#;
	Token
T_variants -> Int# -> P HappyAbsSyn
cont Int#
65#;
	Token
T_where -> Int# -> P HappyAbsSyn
cont Int#
66#;
	Token
T_with -> Int# -> P HappyAbsSyn
cont Int#
67#;
	Token
T_coercions -> Int# -> P HappyAbsSyn
cont Int#
68#;
	Token
T_terminator -> Int# -> P HappyAbsSyn
cont Int#
69#;
	Token
T_separator -> Int# -> P HappyAbsSyn
cont Int#
70#;
	Token
T_nonempty -> Int# -> P HappyAbsSyn
cont Int#
71#;
	(T_Integer Int
happy_dollar_dollar) -> Int# -> P HappyAbsSyn
cont Int#
72#;
	(T_Double  Double
happy_dollar_dollar) -> Int# -> P HappyAbsSyn
cont Int#
73#;
	(T_String  [Char]
happy_dollar_dollar) -> Int# -> P HappyAbsSyn
cont Int#
74#;
	(T_Ident   Ident
happy_dollar_dollar) -> Int# -> P HappyAbsSyn
cont Int#
75#;
	Token
_ -> (Token, [[Char]]) -> P HappyAbsSyn
forall a. (Token, [[Char]]) -> P a
happyError' (Token
tk, [])
	})

happyError_ :: [[Char]] -> Int# -> Token -> P a
happyError_ [[Char]]
explist Int#
76# Token
tk = (Token, [[Char]]) -> P a
forall a. (Token, [[Char]]) -> P a
happyError' (Token
tk, [[Char]]
explist)
happyError_ [[Char]]
explist Int#
_ Token
tk = (Token, [[Char]]) -> P a
forall a. (Token, [[Char]]) -> P a
happyError' (Token
tk, [[Char]]
explist)

happyThen :: () => P a -> (a -> P b) -> P b
happyThen :: P a -> (a -> P b) -> P b
happyThen = P a -> (a -> P b) -> P b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
(>>=)
happyReturn :: () => a -> P a
happyReturn :: a -> P a
happyReturn = (a -> P a
forall (m :: * -> *) a. Monad m => a -> m a
return)
happyParse :: () => Happy_GHC_Exts.Int# -> P (HappyAbsSyn )

happyNewToken :: () => Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )

happyDoAction :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn )

happyReduceArr :: () => Happy_Data_Array.Array Int (Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> P (HappyAbsSyn ))

happyThen1 :: () => P a -> (a -> P b) -> P b
happyThen1 :: P a -> (a -> P b) -> P b
happyThen1 = P a -> (a -> P b) -> P b
forall a b. P a -> (a -> P b) -> P b
happyThen
happyReturn1 :: () => a -> P a
happyReturn1 :: a -> P a
happyReturn1 = a -> P a
forall a. a -> P a
happyReturn
happyError' :: () => ((Token), [String]) -> P a
happyError' :: (Token, [[Char]]) -> P a
happyError' (Token, [[Char]])
tk = (\(Token
tokens, [[Char]]
explist) -> P a
forall a. P a
happyError) (Token, [[Char]])
tk
pModDef :: P SourceModule
pModDef = P SourceModule
happySomeParser where
 happySomeParser :: P SourceModule
happySomeParser = P HappyAbsSyn -> (HappyAbsSyn -> P SourceModule) -> P SourceModule
forall a b. P a -> (a -> P b) -> P b
happyThen (Int# -> P HappyAbsSyn
happyParse Int#
0#) (\HappyAbsSyn
x -> SourceModule -> P SourceModule
forall a. a -> P a
happyReturn (HappyAbsSyn -> SourceModule
happyOut10 HappyAbsSyn
x))

pTopDef :: P (Either [(Ident, Info)] Options)
pTopDef = P (Either [(Ident, Info)] Options)
happySomeParser where
 happySomeParser :: P (Either [(Ident, Info)] Options)
happySomeParser = P HappyAbsSyn
-> (HappyAbsSyn -> P (Either [(Ident, Info)] Options))
-> P (Either [(Ident, Info)] Options)
forall a b. P a -> (a -> P b) -> P b
happyThen (Int# -> P HappyAbsSyn
happyParse Int#
1#) (\HappyAbsSyn
x -> Either [(Ident, Info)] Options
-> P (Either [(Ident, Info)] Options)
forall a. a -> P a
happyReturn (HappyAbsSyn -> Either [(Ident, Info)] Options
happyOut25 HappyAbsSyn
x))

pModHeader :: P SourceModule
pModHeader = P SourceModule
happySomeParser where
 happySomeParser :: P SourceModule
happySomeParser = P HappyAbsSyn -> (HappyAbsSyn -> P SourceModule) -> P SourceModule
forall a b. P a -> (a -> P b) -> P b
happyThen (Int# -> P HappyAbsSyn
happyParse Int#
2#) (\HappyAbsSyn
x -> SourceModule -> P SourceModule
forall a. a -> P a
happyReturn (HappyAbsSyn -> SourceModule
happyOut11 HappyAbsSyn
x))

pTerm :: P Term
pTerm = P Term
happySomeParser where
 happySomeParser :: P Term
happySomeParser = P HappyAbsSyn -> (HappyAbsSyn -> P Term) -> P Term
forall a b. P a -> (a -> P b) -> P b
happyThen (Int# -> P HappyAbsSyn
happyParse Int#
3#) (\HappyAbsSyn
x -> Term -> P Term
forall a. a -> P a
happyReturn (HappyAbsSyn -> Term
happyOut55 HappyAbsSyn
x))

pExp :: P Term
pExp = P Term
happySomeParser where
 happySomeParser :: P Term
happySomeParser = P HappyAbsSyn -> (HappyAbsSyn -> P Term) -> P Term
forall a b. P a -> (a -> P b) -> P b
happyThen (Int# -> P HappyAbsSyn
happyParse Int#
4#) (\HappyAbsSyn
x -> Term -> P Term
forall a. a -> P a
happyReturn (HappyAbsSyn -> Term
happyOut54 HappyAbsSyn
x))

pBNFCRules :: P [BNFCRule]
pBNFCRules = P [BNFCRule]
happySomeParser where
 happySomeParser :: P [BNFCRule]
happySomeParser = P HappyAbsSyn -> (HappyAbsSyn -> P [BNFCRule]) -> P [BNFCRule]
forall a b. P a -> (a -> P b) -> P b
happyThen (Int# -> P HappyAbsSyn
happyParse Int#
5#) (\HappyAbsSyn
x -> [BNFCRule] -> P [BNFCRule]
forall a. a -> P a
happyReturn (HappyAbsSyn -> [BNFCRule]
happyOut86 HappyAbsSyn
x))

pEBNFRules :: P [ERule]
pEBNFRules = P [ERule]
happySomeParser where
 happySomeParser :: P [ERule]
happySomeParser = P HappyAbsSyn -> (HappyAbsSyn -> P [ERule]) -> P [ERule]
forall a b. P a -> (a -> P b) -> P b
happyThen (Int# -> P HappyAbsSyn
happyParse Int#
6#) (\HappyAbsSyn
x -> [ERule] -> P [ERule]
forall a. a -> P a
happyReturn (HappyAbsSyn -> [ERule]
happyOut92 HappyAbsSyn
x))

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


happyError :: P a
happyError :: P a
happyError = [Char] -> P a
forall (m :: * -> *) a. MonadFail m => [Char] -> m a
fail [Char]
"syntax error"

mkListId,mkConsId,mkBaseId  :: Ident -> Ident
mkListId :: Ident -> Ident
mkListId = [Char] -> Ident -> Ident
prefixIdent [Char]
"List"
mkConsId :: Ident -> Ident
mkConsId = [Char] -> Ident -> Ident
prefixIdent [Char]
"Cons"
mkBaseId :: Ident -> Ident
mkBaseId = [Char] -> Ident -> Ident
prefixIdent [Char]
"Base"

listCatDef :: L (Ident, Context, Int) -> [(Ident,Info)]
listCatDef :: L (Ident, [Hypo], Int) -> [(Ident, Info)]
listCatDef (L Location
loc (Ident
id,[Hypo]
cont,Int
size)) = [(Ident, Info)
catd,(Ident, Info)
nilfund,(Ident, Info)
consfund]
  where
    listId :: Ident
listId = Ident -> Ident
mkListId Ident
id
    baseId :: Ident
baseId = Ident -> Ident
mkBaseId Ident
id
    consId :: Ident
consId = Ident -> Ident
mkConsId Ident
id

    catd :: (Ident, Info)
catd     = (Ident
listId, Maybe (L [Hypo]) -> Info
AbsCat (L [Hypo] -> Maybe (L [Hypo])
forall k1. k1 -> Maybe k1
Just (Location -> [Hypo] -> L [Hypo]
forall a. Location -> a -> L a
L Location
loc [Hypo]
cont')))
    nilfund :: (Ident, Info)
nilfund  = (Ident
baseId, Maybe (L Term)
-> Maybe Int -> Maybe [L Equation] -> Maybe Bool -> Info
AbsFun (L Term -> Maybe (L Term)
forall k1. k1 -> Maybe k1
Just (Location -> Term -> L Term
forall a. Location -> a -> L a
L Location
loc Term
niltyp))  Maybe Int
forall k1. Maybe k1
Nothing Maybe [L Equation]
forall k1. Maybe k1
Nothing (Bool -> Maybe Bool
forall k1. k1 -> Maybe k1
Just Bool
True))
    consfund :: (Ident, Info)
consfund = (Ident
consId, Maybe (L Term)
-> Maybe Int -> Maybe [L Equation] -> Maybe Bool -> Info
AbsFun (L Term -> Maybe (L Term)
forall k1. k1 -> Maybe k1
Just (Location -> Term -> L Term
forall a. Location -> a -> L a
L Location
loc Term
constyp)) Maybe Int
forall k1. Maybe k1
Nothing Maybe [L Equation]
forall k1. Maybe k1
Nothing (Bool -> Maybe Bool
forall k1. k1 -> Maybe k1
Just Bool
True))

    cont' :: [Hypo]
cont' = [(BindType
b,Ident -> Int -> Ident
mkId Ident
x Int
i,Term
ty) | (Int
i,(BindType
b,Ident
x,Term
ty)) <- [Int] -> [Hypo] -> [(Int, Hypo)]
forall a b. [a] -> [b] -> [(a, b)]
zip [Int
0..] [Hypo]
cont]
    xs :: [Term]
xs = (Hypo -> Term) -> [Hypo] -> [Term]
forall a b. (a -> b) -> [a] -> [b]
map (\(BindType
b,Ident
x,Term
t) -> Ident -> Term
Vr Ident
x) [Hypo]
cont'
    cd :: Hypo
cd = Term -> Hypo
mkHypo (Term -> [Term] -> Term
mkApp (Ident -> Term
Vr Ident
id) [Term]
xs)
    lc :: Term
lc = Term -> [Term] -> Term
mkApp (Ident -> Term
Vr Ident
listId) [Term]
xs

    niltyp :: Term
niltyp  = [Hypo] -> Term -> Term
mkProdSimple ([Hypo]
cont' [Hypo] -> [Hypo] -> [Hypo]
forall a. [a] -> [a] -> [a]
++ Int -> Hypo -> [Hypo]
forall a. Int -> a -> [a]
replicate Int
size Hypo
cd) Term
lc
    constyp :: Term
constyp = [Hypo] -> Term -> Term
mkProdSimple ([Hypo]
cont' [Hypo] -> [Hypo] -> [Hypo]
forall a. [a] -> [a] -> [a]
++ [Hypo
cd, Term -> Hypo
mkHypo Term
lc]) Term
lc

    mkId :: Ident -> Int -> Ident
mkId Ident
x Int
i = if Ident -> Bool
isWildIdent Ident
x then (Int -> Ident
varX Int
i) else Ident
x

tryLoc :: (Ident, a, Maybe b) -> m (Ident, (a, b))
tryLoc (Ident
c,a
mty,Just b
e) = (Ident, (a, b)) -> m (Ident, (a, b))
forall (m :: * -> *) a. Monad m => a -> m a
return (Ident
c,(a
mty,b
e))
tryLoc (Ident
c,a
_  ,Maybe b
_     ) = [Char] -> m (Ident, (a, b))
forall (m :: * -> *) a. MonadFail m => [Char] -> m a
fail ([Char]
"local definition of" [Char] -> [Char] -> [Char]
+++ Ident -> [Char]
showIdent Ident
c [Char] -> [Char] -> [Char]
+++ [Char]
"without value")

mkR :: [(Ident, Maybe Term, Maybe Term)] -> m Term
mkR []       = Term -> m Term
forall (m :: * -> *) a. Monad m => a -> m a
return (Term -> m Term) -> Term -> m Term
forall a b. (a -> b) -> a -> b
$ [Labelling] -> Term
RecType [] --- empty record always interpreted as record type
mkR fs :: [(Ident, Maybe Term, Maybe Term)]
fs@((Ident, Maybe Term, Maybe Term)
f:[(Ident, Maybe Term, Maybe Term)]
_) =
  case (Ident, Maybe Term, Maybe Term)
f of
    (Ident
lab,Just Term
ty,Maybe Term
Nothing) -> ((Ident, Maybe Term, Maybe Term) -> m Labelling)
-> [(Ident, Maybe Term, Maybe Term)] -> m [Labelling]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM (Ident, Maybe Term, Maybe Term) -> m Labelling
forall (m :: * -> *) b a.
MonadFail m =>
(Ident, Maybe b, Maybe a) -> m (Label, b)
tryRT [(Ident, Maybe Term, Maybe Term)]
fs m [Labelling] -> ([Labelling] -> m Term) -> m Term
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= Term -> m Term
forall (m :: * -> *) a. Monad m => a -> m a
return (Term -> m Term) -> ([Labelling] -> Term) -> [Labelling] -> m Term
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Labelling] -> Term
RecType
    (Ident, Maybe Term, Maybe Term)
_                     -> ((Ident, Maybe Term, Maybe Term) -> m Assign)
-> [(Ident, Maybe Term, Maybe Term)] -> m [Assign]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM (Ident, Maybe Term, Maybe Term) -> m Assign
forall (m :: * -> *) a b.
MonadFail m =>
(Ident, a, Maybe b) -> m (Label, (a, b))
tryR  [(Ident, Maybe Term, Maybe Term)]
fs m [Assign] -> ([Assign] -> m Term) -> m Term
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= Term -> m Term
forall (m :: * -> *) a. Monad m => a -> m a
return (Term -> m Term) -> ([Assign] -> Term) -> [Assign] -> m Term
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Assign] -> Term
R
  where
    tryRT :: (Ident, Maybe b, Maybe a) -> m (Label, b)
tryRT (Ident
lab,Just b
ty,Maybe a
Nothing) = (Label, b) -> m (Label, b)
forall (m :: * -> *) a. Monad m => a -> m a
return (Ident -> Label
ident2label Ident
lab,b
ty)
    tryRT (Ident
lab,Maybe b
_      ,Maybe a
_      ) = [Char] -> m (Label, b)
forall (m :: * -> *) a. MonadFail m => [Char] -> m a
fail ([Char] -> m (Label, b)) -> [Char] -> m (Label, b)
forall a b. (a -> b) -> a -> b
$ [Char]
"illegal record type field" [Char] -> [Char] -> [Char]
+++ Ident -> [Char]
showIdent Ident
lab --- manifest fields ?!

    tryR :: (Ident, a, Maybe b) -> m (Label, (a, b))
tryR (Ident
lab,a
mty,Just b
t) = (Label, (a, b)) -> m (Label, (a, b))
forall (m :: * -> *) a. Monad m => a -> m a
return (Ident -> Label
ident2label Ident
lab,(a
mty,b
t))
    tryR (Ident
lab,a
_  ,Maybe b
_     ) = [Char] -> m (Label, (a, b))
forall (m :: * -> *) a. MonadFail m => [Char] -> m a
fail ([Char] -> m (Label, (a, b))) -> [Char] -> m (Label, (a, b))
forall a b. (a -> b) -> a -> b
$ [Char]
"illegal record field" [Char] -> [Char] -> [Char]
+++ Ident -> [Char]
showIdent Ident
lab

mkOverload :: Maybe (L Term) -> Maybe (L Term) -> [Info]
mkOverload Maybe (L Term)
pdt pdf :: Maybe (L Term)
pdf@(Just (L Location
loc Term
df)) =
  case Term -> (Term, [Term])
appForm Term
df of
    (Term
keyw, ts :: [Term]
ts@(Term
_:[Term]
_)) | Term -> Bool
isOverloading Term
keyw -> 
       case [Term] -> Term
forall a. [a] -> a
last [Term]
ts of
         R [Assign]
fs -> [[ModuleName] -> [(L Term, L Term)] -> Info
ResOverload [Ident -> ModuleName
MN Ident
m | Vr Ident
m <- [Term]
ts] [(Location -> Term -> L Term
forall a. Location -> a -> L a
L Location
loc Term
ty,Location -> Term -> L Term
forall a. Location -> a -> L a
L Location
loc Term
fu) | (Label
_,(Just Term
ty,Term
fu)) <- [Assign]
fs]]
         Term
_    -> [Maybe (L Term) -> Maybe (L Term) -> Info
ResOper Maybe (L Term)
pdt Maybe (L Term)
pdf]
    (Term, [Term])
_         -> [Maybe (L Term) -> Maybe (L Term) -> Info
ResOper Maybe (L Term)
pdt Maybe (L Term)
pdf]

     -- to enable separare type signature --- not type-checked
mkOverload pdt :: Maybe (L Term)
pdt@(Just (L Location
_ Term
df)) Maybe (L Term)
pdf =
  case Term -> (Term, [Term])
appForm Term
df of
    (Term
keyw, ts :: [Term]
ts@(Term
_:[Term]
_)) | Term -> Bool
isOverloading Term
keyw ->
       case [Term] -> Term
forall a. [a] -> a
last [Term]
ts of
         RecType [Labelling]
_ -> [] 
         Term
_         -> [Maybe (L Term) -> Maybe (L Term) -> Info
ResOper Maybe (L Term)
pdt Maybe (L Term)
pdf]
    (Term, [Term])
_              -> [Maybe (L Term) -> Maybe (L Term) -> Info
ResOper Maybe (L Term)
pdt Maybe (L Term)
pdf]
mkOverload Maybe (L Term)
pdt Maybe (L Term)
pdf = [Maybe (L Term) -> Maybe (L Term) -> Info
ResOper Maybe (L Term)
pdt Maybe (L Term)
pdf]

isOverloading :: Term -> Bool
isOverloading Term
t =
  case Term
t of
    Vr Ident
keyw | Ident -> [Char]
showIdent Ident
keyw [Char] -> [Char] -> Bool
forall a. Eq a => a -> a -> Bool
== [Char]
"overload" -> Bool
True      -- overload is a "soft keyword"
    Term
_                                      -> Bool
False

checkInfoType :: ModuleType -> (a, Info) -> P (a, Info)
checkInfoType ModuleType
mt jment :: (a, Info)
jment@(a
id,Info
info) =
  case Info
info of
    AbsCat Maybe (L [Hypo])
pcont         -> ModuleType -> [Location] -> P (a, Info)
ifAbstract ModuleType
mt (Maybe (L [Hypo]) -> [Location]
forall a. Maybe (L a) -> [Location]
locPerh Maybe (L [Hypo])
pcont)
    AbsFun Maybe (L Term)
pty Maybe Int
_ Maybe [L Equation]
pde Maybe Bool
_   -> ModuleType -> [Location] -> P (a, Info)
ifAbstract ModuleType
mt (Maybe (L Term) -> [Location]
forall a. Maybe (L a) -> [Location]
locPerh Maybe (L Term)
pty [Location] -> [Location] -> [Location]
forall a. [a] -> [a] -> [a]
++ [Location]
-> ([L Equation] -> [Location]) -> Maybe [L Equation] -> [Location]
forall b a. b -> (a -> b) -> Maybe a -> b
maybe [] [L Equation] -> [Location]
forall a. [L a] -> [Location]
locAll Maybe [L Equation]
pde)
    CncCat Maybe (L Term)
pty Maybe (L Term)
pd Maybe (L Term)
pr Maybe (L Term)
ppn Maybe PMCFG
_->ModuleType -> [Location] -> P (a, Info)
ifConcrete ModuleType
mt (Maybe (L Term) -> [Location]
forall a. Maybe (L a) -> [Location]
locPerh Maybe (L Term)
pty [Location] -> [Location] -> [Location]
forall a. [a] -> [a] -> [a]
++ Maybe (L Term) -> [Location]
forall a. Maybe (L a) -> [Location]
locPerh Maybe (L Term)
pd [Location] -> [Location] -> [Location]
forall a. [a] -> [a] -> [a]
++ Maybe (L Term) -> [Location]
forall a. Maybe (L a) -> [Location]
locPerh Maybe (L Term)
pr [Location] -> [Location] -> [Location]
forall a. [a] -> [a] -> [a]
++ Maybe (L Term) -> [Location]
forall a. Maybe (L a) -> [Location]
locPerh Maybe (L Term)
ppn)
    CncFun Maybe (Ident, [Hypo], Term)
_   Maybe (L Term)
pd Maybe (L Term)
ppn Maybe PMCFG
_  -> ModuleType -> [Location] -> P (a, Info)
ifConcrete ModuleType
mt (Maybe (L Term) -> [Location]
forall a. Maybe (L a) -> [Location]
locPerh Maybe (L Term)
pd [Location] -> [Location] -> [Location]
forall a. [a] -> [a] -> [a]
++ Maybe (L Term) -> [Location]
forall a. Maybe (L a) -> [Location]
locPerh Maybe (L Term)
ppn)
    ResParam Maybe (L [Param])
pparam Maybe [Term]
_    -> ModuleType -> [Location] -> P (a, Info)
ifResource ModuleType
mt (Maybe (L [Param]) -> [Location]
forall a. Maybe (L a) -> [Location]
locPerh Maybe (L [Param])
pparam)
    ResValue L Term
ty          -> ModuleType -> [Location] -> P (a, Info)
ifResource ModuleType
mt (L Term -> [Location]
forall a. L a -> [Location]
locL L Term
ty)
    ResOper  Maybe (L Term)
pty Maybe (L Term)
pt      -> ModuleType -> Maybe (L Term) -> Maybe (L Term) -> P (a, Info)
forall (m :: * -> *).
Monad m =>
ModuleType -> Maybe (L Term) -> Maybe (L Term) -> m (a, Info)
ifOper ModuleType
mt Maybe (L Term)
pty Maybe (L Term)
pt
    ResOverload [ModuleName]
_ [(L Term, L Term)]
xs     -> ModuleType -> [Location] -> P (a, Info)
ifResource ModuleType
mt ([[Location]] -> [Location]
forall (t :: * -> *) a. Foldable t => t [a] -> [a]
concat [[Location
loc1,Location
loc2] | (L Location
loc1 Term
_,L Location
loc2 Term
_) <- [(L Term, L Term)]
xs])
  where
    locPerh :: Maybe (L a) -> [Location]
locPerh = [Location] -> (L a -> [Location]) -> Maybe (L a) -> [Location]
forall b a. b -> (a -> b) -> Maybe a -> b
maybe [] L a -> [Location]
forall a. L a -> [Location]
locL
    locAll :: [L a] -> [Location]
locAll [L a]
xs = [Location
loc | L Location
loc a
x <- [L a]
xs]
    locL :: L a -> [Location]
locL (L Location
loc a
x) = [Location
loc]
    
    illegal :: [Location] -> P (a, Info)
illegal (Local Int
s Int
e:[Location]
_) = Posn -> [Char] -> P (a, Info)
forall a. Posn -> [Char] -> P a
failLoc (Int -> Int -> Posn
Pn Int
s Int
0) [Char]
"illegal definition"
    illegal [Location]
_             = (a, Info) -> P (a, Info)
forall (m :: * -> *) a. Monad m => a -> m a
return (a, Info)
jment

    ifAbstract :: ModuleType -> [Location] -> P (a, Info)
ifAbstract ModuleType
MTAbstract     [Location]
locs = (a, Info) -> P (a, Info)
forall (m :: * -> *) a. Monad m => a -> m a
return (a, Info)
jment
    ifAbstract ModuleType
_              [Location]
locs = [Location] -> P (a, Info)
illegal [Location]
locs

    ifConcrete :: ModuleType -> [Location] -> P (a, Info)
ifConcrete (MTConcrete ModuleName
_) [Location]
locs = (a, Info) -> P (a, Info)
forall (m :: * -> *) a. Monad m => a -> m a
return (a, Info)
jment
    ifConcrete ModuleType
_              [Location]
locs = [Location] -> P (a, Info)
illegal [Location]
locs

    ifResource :: ModuleType -> [Location] -> P (a, Info)
ifResource (MTConcrete ModuleName
_) [Location]
locs = (a, Info) -> P (a, Info)
forall (m :: * -> *) a. Monad m => a -> m a
return (a, Info)
jment
    ifResource (MTInstance (ModuleName, MInclude)
_) [Location]
locs = (a, Info) -> P (a, Info)
forall (m :: * -> *) a. Monad m => a -> m a
return (a, Info)
jment
    ifResource ModuleType
MTInterface    [Location]
locs = (a, Info) -> P (a, Info)
forall (m :: * -> *) a. Monad m => a -> m a
return (a, Info)
jment
    ifResource ModuleType
MTResource     [Location]
locs = (a, Info) -> P (a, Info)
forall (m :: * -> *) a. Monad m => a -> m a
return (a, Info)
jment
    ifResource ModuleType
_              [Location]
locs = [Location] -> P (a, Info)
illegal [Location]
locs
    
    ifOper :: ModuleType -> Maybe (L Term) -> Maybe (L Term) -> m (a, Info)
ifOper ModuleType
MTAbstract Maybe (L Term)
pty Maybe (L Term)
pt = (a, Info) -> m (a, Info)
forall (m :: * -> *) a. Monad m => a -> m a
return (a
id,Maybe (L Term)
-> Maybe Int -> Maybe [L Equation] -> Maybe Bool -> Info
AbsFun Maybe (L Term)
pty ((L Term -> Int) -> Maybe (L Term) -> Maybe Int
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (Int -> L Term -> Int
forall a b. a -> b -> a
const Int
0) Maybe (L Term)
pt) ([L Equation] -> Maybe [L Equation]
forall k1. k1 -> Maybe k1
Just ([L Equation]
-> (L Term -> [L Equation]) -> Maybe (L Term) -> [L Equation]
forall b a. b -> (a -> b) -> Maybe a -> b
maybe [] (\(L Location
l Term
t) -> [Location -> Equation -> L Equation
forall a. Location -> a -> L a
L Location
l ([],Term
t)]) Maybe (L Term)
pt)) (Bool -> Maybe Bool
forall k1. k1 -> Maybe k1
Just Bool
False))
    ifOper ModuleType
_          Maybe (L Term)
pty Maybe (L Term)
pt = (a, Info) -> m (a, Info)
forall (m :: * -> *) a. Monad m => a -> m a
return (a, Info)
jment

mkAlts :: [Case] -> m Term
mkAlts [Case]
cs = case [Case]
cs of
  Case
_:[Case]
_ -> do
    Term
def  <- Case -> m Term
forall (m :: * -> *) a a. Monad m => (a, a) -> m a
mkDef ([Case] -> Case
forall a. [a] -> a
last [Case]
cs)
    [(Term, Term)]
alts <- (Case -> m (Term, Term)) -> [Case] -> m [(Term, Term)]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM Case -> m (Term, Term)
forall (m :: * -> *) a. MonadFail m => (Patt, a) -> m (a, Term)
mkAlt ([Case] -> [Case]
forall a. [a] -> [a]
init [Case]
cs)
    Term -> m Term
forall (m :: * -> *) a. Monad m => a -> m a
return (Term -> [(Term, Term)] -> Term
Alts Term
def [(Term, Term)]
alts)
  [Case]
_ -> [Char] -> m Term
forall (m :: * -> *) a. MonadFail m => [Char] -> m a
fail [Char]
"empty alts"
 where
   mkDef :: (a, a) -> m a
mkDef (a
_,a
t) = a -> m a
forall (m :: * -> *) a. Monad m => a -> m a
return a
t
   mkAlt :: (Patt, a) -> m (a, Term)
mkAlt (Patt
p,a
t) = do
     Term
ss <- Patt -> m Term
forall (m :: * -> *). MonadFail m => Patt -> m Term
mkStrs Patt
p
     (a, Term) -> m (a, Term)
forall (m :: * -> *) a. Monad m => a -> m a
return (a
t,Term
ss)
   mkStrs :: Patt -> m Term
mkStrs Patt
p = case Patt
p of
     PAlt Patt
a Patt
b -> do
       Strs [Term]
as <- Patt -> m Term
mkStrs Patt
a
       Strs [Term]
bs <- Patt -> m Term
mkStrs Patt
b
       Term -> m Term
forall (m :: * -> *) a. Monad m => a -> m a
return (Term -> m Term) -> Term -> m Term
forall a b. (a -> b) -> a -> b
$ [Term] -> Term
Strs ([Term] -> Term) -> [Term] -> Term
forall a b. (a -> b) -> a -> b
$ [Term]
as [Term] -> [Term] -> [Term]
forall a. [a] -> [a] -> [a]
++ [Term]
bs
     PString [Char]
s -> Term -> m Term
forall (m :: * -> *) a. Monad m => a -> m a
return (Term -> m Term) -> Term -> m Term
forall a b. (a -> b) -> a -> b
$ [Term] -> Term
Strs [[Char] -> Term
K [Char]
s]
     PV Ident
x -> Term -> m Term
forall (m :: * -> *) a. Monad m => a -> m a
return (Ident -> Term
Vr Ident
x) --- for macros; not yet complete
     PMacro Ident
x -> Term -> m Term
forall (m :: * -> *) a. Monad m => a -> m a
return (Ident -> Term
Vr Ident
x) --- for macros; not yet complete
     PM QIdent
c -> Term -> m Term
forall (m :: * -> *) a. Monad m => a -> m a
return (QIdent -> Term
Q QIdent
c) --- for macros; not yet complete
     Patt
_ -> [Char] -> m Term
forall (m :: * -> *) a. MonadFail m => [Char] -> m a
fail [Char]
"no strs from pattern"

mkL :: Posn -> Posn -> x -> L x
mkL :: Posn -> Posn -> x -> L x
mkL (Pn Int
l1 Int
_) (Pn Int
l2 Int
_) x
x = Location -> x -> L x
forall a. Location -> a -> L a
L (Int -> Int -> Location
Local Int
l1 Int
l2) x
x
{-# LINE 1 "templates/GenericTemplate.hs" #-}
{-# LINE 1 "templates/GenericTemplate.hs" #-}
{-# LINE 1 "<built-in>" #-}
{-# LINE 1 "<command-line>" #-}
{-# LINE 10 "<command-line>" #-}
# 1 "/usr/include/stdc-predef.h" 1 3 4

# 17 "/usr/include/stdc-predef.h" 3 4














































{-# LINE 10 "<command-line>" #-}
{-# LINE 1 "/opt/ghc/8.6.3/lib/ghc-8.6.3/include/ghcversion.h" #-}















{-# LINE 10 "<command-line>" #-}
{-# LINE 1 "/tmp/ghc780_0/ghc_2.h" #-}






































































































































































































{-# LINE 10 "<command-line>" #-}
{-# 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)) :: 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 43 "templates/GenericTemplate.hs" #-}

data Happy_IntList = HappyCons Happy_GHC_Exts.Int# Happy_IntList







{-# LINE 65 "templates/GenericTemplate.hs" #-}

{-# LINE 75 "templates/GenericTemplate.hs" #-}

{-# LINE 84 "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 (happyExpListPerState ((Happy_GHC_Exts.I# (st)) :: 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 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#




{-# 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 `mod` 16)
  where unbox_int (Happy_GHC_Exts.I# x) = x






data HappyAddr = HappyA# Happy_GHC_Exts.Addr#


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

{-# LINE 180 "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 = 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 (0# 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  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 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 = 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.