{-# OPTIONS_GHC -w #-}
{-# OPTIONS -XMagicHash -XBangPatterns -XTypeSynonymInstances -XFlexibleInstances -cpp #-}
#if __GLASGOW_HASKELL__ >= 710
{-# OPTIONS_GHC -XPartialTypeSignatures #-}
#endif
{-# OPTIONS_GHC -fno-warn-incomplete-patterns -fno-warn-overlapping-patterns #-}
{-# LANGUAGE PatternSynonyms #-}
module Language.Rzk.Syntax.Par
( happyError
, myLexer
, pModule
, pListVarIdent
, pLanguageDecl
, pLanguage
, pCommand
, pListCommand
, pDeclUsedVars
, pSectionName
, pPattern
, pListPattern
, pParam
, pListParam
, pParamDecl
, pRestriction
, pListRestriction
, pTerm7
, pTerm5
, pTerm4
, pTerm3
, pTerm2
, pTerm1
, pTerm6
, pTerm
, pListTerm
) where
import Prelude
import qualified Language.Rzk.Syntax.Abs
import Language.Rzk.Syntax.Lex
import qualified Data.Array as Happy_Data_Array
import qualified Data.Bits as Bits
import qualified GHC.Exts as Happy_GHC_Exts
import Control.Applicative(Applicative(..))
import Control.Monad (ap)
newtype HappyAbsSyn = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
newtype HappyWrap27 = HappyWrap27 ((Language.Rzk.Syntax.Abs.BNFC'Position, String))
happyIn27 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, String)) -> (HappyAbsSyn )
happyIn27 :: (BNFC'Position, String) -> HappyAbsSyn
happyIn27 (BNFC'Position, String)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, String) -> HappyWrap27
HappyWrap27 (BNFC'Position, String)
x)
{-# INLINE happyIn27 #-}
happyOut27 :: (HappyAbsSyn ) -> HappyWrap27
happyOut27 :: HappyAbsSyn -> HappyWrap27
happyOut27 HappyAbsSyn
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut27 #-}
newtype HappyWrap28 = HappyWrap28 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.VarIdent))
happyIn28 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.VarIdent)) -> (HappyAbsSyn )
happyIn28 :: (BNFC'Position, VarIdent) -> HappyAbsSyn
happyIn28 (BNFC'Position, VarIdent)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, VarIdent) -> HappyWrap28
HappyWrap28 (BNFC'Position, VarIdent)
x)
{-# INLINE happyIn28 #-}
happyOut28 :: (HappyAbsSyn ) -> HappyWrap28
happyOut28 :: HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut28 #-}
newtype HappyWrap29 = HappyWrap29 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.HoleIdent))
happyIn29 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.HoleIdent)) -> (HappyAbsSyn )
happyIn29 :: (BNFC'Position, HoleIdent) -> HappyAbsSyn
happyIn29 (BNFC'Position, HoleIdent)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, HoleIdent) -> HappyWrap29
HappyWrap29 (BNFC'Position, HoleIdent)
x)
{-# INLINE happyIn29 #-}
happyOut29 :: (HappyAbsSyn ) -> HappyWrap29
happyOut29 :: HappyAbsSyn -> HappyWrap29
happyOut29 HappyAbsSyn
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut29 #-}
newtype HappyWrap30 = HappyWrap30 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Module))
happyIn30 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Module)) -> (HappyAbsSyn )
happyIn30 :: (BNFC'Position, Module) -> HappyAbsSyn
happyIn30 (BNFC'Position, Module)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Module) -> HappyWrap30
HappyWrap30 (BNFC'Position, Module)
x)
{-# INLINE happyIn30 #-}
happyOut30 :: (HappyAbsSyn ) -> HappyWrap30
happyOut30 :: HappyAbsSyn -> HappyWrap30
happyOut30 HappyAbsSyn
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut30 #-}
newtype HappyWrap31 = HappyWrap31 ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.VarIdent]))
happyIn31 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.VarIdent])) -> (HappyAbsSyn )
happyIn31 :: (BNFC'Position, [VarIdent]) -> HappyAbsSyn
happyIn31 (BNFC'Position, [VarIdent])
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [VarIdent]) -> HappyWrap31
HappyWrap31 (BNFC'Position, [VarIdent])
x)
{-# INLINE happyIn31 #-}
happyOut31 :: (HappyAbsSyn ) -> HappyWrap31
happyOut31 :: HappyAbsSyn -> HappyWrap31
happyOut31 HappyAbsSyn
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut31 #-}
newtype HappyWrap32 = HappyWrap32 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.LanguageDecl))
happyIn32 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.LanguageDecl)) -> (HappyAbsSyn )
happyIn32 :: (BNFC'Position, LanguageDecl) -> HappyAbsSyn
happyIn32 (BNFC'Position, LanguageDecl)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, LanguageDecl) -> HappyWrap32
HappyWrap32 (BNFC'Position, LanguageDecl)
x)
{-# INLINE happyIn32 #-}
happyOut32 :: (HappyAbsSyn ) -> HappyWrap32
happyOut32 :: HappyAbsSyn -> HappyWrap32
happyOut32 HappyAbsSyn
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut32 #-}
newtype HappyWrap33 = HappyWrap33 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Language))
happyIn33 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Language)) -> (HappyAbsSyn )
happyIn33 :: (BNFC'Position, Language) -> HappyAbsSyn
happyIn33 (BNFC'Position, Language)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Language) -> HappyWrap33
HappyWrap33 (BNFC'Position, Language)
x)
{-# INLINE happyIn33 #-}
happyOut33 :: (HappyAbsSyn ) -> HappyWrap33
happyOut33 :: HappyAbsSyn -> HappyWrap33
happyOut33 HappyAbsSyn
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut33 #-}
newtype HappyWrap34 = HappyWrap34 ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Command))
happyIn34 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Command)) -> (HappyAbsSyn )
happyIn34 :: (BNFC'Position, Command) -> HappyAbsSyn
happyIn34 (BNFC'Position, Command)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Command) -> HappyWrap34
HappyWrap34 (BNFC'Position, Command)
x)
{-# INLINE happyIn34 #-}
happyOut34 :: (HappyAbsSyn ) -> HappyWrap34
happyOut34 :: HappyAbsSyn -> HappyWrap34
happyOut34 HappyAbsSyn
x = unsafeCoerce# :: 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.Command]))
happyIn35 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Command])) -> (HappyAbsSyn )
happyIn35 :: (BNFC'Position, [Command]) -> HappyAbsSyn
happyIn35 (BNFC'Position, [Command])
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Command]) -> HappyWrap35
HappyWrap35 (BNFC'Position, [Command])
x)
{-# INLINE happyIn35 #-}
happyOut35 :: (HappyAbsSyn ) -> HappyWrap35
happyOut35 :: HappyAbsSyn -> HappyWrap35
happyOut35 HappyAbsSyn
x = unsafeCoerce# :: 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.DeclUsedVars))
happyIn36 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.DeclUsedVars)) -> (HappyAbsSyn )
happyIn36 :: (BNFC'Position, DeclUsedVars) -> HappyAbsSyn
happyIn36 (BNFC'Position, DeclUsedVars)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, DeclUsedVars) -> HappyWrap36
HappyWrap36 (BNFC'Position, DeclUsedVars)
x)
{-# INLINE happyIn36 #-}
happyOut36 :: (HappyAbsSyn ) -> HappyWrap36
happyOut36 :: HappyAbsSyn -> HappyWrap36
happyOut36 HappyAbsSyn
x = unsafeCoerce# :: 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.SectionName))
happyIn37 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.SectionName)) -> (HappyAbsSyn )
happyIn37 :: (BNFC'Position, SectionName) -> HappyAbsSyn
happyIn37 (BNFC'Position, SectionName)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, SectionName) -> HappyWrap37
HappyWrap37 (BNFC'Position, SectionName)
x)
{-# INLINE happyIn37 #-}
happyOut37 :: (HappyAbsSyn ) -> HappyWrap37
happyOut37 :: HappyAbsSyn -> HappyWrap37
happyOut37 HappyAbsSyn
x = unsafeCoerce# :: 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.Pattern))
happyIn38 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Pattern)) -> (HappyAbsSyn )
happyIn38 :: (BNFC'Position, Pattern) -> HappyAbsSyn
happyIn38 (BNFC'Position, Pattern)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Pattern) -> HappyWrap38
HappyWrap38 (BNFC'Position, Pattern)
x)
{-# INLINE happyIn38 #-}
happyOut38 :: (HappyAbsSyn ) -> HappyWrap38
happyOut38 :: HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
x = unsafeCoerce# :: 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.Pattern]))
happyIn39 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Pattern])) -> (HappyAbsSyn )
happyIn39 :: (BNFC'Position, [Pattern]) -> HappyAbsSyn
happyIn39 (BNFC'Position, [Pattern])
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Pattern]) -> HappyWrap39
HappyWrap39 (BNFC'Position, [Pattern])
x)
{-# INLINE happyIn39 #-}
happyOut39 :: (HappyAbsSyn ) -> HappyWrap39
happyOut39 :: HappyAbsSyn -> HappyWrap39
happyOut39 HappyAbsSyn
x = unsafeCoerce# :: 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.Param))
happyIn40 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Param)) -> (HappyAbsSyn )
happyIn40 :: (BNFC'Position, Param) -> HappyAbsSyn
happyIn40 (BNFC'Position, Param)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Param) -> HappyWrap40
HappyWrap40 (BNFC'Position, Param)
x)
{-# INLINE happyIn40 #-}
happyOut40 :: (HappyAbsSyn ) -> HappyWrap40
happyOut40 :: HappyAbsSyn -> HappyWrap40
happyOut40 HappyAbsSyn
x = unsafeCoerce# :: 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.Param]))
happyIn41 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Param])) -> (HappyAbsSyn )
happyIn41 :: (BNFC'Position, [Param]) -> HappyAbsSyn
happyIn41 (BNFC'Position, [Param])
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Param]) -> HappyWrap41
HappyWrap41 (BNFC'Position, [Param])
x)
{-# INLINE happyIn41 #-}
happyOut41 :: (HappyAbsSyn ) -> HappyWrap41
happyOut41 :: HappyAbsSyn -> HappyWrap41
happyOut41 HappyAbsSyn
x = unsafeCoerce# :: 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.ParamDecl))
happyIn42 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.ParamDecl)) -> (HappyAbsSyn )
happyIn42 :: (BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn42 (BNFC'Position, ParamDecl)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, ParamDecl) -> HappyWrap42
HappyWrap42 (BNFC'Position, ParamDecl)
x)
{-# INLINE happyIn42 #-}
happyOut42 :: (HappyAbsSyn ) -> HappyWrap42
happyOut42 :: HappyAbsSyn -> HappyWrap42
happyOut42 HappyAbsSyn
x = unsafeCoerce# :: 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.Restriction))
happyIn43 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Restriction)) -> (HappyAbsSyn )
happyIn43 :: (BNFC'Position, Restriction) -> HappyAbsSyn
happyIn43 (BNFC'Position, Restriction)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Restriction) -> HappyWrap43
HappyWrap43 (BNFC'Position, Restriction)
x)
{-# INLINE happyIn43 #-}
happyOut43 :: (HappyAbsSyn ) -> HappyWrap43
happyOut43 :: HappyAbsSyn -> HappyWrap43
happyOut43 HappyAbsSyn
x = unsafeCoerce# :: 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.Restriction]))
happyIn44 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Restriction])) -> (HappyAbsSyn )
happyIn44 :: (BNFC'Position, [Restriction]) -> HappyAbsSyn
happyIn44 (BNFC'Position, [Restriction])
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Restriction]) -> HappyWrap44
HappyWrap44 (BNFC'Position, [Restriction])
x)
{-# INLINE happyIn44 #-}
happyOut44 :: (HappyAbsSyn ) -> HappyWrap44
happyOut44 :: HappyAbsSyn -> HappyWrap44
happyOut44 HappyAbsSyn
x = unsafeCoerce# :: 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.Term))
happyIn45 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn45 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn45 (BNFC'Position, Term)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap45
HappyWrap45 (BNFC'Position, Term)
x)
{-# INLINE happyIn45 #-}
happyOut45 :: (HappyAbsSyn ) -> HappyWrap45
happyOut45 :: HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
x = unsafeCoerce# :: 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.Term))
happyIn46 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn46 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn46 (BNFC'Position, Term)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap46
HappyWrap46 (BNFC'Position, Term)
x)
{-# INLINE happyIn46 #-}
happyOut46 :: (HappyAbsSyn ) -> HappyWrap46
happyOut46 :: HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
x = unsafeCoerce# :: 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.Term))
happyIn47 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn47 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn47 (BNFC'Position, Term)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap47
HappyWrap47 (BNFC'Position, Term)
x)
{-# INLINE happyIn47 #-}
happyOut47 :: (HappyAbsSyn ) -> HappyWrap47
happyOut47 :: HappyAbsSyn -> HappyWrap47
happyOut47 HappyAbsSyn
x = unsafeCoerce# :: 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.Term))
happyIn48 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn48 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn48 (BNFC'Position, Term)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap48
HappyWrap48 (BNFC'Position, Term)
x)
{-# INLINE happyIn48 #-}
happyOut48 :: (HappyAbsSyn ) -> HappyWrap48
happyOut48 :: HappyAbsSyn -> HappyWrap48
happyOut48 HappyAbsSyn
x = unsafeCoerce# :: 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.Term))
happyIn49 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn49 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn49 (BNFC'Position, Term)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap49
HappyWrap49 (BNFC'Position, Term)
x)
{-# INLINE happyIn49 #-}
happyOut49 :: (HappyAbsSyn ) -> HappyWrap49
happyOut49 :: HappyAbsSyn -> HappyWrap49
happyOut49 HappyAbsSyn
x = unsafeCoerce# :: 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.Term))
happyIn50 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn50 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn50 (BNFC'Position, Term)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap50
HappyWrap50 (BNFC'Position, Term)
x)
{-# INLINE happyIn50 #-}
happyOut50 :: (HappyAbsSyn ) -> HappyWrap50
happyOut50 :: HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
x = unsafeCoerce# :: 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.Term))
happyIn51 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn51 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn51 (BNFC'Position, Term)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap51
HappyWrap51 (BNFC'Position, Term)
x)
{-# INLINE happyIn51 #-}
happyOut51 :: (HappyAbsSyn ) -> HappyWrap51
happyOut51 :: HappyAbsSyn -> HappyWrap51
happyOut51 HappyAbsSyn
x = unsafeCoerce# :: 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.Term))
happyIn52 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, Language.Rzk.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn52 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn52 (BNFC'Position, Term)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap52
HappyWrap52 (BNFC'Position, Term)
x)
{-# INLINE happyIn52 #-}
happyOut52 :: (HappyAbsSyn ) -> HappyWrap52
happyOut52 :: HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
x = unsafeCoerce# :: 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.Term]))
happyIn53 :: ((Language.Rzk.Syntax.Abs.BNFC'Position, [Language.Rzk.Syntax.Abs.Term])) -> (HappyAbsSyn )
happyIn53 :: (BNFC'Position, [Term]) -> HappyAbsSyn
happyIn53 (BNFC'Position, [Term])
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Term]) -> HappyWrap53
HappyWrap53 (BNFC'Position, [Term])
x)
{-# INLINE happyIn53 #-}
happyOut53 :: (HappyAbsSyn ) -> HappyWrap53
happyOut53 :: HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut53 #-}
happyInTok :: (Token) -> (HappyAbsSyn )
happyInTok :: Token -> HappyAbsSyn
happyInTok Token
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# Token
x
{-# INLINE happyInTok #-}
happyOutTok :: (HappyAbsSyn ) -> (Token)
happyOutTok :: HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOutTok #-}
happyExpList :: HappyAddr
happyExpList :: HappyAddr
happyExpList = Addr# -> HappyAddr
HappyA# Addr#
"\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\xe0\xcf\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe0\xcf\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\x20\x20\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\x20\x20\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xf0\x2b\x60\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xe0\x03\x60\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xf0\x0b\x60\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xf0\x0b\x60\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xf0\x0b\x60\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xf0\x0b\x60\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xf0\x0b\x60\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x28\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x50\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x7b\xe0\x03\x60\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf4\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xf0\x2b\x60\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\x20\x20\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xe0\x03\x60\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xe0\x03\x60\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x7b\xe0\x03\x60\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x50\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x7b\xe0\x03\x60\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x7b\xe0\x03\x60\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\x20\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe0\xcf\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe0\xcf\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x01\x00\x00\x04\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xf0\x0b\x60\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xf0\x0b\x60\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x20\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xf0\x0b\x60\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xf0\x0b\x60\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xf0\x0b\x60\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xf0\x0b\x60\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x81\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x7b\xe0\x03\x60\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x04\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x10\x80\x00\x00\x04\x20\x20\x00\x00\x00\x00\x00\x00\x00\x00\x10\x80\x00\x00\x04\x20\x20\x00\x00\x00\x00\x00\x00\x00\x00\x10\x80\x00\x00\x04\x20\x20\x00\x00\x00\x00\x00\x00\xe0\xcf\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\x3b\xf0\x0b\x60\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x01\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\x78\x04\xbf\xf0\x2b\x6a\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#
{-# NOINLINE happyExpListPerState #-}
happyExpListPerState :: Int -> [String]
happyExpListPerState Int
st =
[String]
token_strs_expected
where token_strs :: [String]
token_strs = [String
"error",String
"%dummy",String
"%start_pModule_internal",String
"%start_pListVarIdent_internal",String
"%start_pLanguageDecl_internal",String
"%start_pLanguage_internal",String
"%start_pCommand_internal",String
"%start_pListCommand_internal",String
"%start_pDeclUsedVars_internal",String
"%start_pSectionName_internal",String
"%start_pPattern_internal",String
"%start_pListPattern_internal",String
"%start_pParam_internal",String
"%start_pListParam_internal",String
"%start_pParamDecl_internal",String
"%start_pRestriction_internal",String
"%start_pListRestriction_internal",String
"%start_pTerm7_internal",String
"%start_pTerm5_internal",String
"%start_pTerm4_internal",String
"%start_pTerm3_internal",String
"%start_pTerm2_internal",String
"%start_pTerm1_internal",String
"%start_pTerm6_internal",String
"%start_pTerm_internal",String
"%start_pListTerm_internal",String
"String",String
"VarIdent",String
"HoleIdent",String
"Module",String
"ListVarIdent",String
"LanguageDecl",String
"Language",String
"Command",String
"ListCommand",String
"DeclUsedVars",String
"SectionName",String
"Pattern",String
"ListPattern",String
"Param",String
"ListParam",String
"ParamDecl",String
"Restriction",String
"ListRestriction",String
"Term7",String
"Term5",String
"Term4",String
"Term3",String
"Term2",String
"Term1",String
"Term6",String
"Term",String
"ListTerm",String
"'#assume'",String
"'#check'",String
"'#compute'",String
"'#compute-nf'",String
"'#compute-whnf'",String
"'#def'",String
"'#define'",String
"'#end'",String
"'#lang'",String
"'#postulate'",String
"'#section'",String
"'#set-option'",String
"'#unset-option'",String
"'#variable'",String
"'#variables'",String
"'('",String
"')'",String
"'*'",String
"'*_1'",String
"','",String
"'->'",String
"'/\\\\'",String
"'0_2'",String
"'1'",String
"'1_2'",String
"'2'",String
"':'",String
"':='",String
"';'",String
"'<'",String
"'<='",String
"'='",String
"'==='",String
"'=_{'",String
"'>'",String
"'BOT'",String
"'CUBE'",String
"'Sigma'",String
"'TOP'",String
"'TOPE'",String
"'U'",String
"'['",String
"'\\\\'",String
"'\\\\/'",String
"']'",String
"'_'",String
"'as'",String
"'first'",String
"'idJ'",String
"'recBOT'",String
"'recOR'",String
"'refl'",String
"'refl_{'",String
"'rzk-1'",String
"'second'",String
"'uses'",String
"'{'",String
"'|'",String
"'|->'",String
"'}'",String
"'\931'",String
"'\8594'",String
"'\8721'",String
"L_quoted",String
"L_VarIdent",String
"L_HoleIdent",String
"%eof"]
bit_start :: Int
bit_start = Int
st forall a. Num a => a -> a -> a
Prelude.* Int
120
bit_end :: Int
bit_end = (Int
st forall a. Num a => a -> a -> a
Prelude.+ Int
1) forall a. Num a => a -> a -> a
Prelude.* Int
120
read_bit :: Int -> Bool
read_bit = HappyAddr -> Int -> Bool
readArrayBit HappyAddr
happyExpList
bits :: [Bool]
bits = forall a b. (a -> b) -> [a] -> [b]
Prelude.map Int -> Bool
read_bit [Int
bit_start..Int
bit_end forall a. Num a => a -> a -> a
Prelude.- Int
1]
bits_indexed :: [(Bool, Int)]
bits_indexed = forall a b. [a] -> [b] -> [(a, b)]
Prelude.zip [Bool]
bits [Int
0..Int
119]
token_strs_expected :: [String]
token_strs_expected = forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
Prelude.concatMap (Bool, Int) -> [String]
f [(Bool, Int)]
bits_indexed
f :: (Bool, Int) -> [String]
f (Bool
Prelude.False, Int
_) = []
f (Bool
Prelude.True, Int
nr) = [[String]
token_strs forall a. [a] -> Int -> a
Prelude.!! Int
nr]
happyActOffsets :: HappyAddr
happyActOffsets :: HappyAddr
happyActOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\xfa\xff\xd1\xff\x0a\x00\x60\x00\x26\x05\x26\x05\x6a\x00\x59\x00\x27\x00\x27\x00\x53\x00\x53\x00\x77\x00\x47\x00\x47\x00\x4b\x01\xff\x00\xff\x00\xff\x00\xff\x00\x47\x00\xff\x00\x47\x00\x47\x00\x66\x00\x00\x00\x00\x00\x00\x00\xed\xff\x00\x00\x52\x00\x97\x00\x9e\x00\x3b\x00\x00\x00\xa7\x00\xa0\x00\x8f\x00\x17\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd3\x00\x00\x00\x00\x00\xee\x00\x00\x00\x00\x00\x00\x00\x53\x00\x4b\x01\x01\x01\x00\x00\x0c\x01\x00\x00\x47\x00\x4b\x01\x34\x00\x12\x01\x15\x01\x00\x00\x00\x00\xbf\x00\xf1\xff\x47\x00\x31\x00\xbf\x00\xbf\x00\x25\x01\xbf\x00\xbf\x00\xf3\xff\xbf\x00\x30\x01\xf6\x00\x19\x01\x1c\x01\x1c\x01\x25\x01\x00\x00\x00\x00\x53\x00\x1c\x01\x57\x00\x00\x00\x57\x00\x1c\x01\x57\x00\x1c\x01\x57\x00\x1c\x01\x00\x00\x1c\x01\x1c\x01\x5a\x01\x58\x01\x44\x01\x7a\x01\x47\x00\x47\x00\x47\x00\x47\x00\x7a\x01\x7a\x01\x7a\x01\x7a\x01\x5b\x01\x5b\x01\x7b\x01\x7b\x01\x74\x01\x74\x01\x00\x00\x74\x01\x83\x01\x7c\x01\x77\x01\x77\x01\x26\x05\x00\x00\x00\x00\xa1\x01\xa4\x01\xc0\x01\x00\x00\xbc\x01\xc1\x01\xa5\x01\xa5\x01\xa5\x01\x00\x00\x00\x00\x00\x00\xc4\x01\xc5\x01\x26\x05\xa0\x01\xce\x01\x00\x00\xc8\x01\x0c\x00\xcb\x01\x00\x00\x00\x00\x47\x00\x47\x00\x47\x00\xff\x00\xff\x00\x47\x00\x18\x00\x57\x00\x57\x00\xd9\x01\x57\x00\x00\x00\xec\xff\x47\x00\x47\x00\x00\x00\xea\x01\x57\x00\xeb\x01\xe6\x01\xe7\x01\x47\x00\x47\x00\xff\x00\xff\x00\xff\x00\xff\x00\x47\x00\x47\x00\x00\x00\x00\x00\xf1\x01\xf1\x01\x00\x00\x00\x00\x00\x00\x00\x00\x47\x00\x47\x00\x47\x00\xe9\x01\x47\x00\xf2\x01\xf4\x01\xf2\xff\x47\x00\x00\x00\x62\x00\x47\x00\xec\x01\xef\x01\x00\x00\x47\x00\xd0\x01\x00\x00\x25\x01\x00\x00\x00\x00\xe0\x01\x47\x00\x57\x00\x47\x00\x10\x02\x00\x00\x47\x00\x47\x00\x64\x00\x94\x00\x27\x01\x26\x05\xe4\x01\x47\x00\x47\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1e\x02\x0c\x02\x47\x00\x20\x02\x47\x00\x23\x02\x47\x00\x00\x00\x00\x00\x00\x00\x06\x02\x44\x02\x47\x02\x00\x00\xff\x00\x49\x02\x47\x00\x47\x00\x0b\x01\x47\x00\x05\x02\x47\x00\x00\x00\x47\x00\x00\x00\x47\x00\x38\x02\x5e\x02\x61\x02\x00\x00\x00\x00\x00\x00\x63\x02\x75\x02\x78\x02\x00\x00\x7d\x02\x47\x00\x00\x00\x92\x02\x95\x02\x00\x00\x00\x00\x00\x00\x00\x00\x47\x00\x59\x02\x47\x00\x73\x02\x47\x00\x00\x00\x47\x00\x67\x02\x00\x00\x00\x00\x8d\x02\x47\x00\xa1\x02\x47\x00\x84\x02\xae\x02\xaf\x02\x9b\x02\xa0\x02\x47\x00\x47\x00\xc8\x02\x47\x00\xc9\x02\xdd\x02\x47\x00\x00\x00\x47\x00\x47\x00\x00\x00\x00\x00\x47\x00\x00\x00\x47\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb8\x02\x47\x00\x47\x00\x00\x00\xe2\x02\xfa\x02\x00\x00\x00\x00\x47\x00\xe3\x02\x47\x00\xfd\x02\x00\x00\x00\x00"#
happyGotoOffsets :: HappyAddr
happyGotoOffsets :: HappyAddr
happyGotoOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\x88\x00\x65\x00\x0c\x03\x0a\x03\x1e\x03\xd9\x00\x1f\x03\x0d\x00\x38\x00\x13\x00\x96\x00\xf2\x00\x39\x01\xe3\x01\x9b\x01\x0b\x00\xb1\x00\xdc\x00\x76\x01\xd0\x04\x6c\x04\x81\x00\xfc\x01\x80\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0f\x00\x00\x00\x00\x00\x07\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\xb4\x00\x00\x00\x00\x00\x00\x00\x00\x00\x16\x02\xd2\x00\x51\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd5\x00\x21\x02\x00\x00\x00\x00\x00\x00\xd5\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd5\x00\x00\x00\x00\x00\x1e\x01\x00\x00\xbc\x00\x00\x00\xb0\x00\x00\x00\x0f\x01\x00\x00\x08\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xde\x00\x30\x02\x3b\x02\x4a\x02\x55\x02\x29\x03\x2a\x03\x3e\x03\x37\x00\x42\x03\x44\x03\x58\x03\xf1\x00\x00\x00\x00\x00\x00\x00\x00\x00\x56\x03\xf5\x00\x00\x00\x00\x00\x26\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x3c\x03\x55\x03\x6a\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x55\x01\x1d\x01\x00\x00\x00\x00\x00\x00\x0f\x01\x00\x00\x00\x00\x00\x00\xb4\x01\x64\x02\xbf\x01\xde\x04\xd9\x04\x6f\x02\x00\x00\x1f\x01\x6b\x01\x00\x00\x70\x01\x00\x00\x00\x00\xd8\x01\x7e\x02\x00\x00\x00\x00\x79\x01\x00\x00\x00\x00\x00\x00\x8f\x01\x76\x04\xe8\x04\x00\x05\x0c\x05\x0e\x05\x85\x04\x8f\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x89\x02\x98\x02\xa3\x02\x00\x00\x9e\x04\x00\x00\x00\x00\x00\x00\xb2\x02\x00\x00\x00\x00\xbd\x02\x00\x00\x00\x00\x00\x00\xcc\x02\x00\x00\x00\x00\xd5\x00\x00\x00\x00\x00\x00\x00\xd7\x02\xb7\x01\xe6\x02\x00\x00\x00\x00\xf1\x02\x00\x03\x45\x01\x60\x01\x78\x01\x98\x01\x5f\x03\x0b\x03\x1a\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x25\x03\x00\x00\x34\x03\x00\x00\x3f\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf1\x04\x00\x00\x4e\x03\x59\x03\x00\x00\x68\x03\x00\x00\x73\x03\x00\x00\x82\x03\x00\x00\x8d\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x9c\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa7\x03\x00\x00\xb6\x03\x00\x00\xc1\x03\x00\x00\xd0\x03\x45\x00\x00\x00\x00\x00\x00\x00\xdb\x03\x00\x00\xea\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf5\x03\x04\x04\x00\x00\xa8\x04\x00\x00\x00\x00\x0f\x04\x00\x00\xb7\x04\xc1\x04\x00\x00\x00\x00\x1e\x04\x00\x00\x29\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x38\x04\x43\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x04\x00\x00\x5d\x04\x00\x00\x00\x00\x00\x00"#
happyAdjustOffset :: Happy_GHC_Exts.Int# -> Happy_GHC_Exts.Int#
happyAdjustOffset :: Int# -> Int#
happyAdjustOffset Int#
off = Int#
off
happyDefActions :: HappyAddr
happyDefActions :: HappyAddr
happyDefActions = Addr# -> HappyAddr
HappyA# Addr#
"\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xcf\xff\xcc\xff\xcb\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\xe7\xff\xa2\xff\xa3\xff\x00\x00\x8a\xff\x9c\xff\x9a\xff\x98\xff\x92\xff\x88\xff\x9f\xff\x87\xff\x00\x00\x00\x00\xb2\xff\xb0\xff\xb3\xff\xaf\xff\xb1\xff\x00\x00\xad\xff\xb5\xff\x00\x00\xae\xff\xb4\xff\xb6\xff\x00\x00\x00\x00\x00\x00\xac\xff\x00\x00\xa7\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe6\xff\xe5\xff\x00\x00\x00\x00\x00\x00\x92\xff\x00\x00\x00\x00\x9f\xff\x00\x00\x00\x00\x00\x00\x00\x00\xb8\xff\x00\x00\x00\x00\x00\x00\x00\x00\xbf\xff\xc8\xff\xc4\xff\xc1\xff\x00\x00\x00\x00\xc9\xff\x00\x00\x00\x00\xc6\xff\x00\x00\x00\x00\x00\x00\xca\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\xcb\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe0\xff\x00\x00\x00\x00\xe3\xff\x00\x00\x00\x00\xcf\xff\xe4\xff\xe2\xff\x00\x00\x00\x00\x00\x00\xde\xff\x00\x00\x00\x00\xcc\xff\xcc\xff\xcc\xff\xdb\xff\xda\xff\xdc\xff\x00\x00\x00\x00\xcf\xff\x00\x00\x00\x00\xc5\xff\x00\x00\xc6\xff\x00\x00\xc0\xff\x8d\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x8b\xff\x00\x00\x00\x00\x00\x00\x8c\xff\x00\x00\x00\x00\x00\x00\xa2\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x91\xff\x97\xff\x9e\xff\x9d\xff\x9b\xff\x99\xff\x89\xff\x86\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa6\xff\x00\x00\x00\x00\x00\x00\x00\x00\xa1\xff\x00\x00\x00\x00\x94\xff\xa0\xff\xb7\xff\xb9\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xce\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xcf\xff\x00\x00\x00\x00\x00\x00\xe1\xff\xd5\xff\xd6\xff\xdf\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xdd\xff\xd7\xff\xcd\xff\x00\x00\x00\x00\x00\x00\x8e\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xab\xff\x00\x00\x93\xff\x00\x00\x00\x00\x00\x00\x00\x00\xbe\xff\xbc\xff\xa9\xff\x00\x00\x00\x00\x00\x00\xa5\xff\x00\x00\x00\x00\xbd\xff\x00\x00\x00\x00\xa8\xff\x95\xff\xc3\xff\xc7\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd8\xff\x00\x00\xcb\xff\xd4\xff\xd9\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\xba\xff\x00\x00\x00\x00\xc2\xff\xd0\xff\x00\x00\xd2\xff\x00\x00\xd3\xff\xd1\xff\x8f\xff\x90\xff\x00\x00\x00\x00\x00\x00\x96\xff\x00\x00\x00\x00\xbb\xff\xaa\xff\x00\x00\x00\x00\x00\x00\x00\x00\xa4\xff"#
happyCheck :: HappyAddr
happyCheck :: HappyAddr
happyCheck = Addr# -> HappyAddr
HappyA# Addr#
"\xff\xff\x10\x00\x15\x00\x09\x00\x13\x00\x12\x00\x14\x00\x1b\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x01\x00\x02\x00\x01\x00\x1e\x00\x01\x00\x02\x00\x41\x00\x09\x00\x01\x00\x24\x00\x25\x00\x0a\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x10\x00\x12\x00\x0b\x00\x0c\x00\x14\x00\x12\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x10\x00\x3c\x00\x11\x00\x13\x00\x3e\x00\x14\x00\x3b\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x41\x00\x42\x00\x43\x00\x1e\x00\x43\x00\x10\x00\x01\x00\x01\x00\x2e\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x0a\x00\x2b\x00\x0b\x00\x10\x00\x2e\x00\x01\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x41\x00\x37\x00\x0a\x00\x39\x00\x20\x00\x01\x00\x22\x00\x3d\x00\x2e\x00\x3f\x00\x10\x00\x41\x00\x42\x00\x13\x00\x20\x00\x0b\x00\x22\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x2e\x00\x10\x00\x12\x00\x1e\x00\x01\x00\x10\x00\x41\x00\x04\x00\x2f\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x1f\x00\x2b\x00\x21\x00\x10\x00\x41\x00\x14\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x1b\x00\x37\x00\x1b\x00\x39\x00\x2e\x00\x01\x00\x02\x00\x3d\x00\x2e\x00\x3f\x00\x10\x00\x41\x00\x42\x00\x13\x00\x03\x00\x39\x00\x05\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x2e\x00\x12\x00\x41\x00\x1e\x00\x36\x00\x01\x00\x41\x00\x18\x00\x41\x00\x24\x00\x25\x00\x39\x00\x27\x00\x28\x00\x29\x00\x0b\x00\x38\x00\x0d\x00\x10\x00\x41\x00\x40\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x16\x00\x37\x00\x1b\x00\x39\x00\x01\x00\x01\x00\x02\x00\x14\x00\x01\x00\x02\x00\x10\x00\x41\x00\x42\x00\x13\x00\x0b\x00\x15\x00\x01\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x2e\x00\x12\x00\x13\x00\x1e\x00\x12\x00\x0b\x00\x0c\x00\x18\x00\x2c\x00\x24\x00\x25\x00\x39\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x43\x00\x01\x00\x02\x00\x41\x00\x01\x00\x02\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x01\x00\x02\x00\x01\x00\x07\x00\x08\x00\x04\x00\x10\x00\x12\x00\x3e\x00\x13\x00\x12\x00\x41\x00\x42\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x12\x00\x13\x00\x14\x00\x1e\x00\x01\x00\x01\x00\x18\x00\x04\x00\x01\x00\x24\x00\x25\x00\x04\x00\x27\x00\x28\x00\x29\x00\x0b\x00\x10\x00\x0d\x00\x0e\x00\x01\x00\x43\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x01\x00\x37\x00\x0b\x00\x39\x00\x0d\x00\x0e\x00\x10\x00\x01\x00\x10\x00\x13\x00\x0b\x00\x41\x00\x42\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x0b\x00\x0c\x00\x10\x00\x1e\x00\x01\x00\x01\x00\x01\x00\x04\x00\x10\x00\x24\x00\x25\x00\x10\x00\x27\x00\x28\x00\x29\x00\x0b\x00\x0b\x00\x0d\x00\x0e\x00\x07\x00\x08\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x10\x00\x37\x00\x10\x00\x13\x00\x43\x00\x01\x00\x02\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x41\x00\x42\x00\x1b\x00\x1e\x00\x14\x00\x3a\x00\x01\x00\x3c\x00\x0f\x00\x24\x00\x25\x00\x12\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x0b\x00\x18\x00\x0d\x00\x0e\x00\x3b\x00\x2e\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x10\x00\x07\x00\x08\x00\x13\x00\x43\x00\x39\x00\x01\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x41\x00\x42\x00\x41\x00\x1e\x00\x10\x00\x0b\x00\x01\x00\x0d\x00\x0e\x00\x24\x00\x25\x00\x01\x00\x27\x00\x28\x00\x29\x00\x1d\x00\x0b\x00\x01\x00\x02\x00\x01\x00\x01\x00\x0b\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x01\x00\x02\x00\x0b\x00\x0b\x00\x0d\x00\x0e\x00\x43\x00\x12\x00\x13\x00\x14\x00\x15\x00\x41\x00\x42\x00\x18\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x40\x00\x01\x00\x02\x00\x0f\x00\x07\x00\x08\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x01\x00\x02\x00\x43\x00\x01\x00\x36\x00\x43\x00\x41\x00\x41\x00\x41\x00\x1d\x00\x1b\x00\x01\x00\x02\x00\x0b\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x01\x00\x02\x00\x1b\x00\x20\x00\x38\x00\x1d\x00\x1b\x00\x1b\x00\x41\x00\x14\x00\x1b\x00\x01\x00\x02\x00\x1b\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x10\x00\x1b\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x01\x00\x02\x00\x15\x00\x15\x00\x1b\x00\x1b\x00\x12\x00\x1b\x00\x11\x00\x14\x00\x1b\x00\x01\x00\x02\x00\x1b\x00\x0f\x00\x3c\x00\x2d\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x11\x00\x01\x00\x02\x00\x40\x00\x0f\x00\x08\x00\x1b\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1b\x00\x01\x00\x02\x00\x1b\x00\x0f\x00\x3a\x00\x3c\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x11\x00\x01\x00\x02\x00\x11\x00\x0f\x00\x11\x00\x23\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x11\x00\x01\x00\x02\x00\x11\x00\x0f\x00\x11\x00\x1c\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x14\x00\x01\x00\x02\x00\x14\x00\x0f\x00\x11\x00\x1c\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x11\x00\x01\x00\x02\x00\x11\x00\x0f\x00\x41\x00\x1c\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1c\x00\x01\x00\x02\x00\x3c\x00\x0f\x00\x14\x00\x14\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x3c\x00\x01\x00\x02\x00\x3a\x00\x0f\x00\x14\x00\x14\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x14\x00\x01\x00\x02\x00\x3c\x00\x0f\x00\x14\x00\x14\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x11\x00\x01\x00\x02\x00\x11\x00\x0f\x00\x06\x00\x05\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x07\x00\x01\x00\x02\x00\x09\x00\x0f\x00\x01\x00\x01\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x01\x00\x01\x00\x02\x00\x00\x00\x0f\x00\x00\x00\x09\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x01\x00\x01\x00\x02\x00\x06\x00\x0f\x00\x09\x00\x00\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x09\x00\x01\x00\x02\x00\xff\xff\x0f\x00\xff\xff\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\xff\xff\x01\x00\x02\x00\xff\xff\x0f\x00\xff\xff\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\xff\xff\x01\x00\x02\x00\xff\xff\x0f\x00\xff\xff\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\xff\xff\x01\x00\x02\x00\xff\xff\x0f\x00\xff\xff\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\xff\xff\x01\x00\x02\x00\xff\xff\x0f\x00\xff\xff\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\xff\xff\x01\x00\x02\x00\xff\xff\x0f\x00\xff\xff\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\xff\xff\x01\x00\x02\x00\xff\xff\x0f\x00\xff\xff\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\xff\xff\x01\x00\x02\x00\xff\xff\x0f\x00\xff\xff\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\xff\xff\x01\x00\x02\x00\xff\xff\x0f\x00\xff\xff\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\xff\xff\x01\x00\x02\x00\xff\xff\x0f\x00\xff\xff\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x01\x00\x02\x00\xff\xff\xff\xff\x0f\x00\xff\xff\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\xff\xff\x01\x00\x02\x00\xff\xff\xff\xff\x0f\x00\xff\xff\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\xff\xff\x01\x00\x02\x00\xff\xff\xff\xff\x0f\x00\xff\xff\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\xff\xff\x01\x00\x02\x00\xff\xff\xff\xff\x0f\x00\xff\xff\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x0f\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x01\x00\x02\x00\xff\xff\xff\xff\xff\xff\x01\x00\x02\x00\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\xff\xff\x18\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x12\x00\x18\x00\x01\x00\x02\x00\xff\xff\xff\xff\x18\x00\xff\xff\xff\xff\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\xff\xff\x18\x00\x01\x00\x02\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\xff\xff\x18\x00\xff\xff\x01\x00\x02\x00\x01\x00\x02\x00\x01\x00\x02\x00\xff\xff\x12\x00\x13\x00\x14\x00\x15\x00\xff\xff\xff\xff\x18\x00\x0f\x00\xff\xff\xff\xff\x12\x00\xff\xff\x12\x00\x13\x00\x12\x00\x13\x00\x18\x00\xff\xff\x18\x00\xff\xff\x18\x00\x01\x00\x02\x00\x03\x00\x04\x00\x05\x00\x06\x00\x07\x00\xff\xff\xff\xff\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\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"#
happyTable :: HappyAddr
happyTable :: HappyAddr
happyTable = Addr# -> HappyAddr
HappyA# Addr#
"\x00\x00\x43\x00\xae\x00\x75\x00\x28\x00\x96\x00\xf5\x00\xc0\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x1a\x00\x1b\x00\x5d\x00\x2d\x00\x1a\x00\x1b\x00\x3f\x00\x75\x00\x51\x00\x2e\x00\x2f\x00\x5e\x00\x31\x00\x32\x00\x33\x00\x93\x00\x5c\x00\x4a\x00\x59\x00\x5a\x00\xcf\x00\x91\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x27\x00\xc1\x00\xc6\x00\x28\x00\xaf\x00\xc7\x00\x94\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x3f\x00\x40\x00\xff\xff\x2d\x00\xff\xff\x5c\x00\x5d\x00\x51\x00\x57\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x80\x00\x34\x00\x5c\x00\x9d\x00\xa7\x00\x5d\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3f\x00\x3b\x00\x14\x01\x3c\x00\x97\x00\x51\x00\x98\x00\x3d\x00\x57\x00\x3e\x00\x27\x00\x3f\x00\x40\x00\x28\x00\x97\x00\x9b\x00\x98\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x57\x00\x56\x00\x96\x00\x2d\x00\x75\x00\x5c\x00\x3f\x00\x76\x00\xa9\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\xac\x00\x34\x00\xad\x00\x56\x00\x3f\x00\xcf\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\xf3\x00\x3b\x00\xe6\x00\x3c\x00\x57\x00\x1a\x00\x1b\x00\x3d\x00\x57\x00\x3e\x00\x27\x00\x3f\x00\x40\x00\x28\x00\x77\x00\x58\x00\x78\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x57\x00\x1d\x00\x3f\x00\x2d\x00\x73\x00\x51\x00\x3f\x00\x41\x00\x3f\x00\x2e\x00\x2f\x00\x58\x00\x31\x00\x32\x00\x33\x00\x52\x00\x61\x00\x58\x00\x56\x00\x3f\x00\x1a\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\xab\x00\x3b\x00\xe4\x00\x3c\x00\x51\x00\x1a\x00\x1b\x00\xa8\x00\x1a\x00\x1b\x00\x43\x00\x3f\x00\x40\x00\x28\x00\x8d\x00\xbf\xff\x51\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x57\x00\x1d\x00\x49\x00\x2d\x00\xa1\x00\x8e\x00\x8f\x00\x46\x00\xaa\x00\x2e\x00\x2f\x00\x58\x00\x31\x00\x32\x00\x33\x00\x93\x00\xff\xff\x1a\x00\x1b\x00\x3f\x00\x1a\x00\x1b\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x1a\x00\x1b\x00\x75\x00\x61\x00\x62\x00\x88\x00\x27\x00\x9d\x00\xbf\xff\x28\x00\x91\x00\x3f\x00\x40\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x1d\x00\x1e\x00\x48\x00\x2d\x00\x75\x00\x51\x00\x46\x00\x7c\x00\x75\x00\x2e\x00\x2f\x00\x7a\x00\x31\x00\x32\x00\x33\x00\x52\x00\xa4\x00\x53\x00\x54\x00\x51\x00\xff\xff\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x51\x00\x3b\x00\x52\x00\x3c\x00\x53\x00\xa2\x00\x43\x00\x51\x00\xa1\x00\x28\x00\x8b\x00\x3f\x00\x40\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x59\x00\x8c\x00\xa0\x00\x2d\x00\x75\x00\x51\x00\x51\x00\xd0\x00\x9b\x00\x2e\x00\x2f\x00\x9a\x00\x31\x00\x32\x00\x33\x00\x52\x00\xc4\x00\x53\x00\x90\x00\x61\x00\x79\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x43\x00\x3b\x00\x56\x00\x28\x00\xff\xff\x1a\x00\x1b\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x3f\x00\x40\x00\xe2\x00\x2d\x00\x95\x00\x05\x01\x51\x00\x06\x01\x4f\x00\x2e\x00\x2f\x00\x1d\x00\x31\x00\x32\x00\x33\x00\x93\x00\x52\x00\x50\x00\x53\x00\xe4\x00\x94\x00\x57\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x43\x00\x61\x00\xd1\x00\x28\x00\xff\xff\x58\x00\x51\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x3f\x00\x40\x00\x3f\x00\x2d\x00\x8b\x00\x52\x00\x51\x00\x53\x00\xe2\x00\x2e\x00\x2f\x00\x51\x00\x31\x00\x32\x00\x33\x00\x8a\x00\xc3\x00\x1a\x00\x1b\x00\x51\x00\x51\x00\xc1\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x1a\x00\x1b\x00\x52\x00\xba\x00\x53\x00\xe0\x00\xff\xff\x1d\x00\x1e\x00\x1f\x00\x47\x00\x3f\x00\x40\x00\x46\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x1a\x00\x1a\x00\x1b\x00\x1c\x00\x61\x00\xdf\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\xb6\x00\x1c\x00\x4b\x00\x4c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x4d\x00\x1a\x00\x1b\x00\xff\xff\x51\x00\x73\x00\xff\xff\x3f\x00\x3f\x00\x3f\x00\xdc\x00\xdb\x00\x1a\x00\x1b\x00\xea\x00\x1c\x00\x4b\x00\xcc\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x4d\x00\x1c\x00\x4b\x00\xca\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x4d\x00\x1a\x00\x1b\x00\xda\x00\xd9\x00\x61\x00\xd8\x00\xd4\x00\xd3\x00\x3f\x00\xcf\x00\xd0\x00\x1a\x00\x1b\x00\xce\x00\x1c\x00\x4b\x00\xbd\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xbe\x00\x1c\x00\x4e\x00\xc3\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x4d\x00\x1a\x00\x1b\x00\xbc\x00\xba\x00\xb9\x00\xb8\x00\x96\x00\xf9\x00\xf6\x00\xf7\x00\xf1\x00\xa5\x00\x1b\x00\xf0\x00\x1c\x00\xee\x00\xed\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x40\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x98\x00\xe9\x00\x1a\x00\x1b\x00\x1a\x00\x1c\x00\x14\x01\x13\x01\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x9e\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x98\x00\x11\x01\x1a\x00\x1b\x00\x0f\x01\x1c\x00\x0d\x01\x03\x01\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x87\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x86\x00\x0c\x01\x1a\x00\x1b\x00\x0b\x01\x1c\x00\x09\x01\xff\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x85\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x84\x00\xfe\x00\x1a\x00\x1b\x00\xfd\x00\x1c\x00\x22\x01\x1a\x01\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xcb\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xc7\x00\x21\x01\x1a\x00\x1b\x00\x20\x01\x1c\x00\x1f\x01\x18\x01\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xbc\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xfb\x00\x1d\x01\x1a\x00\x1b\x00\x1c\x01\x1c\x00\x3f\x00\x2e\x01\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xfa\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xf9\x00\x2c\x01\x1a\x00\x1b\x00\x2a\x01\x1c\x00\x29\x01\x28\x01\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xf3\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xf1\x00\x27\x01\x1a\x00\x1b\x00\x26\x01\x1c\x00\x23\x01\x35\x01\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xee\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xeb\x00\x34\x01\x1a\x00\x1b\x00\x39\x01\x1c\x00\x3b\x01\x3d\x01\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xe9\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xe7\x00\x3a\x01\x1a\x00\x1b\x00\x3f\x01\x1c\x00\x71\x00\x73\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xe6\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xdd\x00\x70\x00\x1a\x00\x1b\x00\x5f\x00\x1c\x00\x83\x00\x82\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xdc\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x11\x01\x81\x00\x1a\x00\x1b\x00\x7f\x00\x1c\x00\x7e\x00\xd6\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x0f\x01\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x0d\x01\x7d\x00\x1a\x00\x1b\x00\x7b\x00\x1c\x00\xd5\x00\xde\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x07\x01\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x06\x01\xd4\x00\x1a\x00\x1b\x00\x00\x00\x1c\x00\x00\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x03\x01\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x01\x01\x00\x00\x1a\x00\x1b\x00\x00\x00\x1c\x00\x00\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x00\x01\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xff\x00\x00\x00\x1a\x00\x1b\x00\x00\x00\x1c\x00\x00\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x1d\x01\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x1a\x01\x00\x00\x1a\x00\x1b\x00\x00\x00\x1c\x00\x00\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x18\x01\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x16\x01\x00\x00\x1a\x00\x1b\x00\x00\x00\x1c\x00\x00\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x15\x01\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x2c\x01\x00\x00\x1a\x00\x1b\x00\x00\x00\x1c\x00\x00\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x2a\x01\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x01\x00\x00\x1a\x00\x1b\x00\x00\x00\x1c\x00\x00\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x23\x01\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x32\x01\x00\x00\x1a\x00\x1b\x00\x00\x00\x1c\x00\x00\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x2f\x01\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x2e\x01\x00\x00\x1a\x00\x1b\x00\x00\x00\x1c\x00\x00\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x37\x01\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x36\x01\x00\x00\x1a\x00\x1b\x00\x00\x00\x1c\x00\x00\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x3b\x01\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x3d\x01\x1a\x00\x1b\x00\x00\x00\x00\x00\x1c\x00\x00\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x43\x00\x44\x00\x23\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x43\x00\xb5\x00\x23\x00\x00\x00\x1a\x00\x1b\x00\x00\x00\x00\x00\x1c\x00\x00\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x43\x00\xb0\x00\x23\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x43\x00\xaf\x00\x23\x00\x00\x00\x1a\x00\x1b\x00\x00\x00\x00\x00\x1c\x00\x00\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x43\x00\xf7\x00\x23\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x43\x00\x35\x01\x23\x00\x00\x00\x1a\x00\x1b\x00\x00\x00\x00\x00\x1c\x00\x00\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x43\x00\x31\x01\x23\x00\x1c\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x43\x00\x30\x01\x23\x00\x1a\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x1a\x00\x1b\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x45\x00\x00\x00\x46\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\xc8\x00\x1d\x00\x46\x00\x1a\x00\x1b\x00\x00\x00\x00\x00\xc9\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\xb4\x00\x00\x00\x46\x00\x1a\x00\x1b\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x09\x01\x00\x00\x46\x00\x00\x00\x1a\x00\x1b\x00\x1a\x00\x1b\x00\x1a\x00\x1b\x00\x00\x00\x1d\x00\x1e\x00\x1f\x00\xb3\x00\x00\x00\x00\x00\x46\x00\xa4\x00\x00\x00\x00\x00\x1d\x00\x00\x00\x1d\x00\xb2\x00\x1d\x00\xb1\x00\x50\x00\x00\x00\x46\x00\x00\x00\x46\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x00\x00\x00\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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 = forall i e. Ix i => (i, i) -> [(i, e)] -> Array i e
Happy_Data_Array.array (Int
24, Int
121) [
(Int
24 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_24),
(Int
25 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_25),
(Int
26 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_26),
(Int
27 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_27),
(Int
28 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_28),
(Int
29 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_29),
(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)
]
happy_n_terms :: Int
happy_n_terms = Int
68 :: Prelude.Int
happy_n_nonterms :: Int
happy_n_nonterms = Int
27 :: Prelude.Int
happyReduce_24 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_24 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
0# HappyAbsSyn -> HappyAbsSyn
happyReduction_24
happyReduction_24 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_24 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
(BNFC'Position, String) -> HappyAbsSyn
happyIn27
((forall a b c. (a -> 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_25 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_25 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
1# HappyAbsSyn -> HappyAbsSyn
happyReduction_25
happyReduction_25 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_25 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
(BNFC'Position, VarIdent) -> HappyAbsSyn
happyIn28
((forall a b c. (a -> 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 -> VarIdent
Language.Rzk.Syntax.Abs.VarIdent (Token -> String
tokenText Token
happy_var_1))
)}
happyReduce_26 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_26 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
2# HappyAbsSyn -> HappyAbsSyn
happyReduction_26
happyReduction_26 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_26 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
(BNFC'Position, HoleIdent) -> HappyAbsSyn
happyIn29
((forall a b c. (a -> 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 -> HoleIdent
Language.Rzk.Syntax.Abs.HoleIdent (Token -> String
tokenText Token
happy_var_1))
)}
happyReduce_27 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_27 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2 Int#
3# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_27
happyReduction_27 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_27 HappyAbsSyn
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap32
happyOut32 HappyAbsSyn
happy_x_1 of { (HappyWrap32 (BNFC'Position, LanguageDecl)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap35
happyOut35 HappyAbsSyn
happy_x_2 of { (HappyWrap35 (BNFC'Position, [Command])
happy_var_2) ->
(BNFC'Position, Module) -> HappyAbsSyn
happyIn30
((forall a b. (a, b) -> a
fst (BNFC'Position, LanguageDecl)
happy_var_1, forall a. a -> LanguageDecl' a -> [Command' a] -> Module' a
Language.Rzk.Syntax.Abs.Module (forall a b. (a, b) -> a
fst (BNFC'Position, LanguageDecl)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, LanguageDecl)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, [Command])
happy_var_2))
)}}
happyReduce_28 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_28 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
4# HappyAbsSyn -> HappyAbsSyn
happyReduction_28
happyReduction_28 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_28 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_1 of { (HappyWrap28 (BNFC'Position, VarIdent)
happy_var_1) ->
(BNFC'Position, [VarIdent]) -> HappyAbsSyn
happyIn31
((forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1, (forall a. a -> [a] -> [a]
:[]) (forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_1))
)}
happyReduce_29 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_29 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2 Int#
4# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_29
happyReduction_29 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_29 HappyAbsSyn
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_1 of { (HappyWrap28 (BNFC'Position, VarIdent)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap31
happyOut31 HappyAbsSyn
happy_x_2 of { (HappyWrap31 (BNFC'Position, [VarIdent])
happy_var_2) ->
(BNFC'Position, [VarIdent]) -> HappyAbsSyn
happyIn31
((forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1, (:) (forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, [VarIdent])
happy_var_2))
)}}
happyReduce_30 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_30 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3 Int#
5# forall {p}. p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_30
happyReduction_30 :: p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_30 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 -> HappyWrap33
happyOut33 HappyAbsSyn
happy_x_2 of { (HappyWrap33 (BNFC'Position, Language)
happy_var_2) ->
(BNFC'Position, LanguageDecl) -> HappyAbsSyn
happyIn32
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Language' a -> LanguageDecl' a
Language.Rzk.Syntax.Abs.LanguageDecl (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Language)
happy_var_2))
)}}
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#
6# 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, Language) -> HappyAbsSyn
happyIn33
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Language' a
Language.Rzk.Syntax.Abs.Rzk1 (forall a b c. (a -> 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_32 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_32 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
7# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_32
happyReduction_32 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_32 (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 -> HappyWrap27
happyOut27 HappyAbsSyn
happy_x_2 of { (HappyWrap27 (BNFC'Position, String)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap27
happyOut27 HappyAbsSyn
happy_x_4 of { (HappyWrap27 (BNFC'Position, String)
happy_var_4) ->
(BNFC'Position, Command) -> HappyAbsSyn
happyIn34
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> String -> String -> Command' a
Language.Rzk.Syntax.Abs.CommandSetOption (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, String)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, String)
happy_var_4))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}
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#
7# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_33
happyReduction_33 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_33 HappyAbsSyn
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
case HappyAbsSyn -> HappyWrap27
happyOut27 HappyAbsSyn
happy_x_2 of { (HappyWrap27 (BNFC'Position, String)
happy_var_2) ->
(BNFC'Position, Command) -> HappyAbsSyn
happyIn34
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> String -> Command' a
Language.Rzk.Syntax.Abs.CommandUnsetOption (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, String)
happy_var_2))
)}}
happyReduce_34 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_34 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
7# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_34
happyReduction_34 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_34 (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, Term)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_4 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_4) ->
(BNFC'Position, Command) -> HappyAbsSyn
happyIn34
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.CommandCheck (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}
happyReduce_35 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_35 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2 Int#
7# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_35
happyReduction_35 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_35 HappyAbsSyn
happy_x_2
HappyAbsSyn
happy_x_1
= 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, Term)
happy_var_2) ->
(BNFC'Position, Command) -> HappyAbsSyn
happyIn34
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.CommandCompute (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
)}}
happyReduce_36 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_36 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2 Int#
7# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_36
happyReduction_36 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_36 HappyAbsSyn
happy_x_2
HappyAbsSyn
happy_x_1
= 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, Term)
happy_var_2) ->
(BNFC'Position, Command) -> HappyAbsSyn
happyIn34
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.CommandComputeWHNF (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
)}}
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#
7# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_37
happyReduction_37 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_37 HappyAbsSyn
happy_x_2
HappyAbsSyn
happy_x_1
= 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, Term)
happy_var_2) ->
(BNFC'Position, Command) -> HappyAbsSyn
happyIn34
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.CommandComputeNF (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
)}}
happyReduce_38 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_38 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
6# Int#
7# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_38
happyReduction_38 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_38 (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 -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_2 of { (HappyWrap28 (BNFC'Position, VarIdent)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap36
happyOut36 HappyAbsSyn
happy_x_3 of { (HappyWrap36 (BNFC'Position, DeclUsedVars)
happy_var_3) ->
case HappyAbsSyn -> HappyWrap41
happyOut41 HappyAbsSyn
happy_x_4 of { (HappyWrap41 (BNFC'Position, [Param])
happy_var_4) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_6 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_6) ->
(BNFC'Position, Command) -> HappyAbsSyn
happyIn34
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a.
a
-> VarIdent
-> DeclUsedVars' a
-> [Param' a]
-> Term' a
-> Command' a
Language.Rzk.Syntax.Abs.CommandPostulate (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, DeclUsedVars)
happy_var_3) (forall a b. (a, b) -> b
snd (BNFC'Position, [Param])
happy_var_4) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_6))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}
happyReduce_39 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_39 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
7# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_39
happyReduction_39 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_39 (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 -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_2 of { (HappyWrap28 (BNFC'Position, VarIdent)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap36
happyOut36 HappyAbsSyn
happy_x_3 of { (HappyWrap36 (BNFC'Position, DeclUsedVars)
happy_var_3) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_5 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_5) ->
(BNFC'Position, Command) -> HappyAbsSyn
happyIn34
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> VarIdent -> DeclUsedVars' a -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.commandPostulateNoParams (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, DeclUsedVars)
happy_var_3) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}
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#
7# 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 -> HappyWrap31
happyOut31 HappyAbsSyn
happy_x_2 of { (HappyWrap31 (BNFC'Position, [VarIdent])
happy_var_2) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_4 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_4) ->
(BNFC'Position, Command) -> HappyAbsSyn
happyIn34
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> [VarIdent] -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.CommandAssume (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, [VarIdent])
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
) 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#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
7# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_41
happyReduction_41 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_41 (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 -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_2 of { (HappyWrap28 (BNFC'Position, VarIdent)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_4 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_4) ->
(BNFC'Position, Command) -> HappyAbsSyn
happyIn34
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> VarIdent -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.commandVariable (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}
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#
7# 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 -> HappyWrap31
happyOut31 HappyAbsSyn
happy_x_2 of { (HappyWrap31 (BNFC'Position, [VarIdent])
happy_var_2) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_4 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_4) ->
(BNFC'Position, Command) -> HappyAbsSyn
happyIn34
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> [VarIdent] -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.commandVariables (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, [VarIdent])
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
) 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#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
6# Int#
7# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_43
happyReduction_43 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_43 (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 -> HappyWrap37
happyOut37 HappyAbsSyn
happy_x_2 of { (HappyWrap37 (BNFC'Position, SectionName)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap35
happyOut35 HappyAbsSyn
happy_x_4 of { (HappyWrap35 (BNFC'Position, [Command])
happy_var_4) ->
case HappyAbsSyn -> HappyWrap37
happyOut37 HappyAbsSyn
happy_x_6 of { (HappyWrap37 (BNFC'Position, SectionName)
happy_var_6) ->
(BNFC'Position, Command) -> HappyAbsSyn
happyIn34
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a.
a -> SectionName' a -> [Command' a] -> SectionName' a -> Command' a
Language.Rzk.Syntax.Abs.CommandSection (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, SectionName)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, [Command])
happy_var_4) (forall a b. (a, b) -> b
snd (BNFC'Position, SectionName)
happy_var_6))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}
happyReduce_44 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_44 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
8# Int#
7# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_44
happyReduction_44 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_44 (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 -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_2 of { (HappyWrap28 (BNFC'Position, VarIdent)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap36
happyOut36 HappyAbsSyn
happy_x_3 of { (HappyWrap36 (BNFC'Position, DeclUsedVars)
happy_var_3) ->
case HappyAbsSyn -> HappyWrap41
happyOut41 HappyAbsSyn
happy_x_4 of { (HappyWrap41 (BNFC'Position, [Param])
happy_var_4) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_6 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_6) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_8 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_8) ->
(BNFC'Position, Command) -> HappyAbsSyn
happyIn34
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a.
a
-> VarIdent
-> DeclUsedVars' a
-> [Param' a]
-> Term' a
-> Term' a
-> Command' a
Language.Rzk.Syntax.Abs.CommandDefine (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, DeclUsedVars)
happy_var_3) (forall a b. (a, b) -> b
snd (BNFC'Position, [Param])
happy_var_4) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_6) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_8))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}}
happyReduce_45 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_45 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
7# Int#
7# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_45
happyReduction_45 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_45 (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 -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_2 of { (HappyWrap28 (BNFC'Position, VarIdent)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap36
happyOut36 HappyAbsSyn
happy_x_3 of { (HappyWrap36 (BNFC'Position, DeclUsedVars)
happy_var_3) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_5 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_5) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_7 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_7) ->
(BNFC'Position, Command) -> HappyAbsSyn
happyIn34
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a.
a
-> VarIdent -> DeclUsedVars' a -> Term' a -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.commandDefineNoParams (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, DeclUsedVars)
happy_var_3) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_7))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}
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#
8# Int#
7# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_46
happyReduction_46 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_46 (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 -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_2 of { (HappyWrap28 (BNFC'Position, VarIdent)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap36
happyOut36 HappyAbsSyn
happy_x_3 of { (HappyWrap36 (BNFC'Position, DeclUsedVars)
happy_var_3) ->
case HappyAbsSyn -> HappyWrap41
happyOut41 HappyAbsSyn
happy_x_4 of { (HappyWrap41 (BNFC'Position, [Param])
happy_var_4) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_6 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_6) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_8 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_8) ->
(BNFC'Position, Command) -> HappyAbsSyn
happyIn34
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a.
a
-> VarIdent
-> DeclUsedVars' a
-> [Param' a]
-> Term' a
-> Term' a
-> Command' a
Language.Rzk.Syntax.Abs.commandDef (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, DeclUsedVars)
happy_var_3) (forall a b. (a, b) -> b
snd (BNFC'Position, [Param])
happy_var_4) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_6) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_8))
) 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#
7# Int#
7# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_47
happyReduction_47 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_47 (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 -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_2 of { (HappyWrap28 (BNFC'Position, VarIdent)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap36
happyOut36 HappyAbsSyn
happy_x_3 of { (HappyWrap36 (BNFC'Position, DeclUsedVars)
happy_var_3) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_5 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_5) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_7 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_7) ->
(BNFC'Position, Command) -> HappyAbsSyn
happyIn34
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a.
a
-> VarIdent -> DeclUsedVars' a -> Term' a -> Term' a -> Command' a
Language.Rzk.Syntax.Abs.commandDefNoParams (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, DeclUsedVars)
happy_var_3) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_7))
) 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#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_0 Int#
8# HappyAbsSyn
happyReduction_48
happyReduction_48 :: HappyAbsSyn
happyReduction_48 = (BNFC'Position, [Command]) -> HappyAbsSyn
happyIn35
((BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'NoPosition, [])
)
happyReduce_49 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_49 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3 Int#
8# forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_49
happyReduction_49 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_49 HappyAbsSyn
happy_x_3
p
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap34
happyOut34 HappyAbsSyn
happy_x_1 of { (HappyWrap34 (BNFC'Position, Command)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap35
happyOut35 HappyAbsSyn
happy_x_3 of { (HappyWrap35 (BNFC'Position, [Command])
happy_var_3) ->
(BNFC'Position, [Command]) -> HappyAbsSyn
happyIn35
((forall a b. (a, b) -> a
fst (BNFC'Position, Command)
happy_var_1, (:) (forall a b. (a, b) -> b
snd (BNFC'Position, Command)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, [Command])
happy_var_3))
)}}
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 -> HappyWrap31
happyOut31 HappyAbsSyn
happy_x_3 of { (HappyWrap31 (BNFC'Position, [VarIdent])
happy_var_3) ->
(BNFC'Position, DeclUsedVars) -> HappyAbsSyn
happyIn36
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> [VarIdent] -> DeclUsedVars' a
Language.Rzk.Syntax.Abs.DeclUsedVars (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, [VarIdent])
happy_var_3))
) 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
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_0 Int#
9# HappyAbsSyn
happyReduction_51
happyReduction_51 :: HappyAbsSyn
happyReduction_51 = (BNFC'Position, DeclUsedVars) -> HappyAbsSyn
happyIn36
((BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'NoPosition, forall a. a -> DeclUsedVars' a
Language.Rzk.Syntax.Abs.noDeclUsedVars BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'NoPosition)
)
happyReduce_52 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_52 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_0 Int#
10# HappyAbsSyn
happyReduction_52
happyReduction_52 :: HappyAbsSyn
happyReduction_52 = (BNFC'Position, SectionName) -> HappyAbsSyn
happyIn37
((BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'NoPosition, forall a. a -> SectionName' a
Language.Rzk.Syntax.Abs.NoSectionName BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'NoPosition)
)
happyReduce_53 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_53 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
10# HappyAbsSyn -> HappyAbsSyn
happyReduction_53
happyReduction_53 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_53 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_1 of { (HappyWrap28 (BNFC'Position, VarIdent)
happy_var_1) ->
(BNFC'Position, SectionName) -> HappyAbsSyn
happyIn37
((forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1, forall a. a -> VarIdent -> SectionName' a
Language.Rzk.Syntax.Abs.SomeSectionName (forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_1))
)}
happyReduce_54 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_54 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
11# HappyAbsSyn -> HappyAbsSyn
happyReduction_54
happyReduction_54 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_54 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
(BNFC'Position, Pattern) -> HappyAbsSyn
happyIn38
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Pattern' a
Language.Rzk.Syntax.Abs.PatternWildcard (forall a b c. (a -> 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_55 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_55 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
11# HappyAbsSyn -> HappyAbsSyn
happyReduction_55
happyReduction_55 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_55 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_1 of { (HappyWrap28 (BNFC'Position, VarIdent)
happy_var_1) ->
(BNFC'Position, Pattern) -> HappyAbsSyn
happyIn38
((forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1, forall a. a -> VarIdent -> Pattern' a
Language.Rzk.Syntax.Abs.PatternVar (forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_1))
)}
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#
5# Int#
11# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_56
happyReduction_56 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_56 (HappyAbsSyn
happy_x_5 `HappyStk`
HappyAbsSyn
happy_x_4 `HappyStk`
HappyAbsSyn
happy_x_3 `HappyStk`
HappyAbsSyn
happy_x_2 `HappyStk`
HappyAbsSyn
happy_x_1 `HappyStk`
HappyStk HappyAbsSyn
happyRest)
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_2 of { (HappyWrap38 (BNFC'Position, Pattern)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_4 of { (HappyWrap38 (BNFC'Position, Pattern)
happy_var_4) ->
(BNFC'Position, Pattern) -> HappyAbsSyn
happyIn38
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Pattern' a -> Pattern' a -> Pattern' a
Language.Rzk.Syntax.Abs.PatternPair (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_4))
) 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 -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
12# HappyAbsSyn -> HappyAbsSyn
happyReduction_57
happyReduction_57 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_57 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_1 of { (HappyWrap38 (BNFC'Position, Pattern)
happy_var_1) ->
(BNFC'Position, [Pattern]) -> HappyAbsSyn
happyIn39
((forall a b. (a, b) -> a
fst (BNFC'Position, Pattern)
happy_var_1, (forall a. a -> [a] -> [a]
:[]) (forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_1))
)}
happyReduce_58 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_58 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2 Int#
12# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_58
happyReduction_58 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_58 HappyAbsSyn
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_1 of { (HappyWrap38 (BNFC'Position, Pattern)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_2 of { (HappyWrap39 (BNFC'Position, [Pattern])
happy_var_2) ->
(BNFC'Position, [Pattern]) -> HappyAbsSyn
happyIn39
((forall a b. (a, b) -> a
fst (BNFC'Position, Pattern)
happy_var_1, (:) (forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, [Pattern])
happy_var_2))
)}}
happyReduce_59 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_59 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
13# HappyAbsSyn -> HappyAbsSyn
happyReduction_59
happyReduction_59 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_59 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_1 of { (HappyWrap38 (BNFC'Position, Pattern)
happy_var_1) ->
(BNFC'Position, Param) -> HappyAbsSyn
happyIn40
((forall a b. (a, b) -> a
fst (BNFC'Position, Pattern)
happy_var_1, forall a. a -> Pattern' a -> Param' a
Language.Rzk.Syntax.Abs.ParamPattern (forall a b. (a, b) -> a
fst (BNFC'Position, Pattern)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_1))
)}
happyReduce_60 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_60 = 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_60
happyReduction_60 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_60 (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, [Pattern])
happy_var_2) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_4 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_4) ->
(BNFC'Position, Param) -> HappyAbsSyn
happyIn40
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> [Pattern' a] -> Term' a -> Param' a
Language.Rzk.Syntax.Abs.ParamPatternType (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, [Pattern])
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}
happyReduce_61 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_61 = 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_61
happyReduction_61 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_61 (HappyAbsSyn
happy_x_7 `HappyStk`
HappyAbsSyn
happy_x_6 `HappyStk`
HappyAbsSyn
happy_x_5 `HappyStk`
HappyAbsSyn
happy_x_4 `HappyStk`
HappyAbsSyn
happy_x_3 `HappyStk`
HappyAbsSyn
happy_x_2 `HappyStk`
HappyAbsSyn
happy_x_1 `HappyStk`
HappyStk HappyAbsSyn
happyRest)
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_2 of { (HappyWrap38 (BNFC'Position, Pattern)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_4 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_4) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_6 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_6) ->
(BNFC'Position, Param) -> HappyAbsSyn
happyIn40
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Pattern' a -> Term' a -> Term' a -> Param' a
Language.Rzk.Syntax.Abs.ParamPatternShape (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_6))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}
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#
14# HappyAbsSyn -> HappyAbsSyn
happyReduction_62
happyReduction_62 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_62 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_1 of { (HappyWrap40 (BNFC'Position, Param)
happy_var_1) ->
(BNFC'Position, [Param]) -> HappyAbsSyn
happyIn41
((forall a b. (a, b) -> a
fst (BNFC'Position, Param)
happy_var_1, (forall a. a -> [a] -> [a]
:[]) (forall a b. (a, b) -> b
snd (BNFC'Position, Param)
happy_var_1))
)}
happyReduce_63 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_63 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2 Int#
14# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_63
happyReduction_63 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_63 HappyAbsSyn
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_1 of { (HappyWrap40 (BNFC'Position, Param)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap41
happyOut41 HappyAbsSyn
happy_x_2 of { (HappyWrap41 (BNFC'Position, [Param])
happy_var_2) ->
(BNFC'Position, [Param]) -> HappyAbsSyn
happyIn41
((forall a b. (a, b) -> a
fst (BNFC'Position, Param)
happy_var_1, (:) (forall a b. (a, b) -> b
snd (BNFC'Position, Param)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, [Param])
happy_var_2))
)}}
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#
15# HappyAbsSyn -> HappyAbsSyn
happyReduction_64
happyReduction_64 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_64 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap51
happyOut51 HappyAbsSyn
happy_x_1 of { (HappyWrap51 (BNFC'Position, Term)
happy_var_1) ->
(BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn42
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, forall a. a -> Term' a -> ParamDecl' a
Language.Rzk.Syntax.Abs.ParamType (forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
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#
15# 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 -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_4 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_4) ->
(BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn42
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a -> ParamDecl' a
Language.Rzk.Syntax.Abs.ParamWildcardType (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
) 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#
5# Int#
15# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_66
happyReduction_66 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_66 (HappyAbsSyn
happy_x_5 `HappyStk`
HappyAbsSyn
happy_x_4 `HappyStk`
HappyAbsSyn
happy_x_3 `HappyStk`
HappyAbsSyn
happy_x_2 `HappyStk`
HappyAbsSyn
happy_x_1 `HappyStk`
HappyStk HappyAbsSyn
happyRest)
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_2 of { (HappyWrap38 (BNFC'Position, Pattern)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_4 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_4) ->
(BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn42
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Pattern' a -> Term' a -> ParamDecl' a
Language.Rzk.Syntax.Abs.ParamVarType (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
) 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#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
15# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_67
happyReduction_67 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_67 (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 -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_2 of { (HappyWrap28 (BNFC'Position, VarIdent)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_4 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_4) ->
(BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn42
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> VarIdent -> Term' a -> ParamDecl' a
Language.Rzk.Syntax.Abs.paramVarType (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}
happyReduce_68 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_68 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
9# Int#
15# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_68
happyReduction_68 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_68 (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 -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_3 of { (HappyWrap38 (BNFC'Position, Pattern)
happy_var_3) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_5 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_5) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_8 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_8) ->
(BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn42
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Pattern' a -> Term' a -> Term' a -> ParamDecl' a
Language.Rzk.Syntax.Abs.ParamVarShape (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_3) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_8))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}
happyReduce_69 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_69 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
7# Int#
15# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_69
happyReduction_69 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_69 (HappyAbsSyn
happy_x_7 `HappyStk`
HappyAbsSyn
happy_x_6 `HappyStk`
HappyAbsSyn
happy_x_5 `HappyStk`
HappyAbsSyn
happy_x_4 `HappyStk`
HappyAbsSyn
happy_x_3 `HappyStk`
HappyAbsSyn
happy_x_2 `HappyStk`
HappyAbsSyn
happy_x_1 `HappyStk`
HappyStk HappyAbsSyn
happyRest)
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_2 of { (HappyWrap38 (BNFC'Position, Pattern)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_4 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_4) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_6 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_6) ->
(BNFC'Position, ParamDecl) -> HappyAbsSyn
happyIn42
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Pattern' a -> Term' a -> Term' a -> ParamDecl' a
Language.Rzk.Syntax.Abs.paramVarShape (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_6))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}
happyReduce_70 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_70 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3 Int#
16# forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_70
happyReduction_70 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_70 HappyAbsSyn
happy_x_3
p
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_1 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_3 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_3) ->
(BNFC'Position, Restriction) -> HappyAbsSyn
happyIn43
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, forall a. a -> Term' a -> Term' a -> Restriction' a
Language.Rzk.Syntax.Abs.Restriction (forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
)}}
happyReduce_71 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_71 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
17# HappyAbsSyn -> HappyAbsSyn
happyReduction_71
happyReduction_71 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_71 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap43
happyOut43 HappyAbsSyn
happy_x_1 of { (HappyWrap43 (BNFC'Position, Restriction)
happy_var_1) ->
(BNFC'Position, [Restriction]) -> HappyAbsSyn
happyIn44
((forall a b. (a, b) -> a
fst (BNFC'Position, Restriction)
happy_var_1, (forall a. a -> [a] -> [a]
:[]) (forall a b. (a, b) -> b
snd (BNFC'Position, Restriction)
happy_var_1))
)}
happyReduce_72 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_72 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3 Int#
17# forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_72
happyReduction_72 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_72 HappyAbsSyn
happy_x_3
p
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap43
happyOut43 HappyAbsSyn
happy_x_1 of { (HappyWrap43 (BNFC'Position, Restriction)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap44
happyOut44 HappyAbsSyn
happy_x_3 of { (HappyWrap44 (BNFC'Position, [Restriction])
happy_var_3) ->
(BNFC'Position, [Restriction]) -> HappyAbsSyn
happyIn44
((forall a b. (a, b) -> a
fst (BNFC'Position, Restriction)
happy_var_1, (:) (forall a b. (a, b) -> b
snd (BNFC'Position, Restriction)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, [Restriction])
happy_var_3))
)}}
happyReduce_73 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_73 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
18# HappyAbsSyn -> HappyAbsSyn
happyReduction_73
happyReduction_73 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_73 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a
Language.Rzk.Syntax.Abs.Universe (forall a b c. (a -> 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_74 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_74 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
18# HappyAbsSyn -> HappyAbsSyn
happyReduction_74
happyReduction_74 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_74 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a
Language.Rzk.Syntax.Abs.UniverseCube (forall a b c. (a -> 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_75 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_75 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
18# HappyAbsSyn -> HappyAbsSyn
happyReduction_75
happyReduction_75 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_75 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a
Language.Rzk.Syntax.Abs.UniverseTope (forall a b c. (a -> 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_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 -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a
Language.Rzk.Syntax.Abs.CubeUnit (forall a b c. (a -> 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_77 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_77 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
18# HappyAbsSyn -> HappyAbsSyn
happyReduction_77
happyReduction_77 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_77 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a
Language.Rzk.Syntax.Abs.CubeUnitStar (forall a b c. (a -> 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_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#
18# HappyAbsSyn -> HappyAbsSyn
happyReduction_78
happyReduction_78 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_78 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a
Language.Rzk.Syntax.Abs.Cube2 (forall a b c. (a -> 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_79 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_79 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
18# HappyAbsSyn -> HappyAbsSyn
happyReduction_79
happyReduction_79 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_79 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a
Language.Rzk.Syntax.Abs.Cube2_0 (forall a b c. (a -> 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_80 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_80 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
18# HappyAbsSyn -> HappyAbsSyn
happyReduction_80
happyReduction_80 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_80 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a
Language.Rzk.Syntax.Abs.Cube2_1 (forall a b c. (a -> 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_81 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_81 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
18# HappyAbsSyn -> HappyAbsSyn
happyReduction_81
happyReduction_81 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_81 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a
Language.Rzk.Syntax.Abs.TopeTop (forall a b c. (a -> 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_82 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_82 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
18# HappyAbsSyn -> HappyAbsSyn
happyReduction_82
happyReduction_82 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_82 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a
Language.Rzk.Syntax.Abs.TopeBottom (forall a b c. (a -> 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_83 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_83 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
18# HappyAbsSyn -> HappyAbsSyn
happyReduction_83
happyReduction_83 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_83 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a
Language.Rzk.Syntax.Abs.RecBottom (forall a b c. (a -> 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_84 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_84 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
18# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_84
happyReduction_84 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_84 (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 -> HappyWrap44
happyOut44 HappyAbsSyn
happy_x_3 of { (HappyWrap44 (BNFC'Position, [Restriction])
happy_var_3) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> [Restriction' a] -> Term' a
Language.Rzk.Syntax.Abs.RecOr (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, [Restriction])
happy_var_3))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}
happyReduce_85 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_85 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
10# Int#
18# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_85
happyReduction_85 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_85 (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 -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_3 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_3) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_5 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_5) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_7 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_7) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_9 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_9) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a -> Term' a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.recOr (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_7) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_9))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}
happyReduce_86 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_86 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
18# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_86
happyReduction_86 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_86 (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 -> HappyWrap42
happyOut42 HappyAbsSyn
happy_x_2 of { (HappyWrap42 (BNFC'Position, ParamDecl)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_4 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_4) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> ParamDecl' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.typeExtension (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, ParamDecl)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}
happyReduce_87 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_87 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
18# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_87
happyReduction_87 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_87 (HappyAbsSyn
happy_x_5 `HappyStk`
HappyAbsSyn
happy_x_4 `HappyStk`
HappyAbsSyn
happy_x_3 `HappyStk`
HappyAbsSyn
happy_x_2 `HappyStk`
HappyAbsSyn
happy_x_1 `HappyStk`
HappyStk HappyAbsSyn
happyRest)
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_2 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_4 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_4) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.Pair (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}
happyReduce_88 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_88 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
18# HappyAbsSyn -> HappyAbsSyn
happyReduction_88
happyReduction_88 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_88 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a
Language.Rzk.Syntax.Abs.Refl (forall a b c. (a -> 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_89 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_89 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3 Int#
18# forall {p}. p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_89
happyReduction_89 :: p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_89 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 -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_2 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_2) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.ReflTerm (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
)}}
happyReduce_90 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_90 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
18# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_90
happyReduction_90 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_90 (HappyAbsSyn
happy_x_5 `HappyStk`
HappyAbsSyn
happy_x_4 `HappyStk`
HappyAbsSyn
happy_x_3 `HappyStk`
HappyAbsSyn
happy_x_2 `HappyStk`
HappyAbsSyn
happy_x_1 `HappyStk`
HappyStk HappyAbsSyn
happyRest)
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_2 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_2) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_4 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_4) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.ReflTermType (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}
happyReduce_91 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_91 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
14# Int#
18# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_91
happyReduction_91 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_91 (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 -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_3 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_3) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_5 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_5) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_7 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_7) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_9 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_9) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_11 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_11) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_13 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_13) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a.
a
-> Term' a
-> Term' a
-> Term' a
-> Term' a
-> Term' a
-> Term' a
-> Term' a
Language.Rzk.Syntax.Abs.IdJ (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_7) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_9) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_11) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_13))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}}}
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#
18# HappyAbsSyn -> HappyAbsSyn
happyReduction_92
happyReduction_92 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_92 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap29
happyOut29 HappyAbsSyn
happy_x_1 of { (HappyWrap29 (BNFC'Position, HoleIdent)
happy_var_1) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b. (a, b) -> a
fst (BNFC'Position, HoleIdent)
happy_var_1, forall a. a -> HoleIdent -> Term' a
Language.Rzk.Syntax.Abs.Hole (forall a b. (a, b) -> a
fst (BNFC'Position, HoleIdent)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, HoleIdent)
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#
18# HappyAbsSyn -> HappyAbsSyn
happyReduction_93
happyReduction_93 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_93 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_1 of { (HappyWrap28 (BNFC'Position, VarIdent)
happy_var_1) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1, forall a. a -> VarIdent -> Term' a
Language.Rzk.Syntax.Abs.Var (forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_1))
)}
happyReduce_94 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_94 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3 Int#
18# forall {p}. p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_94
happyReduction_94 :: p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_94 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 -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_2 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_2) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn45
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
)}}
happyReduce_95 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_95 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3 Int#
19# forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_95
happyReduction_95 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_95 HappyAbsSyn
happy_x_3
p
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_1 of { (HappyWrap46 (BNFC'Position, Term)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap51
happyOut51 HappyAbsSyn
happy_x_3 of { (HappyWrap51 (BNFC'Position, Term)
happy_var_3) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn46
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.CubeProduct (forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
)}}
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#
19# HappyAbsSyn -> HappyAbsSyn
happyReduction_96
happyReduction_96 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_96 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap51
happyOut51 HappyAbsSyn
happy_x_1 of { (HappyWrap51 (BNFC'Position, Term)
happy_var_1) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn46
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
)}
happyReduce_97 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_97 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3 Int#
20# forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_97
happyReduction_97 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_97 HappyAbsSyn
happy_x_3
p
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_1 of { (HappyWrap46 (BNFC'Position, Term)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_3 of { (HappyWrap46 (BNFC'Position, Term)
happy_var_3) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn47
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TopeEQ (forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
)}}
happyReduce_98 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_98 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3 Int#
20# forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_98
happyReduction_98 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_98 HappyAbsSyn
happy_x_3
p
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_1 of { (HappyWrap46 (BNFC'Position, Term)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_3 of { (HappyWrap46 (BNFC'Position, Term)
happy_var_3) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn47
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TopeLEQ (forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
)}}
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#
20# HappyAbsSyn -> HappyAbsSyn
happyReduction_99
happyReduction_99 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_99 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_1 of { (HappyWrap46 (BNFC'Position, Term)
happy_var_1) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn47
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
)}
happyReduce_100 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_100 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3 Int#
21# forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_100
happyReduction_100 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_100 HappyAbsSyn
happy_x_3
p
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_1 of { (HappyWrap47 (BNFC'Position, Term)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap48
happyOut48 HappyAbsSyn
happy_x_3 of { (HappyWrap48 (BNFC'Position, Term)
happy_var_3) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn48
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TopeAnd (forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
)}}
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#
21# HappyAbsSyn -> HappyAbsSyn
happyReduction_101
happyReduction_101 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_101 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_1 of { (HappyWrap47 (BNFC'Position, Term)
happy_var_1) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn48
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
)}
happyReduce_102 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_102 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3 Int#
22# forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_102
happyReduction_102 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_102 HappyAbsSyn
happy_x_3
p
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap48
happyOut48 HappyAbsSyn
happy_x_1 of { (HappyWrap48 (BNFC'Position, Term)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap49
happyOut49 HappyAbsSyn
happy_x_3 of { (HappyWrap49 (BNFC'Position, Term)
happy_var_3) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn49
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TopeOr (forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
)}}
happyReduce_103 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_103 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1 Int#
22# HappyAbsSyn -> HappyAbsSyn
happyReduction_103
happyReduction_103 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_103 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap48
happyOut48 HappyAbsSyn
happy_x_1 of { (HappyWrap48 (BNFC'Position, Term)
happy_var_1) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn49
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
)}
happyReduce_104 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_104 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3 Int#
23# forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_104
happyReduction_104 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_104 HappyAbsSyn
happy_x_3
p
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap42
happyOut42 HappyAbsSyn
happy_x_1 of { (HappyWrap42 (BNFC'Position, ParamDecl)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
happy_x_3 of { (HappyWrap50 (BNFC'Position, Term)
happy_var_3) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn50
((forall a b. (a, b) -> a
fst (BNFC'Position, ParamDecl)
happy_var_1, forall a. a -> ParamDecl' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TypeFun (forall a b. (a, b) -> a
fst (BNFC'Position, ParamDecl)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, ParamDecl)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
)}}
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#
8# Int#
23# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_105
happyReduction_105 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_105 (HappyAbsSyn
happy_x_8 `HappyStk`
HappyAbsSyn
happy_x_7 `HappyStk`
HappyAbsSyn
happy_x_6 `HappyStk`
HappyAbsSyn
happy_x_5 `HappyStk`
HappyAbsSyn
happy_x_4 `HappyStk`
HappyAbsSyn
happy_x_3 `HappyStk`
HappyAbsSyn
happy_x_2 `HappyStk`
HappyAbsSyn
happy_x_1 `HappyStk`
HappyStk HappyAbsSyn
happyRest)
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_3 of { (HappyWrap38 (BNFC'Position, Pattern)
happy_var_3) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_5 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_5) ->
case HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
happy_x_8 of { (HappyWrap50 (BNFC'Position, Term)
happy_var_8) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn50
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Pattern' a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TypeSigma (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_3) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_8))
) 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#
23# 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 -> HappyWrap49
happyOut49 HappyAbsSyn
happy_x_1 of { (HappyWrap49 (BNFC'Position, Term)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_3 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_3) ->
case HappyAbsSyn -> HappyWrap49
happyOut49 HappyAbsSyn
happy_x_5 of { (HappyWrap49 (BNFC'Position, Term)
happy_var_5) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn50
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, forall a. a -> Term' a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TypeId (forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5))
) 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#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3 Int#
23# forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_107
happyReduction_107 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_107 HappyAbsSyn
happy_x_3
p
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap49
happyOut49 HappyAbsSyn
happy_x_1 of { (HappyWrap49 (BNFC'Position, Term)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap49
happyOut49 HappyAbsSyn
happy_x_3 of { (HappyWrap49 (BNFC'Position, Term)
happy_var_3) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn50
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TypeIdSimple (forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
)}}
happyReduce_108 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_108 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
23# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_108
happyReduction_108 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_108 (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 -> HappyWrap41
happyOut41 HappyAbsSyn
happy_x_2 of { (HappyWrap41 (BNFC'Position, [Param])
happy_var_2) ->
case HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
happy_x_4 of { (HappyWrap50 (BNFC'Position, Term)
happy_var_4) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn50
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> [Param' a] -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.Lambda (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, [Param])
happy_var_2) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}
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#
23# HappyAbsSyn -> HappyAbsSyn
happyReduction_109
happyReduction_109 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_109 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap49
happyOut49 HappyAbsSyn
happy_x_1 of { (HappyWrap49 (BNFC'Position, Term)
happy_var_1) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn50
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
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#
23# forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_110
happyReduction_110 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_110 HappyAbsSyn
happy_x_3
p
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap42
happyOut42 HappyAbsSyn
happy_x_1 of { (HappyWrap42 (BNFC'Position, ParamDecl)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
happy_x_3 of { (HappyWrap50 (BNFC'Position, Term)
happy_var_3) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn50
((forall a b. (a, b) -> a
fst (BNFC'Position, ParamDecl)
happy_var_1, forall a. a -> ParamDecl' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.unicode_TypeFun (forall a b. (a, b) -> a
fst (BNFC'Position, ParamDecl)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, ParamDecl)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
)}}
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#
8# Int#
23# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_111
happyReduction_111 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_111 (HappyAbsSyn
happy_x_8 `HappyStk`
HappyAbsSyn
happy_x_7 `HappyStk`
HappyAbsSyn
happy_x_6 `HappyStk`
HappyAbsSyn
happy_x_5 `HappyStk`
HappyAbsSyn
happy_x_4 `HappyStk`
HappyAbsSyn
happy_x_3 `HappyStk`
HappyAbsSyn
happy_x_2 `HappyStk`
HappyAbsSyn
happy_x_1 `HappyStk`
HappyStk HappyAbsSyn
happyRest)
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_3 of { (HappyWrap38 (BNFC'Position, Pattern)
happy_var_3) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_5 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_5) ->
case HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
happy_x_8 of { (HappyWrap50 (BNFC'Position, Term)
happy_var_8) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn50
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Pattern' a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.unicode_TypeSigma (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_3) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_8))
) 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#
8# Int#
23# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_112
happyReduction_112 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_112 (HappyAbsSyn
happy_x_8 `HappyStk`
HappyAbsSyn
happy_x_7 `HappyStk`
HappyAbsSyn
happy_x_6 `HappyStk`
HappyAbsSyn
happy_x_5 `HappyStk`
HappyAbsSyn
happy_x_4 `HappyStk`
HappyAbsSyn
happy_x_3 `HappyStk`
HappyAbsSyn
happy_x_2 `HappyStk`
HappyAbsSyn
happy_x_1 `HappyStk`
HappyStk HappyAbsSyn
happyRest)
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_3 of { (HappyWrap38 (BNFC'Position, Pattern)
happy_var_3) ->
case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_5 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_5) ->
case HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
happy_x_8 of { (HappyWrap50 (BNFC'Position, Term)
happy_var_8) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn50
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Pattern' a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.unicode_TypeSigmaAlt (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_3) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_8))
) 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#
-> 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_113
happyReduction_113 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_113 (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 -> HappyWrap51
happyOut51 HappyAbsSyn
happy_x_1 of { (HappyWrap51 (BNFC'Position, Term)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap44
happyOut44 HappyAbsSyn
happy_x_3 of { (HappyWrap44 (BNFC'Position, [Restriction])
happy_var_3) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn51
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, forall a. a -> Term' a -> [Restriction' a] -> Term' a
Language.Rzk.Syntax.Abs.TypeRestricted (forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, [Restriction])
happy_var_3))
) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}
happyReduce_114 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_114 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2 Int#
24# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_114
happyReduction_114 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_114 HappyAbsSyn
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap51
happyOut51 HappyAbsSyn
happy_x_1 of { (HappyWrap51 (BNFC'Position, Term)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
happy_x_2 of { (HappyWrap45 (BNFC'Position, Term)
happy_var_2) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn51
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.App (forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
)}}
happyReduce_115 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_115 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2 Int#
24# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_115
happyReduction_115 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_115 HappyAbsSyn
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
case HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
happy_x_2 of { (HappyWrap45 (BNFC'Position, Term)
happy_var_2) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn51
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.First (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (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 -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2 Int#
24# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_116
happyReduction_116 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_116 HappyAbsSyn
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 ->
case HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
happy_x_2 of { (HappyWrap45 (BNFC'Position, Term)
happy_var_2) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn51
((forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), forall a. a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.Second (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.Rzk.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
)}}
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 -> HappyWrap45
happyOut45 HappyAbsSyn
happy_x_1 of { (HappyWrap45 (BNFC'Position, Term)
happy_var_1) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn51
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
)}
happyReduce_118 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_118 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3 Int#
25# forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_118
happyReduction_118 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_118 HappyAbsSyn
happy_x_3
p
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap49
happyOut49 HappyAbsSyn
happy_x_1 of { (HappyWrap49 (BNFC'Position, Term)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
happy_x_3 of { (HappyWrap50 (BNFC'Position, Term)
happy_var_3) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn52
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, forall a. a -> Term' a -> Term' a -> Term' a
Language.Rzk.Syntax.Abs.TypeAsc (forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
)}}
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#
25# HappyAbsSyn -> HappyAbsSyn
happyReduction_119
happyReduction_119 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_119 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
happy_x_1 of { (HappyWrap50 (BNFC'Position, Term)
happy_var_1) ->
(BNFC'Position, Term) -> HappyAbsSyn
happyIn52
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
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#
26# HappyAbsSyn -> HappyAbsSyn
happyReduction_120
happyReduction_120 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_120 HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_1 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_1) ->
(BNFC'Position, [Term]) -> HappyAbsSyn
happyIn53
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, (forall a. a -> [a] -> [a]
:[]) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
)}
happyReduce_121 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_121 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3 Int#
26# forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_121
happyReduction_121 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_121 HappyAbsSyn
happy_x_3
p
happy_x_2
HappyAbsSyn
happy_x_1
= case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_1 of { (HappyWrap52 (BNFC'Position, Term)
happy_var_1) ->
case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_3 of { (HappyWrap53 (BNFC'Position, [Term])
happy_var_3) ->
(BNFC'Position, [Term]) -> HappyAbsSyn
happyIn53
((forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, (:) (forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) (forall a b. (a, b) -> b
snd (BNFC'Position, [Term])
happy_var_3))
)}}
happyNewToken :: Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyNewToken Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk [] =
Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyDoAction Int#
67# forall a. a
notHappyAtAll Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk []
happyNewToken Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk (Token
tk:[Token]
tks) =
let cont :: Int# -> Err HappyAbsSyn
cont Int#
i = Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyDoAction Int#
i Token
tk Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk [Token]
tks in
case Token
tk of {
PT Posn
_ (TS String
_ Int
1) -> Int# -> Err HappyAbsSyn
cont Int#
1#;
PT Posn
_ (TS String
_ Int
2) -> Int# -> Err HappyAbsSyn
cont Int#
2#;
PT Posn
_ (TS String
_ Int
3) -> Int# -> Err HappyAbsSyn
cont Int#
3#;
PT Posn
_ (TS String
_ Int
4) -> Int# -> Err HappyAbsSyn
cont Int#
4#;
PT Posn
_ (TS String
_ Int
5) -> Int# -> Err HappyAbsSyn
cont Int#
5#;
PT Posn
_ (TS String
_ Int
6) -> Int# -> Err HappyAbsSyn
cont Int#
6#;
PT Posn
_ (TS String
_ Int
7) -> Int# -> Err HappyAbsSyn
cont Int#
7#;
PT Posn
_ (TS String
_ Int
8) -> Int# -> Err HappyAbsSyn
cont Int#
8#;
PT Posn
_ (TS String
_ Int
9) -> Int# -> Err HappyAbsSyn
cont Int#
9#;
PT Posn
_ (TS String
_ Int
10) -> Int# -> Err HappyAbsSyn
cont Int#
10#;
PT Posn
_ (TS String
_ Int
11) -> Int# -> Err HappyAbsSyn
cont Int#
11#;
PT Posn
_ (TS String
_ Int
12) -> Int# -> Err HappyAbsSyn
cont Int#
12#;
PT Posn
_ (TS String
_ Int
13) -> Int# -> Err HappyAbsSyn
cont Int#
13#;
PT Posn
_ (TS String
_ Int
14) -> Int# -> Err HappyAbsSyn
cont Int#
14#;
PT Posn
_ (TS String
_ Int
15) -> Int# -> Err HappyAbsSyn
cont Int#
15#;
PT Posn
_ (TS String
_ Int
16) -> Int# -> Err HappyAbsSyn
cont Int#
16#;
PT Posn
_ (TS String
_ Int
17) -> Int# -> Err HappyAbsSyn
cont Int#
17#;
PT Posn
_ (TS String
_ Int
18) -> Int# -> Err HappyAbsSyn
cont Int#
18#;
PT Posn
_ (TS String
_ Int
19) -> Int# -> Err HappyAbsSyn
cont Int#
19#;
PT Posn
_ (TS String
_ Int
20) -> Int# -> Err HappyAbsSyn
cont Int#
20#;
PT Posn
_ (TS String
_ Int
21) -> Int# -> Err HappyAbsSyn
cont Int#
21#;
PT Posn
_ (TS String
_ Int
22) -> Int# -> Err HappyAbsSyn
cont Int#
22#;
PT Posn
_ (TS String
_ Int
23) -> Int# -> Err HappyAbsSyn
cont Int#
23#;
PT Posn
_ (TS String
_ Int
24) -> Int# -> Err HappyAbsSyn
cont Int#
24#;
PT Posn
_ (TS String
_ Int
25) -> Int# -> Err HappyAbsSyn
cont Int#
25#;
PT Posn
_ (TS String
_ Int
26) -> Int# -> Err HappyAbsSyn
cont Int#
26#;
PT Posn
_ (TS String
_ Int
27) -> Int# -> Err HappyAbsSyn
cont Int#
27#;
PT Posn
_ (TS String
_ Int
28) -> Int# -> Err HappyAbsSyn
cont Int#
28#;
PT Posn
_ (TS String
_ Int
29) -> Int# -> Err HappyAbsSyn
cont Int#
29#;
PT Posn
_ (TS String
_ Int
30) -> Int# -> Err HappyAbsSyn
cont Int#
30#;
PT Posn
_ (TS String
_ Int
31) -> Int# -> Err HappyAbsSyn
cont Int#
31#;
PT Posn
_ (TS String
_ Int
32) -> Int# -> Err HappyAbsSyn
cont Int#
32#;
PT Posn
_ (TS String
_ Int
33) -> Int# -> Err HappyAbsSyn
cont Int#
33#;
PT Posn
_ (TS String
_ Int
34) -> Int# -> Err HappyAbsSyn
cont Int#
34#;
PT Posn
_ (TS String
_ Int
35) -> Int# -> Err HappyAbsSyn
cont Int#
35#;
PT Posn
_ (TS String
_ Int
36) -> Int# -> Err HappyAbsSyn
cont Int#
36#;
PT Posn
_ (TS String
_ Int
37) -> Int# -> Err HappyAbsSyn
cont Int#
37#;
PT Posn
_ (TS String
_ Int
38) -> Int# -> Err HappyAbsSyn
cont Int#
38#;
PT Posn
_ (TS String
_ Int
39) -> Int# -> Err HappyAbsSyn
cont Int#
39#;
PT Posn
_ (TS String
_ Int
40) -> Int# -> Err HappyAbsSyn
cont Int#
40#;
PT Posn
_ (TS String
_ Int
41) -> Int# -> Err HappyAbsSyn
cont Int#
41#;
PT Posn
_ (TS String
_ Int
42) -> Int# -> Err HappyAbsSyn
cont Int#
42#;
PT Posn
_ (TS String
_ Int
43) -> Int# -> Err HappyAbsSyn
cont Int#
43#;
PT Posn
_ (TS String
_ Int
44) -> Int# -> Err HappyAbsSyn
cont Int#
44#;
PT Posn
_ (TS String
_ Int
45) -> Int# -> Err HappyAbsSyn
cont Int#
45#;
PT Posn
_ (TS String
_ Int
46) -> Int# -> Err HappyAbsSyn
cont Int#
46#;
PT Posn
_ (TS String
_ Int
47) -> Int# -> Err HappyAbsSyn
cont Int#
47#;
PT Posn
_ (TS String
_ Int
48) -> Int# -> Err HappyAbsSyn
cont Int#
48#;
PT Posn
_ (TS String
_ Int
49) -> Int# -> Err HappyAbsSyn
cont Int#
49#;
PT Posn
_ (TS String
_ Int
50) -> Int# -> Err HappyAbsSyn
cont Int#
50#;
PT Posn
_ (TS String
_ Int
51) -> Int# -> Err HappyAbsSyn
cont Int#
51#;
PT Posn
_ (TS String
_ Int
52) -> Int# -> Err HappyAbsSyn
cont Int#
52#;
PT Posn
_ (TS String
_ Int
53) -> Int# -> Err HappyAbsSyn
cont Int#
53#;
PT Posn
_ (TS String
_ Int
54) -> Int# -> Err HappyAbsSyn
cont Int#
54#;
PT Posn
_ (TS String
_ Int
55) -> Int# -> Err HappyAbsSyn
cont Int#
55#;
PT Posn
_ (TS String
_ Int
56) -> Int# -> Err HappyAbsSyn
cont Int#
56#;
PT Posn
_ (TS String
_ Int
57) -> Int# -> Err HappyAbsSyn
cont Int#
57#;
PT Posn
_ (TS String
_ Int
58) -> Int# -> Err HappyAbsSyn
cont Int#
58#;
PT Posn
_ (TS String
_ Int
59) -> Int# -> Err HappyAbsSyn
cont Int#
59#;
PT Posn
_ (TS String
_ Int
60) -> Int# -> Err HappyAbsSyn
cont Int#
60#;
PT Posn
_ (TS String
_ Int
61) -> Int# -> Err HappyAbsSyn
cont Int#
61#;
PT Posn
_ (TS String
_ Int
62) -> Int# -> Err HappyAbsSyn
cont Int#
62#;
PT Posn
_ (TS String
_ Int
63) -> Int# -> Err HappyAbsSyn
cont Int#
63#;
PT Posn
_ (TL String
_) -> Int# -> Err HappyAbsSyn
cont Int#
64#;
PT Posn
_ (T_VarIdent String
_) -> Int# -> Err HappyAbsSyn
cont Int#
65#;
PT Posn
_ (T_HoleIdent String
_) -> Int# -> Err HappyAbsSyn
cont Int#
66#;
Token
_ -> forall a. ([Token], [String]) -> Err a
happyError' ((Token
tkforall a. a -> [a] -> [a]
:[Token]
tks), [])
}
happyError_ :: [String] -> Int# -> Token -> [Token] -> Err a
happyError_ [String]
explist Int#
67# Token
tk [Token]
tks = forall a. ([Token], [String]) -> Err a
happyError' ([Token]
tks, [String]
explist)
happyError_ [String]
explist Int#
_ Token
tk [Token]
tks = forall a. ([Token], [String]) -> Err a
happyError' ((Token
tkforall a. a -> [a] -> [a]
:[Token]
tks), [String]
explist)
happyThen :: () => Err a -> (a -> Err b) -> Err b
happyThen :: forall a b. Err a -> (a -> Err b) -> Err b
happyThen = (forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
(>>=))
happyReturn :: () => a -> Err a
happyReturn :: forall a. a -> Err a
happyReturn = (forall (m :: * -> *) a. Monad m => a -> m a
return)
happyThen1 :: m t -> (t -> t -> m b) -> t -> m b
happyThen1 m t
m t -> t -> m b
k t
tks = (forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
(>>=)) m t
m (\t
a -> t -> t -> m b
k t
a t
tks)
happyReturn1 :: () => a -> b -> Err a
happyReturn1 :: forall a b. a -> b -> Err a
happyReturn1 = \a
a b
tks -> (forall (m :: * -> *) a. Monad m => a -> m a
return) a
a
happyError' :: () => ([(Token)], [Prelude.String]) -> Err a
happyError' :: forall a. ([Token], [String]) -> Err a
happyError' = (\([Token]
tokens, [String]
_) -> forall a. [Token] -> Err a
happyError [Token]
tokens)
pModule_internal :: [Token] -> Err (BNFC'Position, Module)
pModule_internal [Token]
tks = Err (BNFC'Position, Module)
happySomeParser where
happySomeParser :: Err (BNFC'Position, Module)
happySomeParser = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
0# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap30 (BNFC'Position, Module)
x') = HappyAbsSyn -> HappyWrap30
happyOut30 HappyAbsSyn
x} in (BNFC'Position, Module)
x'))
pListVarIdent_internal :: [Token] -> Err (BNFC'Position, [VarIdent])
pListVarIdent_internal [Token]
tks = Err (BNFC'Position, [VarIdent])
happySomeParser where
happySomeParser :: Err (BNFC'Position, [VarIdent])
happySomeParser = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
1# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap31 (BNFC'Position, [VarIdent])
x') = HappyAbsSyn -> HappyWrap31
happyOut31 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
2# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap32 (BNFC'Position, LanguageDecl)
x') = HappyAbsSyn -> HappyWrap32
happyOut32 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
3# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap33 (BNFC'Position, Language)
x') = HappyAbsSyn -> HappyWrap33
happyOut33 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
4# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap34 (BNFC'Position, Command)
x') = HappyAbsSyn -> HappyWrap34
happyOut34 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
5# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap35 (BNFC'Position, [Command])
x') = HappyAbsSyn -> HappyWrap35
happyOut35 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
6# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap36 (BNFC'Position, DeclUsedVars)
x') = HappyAbsSyn -> HappyWrap36
happyOut36 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
7# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap37 (BNFC'Position, SectionName)
x') = HappyAbsSyn -> HappyWrap37
happyOut37 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
8# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap38 (BNFC'Position, Pattern)
x') = HappyAbsSyn -> HappyWrap38
happyOut38 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
9# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap39 (BNFC'Position, [Pattern])
x') = HappyAbsSyn -> HappyWrap39
happyOut39 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
10# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap40 (BNFC'Position, Param)
x') = HappyAbsSyn -> HappyWrap40
happyOut40 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
11# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap41 (BNFC'Position, [Param])
x') = HappyAbsSyn -> HappyWrap41
happyOut41 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
12# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap42 (BNFC'Position, ParamDecl)
x') = HappyAbsSyn -> HappyWrap42
happyOut42 HappyAbsSyn
x} in (BNFC'Position, ParamDecl)
x'))
pRestriction_internal :: [Token] -> Err (BNFC'Position, Restriction)
pRestriction_internal [Token]
tks = Err (BNFC'Position, Restriction)
happySomeParser where
happySomeParser :: Err (BNFC'Position, Restriction)
happySomeParser = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
13# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap43 (BNFC'Position, Restriction)
x') = HappyAbsSyn -> HappyWrap43
happyOut43 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
14# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap44 (BNFC'Position, [Restriction])
x') = HappyAbsSyn -> HappyWrap44
happyOut44 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
15# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap45 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap45
happyOut45 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
16# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap46 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap46
happyOut46 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
17# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap47 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap47
happyOut47 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
18# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap48 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap48
happyOut48 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
19# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap49 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap49
happyOut49 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
20# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap50 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap50
happyOut50 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
21# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap51 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap51
happyOut51 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
22# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap52 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap52
happyOut52 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 = forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
23# [Token]
tks) (\HappyAbsSyn
x -> forall a. a -> Err a
happyReturn (let {(HappyWrap53 (BNFC'Position, [Term])
x') = HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
x} in (BNFC'Position, [Term])
x'))
happySeq :: a -> b -> b
happySeq = forall a b. a -> b -> b
happyDontSeq
type Err = Either String
happyError :: [Token] -> Err a
happyError :: forall a. [Token] -> Err a
happyError [Token]
ts = forall a b. a -> Either a b
Left forall a b. (a -> b) -> a -> b
$
String
"syntax error at " forall a. [a] -> [a] -> [a]
++ [Token] -> String
tokenPos [Token]
ts forall a. [a] -> [a] -> [a]
++
case [Token]
ts of
[] -> []
[Err Posn
_] -> String
" due to lexer error"
Token
t:[Token]
_ -> String
" before `" forall a. [a] -> [a] -> [a]
++ (Token -> String
prToken Token
t) forall a. [a] -> [a] -> [a]
++ String
"'"
myLexer :: String -> [Token]
myLexer :: String -> [Token]
myLexer = String -> [Token]
tokens
pModule :: [Token] -> Err Language.Rzk.Syntax.Abs.Module
pModule :: [Token] -> Err Module
pModule = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Module)
pModule_internal
pListVarIdent :: [Token] -> Err [Language.Rzk.Syntax.Abs.VarIdent]
pListVarIdent :: [Token] -> Err [VarIdent]
pListVarIdent = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, [Pattern])
pListPattern_internal
pParam :: [Token] -> Err Language.Rzk.Syntax.Abs.Param
pParam :: [Token] -> Err Param
pParam = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, ParamDecl)
pParamDecl_internal
pRestriction :: [Token] -> Err Language.Rzk.Syntax.Abs.Restriction
pRestriction :: [Token] -> Err Restriction
pRestriction = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd 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 = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (a, b) -> b
snd forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, [Term])
pListTerm_internal
{-# LINE 1 "templates/GenericTemplate.hs" #-}
#if __GLASGOW_HASKELL__ > 706
#define LT(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.<# m)) :: Prelude.Bool)
#define GTE(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.>=# m)) :: Prelude.Bool)
#define EQ(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.==# m)) :: Prelude.Bool)
#else
#define LT(n,m) (n Happy_GHC_Exts.<# m)
#define GTE(n,m) (n Happy_GHC_Exts.>=# m)
#define EQ(n,m) (n Happy_GHC_Exts.==# m)
#endif
data Happy_IntList = HappyCons Happy_GHC_Exts.Int# Happy_IntList
infixr 9 `HappyStk`
data HappyStk a = HappyStk a (HappyStk a)
happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll
happyAccept 0# tk st sts (_ `HappyStk` ans `HappyStk` _) =
happyReturn1 ans
happyAccept j tk st sts (HappyStk ans _) =
(happyTcHack j (happyTcHack st)) (happyReturn1 ans)
happyDoAction i tk st
=
case action of
0# ->
happyFail (happyExpListPerState ((Happy_GHC_Exts.I# (st)) :: Prelude.Int)) i tk st
-1# ->
happyAccept i tk st
n | LT(n,(0# :: Happy_GHC_Exts.Int#)) ->
(happyReduceArr Happy_Data_Array.! rule) i tk st
where rule = (Happy_GHC_Exts.I# ((Happy_GHC_Exts.negateInt# ((n Happy_GHC_Exts.+# (1# :: Happy_GHC_Exts.Int#))))))
n ->
happyShift new_state i tk st
where new_state = (n Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#))
where off = happyAdjustOffset (indexShortOffAddr happyActOffsets st)
off_i = (off Happy_GHC_Exts.+# i)
check = if GTE(off_i,(0# :: Happy_GHC_Exts.Int#))
then EQ(indexShortOffAddr happyCheck off_i, i)
else Prelude.False
action
| check = indexShortOffAddr happyTable off_i
| Prelude.otherwise = indexShortOffAddr happyDefActions st
indexShortOffAddr (HappyA# arr) off =
Happy_GHC_Exts.narrow16Int# i
where
i = Happy_GHC_Exts.word2Int# (Happy_GHC_Exts.or# (Happy_GHC_Exts.uncheckedShiftL# high 8#) low)
high = Happy_GHC_Exts.int2Word# (Happy_GHC_Exts.ord# (Happy_GHC_Exts.indexCharOffAddr# arr (off' Happy_GHC_Exts.+# 1#)))
low = Happy_GHC_Exts.int2Word# (Happy_GHC_Exts.ord# (Happy_GHC_Exts.indexCharOffAddr# arr off'))
off' = off Happy_GHC_Exts.*# 2#
{-# INLINE happyLt #-}
happyLt x y = LT(x,y)
readArrayBit arr bit =
Bits.testBit (Happy_GHC_Exts.I# (indexShortOffAddr arr ((unbox_int bit) `Happy_GHC_Exts.iShiftRA#` 4#))) (bit `Prelude.mod` 16)
where unbox_int (Happy_GHC_Exts.I# x) = x
data HappyAddr = HappyA# Happy_GHC_Exts.Addr#
happyShift new_state 0# tk st sts stk@(x `HappyStk` _) =
let i = (case Happy_GHC_Exts.unsafeCoerce# x of { (Happy_GHC_Exts.I# (i)) -> i }) in
happyDoAction i tk new_state (HappyCons (st) (sts)) (stk)
happyShift new_state i tk st sts stk =
happyNewToken new_state (HappyCons (st) (sts)) ((happyInTok (tk))`HappyStk`stk)
happySpecReduce_0 i fn 0# tk st sts stk
= happyFail [] 0# tk st sts stk
happySpecReduce_0 nt fn j tk st@((action)) sts stk
= happyGoto nt j tk st (HappyCons (st) (sts)) (fn `HappyStk` stk)
happySpecReduce_1 i fn 0# tk st sts stk
= happyFail [] 0# tk st sts stk
happySpecReduce_1 nt fn j tk _ sts@((HappyCons (st@(action)) (_))) (v1`HappyStk`stk')
= let r = fn v1 in
happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
happySpecReduce_2 i fn 0# tk st sts stk
= happyFail [] 0# tk st sts stk
happySpecReduce_2 nt fn j tk _ (HappyCons (_) (sts@((HappyCons (st@(action)) (_))))) (v1`HappyStk`v2`HappyStk`stk')
= let r = fn v1 v2 in
happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
happySpecReduce_3 i fn 0# tk st sts stk
= happyFail [] 0# tk st sts stk
happySpecReduce_3 nt fn j tk _ (HappyCons (_) ((HappyCons (_) (sts@((HappyCons (st@(action)) (_))))))) (v1`HappyStk`v2`HappyStk`v3`HappyStk`stk')
= let r = fn v1 v2 v3 in
happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
happyReduce k i fn 0# tk st sts stk
= happyFail [] 0# tk st sts stk
happyReduce k nt fn j tk st sts stk
= case happyDrop (k Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#)) sts of
sts1@((HappyCons (st1@(action)) (_))) ->
let r = fn stk in
happyDoSeq r (happyGoto nt j tk st1 sts1 r)
happyMonadReduce k nt fn 0# tk st sts stk
= happyFail [] 0# tk st sts stk
happyMonadReduce k nt fn j tk st sts stk =
case happyDrop k (HappyCons (st) (sts)) of
sts1@((HappyCons (st1@(action)) (_))) ->
let drop_stk = happyDropStk k stk in
happyThen1 (fn stk tk) (\r -> happyGoto nt j tk st1 sts1 (r `HappyStk` drop_stk))
happyMonad2Reduce k nt fn 0# tk st sts stk
= happyFail [] 0# tk st sts stk
happyMonad2Reduce k nt fn j tk st sts stk =
case happyDrop k (HappyCons (st) (sts)) of
sts1@((HappyCons (st1@(action)) (_))) ->
let drop_stk = happyDropStk k stk
off = happyAdjustOffset (indexShortOffAddr happyGotoOffsets st1)
off_i = (off Happy_GHC_Exts.+# nt)
new_state = indexShortOffAddr happyTable off_i
in
happyThen1 (fn stk tk) (\r -> happyNewToken new_state sts1 (r `HappyStk` drop_stk))
happyDrop 0# l = l
happyDrop n (HappyCons (_) (t)) = happyDrop (n Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#)) t
happyDropStk 0# l = l
happyDropStk n (x `HappyStk` xs) = happyDropStk (n Happy_GHC_Exts.-# (1#::Happy_GHC_Exts.Int#)) xs
happyGoto nt j tk st =
happyDoAction j tk new_state
where off = happyAdjustOffset (indexShortOffAddr happyGotoOffsets st)
off_i = (off Happy_GHC_Exts.+# nt)
new_state = indexShortOffAddr happyTable off_i
happyFail explist 0# tk old_st _ stk@(x `HappyStk` _) =
let i = (case Happy_GHC_Exts.unsafeCoerce# x of { (Happy_GHC_Exts.I# (i)) -> i }) in
happyError_ explist i tk
happyFail explist i tk (action) sts stk =
happyDoAction 0# tk action sts ((Happy_GHC_Exts.unsafeCoerce# (Happy_GHC_Exts.I# (i))) `HappyStk` stk)
notHappyAtAll :: a
notHappyAtAll = Prelude.error "Internal Happy error\n"
happyTcHack :: Happy_GHC_Exts.Int# -> a -> a
happyTcHack x y = y
{-# INLINE happyTcHack #-}
happyDoSeq, happyDontSeq :: a -> b -> b
happyDoSeq a b = a `Prelude.seq` b
happyDontSeq a b = b
{-# 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 #-}