{-# OPTIONS_GHC -w #-}
{-# LANGUAGE CPP #-}
{-# LANGUAGE MagicHash #-}
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE TypeSynonymInstances #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE PatternGuards #-}
{-# LANGUAGE NoStrictData #-}
{-# LANGUAGE UnboxedTuples #-}
{-# LANGUAGE PartialTypeSignatures #-}
{-# OPTIONS_GHC -Wno-incomplete-patterns -Wno-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 Control.Monad as Happy_Prelude
import qualified Data.Bool as Happy_Prelude
import qualified Data.Function as Happy_Prelude
import qualified Data.Int as Happy_Prelude
import qualified Data.List as Happy_Prelude
import qualified Data.Maybe as Happy_Prelude
import qualified Data.String as Happy_Prelude
import qualified Data.Tuple as Happy_Prelude
import qualified GHC.Err as Happy_Prelude
import qualified GHC.Num as Happy_Prelude
import qualified Text.Show as Happy_Prelude
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 2.1.6

newtype HappyAbsSyn  = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
newtype HappyWrap34 = HappyWrap34 ((Language.Rzk.Syntax.Abs.BNFC'Position, String))
happyIn34 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, String)) -> (HappyAbsSyn )
happyIn34 :: (BNFC'Position, String) -> HappyAbsSyn
happyIn34 (BNFC'Position, String)
x = HappyWrap34 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, String) -> HappyWrap34
HappyWrap34 (BNFC'Position, String)
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.VarIdentToken))
happyIn35 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.VarIdentToken)) -> (HappyAbsSyn )
happyIn35 :: (BNFC'Position, VarIdentToken) -> HappyAbsSyn
happyIn35 (BNFC'Position, VarIdentToken)
x = HappyWrap35 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, VarIdentToken) -> HappyWrap35
HappyWrap35 (BNFC'Position, VarIdentToken)
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.HoleIdentToken))
happyIn36 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.HoleIdentToken)) -> (HappyAbsSyn )
happyIn36 :: (BNFC'Position, HoleIdentToken) -> HappyAbsSyn
happyIn36 (BNFC'Position, HoleIdentToken)
x = HappyWrap36 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, HoleIdentToken) -> HappyWrap36
HappyWrap36 (BNFC'Position, HoleIdentToken)
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.Module))
happyIn37 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Module)) -> (HappyAbsSyn )
happyIn37 :: (BNFC'Position, Module) -> HappyAbsSyn
happyIn37 (BNFC'Position, Module)
x = HappyWrap37 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Module) -> HappyWrap37
HappyWrap37 (BNFC'Position, Module)
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.HoleIdent))
happyIn38 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.HoleIdent)) -> (HappyAbsSyn )
happyIn38 :: (BNFC'Position, HoleIdent) -> HappyAbsSyn
happyIn38 (BNFC'Position, HoleIdent)
x = HappyWrap38 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, HoleIdent) -> HappyWrap38
HappyWrap38 (BNFC'Position, HoleIdent)
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.VarIdent]))
happyIn40 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.VarIdent])) -> (HappyAbsSyn )
happyIn40 :: (BNFC'Position, [VarIdent]) -> HappyAbsSyn
happyIn40 (BNFC'Position, [VarIdent])
x = HappyWrap40 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [VarIdent]) -> HappyWrap40
HappyWrap40 (BNFC'Position, [VarIdent])
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.LanguageDecl))
happyIn41 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.LanguageDecl)) -> (HappyAbsSyn )
happyIn41 :: (BNFC'Position, LanguageDecl) -> HappyAbsSyn
happyIn41 (BNFC'Position, LanguageDecl)
x = HappyWrap41 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, LanguageDecl) -> HappyWrap41
HappyWrap41 (BNFC'Position, LanguageDecl)
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.Language))
happyIn42 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Language)) -> (HappyAbsSyn )
happyIn42 :: (BNFC'Position, Language) -> HappyAbsSyn
happyIn42 (BNFC'Position, Language)
x = HappyWrap42 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Language) -> HappyWrap42
HappyWrap42 (BNFC'Position, Language)
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.Command]))
happyIn44 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Command])) -> (HappyAbsSyn )
happyIn44 :: (BNFC'Position, [Command]) -> HappyAbsSyn
happyIn44 (BNFC'Position, [Command])
x = HappyWrap44 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Command]) -> HappyWrap44
HappyWrap44 (BNFC'Position, [Command])
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.DeclUsedVars))
happyIn45 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.DeclUsedVars)) -> (HappyAbsSyn )
happyIn45 :: (BNFC'Position, DeclUsedVars) -> HappyAbsSyn
happyIn45 (BNFC'Position, DeclUsedVars)
x = HappyWrap45 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, DeclUsedVars) -> HappyWrap45
HappyWrap45 (BNFC'Position, DeclUsedVars)
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.SectionName))
happyIn46 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.SectionName)) -> (HappyAbsSyn )
happyIn46 :: (BNFC'Position, SectionName) -> HappyAbsSyn
happyIn46 (BNFC'Position, SectionName)
x = HappyWrap46 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, SectionName) -> HappyWrap46
HappyWrap46 (BNFC'Position, SectionName)
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.Pattern]))
happyIn50 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Pattern])) -> (HappyAbsSyn )
happyIn50 :: (BNFC'Position, [Pattern]) -> HappyAbsSyn
happyIn50 (BNFC'Position, [Pattern])
x = HappyWrap50 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Pattern]) -> HappyWrap50
HappyWrap50 (BNFC'Position, [Pattern])
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.Param]))
happyIn52 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Param])) -> (HappyAbsSyn )
happyIn52 :: (BNFC'Position, [Param]) -> HappyAbsSyn
happyIn52 (BNFC'Position, [Param])
x = HappyWrap52 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Param]) -> HappyWrap52
HappyWrap52 (BNFC'Position, [Param])
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.ParamDecl))
happyIn53 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.ParamDecl)) -> (HappyAbsSyn )
happyIn53 :: (BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn53 (BNFC'Position, ParamDecl)
x = HappyWrap53 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, ParamDecl) -> HappyWrap53
HappyWrap53 (BNFC'Position, ParamDecl)
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.SigmaParam]))
happyIn55 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.SigmaParam])) -> (HappyAbsSyn )
happyIn55 :: (BNFC'Position, [SigmaParam]) -> HappyAbsSyn
happyIn55 (BNFC'Position, [SigmaParam])
x = HappyWrap55 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [SigmaParam]) -> HappyWrap55
HappyWrap55 (BNFC'Position, [SigmaParam])
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.Restriction]))
happyIn57 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Restriction])) -> (HappyAbsSyn )
happyIn57 :: (BNFC'Position, [Restriction]) -> HappyAbsSyn
happyIn57 (BNFC'Position, [Restriction])
x = HappyWrap57 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Restriction]) -> HappyWrap57
HappyWrap57 (BNFC'Position, [Restriction])
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 #-}
newtype HappyWrap66 = HappyWrap66 ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Term]))
happyIn66 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Term])) -> (HappyAbsSyn )
happyIn66 :: (BNFC'Position, [Term]) -> HappyAbsSyn
happyIn66 (BNFC'Position, [Term])
x = HappyWrap66 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Term]) -> HappyWrap66
HappyWrap66 (BNFC'Position, [Term])
x)
{-# INLINE happyIn66 #-}
happyOut66 :: (HappyAbsSyn ) -> HappyWrap66
happyOut66 :: HappyAbsSyn -> HappyWrap66
happyOut66 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap66
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut66 #-}
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 #-}


{-# NOINLINE happyTokenStrings #-}
happyTokenStrings :: [String]
happyTokenStrings = [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"]

happyActOffsets :: HappyAddr
happyActOffsets :: HappyAddr
happyActOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\x05\x00\x00\x00\xc4\xff\xff\xff\xda\xff\xff\xff\xda\xff\xff\xff\x4d\x00\x00\x00\x29\x00\x00\x00\x3c\x07\x00\x00\x3c\x07\x00\x00\x1f\x00\x00\x00\x2e\x00\x00\x00\x22\x00\x00\x00\x22\x00\x00\x00\x22\x00\x00\x00\x22\x00\x00\x00\x2b\x00\x00\x00\x2b\x00\x00\x00\x5b\x00\x00\x00\x22\x00\x00\x00\x22\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x3f\x01\x00\x00\x99\x00\x00\x00\x99\x00\x00\x00\x99\x00\x00\x00\x99\x00\x00\x00\x1d\x00\x00\x00\x99\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x31\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xef\xff\xff\xff\x00\x00\x00\x00\x4c\x01\x00\x00\xfb\xff\xff\xff\xd6\xff\xff\xff\xa5\x00\x00\x00\x00\x00\x00\x00\xd7\x00\x00\x00\x84\x00\x00\x00\x6c\x00\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x93\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2b\x00\x00\x00\x3f\x01\x00\x00\xb7\x00\x00\x00\x00\x00\x00\x00\xb9\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x00\x00\x3f\x01\x00\x00\x00\x00\x00\x00\x23\x00\x00\x00\xce\x00\x00\x00\x3f\x01\x00\x00\x3f\x01\x00\x00\xeb\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xaf\x00\x00\x00\xf0\xff\xff\xff\x1d\x00\x00\x00\x09\x00\x00\x00\xaf\x00\x00\x00\xaf\x00\x00\x00\x15\x01\x00\x00\xaf\x00\x00\x00\xaf\x00\x00\x00\x53\x00\x00\x00\xaf\x00\x00\x00\xf4\x00\x00\x00\xc2\x00\x00\x00\xd0\xff\xff\xff\xc2\x00\x00\x00\x00\x00\x00\x00\xfb\x00\x00\x00\x05\x01\x00\x00\xd1\x00\x00\x00\xa8\x00\x00\x00\x00\x00\x00\x00\xd1\x00\x00\x00\xd1\x00\x00\x00\x15\x01\x00\x00\x00\x00\x00\x00\x2b\x00\x00\x00\xd1\x00\x00\x00\xa8\x00\x00\x00\xa8\x00\x00\x00\xd1\x00\x00\x00\x00\x00\x00\x00\x17\x01\x00\x00\xd9\x00\x00\x00\xd9\x00\x00\x00\xa8\x00\x00\x00\xd9\x00\x00\x00\xd9\x00\x00\x00\x00\x00\x00\x00\xd9\x00\x00\x00\xd9\x00\x00\x00\x28\x01\x00\x00\x1b\x01\x00\x00\xe8\x00\x00\x00\xf6\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\xf6\x00\x00\x00\xf6\x00\x00\x00\xf6\x00\x00\x00\xf6\x00\x00\x00\xf6\x00\x00\x00\xf8\x00\x00\x00\xf8\x00\x00\x00\x07\x01\x00\x00\x07\x01\x00\x00\xfd\x00\x00\x00\xfd\x00\x00\x00\x00\x00\x00\x00\xfd\x00\x00\x00\x0e\x01\x00\x00\x20\x01\x00\x00\x03\x01\x00\x00\x03\x01\x00\x00\x03\x01\x00\x00\x03\x01\x00\x00\x3c\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x48\x01\x00\x00\x54\x01\x00\x00\x60\x01\x00\x00\x00\x00\x00\x00\x5a\x01\x00\x00\x00\x00\x00\x00\x4a\x01\x00\x00\x00\x00\x00\x00\x4a\x01\x00\x00\x4a\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6a\x01\x00\x00\x72\x01\x00\x00\x3c\x07\x00\x00\x57\x01\x00\x00\x00\x00\x00\x00\xa8\x00\x00\x00\x89\x01\x00\x00\x87\x00\x00\x00\x98\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x00\x00\xa2\x01\x00\x00\xa8\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x99\x00\x00\x00\x99\x00\x00\x00\x99\x00\x00\x00\x1d\x00\x00\x00\x52\x00\x00\x00\xa8\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa8\x00\x00\x00\xb2\x01\x00\x00\xa8\x00\x00\x00\x00\x00\x00\x00\xe3\xff\xff\xff\x1d\x00\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\xfd\xff\xff\xff\xa8\x00\x00\x00\x0a\x00\x00\x00\xc4\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x99\x00\x00\x00\x99\x00\x00\x00\x99\x00\x00\x00\x99\x00\x00\x00\x99\x00\x00\x00\x99\x00\x00\x00\x99\x00\x00\x00\x99\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x00\x00\x00\x18\x00\x00\x00\x18\x00\x00\x00\x18\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\xc2\x01\x00\x00\xdb\x01\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\xeb\x01\x00\x00\xf6\x01\x00\x00\x9b\x00\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\xf2\xff\xff\xff\x1d\x00\x00\x00\xf2\x01\x00\x00\x02\x02\x00\x00\xf8\x01\x00\x00\x0b\x02\x00\x00\xe6\x01\x00\x00\x00\x00\x00\x00\x15\x01\x00\x00\x15\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa8\x00\x00\x00\xff\x01\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x16\x02\x00\x00\x00\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x3e\x00\x00\x00\x60\x00\x00\x00\x7c\x00\x00\x00\xe8\x01\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x02\x00\x00\x1d\x00\x00\x00\x22\x02\x00\x00\x1d\x00\x00\x00\x28\x02\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x09\x02\x00\x00\xf1\xff\xff\xff\x00\x00\x00\x00\xca\x00\x00\x00\x99\x00\x00\x00\xa8\x00\x00\x00\x1d\x00\x00\x00\xa8\x00\x00\x00\x1d\x00\x00\x00\x0d\x00\x00\x00\x1d\x00\x00\x00\x10\x02\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa8\x00\x00\x00\x1d\x00\x00\x00\x30\x02\x00\x00\x3a\x02\x00\x00\x70\x00\x00\x00\xf5\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x46\x02\x00\x00\x55\x02\x00\x00\x52\x02\x00\x00\x5b\x02\x00\x00\x00\x00\x00\x00\x65\x02\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x66\x02\x00\x00\x6f\x02\x00\x00\x75\x02\x00\x00\x76\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa8\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x77\x02\x00\x00\x1d\x00\x00\x00\x78\x02\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x87\x02\x00\x00\x1d\x00\x00\x00\x88\x02\x00\x00\x1d\x00\x00\x00\x50\x02\x00\x00\x8f\x02\x00\x00\x9f\x02\x00\x00\xa2\x02\x00\x00\xab\x02\x00\x00\xb2\x02\x00\x00\xbb\x02\x00\x00\x86\x02\x00\x00\x98\x02\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\xc2\x02\x00\x00\xcb\x02\x00\x00\xa5\x02\x00\x00\xd5\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\xd2\x02\x00\x00\xdb\x02\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb6\x02\x00\x00\x1d\x00\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe2\x02\x00\x00\xef\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x00\x00\xf2\x02\x00\x00\x1d\x00\x00\x00\xf5\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#

happyGotoOffsets :: HappyAddr
happyGotoOffsets :: HappyAddr
happyGotoOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\x19\x01\x00\x00\x9f\x00\x00\x00\x44\x01\x00\x00\xa1\x00\x00\x00\x0a\x03\x00\x00\x0f\x03\x00\x00\x18\x03\x00\x00\x81\x00\x00\x00\x0d\x03\x00\x00\x80\x00\x00\x00\x51\x01\x00\x00\x15\x00\x00\x00\xe0\x00\x00\x00\x7b\x01\x00\x00\x23\x07\x00\x00\xfd\x06\x00\x00\x76\x06\x00\x00\x6d\x01\x00\x00\x11\x06\x00\x00\xf1\x01\x00\x00\xb1\x01\x00\x00\x14\x01\x00\x00\xf9\x00\x00\x00\x6d\x06\x00\x00\x4b\x06\x00\x00\x01\x06\x00\x00\x41\x05\x00\x00\xbb\x00\x00\x00\x01\x02\x00\x00\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\x00\x00\x00\x00\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\x00\x00\x00\x00\x00\x00\x11\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\x8b\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\x06\x07\x00\x00\xcd\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x21\x02\x00\x00\xd3\x06\x00\x00\x00\x00\x00\x00\x2e\x07\x00\x00\x00\x00\x00\x00\xe2\x06\x00\x00\xe8\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\xed\x06\x00\x00\x31\x02\x00\x00\x00\x00\x00\x00\x00\x00\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\x00\x00\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\x00\x00\x00\x00\x00\x00\x00\x00\xed\x06\x00\x00\x00\x00\x00\x00\x08\x07\x00\x00\x00\x00\x00\x00\x4c\x07\x00\x00\x53\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd8\x06\x00\x00\x41\x02\x00\x00\x51\x02\x00\x00\x61\x02\x00\x00\x71\x02\x00\x00\x5f\x01\x00\x00\x6b\x06\x00\x00\x33\x01\x00\x00\x92\x06\x00\x00\x78\x01\x00\x00\x27\x03\x00\x00\x28\x03\x00\x00\x25\x07\x00\x00\x61\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x29\x03\x00\x00\x67\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2c\x03\x00\x00\x00\x00\x00\x00\x2d\x03\x00\x00\x36\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xff\x00\x00\x00\x69\x07\x00\x00\x00\x00\x00\x00\x28\x07\x00\x00\x00\x00\x00\x00\x4e\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc1\x01\x00\x00\x00\x00\x00\x00\x2f\x06\x00\x00\x81\x02\x00\x00\x91\x02\x00\x00\xa1\x02\x00\x00\xd1\x01\x00\x00\xbe\x06\x00\x00\xc3\x06\x00\x00\x0f\x06\x00\x00\xb1\x02\x00\x00\x00\x00\x00\x00\xaa\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf2\x06\x00\x00\x00\x00\x00\x00\x5c\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe1\x01\x00\x00\xc1\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf4\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x91\x01\x00\x00\x51\x05\x00\x00\x1f\x06\x00\x00\x2d\x06\x00\x00\x5b\x06\x00\x00\x66\x06\x00\x00\x1d\x01\x00\x00\x94\x06\x00\x00\x9b\x06\x00\x00\xa3\x06\x00\x00\x61\x05\x00\x00\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\x00\x00\x00\x00\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\x00\x00\xe1\x02\x00\x00\xf1\x02\x00\x00\x01\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x81\x05\x00\x00\x91\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x11\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x21\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xed\x06\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\x5e\x07\x00\x00\x00\x00\x00\x00\x31\x03\x00\x00\x41\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x51\x03\x00\x00\x61\x03\x00\x00\x0f\x07\x00\x00\x11\x07\x00\x00\x1a\x07\x00\x00\x47\x03\x00\x00\x71\x03\x00\x00\x81\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x91\x03\x00\x00\x00\x00\x00\x00\xa1\x03\x00\x00\x00\x00\x00\x00\xb1\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x3d\x06\x00\x00\x4d\x06\x00\x00\xc1\x03\x00\x00\xa1\x06\x00\x00\xd1\x03\x00\x00\x00\x00\x00\x00\xe1\x03\x00\x00\x00\x00\x00\x00\xf1\x03\x00\x00\x00\x00\x00\x00\x01\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xef\x06\x00\x00\x11\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa1\x01\x00\x00\x00\x00\x00\x00\x21\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\x31\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\x2d\x07\x00\x00\x00\x00\x00\x00\x41\x04\x00\x00\x51\x04\x00\x00\x00\x00\x00\x00\x61\x04\x00\x00\x00\x00\x00\x00\x71\x04\x00\x00\x00\x00\x00\x00\x81\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x91\x04\x00\x00\x00\x00\x00\x00\xa1\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\xb1\x04\x00\x00\xc1\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\xa1\x05\x00\x00\xb1\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd1\x04\x00\x00\x00\x00\x00\x00\xc1\x05\x00\x00\xd1\x05\x00\x00\xe1\x05\x00\x00\xf1\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe1\x04\x00\x00\x00\x00\x00\x00\xf1\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\x01\x05\x00\x00\x11\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\x21\x05\x00\x00\x00\x00\x00\x00\x31\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#

happyDefActions :: HappyAddr
happyDefActions :: HappyAddr
happyDefActions = Addr# -> HappyAddr
HappyA# Addr#
"\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc6\xff\xff\xff\xc3\xff\xff\xff\xc2\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\xff\xff\xdc\xff\xff\xff\xdd\xff\xff\xff\x8e\xff\xff\xff\x8d\xff\xff\xff\x00\x00\x00\x00\x66\xff\xff\xff\x80\xff\xff\xff\x7c\xff\xff\xff\x79\xff\xff\xff\x71\xff\xff\xff\x62\xff\xff\xff\x84\xff\xff\xff\x61\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x8b\xff\xff\xff\xa0\xff\xff\xff\x8a\xff\xff\xff\x9e\xff\xff\xff\xa1\xff\xff\xff\x89\xff\xff\xff\x9d\xff\xff\xff\x9f\xff\xff\xff\x00\x00\x00\x00\x87\xff\xff\xff\xa3\xff\xff\xff\x00\x00\x00\x00\x88\xff\xff\xff\xa2\xff\xff\xff\xa4\xff\xff\xff\x97\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x9a\xff\xff\xff\x00\x00\x00\x00\x92\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x93\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x9c\xff\xff\xff\x9b\xff\xff\xff\xe0\xff\xff\xff\xdf\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x71\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x84\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa6\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xbf\xff\xff\xff\x00\x00\x00\x00\xaa\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\xc0\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\xb1\xff\xff\xff\xb7\xff\xff\xff\xb3\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xba\xff\xff\xff\xb9\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\xbc\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\xc1\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc2\xff\xff\xff\x00\x00\x00\x00\xc2\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd8\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\xdb\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc6\xff\xff\xff\xde\xff\xff\xff\xda\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd6\xff\xff\xff\x00\x00\x00\x00\xcc\xff\xff\xff\xc3\xff\xff\xff\xcb\xff\xff\xff\xc3\xff\xff\xff\xc3\xff\xff\xff\xd3\xff\xff\xff\xd2\xff\xff\xff\xd4\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\xc6\xff\xff\xff\x00\x00\x00\x00\xbb\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\xbc\xff\xff\xff\x00\x00\x00\x00\xb2\xff\xff\xff\x69\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x67\xff\xff\xff\x68\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x64\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x65\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x77\xff\xff\xff\x70\xff\xff\xff\x81\xff\xff\xff\x82\xff\xff\xff\x7f\xff\xff\xff\x7e\xff\xff\xff\x7d\xff\xff\xff\x7b\xff\xff\xff\x7a\xff\xff\xff\x78\xff\xff\xff\x63\xff\xff\xff\x60\xff\xff\xff\x8c\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x91\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x73\xff\xff\xff\x85\xff\xff\xff\x83\xff\xff\xff\xa5\xff\xff\xff\xa8\xff\xff\xff\xa7\xff\xff\xff\xab\xff\xff\xff\xa9\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb8\xff\xff\xff\x00\x00\x00\x00\xc5\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd9\xff\xff\xff\xcd\xff\xff\xff\xce\xff\xff\xff\xd7\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd5\xff\xff\xff\xcf\xff\xff\xff\xc4\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x6a\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x99\xff\xff\xff\x00\x00\x00\x00\x72\xff\xff\xff\x6d\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x95\xff\xff\xff\x00\x00\x00\x00\xb0\xff\xff\xff\x00\x00\x00\x00\x86\xff\xff\xff\x96\xff\xff\xff\xab\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\xae\xff\xff\xff\xab\xff\xff\xff\x00\x00\x00\x00\xab\xff\xff\xff\x00\x00\x00\x00\x74\xff\xff\xff\xbe\xff\xff\xff\x00\x00\x00\x00\xb6\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd0\xff\xff\xff\x00\x00\x00\x00\xd1\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x94\xff\xff\xff\xaf\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xac\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xbd\xff\xff\xff\xb5\xff\xff\xff\xb4\xff\xff\xff\xc7\xff\xff\xff\x00\x00\x00\x00\xc9\xff\xff\xff\x00\x00\x00\x00\xca\xff\xff\xff\xc8\xff\xff\xff\x6b\xff\xff\xff\x6c\xff\xff\xff\x75\xff\xff\xff\x76\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6e\xff\xff\xff\x6f\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\xad\xff\xff\xff\x98\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x8f\xff\xff\xff"#

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

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

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

happyCatchStates :: [Happy_Prelude.Int]
happyCatchStates :: [Int]
happyCatchStates = []

happy_n_terms :: Int
happy_n_terms = Int
83 :: Happy_Prelude.Int
happy_n_nonterms :: Int
happy_n_nonterms = Int
33 :: Happy_Prelude.Int

happy_n_starts :: Int
happy_n_starts = Int
30 :: Happy_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
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), ((\(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
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 -> 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
happyIn36
                 (((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 -> HappyWrap41
happyOut41 HappyAbsSyn
happy_x_1 of { (HappyWrap41 (BNFC'Position, LanguageDecl)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap44
happyOut44 HappyAbsSyn
happy_x_2 of { (HappyWrap44 (BNFC'Position, [Command])
happy_var_2) -> 
        (BNFC'Position, Module) -> HappyAbsSyn
happyIn37
                 (((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 -> HappyWrap36
happyOut36 HappyAbsSyn
happy_x_1 of { (HappyWrap36 (BNFC'Position, HoleIdentToken)
happy_var_1) -> 
        (BNFC'Position, HoleIdent) -> HappyAbsSyn
happyIn38
                 (((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 -> HappyWrap35
happyOut35 HappyAbsSyn
happy_x_1 of { (HappyWrap35 (BNFC'Position, VarIdentToken)
happy_var_1) -> 
        (BNFC'Position, VarIdent) -> HappyAbsSyn
happyIn39
                 (((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 -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_1 of { (HappyWrap39 (BNFC'Position, VarIdent)
happy_var_1) -> 
        (BNFC'Position, [VarIdent]) -> HappyAbsSyn
happyIn40
                 (((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 -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_1 of { (HappyWrap39 (BNFC'Position, VarIdent)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_2 of { (HappyWrap40 (BNFC'Position, [VarIdent])
happy_var_2) -> 
        (BNFC'Position, [VarIdent]) -> HappyAbsSyn
happyIn40
                 (((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 -> HappyWrap42
happyOut42 HappyAbsSyn
happy_x_2 of { (HappyWrap42 (BNFC'Position, Language)
happy_var_2) -> 
        (BNFC'Position, LanguageDecl) -> 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 -> 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
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 -> 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 -> HappyWrap34
happyOut34 HappyAbsSyn
happy_x_2 of { (HappyWrap34 (BNFC'Position, String)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap34
happyOut34 HappyAbsSyn
happy_x_4 of { (HappyWrap34 (BNFC'Position, String)
happy_var_4) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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 -> HappyWrap34
happyOut34 HappyAbsSyn
happy_x_2 of { (HappyWrap34 (BNFC'Position, String)
happy_var_2) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_2 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_4) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_2 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_2) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_2 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_2) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_2 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_2) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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 -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_2 of { (HappyWrap39 (BNFC'Position, VarIdent)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
happy_x_3 of { (HappyWrap45 (BNFC'Position, DeclUsedVars)
happy_var_3) -> 
        case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_4 of { (HappyWrap52 (BNFC'Position, [Param])
happy_var_4) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_6 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_6) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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 -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_2 of { (HappyWrap39 (BNFC'Position, VarIdent)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
happy_x_3 of { (HappyWrap45 (BNFC'Position, DeclUsedVars)
happy_var_3) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_5 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_5) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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 -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_2 of { (HappyWrap40 (BNFC'Position, [VarIdent])
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_4) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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 -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_2 of { (HappyWrap39 (BNFC'Position, VarIdent)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_4) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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 -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_2 of { (HappyWrap40 (BNFC'Position, [VarIdent])
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_4) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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 -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_2 of { (HappyWrap46 (BNFC'Position, SectionName)
happy_var_2) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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 -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_2 of { (HappyWrap46 (BNFC'Position, SectionName)
happy_var_2) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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 -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_2 of { (HappyWrap39 (BNFC'Position, VarIdent)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
happy_x_3 of { (HappyWrap45 (BNFC'Position, DeclUsedVars)
happy_var_3) -> 
        case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_4 of { (HappyWrap52 (BNFC'Position, [Param])
happy_var_4) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_6 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_6) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_8 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_8) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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 -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_2 of { (HappyWrap39 (BNFC'Position, VarIdent)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
happy_x_3 of { (HappyWrap45 (BNFC'Position, DeclUsedVars)
happy_var_3) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_5 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_5) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_7 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_7) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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 -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_2 of { (HappyWrap39 (BNFC'Position, VarIdent)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
happy_x_3 of { (HappyWrap45 (BNFC'Position, DeclUsedVars)
happy_var_3) -> 
        case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_4 of { (HappyWrap52 (BNFC'Position, [Param])
happy_var_4) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_6 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_6) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_8 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_8) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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 -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_2 of { (HappyWrap39 (BNFC'Position, VarIdent)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
happy_x_3 of { (HappyWrap45 (BNFC'Position, DeclUsedVars)
happy_var_3) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_5 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_5) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_7 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_7) -> 
        (BNFC'Position, Command) -> HappyAbsSyn
happyIn43
                 (((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
happyIn44
                 ((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 -> HappyWrap43
happyOut43 HappyAbsSyn
happy_x_1 of { (HappyWrap43 (BNFC'Position, Command)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap44
happyOut44 HappyAbsSyn
happy_x_3 of { (HappyWrap44 (BNFC'Position, [Command])
happy_var_3) -> 
        (BNFC'Position, [Command]) -> HappyAbsSyn
happyIn44
                 (((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 -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_3 of { (HappyWrap40 (BNFC'Position, [VarIdent])
happy_var_3) -> 
        (BNFC'Position, DeclUsedVars) -> HappyAbsSyn
happyIn45
                 (((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
happyIn45
                 ((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
happyIn46
                 ((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 -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_1 of { (HappyWrap39 (BNFC'Position, VarIdent)
happy_var_1) -> 
        (BNFC'Position, SectionName) -> HappyAbsSyn
happyIn46
                 (((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
happyIn47
                 (((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 -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_1 of { (HappyWrap39 (BNFC'Position, VarIdent)
happy_var_1) -> 
        (BNFC'Position, Pattern) -> HappyAbsSyn
happyIn47
                 (((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 -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_2 of { (HappyWrap47 (BNFC'Position, Pattern)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_4 of { (HappyWrap47 (BNFC'Position, Pattern)
happy_var_4) -> 
        (BNFC'Position, Pattern) -> HappyAbsSyn
happyIn47
                 (((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 -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_2 of { (HappyWrap47 (BNFC'Position, Pattern)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_4 of { (HappyWrap47 (BNFC'Position, Pattern)
happy_var_4) -> 
        case HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
happy_x_6 of { (HappyWrap50 (BNFC'Position, [Pattern])
happy_var_6) -> 
        (BNFC'Position, Pattern) -> HappyAbsSyn
happyIn47
                 (((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 -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_1 of { (HappyWrap47 (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, (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 -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_1 of { (HappyWrap47 (BNFC'Position, Pattern)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap48
happyOut48 HappyAbsSyn
happy_x_2 of { (HappyWrap48 (BNFC'Position, [Pattern])
happy_var_2) -> 
        (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) ((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 -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_1 of { (HappyWrap47 (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, ((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 -> HappyWrap49
happyOut49 HappyAbsSyn
happy_x_1 of { (HappyWrap49 (BNFC'Position, Pattern)
happy_var_1) -> 
        (BNFC'Position, [Pattern]) -> HappyAbsSyn
happyIn50
                 (((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 -> HappyWrap49
happyOut49 HappyAbsSyn
happy_x_1 of { (HappyWrap49 (BNFC'Position, Pattern)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
happy_x_3 of { (HappyWrap50 (BNFC'Position, [Pattern])
happy_var_3) -> 
        (BNFC'Position, [Pattern]) -> HappyAbsSyn
happyIn50
                 (((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 -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_1 of { (HappyWrap47 (BNFC'Position, Pattern)
happy_var_1) -> 
        (BNFC'Position, Param) -> HappyAbsSyn
happyIn51
                 (((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 -> HappyWrap48
happyOut48 HappyAbsSyn
happy_x_2 of { (HappyWrap48 (BNFC'Position, [Pattern])
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_4) -> 
        (BNFC'Position, Param) -> HappyAbsSyn
happyIn51
                 (((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 -> HappyWrap48
happyOut48 HappyAbsSyn
happy_x_2 of { (HappyWrap48 (BNFC'Position, [Pattern])
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_4) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_6 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_6) -> 
        (BNFC'Position, Param) -> HappyAbsSyn
happyIn51
                 (((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 -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_2 of { (HappyWrap47 (BNFC'Position, Pattern)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_4) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_6 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_6) -> 
        (BNFC'Position, Param) -> HappyAbsSyn
happyIn51
                 (((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 -> HappyWrap51
happyOut51 HappyAbsSyn
happy_x_1 of { (HappyWrap51 (BNFC'Position, Param)
happy_var_1) -> 
        (BNFC'Position, [Param]) -> HappyAbsSyn
happyIn52
                 (((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 -> HappyWrap51
happyOut51 HappyAbsSyn
happy_x_1 of { (HappyWrap51 (BNFC'Position, Param)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_2 of { (HappyWrap52 (BNFC'Position, [Param])
happy_var_2) -> 
        (BNFC'Position, [Param]) -> HappyAbsSyn
happyIn52
                 (((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 -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_1 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_1) -> 
        (BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn53
                 (((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_2 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_4) -> 
        (BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn53
                 (((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_2 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_4) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_6 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_6) -> 
        (BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn53
                 (((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 -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_2 of { (HappyWrap47 (BNFC'Position, Pattern)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_4) -> 
        (BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn53
                 (((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 -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_3 of { (HappyWrap47 (BNFC'Position, Pattern)
happy_var_3) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_5 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_5) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_8 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_8) -> 
        (BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn53
                 (((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 -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_2 of { (HappyWrap47 (BNFC'Position, Pattern)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_4) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_6 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_6) -> 
        (BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn53
                 (((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 -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_1 of { (HappyWrap47 (BNFC'Position, Pattern)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_3 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_3) -> 
        (BNFC'Position, SigmaParam) -> HappyAbsSyn
happyIn54
                 (((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 -> HappyWrap54
happyOut54 HappyAbsSyn
happy_x_1 of { (HappyWrap54 (BNFC'Position, SigmaParam)
happy_var_1) -> 
        (BNFC'Position, [SigmaParam]) -> HappyAbsSyn
happyIn55
                 (((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 -> HappyWrap54
happyOut54 HappyAbsSyn
happy_x_1 of { (HappyWrap54 (BNFC'Position, SigmaParam)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap55
happyOut55 HappyAbsSyn
happy_x_3 of { (HappyWrap55 (BNFC'Position, [SigmaParam])
happy_var_3) -> 
        (BNFC'Position, [SigmaParam]) -> HappyAbsSyn
happyIn55
                 (((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_1 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_3 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_3) -> 
        (BNFC'Position, Restriction) -> HappyAbsSyn
happyIn56
                 (((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_1 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_3 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_3) -> 
        (BNFC'Position, Restriction) -> HappyAbsSyn
happyIn56
                 (((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 -> HappyWrap56
happyOut56 HappyAbsSyn
happy_x_1 of { (HappyWrap56 (BNFC'Position, Restriction)
happy_var_1) -> 
        (BNFC'Position, [Restriction]) -> HappyAbsSyn
happyIn57
                 (((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 -> HappyWrap56
happyOut56 HappyAbsSyn
happy_x_1 of { (HappyWrap56 (BNFC'Position, Restriction)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap57
happyOut57 HappyAbsSyn
happy_x_3 of { (HappyWrap57 (BNFC'Position, [Restriction])
happy_var_3) -> 
        (BNFC'Position, [Restriction]) -> HappyAbsSyn
happyIn57
                 (((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
happyIn58
                 (((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
happyIn58
                 (((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
happyIn58
                 (((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
happyIn58
                 (((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
happyIn58
                 (((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
happyIn58
                 (((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
happyIn58
                 (((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
happyIn58
                 (((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
happyIn58
                 (((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
happyIn58
                 (((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
happyIn58
                 (((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 -> HappyWrap57
happyOut57 HappyAbsSyn
happy_x_3 of { (HappyWrap57 (BNFC'Position, [Restriction])
happy_var_3) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn58
                 (((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_3 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_3) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_5 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_5) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_7 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_7) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_9 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_9) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn58
                 (((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
happyIn58
                 (((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 -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_2 of { (HappyWrap53 (BNFC'Position, ParamDecl)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_4) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn58
                 (((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_2 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_4) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn58
                 (((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_2 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_4) -> 
        case HappyAbsSyn -> HappyWrap66
happyOut66 HappyAbsSyn
happy_x_6 of { (HappyWrap66 (BNFC'Position, [Term])
happy_var_6) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn58
                 (((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
happyIn58
                 (((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
happyIn58
                 (((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_2 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_2) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn58
                 (((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_2 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_4) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn58
                 (((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_3 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_3) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_5 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_5) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_7 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_7) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_9 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_9) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_11 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_11) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_13 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_13) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn58
                 (((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 -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_1 of { (HappyWrap38 (BNFC'Position, HoleIdent)
happy_var_1) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn58
                 (((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 -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_1 of { (HappyWrap39 (BNFC'Position, VarIdent)
happy_var_1) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn58
                 (((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_2 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_2) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn58
                 (((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
happyIn58
                 (((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
happyIn58
                 (((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
happyIn58
                 (((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
happyIn58
                 (((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
happyIn58
                 (((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 -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_2 of { (HappyWrap53 (BNFC'Position, ParamDecl)
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_4) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn58
                 (((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 -> HappyWrap59
happyOut59 HappyAbsSyn
happy_x_1 of { (HappyWrap59 (BNFC'Position, Term)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_3 of { (HappyWrap64 (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.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 -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_1 of { (HappyWrap64 (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_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 -> HappyWrap59
happyOut59 HappyAbsSyn
happy_x_1 of { (HappyWrap59 (BNFC'Position, Term)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_3 of { (HappyWrap64 (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_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 -> HappyWrap59
happyOut59 HappyAbsSyn
happy_x_1 of { (HappyWrap59 (BNFC'Position, Term)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap59
happyOut59 HappyAbsSyn
happy_x_3 of { (HappyWrap59 (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.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 -> HappyWrap59
happyOut59 HappyAbsSyn
happy_x_1 of { (HappyWrap59 (BNFC'Position, Term)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap59
happyOut59 HappyAbsSyn
happy_x_3 of { (HappyWrap59 (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.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 -> 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_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 -> HappyWrap59
happyOut59 HappyAbsSyn
happy_x_1 of { (HappyWrap59 (BNFC'Position, Term)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap59
happyOut59 HappyAbsSyn
happy_x_3 of { (HappyWrap59 (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_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 -> HappyWrap59
happyOut59 HappyAbsSyn
happy_x_1 of { (HappyWrap59 (BNFC'Position, Term)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap59
happyOut59 HappyAbsSyn
happy_x_3 of { (HappyWrap59 (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_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 -> 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.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 -> 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_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 -> 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_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 -> 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
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.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 -> 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_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 -> 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
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.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 -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_1 of { (HappyWrap53 (BNFC'Position, ParamDecl)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_3 of { (HappyWrap63 (BNFC'Position, Term)
happy_var_3) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn63
                 (((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 -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_3 of { (HappyWrap47 (BNFC'Position, Pattern)
happy_var_3) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_5 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_5) -> 
        case HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_8 of { (HappyWrap63 (BNFC'Position, Term)
happy_var_8) -> 
        (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 -> 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 -> HappyWrap54
happyOut54 HappyAbsSyn
happy_x_3 of { (HappyWrap54 (BNFC'Position, SigmaParam)
happy_var_3) -> 
        case HappyAbsSyn -> HappyWrap55
happyOut55 HappyAbsSyn
happy_x_5 of { (HappyWrap55 (BNFC'Position, [SigmaParam])
happy_var_5) -> 
        case HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_8 of { (HappyWrap63 (BNFC'Position, Term)
happy_var_8) -> 
        (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 -> 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 -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_1 of { (HappyWrap62 (BNFC'Position, Term)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_3 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_3) -> 
        case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_5 of { (HappyWrap62 (BNFC'Position, Term)
happy_var_5) -> 
        (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 -> 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 -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_1 of { (HappyWrap62 (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
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.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 -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_2 of { (HappyWrap52 (BNFC'Position, [Param])
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_4 of { (HappyWrap63 (BNFC'Position, Term)
happy_var_4) -> 
        (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 -> [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 -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_1 of { (HappyWrap62 (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_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 -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_1 of { (HappyWrap53 (BNFC'Position, ParamDecl)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_3 of { (HappyWrap63 (BNFC'Position, Term)
happy_var_3) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn63
                 (((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 -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_3 of { (HappyWrap47 (BNFC'Position, Pattern)
happy_var_3) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_5 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_5) -> 
        case HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_8 of { (HappyWrap63 (BNFC'Position, Term)
happy_var_8) -> 
        (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 -> 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 -> HappyWrap54
happyOut54 HappyAbsSyn
happy_x_3 of { (HappyWrap54 (BNFC'Position, SigmaParam)
happy_var_3) -> 
        case HappyAbsSyn -> HappyWrap55
happyOut55 HappyAbsSyn
happy_x_5 of { (HappyWrap55 (BNFC'Position, [SigmaParam])
happy_var_5) -> 
        case HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_8 of { (HappyWrap63 (BNFC'Position, Term)
happy_var_8) -> 
        (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 -> 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 -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_2 of { (HappyWrap52 (BNFC'Position, [Param])
happy_var_2) -> 
        case HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_4 of { (HappyWrap63 (BNFC'Position, Term)
happy_var_4) -> 
        (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 -> [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 -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_3 of { (HappyWrap47 (BNFC'Position, Pattern)
happy_var_3) -> 
        case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_5 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_5) -> 
        case HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_8 of { (HappyWrap63 (BNFC'Position, Term)
happy_var_8) -> 
        (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 -> 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 -> HappyWrap54
happyOut54 HappyAbsSyn
happy_x_3 of { (HappyWrap54 (BNFC'Position, SigmaParam)
happy_var_3) -> 
        case HappyAbsSyn -> HappyWrap55
happyOut55 HappyAbsSyn
happy_x_5 of { (HappyWrap55 (BNFC'Position, [SigmaParam])
happy_var_5) -> 
        case HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_8 of { (HappyWrap63 (BNFC'Position, Term)
happy_var_8) -> 
        (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 -> 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 -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_1 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap57
happyOut57 HappyAbsSyn
happy_x_3 of { (HappyWrap57 (BNFC'Position, [Restriction])
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 -> [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 -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_1 of { (HappyWrap64 (BNFC'Position, Term)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_2 of { (HappyWrap58 (BNFC'Position, Term)
happy_var_2) -> 
        (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.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 -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_2 of { (HappyWrap58 (BNFC'Position, Term)
happy_var_2) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn64
                 (((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 -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_2 of { (HappyWrap58 (BNFC'Position, Term)
happy_var_2) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn64
                 (((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 -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_1 of { (HappyWrap58 (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_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 -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_2 of { (HappyWrap58 (BNFC'Position, Term)
happy_var_2) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn64
                 (((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 -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_2 of { (HappyWrap58 (BNFC'Position, Term)
happy_var_2) -> 
        (BNFC'Position, Term) -> HappyAbsSyn
happyIn64
                 (((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 -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_1 of { (HappyWrap62 (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
happyIn65
                 (((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 -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_1 of { (HappyWrap63 (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, ((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_1 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_1) -> 
        (BNFC'Position, [Term]) -> HappyAbsSyn
happyIn66
                 (((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 -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_1 of { (HappyWrap65 (BNFC'Position, Term)
happy_var_1) -> 
        case HappyAbsSyn -> HappyWrap66
happyOut66 HappyAbsSyn
happy_x_3 of { (HappyWrap66 (BNFC'Position, [Term])
happy_var_3) -> 
        (BNFC'Position, [Term]) -> HappyAbsSyn
happyIn66
                 (((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))
        )}}

happyTerminalToTok :: Token -> Int#
happyTerminalToTok Token
term = case Token
term of {
        PT Posn
_ (TS String
_ Int
1) -> Int#
2#;
        PT Posn
_ (TS String
_ Int
2) -> Int#
3#;
        PT Posn
_ (TS String
_ Int
3) -> Int#
4#;
        PT Posn
_ (TS String
_ Int
4) -> Int#
5#;
        PT Posn
_ (TS String
_ Int
5) -> Int#
6#;
        PT Posn
_ (TS String
_ Int
6) -> Int#
7#;
        PT Posn
_ (TS String
_ Int
7) -> Int#
8#;
        PT Posn
_ (TS String
_ Int
8) -> Int#
9#;
        PT Posn
_ (TS String
_ Int
9) -> Int#
10#;
        PT Posn
_ (TS String
_ Int
10) -> Int#
11#;
        PT Posn
_ (TS String
_ Int
11) -> Int#
12#;
        PT Posn
_ (TS String
_ Int
12) -> Int#
13#;
        PT Posn
_ (TS String
_ Int
13) -> Int#
14#;
        PT Posn
_ (TS String
_ Int
14) -> Int#
15#;
        PT Posn
_ (TS String
_ Int
15) -> Int#
16#;
        PT Posn
_ (TS String
_ Int
16) -> Int#
17#;
        PT Posn
_ (TS String
_ Int
17) -> Int#
18#;
        PT Posn
_ (TS String
_ Int
18) -> Int#
19#;
        PT Posn
_ (TS String
_ Int
19) -> Int#
20#;
        PT Posn
_ (TS String
_ Int
20) -> Int#
21#;
        PT Posn
_ (TS String
_ Int
21) -> Int#
22#;
        PT Posn
_ (TS String
_ Int
22) -> Int#
23#;
        PT Posn
_ (TS String
_ Int
23) -> Int#
24#;
        PT Posn
_ (TS String
_ Int
24) -> Int#
25#;
        PT Posn
_ (TS String
_ Int
25) -> Int#
26#;
        PT Posn
_ (TS String
_ Int
26) -> Int#
27#;
        PT Posn
_ (TS String
_ Int
27) -> Int#
28#;
        PT Posn
_ (TS String
_ Int
28) -> Int#
29#;
        PT Posn
_ (TS String
_ Int
29) -> Int#
30#;
        PT Posn
_ (TS String
_ Int
30) -> Int#
31#;
        PT Posn
_ (TS String
_ Int
31) -> Int#
32#;
        PT Posn
_ (TS String
_ Int
32) -> Int#
33#;
        PT Posn
_ (TS String
_ Int
33) -> Int#
34#;
        PT Posn
_ (TS String
_ Int
34) -> Int#
35#;
        PT Posn
_ (TS String
_ Int
35) -> Int#
36#;
        PT Posn
_ (TS String
_ Int
36) -> Int#
37#;
        PT Posn
_ (TS String
_ Int
37) -> Int#
38#;
        PT Posn
_ (TS String
_ Int
38) -> Int#
39#;
        PT Posn
_ (TS String
_ Int
39) -> Int#
40#;
        PT Posn
_ (TS String
_ Int
40) -> Int#
41#;
        PT Posn
_ (TS String
_ Int
41) -> Int#
42#;
        PT Posn
_ (TS String
_ Int
42) -> Int#
43#;
        PT Posn
_ (TS String
_ Int
43) -> Int#
44#;
        PT Posn
_ (TS String
_ Int
44) -> Int#
45#;
        PT Posn
_ (TS String
_ Int
45) -> Int#
46#;
        PT Posn
_ (TS String
_ Int
46) -> Int#
47#;
        PT Posn
_ (TS String
_ Int
47) -> Int#
48#;
        PT Posn
_ (TS String
_ Int
48) -> Int#
49#;
        PT Posn
_ (TS String
_ Int
49) -> Int#
50#;
        PT Posn
_ (TS String
_ Int
50) -> Int#
51#;
        PT Posn
_ (TS String
_ Int
51) -> Int#
52#;
        PT Posn
_ (TS String
_ Int
52) -> Int#
53#;
        PT Posn
_ (TS String
_ Int
53) -> Int#
54#;
        PT Posn
_ (TS String
_ Int
54) -> Int#
55#;
        PT Posn
_ (TS String
_ Int
55) -> Int#
56#;
        PT Posn
_ (TS String
_ Int
56) -> Int#
57#;
        PT Posn
_ (TS String
_ Int
57) -> Int#
58#;
        PT Posn
_ (TS String
_ Int
58) -> Int#
59#;
        PT Posn
_ (TS String
_ Int
59) -> Int#
60#;
        PT Posn
_ (TS String
_ Int
60) -> Int#
61#;
        PT Posn
_ (TS String
_ Int
61) -> Int#
62#;
        PT Posn
_ (TS String
_ Int
62) -> Int#
63#;
        PT Posn
_ (TS String
_ Int
63) -> Int#
64#;
        PT Posn
_ (TS String
_ Int
64) -> Int#
65#;
        PT Posn
_ (TS String
_ Int
65) -> Int#
66#;
        PT Posn
_ (TS String
_ Int
66) -> Int#
67#;
        PT Posn
_ (TS String
_ Int
67) -> Int#
68#;
        PT Posn
_ (TS String
_ Int
68) -> Int#
69#;
        PT Posn
_ (TS String
_ Int
69) -> Int#
70#;
        PT Posn
_ (TS String
_ Int
70) -> Int#
71#;
        PT Posn
_ (TS String
_ Int
71) -> Int#
72#;
        PT Posn
_ (TS String
_ Int
72) -> Int#
73#;
        PT Posn
_ (TS String
_ Int
73) -> Int#
74#;
        PT Posn
_ (TS String
_ Int
74) -> Int#
75#;
        PT Posn
_ (TS String
_ Int
75) -> Int#
76#;
        PT Posn
_ (TS String
_ Int
76) -> Int#
77#;
        PT Posn
_ (TS String
_ Int
77) -> Int#
78#;
        PT Posn
_ (TL String
_) -> Int#
79#;
        PT Posn
_ (T_VarIdentToken String
_) -> Int#
80#;
        PT Posn
_ (T_HoleIdentToken String
_) -> Int#
81#;
        Token
_ -> Int#
-1#;
        }
{-# NOINLINE happyTerminalToTok #-}

happyLex :: (t -> [a] -> t) -> (Int# -> Token -> [Token] -> t) -> [Token] -> t
happyLex t -> [a] -> t
kend  Int# -> Token -> [Token] -> t
_kmore []       = t -> [a] -> t
kend t
forall a. a
notHappyAtAll []
happyLex t -> [a] -> t
_kend Int# -> Token -> [Token] -> t
kmore  (Token
tk:[Token]
tks) = Int# -> Token -> [Token] -> t
kmore (Token -> Int#
happyTerminalToTok Token
tk) Token
tk [Token]
tks
{-# INLINE happyLex #-}

happyNewToken :: Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyNewToken Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk = (ZonkAny 0 -> [Token] -> Err HappyAbsSyn)
-> (Int# -> Token -> [Token] -> Err HappyAbsSyn)
-> [Token]
-> Err HappyAbsSyn
forall {t} {a} {t}.
(t -> [a] -> t) -> (Int# -> Token -> [Token] -> t) -> [Token] -> t
happyLex (\ZonkAny 0
tk -> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyDoAction Int#
82# Token
forall a. a
notHappyAtAll Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk) (\Int#
i Token
tk -> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyDoAction Int#
i Token
tk Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk)

happyReport :: Int# -> Token -> [String] -> ([Token] -> Err a) -> [Token] -> Err a
happyReport Int#
82# Token
tk [String]
explist [Token] -> Err a
resume [Token]
tks = [Token] -> [String] -> ([Token] -> Err a) -> Err a
forall a. [Token] -> [String] -> ([Token] -> Err a) -> Err a
happyReport' [Token]
tks [String]
explist [Token] -> Err a
resume
happyReport Int#
_ Token
tk [String]
explist [Token] -> Err a
resume [Token]
tks = [Token] -> [String] -> ([Token] -> Err a) -> Err a
forall a. [Token] -> [String] -> ([Token] -> Err a) -> Err a
happyReport' (Token
tkToken -> [Token] -> [Token]
forall a. a -> [a] -> [a]
:[Token]
tks) [String]
explist (\[Token]
tks -> [Token] -> Err a
resume ([Token] -> [Token]
forall a. HasCallStack => [a] -> [a]
Happy_Prelude.tail [Token]
tks))


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)
happyFmap1 :: (t -> b) -> (t -> Err t) -> t -> Err b
happyFmap1 t -> b
f t -> Err t
m t
tks = Err t -> (t -> Err b) -> Err b
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (t -> Err t
m t
tks) (\t
a -> b -> Err b
forall a. a -> Err a
happyReturn (t -> b
f t
a))
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
happyReport' :: () => [(Token)] -> [Happy_Prelude.String] -> ([(Token)] -> (Err a)) -> (Err a)
happyReport' :: forall a. [Token] -> [String] -> ([Token] -> Err a) -> Err a
happyReport' = (\[Token]
tokens [String]
expected [Token] -> Err a
resume -> [Token] -> Err a
forall a. [Token] -> Err a
happyError [Token]
tokens)

happyAbort :: () => [(Token)] -> (Err a)
happyAbort :: forall a. [Token] -> Err a
happyAbort = String -> [Token] -> Err a
forall a. HasCallStack => String -> a
Happy_Prelude.error String
"Called abort handler in non-resumptive parser"

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 {(HappyWrap37 (BNFC'Position, Module)
x') = HappyAbsSyn -> HappyWrap37
happyOut37 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 {(HappyWrap38 (BNFC'Position, HoleIdent)
x') = HappyAbsSyn -> HappyWrap38
happyOut38 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 {(HappyWrap39 (BNFC'Position, VarIdent)
x') = HappyAbsSyn -> HappyWrap39
happyOut39 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 {(HappyWrap40 (BNFC'Position, [VarIdent])
x') = HappyAbsSyn -> HappyWrap40
happyOut40 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 {(HappyWrap41 (BNFC'Position, LanguageDecl)
x') = HappyAbsSyn -> HappyWrap41
happyOut41 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 {(HappyWrap42 (BNFC'Position, Language)
x') = HappyAbsSyn -> HappyWrap42
happyOut42 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 {(HappyWrap43 (BNFC'Position, Command)
x') = HappyAbsSyn -> HappyWrap43
happyOut43 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 {(HappyWrap44 (BNFC'Position, [Command])
x') = HappyAbsSyn -> HappyWrap44
happyOut44 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 {(HappyWrap45 (BNFC'Position, DeclUsedVars)
x') = HappyAbsSyn -> HappyWrap45
happyOut45 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 {(HappyWrap46 (BNFC'Position, SectionName)
x') = HappyAbsSyn -> HappyWrap46
happyOut46 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 {(HappyWrap47 (BNFC'Position, Pattern)
x') = HappyAbsSyn -> HappyWrap47
happyOut47 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 {(HappyWrap48 (BNFC'Position, [Pattern])
x') = HappyAbsSyn -> HappyWrap48
happyOut48 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 {(HappyWrap49 (BNFC'Position, Pattern)
x') = HappyAbsSyn -> HappyWrap49
happyOut49 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 {(HappyWrap50 (BNFC'Position, [Pattern])
x') = HappyAbsSyn -> HappyWrap50
happyOut50 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 {(HappyWrap51 (BNFC'Position, Param)
x') = HappyAbsSyn -> HappyWrap51
happyOut51 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 {(HappyWrap52 (BNFC'Position, [Param])
x') = HappyAbsSyn -> HappyWrap52
happyOut52 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 {(HappyWrap53 (BNFC'Position, ParamDecl)
x') = HappyAbsSyn -> HappyWrap53
happyOut53 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 {(HappyWrap54 (BNFC'Position, SigmaParam)
x') = HappyAbsSyn -> HappyWrap54
happyOut54 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 {(HappyWrap55 (BNFC'Position, [SigmaParam])
x') = HappyAbsSyn -> HappyWrap55
happyOut55 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 {(HappyWrap56 (BNFC'Position, Restriction)
x') = HappyAbsSyn -> HappyWrap56
happyOut56 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 {(HappyWrap57 (BNFC'Position, [Restriction])
x') = HappyAbsSyn -> HappyWrap57
happyOut57 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 {(HappyWrap58 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap58
happyOut58 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 {(HappyWrap59 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap59
happyOut59 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 {(HappyWrap60 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap60
happyOut60 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 {(HappyWrap61 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap61
happyOut61 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 {(HappyWrap62 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap62
happyOut62 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 {(HappyWrap63 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap63
happyOut63 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 {(HappyWrap64 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap64
happyOut64 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 {(HappyWrap65 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap65
happyOut65 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 {(HappyWrap66 (BNFC'Position, [Term])
x') = HappyAbsSyn -> HappyWrap66
happyOut66 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
#define HAPPY_COERCE 1
-- $Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp $

#if !defined(__GLASGOW_HASKELL__)
#  error This code isn't being built with GHC.
#endif

-- Get WORDS_BIGENDIAN (if defined)
#include "MachDeps.h"

-- Do not remove this comment. Required to fix CPP parsing when using GCC and a clang-compiled alex.
#define LT(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.<# m)) :: Happy_Prelude.Bool)
#define GTE(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.>=# m)) :: Happy_Prelude.Bool)
#define EQ(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.==# m)) :: Happy_Prelude.Bool)
#define PLUS(n,m) (n Happy_GHC_Exts.+# m)
#define MINUS(n,m) (n Happy_GHC_Exts.-# m)
#define TIMES(n,m) (n Happy_GHC_Exts.*# m)
#define NEGATE(n) (Happy_GHC_Exts.negateInt# (n))

type Happy_Int = Happy_GHC_Exts.Int#
data Happy_IntList = HappyCons Happy_Int Happy_IntList

#define INVALID_TOK -1#
#define ERROR_TOK 0#
#define CATCH_TOK 1#

#if defined(HAPPY_COERCE)
#  define GET_ERROR_TOKEN(x)  (case Happy_GHC_Exts.unsafeCoerce# x of { (Happy_GHC_Exts.I# i) -> i })
#  define MK_ERROR_TOKEN(i)   (Happy_GHC_Exts.unsafeCoerce# (Happy_GHC_Exts.I# i))
#  define MK_TOKEN(x)         (happyInTok (x))
#else
#  define GET_ERROR_TOKEN(x)  (case x of { HappyErrorToken (Happy_GHC_Exts.I# i) -> i })
#  define MK_ERROR_TOKEN(i)   (HappyErrorToken (Happy_GHC_Exts.I# i))
#  define MK_TOKEN(x)         (HappyTerminal (x))
#endif

#if defined(HAPPY_DEBUG)
#  define DEBUG_TRACE(s)    (happyTrace (s)) Happy_Prelude.$
happyTrace string expr = Happy_System_IO_Unsafe.unsafePerformIO Happy_Prelude.$ do
    Happy_System_IO.hPutStr Happy_System_IO.stderr string
    Happy_Prelude.return expr
#else
#  define DEBUG_TRACE(s)    {- nothing -}
#endif

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

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

happyParse :: Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
start_state = Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyNewToken Int#
start_state Happy_IntList
forall a. a
notHappyAtAll HappyStk HappyAbsSyn
forall a. a
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 :: Int# -> p -> Int# -> p -> HappyStk a -> b -> Err a
happyAccept ERROR_TOK tk st sts (_ `HappyStk` ans `HappyStk` _) =
        happyReturn1 ans
happyAccept Int#
j p
tk Int#
st p
sts (HappyStk a
ans HappyStk a
_) =
        (Int# -> ((b -> Err a) -> b -> Err a) -> (b -> Err a) -> b -> Err a
forall a. Int# -> a -> a
happyTcHack Int#
j (Int# -> (b -> Err a) -> b -> Err a
forall a. Int# -> a -> a
happyTcHack Int#
st)) (a -> b -> Err a
forall a b. a -> b -> Err a
happyReturn1 a
ans)

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

happyDoAction :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyDoAction Int#
i Token
tk Int#
st =
  DEBUG_TRACE("state: " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# st) Happy_Prelude.++
              ",\ttoken: " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# i) Happy_Prelude.++
              ",\taction: ")
  case Int# -> HappyAction
happyDecodeAction (Int# -> Int# -> Int#
happyNextAction Int#
i Int#
st) of
    HappyAction
HappyFail             -> DEBUG_TRACE("failing.\n")
                             Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyFail Int#
i Token
tk Int#
st
    HappyAction
HappyAccept           -> DEBUG_TRACE("accept.\n")
                             Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
forall {p} {p} {a} {b}.
Int# -> p -> Int# -> p -> HappyStk a -> b -> Err a
happyAccept Int#
i Token
tk Int#
st
    HappyReduce Int#
rule      -> DEBUG_TRACE("reduce (rule " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# rule) Happy_Prelude.++ ")")
                             (Array
  Int
  (Int#
   -> Token
   -> Int#
   -> Happy_IntList
   -> HappyStk HappyAbsSyn
   -> [Token]
   -> Err HappyAbsSyn)
happyReduceArr Array
  Int
  (Int#
   -> Token
   -> Int#
   -> Happy_IntList
   -> HappyStk HappyAbsSyn
   -> [Token]
   -> Err HappyAbsSyn)
-> Int
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
forall i e. Ix i => Array i e -> i -> e
Happy_Data_Array.! (Int# -> Int
Happy_GHC_Exts.I# Int#
rule)) Int#
i Token
tk Int#
st
    HappyShift  Int#
new_state -> DEBUG_TRACE("shift, enter state " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# new_state) Happy_Prelude.++ "\n")
                             Int#
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyShift Int#
new_state Int#
i Token
tk Int#
st

{-# INLINE happyNextAction #-}
happyNextAction :: Int# -> Int# -> Int#
happyNextAction Int#
i Int#
st = case Int# -> Int# -> Maybe Int
happyIndexActionTable Int#
i Int#
st of
  Happy_Prelude.Just (Happy_GHC_Exts.I# Int#
act) -> Int#
act
  Maybe Int
Happy_Prelude.Nothing                      -> HappyAddr -> Int# -> Int#
happyIndexOffAddr HappyAddr
happyDefActions Int#
st

{-# INLINE happyIndexActionTable #-}
happyIndexActionTable :: Int# -> Int# -> Maybe Int
happyIndexActionTable Int#
i Int#
st
  | GTE(i, 0#), GTE(off, 0#), EQ(happyIndexOffAddr happyCheck off, i)
  -- i >= 0:   Guard against INVALID_TOK (do the default action, which ultimately errors)
  -- off >= 0: Otherwise it's a default action
  -- equality check: Ensure that the entry in the compressed array is owned by st
  = Int -> Maybe Int
forall a. a -> Maybe a
Happy_Prelude.Just (Int# -> Int
Happy_GHC_Exts.I# (HappyAddr -> Int# -> Int#
happyIndexOffAddr HappyAddr
happyTable Int#
off))
  | Bool
Happy_Prelude.otherwise
  = Maybe Int
forall a. Maybe a
Happy_Prelude.Nothing
  where
    off :: Int#
off = PLUS(happyIndexOffAddr happyActOffsets st, i)

data HappyAction
  = HappyFail
  | HappyAccept
  | HappyReduce Happy_Int -- rule number
  | HappyShift Happy_Int  -- new state
  deriving Int -> HappyAction -> String -> String
[HappyAction] -> String -> String
HappyAction -> String
(Int -> HappyAction -> String -> String)
-> (HappyAction -> String)
-> ([HappyAction] -> String -> String)
-> Show HappyAction
forall a.
(Int -> a -> String -> String)
-> (a -> String) -> ([a] -> String -> String) -> Show a
$cshowsPrec :: Int -> HappyAction -> String -> String
showsPrec :: Int -> HappyAction -> String -> String
$cshow :: HappyAction -> String
show :: HappyAction -> String
$cshowList :: [HappyAction] -> String -> String
showList :: [HappyAction] -> String -> String
Happy_Prelude.Show

{-# INLINE happyDecodeAction #-}
happyDecodeAction :: Happy_Int -> HappyAction
happyDecodeAction :: Int# -> HappyAction
happyDecodeAction  Int#
0#                        = HappyAction
HappyFail
happyDecodeAction Int#
-1#                        = HappyAction
HappyAccept
happyDecodeAction Int#
action | LT(action, 0#)    = HappyReduce NEGATE(PLUS(action, 1#))
                         | Bool
Happy_Prelude.otherwise = Int# -> HappyAction
HappyShift MINUS(action, 1#)

{-# INLINE happyIndexGotoTable #-}
happyIndexGotoTable :: Int# -> Int# -> Int#
happyIndexGotoTable Int#
nt Int#
st = HappyAddr -> Int# -> Int#
happyIndexOffAddr HappyAddr
happyTable Int#
off
  where
    off :: Int#
off = PLUS(happyIndexOffAddr happyGotoOffsets st, nt)

{-# INLINE happyIndexOffAddr #-}
happyIndexOffAddr :: HappyAddr -> Happy_Int -> Happy_Int
happyIndexOffAddr :: HappyAddr -> Int# -> Int#
happyIndexOffAddr (HappyA# Addr#
arr) Int#
off =
#if __GLASGOW_HASKELL__ >= 901
  Int32# -> Int#
Happy_GHC_Exts.int32ToInt# -- qualified import because it doesn't exist on older GHC's
#endif
#ifdef WORDS_BIGENDIAN
  -- The CI of `alex` tests this code path
  (Happy_GHC_Exts.word32ToInt32# (Happy_GHC_Exts.wordToWord32# (Happy_GHC_Exts.byteSwap32# (Happy_GHC_Exts.word32ToWord# (Happy_GHC_Exts.int32ToWord32#
#endif
  (Addr# -> Int# -> Int32#
Happy_GHC_Exts.indexInt32OffAddr# Addr#
arr Int#
off)
#ifdef WORDS_BIGENDIAN
  )))))
#endif

happyIndexRuleArr :: Happy_Int -> (# Happy_Int, Happy_Int #)
happyIndexRuleArr :: Int# -> (# Int#, Int# #)
happyIndexRuleArr Int#
r = (# Int#
nt, Int#
len #)
  where
    !(Happy_GHC_Exts.I# Int#
n_starts) = Int
happy_n_starts
    offs :: Int#
offs = TIMES(MINUS(r,n_starts),2#)
    nt :: Int#
nt = HappyAddr -> Int# -> Int#
happyIndexOffAddr HappyAddr
happyRuleArr Int#
offs
    len :: Int#
len = HappyAddr -> Int# -> Int#
happyIndexOffAddr HappyAddr
happyRuleArr PLUS(offs,1#)

data HappyAddr = HappyA# Happy_GHC_Exts.Addr#

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

happyShift :: Int#
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyShift Int#
new_state ERROR_TOK tk st sts stk@(x `HappyStk` _) =
     -- See "Error Fixup" below
     let i = GET_ERROR_TOKEN(x) in
     DEBUG_TRACE("shifting the error token")
     happyDoAction i tk new_state (HappyCons st sts) stk

happyShift Int#
new_state Int#
i Token
tk Int#
st Happy_IntList
sts HappyStk HappyAbsSyn
stk =
     Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyNewToken Int#
new_state (Int# -> Happy_IntList -> Happy_IntList
HappyCons Int#
st Happy_IntList
sts) (MK_TOKEN(tk) `HappyStk` stk)

-- happyReduce is specialised for the common cases.

happySpecReduce_0 :: Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_0 Int#
nt HappyAbsSyn
fn Int#
j Token
tk Int#
st Happy_IntList
sts HappyStk HappyAbsSyn
stk
     = HappyAbsSyn
-> ([Token] -> Err HappyAbsSyn) -> [Token] -> Err HappyAbsSyn
forall a b. a -> b -> b
happySeq HappyAbsSyn
fn (Int#
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyGoto Int#
nt Int#
j Token
tk Int#
st (Int# -> Happy_IntList -> Happy_IntList
HappyCons Int#
st Happy_IntList
sts) (HappyAbsSyn
fn HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
stk))

happySpecReduce_1 :: Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
nt HappyAbsSyn -> HappyAbsSyn
fn Int#
j Token
tk Int#
old_st sts :: Happy_IntList
sts@(HappyCons Int#
st Happy_IntList
_) (HappyAbsSyn
v1 `HappyStk` HappyStk HappyAbsSyn
stk')
     = let r :: HappyAbsSyn
r = HappyAbsSyn -> HappyAbsSyn
fn HappyAbsSyn
v1 in
       Int# -> ([Token] -> Err HappyAbsSyn) -> [Token] -> Err HappyAbsSyn
forall a. Int# -> a -> a
happyTcHack Int#
old_st (HappyAbsSyn
-> ([Token] -> Err HappyAbsSyn) -> [Token] -> Err HappyAbsSyn
forall a b. a -> b -> b
happySeq HappyAbsSyn
r (Int#
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyGoto Int#
nt Int#
j Token
tk Int#
st Happy_IntList
sts (HappyAbsSyn
r HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
stk')))

happySpecReduce_2 :: Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2 Int#
nt HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
fn Int#
j Token
tk Int#
old_st
  (HappyCons Int#
_ sts :: Happy_IntList
sts@(HappyCons Int#
st Happy_IntList
_))
  (HappyAbsSyn
v1 `HappyStk` HappyAbsSyn
v2 `HappyStk` HappyStk HappyAbsSyn
stk')
     = let r :: HappyAbsSyn
r = HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
fn HappyAbsSyn
v1 HappyAbsSyn
v2 in
       Int# -> ([Token] -> Err HappyAbsSyn) -> [Token] -> Err HappyAbsSyn
forall a. Int# -> a -> a
happyTcHack Int#
old_st (HappyAbsSyn
-> ([Token] -> Err HappyAbsSyn) -> [Token] -> Err HappyAbsSyn
forall a b. a -> b -> b
happySeq HappyAbsSyn
r (Int#
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyGoto Int#
nt Int#
j Token
tk Int#
st Happy_IntList
sts (HappyAbsSyn
r HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
stk')))

happySpecReduce_3 :: Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3 Int#
nt HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
fn Int#
j Token
tk Int#
old_st
  (HappyCons Int#
_ (HappyCons Int#
_ sts :: Happy_IntList
sts@(HappyCons Int#
st Happy_IntList
_)))
  (HappyAbsSyn
v1 `HappyStk` HappyAbsSyn
v2 `HappyStk` HappyAbsSyn
v3 `HappyStk` HappyStk HappyAbsSyn
stk')
     = let r :: HappyAbsSyn
r = HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
fn HappyAbsSyn
v1 HappyAbsSyn
v2 HappyAbsSyn
v3 in
       Int# -> ([Token] -> Err HappyAbsSyn) -> [Token] -> Err HappyAbsSyn
forall a. Int# -> a -> a
happyTcHack Int#
old_st (HappyAbsSyn
-> ([Token] -> Err HappyAbsSyn) -> [Token] -> Err HappyAbsSyn
forall a b. a -> b -> b
happySeq HappyAbsSyn
r (Int#
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyGoto Int#
nt Int#
j Token
tk Int#
st Happy_IntList
sts (HappyAbsSyn
r HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
stk')))

happyReduce :: Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
k Int#
nt HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
fn Int#
j Token
tk Int#
st Happy_IntList
sts HappyStk HappyAbsSyn
stk
     = case Int# -> Happy_IntList -> Happy_IntList
happyDrop MINUS(k,(1# :: Happy_Int)) sts of
         sts1 :: Happy_IntList
sts1@(HappyCons Int#
st1 Happy_IntList
_) ->
                let r :: HappyStk HappyAbsSyn
r = HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
fn HappyStk HappyAbsSyn
stk in -- it doesn't hurt to always seq here...
                Int#
st Int# -> ([Token] -> Err HappyAbsSyn) -> [Token] -> Err HappyAbsSyn
forall a. Int# -> a -> a
`happyTcHack` HappyStk HappyAbsSyn
-> ([Token] -> Err HappyAbsSyn) -> [Token] -> Err HappyAbsSyn
forall a b. a -> b -> b
happyDoSeq HappyStk HappyAbsSyn
r (Int#
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyGoto Int#
nt Int#
j Token
tk Int#
st1 Happy_IntList
sts1 HappyStk HappyAbsSyn
r)

happyMonadReduce :: Int#
-> Int#
-> (HappyStk HappyAbsSyn -> Token -> Err HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyMonadReduce Int#
k Int#
nt HappyStk HappyAbsSyn -> Token -> Err HappyAbsSyn
fn Int#
j Token
tk Int#
st Happy_IntList
sts HappyStk HappyAbsSyn
stk =
      case Int# -> Happy_IntList -> Happy_IntList
happyDrop Int#
k (Int# -> Happy_IntList -> Happy_IntList
HappyCons Int#
st Happy_IntList
sts) of
        sts1 :: Happy_IntList
sts1@(HappyCons Int#
st1 Happy_IntList
_) ->
          let drop_stk :: HappyStk HappyAbsSyn
drop_stk = Int# -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall {a}. Int# -> HappyStk a -> HappyStk a
happyDropStk Int#
k HappyStk HappyAbsSyn
stk in
          Int#
j Int# -> ([Token] -> Err HappyAbsSyn) -> [Token] -> Err HappyAbsSyn
forall a. Int# -> a -> a
`happyTcHack` Err HappyAbsSyn
-> (HappyAbsSyn -> [Token] -> Err HappyAbsSyn)
-> [Token]
-> Err HappyAbsSyn
forall {m :: * -> *} {t} {t} {b}.
Monad m =>
m t -> (t -> t -> m b) -> t -> m b
happyThen1 (HappyStk HappyAbsSyn -> Token -> Err HappyAbsSyn
fn HappyStk HappyAbsSyn
stk Token
tk)
                                     (\HappyAbsSyn
r -> Int#
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyGoto Int#
nt Int#
j Token
tk Int#
st1 Happy_IntList
sts1 (HappyAbsSyn
r HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
drop_stk))

happyMonad2Reduce :: Int#
-> Int#
-> (HappyStk HappyAbsSyn -> t -> Err HappyAbsSyn)
-> Int#
-> t
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyMonad2Reduce Int#
k Int#
nt HappyStk HappyAbsSyn -> t -> Err HappyAbsSyn
fn Int#
j t
tk Int#
st Happy_IntList
sts HappyStk HappyAbsSyn
stk =
      case Int# -> Happy_IntList -> Happy_IntList
happyDrop Int#
k (Int# -> Happy_IntList -> Happy_IntList
HappyCons Int#
st Happy_IntList
sts) of
        sts1 :: Happy_IntList
sts1@(HappyCons Int#
st1 Happy_IntList
_) ->
          let drop_stk :: HappyStk HappyAbsSyn
drop_stk = Int# -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall {a}. Int# -> HappyStk a -> HappyStk a
happyDropStk Int#
k HappyStk HappyAbsSyn
stk
              off :: Int#
off = HappyAddr -> Int# -> Int#
happyIndexOffAddr HappyAddr
happyGotoOffsets Int#
st1
              off_i :: Int#
off_i = PLUS(off, nt)
              new_state :: Int#
new_state = HappyAddr -> Int# -> Int#
happyIndexOffAddr HappyAddr
happyTable Int#
off_i
          in
            Int#
j Int# -> ([Token] -> Err HappyAbsSyn) -> [Token] -> Err HappyAbsSyn
forall a. Int# -> a -> a
`happyTcHack` Err HappyAbsSyn
-> (HappyAbsSyn -> [Token] -> Err HappyAbsSyn)
-> [Token]
-> Err HappyAbsSyn
forall {m :: * -> *} {t} {t} {b}.
Monad m =>
m t -> (t -> t -> m b) -> t -> m b
happyThen1 (HappyStk HappyAbsSyn -> t -> Err HappyAbsSyn
fn HappyStk HappyAbsSyn
stk t
tk)
                                       (\HappyAbsSyn
r -> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyNewToken Int#
new_state Happy_IntList
sts1 (HappyAbsSyn
r HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
drop_stk))

happyDrop :: Int# -> Happy_IntList -> Happy_IntList
happyDrop Int#
0# Happy_IntList
l               = Happy_IntList
l
happyDrop Int#
n  (HappyCons Int#
_ Happy_IntList
t) = Int# -> Happy_IntList -> Happy_IntList
happyDrop MINUS(n,(1# :: Happy_Int)) t

happyDropStk :: Int# -> HappyStk a -> HappyStk a
happyDropStk Int#
0# HappyStk a
l                 = HappyStk a
l
happyDropStk Int#
n  (a
x `HappyStk` HappyStk a
xs) = Int# -> HappyStk a -> HappyStk a
happyDropStk MINUS(n,(1#::Happy_Int)) xs

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

happyGoto :: Int#
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyGoto Int#
nt Int#
j Token
tk Int#
st =
   DEBUG_TRACE(", goto state " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# new_state) Happy_Prelude.++ "\n")
   Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyDoAction Int#
j Token
tk Int#
new_state
  where new_state :: Int#
new_state = Int# -> Int# -> Int#
happyIndexGotoTable Int#
nt Int#
st

{- Note [Error recovery]
~~~~~~~~~~~~~~~~~~~~~~~~
When there is no applicable action for the current lookahead token `tk`,
happy enters error recovery mode. Depending on whether the grammar file
declares the two action form `%error { abort } { report }` for
    Resumptive Error Handling,
it works in one (not resumptive) or two phases (resumptive):

 1. Fixup mode:
    Try to see if there is an action for the error token ERROR_TOK. If there
    is, do *not* emit an error and pretend instead that an `error` token was
    inserted.
    When there is no ERROR_TOK action, report an error.

    In non-resumptive error handling, calling the single error handler
    (e.g. `happyError`) will throw an exception and abort the parser.
    However, in resumptive error handling we enter *error resumption mode*.

 2. Error resumption mode:
    After reporting the error (with `report`), happy will attempt to find
    a good state stack to resume parsing in.
    For each candidate stack, it discards input until one of the candidates
    resumes (i.e. shifts the current input).
    If no candidate resumes before the end of input, resumption failed and
    calls the `abort` function, to much the same effect as in non-resumptive
    error handling.

    Candidate stacks are declared by the grammar author using the special
    `catch` terminal and called "catch frames".
    This mechanism is described in detail in Note [happyResume].

The `catch` resumption mechanism (2) is what usually is associated with
`error` in `bison` or `menhir`. Since `error` is used for the Fixup mechanism
(1) above, we call the corresponding token `catch`.
Furthermore, in constrast to `bison`, our implementation of `catch`
non-deterministically considers multiple catch frames on the stack for
resumption (See Note [Multiple catch frames]).

Note [happyResume]
~~~~~~~~~~~~~~~~~~
`happyResume` implements the resumption mechanism from Note [Error recovery].
It is best understood by example. Consider

Exp :: { String }
Exp : '1'                { "1" }
    | catch              { "catch" }
    | Exp '+' Exp %shift { $1 Happy_Prelude.++ " + " Happy_Prelude.++ $3 } -- %shift: associate 1 + 1 + 1 to the right
    | '(' Exp ')'        { "(" Happy_Prelude.++ $2 Happy_Prelude.++ ")" }

The idea of the use of `catch` here is that upon encountering a parse error
during expression parsing, we can gracefully degrade using the `catch` rule,
still producing a partial syntax tree and keep on parsing to find further
syntax errors.

Let's trace the parser state for input 11+1, which will error out after shifting 1.
After shifting, we have the following item stack (growing downwards and omitting
transitive closure items):

  State 0: %start_parseExp -> . Exp
  State 5: Exp -> '1' .

(Stack as a list of state numbers: [5,0].)
As Note [Error recovery] describes, we will first try Fixup mode.
That fails because no production can shift the `error` token.
Next we try Error resumption mode. This works as follows:

  1. Pop off the item stack until we find an item that can shift the `catch`
     token. (Implemented in `pop_items`.)
       * State 5 cannot shift catch. Pop.
       * State 0 can shift catch, which would transition into
          State 4: Exp -> catch .
     So record the *stack* `[4,0]` after doing the shift transition.
     We call this a *catch frame*, where the top is a *catch state*,
     corresponding to an item in which we just shifted a `catch` token.
     There can be multiple such catch stacks, see Note [Multiple catch frames].

  2. Discard tokens from the input until the lookahead can be shifted in one
     of the catch stacks. (Implemented in `discard_input_until_exp` and
     `some_catch_state_shifts`.)
       * We cannot shift the current lookahead '1' in state 4, so we discard
       * We *can* shift the next lookahead '+' in state 4, but only after
         reducing, which pops State 4 and goes to State 3:
           State 3: %start_parseExp -> Exp .
                    Exp -> Exp . '+' Exp
         Here we can shift '+'.
     As you can see, to implement this machinery we need to simulate
     the operation of the LALR automaton, especially reduction
     (`happySimulateReduce`).

Note [Multiple catch frames]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~
For fewer spurious error messages, it can be beneficial to trace multiple catch
items. Consider

Exp : '1'
    | catch
    | Exp '+' Exp %shift
    | '(' Exp ')'

Let's trace the parser state for input (;+1, which will error out after shifting (.
After shifting, we have the following item stack (growing downwards):

  State 0: %start_parseExp -> . Exp
  State 6: Exp -> '(' . Exp ')'

Upon error, we want to find items in the stack which can shift a catch token.
Note that both State 0 and State 6 can shift a catch token, transitioning into
  State 4: Exp -> catch .
Hence we record the catch frames `[4,6,0]` and `[4,0]` for possible resumption.

Which catch frame do we pick for resumption?
Note that resuming catch frame `[4,0]` will parse as "catch+1", whereas
resuming the innermost frame `[4,6,0]` corresponds to parsing "(catch+1".
The latter would keep discarding input until the closing ')' is found.
So we will discard + and 1, leading to a spurious syntax error at the end of
input, aborting the parse and never producing a partial syntax tree. Bad!

It is far preferable to resume with catch frame `[4,0]`, where we can resume
successfully on input +, so that is what we do.

In general, we pick the catch frame for resumption that discards the least
amount of input for a successful shift, preferring the topmost such catch frame.
-}

-- happyFail :: Happy_Int -> Token -> Happy_Int -> _
-- This function triggers Note [Error recovery].
-- If the current token is ERROR_TOK, phase (1) has failed and we might try
-- phase (2).
happyFail :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyFail ERROR_TOK = happyFixupFailed
happyFail Int#
i         = Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyTryFixup Int#
i

-- Enter Error Fixup (see Note [Error recovery]):
-- generate an error token, save the old token and carry on.
-- When a `happyShift` accepts the error token, we will pop off the error token
-- to resume parsing with the current lookahead `i`.
happyTryFixup :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyTryFixup Int#
i Token
tk Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk =
  DEBUG_TRACE("entering `error` fixup.\n")
  Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyDoAction ERROR_TOK tk action sts (MK_ERROR_TOKEN(i) `HappyStk` stk)
  -- NB: `happyShift` will simply pop the error token and carry on with
  --     `tk`. Hence we don't change `tk` in the call here

-- See Note [Error recovery], phase (2).
-- Enter resumption mode after reporting the error by calling `happyResume`.
happyFixupFailed :: Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyFixupFailed Token
tk Int#
st Happy_IntList
sts (HappyAbsSyn
x `HappyStk` HappyStk HappyAbsSyn
stk) =
  let i :: Int#
i = GET_ERROR_TOKEN(x) in
  DEBUG_TRACE("`error` fixup failed.\n")
  let resume :: [Token] -> Err HappyAbsSyn
resume   = Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyResume Int#
i Token
tk Int#
st Happy_IntList
sts HappyStk HappyAbsSyn
stk
      expected :: [String]
expected = Int# -> Happy_IntList -> [String]
happyExpectedTokens Int#
st Happy_IntList
sts in
  Int#
-> Token
-> [String]
-> ([Token] -> Err HappyAbsSyn)
-> [Token]
-> Err HappyAbsSyn
forall {a}.
Int# -> Token -> [String] -> ([Token] -> Err a) -> [Token] -> Err a
happyReport Int#
i Token
tk [String]
expected [Token] -> Err HappyAbsSyn
resume

-- happyResume :: Happy_Int -> Token -> Happy_Int -> _
-- See Note [happyResume]
happyResume :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyResume Int#
i Token
tk Int#
st Happy_IntList
sts HappyStk HappyAbsSyn
stk = [(Happy_IntList, HappyStk HappyAbsSyn)]
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
pop_items [] Int#
st Happy_IntList
sts HappyStk HappyAbsSyn
stk
  where
    !(Happy_GHC_Exts.I# Int#
n_starts) = Int
happy_n_starts   -- this is to test whether we have a start token
    !(Happy_GHC_Exts.I# Int#
eof_i) = Int
happy_n_terms Int -> Int -> Int
forall a. Num a => a -> a -> a
Happy_Prelude.- Int
1   -- this is the token number of the EOF token
    happy_list_to_list :: Happy_IntList -> [Happy_Prelude.Int]
    happy_list_to_list :: Happy_IntList -> [Int]
happy_list_to_list (HappyCons Int#
st Happy_IntList
sts)
      | LT(st, n_starts)
      = [(Int# -> Int
Happy_GHC_Exts.I# Int#
st)]
      | Bool
Happy_Prelude.otherwise
      = (Int# -> Int
Happy_GHC_Exts.I# Int#
st) Int -> [Int] -> [Int]
forall a. a -> [a] -> [a]
: Happy_IntList -> [Int]
happy_list_to_list Happy_IntList
sts

    -- See (1) of Note [happyResume]
    pop_items :: [(Happy_IntList, HappyStk HappyAbsSyn)]
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
pop_items [(Happy_IntList, HappyStk HappyAbsSyn)]
catch_frames Int#
st Happy_IntList
sts HappyStk HappyAbsSyn
stk
      | LT(st, n_starts)
      = DEBUG_TRACE("reached start state " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# st) Happy_Prelude.++ ", ")
        if [(Happy_IntList, HappyStk HappyAbsSyn)] -> Bool
forall a. [a] -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
Happy_Prelude.null [(Happy_IntList, HappyStk HappyAbsSyn)]
catch_frames_new
          then DEBUG_TRACE("no resumption.\n")
               [Token] -> Err HappyAbsSyn
forall a. [Token] -> Err a
happyAbort
          else DEBUG_TRACE("now discard input, trying to anchor in states " Happy_Prelude.++ Happy_Prelude.show (Happy_Prelude.map (happy_list_to_list . Happy_Prelude.fst) (Happy_Prelude.reverse catch_frames_new)) Happy_Prelude.++ ".\n")
               Int#
-> Token
-> [(Happy_IntList, HappyStk HappyAbsSyn)]
-> [Token]
-> Err HappyAbsSyn
discard_input_until_exp Int#
i Token
tk ([(Happy_IntList, HappyStk HappyAbsSyn)]
-> [(Happy_IntList, HappyStk HappyAbsSyn)]
forall a. [a] -> [a]
Happy_Prelude.reverse [(Happy_IntList, HappyStk HappyAbsSyn)]
catch_frames_new)
      | (HappyCons Int#
st1 Happy_IntList
sts1) <- Happy_IntList
sts, HappyAbsSyn
_ `HappyStk` HappyStk HappyAbsSyn
stk1 <- HappyStk HappyAbsSyn
stk
      = [(Happy_IntList, HappyStk HappyAbsSyn)]
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
pop_items [(Happy_IntList, HappyStk HappyAbsSyn)]
catch_frames_new Int#
st1 Happy_IntList
sts1 HappyStk HappyAbsSyn
stk1
      where
        !catch_frames_new :: [(Happy_IntList, HappyStk HappyAbsSyn)]
catch_frames_new
          | HappyShift Int#
new_state <- Int# -> HappyAction
happyDecodeAction (Int# -> Int# -> Int#
happyNextAction CATCH_TOK st)
          , DEBUG_TRACE("can shift catch token in state " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# st) Happy_Prelude.++ ", into state " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# new_state) Happy_Prelude.++ "\n")
            [(Happy_IntList, HappyStk HappyAbsSyn)] -> Bool
forall a. [a] -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
Happy_Prelude.null (((Happy_IntList, HappyStk HappyAbsSyn) -> Bool)
-> [(Happy_IntList, HappyStk HappyAbsSyn)]
-> [(Happy_IntList, HappyStk HappyAbsSyn)]
forall a. (a -> Bool) -> [a] -> [a]
Happy_Prelude.filter (\(HappyCons Int#
_ (HappyCons Int#
h Happy_IntList
_),HappyStk HappyAbsSyn
_) -> EQ(st,h)) catch_frames)
          = (Int# -> Happy_IntList -> Happy_IntList
HappyCons Int#
new_state (Int# -> Happy_IntList -> Happy_IntList
HappyCons Int#
st Happy_IntList
sts), MK_ERROR_TOKEN(i) `HappyStk` stk):catch_frames -- MK_ERROR_TOKEN(i) is just some dummy that should not be accessed by user code
          | Bool
Happy_Prelude.otherwise
          = DEBUG_TRACE("already shifted or can't shift catch in " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# st) Happy_Prelude.++ "\n")
            [(Happy_IntList, HappyStk HappyAbsSyn)]
catch_frames

    -- See (2) of Note [happyResume]
    discard_input_until_exp :: Int#
-> Token
-> [(Happy_IntList, HappyStk HappyAbsSyn)]
-> [Token]
-> Err HappyAbsSyn
discard_input_until_exp Int#
i Token
tk [(Happy_IntList, HappyStk HappyAbsSyn)]
catch_frames
      | Happy_Prelude.Just (HappyCons Int#
st (HappyCons Int#
catch_st Happy_IntList
sts), HappyStk HappyAbsSyn
catch_frame) <- Int#
-> [(Happy_IntList, HappyStk HappyAbsSyn)]
-> Maybe (Happy_IntList, HappyStk HappyAbsSyn)
forall {b}.
Int# -> [(Happy_IntList, b)] -> Maybe (Happy_IntList, b)
some_catch_state_shifts Int#
i [(Happy_IntList, HappyStk HappyAbsSyn)]
catch_frames
      = DEBUG_TRACE("found expected token in state " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# st) Happy_Prelude.++ " after shifting from " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# catch_st) Happy_Prelude.++ ": " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# i) Happy_Prelude.++ "\n")
        Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyDoAction Int#
i Token
tk Int#
st (Int# -> Happy_IntList -> Happy_IntList
HappyCons Int#
catch_st Happy_IntList
sts) HappyStk HappyAbsSyn
catch_frame
      | EQ(i,eof_i) -- is i EOF?
      = DEBUG_TRACE("reached EOF, cannot resume. abort parse :(\n")
        [Token] -> Err HappyAbsSyn
forall a. [Token] -> Err a
happyAbort
      | Bool
Happy_Prelude.otherwise
      = DEBUG_TRACE("discard token " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# i) Happy_Prelude.++ "\n")
        (Token -> [Token] -> Err HappyAbsSyn)
-> (Int# -> Token -> [Token] -> Err HappyAbsSyn)
-> [Token]
-> Err HappyAbsSyn
forall {t} {a} {t}.
(t -> [a] -> t) -> (Int# -> Token -> [Token] -> t) -> [Token] -> t
happyLex (\Token
eof_tk -> Int#
-> Token
-> [(Happy_IntList, HappyStk HappyAbsSyn)]
-> [Token]
-> Err HappyAbsSyn
discard_input_until_exp Int#
eof_i Token
eof_tk [(Happy_IntList, HappyStk HappyAbsSyn)]
catch_frames) -- eof
                 (\Int#
i Token
tk   -> Int#
-> Token
-> [(Happy_IntList, HappyStk HappyAbsSyn)]
-> [Token]
-> Err HappyAbsSyn
discard_input_until_exp Int#
i Token
tk [(Happy_IntList, HappyStk HappyAbsSyn)]
catch_frames)         -- not eof

    some_catch_state_shifts :: Int# -> [(Happy_IntList, b)] -> Maybe (Happy_IntList, b)
some_catch_state_shifts Int#
_ [] = DEBUG_TRACE("no catch state could shift.\n") Happy_Prelude.Nothing
    some_catch_state_shifts Int#
i catch_frames :: [(Happy_IntList, b)]
catch_frames@(((HappyCons Int#
st Happy_IntList
sts),b
_):[(Happy_IntList, b)]
_) = Int#
-> Int#
-> Happy_IntList
-> [(Happy_IntList, b)]
-> Maybe (Happy_IntList, b)
try_head Int#
i Int#
st Happy_IntList
sts [(Happy_IntList, b)]
catch_frames
      where
        try_head :: Int#
-> Int#
-> Happy_IntList
-> [(Happy_IntList, b)]
-> Maybe (Happy_IntList, b)
try_head Int#
i Int#
st Happy_IntList
sts [(Happy_IntList, b)]
catch_frames = -- PRECONDITION: head catch_frames = (HappyCons st sts)
          DEBUG_TRACE("trying token " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# i) Happy_Prelude.++ " in state " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# st) Happy_Prelude.++ ": ")
          case Int# -> HappyAction
happyDecodeAction (Int# -> Int# -> Int#
happyNextAction Int#
i Int#
st) of
            HappyAction
HappyFail     -> DEBUG_TRACE("fail.\n")   some_catch_state_shifts i (Happy_Prelude.tail catch_frames)
            HappyAction
HappyAccept   -> DEBUG_TRACE("accept.\n") Happy_Prelude.Just (Happy_Prelude.head catch_frames)
            HappyShift Int#
_  -> DEBUG_TRACE("shift.\n")  Happy_Prelude.Just (Happy_Prelude.head catch_frames)
            HappyReduce Int#
r -> case Int# -> Int# -> Happy_IntList -> Happy_IntList
happySimulateReduce Int#
r Int#
st Happy_IntList
sts of
              (HappyCons Int#
st1 Happy_IntList
sts1) -> Int#
-> Int#
-> Happy_IntList
-> [(Happy_IntList, b)]
-> Maybe (Happy_IntList, b)
try_head Int#
i Int#
st1 Happy_IntList
sts1 [(Happy_IntList, b)]
catch_frames

happySimulateReduce :: Int# -> Int# -> Happy_IntList -> Happy_IntList
happySimulateReduce Int#
r Int#
st Happy_IntList
sts =
  DEBUG_TRACE("simulate reduction of rule " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# r) Happy_Prelude.++ ", ")
  let (# Int#
nt, Int#
len #) = Int# -> (# Int#, Int# #)
happyIndexRuleArr Int#
r in
  DEBUG_TRACE("nt " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# nt) Happy_Prelude.++ ", len: " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# len) Happy_Prelude.++ ", new_st ")
  let !(sts1 :: Happy_IntList
sts1@(HappyCons Int#
st1 Happy_IntList
_)) = Int# -> Happy_IntList -> Happy_IntList
happyDrop Int#
len (Int# -> Happy_IntList -> Happy_IntList
HappyCons Int#
st Happy_IntList
sts)
      new_st :: Int#
new_st = Int# -> Int# -> Int#
happyIndexGotoTable Int#
nt Int#
st1 in
  DEBUG_TRACE(Happy_Prelude.show (Happy_GHC_Exts.I# new_st) Happy_Prelude.++ ".\n")
  (Int# -> Happy_IntList -> Happy_IntList
HappyCons Int#
new_st Happy_IntList
sts1)

happyTokenToString :: Happy_Prelude.Int -> Happy_Prelude.String
happyTokenToString :: Int -> String
happyTokenToString Int
i = [String]
happyTokenStrings [String] -> Int -> String
forall a. HasCallStack => [a] -> Int -> a
Happy_Prelude.!! (Int
i Int -> Int -> Int
forall a. Num a => a -> a -> a
Happy_Prelude.- Int
2) -- 2: errorTok, catchTok

happyExpectedTokens :: Happy_Int -> Happy_IntList -> [Happy_Prelude.String]
-- Upon a parse error, we want to suggest tokens that are expected in that
-- situation. This function computes such tokens.
-- It works by examining the top of the state stack.
-- For every token number that does a shift transition, record that token number.
-- For every token number that does a reduce transition, simulate that reduction
-- on the state state stack and repeat.
-- The recorded token numbers are then formatted with 'happyTokenToString' and
-- returned.
happyExpectedTokens :: Int# -> Happy_IntList -> [String]
happyExpectedTokens Int#
st Happy_IntList
sts =
  DEBUG_TRACE("constructing expected tokens.\n")
  (Int -> String) -> [Int] -> [String]
forall a b. (a -> b) -> [a] -> [b]
Happy_Prelude.map Int -> String
happyTokenToString (Int# -> Happy_IntList -> [Int] -> [Int]
search_shifts Int#
st Happy_IntList
sts [])
  where
    search_shifts :: Int# -> Happy_IntList -> [Int] -> [Int]
search_shifts Int#
st Happy_IntList
sts [Int]
shifts = ((Int, Int) -> [Int] -> [Int]) -> [Int] -> [(Int, Int)] -> [Int]
forall a b. (a -> b -> b) -> b -> [a] -> b
forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
Happy_Prelude.foldr (Int# -> Happy_IntList -> (Int, Int) -> [Int] -> [Int]
add_action Int#
st Happy_IntList
sts) [Int]
shifts (Int# -> [(Int, Int)]
distinct_actions Int#
st)
    add_action :: Int# -> Happy_IntList -> (Int, Int) -> [Int] -> [Int]
add_action Int#
st Happy_IntList
sts (Happy_GHC_Exts.I# Int#
i, Happy_GHC_Exts.I# Int#
act) [Int]
shifts =
      DEBUG_TRACE("found action in state " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# st) Happy_Prelude.++ ", input " Happy_Prelude.++ Happy_Prelude.show (Happy_GHC_Exts.I# i) Happy_Prelude.++ ", " Happy_Prelude.++ Happy_Prelude.show (happyDecodeAction act) Happy_Prelude.++ "\n")
      case Int# -> HappyAction
happyDecodeAction Int#
act of
        HappyAction
HappyFail     -> [Int]
shifts
        HappyAction
HappyAccept   -> [Int]
shifts -- This would always be %eof or error... Not helpful
        HappyShift Int#
_  -> Int -> [Int] -> [Int]
forall a. Ord a => a -> [a] -> [a]
Happy_Prelude.insert (Int# -> Int
Happy_GHC_Exts.I# Int#
i) [Int]
shifts
        HappyReduce Int#
r -> case Int# -> Int# -> Happy_IntList -> Happy_IntList
happySimulateReduce Int#
r Int#
st Happy_IntList
sts of
          (HappyCons Int#
st1 Happy_IntList
sts1) -> Int# -> Happy_IntList -> [Int] -> [Int]
search_shifts Int#
st1 Happy_IntList
sts1 [Int]
shifts
    distinct_actions :: Int# -> [(Int, Int)]
distinct_actions Int#
st
      -- The (token number, action) pairs of all actions in the given state
      = ((-Int
1), (Int# -> Int
Happy_GHC_Exts.I# (HappyAddr -> Int# -> Int#
happyIndexOffAddr HappyAddr
happyDefActions Int#
st)))
      (Int, Int) -> [(Int, Int)] -> [(Int, Int)]
forall a. a -> [a] -> [a]
: [ (Int
i, Int
act) | Int
i <- [Int
begin_i..Int
happy_n_terms], Int
act <- Int# -> Int -> [Int]
get_act Int#
row_off Int
i ]
      where
        row_off :: Int#
row_off = HappyAddr -> Int# -> Int#
happyIndexOffAddr HappyAddr
happyActOffsets Int#
st
        begin_i :: Int
begin_i = Int
2 -- +2: errorTok,catchTok
    get_act :: Int# -> Int -> [Int]
get_act Int#
off (Happy_GHC_Exts.I# Int#
i) -- happyIndexActionTable with cached row offset
      | let off_i :: Int#
off_i = PLUS(off,i)
      , GTE(off_i,0#)
      , EQ(happyIndexOffAddr happyCheck off_i,i)
      = [(Int# -> Int
Happy_GHC_Exts.I# (HappyAddr -> Int# -> Int#
happyIndexOffAddr HappyAddr
happyTable Int#
off_i))]
      | Bool
Happy_Prelude.otherwise
      = []

-- Internal happy errors:

notHappyAtAll :: a
notHappyAtAll :: forall a. a
notHappyAtAll = String -> a
forall a. HasCallStack => String -> a
Happy_Prelude.error String
"Internal Happy parser panic. This is not supposed to happen! Please open a bug report at https://github.com/haskell/happy/issues.\n"

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

happyTcHack :: Happy_Int -> a -> a
happyTcHack :: forall a. Int# -> a -> a
happyTcHack Int#
x a
y = a
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 :: forall a b. a -> b -> b
happyDoSeq   a
a b
b = a
a a -> b -> b
forall a b. a -> b -> b
`Happy_GHC_Exts.seq` b
b
happyDontSeq :: forall a b. a -> b -> b
happyDontSeq a
a b
b = 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.