{-# OPTIONS_GHC -w #-}
{-# OPTIONS -XMagicHash -XBangPatterns -XTypeSynonymInstances -XFlexibleInstances -cpp #-}
#if __GLASGOW_HASKELL__ >= 710
{-# OPTIONS_GHC -XPartialTypeSignatures #-}
#endif
{-# OPTIONS_GHC -fno-warn-incomplete-patterns -fno-warn-overlapping-patterns #-}
{-# LANGUAGE PatternSynonyms #-}

module Language.Rzk.Syntax.Par
  ( happyError
  , myLexer
  , pModule
  , pHoleIdent
  , pVarIdent
  , pListVarIdent
  , pLanguageDecl
  , pLanguage
  , pCommand
  , pListCommand
  , pDeclUsedVars
  , pSectionName
  , pPattern
  , pListPattern
  , pPattern1
  , pListPattern1
  , pParam
  , pListParam
  , pParamDecl
  , pSigmaParam
  , pListSigmaParam
  , pRestriction
  , pListRestriction
  , pTerm7
  , pTerm5
  , pTerm4
  , pTerm3
  , pTerm2
  , pTerm1
  , pTerm6
  , pTerm
  , pListTerm
  ) where

import Prelude

import qualified Language.Rzk.Syntax.Abs
import Language.Rzk.Syntax.Lex
import qualified Data.Array as Happy_Data_Array
import qualified Data.Bits as Bits
import qualified GHC.Exts as Happy_GHC_Exts
import Control.Applicative(Applicative(..))
import Control.Monad (ap)

-- parser produced by Happy Version 1.20.1.1

newtype HappyAbsSyn  = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
newtype HappyWrap33 = HappyWrap33 ((Language.Rzk.Syntax.Abs.BNFC'Position, String))
happyIn33 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, String)) -> (HappyAbsSyn )
happyIn33 :: (BNFC'Position, String) -> HappyAbsSyn
happyIn33 (BNFC'Position, String)
x = HappyWrap33 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, String) -> HappyWrap33
HappyWrap33 (BNFC'Position, String)
x)
{-# INLINE happyIn33 #-}
happyOut33 :: (HappyAbsSyn ) -> HappyWrap33
happyOut33 :: HappyAbsSyn -> HappyWrap33
happyOut33 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap33
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut33 #-}
newtype HappyWrap34 = HappyWrap34 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.VarIdentToken))
happyIn34 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.VarIdentToken)) -> (HappyAbsSyn )
happyIn34 :: (BNFC'Position, VarIdentToken) -> HappyAbsSyn
happyIn34 (BNFC'Position, VarIdentToken)
x = HappyWrap34 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, VarIdentToken) -> HappyWrap34
HappyWrap34 (BNFC'Position, VarIdentToken)
x)
{-# INLINE happyIn34 #-}
happyOut34 :: (HappyAbsSyn ) -> HappyWrap34
happyOut34 :: HappyAbsSyn -> HappyWrap34
happyOut34 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap34
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut34 #-}
newtype HappyWrap35 = HappyWrap35 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.HoleIdentToken))
happyIn35 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.HoleIdentToken)) -> (HappyAbsSyn )
happyIn35 :: (BNFC'Position, HoleIdentToken) -> HappyAbsSyn
happyIn35 (BNFC'Position, HoleIdentToken)
x = HappyWrap35 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, HoleIdentToken) -> HappyWrap35
HappyWrap35 (BNFC'Position, HoleIdentToken)
x)
{-# INLINE happyIn35 #-}
happyOut35 :: (HappyAbsSyn ) -> HappyWrap35
happyOut35 :: HappyAbsSyn -> HappyWrap35
happyOut35 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap35
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut35 #-}
newtype HappyWrap36 = HappyWrap36 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Module))
happyIn36 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Module)) -> (HappyAbsSyn )
happyIn36 :: (BNFC'Position, Module) -> HappyAbsSyn
happyIn36 (BNFC'Position, Module)
x = HappyWrap36 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Module) -> HappyWrap36
HappyWrap36 (BNFC'Position, Module)
x)
{-# INLINE happyIn36 #-}
happyOut36 :: (HappyAbsSyn ) -> HappyWrap36
happyOut36 :: HappyAbsSyn -> HappyWrap36
happyOut36 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap36
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut36 #-}
newtype HappyWrap37 = HappyWrap37 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.HoleIdent))
happyIn37 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.HoleIdent)) -> (HappyAbsSyn )
happyIn37 :: (BNFC'Position, HoleIdent) -> HappyAbsSyn
happyIn37 (BNFC'Position, HoleIdent)
x = HappyWrap37 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, HoleIdent) -> HappyWrap37
HappyWrap37 (BNFC'Position, HoleIdent)
x)
{-# INLINE happyIn37 #-}
happyOut37 :: (HappyAbsSyn ) -> HappyWrap37
happyOut37 :: HappyAbsSyn -> HappyWrap37
happyOut37 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap37
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut37 #-}
newtype HappyWrap38 = HappyWrap38 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.VarIdent))
happyIn38 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.VarIdent)) -> (HappyAbsSyn )
happyIn38 :: (BNFC'Position, VarIdent) -> HappyAbsSyn
happyIn38 (BNFC'Position, VarIdent)
x = HappyWrap38 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, VarIdent) -> HappyWrap38
HappyWrap38 (BNFC'Position, VarIdent)
x)
{-# INLINE happyIn38 #-}
happyOut38 :: (HappyAbsSyn ) -> HappyWrap38
happyOut38 :: HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap38
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut38 #-}
newtype HappyWrap39 = HappyWrap39 ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.VarIdent]))
happyIn39 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.VarIdent])) -> (HappyAbsSyn )
happyIn39 :: (BNFC'Position, [VarIdent]) -> HappyAbsSyn
happyIn39 (BNFC'Position, [VarIdent])
x = HappyWrap39 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [VarIdent]) -> HappyWrap39
HappyWrap39 (BNFC'Position, [VarIdent])
x)
{-# INLINE happyIn39 #-}
happyOut39 :: (HappyAbsSyn ) -> HappyWrap39
happyOut39 :: HappyAbsSyn -> HappyWrap39
happyOut39 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap39
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut39 #-}
newtype HappyWrap40 = HappyWrap40 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.LanguageDecl))
happyIn40 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.LanguageDecl)) -> (HappyAbsSyn )
happyIn40 :: (BNFC'Position, LanguageDecl) -> HappyAbsSyn
happyIn40 (BNFC'Position, LanguageDecl)
x = HappyWrap40 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, LanguageDecl) -> HappyWrap40
HappyWrap40 (BNFC'Position, LanguageDecl)
x)
{-# INLINE happyIn40 #-}
happyOut40 :: (HappyAbsSyn ) -> HappyWrap40
happyOut40 :: HappyAbsSyn -> HappyWrap40
happyOut40 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap40
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut40 #-}
newtype HappyWrap41 = HappyWrap41 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Language))
happyIn41 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Language)) -> (HappyAbsSyn )
happyIn41 :: (BNFC'Position, Language) -> HappyAbsSyn
happyIn41 (BNFC'Position, Language)
x = HappyWrap41 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Language) -> HappyWrap41
HappyWrap41 (BNFC'Position, Language)
x)
{-# INLINE happyIn41 #-}
happyOut41 :: (HappyAbsSyn ) -> HappyWrap41
happyOut41 :: HappyAbsSyn -> HappyWrap41
happyOut41 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap41
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut41 #-}
newtype HappyWrap42 = HappyWrap42 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Command))
happyIn42 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Command)) -> (HappyAbsSyn )
happyIn42 :: (BNFC'Position, Command) -> HappyAbsSyn
happyIn42 (BNFC'Position, Command)
x = HappyWrap42 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Command) -> HappyWrap42
HappyWrap42 (BNFC'Position, Command)
x)
{-# INLINE happyIn42 #-}
happyOut42 :: (HappyAbsSyn ) -> HappyWrap42
happyOut42 :: HappyAbsSyn -> HappyWrap42
happyOut42 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap42
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut42 #-}
newtype HappyWrap43 = HappyWrap43 ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Command]))
happyIn43 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Command])) -> (HappyAbsSyn )
happyIn43 :: (BNFC'Position, [Command]) -> HappyAbsSyn
happyIn43 (BNFC'Position, [Command])
x = HappyWrap43 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Command]) -> HappyWrap43
HappyWrap43 (BNFC'Position, [Command])
x)
{-# INLINE happyIn43 #-}
happyOut43 :: (HappyAbsSyn ) -> HappyWrap43
happyOut43 :: HappyAbsSyn -> HappyWrap43
happyOut43 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap43
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut43 #-}
newtype HappyWrap44 = HappyWrap44 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.DeclUsedVars))
happyIn44 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.DeclUsedVars)) -> (HappyAbsSyn )
happyIn44 :: (BNFC'Position, DeclUsedVars) -> HappyAbsSyn
happyIn44 (BNFC'Position, DeclUsedVars)
x = HappyWrap44 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, DeclUsedVars) -> HappyWrap44
HappyWrap44 (BNFC'Position, DeclUsedVars)
x)
{-# INLINE happyIn44 #-}
happyOut44 :: (HappyAbsSyn ) -> HappyWrap44
happyOut44 :: HappyAbsSyn -> HappyWrap44
happyOut44 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap44
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut44 #-}
newtype HappyWrap45 = HappyWrap45 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.SectionName))
happyIn45 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.SectionName)) -> (HappyAbsSyn )
happyIn45 :: (BNFC'Position, SectionName) -> HappyAbsSyn
happyIn45 (BNFC'Position, SectionName)
x = HappyWrap45 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, SectionName) -> HappyWrap45
HappyWrap45 (BNFC'Position, SectionName)
x)
{-# INLINE happyIn45 #-}
happyOut45 :: (HappyAbsSyn ) -> HappyWrap45
happyOut45 :: HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap45
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut45 #-}
newtype HappyWrap46 = HappyWrap46 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Pattern))
happyIn46 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Pattern)) -> (HappyAbsSyn )
happyIn46 :: (BNFC'Position, Pattern) -> HappyAbsSyn
happyIn46 (BNFC'Position, Pattern)
x = HappyWrap46 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Pattern) -> HappyWrap46
HappyWrap46 (BNFC'Position, Pattern)
x)
{-# INLINE happyIn46 #-}
happyOut46 :: (HappyAbsSyn ) -> HappyWrap46
happyOut46 :: HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap46
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut46 #-}
newtype HappyWrap47 = HappyWrap47 ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Pattern]))
happyIn47 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Pattern])) -> (HappyAbsSyn )
happyIn47 :: (BNFC'Position, [Pattern]) -> HappyAbsSyn
happyIn47 (BNFC'Position, [Pattern])
x = HappyWrap47 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Pattern]) -> HappyWrap47
HappyWrap47 (BNFC'Position, [Pattern])
x)
{-# INLINE happyIn47 #-}
happyOut47 :: (HappyAbsSyn ) -> HappyWrap47
happyOut47 :: HappyAbsSyn -> HappyWrap47
happyOut47 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap47
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut47 #-}
newtype HappyWrap48 = HappyWrap48 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Pattern))
happyIn48 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Pattern)) -> (HappyAbsSyn )
happyIn48 :: (BNFC'Position, Pattern) -> HappyAbsSyn
happyIn48 (BNFC'Position, Pattern)
x = HappyWrap48 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Pattern) -> HappyWrap48
HappyWrap48 (BNFC'Position, Pattern)
x)
{-# INLINE happyIn48 #-}
happyOut48 :: (HappyAbsSyn ) -> HappyWrap48
happyOut48 :: HappyAbsSyn -> HappyWrap48
happyOut48 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap48
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut48 #-}
newtype HappyWrap49 = HappyWrap49 ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Pattern]))
happyIn49 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Pattern])) -> (HappyAbsSyn )
happyIn49 :: (BNFC'Position, [Pattern]) -> HappyAbsSyn
happyIn49 (BNFC'Position, [Pattern])
x = HappyWrap49 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Pattern]) -> HappyWrap49
HappyWrap49 (BNFC'Position, [Pattern])
x)
{-# INLINE happyIn49 #-}
happyOut49 :: (HappyAbsSyn ) -> HappyWrap49
happyOut49 :: HappyAbsSyn -> HappyWrap49
happyOut49 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap49
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut49 #-}
newtype HappyWrap50 = HappyWrap50 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Param))
happyIn50 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Param)) -> (HappyAbsSyn )
happyIn50 :: (BNFC'Position, Param) -> HappyAbsSyn
happyIn50 (BNFC'Position, Param)
x = HappyWrap50 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Param) -> HappyWrap50
HappyWrap50 (BNFC'Position, Param)
x)
{-# INLINE happyIn50 #-}
happyOut50 :: (HappyAbsSyn ) -> HappyWrap50
happyOut50 :: HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap50
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut50 #-}
newtype HappyWrap51 = HappyWrap51 ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Param]))
happyIn51 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Param])) -> (HappyAbsSyn )
happyIn51 :: (BNFC'Position, [Param]) -> HappyAbsSyn
happyIn51 (BNFC'Position, [Param])
x = HappyWrap51 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Param]) -> HappyWrap51
HappyWrap51 (BNFC'Position, [Param])
x)
{-# INLINE happyIn51 #-}
happyOut51 :: (HappyAbsSyn ) -> HappyWrap51
happyOut51 :: HappyAbsSyn -> HappyWrap51
happyOut51 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap51
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut51 #-}
newtype HappyWrap52 = HappyWrap52 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.ParamDecl))
happyIn52 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.ParamDecl)) -> (HappyAbsSyn )
happyIn52 :: (BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn52 (BNFC'Position, ParamDecl)
x = HappyWrap52 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, ParamDecl) -> HappyWrap52
HappyWrap52 (BNFC'Position, ParamDecl)
x)
{-# INLINE happyIn52 #-}
happyOut52 :: (HappyAbsSyn ) -> HappyWrap52
happyOut52 :: HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap52
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut52 #-}
newtype HappyWrap53 = HappyWrap53 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.SigmaParam))
happyIn53 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.SigmaParam)) -> (HappyAbsSyn )
happyIn53 :: (BNFC'Position, SigmaParam) -> HappyAbsSyn
happyIn53 (BNFC'Position, SigmaParam)
x = HappyWrap53 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, SigmaParam) -> HappyWrap53
HappyWrap53 (BNFC'Position, SigmaParam)
x)
{-# INLINE happyIn53 #-}
happyOut53 :: (HappyAbsSyn ) -> HappyWrap53
happyOut53 :: HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap53
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut53 #-}
newtype HappyWrap54 = HappyWrap54 ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.SigmaParam]))
happyIn54 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.SigmaParam])) -> (HappyAbsSyn )
happyIn54 :: (BNFC'Position, [SigmaParam]) -> HappyAbsSyn
happyIn54 (BNFC'Position, [SigmaParam])
x = HappyWrap54 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [SigmaParam]) -> HappyWrap54
HappyWrap54 (BNFC'Position, [SigmaParam])
x)
{-# INLINE happyIn54 #-}
happyOut54 :: (HappyAbsSyn ) -> HappyWrap54
happyOut54 :: HappyAbsSyn -> HappyWrap54
happyOut54 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap54
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut54 #-}
newtype HappyWrap55 = HappyWrap55 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Restriction))
happyIn55 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Restriction)) -> (HappyAbsSyn )
happyIn55 :: (BNFC'Position, Restriction) -> HappyAbsSyn
happyIn55 (BNFC'Position, Restriction)
x = HappyWrap55 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Restriction) -> HappyWrap55
HappyWrap55 (BNFC'Position, Restriction)
x)
{-# INLINE happyIn55 #-}
happyOut55 :: (HappyAbsSyn ) -> HappyWrap55
happyOut55 :: HappyAbsSyn -> HappyWrap55
happyOut55 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap55
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut55 #-}
newtype HappyWrap56 = HappyWrap56 ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Restriction]))
happyIn56 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Restriction])) -> (HappyAbsSyn )
happyIn56 :: (BNFC'Position, [Restriction]) -> HappyAbsSyn
happyIn56 (BNFC'Position, [Restriction])
x = HappyWrap56 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Restriction]) -> HappyWrap56
HappyWrap56 (BNFC'Position, [Restriction])
x)
{-# INLINE happyIn56 #-}
happyOut56 :: (HappyAbsSyn ) -> HappyWrap56
happyOut56 :: HappyAbsSyn -> HappyWrap56
happyOut56 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap56
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut56 #-}
newtype HappyWrap57 = HappyWrap57 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term))
happyIn57 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn57 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn57 (BNFC'Position, Term)
x = HappyWrap57 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap57
HappyWrap57 (BNFC'Position, Term)
x)
{-# INLINE happyIn57 #-}
happyOut57 :: (HappyAbsSyn ) -> HappyWrap57
happyOut57 :: HappyAbsSyn -> HappyWrap57
happyOut57 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap57
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut57 #-}
newtype HappyWrap58 = HappyWrap58 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term))
happyIn58 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn58 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn58 (BNFC'Position, Term)
x = HappyWrap58 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap58
HappyWrap58 (BNFC'Position, Term)
x)
{-# INLINE happyIn58 #-}
happyOut58 :: (HappyAbsSyn ) -> HappyWrap58
happyOut58 :: HappyAbsSyn -> HappyWrap58
happyOut58 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap58
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut58 #-}
newtype HappyWrap59 = HappyWrap59 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term))
happyIn59 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn59 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn59 (BNFC'Position, Term)
x = HappyWrap59 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap59
HappyWrap59 (BNFC'Position, Term)
x)
{-# INLINE happyIn59 #-}
happyOut59 :: (HappyAbsSyn ) -> HappyWrap59
happyOut59 :: HappyAbsSyn -> HappyWrap59
happyOut59 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap59
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut59 #-}
newtype HappyWrap60 = HappyWrap60 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term))
happyIn60 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn60 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn60 (BNFC'Position, Term)
x = HappyWrap60 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap60
HappyWrap60 (BNFC'Position, Term)
x)
{-# INLINE happyIn60 #-}
happyOut60 :: (HappyAbsSyn ) -> HappyWrap60
happyOut60 :: HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap60
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut60 #-}
newtype HappyWrap61 = HappyWrap61 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term))
happyIn61 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn61 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn61 (BNFC'Position, Term)
x = HappyWrap61 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap61
HappyWrap61 (BNFC'Position, Term)
x)
{-# INLINE happyIn61 #-}
happyOut61 :: (HappyAbsSyn ) -> HappyWrap61
happyOut61 :: HappyAbsSyn -> HappyWrap61
happyOut61 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap61
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut61 #-}
newtype HappyWrap62 = HappyWrap62 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term))
happyIn62 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn62 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn62 (BNFC'Position, Term)
x = HappyWrap62 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap62
HappyWrap62 (BNFC'Position, Term)
x)
{-# INLINE happyIn62 #-}
happyOut62 :: (HappyAbsSyn ) -> HappyWrap62
happyOut62 :: HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap62
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut62 #-}
newtype HappyWrap63 = HappyWrap63 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term))
happyIn63 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn63 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn63 (BNFC'Position, Term)
x = HappyWrap63 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap63
HappyWrap63 (BNFC'Position, Term)
x)
{-# INLINE happyIn63 #-}
happyOut63 :: (HappyAbsSyn ) -> HappyWrap63
happyOut63 :: HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap63
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut63 #-}
newtype HappyWrap64 = HappyWrap64 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term))
happyIn64 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn64 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn64 (BNFC'Position, Term)
x = HappyWrap64 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap64
HappyWrap64 (BNFC'Position, Term)
x)
{-# INLINE happyIn64 #-}
happyOut64 :: (HappyAbsSyn ) -> HappyWrap64
happyOut64 :: HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap64
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut64 #-}
newtype HappyWrap65 = HappyWrap65 ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Term]))
happyIn65 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Term])) -> (HappyAbsSyn )
happyIn65 :: (BNFC'Position, [Term]) -> HappyAbsSyn
happyIn65 (BNFC'Position, [Term])
x = HappyWrap65 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Term]) -> HappyWrap65
HappyWrap65 (BNFC'Position, [Term])
x)
{-# INLINE happyIn65 #-}
happyOut65 :: (HappyAbsSyn ) -> HappyWrap65
happyOut65 :: HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap65
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut65 #-}
happyInTok :: (Token) -> (HappyAbsSyn )
happyInTok :: Token -> HappyAbsSyn
happyInTok Token
x = Token -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# Token
x
{-# INLINE happyInTok #-}
happyOutTok :: (HappyAbsSyn ) -> (Token)
happyOutTok :: HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
x = HappyAbsSyn -> Token
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOutTok #-}


happyExpList :: HappyAddr
happyExpList :: HappyAddr
happyExpList = Addr# -> HappyAddr
HappyA# Addr#
"\x00\x00\x00\x00\x00\x00\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\x04\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\x20\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe0\xdf\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x7f\x3f\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\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x80\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x02\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x08\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x20\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x80\x02\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x0a\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x3f\x82\x3d\xf8\x2d\x18\xb0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x20\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x80\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x3f\x82\xbf\xf8\x2d\x9c\xb0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xf6\xc0\x27\x00\xc0\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xd8\x83\xdf\x80\x01\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\x60\x0f\x7e\x03\x06\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x3f\x82\x3d\xf8\x0d\x18\xb0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xf6\xe0\x37\x60\xc0\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\x60\x0f\x7e\x03\x06\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x3f\x82\xbf\xf8\x2d\x9c\xb0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\x06\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\x40\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\x40\x00\x40\x01\x00\x00\x20\xc0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa0\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\x40\xc6\x8f\x60\x1f\x7c\x02\x00\x6c\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\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\xc6\x8f\x60\x0f\x7e\x0b\x06\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x40\x00\x00\x00\x00\x00\x0a\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x3f\x82\x3d\xf0\x09\x00\xb0\x01\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\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\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xd8\x03\x9f\x00\x00\x1b\x00\x00\x00\x00\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\x08\x00\x80\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\x90\xf1\x23\xd8\x03\x9f\x00\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\x60\x0f\x7c\x02\x00\x6c\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xd8\x07\x9f\x00\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x28\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\xc6\x8f\x60\x1f\x7c\x02\x00\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\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\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\x08\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\x01\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\x01\x00\x00\x00\x00\x08\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\x19\x3f\x82\x7d\xf0\x09\x00\xb0\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\x10\x00\x00\x00\x00\x80\x02\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\x01\x00\x00\x00\x00\x08\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x20\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\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\x40\x00\x00\x00\x00\x00\x02\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\x04\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\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x3f\x82\xbf\xf8\x2d\x9c\xb0\x01\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\x08\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\x80\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\x04\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\x80\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\x00\x20\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfe\xfd\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\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\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\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\x04\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\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\xe0\xdf\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\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\x04\x00\x00\x00\x00\x20\x00\x00\x02\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\x08\x00\x00\x00\x00\x02\x00\x20\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\x40\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\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\x04\x00\x00\x00\x00\x20\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x3f\x82\xbf\xf8\x2d\x9c\xb0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xd8\x83\xdf\x80\x01\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\x60\x0f\x7e\x03\x06\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x3f\x82\x3d\xf8\x0d\x18\xb0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x02\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\x10\x00\x00\x00\x00\x80\x00\x00\x08\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\x01\x00\x00\x00\x00\x08\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\x04\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x3f\x82\xbf\xf8\x2d\x9c\xb0\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\x04\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x02\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x88\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x3f\x82\x3d\xf8\x0d\x18\xb0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xf6\xe0\x37\x60\xc0\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xd8\x83\xdf\x80\x01\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\x60\x0f\x7e\x03\x06\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x3f\x82\x3d\xf8\x0d\x18\xb0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xf6\xe0\x37\x60\xc0\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xd8\x83\xdf\x80\x01\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\x60\x0f\x7e\x03\x06\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x3f\x82\xbf\xf8\x2d\x9c\xb0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x3f\x82\xbf\xf8\x2d\x9c\xb0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\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\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\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\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x02\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\x00\x00\x00\x00\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\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\x06\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\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\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\x19\x3f\x82\x7d\xf0\x09\x00\xb0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xf6\xc1\x27\x00\xc0\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x02\x00\x20\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\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\x00\x00\x00\x00\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\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x40\x00\x00\x00\x28\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x01\x00\x00\xa0\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x04\x00\x00\x80\x02\x00\x08\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\x19\x3f\x82\xbf\xf8\x2d\x9c\xb0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\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\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\x06\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\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x02\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\x20\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\x60\x0f\x7e\x03\x06\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x08\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x80\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\x06\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\x40\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x08\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\x06\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x88\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\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\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\x08\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\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\x00\x00\x00\x00\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\x08\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\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\x10\x00\x00\x00\x00\x80\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\x19\x3f\x82\xbf\xf8\x2d\x9c\xb0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\x06\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\x40\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\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\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\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\x40\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\x00\x00\x00\x00\x00\x00\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\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\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\x19\x3f\x82\xbf\xf8\x2d\x9c\xb0\x01\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\x20\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\x20\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\x02\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\x01\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\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\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\x80\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\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\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\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\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x3f\x82\xbf\xf8\x2d\x9c\xb0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xfc\x08\xfe\xe2\xb7\x70\xc2\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x3f\x82\xbf\xf8\x2d\x9c\xb0\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\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xc6\x8f\xe0\x2f\x7e\x0b\x27\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\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\x90\xf1\x23\xf8\x8b\xdf\xc2\x09\x1b\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\x19\x3f\x82\xbf\xf8\x2d\x9c\xb0\x01\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"#

{-# NOINLINE happyExpListPerState #-}
happyExpListPerState :: Int -> [String]
happyExpListPerState Int
st =
    [String]
token_strs_expected
  where token_strs :: [String]
token_strs = [String
"error",String
"%dummy",String
"%start_pModule_internal",String
"%start_pHoleIdent_internal",String
"%start_pVarIdent_internal",String
"%start_pListVarIdent_internal",String
"%start_pLanguageDecl_internal",String
"%start_pLanguage_internal",String
"%start_pCommand_internal",String
"%start_pListCommand_internal",String
"%start_pDeclUsedVars_internal",String
"%start_pSectionName_internal",String
"%start_pPattern_internal",String
"%start_pListPattern_internal",String
"%start_pPattern1_internal",String
"%start_pListPattern1_internal",String
"%start_pParam_internal",String
"%start_pListParam_internal",String
"%start_pParamDecl_internal",String
"%start_pSigmaParam_internal",String
"%start_pListSigmaParam_internal",String
"%start_pRestriction_internal",String
"%start_pListRestriction_internal",String
"%start_pTerm7_internal",String
"%start_pTerm5_internal",String
"%start_pTerm4_internal",String
"%start_pTerm3_internal",String
"%start_pTerm2_internal",String
"%start_pTerm1_internal",String
"%start_pTerm6_internal",String
"%start_pTerm_internal",String
"%start_pListTerm_internal",String
"String",String
"VarIdentToken",String
"HoleIdentToken",String
"Module",String
"HoleIdent",String
"VarIdent",String
"ListVarIdent",String
"LanguageDecl",String
"Language",String
"Command",String
"ListCommand",String
"DeclUsedVars",String
"SectionName",String
"Pattern",String
"ListPattern",String
"Pattern1",String
"ListPattern1",String
"Param",String
"ListParam",String
"ParamDecl",String
"SigmaParam",String
"ListSigmaParam",String
"Restriction",String
"ListRestriction",String
"Term7",String
"Term5",String
"Term4",String
"Term3",String
"Term2",String
"Term1",String
"Term6",String
"Term",String
"ListTerm",String
"'#assume'",String
"'#check'",String
"'#compute'",String
"'#compute-nf'",String
"'#compute-whnf'",String
"'#def'",String
"'#define'",String
"'#end'",String
"'#lang'",String
"'#postulate'",String
"'#section'",String
"'#set-option'",String
"'#unset-option'",String
"'#variable'",String
"'#variables'",String
"'('",String
"')'",String
"'*'",String
"'*_1'",String
"'*\8321'",String
"','",String
"'->'",String
"'/\\\\'",String
"'0_2'",String
"'0\8322'",String
"'1'",String
"'1_2'",String
"'1\8322'",String
"'2'",String
"':'",String
"':='",String
"';'",String
"'<'",String
"'<='",String
"'='",String
"'==='",String
"'=_{'",String
"'>'",String
"'BOT'",String
"'CUBE'",String
"'Sigma'",String
"'TOP'",String
"'TOPE'",String
"'U'",String
"'Unit'",String
"'['",String
"'\\\\'",String
"'\\\\/'",String
"']'",String
"'as'",String
"'first'",String
"'idJ'",String
"'recBOT'",String
"'recOR'",String
"'refl'",String
"'refl_{'",String
"'rzk-1'",String
"'second'",String
"'unit'",String
"'uses'",String
"'{'",String
"'|'",String
"'|->'",String
"'}'",String
"'\215'",String
"'\931'",String
"'\960\8321'",String
"'\960\8322'",String
"'\8594'",String
"'\8614'",String
"'\8721'",String
"'\8743'",String
"'\8744'",String
"'\8801'",String
"'\8804'",String
"'\8868'",String
"'\8869'",String
"L_quoted",String
"L_VarIdentToken",String
"L_HoleIdentToken",String
"%eof"]
        bit_start :: Int
bit_start = Int
st Int -> Int -> Int
forall a. Num a => a -> a -> a
Prelude.* Int
146
        bit_end :: Int
bit_end = (Int
st Int -> Int -> Int
forall a. Num a => a -> a -> a
Prelude.+ Int
1) Int -> Int -> Int
forall a. Num a => a -> a -> a
Prelude.* Int
146
        read_bit :: Int -> Bool
read_bit = HappyAddr -> Int -> Bool
readArrayBit HappyAddr
happyExpList
        bits :: [Bool]
bits = (Int -> Bool) -> [Int] -> [Bool]
forall a b. (a -> b) -> [a] -> [b]
Prelude.map Int -> Bool
read_bit [Int
bit_start..Int
bit_end Int -> Int -> Int
forall a. Num a => a -> a -> a
Prelude.- Int
1]
        bits_indexed :: [(Bool, Int)]
bits_indexed = [Bool] -> [Int] -> [(Bool, Int)]
forall a b. [a] -> [b] -> [(a, b)]
Prelude.zip [Bool]
bits [Int
0..Int
145]
        token_strs_expected :: [String]
token_strs_expected = ((Bool, Int) -> [String]) -> [(Bool, Int)] -> [String]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
Prelude.concatMap (Bool, Int) -> [String]
f [(Bool, Int)]
bits_indexed
        f :: (Bool, Int) -> [String]
f (Bool
Prelude.False, Int
_) = []
        f (Bool
Prelude.True, Int
nr) = [[String]
token_strs [String] -> Int -> String
forall a. HasCallStack => [a] -> Int -> a
Prelude.!! Int
nr]

happyActOffsets :: HappyAddr
happyActOffsets :: HappyAddr
happyActOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\x06\x00\xc5\xff\xdb\xff\xdb\xff\x4e\x00\x2a\x00\x3d\x07\x3d\x07\x20\x00\x4b\x00\x23\x00\x23\x00\x23\x00\x23\x00\x2c\x00\x2c\x00\x5c\x00\x23\x00\x23\x00\x1e\x00\x1e\x00\x40\x01\x9a\x00\x9a\x00\x9a\x00\x9a\x00\x1e\x00\x9a\x00\x1e\x00\x1e\x00\x55\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf0\xff\x00\x00\x4d\x01\xfc\xff\xd7\xff\xa6\x00\x00\x00\xd8\x00\x8c\x00\x6d\x00\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x00\x00\x00\x94\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2c\x00\x40\x01\xb8\x00\x00\x00\xba\x00\x00\x00\x1e\x00\x40\x01\x00\x00\x24\x00\xcf\x00\x40\x01\x40\x01\xec\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb0\x00\xf1\xff\x1e\x00\x0a\x00\xb0\x00\xb0\x00\x16\x01\xb0\x00\xb0\x00\x54\x00\xb0\x00\xf5\x00\xc3\x00\xd1\xff\xc3\x00\x00\x00\xfc\x00\x06\x01\xd2\x00\xa9\x00\x00\x00\xd2\x00\xd2\x00\x16\x01\x00\x00\x2c\x00\xd2\x00\xa9\x00\xa9\x00\xd2\x00\x00\x00\x18\x01\xda\x00\xda\x00\xa9\x00\xda\x00\xda\x00\x00\x00\xda\x00\xda\x00\x29\x01\x1a\x01\xeb\x00\xf7\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\xf7\x00\xf7\x00\xf7\x00\xf7\x00\xf7\x00\xfa\x00\xfa\x00\xf8\x00\xf8\x00\xfe\x00\xfe\x00\x00\x00\xfe\x00\x1c\x01\x08\x01\x1f\x01\x1f\x01\x1f\x01\x1f\x01\x3d\x07\x00\x00\x00\x00\x49\x01\x55\x01\x60\x01\x00\x00\x5c\x01\x00\x00\x4b\x01\x00\x00\x4b\x01\x4b\x01\x00\x00\x00\x00\x00\x00\x6b\x01\x73\x01\x3d\x07\x58\x01\x00\x00\xa9\x00\x8a\x01\x88\x00\x99\x01\x00\x00\x00\x00\x1e\x00\xa3\x01\xa9\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\x9a\x00\x9a\x00\x9a\x00\x1e\x00\x53\x00\xa9\x00\x00\x00\x00\x00\xa9\x00\xb3\x01\xa9\x00\x00\x00\xe4\xff\x1e\x00\x1e\x00\x00\x00\xfe\xff\xa9\x00\x0b\x00\xc5\x00\x1e\x00\x1e\x00\x9a\x00\x9a\x00\x9a\x00\x9a\x00\x9a\x00\x9a\x00\x9a\x00\x9a\x00\x1e\x00\x1e\x00\x00\x00\x00\x00\x19\x00\x19\x00\x19\x00\x19\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\xc3\x01\xdc\x01\x1e\x00\x1e\x00\xec\x01\xf7\x01\x9c\x00\x1e\x00\x00\x00\xf3\xff\x1e\x00\xf3\x01\x02\x02\xfa\x01\x0c\x02\xe7\x01\x00\x00\x16\x01\x16\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa9\x00\x00\x02\x1e\x00\x1e\x00\x00\x00\x17\x02\x00\x00\x1e\x00\x1e\x00\x3f\x00\x61\x00\x7d\x00\xe9\x01\x1e\x00\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x02\x1e\x00\x23\x02\x1e\x00\x29\x02\x1e\x00\x00\x00\x00\x00\x00\x00\x0a\x02\xf2\xff\x00\x00\xcb\x00\x9a\x00\xa9\x00\x1e\x00\xa9\x00\x1e\x00\x0e\x00\x1e\x00\x18\x02\x1e\x00\x00\x00\x1e\x00\x00\x00\x00\x00\xa9\x00\x1e\x00\x2b\x02\x3b\x02\x71\x00\xf6\x00\x00\x00\x1e\x00\x00\x00\x1e\x00\x00\x00\x00\x00\x46\x02\x56\x02\x53\x02\x5c\x02\x00\x00\x66\x02\x1e\x00\x00\x00\x67\x02\x70\x02\x76\x02\x77\x02\x00\x00\x00\x00\xa9\x00\x00\x00\x1e\x00\x1e\x00\x72\x02\x1e\x00\x78\x02\x1e\x00\x00\x00\x1e\x00\x00\x00\x79\x02\x1e\x00\x82\x02\x1e\x00\x68\x02\x96\x02\xa0\x02\xa2\x02\xa3\x02\xac\x02\xb2\x02\x88\x02\x93\x02\x1e\x00\x1e\x00\xc2\x02\xc3\x02\xd0\x02\xd6\x02\x00\x00\x00\x00\x1e\x00\x1e\x00\xd3\x02\xdc\x02\x1e\x00\x00\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1e\x00\x00\x00\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb7\x02\x1e\x00\x1e\x00\x00\x00\x00\x00\xe3\x02\xf0\x02\x00\x00\x00\x00\x1e\x00\xf2\x02\x1e\x00\xf7\x02\x00\x00\x00\x00"#

happyGotoOffsets :: HappyAddr
happyGotoOffsets :: HappyAddr
happyGotoOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\x19\x01\x7c\x00\x44\x01\xa1\x00\x0a\x03\x0f\x03\x18\x03\x81\x00\x0d\x03\x80\x00\x51\x01\x15\x00\xe0\x00\x7b\x01\x23\x07\xfd\x06\x76\x06\x6d\x01\x11\x06\xf1\x01\xb1\x01\x14\x01\xf9\x00\x6d\x06\x4b\x06\x01\x06\x41\x05\xbb\x00\x01\x02\x81\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\xc8\x06\x00\x00\x00\x00\x11\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x8b\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x06\x07\xcd\x06\x00\x00\x00\x00\x00\x00\x00\x00\x21\x02\xd3\x06\x00\x00\x2e\x07\x00\x00\xe2\x06\xe8\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xed\x06\x31\x02\x00\x00\x00\x00\x00\x00\xed\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\x51\x07\x00\x00\x00\x00\x00\x00\xed\x06\x00\x00\x08\x07\x00\x00\x4c\x07\x53\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x4e\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd8\x06\x41\x02\x51\x02\x61\x02\x71\x02\x5f\x01\x6b\x06\x33\x01\x92\x06\x78\x01\x27\x03\x28\x03\x25\x07\x61\x07\x00\x00\x00\x00\x00\x00\x00\x00\x29\x03\x67\x07\x00\x00\x00\x00\x00\x00\x00\x00\xed\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2c\x03\x00\x00\x2d\x03\x36\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xff\x00\x69\x07\x00\x00\x28\x07\x00\x00\x4e\x07\x00\x00\x00\x00\x00\x00\xc1\x01\x00\x00\x2f\x06\x81\x02\x91\x02\xa1\x02\xd1\x01\xbe\x06\xc3\x06\x0f\x06\xb1\x02\x00\x00\xaa\x06\x00\x00\x00\x00\xf2\x06\x00\x00\x5c\x07\x00\x00\x00\x00\xe1\x01\xc1\x02\x00\x00\x00\x00\xf4\x06\x00\x00\x00\x00\x91\x01\x51\x05\x1f\x06\x2d\x06\x5b\x06\x66\x06\x1d\x01\x94\x06\x9b\x06\xa3\x06\x61\x05\x71\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd1\x02\xe1\x02\xf1\x02\x01\x03\x00\x00\x00\x00\x81\x05\x91\x05\x00\x00\x00\x00\x00\x00\x11\x03\x00\x00\x00\x00\x21\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xed\x06\xed\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5e\x07\x00\x00\x31\x03\x41\x03\x00\x00\x00\x00\x00\x00\x51\x03\x61\x03\x0f\x07\x11\x07\x1a\x07\x47\x03\x71\x03\x81\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x91\x03\x00\x00\xa1\x03\x00\x00\xb1\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x3d\x06\x4d\x06\xc1\x03\xa1\x06\xd1\x03\x00\x00\xe1\x03\x00\x00\xf1\x03\x00\x00\x01\x04\x00\x00\x00\x00\xef\x06\x11\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa1\x01\x00\x00\x21\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x31\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2d\x07\x00\x00\x41\x04\x51\x04\x00\x00\x61\x04\x00\x00\x71\x04\x00\x00\x81\x04\x00\x00\x00\x00\x91\x04\x00\x00\xa1\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb1\x04\xc1\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa1\x05\xb1\x05\x00\x00\x00\x00\xd1\x04\x00\x00\xc1\x05\xd1\x05\xe1\x05\xf1\x05\x00\x00\x00\x00\x00\x00\x00\x00\xe1\x04\x00\x00\xf1\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x05\x11\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x21\x05\x00\x00\x31\x05\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#
"\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc6\xff\xc3\xff\xc2\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe1\xff\xdc\xff\xdd\xff\x8e\xff\x8d\xff\x00\x00\x66\xff\x80\xff\x7c\xff\x79\xff\x71\xff\x62\xff\x84\xff\x61\xff\x00\x00\x00\x00\x8b\xff\xa0\xff\x8a\xff\x9e\xff\xa1\xff\x89\xff\x9d\xff\x9f\xff\x00\x00\x87\xff\xa3\xff\x00\x00\x88\xff\xa2\xff\xa4\xff\x97\xff\x00\x00\x00\x00\x00\x00\x9a\xff\x00\x00\x92\xff\x00\x00\x00\x00\x93\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x9c\xff\x9b\xff\xe0\xff\xdf\xff\x00\x00\x00\x00\x00\x00\x71\xff\x00\x00\x00\x00\x84\xff\x00\x00\x00\x00\x00\x00\x00\x00\xa6\xff\x00\x00\x00\x00\x00\x00\xbf\xff\x00\x00\xaa\xff\x00\x00\x00\x00\xc0\xff\x00\x00\x00\x00\xb1\xff\xb7\xff\xb3\xff\x00\x00\x00\x00\x00\x00\x00\x00\xba\xff\xb9\xff\x00\x00\x00\x00\xbc\xff\x00\x00\x00\x00\xc1\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\xc2\xff\x00\x00\xc2\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd8\xff\x00\x00\x00\x00\xdb\xff\x00\x00\x00\x00\x00\x00\x00\x00\xc6\xff\xde\xff\xda\xff\x00\x00\x00\x00\x00\x00\xd6\xff\x00\x00\xcc\xff\xc3\xff\xcb\xff\xc3\xff\xc3\xff\xd3\xff\xd2\xff\xd4\xff\x00\x00\x00\x00\xc6\xff\x00\x00\xbb\xff\x00\x00\x00\x00\xbc\xff\x00\x00\xb2\xff\x69\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x67\xff\x68\xff\x00\x00\x00\x00\x00\x00\x64\xff\x00\x00\x00\x00\x00\x00\x65\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x77\xff\x70\xff\x81\xff\x82\xff\x7f\xff\x7e\xff\x7d\xff\x7b\xff\x7a\xff\x78\xff\x63\xff\x60\xff\x8c\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\x91\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x73\xff\x85\xff\x83\xff\xa5\xff\xa8\xff\xa7\xff\xab\xff\xa9\xff\x00\x00\x00\x00\x00\x00\x00\x00\xb8\xff\x00\x00\xc5\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd9\xff\xcd\xff\xce\xff\xd7\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd5\xff\xcf\xff\xc4\xff\x00\x00\x00\x00\x6a\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x99\xff\x00\x00\x72\xff\x6d\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x95\xff\x00\x00\xb0\xff\x00\x00\x86\xff\x96\xff\xab\xff\x00\x00\x00\x00\x00\x00\x90\xff\x00\x00\x00\x00\xae\xff\xab\xff\x00\x00\xab\xff\x00\x00\x74\xff\xbe\xff\x00\x00\xb6\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd0\xff\x00\x00\xd1\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x94\xff\xaf\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xac\xff\x00\x00\x00\x00\x00\x00\x00\x00\xbd\xff\xb5\xff\xb4\xff\xc7\xff\x00\x00\xc9\xff\x00\x00\xca\xff\xc8\xff\x6b\xff\x6c\xff\x75\xff\x76\xff\x00\x00\x00\x00\x00\x00\x6e\xff\x6f\xff\x00\x00\x00\x00\xad\xff\x98\xff\x00\x00\x00\x00\x00\x00\x00\x00\x8f\xff"#

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

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

happyReduceArr :: Array
  Int
  (Int#
   -> Token
   -> Int#
   -> Happy_IntList
   -> HappyStk HappyAbsSyn
   -> [Token]
   -> Err HappyAbsSyn)
happyReduceArr = (Int, Int)
-> [(Int,
     Int#
     -> Token
     -> Int#
     -> Happy_IntList
     -> HappyStk HappyAbsSyn
     -> [Token]
     -> Err HappyAbsSyn)]
-> Array
     Int
     (Int#
      -> Token
      -> Int#
      -> Happy_IntList
      -> HappyStk HappyAbsSyn
      -> [Token]
      -> Err HappyAbsSyn)
forall i e. Ix i => (i, i) -> [(i, e)] -> Array i e
Happy_Data_Array.array (Int
30, Int
159) [
	(Int
30 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_30),
	(Int
31 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_31),
	(Int
32 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_32),
	(Int
33 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_33),
	(Int
34 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_34),
	(Int
35 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_35),
	(Int
36 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_36),
	(Int
37 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_37),
	(Int
38 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_38),
	(Int
39 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_39),
	(Int
40 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_40),
	(Int
41 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_41),
	(Int
42 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_42),
	(Int
43 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_43),
	(Int
44 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_44),
	(Int
45 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_45),
	(Int
46 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_46),
	(Int
47 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_47),
	(Int
48 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_48),
	(Int
49 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_49),
	(Int
50 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_50),
	(Int
51 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_51),
	(Int
52 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_52),
	(Int
53 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_53),
	(Int
54 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_54),
	(Int
55 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_55),
	(Int
56 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_56),
	(Int
57 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_57),
	(Int
58 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_58),
	(Int
59 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_59),
	(Int
60 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_60),
	(Int
61 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_61),
	(Int
62 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_62),
	(Int
63 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_63),
	(Int
64 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_64),
	(Int
65 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_65),
	(Int
66 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_66),
	(Int
67 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_67),
	(Int
68 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_68),
	(Int
69 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_69),
	(Int
70 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_70),
	(Int
71 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_71),
	(Int
72 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_72),
	(Int
73 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_73),
	(Int
74 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_74),
	(Int
75 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_75),
	(Int
76 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_76),
	(Int
77 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_77),
	(Int
78 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_78),
	(Int
79 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_79),
	(Int
80 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_80),
	(Int
81 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_81),
	(Int
82 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_82),
	(Int
83 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_83),
	(Int
84 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_84),
	(Int
85 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_85),
	(Int
86 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_86),
	(Int
87 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_87),
	(Int
88 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_88),
	(Int
89 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_89),
	(Int
90 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_90),
	(Int
91 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_91),
	(Int
92 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_92),
	(Int
93 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_93),
	(Int
94 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_94),
	(Int
95 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_95),
	(Int
96 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_96),
	(Int
97 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_97),
	(Int
98 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_98),
	(Int
99 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_99),
	(Int
100 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_100),
	(Int
101 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_101),
	(Int
102 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_102),
	(Int
103 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_103),
	(Int
104 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_104),
	(Int
105 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_105),
	(Int
106 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_106),
	(Int
107 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_107),
	(Int
108 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_108),
	(Int
109 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_109),
	(Int
110 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_110),
	(Int
111 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_111),
	(Int
112 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_112),
	(Int
113 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_113),
	(Int
114 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_114),
	(Int
115 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_115),
	(Int
116 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_116),
	(Int
117 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_117),
	(Int
118 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_118),
	(Int
119 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_119),
	(Int
120 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_120),
	(Int
121 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_121),
	(Int
122 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_122),
	(Int
123 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_123),
	(Int
124 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_124),
	(Int
125 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_125),
	(Int
126 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_126),
	(Int
127 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_127),
	(Int
128 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_128),
	(Int
129 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_129),
	(Int
130 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_130),
	(Int
131 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_131),
	(Int
132 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_132),
	(Int
133 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_133),
	(Int
134 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_134),
	(Int
135 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_135),
	(Int
136 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_136),
	(Int
137 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_137),
	(Int
138 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_138),
	(Int
139 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_139),
	(Int
140 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_140),
	(Int
141 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_141),
	(Int
142 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_142),
	(Int
143 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_143),
	(Int
144 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_144),
	(Int
145 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_145),
	(Int
146 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_146),
	(Int
147 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_147),
	(Int
148 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_148),
	(Int
149 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_149),
	(Int
150 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_150),
	(Int
151 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_151),
	(Int
152 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_152),
	(Int
153 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_153),
	(Int
154 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_154),
	(Int
155 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_155),
	(Int
156 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_156),
	(Int
157 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_157),
	(Int
158 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_158),
	(Int
159 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_159)
	]

happy_n_terms :: Int
happy_n_terms = Int
82 :: Prelude.Int
happy_n_nonterms :: Int
happy_n_nonterms = Int
33 :: Prelude.Int

happyReduce_30 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_30 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
0# HappyAbsSyn -> HappyAbsSyn
happyReduction_30
happyReduction_30 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_30 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, String) -> HappyAbsSyn
happyIn33
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), ((\(PT Posn
_ (TL String
s)) -> String
s) Token
happy_var_1))
	)}

happyReduce_31 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_31 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
1# HappyAbsSyn -> HappyAbsSyn
happyReduction_31
happyReduction_31 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_31 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, VarIdentToken) -> HappyAbsSyn
happyIn34
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), String -> VarIdentToken
Language.Rzk.Syntax.Abs.VarIdentToken (Token -> String
tokenText Token
happy_var_1))
	)}

happyReduce_32 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_32 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
2# HappyAbsSyn -> HappyAbsSyn
happyReduction_32
happyReduction_32 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_32 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, HoleIdentToken) -> HappyAbsSyn
happyIn35
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), String -> HoleIdentToken
Language.Rzk.Syntax.Abs.HoleIdentToken (Token -> String
tokenText Token
happy_var_1))
	)}

happyReduce_33 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_33 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2  Int#
3# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_33
happyReduction_33 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_33 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_1 of { (HappyWrap40 (BNFC'Position, LanguageDecl)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap43
happyOut43 HappyAbsSyn
happy_x_2 of { (HappyWrap43 (BNFC'Position, [Command])
happy_var_2) -> 
	(BNFC'Position, Module) -> HappyAbsSyn
happyIn36
		 (((BNFC'Position, LanguageDecl) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, LanguageDecl)
happy_var_1, BNFC'Position -> LanguageDecl -> [Command] -> Module
forall a. a -> LanguageDecl' a -> [Command' a] -> Module' a
Language.Rzk.Syntax.Abs.Module ((BNFC'Position, LanguageDecl) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, LanguageDecl)
happy_var_1) ((BNFC'Position, LanguageDecl) -> LanguageDecl
forall a b. (a, b) -> b
snd (BNFC'Position, LanguageDecl)
happy_var_1) ((BNFC'Position, [Command]) -> [Command]
forall a b. (a, b) -> b
snd (BNFC'Position, [Command])
happy_var_2))
	)}}

happyReduce_34 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_34 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
4# HappyAbsSyn -> HappyAbsSyn
happyReduction_34
happyReduction_34 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_34 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap35
happyOut35 HappyAbsSyn
happy_x_1 of { (HappyWrap35 (BNFC'Position, HoleIdentToken)
happy_var_1) -> 
	(BNFC'Position, HoleIdent) -> HappyAbsSyn
happyIn37
		 (((BNFC'Position, HoleIdentToken) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, HoleIdentToken)
happy_var_1, BNFC'Position -> HoleIdentToken -> HoleIdent
forall a. a -> HoleIdentToken -> HoleIdent' a
Language.Rzk.Syntax.Abs.HoleIdent ((BNFC'Position, HoleIdentToken) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, HoleIdentToken)
happy_var_1) ((BNFC'Position, HoleIdentToken) -> HoleIdentToken
forall a b. (a, b) -> b
snd (BNFC'Position, HoleIdentToken)
happy_var_1))
	)}

happyReduce_35 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_35 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
5# HappyAbsSyn -> HappyAbsSyn
happyReduction_35
happyReduction_35 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_35 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap34
happyOut34 HappyAbsSyn
happy_x_1 of { (HappyWrap34 (BNFC'Position, VarIdentToken)
happy_var_1) -> 
	(BNFC'Position, VarIdent) -> HappyAbsSyn
happyIn38
		 (((BNFC'Position, VarIdentToken) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, VarIdentToken)
happy_var_1, BNFC'Position -> VarIdentToken -> VarIdent
forall a. a -> VarIdentToken -> VarIdent' a
Language.Rzk.Syntax.Abs.VarIdent ((BNFC'Position, VarIdentToken) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, VarIdentToken)
happy_var_1) ((BNFC'Position, VarIdentToken) -> VarIdentToken
forall a b. (a, b) -> b
snd (BNFC'Position, VarIdentToken)
happy_var_1))
	)}

happyReduce_36 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_36 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
6# HappyAbsSyn -> HappyAbsSyn
happyReduction_36
happyReduction_36 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_36 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_1 of { (HappyWrap38 (BNFC'Position, VarIdent)
happy_var_1) -> 
	(BNFC'Position, [VarIdent]) -> HappyAbsSyn
happyIn39
		 (((BNFC'Position, VarIdent) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1, (VarIdent -> [VarIdent] -> [VarIdent]
forall a. a -> [a] -> [a]
:[]) ((BNFC'Position, VarIdent) -> VarIdent
forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_1))
	)}

happyReduce_37 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_37 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2  Int#
6# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_37
happyReduction_37 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_37 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_1 of { (HappyWrap38 (BNFC'Position, VarIdent)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_2 of { (HappyWrap39 (BNFC'Position, [VarIdent])
happy_var_2) -> 
	(BNFC'Position, [VarIdent]) -> HappyAbsSyn
happyIn39
		 (((BNFC'Position, VarIdent) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1, (:) ((BNFC'Position, VarIdent) -> VarIdent
forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_1) ((BNFC'Position, [VarIdent]) -> [VarIdent]
forall a b. (a, b) -> b
snd (BNFC'Position, [VarIdent])
happy_var_2))
	)}}

happyReduce_38 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_38 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
7# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_38
happyReduction_38 :: p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_38 p
happy_x_3
	HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap41
happyOut41 HappyAbsSyn
happy_x_2 of { (HappyWrap41 (BNFC'Position, Language)
happy_var_2) -> 
	(BNFC'Position, LanguageDecl) -> HappyAbsSyn
happyIn40
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Language -> LanguageDecl
forall a. a -> Language' a -> LanguageDecl' a
Language.Rzk.Syntax.Abs.LanguageDecl ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Language) -> Language
forall a b. (a, b) -> b
snd (BNFC'Position, Language)
happy_var_2))
	)}}

happyReduce_39 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_39 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
8# HappyAbsSyn -> HappyAbsSyn
happyReduction_39
happyReduction_39 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_39 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Language) -> HappyAbsSyn
happyIn41
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Language
forall a. a -> Language' a
Language.Rzk.Syntax.Abs.Rzk1 ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_40 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_40 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
9# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_40
happyReduction_40 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_40 (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 { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap33
happyOut33 HappyAbsSyn
happy_x_2 of { (HappyWrap33 (BNFC'Position, String)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap33
happyOut33 HappyAbsSyn
happy_x_4 of { (HappyWrap33 (BNFC'Position, String)
happy_var_4) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> String -> String -> Command
forall a. a -> String -> String -> Command' a
Language.Rzk.Syntax.Abs.CommandSetOption ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, String) -> String
forall a b. (a, b) -> b
snd (BNFC'Position, String)
happy_var_2) ((BNFC'Position, String) -> String
forall a b. (a, b) -> b
snd (BNFC'Position, String)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_41 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_41 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2  Int#
9# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_41
happyReduction_41 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_41 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap33
happyOut33 HappyAbsSyn
happy_x_2 of { (HappyWrap33 (BNFC'Position, String)
happy_var_2) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> String -> Command
forall a. a -> String -> Command' a
Language.Rzk.Syntax.Abs.CommandUnsetOption ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, String) -> String
forall a b. (a, b) -> b
snd (BNFC'Position, String)
happy_var_2))
	)}}

happyReduce_42 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_42 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
9# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_42
happyReduction_42 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_42 (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 { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_2 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_4 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_4) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term -> Command
forall a. a -> Term' a -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.CommandCheck ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_43 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_43 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2  Int#
9# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_43
happyReduction_43 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_43 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_2 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_2) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Command
forall a. a -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.CommandCompute ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
	)}}

happyReduce_44 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_44 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2  Int#
9# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_44
happyReduction_44 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_44 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_2 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_2) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Command
forall a. a -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.CommandComputeWHNF ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
	)}}

happyReduce_45 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_45 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2  Int#
9# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_45
happyReduction_45 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_45 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_2 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_2) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Command
forall a. a -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.CommandComputeNF ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
	)}}

happyReduce_46 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_46 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
6# Int#
9# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_46
happyReduction_46 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_46 (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 { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_2 of { (HappyWrap38 (BNFC'Position, VarIdent)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap44
happyOut44 HappyAbsSyn
happy_x_3 of { (HappyWrap44 (BNFC'Position, DeclUsedVars)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap51
happyOut51 HappyAbsSyn
happy_x_4 of { (HappyWrap51 (BNFC'Position, [Param])
happy_var_4) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_6 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_6) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position
-> VarIdent -> DeclUsedVars -> [Param] -> Term -> Command
forall a.
a
-> VarIdent' a
-> DeclUsedVars' a
-> [Param' a]
-> Term' a
-> Command' a
Language.Rzk.Syntax.Abs.CommandPostulate ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, VarIdent) -> VarIdent
forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_2) ((BNFC'Position, DeclUsedVars) -> DeclUsedVars
forall a b. (a, b) -> b
snd (BNFC'Position, DeclUsedVars)
happy_var_3) ((BNFC'Position, [Param]) -> [Param]
forall a b. (a, b) -> b
snd (BNFC'Position, [Param])
happy_var_4) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_6))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}

happyReduce_47 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_47 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
9# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_47
happyReduction_47 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_47 (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 { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_2 of { (HappyWrap38 (BNFC'Position, VarIdent)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap44
happyOut44 HappyAbsSyn
happy_x_3 of { (HappyWrap44 (BNFC'Position, DeclUsedVars)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_5 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_5) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> VarIdent -> DeclUsedVars -> Term -> Command
forall a.
a -> VarIdent' a -> DeclUsedVars' a -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.commandPostulateNoParams ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, VarIdent) -> VarIdent
forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_2) ((BNFC'Position, DeclUsedVars) -> DeclUsedVars
forall a b. (a, b) -> b
snd (BNFC'Position, DeclUsedVars)
happy_var_3) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_48 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_48 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
9# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_48
happyReduction_48 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_48 (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 { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_2 of { (HappyWrap39 (BNFC'Position, [VarIdent])
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_4 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_4) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> [VarIdent] -> Term -> Command
forall a. a -> [VarIdent' a] -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.CommandAssume ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, [VarIdent]) -> [VarIdent]
forall a b. (a, b) -> b
snd (BNFC'Position, [VarIdent])
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_49 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_49 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
9# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_49
happyReduction_49 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_49 (HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_2 of { (HappyWrap38 (BNFC'Position, VarIdent)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_4 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_4) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> VarIdent -> Term -> Command
forall a. a -> VarIdent' a -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.commandVariable ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, VarIdent) -> VarIdent
forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_50 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_50 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
9# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_50
happyReduction_50 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_50 (HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_2 of { (HappyWrap39 (BNFC'Position, [VarIdent])
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_4 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_4) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> [VarIdent] -> Term -> Command
forall a. a -> [VarIdent' a] -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.commandVariables ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, [VarIdent]) -> [VarIdent]
forall a b. (a, b) -> b
snd (BNFC'Position, [VarIdent])
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_51 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_51 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2  Int#
9# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_51
happyReduction_51 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_51 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
happy_x_2 of { (HappyWrap45 (BNFC'Position, SectionName)
happy_var_2) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> SectionName -> Command
forall a. a -> SectionName' a -> Command' a
Language.Rzk.Syntax.Abs.CommandSection ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, SectionName) -> SectionName
forall a b. (a, b) -> b
snd (BNFC'Position, SectionName)
happy_var_2))
	)}}

happyReduce_52 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_52 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2  Int#
9# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_52
happyReduction_52 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_52 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
happy_x_2 of { (HappyWrap45 (BNFC'Position, SectionName)
happy_var_2) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> SectionName -> Command
forall a. a -> SectionName' a -> Command' a
Language.Rzk.Syntax.Abs.CommandSectionEnd ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, SectionName) -> SectionName
forall a b. (a, b) -> b
snd (BNFC'Position, SectionName)
happy_var_2))
	)}}

happyReduce_53 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_53 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
8# Int#
9# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_53
happyReduction_53 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_53 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_2 of { (HappyWrap38 (BNFC'Position, VarIdent)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap44
happyOut44 HappyAbsSyn
happy_x_3 of { (HappyWrap44 (BNFC'Position, DeclUsedVars)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap51
happyOut51 HappyAbsSyn
happy_x_4 of { (HappyWrap51 (BNFC'Position, [Param])
happy_var_4) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_6 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_6) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_8 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_8) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position
-> VarIdent -> DeclUsedVars -> [Param] -> Term -> Term -> Command
forall a.
a
-> VarIdent' a
-> DeclUsedVars' a
-> [Param' a]
-> Term' a
-> Term' a
-> Command' a
Language.Rzk.Syntax.Abs.CommandDefine ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, VarIdent) -> VarIdent
forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_2) ((BNFC'Position, DeclUsedVars) -> DeclUsedVars
forall a b. (a, b) -> b
snd (BNFC'Position, DeclUsedVars)
happy_var_3) ((BNFC'Position, [Param]) -> [Param]
forall a b. (a, b) -> b
snd (BNFC'Position, [Param])
happy_var_4) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_6) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_8))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}}

happyReduce_54 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_54 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
7# Int#
9# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_54
happyReduction_54 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_54 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_2 of { (HappyWrap38 (BNFC'Position, VarIdent)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap44
happyOut44 HappyAbsSyn
happy_x_3 of { (HappyWrap44 (BNFC'Position, DeclUsedVars)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_5 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_5) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_7 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_7) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position
-> VarIdent -> DeclUsedVars -> Term -> Term -> Command
forall a.
a
-> VarIdent' a
-> DeclUsedVars' a
-> Term' a
-> Term' a
-> Command' a
Language.Rzk.Syntax.Abs.commandDefineNoParams ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, VarIdent) -> VarIdent
forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_2) ((BNFC'Position, DeclUsedVars) -> DeclUsedVars
forall a b. (a, b) -> b
snd (BNFC'Position, DeclUsedVars)
happy_var_3) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_7))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}

happyReduce_55 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_55 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
8# Int#
9# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_55
happyReduction_55 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_55 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_2 of { (HappyWrap38 (BNFC'Position, VarIdent)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap44
happyOut44 HappyAbsSyn
happy_x_3 of { (HappyWrap44 (BNFC'Position, DeclUsedVars)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap51
happyOut51 HappyAbsSyn
happy_x_4 of { (HappyWrap51 (BNFC'Position, [Param])
happy_var_4) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_6 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_6) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_8 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_8) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position
-> VarIdent -> DeclUsedVars -> [Param] -> Term -> Term -> Command
forall a.
a
-> VarIdent' a
-> DeclUsedVars' a
-> [Param' a]
-> Term' a
-> Term' a
-> Command' a
Language.Rzk.Syntax.Abs.commandDef ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, VarIdent) -> VarIdent
forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_2) ((BNFC'Position, DeclUsedVars) -> DeclUsedVars
forall a b. (a, b) -> b
snd (BNFC'Position, DeclUsedVars)
happy_var_3) ((BNFC'Position, [Param]) -> [Param]
forall a b. (a, b) -> b
snd (BNFC'Position, [Param])
happy_var_4) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_6) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_8))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}}

happyReduce_56 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_56 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
7# Int#
9# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_56
happyReduction_56 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_56 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_2 of { (HappyWrap38 (BNFC'Position, VarIdent)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap44
happyOut44 HappyAbsSyn
happy_x_3 of { (HappyWrap44 (BNFC'Position, DeclUsedVars)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_5 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_5) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_7 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_7) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn42
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position
-> VarIdent -> DeclUsedVars -> Term -> Term -> Command
forall a.
a
-> VarIdent' a
-> DeclUsedVars' a
-> Term' a
-> Term' a
-> Command' a
Language.Rzk.Syntax.Abs.commandDefNoParams ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, VarIdent) -> VarIdent
forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_2) ((BNFC'Position, DeclUsedVars) -> DeclUsedVars
forall a b. (a, b) -> b
snd (BNFC'Position, DeclUsedVars)
happy_var_3) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_7))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}

happyReduce_57 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_57 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_0  Int#
10# HappyAbsSyn
happyReduction_57
happyReduction_57 :: HappyAbsSyn
happyReduction_57  =  (BNFC'Position, [Command]) -> HappyAbsSyn
happyIn43
		 ((BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'NoPosition, [])
	)

happyReduce_58 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_58 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
10# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_58
happyReduction_58 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_58 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap42
happyOut42 HappyAbsSyn
happy_x_1 of { (HappyWrap42 (BNFC'Position, Command)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap43
happyOut43 HappyAbsSyn
happy_x_3 of { (HappyWrap43 (BNFC'Position, [Command])
happy_var_3) -> 
	(BNFC'Position, [Command]) -> HappyAbsSyn
happyIn43
		 (((BNFC'Position, Command) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Command)
happy_var_1, (:) ((BNFC'Position, Command) -> Command
forall a b. (a, b) -> b
snd (BNFC'Position, Command)
happy_var_1) ((BNFC'Position, [Command]) -> [Command]
forall a b. (a, b) -> b
snd (BNFC'Position, [Command])
happy_var_3))
	)}}

happyReduce_59 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_59 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
11# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_59
happyReduction_59 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_59 (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 { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_3 of { (HappyWrap39 (BNFC'Position, [VarIdent])
happy_var_3) -> 
	(BNFC'Position, DeclUsedVars) -> HappyAbsSyn
happyIn44
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> [VarIdent] -> DeclUsedVars
forall a. a -> [VarIdent' a] -> DeclUsedVars' a
Language.Rzk.Syntax.Abs.DeclUsedVars ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, [VarIdent]) -> [VarIdent]
forall a b. (a, b) -> b
snd (BNFC'Position, [VarIdent])
happy_var_3))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_60 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_60 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_0  Int#
11# HappyAbsSyn
happyReduction_60
happyReduction_60 :: HappyAbsSyn
happyReduction_60  =  (BNFC'Position, DeclUsedVars) -> HappyAbsSyn
happyIn44
		 ((BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'NoPosition, BNFC'Position -> DeclUsedVars
forall a. a -> DeclUsedVars' a
Language.Rzk.Syntax.Abs.noDeclUsedVars BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'NoPosition)
	)

happyReduce_61 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_61 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_0  Int#
12# HappyAbsSyn
happyReduction_61
happyReduction_61 :: HappyAbsSyn
happyReduction_61  =  (BNFC'Position, SectionName) -> HappyAbsSyn
happyIn45
		 ((BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'NoPosition, BNFC'Position -> SectionName
forall a. a -> SectionName' a
Language.Rzk.Syntax.Abs.NoSectionName BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'NoPosition)
	)

happyReduce_62 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_62 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
12# HappyAbsSyn -> HappyAbsSyn
happyReduction_62
happyReduction_62 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_62 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_1 of { (HappyWrap38 (BNFC'Position, VarIdent)
happy_var_1) -> 
	(BNFC'Position, SectionName) -> HappyAbsSyn
happyIn45
		 (((BNFC'Position, VarIdent) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1, BNFC'Position -> VarIdent -> SectionName
forall a. a -> VarIdent' a -> SectionName' a
Language.Rzk.Syntax.Abs.SomeSectionName ((BNFC'Position, VarIdent) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1) ((BNFC'Position, VarIdent) -> VarIdent
forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_1))
	)}

happyReduce_63 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_63 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
13# HappyAbsSyn -> HappyAbsSyn
happyReduction_63
happyReduction_63 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_63 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Pattern) -> HappyAbsSyn
happyIn46
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Pattern
forall a. a -> Pattern' a
Language.Rzk.Syntax.Abs.PatternUnit ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_64 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_64 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
13# HappyAbsSyn -> HappyAbsSyn
happyReduction_64
happyReduction_64 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_64 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_1 of { (HappyWrap38 (BNFC'Position, VarIdent)
happy_var_1) -> 
	(BNFC'Position, Pattern) -> HappyAbsSyn
happyIn46
		 (((BNFC'Position, VarIdent) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1, BNFC'Position -> VarIdent -> Pattern
forall a. a -> VarIdent' a -> Pattern' a
Language.Rzk.Syntax.Abs.PatternVar ((BNFC'Position, VarIdent) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1) ((BNFC'Position, VarIdent) -> VarIdent
forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_1))
	)}

happyReduce_65 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_65 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
13# 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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_2 of { (HappyWrap46 (BNFC'Position, Pattern)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_4 of { (HappyWrap46 (BNFC'Position, Pattern)
happy_var_4) -> 
	(BNFC'Position, Pattern) -> HappyAbsSyn
happyIn46
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Pattern -> Pattern -> Pattern
forall a. a -> Pattern' a -> Pattern' a -> Pattern' a
Language.Rzk.Syntax.Abs.PatternPair ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_2) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_66 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_66 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
7# Int#
13# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_66
happyReduction_66 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_66 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_2 of { (HappyWrap46 (BNFC'Position, Pattern)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_4 of { (HappyWrap46 (BNFC'Position, Pattern)
happy_var_4) -> 
	case HappyAbsSyn -> HappyWrap49
happyOut49 HappyAbsSyn
happy_x_6 of { (HappyWrap49 (BNFC'Position, [Pattern])
happy_var_6) -> 
	(BNFC'Position, Pattern) -> HappyAbsSyn
happyIn46
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Pattern -> Pattern -> [Pattern] -> Pattern
forall a.
a -> Pattern' a -> Pattern' a -> [Pattern' a] -> Pattern' a
Language.Rzk.Syntax.Abs.PatternTuple ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_2) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_4) ((BNFC'Position, [Pattern]) -> [Pattern]
forall a b. (a, b) -> b
snd (BNFC'Position, [Pattern])
happy_var_6))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_67 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_67 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
14# HappyAbsSyn -> HappyAbsSyn
happyReduction_67
happyReduction_67 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_67 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_1 of { (HappyWrap46 (BNFC'Position, Pattern)
happy_var_1) -> 
	(BNFC'Position, [Pattern]) -> HappyAbsSyn
happyIn47
		 (((BNFC'Position, Pattern) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Pattern)
happy_var_1, (Pattern -> [Pattern] -> [Pattern]
forall a. a -> [a] -> [a]
:[]) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_1))
	)}

happyReduce_68 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_68 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2  Int#
14# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_68
happyReduction_68 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_68 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_1 of { (HappyWrap46 (BNFC'Position, Pattern)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_2 of { (HappyWrap47 (BNFC'Position, [Pattern])
happy_var_2) -> 
	(BNFC'Position, [Pattern]) -> HappyAbsSyn
happyIn47
		 (((BNFC'Position, Pattern) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Pattern)
happy_var_1, (:) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_1) ((BNFC'Position, [Pattern]) -> [Pattern]
forall a b. (a, b) -> b
snd (BNFC'Position, [Pattern])
happy_var_2))
	)}}

happyReduce_69 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_69 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
15# HappyAbsSyn -> HappyAbsSyn
happyReduction_69
happyReduction_69 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_69 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_1 of { (HappyWrap46 (BNFC'Position, Pattern)
happy_var_1) -> 
	(BNFC'Position, Pattern) -> HappyAbsSyn
happyIn48
		 (((BNFC'Position, Pattern) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Pattern)
happy_var_1, ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_1))
	)}

happyReduce_70 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_70 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
16# HappyAbsSyn -> HappyAbsSyn
happyReduction_70
happyReduction_70 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_70 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap48
happyOut48 HappyAbsSyn
happy_x_1 of { (HappyWrap48 (BNFC'Position, Pattern)
happy_var_1) -> 
	(BNFC'Position, [Pattern]) -> HappyAbsSyn
happyIn49
		 (((BNFC'Position, Pattern) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Pattern)
happy_var_1, (Pattern -> [Pattern] -> [Pattern]
forall a. a -> [a] -> [a]
:[]) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_1))
	)}

happyReduce_71 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_71 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
16# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_71
happyReduction_71 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_71 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap48
happyOut48 HappyAbsSyn
happy_x_1 of { (HappyWrap48 (BNFC'Position, Pattern)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap49
happyOut49 HappyAbsSyn
happy_x_3 of { (HappyWrap49 (BNFC'Position, [Pattern])
happy_var_3) -> 
	(BNFC'Position, [Pattern]) -> HappyAbsSyn
happyIn49
		 (((BNFC'Position, Pattern) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Pattern)
happy_var_1, (:) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_1) ((BNFC'Position, [Pattern]) -> [Pattern]
forall a b. (a, b) -> b
snd (BNFC'Position, [Pattern])
happy_var_3))
	)}}

happyReduce_72 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_72 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
17# HappyAbsSyn -> HappyAbsSyn
happyReduction_72
happyReduction_72 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_72 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_1 of { (HappyWrap46 (BNFC'Position, Pattern)
happy_var_1) -> 
	(BNFC'Position, Param) -> HappyAbsSyn
happyIn50
		 (((BNFC'Position, Pattern) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Pattern)
happy_var_1, BNFC'Position -> Pattern -> Param
forall a. a -> Pattern' a -> Param' a
Language.Rzk.Syntax.Abs.ParamPattern ((BNFC'Position, Pattern) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Pattern)
happy_var_1) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_1))
	)}

happyReduce_73 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_73 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
17# 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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_2 of { (HappyWrap47 (BNFC'Position, [Pattern])
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_4 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_4) -> 
	(BNFC'Position, Param) -> HappyAbsSyn
happyIn50
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> [Pattern] -> Term -> Param
forall a. a -> [Pattern' a] -> Term' a -> Param' a
Language.Rzk.Syntax.Abs.ParamPatternType ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, [Pattern]) -> [Pattern]
forall a b. (a, b) -> b
snd (BNFC'Position, [Pattern])
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_74 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_74 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
7# Int#
17# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_74
happyReduction_74 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_74 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_2 of { (HappyWrap47 (BNFC'Position, [Pattern])
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_4 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_4) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_6 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_6) -> 
	(BNFC'Position, Param) -> HappyAbsSyn
happyIn50
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> [Pattern] -> Term -> Term -> Param
forall a. a -> [Pattern' a] -> Term' a -> Term' a -> Param' a
Language.Rzk.Syntax.Abs.ParamPatternShape ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, [Pattern]) -> [Pattern]
forall a b. (a, b) -> b
snd (BNFC'Position, [Pattern])
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_6))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_75 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_75 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
7# Int#
17# 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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_2 of { (HappyWrap46 (BNFC'Position, Pattern)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_4 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_4) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_6 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_6) -> 
	(BNFC'Position, Param) -> HappyAbsSyn
happyIn50
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Pattern -> Term -> Term -> Param
forall a. a -> Pattern' a -> Term' a -> Term' a -> Param' a
Language.Rzk.Syntax.Abs.ParamPatternShapeDeprecated ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_6))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_76 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_76 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
18# HappyAbsSyn -> HappyAbsSyn
happyReduction_76
happyReduction_76 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_76 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
happy_x_1 of { (HappyWrap50 (BNFC'Position, Param)
happy_var_1) -> 
	(BNFC'Position, [Param]) -> HappyAbsSyn
happyIn51
		 (((BNFC'Position, Param) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Param)
happy_var_1, (Param -> [Param] -> [Param]
forall a. a -> [a] -> [a]
:[]) ((BNFC'Position, Param) -> Param
forall a b. (a, b) -> b
snd (BNFC'Position, Param)
happy_var_1))
	)}

happyReduce_77 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_77 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2  Int#
18# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_77
happyReduction_77 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_77 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
happy_x_1 of { (HappyWrap50 (BNFC'Position, Param)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap51
happyOut51 HappyAbsSyn
happy_x_2 of { (HappyWrap51 (BNFC'Position, [Param])
happy_var_2) -> 
	(BNFC'Position, [Param]) -> HappyAbsSyn
happyIn51
		 (((BNFC'Position, Param) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Param)
happy_var_1, (:) ((BNFC'Position, Param) -> Param
forall a b. (a, b) -> b
snd (BNFC'Position, Param)
happy_var_1) ((BNFC'Position, [Param]) -> [Param]
forall a b. (a, b) -> b
snd (BNFC'Position, [Param])
happy_var_2))
	)}}

happyReduce_78 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_78 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
19# HappyAbsSyn -> HappyAbsSyn
happyReduction_78
happyReduction_78 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_78 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_1 of { (HappyWrap63 (BNFC'Position, Term)
happy_var_1) -> 
	(BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn52
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> ParamDecl
forall a. a -> Term' a -> ParamDecl' a
Language.Rzk.Syntax.Abs.ParamType ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
	)}

happyReduce_79 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_79 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
19# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_79
happyReduction_79 :: HappyStk HappyAbsSyn -> HappyStk 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)
	 = case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_2 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_4 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_4) -> 
	(BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn52
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term -> ParamDecl
forall a. a -> Term' a -> Term' a -> ParamDecl' a
Language.Rzk.Syntax.Abs.ParamTermType ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_80 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_80 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
7# Int#
19# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_80
happyReduction_80 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_80 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_2 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_4 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_4) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_6 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_6) -> 
	(BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn52
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term -> Term -> ParamDecl
forall a. a -> Term' a -> Term' a -> Term' a -> ParamDecl' a
Language.Rzk.Syntax.Abs.ParamTermShape ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_6))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_81 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_81 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
19# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_81
happyReduction_81 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_81 (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 { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_2 of { (HappyWrap46 (BNFC'Position, Pattern)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_4 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_4) -> 
	(BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn52
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Pattern -> Term -> ParamDecl
forall a. a -> Pattern' a -> Term' a -> ParamDecl' a
Language.Rzk.Syntax.Abs.ParamTermTypeDeprecated ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_82 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_82 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
9# Int#
19# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_82
happyReduction_82 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_82 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_3 of { (HappyWrap46 (BNFC'Position, Pattern)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_5 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_5) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_8 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_8) -> 
	(BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn52
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Pattern -> Term -> Term -> ParamDecl
forall a. a -> Pattern' a -> Term' a -> Term' a -> ParamDecl' a
Language.Rzk.Syntax.Abs.ParamVarShapeDeprecated ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_3) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_8))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_83 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_83 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
7# Int#
19# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_83
happyReduction_83 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_83 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_2 of { (HappyWrap46 (BNFC'Position, Pattern)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_4 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_4) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_6 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_6) -> 
	(BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn52
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Pattern -> Term -> Term -> ParamDecl
forall a. a -> Pattern' a -> Term' a -> Term' a -> ParamDecl' a
Language.Rzk.Syntax.Abs.paramVarShapeDeprecated ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_6))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_84 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_84 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
20# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_84
happyReduction_84 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_84 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_1 of { (HappyWrap46 (BNFC'Position, Pattern)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_3 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, SigmaParam) -> HappyAbsSyn
happyIn53
		 (((BNFC'Position, Pattern) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Pattern)
happy_var_1, BNFC'Position -> Pattern -> Term -> SigmaParam
forall a. a -> Pattern' a -> Term' a -> SigmaParam' a
Language.Rzk.Syntax.Abs.SigmaParam ((BNFC'Position, Pattern) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Pattern)
happy_var_1) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_85 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_85 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
21# HappyAbsSyn -> HappyAbsSyn
happyReduction_85
happyReduction_85 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_85 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_1 of { (HappyWrap53 (BNFC'Position, SigmaParam)
happy_var_1) -> 
	(BNFC'Position, [SigmaParam]) -> HappyAbsSyn
happyIn54
		 (((BNFC'Position, SigmaParam) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, SigmaParam)
happy_var_1, (SigmaParam -> [SigmaParam] -> [SigmaParam]
forall a. a -> [a] -> [a]
:[]) ((BNFC'Position, SigmaParam) -> SigmaParam
forall a b. (a, b) -> b
snd (BNFC'Position, SigmaParam)
happy_var_1))
	)}

happyReduce_86 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_86 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
21# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_86
happyReduction_86 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_86 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_1 of { (HappyWrap53 (BNFC'Position, SigmaParam)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap54
happyOut54 HappyAbsSyn
happy_x_3 of { (HappyWrap54 (BNFC'Position, [SigmaParam])
happy_var_3) -> 
	(BNFC'Position, [SigmaParam]) -> HappyAbsSyn
happyIn54
		 (((BNFC'Position, SigmaParam) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, SigmaParam)
happy_var_1, (:) ((BNFC'Position, SigmaParam) -> SigmaParam
forall a b. (a, b) -> b
snd (BNFC'Position, SigmaParam)
happy_var_1) ((BNFC'Position, [SigmaParam]) -> [SigmaParam]
forall a b. (a, b) -> b
snd (BNFC'Position, [SigmaParam])
happy_var_3))
	)}}

happyReduce_87 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_87 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
22# 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 -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_1 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_3 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Restriction) -> HappyAbsSyn
happyIn55
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Restriction
forall a. a -> Term' a -> Term' a -> Restriction' a
Language.Rzk.Syntax.Abs.Restriction ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_88 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_88 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
22# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_88
happyReduction_88 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_88 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_1 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_3 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Restriction) -> HappyAbsSyn
happyIn55
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Restriction
forall a. a -> Term' a -> Term' a -> Restriction' a
Language.Rzk.Syntax.Abs.ASCII_Restriction ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_89 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_89 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
23# HappyAbsSyn -> HappyAbsSyn
happyReduction_89
happyReduction_89 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_89 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap55
happyOut55 HappyAbsSyn
happy_x_1 of { (HappyWrap55 (BNFC'Position, Restriction)
happy_var_1) -> 
	(BNFC'Position, [Restriction]) -> HappyAbsSyn
happyIn56
		 (((BNFC'Position, Restriction) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Restriction)
happy_var_1, (Restriction -> [Restriction] -> [Restriction]
forall a. a -> [a] -> [a]
:[]) ((BNFC'Position, Restriction) -> Restriction
forall a b. (a, b) -> b
snd (BNFC'Position, Restriction)
happy_var_1))
	)}

happyReduce_90 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_90 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
23# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_90
happyReduction_90 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_90 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap55
happyOut55 HappyAbsSyn
happy_x_1 of { (HappyWrap55 (BNFC'Position, Restriction)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap56
happyOut56 HappyAbsSyn
happy_x_3 of { (HappyWrap56 (BNFC'Position, [Restriction])
happy_var_3) -> 
	(BNFC'Position, [Restriction]) -> HappyAbsSyn
happyIn56
		 (((BNFC'Position, Restriction) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Restriction)
happy_var_1, (:) ((BNFC'Position, Restriction) -> Restriction
forall a b. (a, b) -> b
snd (BNFC'Position, Restriction)
happy_var_1) ((BNFC'Position, [Restriction]) -> [Restriction]
forall a b. (a, b) -> b
snd (BNFC'Position, [Restriction])
happy_var_3))
	)}}

happyReduce_91 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_91 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_91
happyReduction_91 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_91 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.Universe ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_92 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_92 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_92
happyReduction_92 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_92 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.UniverseCube ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_93 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_93 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_93
happyReduction_93 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_93 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.UniverseTope ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_94 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_94 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_94
happyReduction_94 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_94 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.CubeUnit ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_95 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_95 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_95
happyReduction_95 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_95 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.CubeUnitStar ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_96 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_96 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_96
happyReduction_96 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_96 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.Cube2 ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_97 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_97 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_97
happyReduction_97 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_97 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.Cube2_0 ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_98 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_98 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_98
happyReduction_98 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_98 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.Cube2_1 ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_99 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_99 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_99
happyReduction_99 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_99 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.TopeTop ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_100 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_100 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_100
happyReduction_100 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_100 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.TopeBottom ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_101 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_101 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_101
happyReduction_101 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_101 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.RecBottom ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_102 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_102 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
24# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_102
happyReduction_102 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_102 (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 { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap56
happyOut56 HappyAbsSyn
happy_x_3 of { (HappyWrap56 (BNFC'Position, [Restriction])
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> [Restriction] -> Term
forall a. a -> [Restriction' a] -> Term' a
Language.Rzk.Syntax.Abs.RecOr ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, [Restriction]) -> [Restriction]
forall a b. (a, b) -> b
snd (BNFC'Position, [Restriction])
happy_var_3))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_103 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_103 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
10# Int#
24# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_103
happyReduction_103 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_103 (HappyAbsSyn
happy_x_10 `HappyStk`
	HappyAbsSyn
happy_x_9 `HappyStk`
	HappyAbsSyn
happy_x_8 `HappyStk`
	HappyAbsSyn
happy_x_7 `HappyStk`
	HappyAbsSyn
happy_x_6 `HappyStk`
	HappyAbsSyn
happy_x_5 `HappyStk`
	HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_3 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_5 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_5) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_7 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_7) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_9 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_9) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.RecOrDeprecated ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_7) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_9))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}

happyReduce_104 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_104 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_104
happyReduction_104 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_104 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.TypeUnit ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_105 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_105 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
24# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_105
happyReduction_105 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_105 (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 { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_2 of { (HappyWrap52 (BNFC'Position, ParamDecl)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_4 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_4) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> ParamDecl -> Term -> Term
forall a. a -> ParamDecl' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TypeExtensionDeprecated ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, ParamDecl) -> ParamDecl
forall a b. (a, b) -> b
snd (BNFC'Position, ParamDecl)
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_106 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_106 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
24# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_106
happyReduction_106 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_106 (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 { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_2 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_4 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_4) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.Pair ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_107 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_107 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
7# Int#
24# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_107
happyReduction_107 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_107 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_2 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_4 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_4) -> 
	case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_6 of { (HappyWrap65 (BNFC'Position, [Term])
happy_var_6) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term -> [Term] -> Term
forall a. a -> Term' a -> Term' a -> [Term' a] -> Term' a
Language.Rzk.Syntax.Abs.Tuple ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4) ((BNFC'Position, [Term]) -> [Term]
forall a b. (a, b) -> b
snd (BNFC'Position, [Term])
happy_var_6))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_108 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_108 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_108
happyReduction_108 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_108 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.Unit ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_109 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_109 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_109
happyReduction_109 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_109 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.Refl ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_110 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_110 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
24# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_110
happyReduction_110 :: p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_110 p
happy_x_3
	HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_2 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_2) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term
forall a. a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.ReflTerm ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
	)}}

happyReduce_111 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_111 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
24# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_111
happyReduction_111 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_111 (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 { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_2 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_4 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_4) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.ReflTermType ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_112 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_112 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
14# Int#
24# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_112
happyReduction_112 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_112 (HappyAbsSyn
happy_x_14 `HappyStk`
	HappyAbsSyn
happy_x_13 `HappyStk`
	HappyAbsSyn
happy_x_12 `HappyStk`
	HappyAbsSyn
happy_x_11 `HappyStk`
	HappyAbsSyn
happy_x_10 `HappyStk`
	HappyAbsSyn
happy_x_9 `HappyStk`
	HappyAbsSyn
happy_x_8 `HappyStk`
	HappyAbsSyn
happy_x_7 `HappyStk`
	HappyAbsSyn
happy_x_6 `HappyStk`
	HappyAbsSyn
happy_x_5 `HappyStk`
	HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_3 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_5 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_5) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_7 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_7) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_9 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_9) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_11 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_11) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_13 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_13) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position
-> Term -> Term -> Term -> Term -> Term -> Term -> Term
forall a.
a
-> Term' a
-> Term' a
-> Term' a
-> Term' a
-> Term' a
-> Term' a
-> Term' a
Language.Rzk.Syntax.Abs.IdJ ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_7) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_9) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_11) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_13))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}}}

happyReduce_113 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_113 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_113
happyReduction_113 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_113 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap37
happyOut37 HappyAbsSyn
happy_x_1 of { (HappyWrap37 (BNFC'Position, HoleIdent)
happy_var_1) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((BNFC'Position, HoleIdent) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, HoleIdent)
happy_var_1, BNFC'Position -> HoleIdent -> Term
forall a. a -> HoleIdent' a -> Term' a
Language.Rzk.Syntax.Abs.Hole ((BNFC'Position, HoleIdent) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, HoleIdent)
happy_var_1) ((BNFC'Position, HoleIdent) -> HoleIdent
forall a b. (a, b) -> b
snd (BNFC'Position, HoleIdent)
happy_var_1))
	)}

happyReduce_114 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_114 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_114
happyReduction_114 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_114 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_1 of { (HappyWrap38 (BNFC'Position, VarIdent)
happy_var_1) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((BNFC'Position, VarIdent) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1, BNFC'Position -> VarIdent -> Term
forall a. a -> VarIdent' a -> Term' a
Language.Rzk.Syntax.Abs.Var ((BNFC'Position, VarIdent) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1) ((BNFC'Position, VarIdent) -> VarIdent
forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_1))
	)}

happyReduce_115 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_115 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
24# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_115
happyReduction_115 :: p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_115 p
happy_x_3
	HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_2 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_2) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
	)}}

happyReduce_116 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_116 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_116
happyReduction_116 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_116 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.ASCII_CubeUnitStar ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_117 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_117 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_117
happyReduction_117 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_117 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.ASCII_Cube2_0 ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_118 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_118 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_118
happyReduction_118 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_118 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.ASCII_Cube2_1 ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_119 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_119 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_119
happyReduction_119 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_119 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.ASCII_TopeTop ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_120 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_120 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_120
happyReduction_120 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_120 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.Rzk.Syntax.Abs.ASCII_TopeBottom ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_121 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_121 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
24# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_121
happyReduction_121 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_121 (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 { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_2 of { (HappyWrap52 (BNFC'Position, ParamDecl)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_4 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_4) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn57
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> ParamDecl -> Term -> Term
forall a. a -> ParamDecl' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.ASCII_TypeExtensionDeprecated ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, ParamDecl) -> ParamDecl
forall a b. (a, b) -> b
snd (BNFC'Position, ParamDecl)
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_122 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_122 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
25# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_122
happyReduction_122 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_122 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_1 of { (HappyWrap58 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_3 of { (HappyWrap63 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn58
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.CubeProduct ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_123 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_123 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
25# HappyAbsSyn -> HappyAbsSyn
happyReduction_123
happyReduction_123 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_123 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_1 of { (HappyWrap63 (BNFC'Position, Term)
happy_var_1) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn58
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
	)}

happyReduce_124 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_124 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
25# 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 -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_1 of { (HappyWrap58 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_3 of { (HappyWrap63 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn58
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.ascii_CubeProduct ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_125 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_125 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
26# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_125
happyReduction_125 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_125 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_1 of { (HappyWrap58 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_3 of { (HappyWrap58 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn59
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TopeEQ ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_126 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_126 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
26# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_126
happyReduction_126 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_126 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_1 of { (HappyWrap58 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_3 of { (HappyWrap58 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn59
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TopeLEQ ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_127 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_127 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
26# HappyAbsSyn -> HappyAbsSyn
happyReduction_127
happyReduction_127 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_127 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_1 of { (HappyWrap58 (BNFC'Position, Term)
happy_var_1) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn59
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
	)}

happyReduce_128 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_128 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
26# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_128
happyReduction_128 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_128 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_1 of { (HappyWrap58 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_3 of { (HappyWrap58 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn59
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.ASCII_TopeEQ ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_129 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_129 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
26# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_129
happyReduction_129 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_129 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_1 of { (HappyWrap58 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_3 of { (HappyWrap58 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn59
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.ASCII_TopeLEQ ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_130 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_130 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
27# 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 -> HappyWrap59
happyOut59 HappyAbsSyn
happy_x_1 of { (HappyWrap59 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_3 of { (HappyWrap60 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn60
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TopeAnd ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_131 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_131 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
27# HappyAbsSyn -> HappyAbsSyn
happyReduction_131
happyReduction_131 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_131 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap59
happyOut59 HappyAbsSyn
happy_x_1 of { (HappyWrap59 (BNFC'Position, Term)
happy_var_1) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn60
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
	)}

happyReduce_132 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_132 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
27# 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 -> HappyWrap59
happyOut59 HappyAbsSyn
happy_x_1 of { (HappyWrap59 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_3 of { (HappyWrap60 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn60
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.ASCII_TopeAnd ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_133 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_133 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
28# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_133
happyReduction_133 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_133 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_1 of { (HappyWrap60 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap61
happyOut61 HappyAbsSyn
happy_x_3 of { (HappyWrap61 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn61
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TopeOr ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_134 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_134 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
28# HappyAbsSyn -> HappyAbsSyn
happyReduction_134
happyReduction_134 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_134 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_1 of { (HappyWrap60 (BNFC'Position, Term)
happy_var_1) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn61
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
	)}

happyReduce_135 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_135 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
28# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_135
happyReduction_135 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_135 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_1 of { (HappyWrap60 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap61
happyOut61 HappyAbsSyn
happy_x_3 of { (HappyWrap61 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn61
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.ASCII_TopeOr ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_136 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_136 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
29# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_136
happyReduction_136 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_136 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_1 of { (HappyWrap52 (BNFC'Position, ParamDecl)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_3 of { (HappyWrap62 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn62
		 (((BNFC'Position, ParamDecl) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, ParamDecl)
happy_var_1, BNFC'Position -> ParamDecl -> Term -> Term
forall a. a -> ParamDecl' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TypeFun ((BNFC'Position, ParamDecl) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, ParamDecl)
happy_var_1) ((BNFC'Position, ParamDecl) -> ParamDecl
forall a b. (a, b) -> b
snd (BNFC'Position, ParamDecl)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_137 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_137 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
8# Int#
29# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_137
happyReduction_137 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_137 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_3 of { (HappyWrap46 (BNFC'Position, Pattern)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_5 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_5) -> 
	case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_8 of { (HappyWrap62 (BNFC'Position, Term)
happy_var_8) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn62
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Pattern -> Term -> Term -> Term
forall a. a -> Pattern' a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TypeSigma ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_3) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_8))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_138 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_138 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
8# Int#
29# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_138
happyReduction_138 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_138 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_3 of { (HappyWrap53 (BNFC'Position, SigmaParam)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap54
happyOut54 HappyAbsSyn
happy_x_5 of { (HappyWrap54 (BNFC'Position, [SigmaParam])
happy_var_5) -> 
	case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_8 of { (HappyWrap62 (BNFC'Position, Term)
happy_var_8) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn62
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> SigmaParam -> [SigmaParam] -> Term -> Term
forall a.
a -> SigmaParam' a -> [SigmaParam' a] -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TypeSigmaTuple ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, SigmaParam) -> SigmaParam
forall a b. (a, b) -> b
snd (BNFC'Position, SigmaParam)
happy_var_3) ((BNFC'Position, [SigmaParam]) -> [SigmaParam]
forall a b. (a, b) -> b
snd (BNFC'Position, [SigmaParam])
happy_var_5) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_8))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_139 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_139 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
29# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_139
happyReduction_139 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_139 (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 -> HappyWrap61
happyOut61 HappyAbsSyn
happy_x_1 of { (HappyWrap61 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_3 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap61
happyOut61 HappyAbsSyn
happy_x_5 of { (HappyWrap61 (BNFC'Position, Term)
happy_var_5) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn62
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TypeId ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_140 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_140 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
29# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_140
happyReduction_140 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_140 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap61
happyOut61 HappyAbsSyn
happy_x_1 of { (HappyWrap61 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap61
happyOut61 HappyAbsSyn
happy_x_3 of { (HappyWrap61 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn62
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TypeIdSimple ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_141 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_141 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
29# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_141
happyReduction_141 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_141 (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 { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap51
happyOut51 HappyAbsSyn
happy_x_2 of { (HappyWrap51 (BNFC'Position, [Param])
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_4 of { (HappyWrap62 (BNFC'Position, Term)
happy_var_4) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn62
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> [Param] -> Term -> Term
forall a. a -> [Param' a] -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.Lambda ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, [Param]) -> [Param]
forall a b. (a, b) -> b
snd (BNFC'Position, [Param])
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_142 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_142 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
29# HappyAbsSyn -> HappyAbsSyn
happyReduction_142
happyReduction_142 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_142 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap61
happyOut61 HappyAbsSyn
happy_x_1 of { (HappyWrap61 (BNFC'Position, Term)
happy_var_1) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn62
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
	)}

happyReduce_143 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_143 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
29# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_143
happyReduction_143 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_143 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_1 of { (HappyWrap52 (BNFC'Position, ParamDecl)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_3 of { (HappyWrap62 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn62
		 (((BNFC'Position, ParamDecl) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, ParamDecl)
happy_var_1, BNFC'Position -> ParamDecl -> Term -> Term
forall a. a -> ParamDecl' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.ASCII_TypeFun ((BNFC'Position, ParamDecl) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, ParamDecl)
happy_var_1) ((BNFC'Position, ParamDecl) -> ParamDecl
forall a b. (a, b) -> b
snd (BNFC'Position, ParamDecl)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_144 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_144 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
8# Int#
29# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_144
happyReduction_144 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_144 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_3 of { (HappyWrap46 (BNFC'Position, Pattern)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_5 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_5) -> 
	case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_8 of { (HappyWrap62 (BNFC'Position, Term)
happy_var_8) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn62
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Pattern -> Term -> Term -> Term
forall a. a -> Pattern' a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.ASCII_TypeSigma ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_3) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_8))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_145 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_145 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
8# Int#
29# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_145
happyReduction_145 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_145 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_3 of { (HappyWrap53 (BNFC'Position, SigmaParam)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap54
happyOut54 HappyAbsSyn
happy_x_5 of { (HappyWrap54 (BNFC'Position, [SigmaParam])
happy_var_5) -> 
	case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_8 of { (HappyWrap62 (BNFC'Position, Term)
happy_var_8) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn62
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> SigmaParam -> [SigmaParam] -> Term -> Term
forall a.
a -> SigmaParam' a -> [SigmaParam' a] -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.ASCII_TypeSigmaTuple ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, SigmaParam) -> SigmaParam
forall a b. (a, b) -> b
snd (BNFC'Position, SigmaParam)
happy_var_3) ((BNFC'Position, [SigmaParam]) -> [SigmaParam]
forall a b. (a, b) -> b
snd (BNFC'Position, [SigmaParam])
happy_var_5) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_8))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_146 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_146 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
29# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_146
happyReduction_146 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_146 (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 { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap51
happyOut51 HappyAbsSyn
happy_x_2 of { (HappyWrap51 (BNFC'Position, [Param])
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_4 of { (HappyWrap62 (BNFC'Position, Term)
happy_var_4) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn62
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> [Param] -> Term -> Term
forall a. a -> [Param' a] -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.ASCII_Lambda ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, [Param]) -> [Param]
forall a b. (a, b) -> b
snd (BNFC'Position, [Param])
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_147 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_147 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
8# Int#
29# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_147
happyReduction_147 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_147 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_3 of { (HappyWrap46 (BNFC'Position, Pattern)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_5 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_5) -> 
	case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_8 of { (HappyWrap62 (BNFC'Position, Term)
happy_var_8) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn62
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Pattern -> Term -> Term -> Term
forall a. a -> Pattern' a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.unicode_TypeSigmaAlt ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_3) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_8))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_148 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_148 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
8# Int#
29# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_148
happyReduction_148 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_148 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_3 of { (HappyWrap53 (BNFC'Position, SigmaParam)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap54
happyOut54 HappyAbsSyn
happy_x_5 of { (HappyWrap54 (BNFC'Position, [SigmaParam])
happy_var_5) -> 
	case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_8 of { (HappyWrap62 (BNFC'Position, Term)
happy_var_8) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn62
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> SigmaParam -> [SigmaParam] -> Term -> Term
forall a.
a -> SigmaParam' a -> [SigmaParam' a] -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.unicode_TypeSigmaTupleAlt ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, SigmaParam) -> SigmaParam
forall a b. (a, b) -> b
snd (BNFC'Position, SigmaParam)
happy_var_3) ((BNFC'Position, [SigmaParam]) -> [SigmaParam]
forall a b. (a, b) -> b
snd (BNFC'Position, [SigmaParam])
happy_var_5) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_8))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_149 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_149 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
30# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_149
happyReduction_149 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_149 (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 -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_1 of { (HappyWrap63 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap56
happyOut56 HappyAbsSyn
happy_x_3 of { (HappyWrap56 (BNFC'Position, [Restriction])
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn63
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> [Restriction] -> Term
forall a. a -> Term' a -> [Restriction' a] -> Term' a
Language.Rzk.Syntax.Abs.TypeRestricted ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, [Restriction]) -> [Restriction]
forall a b. (a, b) -> b
snd (BNFC'Position, [Restriction])
happy_var_3))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_150 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_150 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2  Int#
30# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_150
happyReduction_150 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_150 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_1 of { (HappyWrap63 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap57
happyOut57 HappyAbsSyn
happy_x_2 of { (HappyWrap57 (BNFC'Position, Term)
happy_var_2) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn63
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.App ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
	)}}

happyReduce_151 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_151 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2  Int#
30# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_151
happyReduction_151 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_151 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap57
happyOut57 HappyAbsSyn
happy_x_2 of { (HappyWrap57 (BNFC'Position, Term)
happy_var_2) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn63
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term
forall a. a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.First ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
	)}}

happyReduce_152 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_152 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2  Int#
30# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_152
happyReduction_152 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_152 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap57
happyOut57 HappyAbsSyn
happy_x_2 of { (HappyWrap57 (BNFC'Position, Term)
happy_var_2) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn63
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term
forall a. a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.Second ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
	)}}

happyReduce_153 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_153 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
30# HappyAbsSyn -> HappyAbsSyn
happyReduction_153
happyReduction_153 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_153 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap57
happyOut57 HappyAbsSyn
happy_x_1 of { (HappyWrap57 (BNFC'Position, Term)
happy_var_1) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn63
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
	)}

happyReduce_154 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_154 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2  Int#
30# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_154
happyReduction_154 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_154 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap57
happyOut57 HappyAbsSyn
happy_x_2 of { (HappyWrap57 (BNFC'Position, Term)
happy_var_2) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn63
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term
forall a. a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.ASCII_First ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
	)}}

happyReduce_155 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_155 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2  Int#
30# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_155
happyReduction_155 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_155 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap57
happyOut57 HappyAbsSyn
happy_x_2 of { (HappyWrap57 (BNFC'Position, Term)
happy_var_2) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn63
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term
forall a. a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.ASCII_Second ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
	)}}

happyReduce_156 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_156 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
31# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_156
happyReduction_156 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_156 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap61
happyOut61 HappyAbsSyn
happy_x_1 of { (HappyWrap61 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_3 of { (HappyWrap62 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn64
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TypeAsc ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_157 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_157 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
31# HappyAbsSyn -> HappyAbsSyn
happyReduction_157
happyReduction_157 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_157 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_1 of { (HappyWrap62 (BNFC'Position, Term)
happy_var_1) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn64
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
	)}

happyReduce_158 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_158 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
32# HappyAbsSyn -> HappyAbsSyn
happyReduction_158
happyReduction_158 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_158 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_1 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_1) -> 
	(BNFC'Position, [Term]) -> HappyAbsSyn
happyIn65
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, (Term -> [Term] -> [Term]
forall a. a -> [a] -> [a]
:[]) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
	)}

happyReduce_159 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_159 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
32# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_159
happyReduction_159 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_159 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_1 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_3 of { (HappyWrap65 (BNFC'Position, [Term])
happy_var_3) -> 
	(BNFC'Position, [Term]) -> HappyAbsSyn
happyIn65
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, (:) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, [Term]) -> [Term]
forall a b. (a, b) -> b
snd (BNFC'Position, [Term])
happy_var_3))
	)}}

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

happyNewToken Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk (Token
tk:[Token]
tks) =
	let cont :: Int# -> Err HappyAbsSyn
cont Int#
i = Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyDoAction Int#
i Token
tk Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk [Token]
tks in
	case Token
tk of {
	PT Posn
_ (TS String
_ Int
1) -> Int# -> Err HappyAbsSyn
cont Int#
1#;
	PT Posn
_ (TS String
_ Int
2) -> Int# -> Err HappyAbsSyn
cont Int#
2#;
	PT Posn
_ (TS String
_ Int
3) -> Int# -> Err HappyAbsSyn
cont Int#
3#;
	PT Posn
_ (TS String
_ Int
4) -> Int# -> Err HappyAbsSyn
cont Int#
4#;
	PT Posn
_ (TS String
_ Int
5) -> Int# -> Err HappyAbsSyn
cont Int#
5#;
	PT Posn
_ (TS String
_ Int
6) -> Int# -> Err HappyAbsSyn
cont Int#
6#;
	PT Posn
_ (TS String
_ Int
7) -> Int# -> Err HappyAbsSyn
cont Int#
7#;
	PT Posn
_ (TS String
_ Int
8) -> Int# -> Err HappyAbsSyn
cont Int#
8#;
	PT Posn
_ (TS String
_ Int
9) -> Int# -> Err HappyAbsSyn
cont Int#
9#;
	PT Posn
_ (TS String
_ Int
10) -> Int# -> Err HappyAbsSyn
cont Int#
10#;
	PT Posn
_ (TS String
_ Int
11) -> Int# -> Err HappyAbsSyn
cont Int#
11#;
	PT Posn
_ (TS String
_ Int
12) -> Int# -> Err HappyAbsSyn
cont Int#
12#;
	PT Posn
_ (TS String
_ Int
13) -> Int# -> Err HappyAbsSyn
cont Int#
13#;
	PT Posn
_ (TS String
_ Int
14) -> Int# -> Err HappyAbsSyn
cont Int#
14#;
	PT Posn
_ (TS String
_ Int
15) -> Int# -> Err HappyAbsSyn
cont Int#
15#;
	PT Posn
_ (TS String
_ Int
16) -> Int# -> Err HappyAbsSyn
cont Int#
16#;
	PT Posn
_ (TS String
_ Int
17) -> Int# -> Err HappyAbsSyn
cont Int#
17#;
	PT Posn
_ (TS String
_ Int
18) -> Int# -> Err HappyAbsSyn
cont Int#
18#;
	PT Posn
_ (TS String
_ Int
19) -> Int# -> Err HappyAbsSyn
cont Int#
19#;
	PT Posn
_ (TS String
_ Int
20) -> Int# -> Err HappyAbsSyn
cont Int#
20#;
	PT Posn
_ (TS String
_ Int
21) -> Int# -> Err HappyAbsSyn
cont Int#
21#;
	PT Posn
_ (TS String
_ Int
22) -> Int# -> Err HappyAbsSyn
cont Int#
22#;
	PT Posn
_ (TS String
_ Int
23) -> Int# -> Err HappyAbsSyn
cont Int#
23#;
	PT Posn
_ (TS String
_ Int
24) -> Int# -> Err HappyAbsSyn
cont Int#
24#;
	PT Posn
_ (TS String
_ Int
25) -> Int# -> Err HappyAbsSyn
cont Int#
25#;
	PT Posn
_ (TS String
_ Int
26) -> Int# -> Err HappyAbsSyn
cont Int#
26#;
	PT Posn
_ (TS String
_ Int
27) -> Int# -> Err HappyAbsSyn
cont Int#
27#;
	PT Posn
_ (TS String
_ Int
28) -> Int# -> Err HappyAbsSyn
cont Int#
28#;
	PT Posn
_ (TS String
_ Int
29) -> Int# -> Err HappyAbsSyn
cont Int#
29#;
	PT Posn
_ (TS String
_ Int
30) -> Int# -> Err HappyAbsSyn
cont Int#
30#;
	PT Posn
_ (TS String
_ Int
31) -> Int# -> Err HappyAbsSyn
cont Int#
31#;
	PT Posn
_ (TS String
_ Int
32) -> Int# -> Err HappyAbsSyn
cont Int#
32#;
	PT Posn
_ (TS String
_ Int
33) -> Int# -> Err HappyAbsSyn
cont Int#
33#;
	PT Posn
_ (TS String
_ Int
34) -> Int# -> Err HappyAbsSyn
cont Int#
34#;
	PT Posn
_ (TS String
_ Int
35) -> Int# -> Err HappyAbsSyn
cont Int#
35#;
	PT Posn
_ (TS String
_ Int
36) -> Int# -> Err HappyAbsSyn
cont Int#
36#;
	PT Posn
_ (TS String
_ Int
37) -> Int# -> Err HappyAbsSyn
cont Int#
37#;
	PT Posn
_ (TS String
_ Int
38) -> Int# -> Err HappyAbsSyn
cont Int#
38#;
	PT Posn
_ (TS String
_ Int
39) -> Int# -> Err HappyAbsSyn
cont Int#
39#;
	PT Posn
_ (TS String
_ Int
40) -> Int# -> Err HappyAbsSyn
cont Int#
40#;
	PT Posn
_ (TS String
_ Int
41) -> Int# -> Err HappyAbsSyn
cont Int#
41#;
	PT Posn
_ (TS String
_ Int
42) -> Int# -> Err HappyAbsSyn
cont Int#
42#;
	PT Posn
_ (TS String
_ Int
43) -> Int# -> Err HappyAbsSyn
cont Int#
43#;
	PT Posn
_ (TS String
_ Int
44) -> Int# -> Err HappyAbsSyn
cont Int#
44#;
	PT Posn
_ (TS String
_ Int
45) -> Int# -> Err HappyAbsSyn
cont Int#
45#;
	PT Posn
_ (TS String
_ Int
46) -> Int# -> Err HappyAbsSyn
cont Int#
46#;
	PT Posn
_ (TS String
_ Int
47) -> Int# -> Err HappyAbsSyn
cont Int#
47#;
	PT Posn
_ (TS String
_ Int
48) -> Int# -> Err HappyAbsSyn
cont Int#
48#;
	PT Posn
_ (TS String
_ Int
49) -> Int# -> Err HappyAbsSyn
cont Int#
49#;
	PT Posn
_ (TS String
_ Int
50) -> Int# -> Err HappyAbsSyn
cont Int#
50#;
	PT Posn
_ (TS String
_ Int
51) -> Int# -> Err HappyAbsSyn
cont Int#
51#;
	PT Posn
_ (TS String
_ Int
52) -> Int# -> Err HappyAbsSyn
cont Int#
52#;
	PT Posn
_ (TS String
_ Int
53) -> Int# -> Err HappyAbsSyn
cont Int#
53#;
	PT Posn
_ (TS String
_ Int
54) -> Int# -> Err HappyAbsSyn
cont Int#
54#;
	PT Posn
_ (TS String
_ Int
55) -> Int# -> Err HappyAbsSyn
cont Int#
55#;
	PT Posn
_ (TS String
_ Int
56) -> Int# -> Err HappyAbsSyn
cont Int#
56#;
	PT Posn
_ (TS String
_ Int
57) -> Int# -> Err HappyAbsSyn
cont Int#
57#;
	PT Posn
_ (TS String
_ Int
58) -> Int# -> Err HappyAbsSyn
cont Int#
58#;
	PT Posn
_ (TS String
_ Int
59) -> Int# -> Err HappyAbsSyn
cont Int#
59#;
	PT Posn
_ (TS String
_ Int
60) -> Int# -> Err HappyAbsSyn
cont Int#
60#;
	PT Posn
_ (TS String
_ Int
61) -> Int# -> Err HappyAbsSyn
cont Int#
61#;
	PT Posn
_ (TS String
_ Int
62) -> Int# -> Err HappyAbsSyn
cont Int#
62#;
	PT Posn
_ (TS String
_ Int
63) -> Int# -> Err HappyAbsSyn
cont Int#
63#;
	PT Posn
_ (TS String
_ Int
64) -> Int# -> Err HappyAbsSyn
cont Int#
64#;
	PT Posn
_ (TS String
_ Int
65) -> Int# -> Err HappyAbsSyn
cont Int#
65#;
	PT Posn
_ (TS String
_ Int
66) -> Int# -> Err HappyAbsSyn
cont Int#
66#;
	PT Posn
_ (TS String
_ Int
67) -> Int# -> Err HappyAbsSyn
cont Int#
67#;
	PT Posn
_ (TS String
_ Int
68) -> Int# -> Err HappyAbsSyn
cont Int#
68#;
	PT Posn
_ (TS String
_ Int
69) -> Int# -> Err HappyAbsSyn
cont Int#
69#;
	PT Posn
_ (TS String
_ Int
70) -> Int# -> Err HappyAbsSyn
cont Int#
70#;
	PT Posn
_ (TS String
_ Int
71) -> Int# -> Err HappyAbsSyn
cont Int#
71#;
	PT Posn
_ (TS String
_ Int
72) -> Int# -> Err HappyAbsSyn
cont Int#
72#;
	PT Posn
_ (TS String
_ Int
73) -> Int# -> Err HappyAbsSyn
cont Int#
73#;
	PT Posn
_ (TS String
_ Int
74) -> Int# -> Err HappyAbsSyn
cont Int#
74#;
	PT Posn
_ (TS String
_ Int
75) -> Int# -> Err HappyAbsSyn
cont Int#
75#;
	PT Posn
_ (TS String
_ Int
76) -> Int# -> Err HappyAbsSyn
cont Int#
76#;
	PT Posn
_ (TS String
_ Int
77) -> Int# -> Err HappyAbsSyn
cont Int#
77#;
	PT Posn
_ (TL String
_) -> Int# -> Err HappyAbsSyn
cont Int#
78#;
	PT Posn
_ (T_VarIdentToken String
_) -> Int# -> Err HappyAbsSyn
cont Int#
79#;
	PT Posn
_ (T_HoleIdentToken String
_) -> Int# -> Err HappyAbsSyn
cont Int#
80#;
	Token
_ -> ([Token], [String]) -> Err HappyAbsSyn
forall a. ([Token], [String]) -> Err a
happyError' ((Token
tkToken -> [Token] -> [Token]
forall a. a -> [a] -> [a]
:[Token]
tks), [])
	}

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

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

pHoleIdent_internal :: [Token] -> Err (BNFC'Position, HoleIdent)
pHoleIdent_internal [Token]
tks = Err (BNFC'Position, HoleIdent)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, HoleIdent)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, HoleIdent))
-> Err (BNFC'Position, HoleIdent)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
1# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, HoleIdent) -> Err (BNFC'Position, HoleIdent)
forall a. a -> Err a
happyReturn (let {(HappyWrap37 (BNFC'Position, HoleIdent)
x') = HappyAbsSyn -> HappyWrap37
happyOut37 HappyAbsSyn
x} in (BNFC'Position, HoleIdent)
x'))

pVarIdent_internal :: [Token] -> Err (BNFC'Position, VarIdent)
pVarIdent_internal [Token]
tks = Err (BNFC'Position, VarIdent)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, VarIdent)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, VarIdent))
-> Err (BNFC'Position, VarIdent)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
2# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, VarIdent) -> Err (BNFC'Position, VarIdent)
forall a. a -> Err a
happyReturn (let {(HappyWrap38 (BNFC'Position, VarIdent)
x') = HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
x} in (BNFC'Position, VarIdent)
x'))

pListVarIdent_internal :: [Token] -> Err (BNFC'Position, [VarIdent])
pListVarIdent_internal [Token]
tks = Err (BNFC'Position, [VarIdent])
happySomeParser where
 happySomeParser :: Err (BNFC'Position, [VarIdent])
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, [VarIdent]))
-> Err (BNFC'Position, [VarIdent])
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
3# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, [VarIdent]) -> Err (BNFC'Position, [VarIdent])
forall a. a -> Err a
happyReturn (let {(HappyWrap39 (BNFC'Position, [VarIdent])
x') = HappyAbsSyn -> HappyWrap39
happyOut39 HappyAbsSyn
x} in (BNFC'Position, [VarIdent])
x'))

pLanguageDecl_internal :: [Token] -> Err (BNFC'Position, LanguageDecl)
pLanguageDecl_internal [Token]
tks = Err (BNFC'Position, LanguageDecl)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, LanguageDecl)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, LanguageDecl))
-> Err (BNFC'Position, LanguageDecl)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
4# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, LanguageDecl) -> Err (BNFC'Position, LanguageDecl)
forall a. a -> Err a
happyReturn (let {(HappyWrap40 (BNFC'Position, LanguageDecl)
x') = HappyAbsSyn -> HappyWrap40
happyOut40 HappyAbsSyn
x} in (BNFC'Position, LanguageDecl)
x'))

pLanguage_internal :: [Token] -> Err (BNFC'Position, Language)
pLanguage_internal [Token]
tks = Err (BNFC'Position, Language)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Language)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Language))
-> Err (BNFC'Position, Language)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
5# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Language) -> Err (BNFC'Position, Language)
forall a. a -> Err a
happyReturn (let {(HappyWrap41 (BNFC'Position, Language)
x') = HappyAbsSyn -> HappyWrap41
happyOut41 HappyAbsSyn
x} in (BNFC'Position, Language)
x'))

pCommand_internal :: [Token] -> Err (BNFC'Position, Command)
pCommand_internal [Token]
tks = Err (BNFC'Position, Command)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Command)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Command))
-> Err (BNFC'Position, Command)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
6# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Command) -> Err (BNFC'Position, Command)
forall a. a -> Err a
happyReturn (let {(HappyWrap42 (BNFC'Position, Command)
x') = HappyAbsSyn -> HappyWrap42
happyOut42 HappyAbsSyn
x} in (BNFC'Position, Command)
x'))

pListCommand_internal :: [Token] -> Err (BNFC'Position, [Command])
pListCommand_internal [Token]
tks = Err (BNFC'Position, [Command])
happySomeParser where
 happySomeParser :: Err (BNFC'Position, [Command])
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, [Command]))
-> Err (BNFC'Position, [Command])
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
7# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, [Command]) -> Err (BNFC'Position, [Command])
forall a. a -> Err a
happyReturn (let {(HappyWrap43 (BNFC'Position, [Command])
x') = HappyAbsSyn -> HappyWrap43
happyOut43 HappyAbsSyn
x} in (BNFC'Position, [Command])
x'))

pDeclUsedVars_internal :: [Token] -> Err (BNFC'Position, DeclUsedVars)
pDeclUsedVars_internal [Token]
tks = Err (BNFC'Position, DeclUsedVars)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, DeclUsedVars)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, DeclUsedVars))
-> Err (BNFC'Position, DeclUsedVars)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
8# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, DeclUsedVars) -> Err (BNFC'Position, DeclUsedVars)
forall a. a -> Err a
happyReturn (let {(HappyWrap44 (BNFC'Position, DeclUsedVars)
x') = HappyAbsSyn -> HappyWrap44
happyOut44 HappyAbsSyn
x} in (BNFC'Position, DeclUsedVars)
x'))

pSectionName_internal :: [Token] -> Err (BNFC'Position, SectionName)
pSectionName_internal [Token]
tks = Err (BNFC'Position, SectionName)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, SectionName)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, SectionName))
-> Err (BNFC'Position, SectionName)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
9# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, SectionName) -> Err (BNFC'Position, SectionName)
forall a. a -> Err a
happyReturn (let {(HappyWrap45 (BNFC'Position, SectionName)
x') = HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
x} in (BNFC'Position, SectionName)
x'))

pPattern_internal :: [Token] -> Err (BNFC'Position, Pattern)
pPattern_internal [Token]
tks = Err (BNFC'Position, Pattern)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Pattern)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Pattern))
-> Err (BNFC'Position, Pattern)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
10# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Pattern) -> Err (BNFC'Position, Pattern)
forall a. a -> Err a
happyReturn (let {(HappyWrap46 (BNFC'Position, Pattern)
x') = HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
x} in (BNFC'Position, Pattern)
x'))

pListPattern_internal :: [Token] -> Err (BNFC'Position, [Pattern])
pListPattern_internal [Token]
tks = Err (BNFC'Position, [Pattern])
happySomeParser where
 happySomeParser :: Err (BNFC'Position, [Pattern])
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, [Pattern]))
-> Err (BNFC'Position, [Pattern])
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
11# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, [Pattern]) -> Err (BNFC'Position, [Pattern])
forall a. a -> Err a
happyReturn (let {(HappyWrap47 (BNFC'Position, [Pattern])
x') = HappyAbsSyn -> HappyWrap47
happyOut47 HappyAbsSyn
x} in (BNFC'Position, [Pattern])
x'))

pPattern1_internal :: [Token] -> Err (BNFC'Position, Pattern)
pPattern1_internal [Token]
tks = Err (BNFC'Position, Pattern)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Pattern)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Pattern))
-> Err (BNFC'Position, Pattern)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
12# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Pattern) -> Err (BNFC'Position, Pattern)
forall a. a -> Err a
happyReturn (let {(HappyWrap48 (BNFC'Position, Pattern)
x') = HappyAbsSyn -> HappyWrap48
happyOut48 HappyAbsSyn
x} in (BNFC'Position, Pattern)
x'))

pListPattern1_internal :: [Token] -> Err (BNFC'Position, [Pattern])
pListPattern1_internal [Token]
tks = Err (BNFC'Position, [Pattern])
happySomeParser where
 happySomeParser :: Err (BNFC'Position, [Pattern])
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, [Pattern]))
-> Err (BNFC'Position, [Pattern])
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
13# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, [Pattern]) -> Err (BNFC'Position, [Pattern])
forall a. a -> Err a
happyReturn (let {(HappyWrap49 (BNFC'Position, [Pattern])
x') = HappyAbsSyn -> HappyWrap49
happyOut49 HappyAbsSyn
x} in (BNFC'Position, [Pattern])
x'))

pParam_internal :: [Token] -> Err (BNFC'Position, Param)
pParam_internal [Token]
tks = Err (BNFC'Position, Param)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Param)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Param))
-> Err (BNFC'Position, Param)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
14# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Param) -> Err (BNFC'Position, Param)
forall a. a -> Err a
happyReturn (let {(HappyWrap50 (BNFC'Position, Param)
x') = HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
x} in (BNFC'Position, Param)
x'))

pListParam_internal :: [Token] -> Err (BNFC'Position, [Param])
pListParam_internal [Token]
tks = Err (BNFC'Position, [Param])
happySomeParser where
 happySomeParser :: Err (BNFC'Position, [Param])
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, [Param]))
-> Err (BNFC'Position, [Param])
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
15# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, [Param]) -> Err (BNFC'Position, [Param])
forall a. a -> Err a
happyReturn (let {(HappyWrap51 (BNFC'Position, [Param])
x') = HappyAbsSyn -> HappyWrap51
happyOut51 HappyAbsSyn
x} in (BNFC'Position, [Param])
x'))

pParamDecl_internal :: [Token] -> Err (BNFC'Position, ParamDecl)
pParamDecl_internal [Token]
tks = Err (BNFC'Position, ParamDecl)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, ParamDecl)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, ParamDecl))
-> Err (BNFC'Position, ParamDecl)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
16# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, ParamDecl) -> Err (BNFC'Position, ParamDecl)
forall a. a -> Err a
happyReturn (let {(HappyWrap52 (BNFC'Position, ParamDecl)
x') = HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
x} in (BNFC'Position, ParamDecl)
x'))

pSigmaParam_internal :: [Token] -> Err (BNFC'Position, SigmaParam)
pSigmaParam_internal [Token]
tks = Err (BNFC'Position, SigmaParam)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, SigmaParam)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, SigmaParam))
-> Err (BNFC'Position, SigmaParam)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
17# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, SigmaParam) -> Err (BNFC'Position, SigmaParam)
forall a. a -> Err a
happyReturn (let {(HappyWrap53 (BNFC'Position, SigmaParam)
x') = HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
x} in (BNFC'Position, SigmaParam)
x'))

pListSigmaParam_internal :: [Token] -> Err (BNFC'Position, [SigmaParam])
pListSigmaParam_internal [Token]
tks = Err (BNFC'Position, [SigmaParam])
happySomeParser where
 happySomeParser :: Err (BNFC'Position, [SigmaParam])
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, [SigmaParam]))
-> Err (BNFC'Position, [SigmaParam])
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
18# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, [SigmaParam]) -> Err (BNFC'Position, [SigmaParam])
forall a. a -> Err a
happyReturn (let {(HappyWrap54 (BNFC'Position, [SigmaParam])
x') = HappyAbsSyn -> HappyWrap54
happyOut54 HappyAbsSyn
x} in (BNFC'Position, [SigmaParam])
x'))

pRestriction_internal :: [Token] -> Err (BNFC'Position, Restriction)
pRestriction_internal [Token]
tks = Err (BNFC'Position, Restriction)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Restriction)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Restriction))
-> Err (BNFC'Position, Restriction)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
19# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Restriction) -> Err (BNFC'Position, Restriction)
forall a. a -> Err a
happyReturn (let {(HappyWrap55 (BNFC'Position, Restriction)
x') = HappyAbsSyn -> HappyWrap55
happyOut55 HappyAbsSyn
x} in (BNFC'Position, Restriction)
x'))

pListRestriction_internal :: [Token] -> Err (BNFC'Position, [Restriction])
pListRestriction_internal [Token]
tks = Err (BNFC'Position, [Restriction])
happySomeParser where
 happySomeParser :: Err (BNFC'Position, [Restriction])
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, [Restriction]))
-> Err (BNFC'Position, [Restriction])
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
20# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, [Restriction])
-> Err (BNFC'Position, [Restriction])
forall a. a -> Err a
happyReturn (let {(HappyWrap56 (BNFC'Position, [Restriction])
x') = HappyAbsSyn -> HappyWrap56
happyOut56 HappyAbsSyn
x} in (BNFC'Position, [Restriction])
x'))

pTerm7_internal :: [Token] -> Err (BNFC'Position, Term)
pTerm7_internal [Token]
tks = Err (BNFC'Position, Term)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Term)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Term))
-> Err (BNFC'Position, Term)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
21# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Term) -> Err (BNFC'Position, Term)
forall a. a -> Err a
happyReturn (let {(HappyWrap57 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap57
happyOut57 HappyAbsSyn
x} in (BNFC'Position, Term)
x'))

pTerm5_internal :: [Token] -> Err (BNFC'Position, Term)
pTerm5_internal [Token]
tks = Err (BNFC'Position, Term)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Term)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Term))
-> Err (BNFC'Position, Term)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
22# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Term) -> Err (BNFC'Position, Term)
forall a. a -> Err a
happyReturn (let {(HappyWrap58 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap58
happyOut58 HappyAbsSyn
x} in (BNFC'Position, Term)
x'))

pTerm4_internal :: [Token] -> Err (BNFC'Position, Term)
pTerm4_internal [Token]
tks = Err (BNFC'Position, Term)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Term)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Term))
-> Err (BNFC'Position, Term)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
23# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Term) -> Err (BNFC'Position, Term)
forall a. a -> Err a
happyReturn (let {(HappyWrap59 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap59
happyOut59 HappyAbsSyn
x} in (BNFC'Position, Term)
x'))

pTerm3_internal :: [Token] -> Err (BNFC'Position, Term)
pTerm3_internal [Token]
tks = Err (BNFC'Position, Term)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Term)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Term))
-> Err (BNFC'Position, Term)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
24# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Term) -> Err (BNFC'Position, Term)
forall a. a -> Err a
happyReturn (let {(HappyWrap60 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
x} in (BNFC'Position, Term)
x'))

pTerm2_internal :: [Token] -> Err (BNFC'Position, Term)
pTerm2_internal [Token]
tks = Err (BNFC'Position, Term)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Term)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Term))
-> Err (BNFC'Position, Term)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
25# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Term) -> Err (BNFC'Position, Term)
forall a. a -> Err a
happyReturn (let {(HappyWrap61 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap61
happyOut61 HappyAbsSyn
x} in (BNFC'Position, Term)
x'))

pTerm1_internal :: [Token] -> Err (BNFC'Position, Term)
pTerm1_internal [Token]
tks = Err (BNFC'Position, Term)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Term)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Term))
-> Err (BNFC'Position, Term)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
26# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Term) -> Err (BNFC'Position, Term)
forall a. a -> Err a
happyReturn (let {(HappyWrap62 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
x} in (BNFC'Position, Term)
x'))

pTerm6_internal :: [Token] -> Err (BNFC'Position, Term)
pTerm6_internal [Token]
tks = Err (BNFC'Position, Term)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Term)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Term))
-> Err (BNFC'Position, Term)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
27# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Term) -> Err (BNFC'Position, Term)
forall a. a -> Err a
happyReturn (let {(HappyWrap63 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
x} in (BNFC'Position, Term)
x'))

pTerm_internal :: [Token] -> Err (BNFC'Position, Term)
pTerm_internal [Token]
tks = Err (BNFC'Position, Term)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Term)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Term))
-> Err (BNFC'Position, Term)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
28# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Term) -> Err (BNFC'Position, Term)
forall a. a -> Err a
happyReturn (let {(HappyWrap64 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
x} in (BNFC'Position, Term)
x'))

pListTerm_internal :: [Token] -> Err (BNFC'Position, [Term])
pListTerm_internal [Token]
tks = Err (BNFC'Position, [Term])
happySomeParser where
 happySomeParser :: Err (BNFC'Position, [Term])
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, [Term]))
-> Err (BNFC'Position, [Term])
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
29# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, [Term]) -> Err (BNFC'Position, [Term])
forall a. a -> Err a
happyReturn (let {(HappyWrap65 (BNFC'Position, [Term])
x') = HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
x} in (BNFC'Position, [Term])
x'))

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


type Err = Either String

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

myLexer :: String -> [Token]
myLexer :: String -> [Token]
myLexer = String -> [Token]
tokens

-- Entrypoints

pModule :: [Token] -> Err Language.Rzk.Syntax.Abs.Module
pModule :: [Token] -> Err Module
pModule = ((BNFC'Position, Module) -> Module)
-> Err (BNFC'Position, Module) -> Err Module
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Module) -> Module
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Module) -> Err Module)
-> ([Token] -> Err (BNFC'Position, Module))
-> [Token]
-> Err Module
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Module)
pModule_internal

pHoleIdent :: [Token] -> Err Language.Rzk.Syntax.Abs.HoleIdent
pHoleIdent :: [Token] -> Err HoleIdent
pHoleIdent = ((BNFC'Position, HoleIdent) -> HoleIdent)
-> Err (BNFC'Position, HoleIdent) -> Err HoleIdent
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, HoleIdent) -> HoleIdent
forall a b. (a, b) -> b
snd (Err (BNFC'Position, HoleIdent) -> Err HoleIdent)
-> ([Token] -> Err (BNFC'Position, HoleIdent))
-> [Token]
-> Err HoleIdent
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, HoleIdent)
pHoleIdent_internal

pVarIdent :: [Token] -> Err Language.Rzk.Syntax.Abs.VarIdent
pVarIdent :: [Token] -> Err VarIdent
pVarIdent = ((BNFC'Position, VarIdent) -> VarIdent)
-> Err (BNFC'Position, VarIdent) -> Err VarIdent
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, VarIdent) -> VarIdent
forall a b. (a, b) -> b
snd (Err (BNFC'Position, VarIdent) -> Err VarIdent)
-> ([Token] -> Err (BNFC'Position, VarIdent))
-> [Token]
-> Err VarIdent
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, VarIdent)
pVarIdent_internal

pListVarIdent :: [Token] -> Err [Language.Rzk.Syntax.Abs.VarIdent]
pListVarIdent :: [Token] -> Err [VarIdent]
pListVarIdent = ((BNFC'Position, [VarIdent]) -> [VarIdent])
-> Err (BNFC'Position, [VarIdent]) -> Err [VarIdent]
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, [VarIdent]) -> [VarIdent]
forall a b. (a, b) -> b
snd (Err (BNFC'Position, [VarIdent]) -> Err [VarIdent])
-> ([Token] -> Err (BNFC'Position, [VarIdent]))
-> [Token]
-> Err [VarIdent]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, [VarIdent])
pListVarIdent_internal

pLanguageDecl :: [Token] -> Err Language.Rzk.Syntax.Abs.LanguageDecl
pLanguageDecl :: [Token] -> Err LanguageDecl
pLanguageDecl = ((BNFC'Position, LanguageDecl) -> LanguageDecl)
-> Err (BNFC'Position, LanguageDecl) -> Err LanguageDecl
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, LanguageDecl) -> LanguageDecl
forall a b. (a, b) -> b
snd (Err (BNFC'Position, LanguageDecl) -> Err LanguageDecl)
-> ([Token] -> Err (BNFC'Position, LanguageDecl))
-> [Token]
-> Err LanguageDecl
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, LanguageDecl)
pLanguageDecl_internal

pLanguage :: [Token] -> Err Language.Rzk.Syntax.Abs.Language
pLanguage :: [Token] -> Err Language
pLanguage = ((BNFC'Position, Language) -> Language)
-> Err (BNFC'Position, Language) -> Err Language
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Language) -> Language
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Language) -> Err Language)
-> ([Token] -> Err (BNFC'Position, Language))
-> [Token]
-> Err Language
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Language)
pLanguage_internal

pCommand :: [Token] -> Err Language.Rzk.Syntax.Abs.Command
pCommand :: [Token] -> Err Command
pCommand = ((BNFC'Position, Command) -> Command)
-> Err (BNFC'Position, Command) -> Err Command
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Command) -> Command
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Command) -> Err Command)
-> ([Token] -> Err (BNFC'Position, Command))
-> [Token]
-> Err Command
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Command)
pCommand_internal

pListCommand :: [Token] -> Err [Language.Rzk.Syntax.Abs.Command]
pListCommand :: [Token] -> Err [Command]
pListCommand = ((BNFC'Position, [Command]) -> [Command])
-> Err (BNFC'Position, [Command]) -> Err [Command]
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, [Command]) -> [Command]
forall a b. (a, b) -> b
snd (Err (BNFC'Position, [Command]) -> Err [Command])
-> ([Token] -> Err (BNFC'Position, [Command]))
-> [Token]
-> Err [Command]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, [Command])
pListCommand_internal

pDeclUsedVars :: [Token] -> Err Language.Rzk.Syntax.Abs.DeclUsedVars
pDeclUsedVars :: [Token] -> Err DeclUsedVars
pDeclUsedVars = ((BNFC'Position, DeclUsedVars) -> DeclUsedVars)
-> Err (BNFC'Position, DeclUsedVars) -> Err DeclUsedVars
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, DeclUsedVars) -> DeclUsedVars
forall a b. (a, b) -> b
snd (Err (BNFC'Position, DeclUsedVars) -> Err DeclUsedVars)
-> ([Token] -> Err (BNFC'Position, DeclUsedVars))
-> [Token]
-> Err DeclUsedVars
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, DeclUsedVars)
pDeclUsedVars_internal

pSectionName :: [Token] -> Err Language.Rzk.Syntax.Abs.SectionName
pSectionName :: [Token] -> Err SectionName
pSectionName = ((BNFC'Position, SectionName) -> SectionName)
-> Err (BNFC'Position, SectionName) -> Err SectionName
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, SectionName) -> SectionName
forall a b. (a, b) -> b
snd (Err (BNFC'Position, SectionName) -> Err SectionName)
-> ([Token] -> Err (BNFC'Position, SectionName))
-> [Token]
-> Err SectionName
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, SectionName)
pSectionName_internal

pPattern :: [Token] -> Err Language.Rzk.Syntax.Abs.Pattern
pPattern :: [Token] -> Err Pattern
pPattern = ((BNFC'Position, Pattern) -> Pattern)
-> Err (BNFC'Position, Pattern) -> Err Pattern
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Pattern) -> Err Pattern)
-> ([Token] -> Err (BNFC'Position, Pattern))
-> [Token]
-> Err Pattern
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Pattern)
pPattern_internal

pListPattern :: [Token] -> Err [Language.Rzk.Syntax.Abs.Pattern]
pListPattern :: [Token] -> Err [Pattern]
pListPattern = ((BNFC'Position, [Pattern]) -> [Pattern])
-> Err (BNFC'Position, [Pattern]) -> Err [Pattern]
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, [Pattern]) -> [Pattern]
forall a b. (a, b) -> b
snd (Err (BNFC'Position, [Pattern]) -> Err [Pattern])
-> ([Token] -> Err (BNFC'Position, [Pattern]))
-> [Token]
-> Err [Pattern]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, [Pattern])
pListPattern_internal

pPattern1 :: [Token] -> Err Language.Rzk.Syntax.Abs.Pattern
pPattern1 :: [Token] -> Err Pattern
pPattern1 = ((BNFC'Position, Pattern) -> Pattern)
-> Err (BNFC'Position, Pattern) -> Err Pattern
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Pattern) -> Err Pattern)
-> ([Token] -> Err (BNFC'Position, Pattern))
-> [Token]
-> Err Pattern
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Pattern)
pPattern1_internal

pListPattern1 :: [Token] -> Err [Language.Rzk.Syntax.Abs.Pattern]
pListPattern1 :: [Token] -> Err [Pattern]
pListPattern1 = ((BNFC'Position, [Pattern]) -> [Pattern])
-> Err (BNFC'Position, [Pattern]) -> Err [Pattern]
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, [Pattern]) -> [Pattern]
forall a b. (a, b) -> b
snd (Err (BNFC'Position, [Pattern]) -> Err [Pattern])
-> ([Token] -> Err (BNFC'Position, [Pattern]))
-> [Token]
-> Err [Pattern]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, [Pattern])
pListPattern1_internal

pParam :: [Token] -> Err Language.Rzk.Syntax.Abs.Param
pParam :: [Token] -> Err Param
pParam = ((BNFC'Position, Param) -> Param)
-> Err (BNFC'Position, Param) -> Err Param
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Param) -> Param
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Param) -> Err Param)
-> ([Token] -> Err (BNFC'Position, Param)) -> [Token] -> Err Param
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Param)
pParam_internal

pListParam :: [Token] -> Err [Language.Rzk.Syntax.Abs.Param]
pListParam :: [Token] -> Err [Param]
pListParam = ((BNFC'Position, [Param]) -> [Param])
-> Err (BNFC'Position, [Param]) -> Err [Param]
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, [Param]) -> [Param]
forall a b. (a, b) -> b
snd (Err (BNFC'Position, [Param]) -> Err [Param])
-> ([Token] -> Err (BNFC'Position, [Param]))
-> [Token]
-> Err [Param]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, [Param])
pListParam_internal

pParamDecl :: [Token] -> Err Language.Rzk.Syntax.Abs.ParamDecl
pParamDecl :: [Token] -> Err ParamDecl
pParamDecl = ((BNFC'Position, ParamDecl) -> ParamDecl)
-> Err (BNFC'Position, ParamDecl) -> Err ParamDecl
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, ParamDecl) -> ParamDecl
forall a b. (a, b) -> b
snd (Err (BNFC'Position, ParamDecl) -> Err ParamDecl)
-> ([Token] -> Err (BNFC'Position, ParamDecl))
-> [Token]
-> Err ParamDecl
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, ParamDecl)
pParamDecl_internal

pSigmaParam :: [Token] -> Err Language.Rzk.Syntax.Abs.SigmaParam
pSigmaParam :: [Token] -> Err SigmaParam
pSigmaParam = ((BNFC'Position, SigmaParam) -> SigmaParam)
-> Err (BNFC'Position, SigmaParam) -> Err SigmaParam
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, SigmaParam) -> SigmaParam
forall a b. (a, b) -> b
snd (Err (BNFC'Position, SigmaParam) -> Err SigmaParam)
-> ([Token] -> Err (BNFC'Position, SigmaParam))
-> [Token]
-> Err SigmaParam
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, SigmaParam)
pSigmaParam_internal

pListSigmaParam :: [Token] -> Err [Language.Rzk.Syntax.Abs.SigmaParam]
pListSigmaParam :: [Token] -> Err [SigmaParam]
pListSigmaParam = ((BNFC'Position, [SigmaParam]) -> [SigmaParam])
-> Err (BNFC'Position, [SigmaParam]) -> Err [SigmaParam]
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, [SigmaParam]) -> [SigmaParam]
forall a b. (a, b) -> b
snd (Err (BNFC'Position, [SigmaParam]) -> Err [SigmaParam])
-> ([Token] -> Err (BNFC'Position, [SigmaParam]))
-> [Token]
-> Err [SigmaParam]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, [SigmaParam])
pListSigmaParam_internal

pRestriction :: [Token] -> Err Language.Rzk.Syntax.Abs.Restriction
pRestriction :: [Token] -> Err Restriction
pRestriction = ((BNFC'Position, Restriction) -> Restriction)
-> Err (BNFC'Position, Restriction) -> Err Restriction
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Restriction) -> Restriction
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Restriction) -> Err Restriction)
-> ([Token] -> Err (BNFC'Position, Restriction))
-> [Token]
-> Err Restriction
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Restriction)
pRestriction_internal

pListRestriction :: [Token] -> Err [Language.Rzk.Syntax.Abs.Restriction]
pListRestriction :: [Token] -> Err [Restriction]
pListRestriction = ((BNFC'Position, [Restriction]) -> [Restriction])
-> Err (BNFC'Position, [Restriction]) -> Err [Restriction]
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, [Restriction]) -> [Restriction]
forall a b. (a, b) -> b
snd (Err (BNFC'Position, [Restriction]) -> Err [Restriction])
-> ([Token] -> Err (BNFC'Position, [Restriction]))
-> [Token]
-> Err [Restriction]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, [Restriction])
pListRestriction_internal

pTerm7 :: [Token] -> Err Language.Rzk.Syntax.Abs.Term
pTerm7 :: [Token] -> Err Term
pTerm7 = ((BNFC'Position, Term) -> Term)
-> Err (BNFC'Position, Term) -> Err Term
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Term) -> Err Term)
-> ([Token] -> Err (BNFC'Position, Term)) -> [Token] -> Err Term
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Term)
pTerm7_internal

pTerm5 :: [Token] -> Err Language.Rzk.Syntax.Abs.Term
pTerm5 :: [Token] -> Err Term
pTerm5 = ((BNFC'Position, Term) -> Term)
-> Err (BNFC'Position, Term) -> Err Term
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Term) -> Err Term)
-> ([Token] -> Err (BNFC'Position, Term)) -> [Token] -> Err Term
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Term)
pTerm5_internal

pTerm4 :: [Token] -> Err Language.Rzk.Syntax.Abs.Term
pTerm4 :: [Token] -> Err Term
pTerm4 = ((BNFC'Position, Term) -> Term)
-> Err (BNFC'Position, Term) -> Err Term
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Term) -> Err Term)
-> ([Token] -> Err (BNFC'Position, Term)) -> [Token] -> Err Term
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Term)
pTerm4_internal

pTerm3 :: [Token] -> Err Language.Rzk.Syntax.Abs.Term
pTerm3 :: [Token] -> Err Term
pTerm3 = ((BNFC'Position, Term) -> Term)
-> Err (BNFC'Position, Term) -> Err Term
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Term) -> Err Term)
-> ([Token] -> Err (BNFC'Position, Term)) -> [Token] -> Err Term
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Term)
pTerm3_internal

pTerm2 :: [Token] -> Err Language.Rzk.Syntax.Abs.Term
pTerm2 :: [Token] -> Err Term
pTerm2 = ((BNFC'Position, Term) -> Term)
-> Err (BNFC'Position, Term) -> Err Term
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Term) -> Err Term)
-> ([Token] -> Err (BNFC'Position, Term)) -> [Token] -> Err Term
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Term)
pTerm2_internal

pTerm1 :: [Token] -> Err Language.Rzk.Syntax.Abs.Term
pTerm1 :: [Token] -> Err Term
pTerm1 = ((BNFC'Position, Term) -> Term)
-> Err (BNFC'Position, Term) -> Err Term
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Term) -> Err Term)
-> ([Token] -> Err (BNFC'Position, Term)) -> [Token] -> Err Term
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Term)
pTerm1_internal

pTerm6 :: [Token] -> Err Language.Rzk.Syntax.Abs.Term
pTerm6 :: [Token] -> Err Term
pTerm6 = ((BNFC'Position, Term) -> Term)
-> Err (BNFC'Position, Term) -> Err Term
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Term) -> Err Term)
-> ([Token] -> Err (BNFC'Position, Term)) -> [Token] -> Err Term
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Term)
pTerm6_internal

pTerm :: [Token] -> Err Language.Rzk.Syntax.Abs.Term
pTerm :: [Token] -> Err Term
pTerm = ((BNFC'Position, Term) -> Term)
-> Err (BNFC'Position, Term) -> Err Term
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Term) -> Err Term)
-> ([Token] -> Err (BNFC'Position, Term)) -> [Token] -> Err Term
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Term)
pTerm_internal

pListTerm :: [Token] -> Err [Language.Rzk.Syntax.Abs.Term]
pListTerm :: [Token] -> Err [Term]
pListTerm = ((BNFC'Position, [Term]) -> [Term])
-> Err (BNFC'Position, [Term]) -> Err [Term]
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, [Term]) -> [Term]
forall a b. (a, b) -> b
snd (Err (BNFC'Position, [Term]) -> Err [Term])
-> ([Token] -> Err (BNFC'Position, [Term]))
-> [Token]
-> Err [Term]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, [Term])
pListTerm_internal
{-# LINE 1 "templates/GenericTemplate.hs" #-}
-- $Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp $













-- Do not remove this comment. Required to fix CPP parsing when using GCC and a clang-compiled alex.
#if __GLASGOW_HASKELL__ > 706
#define LT(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.<# m)) :: Prelude.Bool)
#define GTE(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.>=# m)) :: Prelude.Bool)
#define EQ(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.==# m)) :: Prelude.Bool)
#else
#define LT(n,m) (n Happy_GHC_Exts.<# m)
#define GTE(n,m) (n Happy_GHC_Exts.>=# m)
#define EQ(n,m) (n Happy_GHC_Exts.==# m)
#endif



















data Happy_IntList = HappyCons Happy_GHC_Exts.Int# Happy_IntList








































infixr 9 `HappyStk`
data HappyStk a = HappyStk a (HappyStk a)

-----------------------------------------------------------------------------
-- starting the parse

happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll

-----------------------------------------------------------------------------
-- Accepting the parse

-- If the current token is ERROR_TOK, it means we've just accepted a partial
-- parse (a %partial parser).  We must ignore the saved token on the top of
-- the stack in this case.
happyAccept 0# tk st sts (_ `HappyStk` ans `HappyStk` _) =
        happyReturn1 ans
happyAccept j tk st sts (HappyStk ans _) = 
        (happyTcHack j (happyTcHack st)) (happyReturn1 ans)

-----------------------------------------------------------------------------
-- Arrays only: do the next action



happyDoAction i tk st
        = {- nothing -}
          case action of
                0#           -> {- nothing -}
                                     happyFail (happyExpListPerState ((Happy_GHC_Exts.I# (st)) :: Prelude.Int)) i tk st
                -1#          -> {- nothing -}
                                     happyAccept i tk st
                n | LT(n,(0# :: Happy_GHC_Exts.Int#)) -> {- nothing -}
                                                   (happyReduceArr Happy_Data_Array.! rule) i tk st
                                                   where rule = (Happy_GHC_Exts.I# ((Happy_GHC_Exts.negateInt# ((n Happy_GHC_Exts.+# (1# :: Happy_GHC_Exts.Int#))))))
                n                 -> {- nothing -}
                                     happyShift new_state i tk st
                                     where new_state = (n Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#))
   where off    = happyAdjustOffset (indexShortOffAddr happyActOffsets st)
         off_i  = (off Happy_GHC_Exts.+# i)
         check  = if GTE(off_i,(0# :: Happy_GHC_Exts.Int#))
                  then EQ(indexShortOffAddr happyCheck off_i, i)
                  else Prelude.False
         action
          | check     = indexShortOffAddr happyTable off_i
          | Prelude.otherwise = indexShortOffAddr happyDefActions st




indexShortOffAddr (HappyA# arr) off =
        Happy_GHC_Exts.narrow16Int# i
  where
        i = Happy_GHC_Exts.word2Int# (Happy_GHC_Exts.or# (Happy_GHC_Exts.uncheckedShiftL# high 8#) low)
        high = Happy_GHC_Exts.int2Word# (Happy_GHC_Exts.ord# (Happy_GHC_Exts.indexCharOffAddr# arr (off' Happy_GHC_Exts.+# 1#)))
        low  = Happy_GHC_Exts.int2Word# (Happy_GHC_Exts.ord# (Happy_GHC_Exts.indexCharOffAddr# arr off'))
        off' = off Happy_GHC_Exts.*# 2#




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


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






data HappyAddr = HappyA# Happy_GHC_Exts.Addr#


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













-----------------------------------------------------------------------------
-- Shifting a token

happyShift new_state 0# tk st sts stk@(x `HappyStk` _) =
     let i = (case Happy_GHC_Exts.unsafeCoerce# x of { (Happy_GHC_Exts.I# (i)) -> i }) in
--     trace "shifting the error token" $
     happyDoAction i tk new_state (HappyCons (st) (sts)) (stk)

happyShift new_state i tk st sts stk =
     happyNewToken new_state (HappyCons (st) (sts)) ((happyInTok (tk))`HappyStk`stk)

-- happyReduce is specialised for the common cases.

happySpecReduce_0 i fn 0# tk st sts stk
     = happyFail [] 0# tk st sts stk
happySpecReduce_0 nt fn j tk st@((action)) sts stk
     = happyGoto nt j tk st (HappyCons (st) (sts)) (fn `HappyStk` stk)

happySpecReduce_1 i fn 0# tk st sts stk
     = happyFail [] 0# tk st sts stk
happySpecReduce_1 nt fn j tk _ sts@((HappyCons (st@(action)) (_))) (v1`HappyStk`stk')
     = let r = fn v1 in
       happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))

happySpecReduce_2 i fn 0# tk st sts stk
     = happyFail [] 0# tk st sts stk
happySpecReduce_2 nt fn j tk _ (HappyCons (_) (sts@((HappyCons (st@(action)) (_))))) (v1`HappyStk`v2`HappyStk`stk')
     = let r = fn v1 v2 in
       happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))

happySpecReduce_3 i fn 0# tk st sts stk
     = happyFail [] 0# tk st sts stk
happySpecReduce_3 nt fn j tk _ (HappyCons (_) ((HappyCons (_) (sts@((HappyCons (st@(action)) (_))))))) (v1`HappyStk`v2`HappyStk`v3`HappyStk`stk')
     = let r = fn v1 v2 v3 in
       happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))

happyReduce k i fn 0# tk st sts stk
     = happyFail [] 0# tk st sts stk
happyReduce k nt fn j tk st sts stk
     = case happyDrop (k Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#)) sts of
         sts1@((HappyCons (st1@(action)) (_))) ->
                let r = fn stk in  -- it doesn't hurt to always seq here...
                happyDoSeq r (happyGoto nt j tk st1 sts1 r)

happyMonadReduce k nt fn 0# tk st sts stk
     = happyFail [] 0# tk st sts stk
happyMonadReduce k nt fn j tk st sts stk =
      case happyDrop k (HappyCons (st) (sts)) of
        sts1@((HappyCons (st1@(action)) (_))) ->
          let drop_stk = happyDropStk k stk in
          happyThen1 (fn stk tk) (\r -> happyGoto nt j tk st1 sts1 (r `HappyStk` drop_stk))

happyMonad2Reduce k nt fn 0# tk st sts stk
     = happyFail [] 0# tk st sts stk
happyMonad2Reduce k nt fn j tk st sts stk =
      case happyDrop k (HappyCons (st) (sts)) of
        sts1@((HappyCons (st1@(action)) (_))) ->
         let drop_stk = happyDropStk k stk

             off = happyAdjustOffset (indexShortOffAddr happyGotoOffsets st1)
             off_i = (off Happy_GHC_Exts.+# nt)
             new_state = indexShortOffAddr happyTable off_i




          in
          happyThen1 (fn stk tk) (\r -> happyNewToken new_state sts1 (r `HappyStk` drop_stk))

happyDrop 0# l = l
happyDrop n (HappyCons (_) (t)) = happyDrop (n Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#)) t

happyDropStk 0# l = l
happyDropStk n (x `HappyStk` xs) = happyDropStk (n Happy_GHC_Exts.-# (1#::Happy_GHC_Exts.Int#)) xs

-----------------------------------------------------------------------------
-- Moving to a new state after a reduction


happyGoto nt j tk st = 
   {- nothing -}
   happyDoAction j tk new_state
   where off = happyAdjustOffset (indexShortOffAddr happyGotoOffsets st)
         off_i = (off Happy_GHC_Exts.+# nt)
         new_state = indexShortOffAddr happyTable off_i




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

-- parse error if we are in recovery and we fail again
happyFail explist 0# tk old_st _ stk@(x `HappyStk` _) =
     let i = (case Happy_GHC_Exts.unsafeCoerce# x of { (Happy_GHC_Exts.I# (i)) -> i }) in
--      trace "failing" $ 
        happyError_ explist i tk

{-  We don't need state discarding for our restricted implementation of
    "error".  In fact, it can cause some bogus parses, so I've disabled it
    for now --SDM

-- discard a state
happyFail  ERROR_TOK tk old_st CONS(HAPPYSTATE(action),sts) 
                                                (saved_tok `HappyStk` _ `HappyStk` stk) =
--      trace ("discarding state, depth " ++ show (length stk))  $
        DO_ACTION(action,ERROR_TOK,tk,sts,(saved_tok`HappyStk`stk))
-}

-- Enter error recovery: generate an error token,
--                       save the old token and carry on.
happyFail explist i tk (action) sts stk =
--      trace "entering error recovery" $
        happyDoAction 0# tk action sts ((Happy_GHC_Exts.unsafeCoerce# (Happy_GHC_Exts.I# (i))) `HappyStk` stk)

-- Internal happy errors:

notHappyAtAll :: a
notHappyAtAll = Prelude.error "Internal Happy error\n"

-----------------------------------------------------------------------------
-- Hack to get the typechecker to accept our action functions


happyTcHack :: Happy_GHC_Exts.Int# -> a -> a
happyTcHack x y = y
{-# INLINE happyTcHack #-}


-----------------------------------------------------------------------------
-- Seq-ing.  If the --strict flag is given, then Happy emits 
--      happySeq = happyDoSeq
-- otherwise it emits
--      happySeq = happyDontSeq

happyDoSeq, happyDontSeq :: a -> b -> b
happyDoSeq   a b = a `Prelude.seq` b
happyDontSeq a b = b

-----------------------------------------------------------------------------
-- Don't inline any functions from the template.  GHC has a nasty habit
-- of deciding to inline happyGoto everywhere, which increases the size of
-- the generated parser quite a bit.


{-# NOINLINE happyDoAction #-}
{-# NOINLINE happyTable #-}
{-# NOINLINE happyCheck #-}
{-# NOINLINE happyActOffsets #-}
{-# NOINLINE happyGotoOffsets #-}
{-# NOINLINE happyDefActions #-}

{-# NOINLINE happyShift #-}
{-# NOINLINE happySpecReduce_0 #-}
{-# NOINLINE happySpecReduce_1 #-}
{-# NOINLINE happySpecReduce_2 #-}
{-# NOINLINE happySpecReduce_3 #-}
{-# NOINLINE happyReduce #-}
{-# NOINLINE happyMonadReduce #-}
{-# NOINLINE happyGoto #-}
{-# NOINLINE happyFail #-}

-- end of Happy Template.