{-# OPTIONS_GHC -w #-}
{-# OPTIONS -XMagicHash -XBangPatterns -XTypeSynonymInstances -XFlexibleInstances -cpp #-}
#if __GLASGOW_HASKELL__ >= 710
{-# OPTIONS_GHC -XPartialTypeSignatures #-}
#endif
module Language.Fortran.Parser.Fortran66 ( expressionParser
                                         , statementParser
                                         , fortran66Parser
                                         , fortran66ParserWithModFiles )
where

import Prelude hiding (EQ,LT,GT) -- Same constructors exist in the AST

import Control.Monad.State
import Data.Maybe (isNothing, fromJust)
import qualified Data.ByteString.Char8 as B
import Language.Fortran.Util.Position
import Language.Fortran.Util.ModFile
import Language.Fortran.ParserMonad
import Language.Fortran.Lexer.FixedForm
import Language.Fortran.Transformer
import Language.Fortran.AST
import qualified Data.Array as Happy_Data_Array
import qualified Data.Bits as Bits
import qualified GHC.Exts as Happy_GHC_Exts
import Control.Applicative(Applicative(..))
import Control.Monad (ap)

-- parser produced by Happy Version 1.20.0

newtype HappyAbsSyn  = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
newtype HappyWrap6 = HappyWrap6 (ProgramFile A0)
happyIn6 :: (ProgramFile A0) -> (HappyAbsSyn )
happyIn6 :: ProgramFile A0 -> HappyAbsSyn
happyIn6 ProgramFile A0
x = HappyWrap6 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (ProgramFile A0 -> HappyWrap6
HappyWrap6 ProgramFile A0
x)
{-# INLINE happyIn6 #-}
happyOut6 :: (HappyAbsSyn ) -> HappyWrap6
happyOut6 :: HappyAbsSyn -> HappyWrap6
happyOut6 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap6
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut6 #-}
newtype HappyWrap7 = HappyWrap7 (ProgramFile A0)
happyIn7 :: (ProgramFile A0) -> (HappyAbsSyn )
happyIn7 :: ProgramFile A0 -> HappyAbsSyn
happyIn7 ProgramFile A0
x = HappyWrap7 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (ProgramFile A0 -> HappyWrap7
HappyWrap7 ProgramFile A0
x)
{-# INLINE happyIn7 #-}
happyOut7 :: (HappyAbsSyn ) -> HappyWrap7
happyOut7 :: HappyAbsSyn -> HappyWrap7
happyOut7 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap7
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut7 #-}
newtype HappyWrap8 = HappyWrap8 ([ ProgramUnit A0 ])
happyIn8 :: ([ ProgramUnit A0 ]) -> (HappyAbsSyn )
happyIn8 :: [ProgramUnit A0] -> HappyAbsSyn
happyIn8 [ProgramUnit A0]
x = HappyWrap8 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ([ProgramUnit A0] -> HappyWrap8
HappyWrap8 [ProgramUnit A0]
x)
{-# INLINE happyIn8 #-}
happyOut8 :: (HappyAbsSyn ) -> HappyWrap8
happyOut8 :: HappyAbsSyn -> HappyWrap8
happyOut8 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap8
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut8 #-}
newtype HappyWrap9 = HappyWrap9 (ProgramUnit A0)
happyIn9 :: (ProgramUnit A0) -> (HappyAbsSyn )
happyIn9 :: ProgramUnit A0 -> HappyAbsSyn
happyIn9 ProgramUnit A0
x = HappyWrap9 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (ProgramUnit A0 -> HappyWrap9
HappyWrap9 ProgramUnit A0
x)
{-# INLINE happyIn9 #-}
happyOut9 :: (HappyAbsSyn ) -> HappyWrap9
happyOut9 :: HappyAbsSyn -> HappyWrap9
happyOut9 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap9
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut9 #-}
newtype HappyWrap10 = HappyWrap10 (ProgramUnit A0)
happyIn10 :: (ProgramUnit A0) -> (HappyAbsSyn )
happyIn10 :: ProgramUnit A0 -> HappyAbsSyn
happyIn10 ProgramUnit A0
x = HappyWrap10 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (ProgramUnit A0 -> HappyWrap10
HappyWrap10 ProgramUnit A0
x)
{-# INLINE happyIn10 #-}
happyOut10 :: (HappyAbsSyn ) -> HappyWrap10
happyOut10 :: HappyAbsSyn -> HappyWrap10
happyOut10 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap10
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut10 #-}
newtype HappyWrap11 = HappyWrap11 (Maybe (AList Expression A0))
happyIn11 :: (Maybe (AList Expression A0)) -> (HappyAbsSyn )
happyIn11 :: Maybe (AList Expression A0) -> HappyAbsSyn
happyIn11 Maybe (AList Expression A0)
x = HappyWrap11 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Maybe (AList Expression A0) -> HappyWrap11
HappyWrap11 Maybe (AList Expression A0)
x)
{-# INLINE happyIn11 #-}
happyOut11 :: (HappyAbsSyn ) -> HappyWrap11
happyOut11 :: HappyAbsSyn -> HappyWrap11
happyOut11 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap11
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut11 #-}
newtype HappyWrap12 = HappyWrap12 (Name)
happyIn12 :: (Name) -> (HappyAbsSyn )
happyIn12 :: Name -> HappyAbsSyn
happyIn12 Name
x = HappyWrap12 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Name -> HappyWrap12
HappyWrap12 Name
x)
{-# INLINE happyIn12 #-}
happyOut12 :: (HappyAbsSyn ) -> HappyWrap12
happyOut12 :: HappyAbsSyn -> HappyWrap12
happyOut12 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap12
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut12 #-}
newtype HappyWrap13 = HappyWrap13 ([ Block A0 ])
happyIn13 :: ([ Block A0 ]) -> (HappyAbsSyn )
happyIn13 :: [Block A0] -> HappyAbsSyn
happyIn13 [Block A0]
x = HappyWrap13 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ([Block A0] -> HappyWrap13
HappyWrap13 [Block A0]
x)
{-# INLINE happyIn13 #-}
happyOut13 :: (HappyAbsSyn ) -> HappyWrap13
happyOut13 :: HappyAbsSyn -> HappyWrap13
happyOut13 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap13
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut13 #-}
newtype HappyWrap14 = HappyWrap14 (Block A0)
happyIn14 :: (Block A0) -> (HappyAbsSyn )
happyIn14 :: Block A0 -> HappyAbsSyn
happyIn14 Block A0
x = HappyWrap14 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Block A0 -> HappyWrap14
HappyWrap14 Block A0
x)
{-# INLINE happyIn14 #-}
happyOut14 :: (HappyAbsSyn ) -> HappyWrap14
happyOut14 :: HappyAbsSyn -> HappyWrap14
happyOut14 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap14
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut14 #-}
newtype HappyWrap15 = HappyWrap15 (Maybe Token)
happyIn15 :: (Maybe Token) -> (HappyAbsSyn )
happyIn15 :: Maybe Token -> HappyAbsSyn
happyIn15 Maybe Token
x = HappyWrap15 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Maybe Token -> HappyWrap15
HappyWrap15 Maybe Token
x)
{-# INLINE happyIn15 #-}
happyOut15 :: (HappyAbsSyn ) -> HappyWrap15
happyOut15 :: HappyAbsSyn -> HappyWrap15
happyOut15 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap15
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut15 #-}
newtype HappyWrap16 = HappyWrap16 (Token)
happyIn16 :: (Token) -> (HappyAbsSyn )
happyIn16 :: Token -> HappyAbsSyn
happyIn16 Token
x = HappyWrap16 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Token -> HappyWrap16
HappyWrap16 Token
x)
{-# INLINE happyIn16 #-}
happyOut16 :: (HappyAbsSyn ) -> HappyWrap16
happyOut16 :: HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap16
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut16 #-}
newtype HappyWrap17 = HappyWrap17 (Statement A0)
happyIn17 :: (Statement A0) -> (HappyAbsSyn )
happyIn17 :: Statement A0 -> HappyAbsSyn
happyIn17 Statement A0
x = HappyWrap17 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Statement A0 -> HappyWrap17
HappyWrap17 Statement A0
x)
{-# INLINE happyIn17 #-}
happyOut17 :: (HappyAbsSyn ) -> HappyWrap17
happyOut17 :: HappyAbsSyn -> HappyWrap17
happyOut17 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap17
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut17 #-}
newtype HappyWrap18 = HappyWrap18 (Statement A0)
happyIn18 :: (Statement A0) -> (HappyAbsSyn )
happyIn18 :: Statement A0 -> HappyAbsSyn
happyIn18 Statement A0
x = HappyWrap18 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Statement A0 -> HappyWrap18
HappyWrap18 Statement A0
x)
{-# INLINE happyIn18 #-}
happyOut18 :: (HappyAbsSyn ) -> HappyWrap18
happyOut18 :: HappyAbsSyn -> HappyWrap18
happyOut18 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap18
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut18 #-}
newtype HappyWrap19 = HappyWrap19 (Statement A0)
happyIn19 :: (Statement A0) -> (HappyAbsSyn )
happyIn19 :: Statement A0 -> HappyAbsSyn
happyIn19 Statement A0
x = HappyWrap19 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Statement A0 -> HappyWrap19
HappyWrap19 Statement A0
x)
{-# INLINE happyIn19 #-}
happyOut19 :: (HappyAbsSyn ) -> HappyWrap19
happyOut19 :: HappyAbsSyn -> HappyWrap19
happyOut19 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap19
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut19 #-}
newtype HappyWrap20 = HappyWrap20 (DoSpecification A0)
happyIn20 :: (DoSpecification A0) -> (HappyAbsSyn )
happyIn20 :: DoSpecification A0 -> HappyAbsSyn
happyIn20 DoSpecification A0
x = HappyWrap20 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (DoSpecification A0 -> HappyWrap20
HappyWrap20 DoSpecification A0
x)
{-# INLINE happyIn20 #-}
happyOut20 :: (HappyAbsSyn ) -> HappyWrap20
happyOut20 :: HappyAbsSyn -> HappyWrap20
happyOut20 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap20
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut20 #-}
newtype HappyWrap21 = HappyWrap21 (Expression A0)
happyIn21 :: (Expression A0) -> (HappyAbsSyn )
happyIn21 :: Expression A0 -> HappyAbsSyn
happyIn21 Expression A0
x = HappyWrap21 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap21
HappyWrap21 Expression A0
x)
{-# INLINE happyIn21 #-}
happyOut21 :: (HappyAbsSyn ) -> HappyWrap21
happyOut21 :: HappyAbsSyn -> HappyWrap21
happyOut21 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap21
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut21 #-}
newtype HappyWrap22 = HappyWrap22 (Statement A0)
happyIn22 :: (Statement A0) -> (HappyAbsSyn )
happyIn22 :: Statement A0 -> HappyAbsSyn
happyIn22 Statement A0
x = HappyWrap22 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Statement A0 -> HappyWrap22
HappyWrap22 Statement A0
x)
{-# INLINE happyIn22 #-}
happyOut22 :: (HappyAbsSyn ) -> HappyWrap22
happyOut22 :: HappyAbsSyn -> HappyWrap22
happyOut22 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap22
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut22 #-}
newtype HappyWrap23 = HappyWrap23 (Statement A0)
happyIn23 :: (Statement A0) -> (HappyAbsSyn )
happyIn23 :: Statement A0 -> HappyAbsSyn
happyIn23 Statement A0
x = HappyWrap23 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Statement A0 -> HappyWrap23
HappyWrap23 Statement A0
x)
{-# INLINE happyIn23 #-}
happyOut23 :: (HappyAbsSyn ) -> HappyWrap23
happyOut23 :: HappyAbsSyn -> HappyWrap23
happyOut23 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap23
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut23 #-}
newtype HappyWrap24 = HappyWrap24 (Statement A0)
happyIn24 :: (Statement A0) -> (HappyAbsSyn )
happyIn24 :: Statement A0 -> HappyAbsSyn
happyIn24 Statement A0
x = HappyWrap24 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Statement A0 -> HappyWrap24
HappyWrap24 Statement A0
x)
{-# INLINE happyIn24 #-}
happyOut24 :: (HappyAbsSyn ) -> HappyWrap24
happyOut24 :: HappyAbsSyn -> HappyWrap24
happyOut24 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap24
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut24 #-}
newtype HappyWrap25 = HappyWrap25 ((AList ControlPair A0, Maybe (AList Expression A0)))
happyIn25 :: ((AList ControlPair A0, Maybe (AList Expression A0))) -> (HappyAbsSyn )
happyIn25 :: (AList ControlPair A0, Maybe (AList Expression A0)) -> HappyAbsSyn
happyIn25 (AList ControlPair A0, Maybe (AList Expression A0))
x = HappyWrap25 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ((AList ControlPair A0, Maybe (AList Expression A0)) -> HappyWrap25
HappyWrap25 (AList ControlPair A0, Maybe (AList Expression A0))
x)
{-# INLINE happyIn25 #-}
happyOut25 :: (HappyAbsSyn ) -> HappyWrap25
happyOut25 :: HappyAbsSyn -> HappyWrap25
happyOut25 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap25
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut25 #-}
newtype HappyWrap26 = HappyWrap26 (Expression A0)
happyIn26 :: (Expression A0) -> (HappyAbsSyn )
happyIn26 :: Expression A0 -> HappyAbsSyn
happyIn26 Expression A0
x = HappyWrap26 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap26
HappyWrap26 Expression A0
x)
{-# INLINE happyIn26 #-}
happyOut26 :: (HappyAbsSyn ) -> HappyWrap26
happyOut26 :: HappyAbsSyn -> HappyWrap26
happyOut26 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap26
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut26 #-}
newtype HappyWrap27 = HappyWrap27 (Expression A0)
happyIn27 :: (Expression A0) -> (HappyAbsSyn )
happyIn27 :: Expression A0 -> HappyAbsSyn
happyIn27 Expression A0
x = HappyWrap27 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap27
HappyWrap27 Expression A0
x)
{-# INLINE happyIn27 #-}
happyOut27 :: (HappyAbsSyn ) -> HappyWrap27
happyOut27 :: HappyAbsSyn -> HappyWrap27
happyOut27 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap27
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut27 #-}
newtype HappyWrap28 = HappyWrap28 (AList Expression A0)
happyIn28 :: (AList Expression A0) -> (HappyAbsSyn )
happyIn28 :: AList Expression A0 -> HappyAbsSyn
happyIn28 AList Expression A0
x = HappyWrap28 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (AList Expression A0 -> HappyWrap28
HappyWrap28 AList Expression A0
x)
{-# INLINE happyIn28 #-}
happyOut28 :: (HappyAbsSyn ) -> HappyWrap28
happyOut28 :: HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap28
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut28 #-}
newtype HappyWrap29 = HappyWrap29 (Expression A0)
happyIn29 :: (Expression A0) -> (HappyAbsSyn )
happyIn29 :: Expression A0 -> HappyAbsSyn
happyIn29 Expression A0
x = HappyWrap29 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap29
HappyWrap29 Expression A0
x)
{-# INLINE happyIn29 #-}
happyOut29 :: (HappyAbsSyn ) -> HappyWrap29
happyOut29 :: HappyAbsSyn -> HappyWrap29
happyOut29 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap29
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut29 #-}
newtype HappyWrap30 = HappyWrap30 (Expression A0)
happyIn30 :: (Expression A0) -> (HappyAbsSyn )
happyIn30 :: Expression A0 -> HappyAbsSyn
happyIn30 Expression A0
x = HappyWrap30 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap30
HappyWrap30 Expression A0
x)
{-# INLINE happyIn30 #-}
happyOut30 :: (HappyAbsSyn ) -> HappyWrap30
happyOut30 :: HappyAbsSyn -> HappyWrap30
happyOut30 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap30
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut30 #-}
newtype HappyWrap31 = HappyWrap31 (AList DataGroup A0)
happyIn31 :: (AList DataGroup A0) -> (HappyAbsSyn )
happyIn31 :: AList DataGroup A0 -> HappyAbsSyn
happyIn31 AList DataGroup A0
x = HappyWrap31 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (AList DataGroup A0 -> HappyWrap31
HappyWrap31 AList DataGroup A0
x)
{-# INLINE happyIn31 #-}
happyOut31 :: (HappyAbsSyn ) -> HappyWrap31
happyOut31 :: HappyAbsSyn -> HappyWrap31
happyOut31 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap31
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut31 #-}
newtype HappyWrap32 = HappyWrap32 (AList Expression A0)
happyIn32 :: (AList Expression A0) -> (HappyAbsSyn )
happyIn32 :: AList Expression A0 -> HappyAbsSyn
happyIn32 AList Expression A0
x = HappyWrap32 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (AList Expression A0 -> HappyWrap32
HappyWrap32 AList Expression A0
x)
{-# INLINE happyIn32 #-}
happyOut32 :: (HappyAbsSyn ) -> HappyWrap32
happyOut32 :: HappyAbsSyn -> HappyWrap32
happyOut32 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap32
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut32 #-}
newtype HappyWrap33 = HappyWrap33 (Expression A0)
happyIn33 :: (Expression A0) -> (HappyAbsSyn )
happyIn33 :: Expression A0 -> HappyAbsSyn
happyIn33 Expression A0
x = HappyWrap33 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap33
HappyWrap33 Expression A0
x)
{-# INLINE happyIn33 #-}
happyOut33 :: (HappyAbsSyn ) -> HappyWrap33
happyOut33 :: HappyAbsSyn -> HappyWrap33
happyOut33 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap33
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut33 #-}
newtype HappyWrap34 = HappyWrap34 (Expression A0)
happyIn34 :: (Expression A0) -> (HappyAbsSyn )
happyIn34 :: Expression A0 -> HappyAbsSyn
happyIn34 Expression A0
x = HappyWrap34 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap34
HappyWrap34 Expression A0
x)
{-# INLINE happyIn34 #-}
happyOut34 :: (HappyAbsSyn ) -> HappyWrap34
happyOut34 :: HappyAbsSyn -> HappyWrap34
happyOut34 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap34
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut34 #-}
newtype HappyWrap35 = HappyWrap35 (AList (AList Expression) A0)
happyIn35 :: (AList (AList Expression) A0) -> (HappyAbsSyn )
happyIn35 :: AList (AList Expression) A0 -> HappyAbsSyn
happyIn35 AList (AList Expression) A0
x = HappyWrap35 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (AList (AList Expression) A0 -> HappyWrap35
HappyWrap35 AList (AList Expression) A0
x)
{-# INLINE happyIn35 #-}
happyOut35 :: (HappyAbsSyn ) -> HappyWrap35
happyOut35 :: HappyAbsSyn -> HappyWrap35
happyOut35 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap35
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut35 #-}
newtype HappyWrap36 = HappyWrap36 (AList CommonGroup A0)
happyIn36 :: (AList CommonGroup A0) -> (HappyAbsSyn )
happyIn36 :: AList CommonGroup A0 -> HappyAbsSyn
happyIn36 AList CommonGroup A0
x = HappyWrap36 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (AList CommonGroup A0 -> HappyWrap36
HappyWrap36 AList CommonGroup A0
x)
{-# INLINE happyIn36 #-}
happyOut36 :: (HappyAbsSyn ) -> HappyWrap36
happyOut36 :: HappyAbsSyn -> HappyWrap36
happyOut36 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap36
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut36 #-}
newtype HappyWrap37 = HappyWrap37 (CommonGroup A0)
happyIn37 :: (CommonGroup A0) -> (HappyAbsSyn )
happyIn37 :: CommonGroup A0 -> HappyAbsSyn
happyIn37 CommonGroup A0
x = HappyWrap37 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (CommonGroup A0 -> HappyWrap37
HappyWrap37 CommonGroup A0
x)
{-# INLINE happyIn37 #-}
happyOut37 :: (HappyAbsSyn ) -> HappyWrap37
happyOut37 :: HappyAbsSyn -> HappyWrap37
happyOut37 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap37
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut37 #-}
newtype HappyWrap38 = HappyWrap38 (CommonGroup A0)
happyIn38 :: (CommonGroup A0) -> (HappyAbsSyn )
happyIn38 :: CommonGroup A0 -> HappyAbsSyn
happyIn38 CommonGroup A0
x = HappyWrap38 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (CommonGroup A0 -> HappyWrap38
HappyWrap38 CommonGroup A0
x)
{-# INLINE happyIn38 #-}
happyOut38 :: (HappyAbsSyn ) -> HappyWrap38
happyOut38 :: HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap38
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut38 #-}
newtype HappyWrap39 = HappyWrap39 (Expression A0)
happyIn39 :: (Expression A0) -> (HappyAbsSyn )
happyIn39 :: Expression A0 -> HappyAbsSyn
happyIn39 Expression A0
x = HappyWrap39 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap39
HappyWrap39 Expression A0
x)
{-# INLINE happyIn39 #-}
happyOut39 :: (HappyAbsSyn ) -> HappyWrap39
happyOut39 :: HappyAbsSyn -> HappyWrap39
happyOut39 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap39
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut39 #-}
newtype HappyWrap40 = HappyWrap40 (AList Expression A0)
happyIn40 :: (AList Expression A0) -> (HappyAbsSyn )
happyIn40 :: AList Expression A0 -> HappyAbsSyn
happyIn40 AList Expression A0
x = HappyWrap40 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (AList Expression A0 -> HappyWrap40
HappyWrap40 AList Expression A0
x)
{-# INLINE happyIn40 #-}
happyOut40 :: (HappyAbsSyn ) -> HappyWrap40
happyOut40 :: HappyAbsSyn -> HappyWrap40
happyOut40 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap40
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut40 #-}
newtype HappyWrap41 = HappyWrap41 (Expression A0)
happyIn41 :: (Expression A0) -> (HappyAbsSyn )
happyIn41 :: Expression A0 -> HappyAbsSyn
happyIn41 Expression A0
x = HappyWrap41 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap41
HappyWrap41 Expression A0
x)
{-# INLINE happyIn41 #-}
happyOut41 :: (HappyAbsSyn ) -> HappyWrap41
happyOut41 :: HappyAbsSyn -> HappyWrap41
happyOut41 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap41
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut41 #-}
newtype HappyWrap42 = HappyWrap42 (AList Declarator A0)
happyIn42 :: (AList Declarator A0) -> (HappyAbsSyn )
happyIn42 :: AList Declarator A0 -> HappyAbsSyn
happyIn42 AList Declarator A0
x = HappyWrap42 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (AList Declarator A0 -> HappyWrap42
HappyWrap42 AList Declarator A0
x)
{-# INLINE happyIn42 #-}
happyOut42 :: (HappyAbsSyn ) -> HappyWrap42
happyOut42 :: HappyAbsSyn -> HappyWrap42
happyOut42 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap42
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut42 #-}
newtype HappyWrap43 = HappyWrap43 (Declarator A0)
happyIn43 :: (Declarator A0) -> (HappyAbsSyn )
happyIn43 :: Declarator A0 -> HappyAbsSyn
happyIn43 Declarator A0
x = HappyWrap43 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Declarator A0 -> HappyWrap43
HappyWrap43 Declarator A0
x)
{-# INLINE happyIn43 #-}
happyOut43 :: (HappyAbsSyn ) -> HappyWrap43
happyOut43 :: HappyAbsSyn -> HappyWrap43
happyOut43 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap43
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut43 #-}
newtype HappyWrap44 = HappyWrap44 (AList Declarator A0)
happyIn44 :: (AList Declarator A0) -> (HappyAbsSyn )
happyIn44 :: AList Declarator A0 -> HappyAbsSyn
happyIn44 AList Declarator A0
x = HappyWrap44 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (AList Declarator A0 -> HappyWrap44
HappyWrap44 AList Declarator A0
x)
{-# INLINE happyIn44 #-}
happyOut44 :: (HappyAbsSyn ) -> HappyWrap44
happyOut44 :: HappyAbsSyn -> HappyWrap44
happyOut44 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap44
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut44 #-}
newtype HappyWrap45 = HappyWrap45 (Declarator A0)
happyIn45 :: (Declarator A0) -> (HappyAbsSyn )
happyIn45 :: Declarator A0 -> HappyAbsSyn
happyIn45 Declarator A0
x = HappyWrap45 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Declarator A0 -> HappyWrap45
HappyWrap45 Declarator A0
x)
{-# INLINE happyIn45 #-}
happyOut45 :: (HappyAbsSyn ) -> HappyWrap45
happyOut45 :: HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap45
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut45 #-}
newtype HappyWrap46 = HappyWrap46 (AList DimensionDeclarator A0)
happyIn46 :: (AList DimensionDeclarator A0) -> (HappyAbsSyn )
happyIn46 :: AList DimensionDeclarator A0 -> HappyAbsSyn
happyIn46 AList DimensionDeclarator A0
x = HappyWrap46 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (AList DimensionDeclarator A0 -> HappyWrap46
HappyWrap46 AList DimensionDeclarator A0
x)
{-# INLINE happyIn46 #-}
happyOut46 :: (HappyAbsSyn ) -> HappyWrap46
happyOut46 :: HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap46
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut46 #-}
newtype HappyWrap47 = HappyWrap47 (DimensionDeclarator A0)
happyIn47 :: (DimensionDeclarator A0) -> (HappyAbsSyn )
happyIn47 :: DimensionDeclarator A0 -> HappyAbsSyn
happyIn47 DimensionDeclarator A0
x = HappyWrap47 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (DimensionDeclarator A0 -> HappyWrap47
HappyWrap47 DimensionDeclarator A0
x)
{-# INLINE happyIn47 #-}
happyOut47 :: (HappyAbsSyn ) -> HappyWrap47
happyOut47 :: HappyAbsSyn -> HappyWrap47
happyOut47 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap47
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut47 #-}
newtype HappyWrap48 = HappyWrap48 (Declarator A0)
happyIn48 :: (Declarator A0) -> (HappyAbsSyn )
happyIn48 :: Declarator A0 -> HappyAbsSyn
happyIn48 Declarator A0
x = HappyWrap48 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Declarator A0 -> HappyWrap48
HappyWrap48 Declarator A0
x)
{-# INLINE happyIn48 #-}
happyOut48 :: (HappyAbsSyn ) -> HappyWrap48
happyOut48 :: HappyAbsSyn -> HappyWrap48
happyOut48 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap48
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut48 #-}
newtype HappyWrap49 = HappyWrap49 (AList Expression A0)
happyIn49 :: (AList Expression A0) -> (HappyAbsSyn )
happyIn49 :: AList Expression A0 -> HappyAbsSyn
happyIn49 AList Expression A0
x = HappyWrap49 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (AList Expression A0 -> HappyWrap49
HappyWrap49 AList Expression A0
x)
{-# INLINE happyIn49 #-}
happyOut49 :: (HappyAbsSyn ) -> HappyWrap49
happyOut49 :: HappyAbsSyn -> HappyWrap49
happyOut49 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap49
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut49 #-}
newtype HappyWrap50 = HappyWrap50 (AList Argument A0)
happyIn50 :: (AList Argument A0) -> (HappyAbsSyn )
happyIn50 :: AList Argument A0 -> HappyAbsSyn
happyIn50 AList Argument A0
x = HappyWrap50 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (AList Argument A0 -> HappyWrap50
HappyWrap50 AList Argument A0
x)
{-# INLINE happyIn50 #-}
happyOut50 :: (HappyAbsSyn ) -> HappyWrap50
happyOut50 :: HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap50
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut50 #-}
newtype HappyWrap51 = HappyWrap51 (AList Argument A0)
happyIn51 :: (AList Argument A0) -> (HappyAbsSyn )
happyIn51 :: AList Argument A0 -> HappyAbsSyn
happyIn51 AList Argument A0
x = HappyWrap51 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (AList Argument A0 -> HappyWrap51
HappyWrap51 AList Argument A0
x)
{-# INLINE happyIn51 #-}
happyOut51 :: (HappyAbsSyn ) -> HappyWrap51
happyOut51 :: HappyAbsSyn -> HappyWrap51
happyOut51 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap51
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut51 #-}
newtype HappyWrap52 = HappyWrap52 (Argument A0)
happyIn52 :: (Argument A0) -> (HappyAbsSyn )
happyIn52 :: Argument A0 -> HappyAbsSyn
happyIn52 Argument A0
x = HappyWrap52 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Argument A0 -> HappyWrap52
HappyWrap52 Argument A0
x)
{-# INLINE happyIn52 #-}
happyOut52 :: (HappyAbsSyn ) -> HappyWrap52
happyOut52 :: HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap52
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut52 #-}
newtype HappyWrap53 = HappyWrap53 (Expression A0)
happyIn53 :: (Expression A0) -> (HappyAbsSyn )
happyIn53 :: Expression A0 -> HappyAbsSyn
happyIn53 Expression A0
x = HappyWrap53 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap53
HappyWrap53 Expression A0
x)
{-# INLINE happyIn53 #-}
happyOut53 :: (HappyAbsSyn ) -> HappyWrap53
happyOut53 :: HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap53
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut53 #-}
newtype HappyWrap54 = HappyWrap54 (BinaryOp)
happyIn54 :: (BinaryOp) -> (HappyAbsSyn )
happyIn54 :: BinaryOp -> HappyAbsSyn
happyIn54 BinaryOp
x = HappyWrap54 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (BinaryOp -> HappyWrap54
HappyWrap54 BinaryOp
x)
{-# INLINE happyIn54 #-}
happyOut54 :: (HappyAbsSyn ) -> HappyWrap54
happyOut54 :: HappyAbsSyn -> HappyWrap54
happyOut54 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap54
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut54 #-}
newtype HappyWrap55 = HappyWrap55 (Expression A0)
happyIn55 :: (Expression A0) -> (HappyAbsSyn )
happyIn55 :: Expression A0 -> HappyAbsSyn
happyIn55 Expression A0
x = HappyWrap55 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap55
HappyWrap55 Expression A0
x)
{-# INLINE happyIn55 #-}
happyOut55 :: (HappyAbsSyn ) -> HappyWrap55
happyOut55 :: HappyAbsSyn -> HappyWrap55
happyOut55 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap55
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut55 #-}
newtype HappyWrap56 = HappyWrap56 ([ Index A0 ])
happyIn56 :: ([ Index A0 ]) -> (HappyAbsSyn )
happyIn56 :: [Index A0] -> HappyAbsSyn
happyIn56 [Index A0]
x = HappyWrap56 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ([Index A0] -> HappyWrap56
HappyWrap56 [Index A0]
x)
{-# INLINE happyIn56 #-}
happyOut56 :: (HappyAbsSyn ) -> HappyWrap56
happyOut56 :: HappyAbsSyn -> HappyWrap56
happyOut56 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap56
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut56 #-}
newtype HappyWrap57 = HappyWrap57 ((SrcSpan, UnaryOp))
happyIn57 :: ((SrcSpan, UnaryOp)) -> (HappyAbsSyn )
happyIn57 :: (SrcSpan, UnaryOp) -> HappyAbsSyn
happyIn57 (SrcSpan, UnaryOp)
x = HappyWrap57 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ((SrcSpan, UnaryOp) -> HappyWrap57
HappyWrap57 (SrcSpan, UnaryOp)
x)
{-# INLINE happyIn57 #-}
happyOut57 :: (HappyAbsSyn ) -> HappyWrap57
happyOut57 :: HappyAbsSyn -> HappyWrap57
happyOut57 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap57
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut57 #-}
newtype HappyWrap58 = HappyWrap58 (Maybe (AList Expression A0))
happyIn58 :: (Maybe (AList Expression A0)) -> (HappyAbsSyn )
happyIn58 :: Maybe (AList Expression A0) -> HappyAbsSyn
happyIn58 Maybe (AList Expression A0)
x = HappyWrap58 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Maybe (AList Expression A0) -> HappyWrap58
HappyWrap58 Maybe (AList Expression A0)
x)
{-# INLINE happyIn58 #-}
happyOut58 :: (HappyAbsSyn ) -> HappyWrap58
happyOut58 :: HappyAbsSyn -> HappyWrap58
happyOut58 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap58
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut58 #-}
newtype HappyWrap59 = HappyWrap59 ([ Expression A0 ])
happyIn59 :: ([ Expression A0 ]) -> (HappyAbsSyn )
happyIn59 :: [Expression A0] -> HappyAbsSyn
happyIn59 [Expression A0]
x = HappyWrap59 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ([Expression A0] -> HappyWrap59
HappyWrap59 [Expression A0]
x)
{-# INLINE happyIn59 #-}
happyOut59 :: (HappyAbsSyn ) -> HappyWrap59
happyOut59 :: HappyAbsSyn -> HappyWrap59
happyOut59 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap59
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut59 #-}
newtype HappyWrap60 = HappyWrap60 (Expression A0)
happyIn60 :: (Expression A0) -> (HappyAbsSyn )
happyIn60 :: Expression A0 -> HappyAbsSyn
happyIn60 Expression A0
x = HappyWrap60 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap60
HappyWrap60 Expression A0
x)
{-# INLINE happyIn60 #-}
happyOut60 :: (HappyAbsSyn ) -> HappyWrap60
happyOut60 :: HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap60
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut60 #-}
newtype HappyWrap61 = HappyWrap61 (Expression A0)
happyIn61 :: (Expression A0) -> (HappyAbsSyn )
happyIn61 :: Expression A0 -> HappyAbsSyn
happyIn61 Expression A0
x = HappyWrap61 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap61
HappyWrap61 Expression A0
x)
{-# INLINE happyIn61 #-}
happyOut61 :: (HappyAbsSyn ) -> HappyWrap61
happyOut61 :: HappyAbsSyn -> HappyWrap61
happyOut61 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap61
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut61 #-}
newtype HappyWrap62 = HappyWrap62 (Expression A0)
happyIn62 :: (Expression A0) -> (HappyAbsSyn )
happyIn62 :: Expression A0 -> HappyAbsSyn
happyIn62 Expression A0
x = HappyWrap62 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap62
HappyWrap62 Expression A0
x)
{-# INLINE happyIn62 #-}
happyOut62 :: (HappyAbsSyn ) -> HappyWrap62
happyOut62 :: HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap62
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut62 #-}
newtype HappyWrap63 = HappyWrap63 (Expression A0)
happyIn63 :: (Expression A0) -> (HappyAbsSyn )
happyIn63 :: Expression A0 -> HappyAbsSyn
happyIn63 Expression A0
x = HappyWrap63 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap63
HappyWrap63 Expression A0
x)
{-# INLINE happyIn63 #-}
happyOut63 :: (HappyAbsSyn ) -> HappyWrap63
happyOut63 :: HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap63
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut63 #-}
newtype HappyWrap64 = HappyWrap64 (Expression A0)
happyIn64 :: (Expression A0) -> (HappyAbsSyn )
happyIn64 :: Expression A0 -> HappyAbsSyn
happyIn64 Expression A0
x = HappyWrap64 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap64
HappyWrap64 Expression A0
x)
{-# INLINE happyIn64 #-}
happyOut64 :: (HappyAbsSyn ) -> HappyWrap64
happyOut64 :: HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap64
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut64 #-}
newtype HappyWrap65 = HappyWrap65 (Maybe (SrcSpan, String))
happyIn65 :: (Maybe (SrcSpan, String)) -> (HappyAbsSyn )
happyIn65 :: Maybe (SrcSpan, Name) -> HappyAbsSyn
happyIn65 Maybe (SrcSpan, Name)
x = HappyWrap65 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Maybe (SrcSpan, Name) -> HappyWrap65
HappyWrap65 Maybe (SrcSpan, Name)
x)
{-# INLINE happyIn65 #-}
happyOut65 :: (HappyAbsSyn ) -> HappyWrap65
happyOut65 :: HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap65
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut65 #-}
newtype HappyWrap66 = HappyWrap66 ((SrcSpan, String))
happyIn66 :: ((SrcSpan, String)) -> (HappyAbsSyn )
happyIn66 :: (SrcSpan, Name) -> HappyAbsSyn
happyIn66 (SrcSpan, Name)
x = HappyWrap66 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# ((SrcSpan, Name) -> HappyWrap66
HappyWrap66 (SrcSpan, Name)
x)
{-# INLINE happyIn66 #-}
happyOut66 :: (HappyAbsSyn ) -> HappyWrap66
happyOut66 :: HappyAbsSyn -> HappyWrap66
happyOut66 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap66
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut66 #-}
newtype HappyWrap67 = HappyWrap67 (Expression A0)
happyIn67 :: (Expression A0) -> (HappyAbsSyn )
happyIn67 :: Expression A0 -> HappyAbsSyn
happyIn67 Expression A0
x = HappyWrap67 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap67
HappyWrap67 Expression A0
x)
{-# INLINE happyIn67 #-}
happyOut67 :: (HappyAbsSyn ) -> HappyWrap67
happyOut67 :: HappyAbsSyn -> HappyWrap67
happyOut67 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap67
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut67 #-}
newtype HappyWrap68 = HappyWrap68 (Expression A0)
happyIn68 :: (Expression A0) -> (HappyAbsSyn )
happyIn68 :: Expression A0 -> HappyAbsSyn
happyIn68 Expression A0
x = HappyWrap68 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap68
HappyWrap68 Expression A0
x)
{-# INLINE happyIn68 #-}
happyOut68 :: (HappyAbsSyn ) -> HappyWrap68
happyOut68 :: HappyAbsSyn -> HappyWrap68
happyOut68 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap68
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut68 #-}
newtype HappyWrap69 = HappyWrap69 (Expression A0)
happyIn69 :: (Expression A0) -> (HappyAbsSyn )
happyIn69 :: Expression A0 -> HappyAbsSyn
happyIn69 Expression A0
x = HappyWrap69 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap69
HappyWrap69 Expression A0
x)
{-# INLINE happyIn69 #-}
happyOut69 :: (HappyAbsSyn ) -> HappyWrap69
happyOut69 :: HappyAbsSyn -> HappyWrap69
happyOut69 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap69
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut69 #-}
newtype HappyWrap70 = HappyWrap70 (Expression A0)
happyIn70 :: (Expression A0) -> (HappyAbsSyn )
happyIn70 :: Expression A0 -> HappyAbsSyn
happyIn70 Expression A0
x = HappyWrap70 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap70
HappyWrap70 Expression A0
x)
{-# INLINE happyIn70 #-}
happyOut70 :: (HappyAbsSyn ) -> HappyWrap70
happyOut70 :: HappyAbsSyn -> HappyWrap70
happyOut70 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap70
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut70 #-}
newtype HappyWrap71 = HappyWrap71 (AList Expression A0)
happyIn71 :: (AList Expression A0) -> (HappyAbsSyn )
happyIn71 :: AList Expression A0 -> HappyAbsSyn
happyIn71 AList Expression A0
x = HappyWrap71 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (AList Expression A0 -> HappyWrap71
HappyWrap71 AList Expression A0
x)
{-# INLINE happyIn71 #-}
happyOut71 :: (HappyAbsSyn ) -> HappyWrap71
happyOut71 :: HappyAbsSyn -> HappyWrap71
happyOut71 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap71
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut71 #-}
newtype HappyWrap72 = HappyWrap72 (AList Expression A0)
happyIn72 :: (AList Expression A0) -> (HappyAbsSyn )
happyIn72 :: AList Expression A0 -> HappyAbsSyn
happyIn72 AList Expression A0
x = HappyWrap72 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (AList Expression A0 -> HappyWrap72
HappyWrap72 AList Expression A0
x)
{-# INLINE happyIn72 #-}
happyOut72 :: (HappyAbsSyn ) -> HappyWrap72
happyOut72 :: HappyAbsSyn -> HappyWrap72
happyOut72 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap72
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut72 #-}
newtype HappyWrap73 = HappyWrap73 (Expression A0)
happyIn73 :: (Expression A0) -> (HappyAbsSyn )
happyIn73 :: Expression A0 -> HappyAbsSyn
happyIn73 Expression A0
x = HappyWrap73 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap73
HappyWrap73 Expression A0
x)
{-# INLINE happyIn73 #-}
happyOut73 :: (HappyAbsSyn ) -> HappyWrap73
happyOut73 :: HappyAbsSyn -> HappyWrap73
happyOut73 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap73
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut73 #-}
newtype HappyWrap74 = HappyWrap74 (Expression A0)
happyIn74 :: (Expression A0) -> (HappyAbsSyn )
happyIn74 :: Expression A0 -> HappyAbsSyn
happyIn74 Expression A0
x = HappyWrap74 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (Expression A0 -> HappyWrap74
HappyWrap74 Expression A0
x)
{-# INLINE happyIn74 #-}
happyOut74 :: (HappyAbsSyn ) -> HappyWrap74
happyOut74 :: HappyAbsSyn -> HappyWrap74
happyOut74 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap74
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut74 #-}
newtype HappyWrap75 = HappyWrap75 (TypeSpec A0)
happyIn75 :: (TypeSpec A0) -> (HappyAbsSyn )
happyIn75 :: TypeSpec A0 -> HappyAbsSyn
happyIn75 TypeSpec A0
x = HappyWrap75 -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# (TypeSpec A0 -> HappyWrap75
HappyWrap75 TypeSpec A0
x)
{-# INLINE happyIn75 #-}
happyOut75 :: (HappyAbsSyn ) -> HappyWrap75
happyOut75 :: HappyAbsSyn -> HappyWrap75
happyOut75 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap75
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut75 #-}
happyInTok :: (Token) -> (HappyAbsSyn )
happyInTok :: Token -> HappyAbsSyn
happyInTok Token
x = Token -> HappyAbsSyn
Happy_GHC_Exts.unsafeCoerce# Token
x
{-# INLINE happyInTok #-}
happyOutTok :: (HappyAbsSyn ) -> (Token)
happyOutTok :: HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
x = HappyAbsSyn -> Token
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOutTok #-}


happyExpList :: HappyAddr
happyExpList :: HappyAddr
happyExpList = Addr# -> HappyAddr
HappyA# Addr#
"\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf4\xff\xff\x0f\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x04\x00\x00\x00\xe8\x20\x10\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\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\xc0\xdf\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x48\x00\x00\x00\x80\x0e\x02\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x04\x00\x00\x00\xe8\x20\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\x40\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x48\x00\x00\x00\x80\x0e\x02\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\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\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x20\x00\x40\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\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\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\x80\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\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x10\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\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\xf5\xff\xff\x0f\x00\xc0\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf4\xff\xff\x0f\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x78\xfd\xff\xff\x03\x00\xb0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x10\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\x40\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\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\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\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x01\x00\x00\x00\x3a\x08\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\x01\x00\x00\x00\x3a\x08\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x48\x00\x00\x00\x80\x0e\x02\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1f\x3f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x06\x00\x00\x00\x00\x00\x00\x00\x00\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\x01\x00\x00\x00\xc0\xdf\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x01\x00\x00\x00\x3a\x08\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x04\x00\x00\x00\xe8\x20\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x01\x00\x00\x00\x3a\x08\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x48\x00\x00\x00\x80\x0e\x02\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x12\x00\x00\x00\xa0\x83\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x04\x00\x00\x00\xe8\x20\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x01\x00\x00\x00\x3a\x08\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x48\x00\x00\x00\x80\x0e\x02\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x12\x00\x00\x00\xa0\x83\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc0\xc7\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf0\xf5\x03\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\x04\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\xc0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x70\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\xc8\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\xc0\xdf\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf0\xf7\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x04\x00\x00\x00\xe8\x20\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\xc0\xdf\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x12\x00\x00\x00\xa0\x83\x40\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\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x04\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\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\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x48\x00\x00\x00\x80\x0e\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x04\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\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\x02\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\x40\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\x04\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\x40\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\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xfd\xff\xff\x03\x00\xb0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\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\x01\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\xc8\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x02\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x7f\x3f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x48\x00\x00\x00\x80\x0e\x02\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf4\xf7\x01\x20\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\x0c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf0\xf7\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x12\x00\x00\x00\xa0\x83\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\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\xc0\xdf\x0f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x48\x00\x00\x00\x80\x0e\x02\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\x02\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x04\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\x0c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x04\x00\x00\x00\xe8\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\x12\x00\x00\x00\xa0\x03\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\x20\x01\x00\x00\x00\x3a\x00\x10\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\x04\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\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\x04\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\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd4\xff\xff\x3f\x00\x00\x0b\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\x50\xff\xff\xff\x00\x00\x2c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x12\x00\x00\x00\xa0\x83\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x7f\x3f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x02\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\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\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\xfd\xff\xff\x03\x00\xb0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#

{-# NOINLINE happyExpListPerState #-}
happyExpListPerState :: Int -> [Name]
happyExpListPerState Int
st =
    [Name]
token_strs_expected
  where token_strs :: [Name]
token_strs = [Name
"error",Name
"%dummy",Name
"%start_programParser",Name
"%start_statementParser",Name
"%start_expressionParser",Name
"PROGRAM",Name
"PROGRAM_INNER",Name
"PROGRAM_UNITS",Name
"MAIN_PROGRAM_UNIT",Name
"OTHER_PROGRAM_UNIT",Name
"MAYBE_ARGUMENTS",Name
"NAME",Name
"BLOCKS",Name
"BLOCK",Name
"MAYBE_NEWLINE",Name
"NEWLINE",Name
"STATEMENT",Name
"LOGICAL_IF_STATEMENT",Name
"DO_STATEMENT",Name
"DO_SPECIFICATION",Name
"INT_OR_VAR",Name
"OTHER_EXECUTABLE_STATEMENT",Name
"EXPRESSION_ASSIGNMENT_STATEMENT",Name
"NONEXECUTABLE_STATEMENT",Name
"READ_WRITE_ARGUMENTS",Name
"UNIT",Name
"FORM",Name
"IO_ELEMENTS",Name
"IO_ELEMENT",Name
"ELEMENT",Name
"DATA_GROUPS",Name
"DATA_ITEMS",Name
"DATA_ITEM",Name
"DATA_ITEM_LEVEL1",Name
"EQUIVALENCE_GROUPS",Name
"COMMON_GROUPS",Name
"COMMON_GROUP",Name
"INIT_COMMON_GROUP",Name
"COMMON_NAME",Name
"NAME_LIST",Name
"NAME_LIST_ELEMENT",Name
"DECLARATORS",Name
"DECLARATOR",Name
"ARRAY_DECLARATORS",Name
"ARRAY_DECLARATOR",Name
"DIMENSION_DECLARATORS",Name
"DIMENSION_DECLARATOR",Name
"VARIABLE_DECLARATOR",Name
"FUNCTION_NAMES",Name
"ARGUMENTS",Name
"ARGUMENTS_LEVEL1",Name
"CALLABLE_EXPRESSION",Name
"EXPRESSION",Name
"RELATIONAL_OPERATOR",Name
"SUBSCRIPT",Name
"INDICIES",Name
"ARITHMETIC_SIGN",Name
"MAYBE_VARIABLES",Name
"VARIABLES",Name
"VARIABLE",Name
"SIGNED_INTEGER_LITERAL",Name
"INTEGER_LITERAL",Name
"SIGNED_REAL_LITERAL",Name
"REAL_LITERAL",Name
"MAYBE_EXPONENT",Name
"EXPONENT",Name
"SIGNED_NUMERIC_LITERAL",Name
"COMPLEX_LITERAL",Name
"LOGICAL_LITERAL",Name
"HOLLERITH",Name
"LABELS_IN_STATEMENT",Name
"LABELS_IN_STATEMENT_LEVEL1",Name
"LABEL_IN_6COLUMN",Name
"LABEL_IN_STATEMENT",Name
"TYPE_SPEC",Name
"'('",Name
"')'",Name
"','",Name
"'.'",Name
"function",Name
"subroutine",Name
"blockData",Name
"end",Name
"'='",Name
"assign",Name
"to",Name
"goto",Name
"if",Name
"call",Name
"return",Name
"continue",Name
"stop",Name
"pause",Name
"do",Name
"read",Name
"write",Name
"rewind",Name
"backspace",Name
"endfile",Name
"common",Name
"equivalence",Name
"external",Name
"dimension",Name
"integer",Name
"real",Name
"doublePrecision",Name
"logical",Name
"complex",Name
"data",Name
"format",Name
"blob",Name
"int",Name
"exponent",Name
"bool",Name
"'+'",Name
"'-'",Name
"'**'",Name
"'*'",Name
"'/'",Name
"or",Name
"and",Name
"not",Name
"'<'",Name
"'<='",Name
"'>'",Name
"'>='",Name
"'=='",Name
"'!='",Name
"id",Name
"comment",Name
"hollerith",Name
"label",Name
"newline",Name
"%eof"]
        bit_start :: Int
bit_start = Int
st Int -> Int -> Int
forall a. Num a => a -> a -> a
Prelude.* Int
134
        bit_end :: Int
bit_end = (Int
st Int -> Int -> Int
forall a. Num a => a -> a -> a
Prelude.+ Int
1) Int -> Int -> Int
forall a. Num a => a -> a -> a
Prelude.* Int
134
        read_bit :: Int -> Bool
read_bit = HappyAddr -> Int -> Bool
readArrayBit HappyAddr
happyExpList
        bits :: [Bool]
bits = (Int -> Bool) -> [Int] -> [Bool]
forall a b. (a -> b) -> [a] -> [b]
Prelude.map Int -> Bool
read_bit [Int
bit_start..Int
bit_end Int -> Int -> Int
forall a. Num a => a -> a -> a
Prelude.- Int
1]
        bits_indexed :: [(Bool, Int)]
bits_indexed = [Bool] -> [Int] -> [(Bool, Int)]
forall a b. [a] -> [b] -> [(a, b)]
Prelude.zip [Bool]
bits [Int
0..Int
133]
        token_strs_expected :: [Name]
token_strs_expected = ((Bool, Int) -> [Name]) -> [(Bool, Int)] -> [Name]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
Prelude.concatMap (Bool, Int) -> [Name]
f [(Bool, Int)]
bits_indexed
        f :: (Bool, Int) -> [Name]
f (Bool
Prelude.False, Int
_) = []
        f (Bool
Prelude.True, Int
nr) = [[Name]
token_strs [Name] -> Int -> Name
forall a. [a] -> Int -> a
Prelude.!! Int
nr]

happyActOffsets :: HappyAddr
happyActOffsets :: HappyAddr
happyActOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\xdd\xff\xce\x01\x71\x00\xef\xff\xae\x00\x00\x00\x7b\x02\x00\x00\x71\x00\x42\x00\x00\x00\x00\x00\x00\x00\x00\x00\x71\x00\x2a\x00\x02\x00\x00\x00\x00\x00\x00\x00\x71\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x74\x00\x00\x00\x8b\x00\x5f\x00\x7a\x00\x13\x00\xd0\x00\x9e\x00\x00\x00\x00\x00\xb2\x00\xb2\x00\xbb\x00\xda\x00\xda\x00\xe6\xff\xe6\xff\xe6\xff\xe7\xff\xfa\x00\xcd\x00\xcd\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xcd\x00\xed\x00\xe0\x00\x00\x00\x00\x00\x00\x00\x9c\x00\x00\x00\x00\x00\x00\x01\xce\x01\x07\x00\x34\x01\x34\x01\x3a\x01\x3a\x01\x3a\x01\x00\x00\x00\x00\x9c\x00\x00\x00\x6c\x01\x01\x00\x00\x00\x00\x00\x7a\x01\xa2\x01\x00\x00\xaa\x01\xc2\x01\x00\x00\xc9\x01\x98\x01\xa4\x01\x00\x00\x9f\x01\xf0\x01\x37\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe6\xff\x00\x00\xc5\x01\x00\x00\x00\x00\x00\x00\x04\x02\x71\x00\x3c\x02\xcd\x01\x97\x01\x00\x00\xe9\x01\x15\x02\x18\x02\x00\x00\x00\x00\x00\x00\x3f\x02\x68\x00\x71\x00\x73\x03\x00\x00\x1d\x01\x00\x00\x45\x02\xc5\x00\x71\x00\x00\x00\x6a\x02\x00\x00\x6d\x02\x6f\x02\x51\x02\x71\x00\x71\x00\x71\x00\x71\x00\x71\x00\x71\x00\x71\x00\x71\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x73\x03\x65\x03\x51\x02\x51\x02\x51\x02\x14\x01\x14\x01\x3d\x02\xa1\x00\x7a\x02\x7c\x02\x00\x00\x00\x00\x00\x00\x00\x00\x5e\x02\x57\x03\x57\x03\x9e\x01\x00\x00\x71\x00\x50\x02\x50\x02\x00\x00\x00\x00\x65\x02\x00\x00\x00\x00\xd4\x00\x00\x00\xc7\x01\x53\x00\x00\x00\x8a\x02\xcf\x01\x67\x02\x60\x02\x60\x02\x9e\x02\x00\x00\x74\x02\x66\x00\x09\x02\xb0\x02\x7e\x02\x7e\x02\x5c\x00\x7e\x02\x00\x00\x81\x02\x00\x00\x81\x02\x81\x02\xbc\x02\x00\x00\xbc\x02\x8b\x02\x8d\x02\x8f\x02\x8f\x02\xcd\x02\x96\x02\xa3\x02\x9a\x02\x10\x01\x22\x00\x4a\x00\x00\x00\x00\x00\xfe\xff\xb5\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa1\x00\x00\x00\x00\x00\x00\x00\xa5\x02\x00\x00\xa5\x02\xe2\x02\x00\x00\xe2\x02\x00\x00\x06\x00\xeb\xff\xec\xff\x00\x00\x57\x03\x00\x00\x00\x00\x53\x00\xe8\x01\x00\x00\x00\x00\x00\x00\x0d\x02\x00\x00\x57\x03\x00\x00\x71\x00\x00\x00\x00\x00\xe8\x02\x00\x00\x57\x03\x00\x00\x71\x00\x00\x00\xec\x02\xf3\x02\x00\x00\xf6\x02\x00\x00\x00\x00\xfc\x02\x00\x00\x00\x00\x00\x03\x00\x00\x00\x00\x07\x03\x06\x00\x0a\x03\x17\x02\x5c\x00\x00\x00\x00\x00\x5c\x00\x00\x00\x5c\x00\xd8\x02\xdd\x02\x1a\x03\x1e\x03\x00\x00\xf1\x02\xfb\x02\x05\x03\x40\x01\xf0\x02\x00\x00\x70\x01\x00\x00\x5b\x00\x00\x00\x00\x00\x00\x00\x2d\x03\x06\x00\x06\x00\xec\xff\x71\x00\x15\x03\x00\x00\x41\x03\xe2\x00\x00\x00\x46\x03\x00\x00\x06\x00\x00\x00\x14\x03\x00\x00\x14\x03\xa0\x01\x14\x03\x00\x00\x00\x00\x51\x03\x4f\x03\xcf\x00\x38\x03\x38\x03\x00\x00\x00\x00\x00\x00\x00\x00"#

happyGotoOffsets :: HappyAddr
happyGotoOffsets :: HappyAddr
happyGotoOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\x6b\x01\x29\x00\xa9\x02\x58\x03\x10\x02\x00\x00\x37\x03\x00\x00\xb3\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x65\x01\x00\x00\x30\x03\x00\x00\x00\x00\x00\x00\xbd\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb5\x00\x32\x03\x2f\x01\x00\x00\x3b\x03\x00\x00\x00\x00\x40\x03\x42\x03\x4e\x03\x68\x03\x69\x03\x48\x00\x52\x00\x65\x00\x3e\x02\x77\x03\x2b\x00\x32\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x25\x02\x00\x00\x00\x00\x00\x00\x35\x01\x00\x00\xfd\xff\x00\x00\x00\x00\x7c\x03\x3a\x00\xb5\x00\x9a\x03\x9b\x03\x98\x03\x32\x02\xa0\x03\x00\x00\x00\x00\x0e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xac\x00\x16\x01\x00\x00\xe7\x01\x00\x00\x75\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x05\x01\x00\x00\x33\x01\x00\x00\x00\x00\x00\x00\x02\x02\xc7\x02\x36\x02\x7b\x03\x00\x00\x00\x00\x6e\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x95\x01\xd1\x02\x84\x03\x00\x00\x56\x02\x00\x00\x64\x02\x84\x03\xdb\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x84\x03\xe5\x02\xef\x02\xf9\x02\x03\x03\x0d\x03\x17\x03\x21\x03\x2b\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x84\x03\x84\x03\x84\x03\x84\x03\x84\x03\x84\x03\x84\x03\x84\x03\x61\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x7d\x02\x84\x03\x84\x03\x00\x00\x00\x00\x3b\x02\x0f\x01\x7f\x03\x00\x00\x00\x00\x72\x03\x00\x00\x00\x00\x87\x03\x00\x00\x00\x00\x84\x02\x00\x00\x00\x00\x00\x00\x00\x00\x1f\x02\xff\x01\x00\x00\x00\x00\x2c\x02\x82\x03\x00\x00\x00\x00\x83\x03\x50\x00\xec\x01\x5f\x02\x00\x00\x00\x00\x00\x00\x00\x00\xa5\x03\xb5\x03\x00\x00\xb6\x03\xb7\x03\xb2\x03\x00\x00\x00\x00\xb9\x03\xb8\x03\x32\x01\xba\x03\x1f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5d\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x76\x03\x00\x00\x00\x00\x00\x00\x66\x02\x00\x00\x6c\x02\x00\x00\x00\x00\x00\x00\x00\x00\x5d\x00\xee\xff\x2f\x00\x00\x00\x8f\x03\x00\x00\x00\x00\x97\x02\xb0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x8f\x03\x00\x00\x35\x03\x00\x00\x00\x00\x00\x00\x00\x00\x8f\x03\x00\x00\x4d\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\xad\x00\x00\x00\x00\x00\x1a\x02\x00\x00\x00\x00\x0c\x02\x00\x00\xfa\x01\xb6\x02\xbc\x03\x00\x00\x00\x00\x00\x00\xbe\x03\xbd\x03\xbf\x03\x1f\x00\x8a\x03\x00\x00\x1f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb6\x00\xeb\x01\x39\x00\x3f\x03\x7d\x03\x00\x00\x00\x00\x99\x03\x00\x00\x00\x00\x00\x00\xb4\x00\x00\x00\xc2\x02\x00\x00\xc9\x02\x1f\x00\xd4\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x86\x03\x88\x03\x00\x00\x00\x00\x00\x00\x00\x00"#

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

happyDefActions :: HappyAddr
happyDefActions :: HappyAddr
happyDefActions = Addr# -> HappyAddr
HappyA# Addr#
"\xeb\xff\x00\x00\x00\x00\x00\x00\xeb\xff\xe4\xff\x00\x00\x75\xff\x00\x00\x74\xff\x79\xff\x78\xff\x77\xff\x76\xff\x00\x00\x00\x00\x60\xff\x53\xff\x68\xff\x69\xff\x00\x00\x63\xff\x00\x00\xe3\xff\xe2\xff\xe1\xff\xd9\xff\xe0\xff\x00\x00\xb0\xff\xb1\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd1\xff\xd0\xff\xce\xff\xcc\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x4c\xff\x4b\xff\x4a\xff\x49\xff\x48\xff\x00\x00\x00\x00\x00\x00\xfb\xff\xeb\xff\xf6\xff\x00\x00\xf5\xff\xec\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe6\xff\x00\x00\x4e\xff\xf8\xff\xfa\xff\xc0\xff\xc1\xff\x00\x00\x9a\xff\x98\xff\x99\xff\xc4\xff\x92\xff\x00\x00\xc5\xff\x8b\xff\xc2\xff\x00\x00\xc3\xff\xa2\xff\x00\x00\x9d\xff\x00\x00\xc9\xff\xb9\xff\xba\xff\x60\xff\xca\xff\xcb\xff\xc8\xff\x00\x00\xc7\xff\x00\x00\x4d\xff\xcd\xff\xcf\xff\xd2\xff\x00\x00\x00\x00\x00\x00\x00\x00\xd7\xff\x00\x00\x00\x00\xbf\xff\x96\xff\x95\xff\x94\xff\x8d\xff\x00\x00\x00\x00\x7c\xff\x5d\xff\x58\xff\x57\xff\x58\xff\x00\x00\x00\x00\x56\xff\x79\xff\x55\xff\x78\xff\x00\x00\x7f\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xff\x6e\xff\x71\xff\x70\xff\x73\xff\x72\xff\xfc\xff\xe5\xff\x7d\xff\x7e\xff\x81\xff\x82\xff\x80\xff\x83\xff\x84\xff\x7b\xff\x00\x00\x79\xff\x78\xff\x7a\xff\x5b\xff\x59\xff\x5c\xff\x58\xff\xc6\xff\x6a\xff\x00\x00\x6d\xff\x00\x00\x00\x00\x00\x00\x4f\xff\x51\xff\x00\x00\xd5\xff\xd6\xff\x00\x00\xd3\xff\x00\x00\x87\xff\xde\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x9f\xff\xa3\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf7\xff\xe8\xff\xf4\xff\xe7\xff\xeb\xff\xee\xff\xed\xff\xee\xff\x00\x00\x00\x00\xe9\xff\xea\xff\xee\xff\x00\x00\x66\xff\x00\x00\x00\x00\x00\x00\x00\x00\xac\xff\xaa\xff\x00\x00\x61\xff\x5e\xff\xa9\xff\xa8\xff\xa7\xff\xa6\xff\x00\x00\x52\xff\x93\xff\x8c\xff\x00\x00\xa4\xff\x00\x00\xa1\xff\x9b\xff\x9e\xff\x9c\xff\xbc\xff\x00\x00\x00\x00\x88\xff\x85\xff\x86\xff\x8a\xff\x00\x00\x00\x00\x50\xff\xd8\xff\x97\xff\x00\x00\x8f\xff\x8e\xff\x6c\xff\x00\x00\x5a\xff\x61\xff\x00\x00\x54\xff\x6b\xff\x91\xff\x00\x00\xdf\xff\x00\x00\x00\x00\x89\xff\xdc\xff\xda\xff\xdb\xff\x00\x00\xb8\xff\xb7\xff\xbe\xff\xb5\xff\xb3\xff\xb4\xff\x00\x00\xa0\xff\x00\x00\x00\x00\x62\xff\x5f\xff\x00\x00\xae\xff\x00\x00\xe6\xff\xeb\xff\x00\x00\x67\xff\x64\xff\xeb\xff\x00\x00\xeb\xff\x00\x00\x00\x00\xef\xff\x00\x00\xf0\xff\x00\x00\xad\xff\xab\xff\xa5\xff\x00\x00\x00\x00\xbb\xff\x00\x00\x00\x00\x00\x00\x90\xff\x00\x00\x00\x00\xdd\xff\xbd\xff\xb6\xff\x00\x00\xaf\xff\xe6\xff\x65\xff\xe6\xff\x00\x00\xe6\xff\xf2\xff\xf1\xff\x00\x00\xb3\xff\xb4\xff\x00\x00\x00\x00\xd4\xff\xb2\xff\xf3\xff"#

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

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

happyReduceArr :: Array
  Int
  (Int#
   -> Token
   -> Int#
   -> Happy_IntList
   -> HappyStk HappyAbsSyn
   -> LexAction HappyAbsSyn)
happyReduceArr = (Int, Int)
-> [(Int,
     Int#
     -> Token
     -> Int#
     -> Happy_IntList
     -> HappyStk HappyAbsSyn
     -> LexAction HappyAbsSyn)]
-> Array
     Int
     (Int#
      -> Token
      -> Int#
      -> Happy_IntList
      -> HappyStk HappyAbsSyn
      -> LexAction HappyAbsSyn)
forall i e. Ix i => (i, i) -> [(i, e)] -> Array i e
Happy_Data_Array.array (Int
3, Int
183) [
	(Int
3 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_3),
	(Int
4 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_4),
	(Int
5 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_5),
	(Int
6 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_6),
	(Int
7 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_7),
	(Int
8 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_8),
	(Int
9 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_9),
	(Int
10 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_10),
	(Int
11 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_11),
	(Int
12 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_12),
	(Int
13 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_13),
	(Int
14 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_14),
	(Int
15 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_15),
	(Int
16 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_16),
	(Int
17 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_17),
	(Int
18 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_18),
	(Int
19 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_19),
	(Int
20 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_20),
	(Int
21 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_21),
	(Int
22 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_22),
	(Int
23 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_23),
	(Int
24 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_24),
	(Int
25 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_25),
	(Int
26 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_26),
	(Int
27 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_27),
	(Int
28 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_28),
	(Int
29 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_29),
	(Int
30 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_30),
	(Int
31 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_31),
	(Int
32 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_32),
	(Int
33 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_33),
	(Int
34 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_34),
	(Int
35 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_35),
	(Int
36 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_36),
	(Int
37 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_37),
	(Int
38 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_38),
	(Int
39 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_39),
	(Int
40 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_40),
	(Int
41 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_41),
	(Int
42 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_42),
	(Int
43 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_43),
	(Int
44 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_44),
	(Int
45 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_45),
	(Int
46 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_46),
	(Int
47 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_47),
	(Int
48 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_48),
	(Int
49 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_49),
	(Int
50 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_50),
	(Int
51 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_51),
	(Int
52 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_52),
	(Int
53 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_53),
	(Int
54 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_54),
	(Int
55 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_55),
	(Int
56 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_56),
	(Int
57 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_57),
	(Int
58 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_58),
	(Int
59 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_59),
	(Int
60 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_60),
	(Int
61 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_61),
	(Int
62 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_62),
	(Int
63 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_63),
	(Int
64 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_64),
	(Int
65 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_65),
	(Int
66 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_66),
	(Int
67 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_67),
	(Int
68 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_68),
	(Int
69 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_69),
	(Int
70 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_70),
	(Int
71 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_71),
	(Int
72 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_72),
	(Int
73 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_73),
	(Int
74 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_74),
	(Int
75 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_75),
	(Int
76 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_76),
	(Int
77 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_77),
	(Int
78 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_78),
	(Int
79 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_79),
	(Int
80 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_80),
	(Int
81 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_81),
	(Int
82 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_82),
	(Int
83 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_83),
	(Int
84 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_84),
	(Int
85 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_85),
	(Int
86 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_86),
	(Int
87 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_87),
	(Int
88 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_88),
	(Int
89 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_89),
	(Int
90 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_90),
	(Int
91 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_91),
	(Int
92 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_92),
	(Int
93 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_93),
	(Int
94 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_94),
	(Int
95 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_95),
	(Int
96 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_96),
	(Int
97 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_97),
	(Int
98 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_98),
	(Int
99 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_99),
	(Int
100 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_100),
	(Int
101 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_101),
	(Int
102 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_102),
	(Int
103 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_103),
	(Int
104 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_104),
	(Int
105 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_105),
	(Int
106 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_106),
	(Int
107 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_107),
	(Int
108 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_108),
	(Int
109 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_109),
	(Int
110 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_110),
	(Int
111 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_111),
	(Int
112 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_112),
	(Int
113 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_113),
	(Int
114 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_114),
	(Int
115 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_115),
	(Int
116 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_116),
	(Int
117 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_117),
	(Int
118 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_118),
	(Int
119 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_119),
	(Int
120 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_120),
	(Int
121 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_121),
	(Int
122 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_122),
	(Int
123 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_123),
	(Int
124 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_124),
	(Int
125 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_125),
	(Int
126 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_126),
	(Int
127 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_127),
	(Int
128 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_128),
	(Int
129 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_129),
	(Int
130 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_130),
	(Int
131 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_131),
	(Int
132 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_132),
	(Int
133 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_133),
	(Int
134 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_134),
	(Int
135 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_135),
	(Int
136 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_136),
	(Int
137 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_137),
	(Int
138 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_138),
	(Int
139 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_139),
	(Int
140 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_140),
	(Int
141 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_141),
	(Int
142 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_142),
	(Int
143 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_143),
	(Int
144 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_144),
	(Int
145 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_145),
	(Int
146 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_146),
	(Int
147 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_147),
	(Int
148 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_148),
	(Int
149 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_149),
	(Int
150 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_150),
	(Int
151 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_151),
	(Int
152 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_152),
	(Int
153 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_153),
	(Int
154 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_154),
	(Int
155 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_155),
	(Int
156 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_156),
	(Int
157 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_157),
	(Int
158 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_158),
	(Int
159 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_159),
	(Int
160 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_160),
	(Int
161 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_161),
	(Int
162 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_162),
	(Int
163 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_163),
	(Int
164 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_164),
	(Int
165 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_165),
	(Int
166 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_166),
	(Int
167 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_167),
	(Int
168 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_168),
	(Int
169 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_169),
	(Int
170 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_170),
	(Int
171 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_171),
	(Int
172 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_172),
	(Int
173 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_173),
	(Int
174 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_174),
	(Int
175 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_175),
	(Int
176 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_176),
	(Int
177 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_177),
	(Int
178 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_178),
	(Int
179 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_179),
	(Int
180 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_180),
	(Int
181 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_181),
	(Int
182 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_182),
	(Int
183 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_183)
	]

happy_n_terms :: Int
happy_n_terms = Int
60 :: Prelude.Int
happy_n_nonterms :: Int
happy_n_nonterms = Int
70 :: Prelude.Int

happyReduce_3 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_3 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_3 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
0# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_3
happyReduction_3 :: HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_3 HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap7
happyOut7 HappyAbsSyn
happy_x_2 of { (HappyWrap7 ProgramFile A0
happy_var_2) -> 
	ProgramFile A0 -> HappyAbsSyn
happyIn6
		 (ProgramFile A0
happy_var_2
	)}

happyReduce_4 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_4 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_4 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
0# HappyAbsSyn -> HappyAbsSyn
happyReduction_4
happyReduction_4 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_4 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap7
happyOut7 HappyAbsSyn
happy_x_1 of { (HappyWrap7 ProgramFile A0
happy_var_1) -> 
	ProgramFile A0 -> HappyAbsSyn
happyIn6
		 (ProgramFile A0
happy_var_1
	)}

happyReduce_5 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_5 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_5 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
1# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_5
happyReduction_5 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_5 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap8
happyOut8 HappyAbsSyn
happy_x_1 of { (HappyWrap8 [ProgramUnit A0]
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap13
happyOut13 HappyAbsSyn
happy_x_2 of { (HappyWrap13 [Block A0]
happy_var_2) -> 
	ProgramFile A0 -> HappyAbsSyn
happyIn7
		 (MetaInfo -> [ProgramUnit A0] -> ProgramFile A0
forall a. MetaInfo -> [ProgramUnit a] -> ProgramFile a
ProgramFile (MetaInfo :: FortranVersion -> Name -> MetaInfo
MetaInfo { miVersion :: FortranVersion
miVersion = FortranVersion
Fortran66, miFilename :: Name
miFilename = Name
"" })  ([ProgramUnit A0] -> [ProgramUnit A0]
forall a. [a] -> [a]
reverse [ProgramUnit A0]
happy_var_1 [ProgramUnit A0] -> [ProgramUnit A0] -> [ProgramUnit A0]
forall a. [a] -> [a] -> [a]
++ [Block A0] -> [ProgramUnit A0]
forall a. [Block a] -> [ProgramUnit a]
convCmts ([Block A0] -> [Block A0]
forall a. [a] -> [a]
reverse [Block A0]
happy_var_2))
	)}}

happyReduce_6 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_6 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_6 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_0  Int#
1# HappyAbsSyn
happyReduction_6
happyReduction_6 :: HappyAbsSyn
happyReduction_6  =  ProgramFile A0 -> HappyAbsSyn
happyIn7
		 (MetaInfo -> [ProgramUnit A0] -> ProgramFile A0
forall a. MetaInfo -> [ProgramUnit a] -> ProgramFile a
ProgramFile (MetaInfo :: FortranVersion -> Name -> MetaInfo
MetaInfo { miVersion :: FortranVersion
miVersion = FortranVersion
Fortran66, miFilename :: Name
miFilename = Name
"" }) []
	)

happyReduce_7 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_7 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_7 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
2# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_7
happyReduction_7 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_7 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap8
happyOut8 HappyAbsSyn
happy_x_1 of { (HappyWrap8 [ProgramUnit A0]
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap9
happyOut9 HappyAbsSyn
happy_x_2 of { (HappyWrap9 ProgramUnit A0
happy_var_2) -> 
	[ProgramUnit A0] -> HappyAbsSyn
happyIn8
		 (ProgramUnit A0
happy_var_2 ProgramUnit A0 -> [ProgramUnit A0] -> [ProgramUnit A0]
forall k1. k1 -> [k1] -> [k1]
: [ProgramUnit A0]
happy_var_1
	)}}

happyReduce_8 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_8 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_8 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
2# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_8
happyReduction_8 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_8 HappyAbsSyn
happy_x_3
	HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap8
happyOut8 HappyAbsSyn
happy_x_1 of { (HappyWrap8 [ProgramUnit A0]
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap13
happyOut13 HappyAbsSyn
happy_x_2 of { (HappyWrap13 [Block A0]
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap10
happyOut10 HappyAbsSyn
happy_x_3 of { (HappyWrap10 ProgramUnit A0
happy_var_3) -> 
	[ProgramUnit A0] -> HappyAbsSyn
happyIn8
		 ([Block A0] -> [ProgramUnit A0]
forall a. [Block a] -> [ProgramUnit a]
convCmts ([Block A0] -> [Block A0]
forall a. [a] -> [a]
reverse [Block A0]
happy_var_2) [ProgramUnit A0] -> [ProgramUnit A0] -> [ProgramUnit A0]
forall a. [a] -> [a] -> [a]
++ (ProgramUnit A0
happy_var_3 ProgramUnit A0 -> [ProgramUnit A0] -> [ProgramUnit A0]
forall k1. k1 -> [k1] -> [k1]
: [ProgramUnit A0]
happy_var_1)
	)}}}

happyReduce_9 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_9 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_9 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
2# HappyAbsSyn -> HappyAbsSyn
happyReduction_9
happyReduction_9 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_9 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap9
happyOut9 HappyAbsSyn
happy_x_1 of { (HappyWrap9 ProgramUnit A0
happy_var_1) -> 
	[ProgramUnit A0] -> HappyAbsSyn
happyIn8
		 ([ ProgramUnit A0
happy_var_1 ]
	)}

happyReduce_10 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_10 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_10 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
2# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_10
happyReduction_10 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_10 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap13
happyOut13 HappyAbsSyn
happy_x_1 of { (HappyWrap13 [Block A0]
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap10
happyOut10 HappyAbsSyn
happy_x_2 of { (HappyWrap10 ProgramUnit A0
happy_var_2) -> 
	[ProgramUnit A0] -> HappyAbsSyn
happyIn8
		 ([Block A0] -> [ProgramUnit A0]
forall a. [Block a] -> [ProgramUnit a]
convCmts ([Block A0] -> [Block A0]
forall a. [a] -> [a]
reverse [Block A0]
happy_var_1) [ProgramUnit A0] -> [ProgramUnit A0] -> [ProgramUnit A0]
forall a. [a] -> [a] -> [a]
++ [ ProgramUnit A0
happy_var_2 ]
	)}}

happyReduce_11 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_11 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_11 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
3# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_11
happyReduction_11 :: p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_11 p
happy_x_3
	HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap13
happyOut13 HappyAbsSyn
happy_x_1 of { (HappyWrap13 [Block A0]
happy_var_1) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { Token
happy_var_2 -> 
	ProgramUnit A0 -> HappyAbsSyn
happyIn9
		 (let blocks :: [Block A0]
blocks = [Block A0] -> [Block A0]
forall a. [a] -> [a]
reverse [Block A0]
happy_var_1
    in A0
-> SrcSpan
-> Maybe Name
-> [Block A0]
-> Maybe [ProgramUnit A0]
-> ProgramUnit A0
forall a.
a
-> SrcSpan
-> Maybe Name
-> [Block a]
-> Maybe [ProgramUnit a]
-> ProgramUnit a
PUMain () ([Block A0] -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan [Block A0]
happy_var_1 Token
happy_var_2) Maybe Name
forall k1. Maybe k1
Nothing [Block A0]
blocks Maybe [ProgramUnit A0]
forall k1. Maybe k1
Nothing
	)}}

happyReduce_12 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_12 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_12 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
8# Int#
4# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_12
happyReduction_12 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_12 (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 -> HappyWrap75
happyOut75 HappyAbsSyn
happy_x_1 of { (HappyWrap75 TypeSpec A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap12
happyOut12 HappyAbsSyn
happy_x_3 of { (HappyWrap12 Name
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap11
happyOut11 HappyAbsSyn
happy_x_4 of { (HappyWrap11 Maybe (AList Expression A0)
happy_var_4) -> 
	case HappyAbsSyn -> HappyWrap13
happyOut13 HappyAbsSyn
happy_x_6 of { (HappyWrap13 [Block A0]
happy_var_6) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_7 of { Token
happy_var_7 -> 
	ProgramUnit A0 -> HappyAbsSyn
happyIn10
		 (A0
-> SrcSpan
-> Maybe (TypeSpec A0)
-> PrefixSuffix A0
-> Name
-> Maybe (AList Expression A0)
-> Maybe (Expression A0)
-> [Block A0]
-> Maybe [ProgramUnit A0]
-> ProgramUnit A0
forall a.
a
-> SrcSpan
-> Maybe (TypeSpec a)
-> PrefixSuffix a
-> Name
-> Maybe (AList Expression a)
-> Maybe (Expression a)
-> [Block a]
-> Maybe [ProgramUnit a]
-> ProgramUnit a
PUFunction () (TypeSpec A0 -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan TypeSpec A0
happy_var_1 Token
happy_var_7) (TypeSpec A0 -> Maybe (TypeSpec A0)
forall k1. k1 -> Maybe k1
Just TypeSpec A0
happy_var_1) PrefixSuffix A0
forall a. PrefixSuffix a
emptyPrefixSuffix Name
happy_var_3 Maybe (AList Expression A0)
happy_var_4 Maybe (Expression A0)
forall k1. Maybe k1
Nothing ([Block A0] -> [Block A0]
forall a. [a] -> [a]
reverse [Block A0]
happy_var_6) Maybe [ProgramUnit A0]
forall k1. Maybe k1
Nothing
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}

happyReduce_13 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_13 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_13 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
7# Int#
4# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_13
happyReduction_13 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_13 (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 -> HappyWrap12
happyOut12 HappyAbsSyn
happy_x_2 of { (HappyWrap12 Name
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap11
happyOut11 HappyAbsSyn
happy_x_3 of { (HappyWrap11 Maybe (AList Expression A0)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap13
happyOut13 HappyAbsSyn
happy_x_5 of { (HappyWrap13 [Block A0]
happy_var_5) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_6 of { Token
happy_var_6 -> 
	ProgramUnit A0 -> HappyAbsSyn
happyIn10
		 (A0
-> SrcSpan
-> Maybe (TypeSpec A0)
-> PrefixSuffix A0
-> Name
-> Maybe (AList Expression A0)
-> Maybe (Expression A0)
-> [Block A0]
-> Maybe [ProgramUnit A0]
-> ProgramUnit A0
forall a.
a
-> SrcSpan
-> Maybe (TypeSpec a)
-> PrefixSuffix a
-> Name
-> Maybe (AList Expression a)
-> Maybe (Expression a)
-> [Block a]
-> Maybe [ProgramUnit a]
-> ProgramUnit a
PUFunction () (Token -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Token
happy_var_6) Maybe (TypeSpec A0)
forall k1. Maybe k1
Nothing PrefixSuffix A0
forall a. PrefixSuffix a
emptyPrefixSuffix Name
happy_var_2 Maybe (AList Expression A0)
happy_var_3 Maybe (Expression A0)
forall k1. Maybe k1
Nothing ([Block A0] -> [Block A0]
forall a. [a] -> [a]
reverse [Block A0]
happy_var_5) Maybe [ProgramUnit A0]
forall k1. Maybe k1
Nothing
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}

happyReduce_14 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_14 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_14 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
7# Int#
4# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_14
happyReduction_14 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_14 (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 -> HappyWrap12
happyOut12 HappyAbsSyn
happy_x_2 of { (HappyWrap12 Name
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap11
happyOut11 HappyAbsSyn
happy_x_3 of { (HappyWrap11 Maybe (AList Expression A0)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap13
happyOut13 HappyAbsSyn
happy_x_5 of { (HappyWrap13 [Block A0]
happy_var_5) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_6 of { Token
happy_var_6 -> 
	ProgramUnit A0 -> HappyAbsSyn
happyIn10
		 (A0
-> SrcSpan
-> PrefixSuffix A0
-> Name
-> Maybe (AList Expression A0)
-> [Block A0]
-> Maybe [ProgramUnit A0]
-> ProgramUnit A0
forall a.
a
-> SrcSpan
-> PrefixSuffix a
-> Name
-> Maybe (AList Expression a)
-> [Block a]
-> Maybe [ProgramUnit a]
-> ProgramUnit a
PUSubroutine () (Token -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Token
happy_var_6) PrefixSuffix A0
forall a. PrefixSuffix a
emptyPrefixSuffix Name
happy_var_2 Maybe (AList Expression A0)
happy_var_3 ([Block A0] -> [Block A0]
forall a. [a] -> [a]
reverse [Block A0]
happy_var_5) Maybe [ProgramUnit A0]
forall k1. Maybe k1
Nothing
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}

happyReduce_15 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_15 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_15 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
5# Int#
4# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_15
happyReduction_15 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_15 (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 -> HappyWrap13
happyOut13 HappyAbsSyn
happy_x_3 of { (HappyWrap13 [Block A0]
happy_var_3) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_4 of { Token
happy_var_4 -> 
	ProgramUnit A0 -> HappyAbsSyn
happyIn10
		 (A0 -> SrcSpan -> Maybe Name -> [Block A0] -> ProgramUnit A0
forall a. a -> SrcSpan -> Maybe Name -> [Block a] -> ProgramUnit a
PUBlockData () (Token -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Token
happy_var_4) Maybe Name
forall k1. Maybe k1
Nothing ([Block A0] -> [Block A0]
forall a. [a] -> [a]
reverse [Block A0]
happy_var_3)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_16 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_16 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_16 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
5# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_16
happyReduction_16 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_16 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap58
happyOut58 HappyAbsSyn
happy_x_2 of { (HappyWrap58 Maybe (AList Expression A0)
happy_var_2) -> 
	Maybe (AList Expression A0) -> HappyAbsSyn
happyIn11
		 (Maybe (AList Expression A0)
happy_var_2
	)}

happyReduce_17 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_17 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_17 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_0  Int#
5# HappyAbsSyn
happyReduction_17
happyReduction_17 :: HappyAbsSyn
happyReduction_17  =  Maybe (AList Expression A0) -> HappyAbsSyn
happyIn11
		 (Maybe (AList Expression A0)
forall k1. Maybe k1
Nothing
	)

happyReduce_18 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_18 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_18 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
6# HappyAbsSyn -> HappyAbsSyn
happyReduction_18
happyReduction_18 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_18 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	Name -> HappyAbsSyn
happyIn12
		 (let (TId SrcSpan
_ Name
name) = Token
happy_var_1 in Name
name
	)}

happyReduce_19 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_19 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_19 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
7# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_19
happyReduction_19 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_19 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap13
happyOut13 HappyAbsSyn
happy_x_1 of { (HappyWrap13 [Block A0]
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap14
happyOut14 HappyAbsSyn
happy_x_2 of { (HappyWrap14 Block A0
happy_var_2) -> 
	[Block A0] -> HappyAbsSyn
happyIn13
		 (Block A0
happy_var_2 Block A0 -> [Block A0] -> [Block A0]
forall k1. k1 -> [k1] -> [k1]
: [Block A0]
happy_var_1
	)}}

happyReduce_20 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_20 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_20 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_0  Int#
7# HappyAbsSyn
happyReduction_20
happyReduction_20 :: HappyAbsSyn
happyReduction_20  =  [Block A0] -> HappyAbsSyn
happyIn13
		 ([ ]
	)

happyReduce_21 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_21 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_21 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
8# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_21
happyReduction_21 :: p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_21 p
happy_x_3
	HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap73
happyOut73 HappyAbsSyn
happy_x_1 of { (HappyWrap73 Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap17
happyOut17 HappyAbsSyn
happy_x_2 of { (HappyWrap17 Statement A0
happy_var_2) -> 
	Block A0 -> HappyAbsSyn
happyIn14
		 (A0 -> SrcSpan -> Maybe (Expression A0) -> Statement A0 -> Block A0
forall a.
a -> SrcSpan -> Maybe (Expression a) -> Statement a -> Block a
BlStatement () (Expression A0 -> Statement A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_1 Statement A0
happy_var_2) (Expression A0 -> Maybe (Expression A0)
forall k1. k1 -> Maybe k1
Just Expression A0
happy_var_1) Statement A0
happy_var_2
	)}}

happyReduce_22 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_22 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_22 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
8# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_22
happyReduction_22 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_22 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap17
happyOut17 HappyAbsSyn
happy_x_1 of { (HappyWrap17 Statement A0
happy_var_1) -> 
	Block A0 -> HappyAbsSyn
happyIn14
		 (A0 -> SrcSpan -> Maybe (Expression A0) -> Statement A0 -> Block A0
forall a.
a -> SrcSpan -> Maybe (Expression a) -> Statement a -> Block a
BlStatement () (Statement A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Statement A0
happy_var_1) Maybe (Expression A0)
forall k1. Maybe k1
Nothing Statement A0
happy_var_1
	)}

happyReduce_23 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_23 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_23 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
8# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_23
happyReduction_23 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_23 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	Block A0 -> HappyAbsSyn
happyIn14
		 (let (TComment SrcSpan
s Name
c) = Token
happy_var_1 in A0 -> SrcSpan -> Comment A0 -> Block A0
forall a. a -> SrcSpan -> Comment a -> Block a
BlComment () SrcSpan
s (Name -> Comment A0
forall a. Name -> Comment a
Comment Name
c)
	)}

happyReduce_24 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_24 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_24 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
9# HappyAbsSyn -> HappyAbsSyn
happyReduction_24
happyReduction_24 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_24 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
happy_x_1 of { (HappyWrap16 Token
happy_var_1) -> 
	Maybe Token -> HappyAbsSyn
happyIn15
		 (Token -> Maybe Token
forall k1. k1 -> Maybe k1
Just Token
happy_var_1
	)}

happyReduce_25 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_25 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_25 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_0  Int#
9# HappyAbsSyn
happyReduction_25
happyReduction_25 :: HappyAbsSyn
happyReduction_25  =  Maybe Token -> HappyAbsSyn
happyIn15
		 (Maybe Token
forall k1. Maybe k1
Nothing
	)

happyReduce_26 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_26 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_26 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
10# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_26
happyReduction_26 :: p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_26 p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
happy_x_1 of { (HappyWrap16 Token
happy_var_1) -> 
	Token -> HappyAbsSyn
happyIn16
		 (Token
happy_var_1
	)}

happyReduce_27 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_27 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_27 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
10# HappyAbsSyn -> HappyAbsSyn
happyReduction_27
happyReduction_27 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_27 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	Token -> HappyAbsSyn
happyIn16
		 (Token
happy_var_1
	)}

happyReduce_28 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_28 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_28 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
happyReduction_28
happyReduction_28 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_28 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap18
happyOut18 HappyAbsSyn
happy_x_1 of { (HappyWrap18 Statement A0
happy_var_1) -> 
	Statement A0 -> HappyAbsSyn
happyIn17
		 (Statement A0
happy_var_1
	)}

happyReduce_29 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_29 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_29 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
happyReduction_29
happyReduction_29 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_29 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap19
happyOut19 HappyAbsSyn
happy_x_1 of { (HappyWrap19 Statement A0
happy_var_1) -> 
	Statement A0 -> HappyAbsSyn
happyIn17
		 (Statement A0
happy_var_1
	)}

happyReduce_30 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_30 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_30 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
happyReduction_30
happyReduction_30 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_30 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap22
happyOut22 HappyAbsSyn
happy_x_1 of { (HappyWrap22 Statement A0
happy_var_1) -> 
	Statement A0 -> HappyAbsSyn
happyIn17
		 (Statement A0
happy_var_1
	)}

happyReduce_31 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_31 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_31 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
11# HappyAbsSyn -> HappyAbsSyn
happyReduction_31
happyReduction_31 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_31 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap24
happyOut24 HappyAbsSyn
happy_x_1 of { (HappyWrap24 Statement A0
happy_var_1) -> 
	Statement A0 -> HappyAbsSyn
happyIn17
		 (Statement A0
happy_var_1
	)}

happyReduce_32 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_32 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_32 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
5# Int#
12# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_32
happyReduction_32 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_32 (HappyAbsSyn
happy_x_5 `HappyStk`
	HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_3 of { (HappyWrap53 Expression A0
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap22
happyOut22 HappyAbsSyn
happy_x_5 of { (HappyWrap22 Statement A0
happy_var_5) -> 
	Statement A0 -> HappyAbsSyn
happyIn18
		 (A0 -> SrcSpan -> Expression A0 -> Statement A0 -> Statement A0
forall a.
a -> SrcSpan -> Expression a -> Statement a -> Statement a
StIfLogical () (Token -> Statement A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Statement A0
happy_var_5) Expression A0
happy_var_3 Statement A0
happy_var_5
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_33 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_33 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_33 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
13# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_33
happyReduction_33 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_33 HappyAbsSyn
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 -> HappyWrap74
happyOut74 HappyAbsSyn
happy_x_2 of { (HappyWrap74 Expression A0
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap20
happyOut20 HappyAbsSyn
happy_x_3 of { (HappyWrap20 DoSpecification A0
happy_var_3) -> 
	Statement A0 -> HappyAbsSyn
happyIn19
		 (A0
-> SrcSpan
-> Maybe Name
-> Maybe (Expression A0)
-> Maybe (DoSpecification A0)
-> Statement A0
forall a.
a
-> SrcSpan
-> Maybe Name
-> Maybe (Expression a)
-> Maybe (DoSpecification a)
-> Statement a
StDo () (Token -> DoSpecification A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 DoSpecification A0
happy_var_3) Maybe Name
forall k1. Maybe k1
Nothing (Expression A0 -> Maybe (Expression A0)
forall k1. k1 -> Maybe k1
Just Expression A0
happy_var_2) (DoSpecification A0 -> Maybe (DoSpecification A0)
forall k1. k1 -> Maybe k1
Just DoSpecification A0
happy_var_3)
	)}}}

happyReduce_34 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_34 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_34 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
5# Int#
14# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_34
happyReduction_34 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_34 (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 -> HappyWrap23
happyOut23 HappyAbsSyn
happy_x_1 of { (HappyWrap23 Statement A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap21
happyOut21 HappyAbsSyn
happy_x_3 of { (HappyWrap21 Expression A0
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap21
happyOut21 HappyAbsSyn
happy_x_5 of { (HappyWrap21 Expression A0
happy_var_5) -> 
	DoSpecification A0 -> HappyAbsSyn
happyIn20
		 (A0
-> SrcSpan
-> Statement A0
-> Expression A0
-> Maybe (Expression A0)
-> DoSpecification A0
forall a.
a
-> SrcSpan
-> Statement a
-> Expression a
-> Maybe (Expression a)
-> DoSpecification a
DoSpecification () (Statement A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Statement A0
happy_var_1 Expression A0
happy_var_5) Statement A0
happy_var_1 Expression A0
happy_var_3 (Expression A0 -> Maybe (Expression A0)
forall k1. k1 -> Maybe k1
Just Expression A0
happy_var_5)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_35 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_35 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_35 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
14# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_35
happyReduction_35 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_35 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap23
happyOut23 HappyAbsSyn
happy_x_1 of { (HappyWrap23 Statement A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap21
happyOut21 HappyAbsSyn
happy_x_3 of { (HappyWrap21 Expression A0
happy_var_3) -> 
	DoSpecification A0 -> HappyAbsSyn
happyIn20
		 (A0
-> SrcSpan
-> Statement A0
-> Expression A0
-> Maybe (Expression A0)
-> DoSpecification A0
forall a.
a
-> SrcSpan
-> Statement a
-> Expression a
-> Maybe (Expression a)
-> DoSpecification a
DoSpecification () (Statement A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Statement A0
happy_var_1 Expression A0
happy_var_3) Statement A0
happy_var_1 Expression A0
happy_var_3 Maybe (Expression A0)
forall k1. Maybe k1
Nothing
	)}}

happyReduce_36 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_36 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_36 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
15# HappyAbsSyn -> HappyAbsSyn
happyReduction_36
happyReduction_36 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_36 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_1 of { (HappyWrap62 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn21
		 (Expression A0
happy_var_1
	)}

happyReduce_37 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_37 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_37 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
15# HappyAbsSyn -> HappyAbsSyn
happyReduction_37
happyReduction_37 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_37 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_1 of { (HappyWrap60 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn21
		 (Expression A0
happy_var_1
	)}

happyReduce_38 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_38 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_38 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
16# HappyAbsSyn -> HappyAbsSyn
happyReduction_38
happyReduction_38 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_38 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap23
happyOut23 HappyAbsSyn
happy_x_1 of { (HappyWrap23 Statement A0
happy_var_1) -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (Statement A0
happy_var_1
	)}

happyReduce_39 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_39 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_39 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
4# Int#
16# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_39
happyReduction_39 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_39 (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 -> HappyWrap74
happyOut74 HappyAbsSyn
happy_x_2 of { (HappyWrap74 Expression A0
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_4 of { (HappyWrap60 Expression A0
happy_var_4) -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (A0 -> SrcSpan -> Expression A0 -> Expression A0 -> Statement A0
forall a.
a -> SrcSpan -> Expression a -> Expression a -> Statement a
StLabelAssign () (Token -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Expression A0
happy_var_4) Expression A0
happy_var_2 Expression A0
happy_var_4
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_40 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_40 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_40 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
16# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_40
happyReduction_40 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_40 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap74
happyOut74 HappyAbsSyn
happy_x_2 of { (HappyWrap74 Expression A0
happy_var_2) -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (A0 -> SrcSpan -> Expression A0 -> Statement A0
forall a. a -> SrcSpan -> Expression a -> Statement a
StGotoUnconditional () (Token -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Expression A0
happy_var_2) Expression A0
happy_var_2
	)}}

happyReduce_41 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_41 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_41 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
16# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_41
happyReduction_41 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_41 HappyAbsSyn
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 -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_2 of { (HappyWrap60 Expression A0
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap71
happyOut71 HappyAbsSyn
happy_x_3 of { (HappyWrap71 AList Expression A0
happy_var_3) -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (A0
-> SrcSpan
-> Expression A0
-> Maybe (AList Expression A0)
-> Statement A0
forall a.
a
-> SrcSpan
-> Expression a
-> Maybe (AList Expression a)
-> Statement a
StGotoAssigned () (Token -> AList Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 AList Expression A0
happy_var_3) Expression A0
happy_var_2 (AList Expression A0 -> Maybe (AList Expression A0)
forall k1. k1 -> Maybe k1
Just AList Expression A0
happy_var_3)
	)}}}

happyReduce_42 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_42 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_42 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
16# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_42
happyReduction_42 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_42 HappyAbsSyn
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 -> HappyWrap71
happyOut71 HappyAbsSyn
happy_x_2 of { (HappyWrap71 AList Expression A0
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_3 of { (HappyWrap60 Expression A0
happy_var_3) -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (A0
-> SrcSpan -> AList Expression A0 -> Expression A0 -> Statement A0
forall a.
a -> SrcSpan -> AList Expression a -> Expression a -> Statement a
StGotoComputed () (Token -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Expression A0
happy_var_3) AList Expression A0
happy_var_2 Expression A0
happy_var_3
	)}}}

happyReduce_43 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_43 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_43 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
9# Int#
16# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_43
happyReduction_43 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_43 (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 -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_3 of { (HappyWrap53 Expression A0
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap74
happyOut74 HappyAbsSyn
happy_x_5 of { (HappyWrap74 Expression A0
happy_var_5) -> 
	case HappyAbsSyn -> HappyWrap74
happyOut74 HappyAbsSyn
happy_x_7 of { (HappyWrap74 Expression A0
happy_var_7) -> 
	case HappyAbsSyn -> HappyWrap74
happyOut74 HappyAbsSyn
happy_x_9 of { (HappyWrap74 Expression A0
happy_var_9) -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (A0
-> SrcSpan
-> Expression A0
-> Expression A0
-> Expression A0
-> Expression A0
-> Statement A0
forall a.
a
-> SrcSpan
-> Expression a
-> Expression a
-> Expression a
-> Expression a
-> Statement a
StIfArithmetic () (Token -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Expression A0
happy_var_9) Expression A0
happy_var_3 Expression A0
happy_var_5 Expression A0
happy_var_7 Expression A0
happy_var_9
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}}

happyReduce_44 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_44 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_44 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
16# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_44
happyReduction_44 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_44 HappyAbsSyn
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 -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_2 of { (HappyWrap60 Expression A0
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap50
happyOut50 HappyAbsSyn
happy_x_3 of { (HappyWrap50 AList Argument A0
happy_var_3) -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (A0
-> SrcSpan
-> Expression A0
-> Maybe (AList Argument A0)
-> Statement A0
forall a.
a
-> SrcSpan
-> Expression a
-> Maybe (AList Argument a)
-> Statement a
StCall () (Token -> AList Argument A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 AList Argument A0
happy_var_3) Expression A0
happy_var_2 (AList Argument A0 -> Maybe (AList Argument A0)
forall k1. k1 -> Maybe k1
Just AList Argument A0
happy_var_3)
	)}}}

happyReduce_45 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_45 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_45 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
16# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_45
happyReduction_45 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_45 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_2 of { (HappyWrap60 Expression A0
happy_var_2) -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (A0
-> SrcSpan
-> Expression A0
-> Maybe (AList Argument A0)
-> Statement A0
forall a.
a
-> SrcSpan
-> Expression a
-> Maybe (AList Argument a)
-> Statement a
StCall () (Token -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Expression A0
happy_var_2) Expression A0
happy_var_2 Maybe (AList Argument A0)
forall k1. Maybe k1
Nothing
	)}}

happyReduce_46 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_46 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_46 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
16# HappyAbsSyn -> HappyAbsSyn
happyReduction_46
happyReduction_46 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_46 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (A0 -> SrcSpan -> Maybe (Expression A0) -> Statement A0
forall a. a -> SrcSpan -> Maybe (Expression a) -> Statement a
StReturn () (Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1) Maybe (Expression A0)
forall k1. Maybe k1
Nothing
	)}

happyReduce_47 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_47 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_47 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
16# HappyAbsSyn -> HappyAbsSyn
happyReduction_47
happyReduction_47 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_47 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (A0 -> SrcSpan -> Statement A0
forall a. a -> SrcSpan -> Statement a
StContinue () (SrcSpan -> Statement A0) -> SrcSpan -> Statement A0
forall a b. (a -> b) -> a -> b
$ Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1
	)}

happyReduce_48 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_48 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_48 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
16# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_48
happyReduction_48 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_48 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_2 of { (HappyWrap62 Expression A0
happy_var_2) -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (A0 -> SrcSpan -> Maybe (Expression A0) -> Statement A0
forall a. a -> SrcSpan -> Maybe (Expression a) -> Statement a
StStop () (Token -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Expression A0
happy_var_2) (Maybe (Expression A0) -> Statement A0)
-> Maybe (Expression A0) -> Statement A0
forall a b. (a -> b) -> a -> b
$ Expression A0 -> Maybe (Expression A0)
forall k1. k1 -> Maybe k1
Just Expression A0
happy_var_2
	)}}

happyReduce_49 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_49 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_49 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
16# HappyAbsSyn -> HappyAbsSyn
happyReduction_49
happyReduction_49 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_49 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (A0 -> SrcSpan -> Maybe (Expression A0) -> Statement A0
forall a. a -> SrcSpan -> Maybe (Expression a) -> Statement a
StStop () (Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1) Maybe (Expression A0)
forall k1. Maybe k1
Nothing
	)}

happyReduce_50 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_50 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_50 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
16# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_50
happyReduction_50 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_50 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_2 of { (HappyWrap62 Expression A0
happy_var_2) -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (A0 -> SrcSpan -> Maybe (Expression A0) -> Statement A0
forall a. a -> SrcSpan -> Maybe (Expression a) -> Statement a
StPause () (Token -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Expression A0
happy_var_2) (Maybe (Expression A0) -> Statement A0)
-> Maybe (Expression A0) -> Statement A0
forall a b. (a -> b) -> a -> b
$ Expression A0 -> Maybe (Expression A0)
forall k1. k1 -> Maybe k1
Just Expression A0
happy_var_2
	)}}

happyReduce_51 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_51 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_51 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
16# HappyAbsSyn -> HappyAbsSyn
happyReduction_51
happyReduction_51 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_51 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (A0 -> SrcSpan -> Maybe (Expression A0) -> Statement A0
forall a. a -> SrcSpan -> Maybe (Expression a) -> Statement a
StPause () (Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1) Maybe (Expression A0)
forall k1. Maybe k1
Nothing
	)}

happyReduce_52 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_52 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_52 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
16# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_52
happyReduction_52 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_52 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap26
happyOut26 HappyAbsSyn
happy_x_2 of { (HappyWrap26 Expression A0
happy_var_2) -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (A0 -> SrcSpan -> Expression A0 -> Statement A0
forall a. a -> SrcSpan -> Expression a -> Statement a
StRewind2 () (Token -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Expression A0
happy_var_2) Expression A0
happy_var_2
	)}}

happyReduce_53 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_53 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_53 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
16# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_53
happyReduction_53 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_53 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap26
happyOut26 HappyAbsSyn
happy_x_2 of { (HappyWrap26 Expression A0
happy_var_2) -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (A0 -> SrcSpan -> Expression A0 -> Statement A0
forall a. a -> SrcSpan -> Expression a -> Statement a
StBackspace2 () (Token -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Expression A0
happy_var_2) Expression A0
happy_var_2
	)}}

happyReduce_54 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_54 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_54 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
16# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_54
happyReduction_54 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_54 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap26
happyOut26 HappyAbsSyn
happy_x_2 of { (HappyWrap26 Expression A0
happy_var_2) -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (A0 -> SrcSpan -> Expression A0 -> Statement A0
forall a. a -> SrcSpan -> Expression a -> Statement a
StEndfile2 () (Token -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Expression A0
happy_var_2) Expression A0
happy_var_2
	)}}

happyReduce_55 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_55 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_55 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
16# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_55
happyReduction_55 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_55 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap25
happyOut25 HappyAbsSyn
happy_x_2 of { (HappyWrap25 (AList ControlPair A0, Maybe (AList Expression A0))
happy_var_2) -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (let (AList ControlPair A0
cilist, Maybe (AList Expression A0)
iolist) = (AList ControlPair A0, Maybe (AList Expression A0))
happy_var_2 in A0
-> SrcSpan
-> AList ControlPair A0
-> Maybe (AList Expression A0)
-> Statement A0
forall a.
a
-> SrcSpan
-> AList ControlPair a
-> Maybe (AList Expression a)
-> Statement a
StWrite () (Token
-> (AList ControlPair A0, Maybe (AList Expression A0)) -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 (AList ControlPair A0, Maybe (AList Expression A0))
happy_var_2) AList ControlPair A0
cilist Maybe (AList Expression A0)
iolist
	)}}

happyReduce_56 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_56 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_56 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
16# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_56
happyReduction_56 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_56 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap25
happyOut25 HappyAbsSyn
happy_x_2 of { (HappyWrap25 (AList ControlPair A0, Maybe (AList Expression A0))
happy_var_2) -> 
	Statement A0 -> HappyAbsSyn
happyIn22
		 (let (AList ControlPair A0
cilist, Maybe (AList Expression A0)
iolist) = (AList ControlPair A0, Maybe (AList Expression A0))
happy_var_2 in A0
-> SrcSpan
-> AList ControlPair A0
-> Maybe (AList Expression A0)
-> Statement A0
forall a.
a
-> SrcSpan
-> AList ControlPair a
-> Maybe (AList Expression a)
-> Statement a
StRead () (Token
-> (AList ControlPair A0, Maybe (AList Expression A0)) -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 (AList ControlPair A0, Maybe (AList Expression A0))
happy_var_2) AList ControlPair A0
cilist Maybe (AList Expression A0)
iolist
	)}}

happyReduce_57 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_57 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_57 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
17# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_57
happyReduction_57 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_57 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap30
happyOut30 HappyAbsSyn
happy_x_1 of { (HappyWrap30 Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_3 of { (HappyWrap53 Expression A0
happy_var_3) -> 
	Statement A0 -> HappyAbsSyn
happyIn23
		 (A0 -> SrcSpan -> Expression A0 -> Expression A0 -> Statement A0
forall a.
a -> SrcSpan -> Expression a -> Expression a -> Statement a
StExpressionAssign () (Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_1 Expression A0
happy_var_3) Expression A0
happy_var_1 Expression A0
happy_var_3
	)}}

happyReduce_58 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_58 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_58 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
18# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_58
happyReduction_58 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_58 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap49
happyOut49 HappyAbsSyn
happy_x_2 of { (HappyWrap49 AList Expression A0
happy_var_2) -> 
	Statement A0 -> HappyAbsSyn
happyIn24
		 (A0 -> SrcSpan -> AList Expression A0 -> Statement A0
forall a. a -> SrcSpan -> AList Expression a -> Statement a
StExternal () (Token -> AList Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 AList Expression A0
happy_var_2) (AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Expression A0
happy_var_2)
	)}}

happyReduce_59 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_59 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_59 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
18# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_59
happyReduction_59 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_59 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap44
happyOut44 HappyAbsSyn
happy_x_2 of { (HappyWrap44 AList Declarator A0
happy_var_2) -> 
	Statement A0 -> HappyAbsSyn
happyIn24
		 (A0 -> SrcSpan -> AList Declarator A0 -> Statement A0
forall a. a -> SrcSpan -> AList Declarator a -> Statement a
StDimension () (Token -> AList Declarator A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 AList Declarator A0
happy_var_2) (AList Declarator A0 -> AList Declarator A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Declarator A0
happy_var_2)
	)}}

happyReduce_60 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_60 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_60 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
18# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_60
happyReduction_60 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_60 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap36
happyOut36 HappyAbsSyn
happy_x_2 of { (HappyWrap36 AList CommonGroup A0
happy_var_2) -> 
	Statement A0 -> HappyAbsSyn
happyIn24
		 (A0 -> SrcSpan -> AList CommonGroup A0 -> Statement A0
forall a. a -> SrcSpan -> AList CommonGroup a -> Statement a
StCommon () (Token -> AList CommonGroup A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 AList CommonGroup A0
happy_var_2) (AList CommonGroup A0 -> AList CommonGroup A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList CommonGroup A0
happy_var_2)
	)}}

happyReduce_61 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_61 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_61 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
18# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_61
happyReduction_61 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_61 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap35
happyOut35 HappyAbsSyn
happy_x_2 of { (HappyWrap35 AList (AList Expression) A0
happy_var_2) -> 
	Statement A0 -> HappyAbsSyn
happyIn24
		 (A0 -> SrcSpan -> AList (AList Expression) A0 -> Statement A0
forall a. a -> SrcSpan -> AList (AList Expression) a -> Statement a
StEquivalence () (Token -> AList (AList Expression) A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 AList (AList Expression) A0
happy_var_2) (AList (AList Expression) A0 -> AList (AList Expression) A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList (AList Expression) A0
happy_var_2)
	)}}

happyReduce_62 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_62 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_62 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
18# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_62
happyReduction_62 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_62 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap31
happyOut31 HappyAbsSyn
happy_x_2 of { (HappyWrap31 AList DataGroup A0
happy_var_2) -> 
	Statement A0 -> HappyAbsSyn
happyIn24
		 (A0 -> SrcSpan -> AList DataGroup A0 -> Statement A0
forall a. a -> SrcSpan -> AList DataGroup a -> Statement a
StData () (Token -> AList DataGroup A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 AList DataGroup A0
happy_var_2) (AList DataGroup A0 -> AList DataGroup A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList DataGroup A0
happy_var_2)
	)}}

happyReduce_63 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_63 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_63 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
18# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_63
happyReduction_63 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_63 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { Token
happy_var_2 -> 
	Statement A0 -> HappyAbsSyn
happyIn24
		 (let TBlob SrcSpan
s Name
blob = Token
happy_var_2 in A0 -> SrcSpan -> Name -> Statement A0
forall a. a -> SrcSpan -> Name -> Statement a
StFormatBogus () (Token -> SrcSpan -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 SrcSpan
s) Name
blob
	)}}

happyReduce_64 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_64 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_64 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
18# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_64
happyReduction_64 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_64 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap75
happyOut75 HappyAbsSyn
happy_x_1 of { (HappyWrap75 TypeSpec A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap42
happyOut42 HappyAbsSyn
happy_x_2 of { (HappyWrap42 AList Declarator A0
happy_var_2) -> 
	Statement A0 -> HappyAbsSyn
happyIn24
		 (A0
-> SrcSpan
-> TypeSpec A0
-> Maybe (AList Attribute A0)
-> AList Declarator A0
-> Statement A0
forall a.
a
-> SrcSpan
-> TypeSpec a
-> Maybe (AList Attribute a)
-> AList Declarator a
-> Statement a
StDeclaration () (TypeSpec A0 -> AList Declarator A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan TypeSpec A0
happy_var_1 AList Declarator A0
happy_var_2) TypeSpec A0
happy_var_1 Maybe (AList Attribute A0)
forall k1. Maybe k1
Nothing (AList Declarator A0 -> AList Declarator A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Declarator A0
happy_var_2)
	)}}

happyReduce_65 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_65 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_65 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
4# Int#
19# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_65
happyReduction_65 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_65 (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 -> HappyWrap26
happyOut26 HappyAbsSyn
happy_x_2 of { (HappyWrap26 Expression A0
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_4 of { (HappyWrap28 AList Expression A0
happy_var_4) -> 
	(AList ControlPair A0, Maybe (AList Expression A0)) -> HappyAbsSyn
happyIn25
		 ((A0 -> SrcSpan -> [ControlPair A0] -> AList ControlPair A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_2) [ A0 -> SrcSpan -> Maybe Name -> Expression A0 -> ControlPair A0
forall a.
a -> SrcSpan -> Maybe Name -> Expression a -> ControlPair a
ControlPair () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_2) Maybe Name
forall k1. Maybe k1
Nothing Expression A0
happy_var_2 ], AList Expression A0 -> Maybe (AList Expression A0)
forall k1. k1 -> Maybe k1
Just (AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Expression A0
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_66 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_66 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_66 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
6# Int#
19# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_66
happyReduction_66 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_66 (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 -> HappyWrap26
happyOut26 HappyAbsSyn
happy_x_2 of { (HappyWrap26 Expression A0
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap27
happyOut27 HappyAbsSyn
happy_x_4 of { (HappyWrap27 Expression A0
happy_var_4) -> 
	case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_6 of { (HappyWrap28 AList Expression A0
happy_var_6) -> 
	(AList ControlPair A0, Maybe (AList Expression A0)) -> HappyAbsSyn
happyIn25
		 ((A0 -> SrcSpan -> [ControlPair A0] -> AList ControlPair A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () (Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_2 Expression A0
happy_var_4) [ A0 -> SrcSpan -> Maybe Name -> Expression A0 -> ControlPair A0
forall a.
a -> SrcSpan -> Maybe Name -> Expression a -> ControlPair a
ControlPair () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_2) Maybe Name
forall k1. Maybe k1
Nothing Expression A0
happy_var_2, A0 -> SrcSpan -> Maybe Name -> Expression A0 -> ControlPair A0
forall a.
a -> SrcSpan -> Maybe Name -> Expression a -> ControlPair a
ControlPair () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_4) Maybe Name
forall k1. Maybe k1
Nothing Expression A0
happy_var_4 ], AList Expression A0 -> Maybe (AList Expression A0)
forall k1. k1 -> Maybe k1
Just (AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Expression A0
happy_var_6))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_67 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_67 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_67 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
19# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p p. p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_67
happyReduction_67 :: p -> HappyAbsSyn -> p -> HappyAbsSyn
happyReduction_67 p
happy_x_3
	HappyAbsSyn
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap26
happyOut26 HappyAbsSyn
happy_x_2 of { (HappyWrap26 Expression A0
happy_var_2) -> 
	(AList ControlPair A0, Maybe (AList Expression A0)) -> HappyAbsSyn
happyIn25
		 ((A0 -> SrcSpan -> [ControlPair A0] -> AList ControlPair A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_2) [ A0 -> SrcSpan -> Maybe Name -> Expression A0 -> ControlPair A0
forall a.
a -> SrcSpan -> Maybe Name -> Expression a -> ControlPair a
ControlPair () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_2) Maybe Name
forall k1. Maybe k1
Nothing Expression A0
happy_var_2 ], Maybe (AList Expression A0)
forall k1. Maybe k1
Nothing)
	)}

happyReduce_68 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_68 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_68 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
5# Int#
19# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_68
happyReduction_68 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_68 (HappyAbsSyn
happy_x_5 `HappyStk`
	HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> HappyWrap26
happyOut26 HappyAbsSyn
happy_x_2 of { (HappyWrap26 Expression A0
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap27
happyOut27 HappyAbsSyn
happy_x_4 of { (HappyWrap27 Expression A0
happy_var_4) -> 
	(AList ControlPair A0, Maybe (AList Expression A0)) -> HappyAbsSyn
happyIn25
		 ((A0 -> SrcSpan -> [ControlPair A0] -> AList ControlPair A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () (Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_2 Expression A0
happy_var_4) [ A0 -> SrcSpan -> Maybe Name -> Expression A0 -> ControlPair A0
forall a.
a -> SrcSpan -> Maybe Name -> Expression a -> ControlPair a
ControlPair () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_2) Maybe Name
forall k1. Maybe k1
Nothing Expression A0
happy_var_2, A0 -> SrcSpan -> Maybe Name -> Expression A0 -> ControlPair A0
forall a.
a -> SrcSpan -> Maybe Name -> Expression a -> ControlPair a
ControlPair () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_4) Maybe Name
forall k1. Maybe k1
Nothing Expression A0
happy_var_4 ], Maybe (AList Expression A0)
forall k1. Maybe k1
Nothing)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_69 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_69 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_69 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
20# HappyAbsSyn -> HappyAbsSyn
happyReduction_69
happyReduction_69 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_69 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_1 of { (HappyWrap62 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn26
		 (Expression A0
happy_var_1
	)}

happyReduce_70 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_70 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_70 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
20# HappyAbsSyn -> HappyAbsSyn
happyReduction_70
happyReduction_70 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_70 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_1 of { (HappyWrap60 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn26
		 (Expression A0
happy_var_1
	)}

happyReduce_71 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_71 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_71 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
21# HappyAbsSyn -> HappyAbsSyn
happyReduction_71
happyReduction_71 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_71 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_1 of { (HappyWrap60 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn27
		 (Expression A0
happy_var_1
	)}

happyReduce_72 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_72 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_72 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
21# HappyAbsSyn -> HappyAbsSyn
happyReduction_72
happyReduction_72 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_72 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap74
happyOut74 HappyAbsSyn
happy_x_1 of { (HappyWrap74 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn27
		 (Expression A0
happy_var_1
	)}

happyReduce_73 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_73 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_73 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
22# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_73
happyReduction_73 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_73 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap28
happyOut28 HappyAbsSyn
happy_x_1 of { (HappyWrap28 AList Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap29
happyOut29 HappyAbsSyn
happy_x_3 of { (HappyWrap29 Expression A0
happy_var_3) -> 
	AList Expression A0 -> HappyAbsSyn
happyIn28
		 (SrcSpan -> AList Expression A0 -> AList Expression A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (AList Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList Expression A0
happy_var_1 Expression A0
happy_var_3) (AList Expression A0 -> AList Expression A0)
-> AList Expression A0 -> AList Expression A0
forall a b. (a -> b) -> a -> b
$ Expression A0
happy_var_3 Expression A0 -> AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. t a -> AList t a -> AList t a
`aCons` AList Expression A0
happy_var_1
	)}}

happyReduce_74 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_74 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_74 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
22# HappyAbsSyn -> HappyAbsSyn
happyReduction_74
happyReduction_74 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_74 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap29
happyOut29 HappyAbsSyn
happy_x_1 of { (HappyWrap29 Expression A0
happy_var_1) -> 
	AList Expression A0 -> HappyAbsSyn
happyIn28
		 (A0 -> SrcSpan -> [Expression A0] -> AList Expression A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_1) [ Expression A0
happy_var_1 ]
	)}

happyReduce_75 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_75 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_75 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
23# HappyAbsSyn -> HappyAbsSyn
happyReduction_75
happyReduction_75 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_75 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_1 of { (HappyWrap60 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn29
		 (Expression A0
happy_var_1
	)}

happyReduce_76 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_76 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_76 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
23# HappyAbsSyn -> HappyAbsSyn
happyReduction_76
happyReduction_76 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_76 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap55
happyOut55 HappyAbsSyn
happy_x_1 of { (HappyWrap55 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn29
		 (Expression A0
happy_var_1
	)}

happyReduce_77 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_77 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_77 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
5# Int#
23# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_77
happyReduction_77 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_77 (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 AList Expression A0
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap20
happyOut20 HappyAbsSyn
happy_x_4 of { (HappyWrap20 DoSpecification A0
happy_var_4) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_5 of { Token
happy_var_5 -> 
	Expression A0 -> HappyAbsSyn
happyIn29
		 (A0
-> SrcSpan
-> AList Expression A0
-> DoSpecification A0
-> Expression A0
forall a.
a
-> SrcSpan
-> AList Expression a
-> DoSpecification a
-> Expression a
ExpImpliedDo () (Token -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Token
happy_var_5) AList Expression A0
happy_var_2 DoSpecification A0
happy_var_4
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_78 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_78 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_78 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_78
happyReduction_78 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_78 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_1 of { (HappyWrap60 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn30
		 (Expression A0
happy_var_1
	)}

happyReduce_79 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_79 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_79 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
24# HappyAbsSyn -> HappyAbsSyn
happyReduction_79
happyReduction_79 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_79 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap55
happyOut55 HappyAbsSyn
happy_x_1 of { (HappyWrap55 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn30
		 (Expression A0
happy_var_1
	)}

happyReduce_80 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_80 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_80 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
6# Int#
25# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_80
happyReduction_80 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_80 (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 -> HappyWrap31
happyOut31 HappyAbsSyn
happy_x_1 of { (HappyWrap31 AList DataGroup A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_3 of { (HappyWrap40 AList Expression A0
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap32
happyOut32 HappyAbsSyn
happy_x_5 of { (HappyWrap32 AList Expression A0
happy_var_5) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_6 of { Token
happy_var_6 -> 
	AList DataGroup A0 -> HappyAbsSyn
happyIn31
		 (SrcSpan -> AList DataGroup A0 -> AList DataGroup A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (AList DataGroup A0 -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList DataGroup A0
happy_var_1 Token
happy_var_6) (AList DataGroup A0 -> AList DataGroup A0)
-> AList DataGroup A0 -> AList DataGroup A0
forall a b. (a -> b) -> a -> b
$ (A0
-> SrcSpan
-> AList Expression A0
-> AList Expression A0
-> DataGroup A0
forall a.
a
-> SrcSpan
-> AList Expression a
-> AList Expression a
-> DataGroup a
DataGroup () (AList Expression A0 -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList Expression A0
happy_var_3 Token
happy_var_6) (AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Expression A0
happy_var_3) (AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Expression A0
happy_var_5)) DataGroup A0 -> AList DataGroup A0 -> AList DataGroup A0
forall (t :: * -> *) a. t a -> AList t a -> AList t a
`aCons` AList DataGroup A0
happy_var_1
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_81 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_81 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_81 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
4# Int#
25# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_81
happyReduction_81 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_81 (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 -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_1 of { (HappyWrap40 AList Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap32
happyOut32 HappyAbsSyn
happy_x_3 of { (HappyWrap32 AList Expression A0
happy_var_3) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_4 of { Token
happy_var_4 -> 
	AList DataGroup A0 -> HappyAbsSyn
happyIn31
		 (A0 -> SrcSpan -> [DataGroup A0] -> AList DataGroup A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () (AList Expression A0 -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList Expression A0
happy_var_1 Token
happy_var_4) [ A0
-> SrcSpan
-> AList Expression A0
-> AList Expression A0
-> DataGroup A0
forall a.
a
-> SrcSpan
-> AList Expression a
-> AList Expression a
-> DataGroup a
DataGroup () (AList Expression A0 -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList Expression A0
happy_var_1 Token
happy_var_4) (AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Expression A0
happy_var_1) (AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Expression A0
happy_var_3) ]
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_82 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_82 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_82 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
26# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_82
happyReduction_82 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_82 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap32
happyOut32 HappyAbsSyn
happy_x_1 of { (HappyWrap32 AList Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap33
happyOut33 HappyAbsSyn
happy_x_3 of { (HappyWrap33 Expression A0
happy_var_3) -> 
	AList Expression A0 -> HappyAbsSyn
happyIn32
		 (SrcSpan -> AList Expression A0 -> AList Expression A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (AList Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList Expression A0
happy_var_1 Expression A0
happy_var_3) (AList Expression A0 -> AList Expression A0)
-> AList Expression A0 -> AList Expression A0
forall a b. (a -> b) -> a -> b
$ Expression A0
happy_var_3 Expression A0 -> AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. t a -> AList t a -> AList t a
`aCons` AList Expression A0
happy_var_1
	)}}

happyReduce_83 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_83 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_83 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
26# HappyAbsSyn -> HappyAbsSyn
happyReduction_83
happyReduction_83 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_83 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap33
happyOut33 HappyAbsSyn
happy_x_1 of { (HappyWrap33 Expression A0
happy_var_1) -> 
	AList Expression A0 -> HappyAbsSyn
happyIn32
		 (A0 -> SrcSpan -> [Expression A0] -> AList Expression A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_1) [ Expression A0
happy_var_1 ]
	)}

happyReduce_84 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_84 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_84 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
27# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_84
happyReduction_84 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_84 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_1 of { (HappyWrap62 Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap34
happyOut34 HappyAbsSyn
happy_x_3 of { (HappyWrap34 Expression A0
happy_var_3) -> 
	Expression A0 -> HappyAbsSyn
happyIn33
		 (A0
-> SrcSpan
-> BinaryOp
-> Expression A0
-> Expression A0
-> Expression A0
forall a.
a
-> SrcSpan
-> BinaryOp
-> Expression a
-> Expression a
-> Expression a
ExpBinary () (Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_1 Expression A0
happy_var_3) BinaryOp
Multiplication Expression A0
happy_var_1 Expression A0
happy_var_3
	)}}

happyReduce_85 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_85 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_85 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
27# HappyAbsSyn -> HappyAbsSyn
happyReduction_85
happyReduction_85 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_85 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap34
happyOut34 HappyAbsSyn
happy_x_1 of { (HappyWrap34 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn33
		 (Expression A0
happy_var_1
	)}

happyReduce_86 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_86 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_86 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
28# HappyAbsSyn -> HappyAbsSyn
happyReduction_86
happyReduction_86 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_86 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap67
happyOut67 HappyAbsSyn
happy_x_1 of { (HappyWrap67 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn34
		 (Expression A0
happy_var_1
	)}

happyReduce_87 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_87 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_87 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
28# HappyAbsSyn -> HappyAbsSyn
happyReduction_87
happyReduction_87 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_87 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap68
happyOut68 HappyAbsSyn
happy_x_1 of { (HappyWrap68 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn34
		 (Expression A0
happy_var_1
	)}

happyReduce_88 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_88 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_88 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
28# HappyAbsSyn -> HappyAbsSyn
happyReduction_88
happyReduction_88 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_88 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap69
happyOut69 HappyAbsSyn
happy_x_1 of { (HappyWrap69 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn34
		 (Expression A0
happy_var_1
	)}

happyReduce_89 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_89 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_89 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
28# HappyAbsSyn -> HappyAbsSyn
happyReduction_89
happyReduction_89 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_89 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap70
happyOut70 HappyAbsSyn
happy_x_1 of { (HappyWrap70 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn34
		 (Expression A0
happy_var_1
	)}

happyReduce_90 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_90 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_90 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
5# Int#
29# 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 -> HappyWrap35
happyOut35 HappyAbsSyn
happy_x_1 of { (HappyWrap35 AList (AList Expression) A0
happy_var_1) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { Token
happy_var_3 -> 
	case HappyAbsSyn -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_4 of { (HappyWrap40 AList Expression A0
happy_var_4) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_5 of { Token
happy_var_5 -> 
	AList (AList Expression) A0 -> HappyAbsSyn
happyIn35
		 (SrcSpan
-> AList (AList Expression) A0 -> AList (AList Expression) A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (AList (AList Expression) A0 -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList (AList Expression) A0
happy_var_1 Token
happy_var_5) (AList (AList Expression) A0 -> AList (AList Expression) A0)
-> AList (AList Expression) A0 -> AList (AList Expression) A0
forall a b. (a -> b) -> a -> b
$ (SrcSpan -> AList Expression A0 -> AList Expression A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (Token -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_3 Token
happy_var_5) (AList Expression A0 -> AList Expression A0)
-> AList Expression A0 -> AList Expression A0
forall a b. (a -> b) -> a -> b
$ AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Expression A0
happy_var_4) AList Expression A0
-> AList (AList Expression) A0 -> AList (AList Expression) A0
forall (t :: * -> *) a. t a -> AList t a -> AList t a
`aCons` AList (AList Expression) A0
happy_var_1
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_91 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_91 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_91 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
29# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_91
happyReduction_91 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_91 HappyAbsSyn
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 -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_2 of { (HappyWrap40 AList Expression A0
happy_var_2) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { Token
happy_var_3 -> 
	AList (AList Expression) A0 -> HappyAbsSyn
happyIn35
		 (let s :: SrcSpan
s = (Token -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Token
happy_var_3) in A0
-> SrcSpan -> [AList Expression A0] -> AList (AList Expression) A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () SrcSpan
s [ SrcSpan -> AList Expression A0 -> AList Expression A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan SrcSpan
s (AList Expression A0 -> AList Expression A0)
-> AList Expression A0 -> AList Expression A0
forall a b. (a -> b) -> a -> b
$ AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Expression A0
happy_var_2 ]
	)}}}

happyReduce_92 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_92 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_92 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
30# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_92
happyReduction_92 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_92 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap36
happyOut36 HappyAbsSyn
happy_x_1 of { (HappyWrap36 AList CommonGroup A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap37
happyOut37 HappyAbsSyn
happy_x_2 of { (HappyWrap37 CommonGroup A0
happy_var_2) -> 
	AList CommonGroup A0 -> HappyAbsSyn
happyIn36
		 (SrcSpan -> AList CommonGroup A0 -> AList CommonGroup A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (AList CommonGroup A0 -> CommonGroup A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList CommonGroup A0
happy_var_1 CommonGroup A0
happy_var_2) (AList CommonGroup A0 -> AList CommonGroup A0)
-> AList CommonGroup A0 -> AList CommonGroup A0
forall a b. (a -> b) -> a -> b
$ CommonGroup A0
happy_var_2 CommonGroup A0 -> AList CommonGroup A0 -> AList CommonGroup A0
forall (t :: * -> *) a. t a -> AList t a -> AList t a
`aCons` AList CommonGroup A0
happy_var_1
	)}}

happyReduce_93 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_93 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_93 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
30# HappyAbsSyn -> HappyAbsSyn
happyReduction_93
happyReduction_93 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_93 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap38
happyOut38 HappyAbsSyn
happy_x_1 of { (HappyWrap38 CommonGroup A0
happy_var_1) -> 
	AList CommonGroup A0 -> HappyAbsSyn
happyIn36
		 (A0 -> SrcSpan -> [CommonGroup A0] -> AList CommonGroup A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () (CommonGroup A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan CommonGroup A0
happy_var_1) [ CommonGroup A0
happy_var_1 ]
	)}

happyReduce_94 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_94 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_94 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
31# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_94
happyReduction_94 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_94 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_1 of { (HappyWrap39 Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_2 of { (HappyWrap40 AList Expression A0
happy_var_2) -> 
	CommonGroup A0 -> HappyAbsSyn
happyIn37
		 (A0
-> SrcSpan
-> Maybe (Expression A0)
-> AList Expression A0
-> CommonGroup A0
forall a.
a
-> SrcSpan
-> Maybe (Expression a)
-> AList Expression a
-> CommonGroup a
CommonGroup () (Expression A0 -> AList Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_1 AList Expression A0
happy_var_2) (Expression A0 -> Maybe (Expression A0)
forall k1. k1 -> Maybe k1
Just Expression A0
happy_var_1) (AList Expression A0 -> CommonGroup A0)
-> AList Expression A0 -> CommonGroup A0
forall a b. (a -> b) -> a -> b
$ AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Expression A0
happy_var_2
	)}}

happyReduce_95 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_95 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_95 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
31# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_95
happyReduction_95 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_95 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_3 of { (HappyWrap40 AList Expression A0
happy_var_3) -> 
	CommonGroup A0 -> HappyAbsSyn
happyIn37
		 (A0
-> SrcSpan
-> Maybe (Expression A0)
-> AList Expression A0
-> CommonGroup A0
forall a.
a
-> SrcSpan
-> Maybe (Expression a)
-> AList Expression a
-> CommonGroup a
CommonGroup () (Token -> AList Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 AList Expression A0
happy_var_3) Maybe (Expression A0)
forall k1. Maybe k1
Nothing (AList Expression A0 -> CommonGroup A0)
-> AList Expression A0 -> CommonGroup A0
forall a b. (a -> b) -> a -> b
$ AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Expression A0
happy_var_3
	)}}

happyReduce_96 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_96 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_96 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
32# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_96
happyReduction_96 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_96 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap39
happyOut39 HappyAbsSyn
happy_x_1 of { (HappyWrap39 Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_2 of { (HappyWrap40 AList Expression A0
happy_var_2) -> 
	CommonGroup A0 -> HappyAbsSyn
happyIn38
		 (A0
-> SrcSpan
-> Maybe (Expression A0)
-> AList Expression A0
-> CommonGroup A0
forall a.
a
-> SrcSpan
-> Maybe (Expression a)
-> AList Expression a
-> CommonGroup a
CommonGroup () (Expression A0 -> AList Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_1 AList Expression A0
happy_var_2) (Expression A0 -> Maybe (Expression A0)
forall k1. k1 -> Maybe k1
Just Expression A0
happy_var_1) (AList Expression A0 -> CommonGroup A0)
-> AList Expression A0 -> CommonGroup A0
forall a b. (a -> b) -> a -> b
$ AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Expression A0
happy_var_2
	)}}

happyReduce_97 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_97 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_97 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
32# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_97
happyReduction_97 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_97 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_3 of { (HappyWrap40 AList Expression A0
happy_var_3) -> 
	CommonGroup A0 -> HappyAbsSyn
happyIn38
		 (A0
-> SrcSpan
-> Maybe (Expression A0)
-> AList Expression A0
-> CommonGroup A0
forall a.
a
-> SrcSpan
-> Maybe (Expression a)
-> AList Expression a
-> CommonGroup a
CommonGroup () (Token -> AList Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 AList Expression A0
happy_var_3) Maybe (Expression A0)
forall k1. Maybe k1
Nothing (AList Expression A0 -> CommonGroup A0)
-> AList Expression A0 -> CommonGroup A0
forall a b. (a -> b) -> a -> b
$ AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Expression A0
happy_var_3
	)}}

happyReduce_98 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_98 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_98 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
32# HappyAbsSyn -> HappyAbsSyn
happyReduction_98
happyReduction_98 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_98 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_1 of { (HappyWrap40 AList Expression A0
happy_var_1) -> 
	CommonGroup A0 -> HappyAbsSyn
happyIn38
		 (A0
-> SrcSpan
-> Maybe (Expression A0)
-> AList Expression A0
-> CommonGroup A0
forall a.
a
-> SrcSpan
-> Maybe (Expression a)
-> AList Expression a
-> CommonGroup a
CommonGroup () (AList Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan AList Expression A0
happy_var_1) Maybe (Expression A0)
forall k1. Maybe k1
Nothing (AList Expression A0 -> CommonGroup A0)
-> AList Expression A0 -> CommonGroup A0
forall a b. (a -> b) -> a -> b
$ AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Expression A0
happy_var_1
	)}

happyReduce_99 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_99 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_99 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
33# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_99
happyReduction_99 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_99 HappyAbsSyn
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 -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_2 of { (HappyWrap60 Expression A0
happy_var_2) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { Token
happy_var_3 -> 
	Expression A0 -> HappyAbsSyn
happyIn39
		 (SrcSpan -> Expression A0 -> Expression A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (Token -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Token
happy_var_3) Expression A0
happy_var_2
	)}}}

happyReduce_100 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_100 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_100 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
34# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
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 -> HappyWrap40
happyOut40 HappyAbsSyn
happy_x_1 of { (HappyWrap40 AList Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap41
happyOut41 HappyAbsSyn
happy_x_3 of { (HappyWrap41 Expression A0
happy_var_3) -> 
	AList Expression A0 -> HappyAbsSyn
happyIn40
		 (SrcSpan -> AList Expression A0 -> AList Expression A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (AList Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList Expression A0
happy_var_1 Expression A0
happy_var_3) (AList Expression A0 -> AList Expression A0)
-> AList Expression A0 -> AList Expression A0
forall a b. (a -> b) -> a -> b
$ Expression A0
happy_var_3 Expression A0 -> AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. t a -> AList t a -> AList t a
`aCons` AList Expression A0
happy_var_1
	)}}

happyReduce_101 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_101 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_101 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
34# HappyAbsSyn -> HappyAbsSyn
happyReduction_101
happyReduction_101 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_101 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap41
happyOut41 HappyAbsSyn
happy_x_1 of { (HappyWrap41 Expression A0
happy_var_1) -> 
	AList Expression A0 -> HappyAbsSyn
happyIn40
		 (A0 -> SrcSpan -> [Expression A0] -> AList Expression A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_1) [ Expression A0
happy_var_1 ]
	)}

happyReduce_102 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_102 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_102 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
35# HappyAbsSyn -> HappyAbsSyn
happyReduction_102
happyReduction_102 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_102 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_1 of { (HappyWrap60 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn41
		 (Expression A0
happy_var_1
	)}

happyReduce_103 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_103 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_103 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
35# HappyAbsSyn -> HappyAbsSyn
happyReduction_103
happyReduction_103 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_103 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap55
happyOut55 HappyAbsSyn
happy_x_1 of { (HappyWrap55 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn41
		 (Expression A0
happy_var_1
	)}

happyReduce_104 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_104 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_104 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
36# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
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 AList Declarator A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap43
happyOut43 HappyAbsSyn
happy_x_3 of { (HappyWrap43 Declarator A0
happy_var_3) -> 
	AList Declarator A0 -> HappyAbsSyn
happyIn42
		 (SrcSpan -> AList Declarator A0 -> AList Declarator A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (AList Declarator A0 -> Declarator A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList Declarator A0
happy_var_1 Declarator A0
happy_var_3) (AList Declarator A0 -> AList Declarator A0)
-> AList Declarator A0 -> AList Declarator A0
forall a b. (a -> b) -> a -> b
$ Declarator A0
happy_var_3 Declarator A0 -> AList Declarator A0 -> AList Declarator A0
forall (t :: * -> *) a. t a -> AList t a -> AList t a
`aCons` AList Declarator A0
happy_var_1
	)}}

happyReduce_105 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_105 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_105 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
36# HappyAbsSyn -> HappyAbsSyn
happyReduction_105
happyReduction_105 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_105 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap43
happyOut43 HappyAbsSyn
happy_x_1 of { (HappyWrap43 Declarator A0
happy_var_1) -> 
	AList Declarator A0 -> HappyAbsSyn
happyIn42
		 (A0 -> SrcSpan -> [Declarator A0] -> AList Declarator A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () (Declarator A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Declarator A0
happy_var_1) [ Declarator A0
happy_var_1 ]
	)}

happyReduce_106 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_106 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_106 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
37# HappyAbsSyn -> HappyAbsSyn
happyReduction_106
happyReduction_106 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_106 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
happy_x_1 of { (HappyWrap45 Declarator A0
happy_var_1) -> 
	Declarator A0 -> HappyAbsSyn
happyIn43
		 (Declarator A0
happy_var_1
	)}

happyReduce_107 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_107 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_107 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
37# HappyAbsSyn -> HappyAbsSyn
happyReduction_107
happyReduction_107 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_107 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap48
happyOut48 HappyAbsSyn
happy_x_1 of { (HappyWrap48 Declarator A0
happy_var_1) -> 
	Declarator A0 -> HappyAbsSyn
happyIn43
		 (Declarator A0
happy_var_1
	)}

happyReduce_108 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_108 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_108 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
38# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_108
happyReduction_108 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_108 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap44
happyOut44 HappyAbsSyn
happy_x_1 of { (HappyWrap44 AList Declarator A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
happy_x_3 of { (HappyWrap45 Declarator A0
happy_var_3) -> 
	AList Declarator A0 -> HappyAbsSyn
happyIn44
		 (SrcSpan -> AList Declarator A0 -> AList Declarator A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (AList Declarator A0 -> Declarator A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList Declarator A0
happy_var_1 Declarator A0
happy_var_3) (AList Declarator A0 -> AList Declarator A0)
-> AList Declarator A0 -> AList Declarator A0
forall a b. (a -> b) -> a -> b
$ Declarator A0
happy_var_3 Declarator A0 -> AList Declarator A0 -> AList Declarator A0
forall (t :: * -> *) a. t a -> AList t a -> AList t a
`aCons` AList Declarator A0
happy_var_1
	)}}

happyReduce_109 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_109 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_109 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
38# HappyAbsSyn -> HappyAbsSyn
happyReduction_109
happyReduction_109 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_109 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap45
happyOut45 HappyAbsSyn
happy_x_1 of { (HappyWrap45 Declarator A0
happy_var_1) -> 
	AList Declarator A0 -> HappyAbsSyn
happyIn44
		 (A0 -> SrcSpan -> [Declarator A0] -> AList Declarator A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () (Declarator A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Declarator A0
happy_var_1) [ Declarator A0
happy_var_1 ]
	)}

happyReduce_110 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_110 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_110 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
4# Int#
39# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_110
happyReduction_110 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_110 (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 -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_1 of { (HappyWrap60 Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_3 of { (HappyWrap46 AList DimensionDeclarator A0
happy_var_3) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_4 of { Token
happy_var_4 -> 
	Declarator A0 -> HappyAbsSyn
happyIn45
		 (A0
-> SrcSpan
-> Expression A0
-> AList DimensionDeclarator A0
-> Maybe (Expression A0)
-> Maybe (Expression A0)
-> Declarator A0
forall a.
a
-> SrcSpan
-> Expression a
-> AList DimensionDeclarator a
-> Maybe (Expression a)
-> Maybe (Expression a)
-> Declarator a
DeclArray () (Expression A0 -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_1 Token
happy_var_4) Expression A0
happy_var_1 (AList DimensionDeclarator A0 -> AList DimensionDeclarator A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList DimensionDeclarator A0
happy_var_3) Maybe (Expression A0)
forall k1. Maybe k1
Nothing Maybe (Expression A0)
forall k1. Maybe k1
Nothing
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_111 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_111 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_111 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
40# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_111
happyReduction_111 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_111 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap46
happyOut46 HappyAbsSyn
happy_x_1 of { (HappyWrap46 AList DimensionDeclarator A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_3 of { (HappyWrap47 DimensionDeclarator A0
happy_var_3) -> 
	AList DimensionDeclarator A0 -> HappyAbsSyn
happyIn46
		 (SrcSpan
-> AList DimensionDeclarator A0 -> AList DimensionDeclarator A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (AList DimensionDeclarator A0 -> DimensionDeclarator A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList DimensionDeclarator A0
happy_var_1 DimensionDeclarator A0
happy_var_3) (AList DimensionDeclarator A0 -> AList DimensionDeclarator A0)
-> AList DimensionDeclarator A0 -> AList DimensionDeclarator A0
forall a b. (a -> b) -> a -> b
$ DimensionDeclarator A0
happy_var_3 DimensionDeclarator A0
-> AList DimensionDeclarator A0 -> AList DimensionDeclarator A0
forall (t :: * -> *) a. t a -> AList t a -> AList t a
`aCons` AList DimensionDeclarator A0
happy_var_1
	)}}

happyReduce_112 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_112 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_112 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
40# HappyAbsSyn -> HappyAbsSyn
happyReduction_112
happyReduction_112 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_112 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap47
happyOut47 HappyAbsSyn
happy_x_1 of { (HappyWrap47 DimensionDeclarator A0
happy_var_1) -> 
	AList DimensionDeclarator A0 -> HappyAbsSyn
happyIn46
		 (A0
-> SrcSpan
-> [DimensionDeclarator A0]
-> AList DimensionDeclarator A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () (DimensionDeclarator A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan DimensionDeclarator A0
happy_var_1) [ DimensionDeclarator A0
happy_var_1 ]
	)}

happyReduce_113 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_113 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_113 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
41# HappyAbsSyn -> HappyAbsSyn
happyReduction_113
happyReduction_113 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_113 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_1 of { (HappyWrap53 Expression A0
happy_var_1) -> 
	DimensionDeclarator A0 -> HappyAbsSyn
happyIn47
		 (A0
-> SrcSpan
-> Maybe (Expression A0)
-> Maybe (Expression A0)
-> DimensionDeclarator A0
forall a.
a
-> SrcSpan
-> Maybe (Expression a)
-> Maybe (Expression a)
-> DimensionDeclarator a
DimensionDeclarator () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_1) Maybe (Expression A0)
forall k1. Maybe k1
Nothing (Expression A0 -> Maybe (Expression A0)
forall k1. k1 -> Maybe k1
Just Expression A0
happy_var_1)
	)}

happyReduce_114 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_114 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_114 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
42# HappyAbsSyn -> HappyAbsSyn
happyReduction_114
happyReduction_114 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_114 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_1 of { (HappyWrap60 Expression A0
happy_var_1) -> 
	Declarator A0 -> HappyAbsSyn
happyIn48
		 (A0
-> SrcSpan
-> Expression A0
-> Maybe (Expression A0)
-> Maybe (Expression A0)
-> Declarator A0
forall a.
a
-> SrcSpan
-> Expression a
-> Maybe (Expression a)
-> Maybe (Expression a)
-> Declarator a
DeclVariable () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_1) Expression A0
happy_var_1 Maybe (Expression A0)
forall k1. Maybe k1
Nothing Maybe (Expression A0)
forall k1. Maybe k1
Nothing
	)}

happyReduce_115 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_115 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_115 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
43# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_115
happyReduction_115 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_115 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap49
happyOut49 HappyAbsSyn
happy_x_1 of { (HappyWrap49 AList Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_3 of { (HappyWrap60 Expression A0
happy_var_3) -> 
	AList Expression A0 -> HappyAbsSyn
happyIn49
		 (SrcSpan -> AList Expression A0 -> AList Expression A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (AList Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList Expression A0
happy_var_1 Expression A0
happy_var_3) (AList Expression A0 -> AList Expression A0)
-> AList Expression A0 -> AList Expression A0
forall a b. (a -> b) -> a -> b
$ Expression A0
happy_var_3 Expression A0 -> AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. t a -> AList t a -> AList t a
`aCons` AList Expression A0
happy_var_1
	)}}

happyReduce_116 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_116 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_116 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
43# HappyAbsSyn -> HappyAbsSyn
happyReduction_116
happyReduction_116 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_116 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_1 of { (HappyWrap60 Expression A0
happy_var_1) -> 
	AList Expression A0 -> HappyAbsSyn
happyIn49
		 (A0 -> SrcSpan -> [Expression A0] -> AList Expression A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_1) [ Expression A0
happy_var_1 ]
	)}

happyReduce_117 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_117 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_117 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
44# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_117
happyReduction_117 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_117 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap51
happyOut51 HappyAbsSyn
happy_x_1 of { (HappyWrap51 AList Argument A0
happy_var_1) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { Token
happy_var_2 -> 
	AList Argument A0 -> HappyAbsSyn
happyIn50
		 (SrcSpan -> AList Argument A0 -> AList Argument A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (AList Argument A0 -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList Argument A0
happy_var_1 Token
happy_var_2) (AList Argument A0 -> AList Argument A0)
-> AList Argument A0 -> AList Argument A0
forall a b. (a -> b) -> a -> b
$ AList Argument A0 -> AList Argument A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Argument A0
happy_var_1
	)}}

happyReduce_118 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_118 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_118 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
45# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
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 -> HappyWrap51
happyOut51 HappyAbsSyn
happy_x_1 of { (HappyWrap51 AList Argument A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap52
happyOut52 HappyAbsSyn
happy_x_3 of { (HappyWrap52 Argument A0
happy_var_3) -> 
	AList Argument A0 -> HappyAbsSyn
happyIn51
		 (SrcSpan -> AList Argument A0 -> AList Argument A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (AList Argument A0 -> Argument A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList Argument A0
happy_var_1 Argument A0
happy_var_3) (AList Argument A0 -> AList Argument A0)
-> AList Argument A0 -> AList Argument A0
forall a b. (a -> b) -> a -> b
$ Argument A0
happy_var_3 Argument A0 -> AList Argument A0 -> AList Argument A0
forall (t :: * -> *) a. t a -> AList t a -> AList t a
`aCons` AList Argument A0
happy_var_1
	)}}

happyReduce_119 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_119 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_119 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
45# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_119
happyReduction_119 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_119 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 Argument A0
happy_var_2) -> 
	AList Argument A0 -> HappyAbsSyn
happyIn51
		 (A0 -> SrcSpan -> [Argument A0] -> AList Argument A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () (Token -> Argument A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Argument A0
happy_var_2) [ Argument A0
happy_var_2 ]
	)}}

happyReduce_120 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_120 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_120 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
45# HappyAbsSyn -> HappyAbsSyn
happyReduction_120
happyReduction_120 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_120 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	AList Argument A0 -> HappyAbsSyn
happyIn51
		 (A0 -> SrcSpan -> [Argument A0] -> AList Argument A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () (Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1) [ ]
	)}

happyReduce_121 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_121 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_121 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
46# HappyAbsSyn -> HappyAbsSyn
happyReduction_121
happyReduction_121 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_121 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap70
happyOut70 HappyAbsSyn
happy_x_1 of { (HappyWrap70 Expression A0
happy_var_1) -> 
	Argument A0 -> HappyAbsSyn
happyIn52
		 (A0 -> SrcSpan -> Maybe Name -> Expression A0 -> Argument A0
forall a. a -> SrcSpan -> Maybe Name -> Expression a -> Argument a
Argument () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_1) Maybe Name
forall k1. Maybe k1
Nothing Expression A0
happy_var_1
	)}

happyReduce_122 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_122 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_122 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
46# HappyAbsSyn -> HappyAbsSyn
happyReduction_122
happyReduction_122 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_122 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_1 of { (HappyWrap53 Expression A0
happy_var_1) -> 
	Argument A0 -> HappyAbsSyn
happyIn52
		 (A0 -> SrcSpan -> Maybe Name -> Expression A0 -> Argument A0
forall a. a -> SrcSpan -> Maybe Name -> Expression a -> Argument a
Argument () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_1) Maybe Name
forall k1. Maybe k1
Nothing Expression A0
happy_var_1
	)}

happyReduce_123 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_123 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_123 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
47# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_123
happyReduction_123 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_123 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_1 of { (HappyWrap53 Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_3 of { (HappyWrap53 Expression A0
happy_var_3) -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (A0
-> SrcSpan
-> BinaryOp
-> Expression A0
-> Expression A0
-> Expression A0
forall a.
a
-> SrcSpan
-> BinaryOp
-> Expression a
-> Expression a
-> Expression a
ExpBinary () (Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_1 Expression A0
happy_var_3) BinaryOp
Addition Expression A0
happy_var_1 Expression A0
happy_var_3
	)}}

happyReduce_124 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_124 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_124 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
47# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_124
happyReduction_124 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_124 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_1 of { (HappyWrap53 Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_3 of { (HappyWrap53 Expression A0
happy_var_3) -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (A0
-> SrcSpan
-> BinaryOp
-> Expression A0
-> Expression A0
-> Expression A0
forall a.
a
-> SrcSpan
-> BinaryOp
-> Expression a
-> Expression a
-> Expression a
ExpBinary () (Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_1 Expression A0
happy_var_3) BinaryOp
Subtraction Expression A0
happy_var_1 Expression A0
happy_var_3
	)}}

happyReduce_125 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_125 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_125 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
47# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_125
happyReduction_125 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_125 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_1 of { (HappyWrap53 Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_3 of { (HappyWrap53 Expression A0
happy_var_3) -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (A0
-> SrcSpan
-> BinaryOp
-> Expression A0
-> Expression A0
-> Expression A0
forall a.
a
-> SrcSpan
-> BinaryOp
-> Expression a
-> Expression a
-> Expression a
ExpBinary () (Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_1 Expression A0
happy_var_3) BinaryOp
Multiplication Expression A0
happy_var_1 Expression A0
happy_var_3
	)}}

happyReduce_126 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_126 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_126 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
47# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_126
happyReduction_126 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_126 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_1 of { (HappyWrap53 Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_3 of { (HappyWrap53 Expression A0
happy_var_3) -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (A0
-> SrcSpan
-> BinaryOp
-> Expression A0
-> Expression A0
-> Expression A0
forall a.
a
-> SrcSpan
-> BinaryOp
-> Expression a
-> Expression a
-> Expression a
ExpBinary () (Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_1 Expression A0
happy_var_3) BinaryOp
Division Expression A0
happy_var_1 Expression A0
happy_var_3
	)}}

happyReduce_127 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_127 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_127 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
47# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_127
happyReduction_127 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_127 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_1 of { (HappyWrap53 Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_3 of { (HappyWrap53 Expression A0
happy_var_3) -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (A0
-> SrcSpan
-> BinaryOp
-> Expression A0
-> Expression A0
-> Expression A0
forall a.
a
-> SrcSpan
-> BinaryOp
-> Expression a
-> Expression a
-> Expression a
ExpBinary () (Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_1 Expression A0
happy_var_3) BinaryOp
Exponentiation Expression A0
happy_var_1 Expression A0
happy_var_3
	)}}

happyReduce_128 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_128 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_128 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
47# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_128
happyReduction_128 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_128 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap57
happyOut57 HappyAbsSyn
happy_x_1 of { (HappyWrap57 (SrcSpan, UnaryOp)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_2 of { (HappyWrap53 Expression A0
happy_var_2) -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (A0 -> SrcSpan -> UnaryOp -> Expression A0 -> Expression A0
forall a. a -> SrcSpan -> UnaryOp -> Expression a -> Expression a
ExpUnary () (SrcSpan -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan ((SrcSpan, UnaryOp) -> SrcSpan
forall a b. (a, b) -> a
fst (SrcSpan, UnaryOp)
happy_var_1) Expression A0
happy_var_2) ((SrcSpan, UnaryOp) -> UnaryOp
forall a b. (a, b) -> b
snd (SrcSpan, UnaryOp)
happy_var_1) Expression A0
happy_var_2
	)}}

happyReduce_129 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_129 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_129 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
47# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_129
happyReduction_129 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_129 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_1 of { (HappyWrap53 Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_3 of { (HappyWrap53 Expression A0
happy_var_3) -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (A0
-> SrcSpan
-> BinaryOp
-> Expression A0
-> Expression A0
-> Expression A0
forall a.
a
-> SrcSpan
-> BinaryOp
-> Expression a
-> Expression a
-> Expression a
ExpBinary () (Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_1 Expression A0
happy_var_3) BinaryOp
Or Expression A0
happy_var_1 Expression A0
happy_var_3
	)}}

happyReduce_130 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_130 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_130 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
47# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_130
happyReduction_130 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_130 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_1 of { (HappyWrap53 Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_3 of { (HappyWrap53 Expression A0
happy_var_3) -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (A0
-> SrcSpan
-> BinaryOp
-> Expression A0
-> Expression A0
-> Expression A0
forall a.
a
-> SrcSpan
-> BinaryOp
-> Expression a
-> Expression a
-> Expression a
ExpBinary () (Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_1 Expression A0
happy_var_3) BinaryOp
And Expression A0
happy_var_1 Expression A0
happy_var_3
	)}}

happyReduce_131 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_131 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_131 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
47# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_131
happyReduction_131 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_131 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_2 of { (HappyWrap53 Expression A0
happy_var_2) -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (A0 -> SrcSpan -> UnaryOp -> Expression A0 -> Expression A0
forall a. a -> SrcSpan -> UnaryOp -> Expression a -> Expression a
ExpUnary () (Token -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Expression A0
happy_var_2) UnaryOp
Not Expression A0
happy_var_2
	)}}

happyReduce_132 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_132 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_132 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
47# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_132
happyReduction_132 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_132 HappyAbsSyn
happy_x_3
	HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_1 of { (HappyWrap53 Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap54
happyOut54 HappyAbsSyn
happy_x_2 of { (HappyWrap54 BinaryOp
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_3 of { (HappyWrap53 Expression A0
happy_var_3) -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (A0
-> SrcSpan
-> BinaryOp
-> Expression A0
-> Expression A0
-> Expression A0
forall a.
a
-> SrcSpan
-> BinaryOp
-> Expression a
-> Expression a
-> Expression a
ExpBinary () (Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_1 Expression A0
happy_var_3) BinaryOp
happy_var_2 Expression A0
happy_var_1 Expression A0
happy_var_3
	)}}}

happyReduce_133 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_133 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_133 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
47# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_133
happyReduction_133 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_133 HappyAbsSyn
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 -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_2 of { (HappyWrap53 Expression A0
happy_var_2) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { Token
happy_var_3 -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (SrcSpan -> Expression A0 -> Expression A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (Token -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Token
happy_var_3) Expression A0
happy_var_2
	)}}}

happyReduce_134 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_134 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_134 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
47# HappyAbsSyn -> HappyAbsSyn
happyReduction_134
happyReduction_134 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_134 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_1 of { (HappyWrap62 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (Expression A0
happy_var_1
	)}

happyReduce_135 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_135 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_135 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
47# HappyAbsSyn -> HappyAbsSyn
happyReduction_135
happyReduction_135 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_135 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_1 of { (HappyWrap64 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (Expression A0
happy_var_1
	)}

happyReduce_136 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_136 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_136 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
47# HappyAbsSyn -> HappyAbsSyn
happyReduction_136
happyReduction_136 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_136 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap68
happyOut68 HappyAbsSyn
happy_x_1 of { (HappyWrap68 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (Expression A0
happy_var_1
	)}

happyReduce_137 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_137 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_137 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
47# HappyAbsSyn -> HappyAbsSyn
happyReduction_137
happyReduction_137 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_137 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap69
happyOut69 HappyAbsSyn
happy_x_1 of { (HappyWrap69 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (Expression A0
happy_var_1
	)}

happyReduce_138 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_138 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_138 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
47# HappyAbsSyn -> HappyAbsSyn
happyReduction_138
happyReduction_138 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_138 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap55
happyOut55 HappyAbsSyn
happy_x_1 of { (HappyWrap55 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (Expression A0
happy_var_1
	)}

happyReduce_139 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_139 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_139 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
47# HappyAbsSyn -> HappyAbsSyn
happyReduction_139
happyReduction_139 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_139 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_1 of { (HappyWrap60 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn53
		 (Expression A0
happy_var_1
	)}

happyReduce_140 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_140 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_140 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
48# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_140
happyReduction_140 :: p -> HappyAbsSyn
happyReduction_140 p
happy_x_1
	 =  BinaryOp -> HappyAbsSyn
happyIn54
		 (BinaryOp
EQ
	)

happyReduce_141 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_141 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_141 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
48# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_141
happyReduction_141 :: p -> HappyAbsSyn
happyReduction_141 p
happy_x_1
	 =  BinaryOp -> HappyAbsSyn
happyIn54
		 (BinaryOp
NE
	)

happyReduce_142 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_142 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_142 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
48# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_142
happyReduction_142 :: p -> HappyAbsSyn
happyReduction_142 p
happy_x_1
	 =  BinaryOp -> HappyAbsSyn
happyIn54
		 (BinaryOp
GT
	)

happyReduce_143 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_143 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_143 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
48# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_143
happyReduction_143 :: p -> HappyAbsSyn
happyReduction_143 p
happy_x_1
	 =  BinaryOp -> HappyAbsSyn
happyIn54
		 (BinaryOp
GTE
	)

happyReduce_144 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_144 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_144 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
48# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_144
happyReduction_144 :: p -> HappyAbsSyn
happyReduction_144 p
happy_x_1
	 =  BinaryOp -> HappyAbsSyn
happyIn54
		 (BinaryOp
LT
	)

happyReduce_145 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_145 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_145 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
48# HappyAbsSyn -> HappyAbsSyn
forall p. p -> HappyAbsSyn
happyReduction_145
happyReduction_145 :: p -> HappyAbsSyn
happyReduction_145 p
happy_x_1
	 =  BinaryOp -> HappyAbsSyn
happyIn54
		 (BinaryOp
LTE
	)

happyReduce_146 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_146 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_146 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
49# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_146
happyReduction_146 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_146 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_1 of { (HappyWrap60 Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { Token
happy_var_3 -> 
	Expression A0 -> HappyAbsSyn
happyIn55
		 (A0
-> SrcSpan
-> Expression A0
-> Maybe (AList Argument A0)
-> Expression A0
forall a.
a
-> SrcSpan
-> Expression a
-> Maybe (AList Argument a)
-> Expression a
ExpFunctionCall () (Expression A0 -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_1 Token
happy_var_3) Expression A0
happy_var_1 Maybe (AList Argument A0)
forall k1. Maybe k1
Nothing
	)}}

happyReduce_147 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_147 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_147 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
4# Int#
49# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_147
happyReduction_147 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_147 (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 -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_1 of { (HappyWrap60 Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap56
happyOut56 HappyAbsSyn
happy_x_3 of { (HappyWrap56 [Index A0]
happy_var_3) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_4 of { Token
happy_var_4 -> 
	Expression A0 -> HappyAbsSyn
happyIn55
		 (A0 -> SrcSpan -> Expression A0 -> AList Index A0 -> Expression A0
forall a.
a -> SrcSpan -> Expression a -> AList Index a -> Expression a
ExpSubscript () (Expression A0 -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Expression A0
happy_var_1 Token
happy_var_4) Expression A0
happy_var_1 ([Index A0] -> AList Index A0
forall (t :: * -> *). Spanned (t A0) => [t A0] -> AList t A0
fromReverseList [Index A0]
happy_var_3)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_148 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_148 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_148 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
50# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_148
happyReduction_148 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_148 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap56
happyOut56 HappyAbsSyn
happy_x_1 of { (HappyWrap56 [Index A0]
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_3 of { (HappyWrap53 Expression A0
happy_var_3) -> 
	[Index A0] -> HappyAbsSyn
happyIn56
		 (A0 -> SrcSpan -> Maybe Name -> Expression A0 -> Index A0
forall a. a -> SrcSpan -> Maybe Name -> Expression a -> Index a
IxSingle () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_3) Maybe Name
forall k1. Maybe k1
Nothing Expression A0
happy_var_3 Index A0 -> [Index A0] -> [Index A0]
forall k1. k1 -> [k1] -> [k1]
: [Index A0]
happy_var_1
	)}}

happyReduce_149 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_149 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_149 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
50# HappyAbsSyn -> HappyAbsSyn
happyReduction_149
happyReduction_149 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_149 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
happy_x_1 of { (HappyWrap53 Expression A0
happy_var_1) -> 
	[Index A0] -> HappyAbsSyn
happyIn56
		 ([ A0 -> SrcSpan -> Maybe Name -> Expression A0 -> Index A0
forall a. a -> SrcSpan -> Maybe Name -> Expression a -> Index a
IxSingle () (Expression A0 -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Expression A0
happy_var_1) Maybe Name
forall k1. Maybe k1
Nothing Expression A0
happy_var_1 ]
	)}

happyReduce_150 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_150 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_150 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
51# HappyAbsSyn -> HappyAbsSyn
happyReduction_150
happyReduction_150 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_150 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(SrcSpan, UnaryOp) -> HappyAbsSyn
happyIn57
		 ((Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1, UnaryOp
Minus)
	)}

happyReduce_151 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_151 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_151 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
51# HappyAbsSyn -> HappyAbsSyn
happyReduction_151
happyReduction_151 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_151 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(SrcSpan, UnaryOp) -> HappyAbsSyn
happyIn57
		 ((Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1, UnaryOp
Plus)
	)}

happyReduce_152 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_152 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_152 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
52# HappyAbsSyn -> HappyAbsSyn
happyReduction_152
happyReduction_152 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_152 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap59
happyOut59 HappyAbsSyn
happy_x_1 of { (HappyWrap59 [Expression A0]
happy_var_1) -> 
	Maybe (AList Expression A0) -> HappyAbsSyn
happyIn58
		 (AList Expression A0 -> Maybe (AList Expression A0)
forall k1. k1 -> Maybe k1
Just (AList Expression A0 -> Maybe (AList Expression A0))
-> AList Expression A0 -> Maybe (AList Expression A0)
forall a b. (a -> b) -> a -> b
$ [Expression A0] -> AList Expression A0
forall (t :: * -> *). Spanned (t A0) => [t A0] -> AList t A0
fromReverseList [Expression A0]
happy_var_1
	)}

happyReduce_153 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_153 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_153 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_0  Int#
52# HappyAbsSyn
happyReduction_153
happyReduction_153 :: HappyAbsSyn
happyReduction_153  =  Maybe (AList Expression A0) -> HappyAbsSyn
happyIn58
		 (Maybe (AList Expression A0)
forall k1. Maybe k1
Nothing
	)

happyReduce_154 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_154 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_154 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
53# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_154
happyReduction_154 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_154 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap59
happyOut59 HappyAbsSyn
happy_x_1 of { (HappyWrap59 [Expression A0]
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_3 of { (HappyWrap60 Expression A0
happy_var_3) -> 
	[Expression A0] -> HappyAbsSyn
happyIn59
		 (Expression A0
happy_var_3 Expression A0 -> [Expression A0] -> [Expression A0]
forall k1. k1 -> [k1] -> [k1]
: [Expression A0]
happy_var_1
	)}}

happyReduce_155 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_155 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_155 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
53# HappyAbsSyn -> HappyAbsSyn
happyReduction_155
happyReduction_155 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_155 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap60
happyOut60 HappyAbsSyn
happy_x_1 of { (HappyWrap60 Expression A0
happy_var_1) -> 
	[Expression A0] -> HappyAbsSyn
happyIn59
		 ([ Expression A0
happy_var_1 ]
	)}

happyReduce_156 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_156 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_156 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
54# HappyAbsSyn -> HappyAbsSyn
happyReduction_156
happyReduction_156 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_156 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	Expression A0 -> HappyAbsSyn
happyIn60
		 (A0 -> SrcSpan -> Value A0 -> Expression A0
forall a. a -> SrcSpan -> Value a -> Expression a
ExpValue () (Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1) (Value A0 -> Expression A0) -> Value A0 -> Expression A0
forall a b. (a -> b) -> a -> b
$ let (TId SrcSpan
_ Name
s) = Token
happy_var_1 in Name -> Value A0
forall a. Name -> Value a
ValVariable Name
s
	)}

happyReduce_157 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_157 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_157 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
55# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_157
happyReduction_157 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_157 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap57
happyOut57 HappyAbsSyn
happy_x_1 of { (HappyWrap57 (SrcSpan, UnaryOp)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_2 of { (HappyWrap62 Expression A0
happy_var_2) -> 
	Expression A0 -> HappyAbsSyn
happyIn61
		 (A0 -> SrcSpan -> UnaryOp -> Expression A0 -> Expression A0
forall a. a -> SrcSpan -> UnaryOp -> Expression a -> Expression a
ExpUnary () (SrcSpan -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan ((SrcSpan, UnaryOp) -> SrcSpan
forall a b. (a, b) -> a
fst (SrcSpan, UnaryOp)
happy_var_1) Expression A0
happy_var_2) ((SrcSpan, UnaryOp) -> UnaryOp
forall a b. (a, b) -> b
snd (SrcSpan, UnaryOp)
happy_var_1) Expression A0
happy_var_2
	)}}

happyReduce_158 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_158 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_158 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
55# HappyAbsSyn -> HappyAbsSyn
happyReduction_158
happyReduction_158 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_158 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap62
happyOut62 HappyAbsSyn
happy_x_1 of { (HappyWrap62 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn61
		 (Expression A0
happy_var_1
	)}

happyReduce_159 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_159 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_159 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
56# HappyAbsSyn -> HappyAbsSyn
happyReduction_159
happyReduction_159 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_159 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	Expression A0 -> HappyAbsSyn
happyIn62
		 (A0 -> SrcSpan -> Value A0 -> Expression A0
forall a. a -> SrcSpan -> Value a -> Expression a
ExpValue () (Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1) (Value A0 -> Expression A0) -> Value A0 -> Expression A0
forall a b. (a -> b) -> a -> b
$ let (TInt SrcSpan
_ Name
i) = Token
happy_var_1 in Name -> Value A0
forall a. Name -> Value a
ValInteger Name
i
	)}

happyReduce_160 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_160 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_160 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
57# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_160
happyReduction_160 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_160 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap57
happyOut57 HappyAbsSyn
happy_x_1 of { (HappyWrap57 (SrcSpan, UnaryOp)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_2 of { (HappyWrap64 Expression A0
happy_var_2) -> 
	Expression A0 -> HappyAbsSyn
happyIn63
		 (A0 -> SrcSpan -> UnaryOp -> Expression A0 -> Expression A0
forall a. a -> SrcSpan -> UnaryOp -> Expression a -> Expression a
ExpUnary () (SrcSpan -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan ((SrcSpan, UnaryOp) -> SrcSpan
forall a b. (a, b) -> a
fst (SrcSpan, UnaryOp)
happy_var_1) Expression A0
happy_var_2) ((SrcSpan, UnaryOp) -> UnaryOp
forall a b. (a, b) -> b
snd (SrcSpan, UnaryOp)
happy_var_1) Expression A0
happy_var_2
	)}}

happyReduce_161 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_161 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_161 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
57# HappyAbsSyn -> HappyAbsSyn
happyReduction_161
happyReduction_161 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_161 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap64
happyOut64 HappyAbsSyn
happy_x_1 of { (HappyWrap64 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn63
		 (Expression A0
happy_var_1
	)}

happyReduce_162 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_162 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_162 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
58# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_162
happyReduction_162 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_162 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap66
happyOut66 HappyAbsSyn
happy_x_2 of { (HappyWrap66 (SrcSpan, Name)
happy_var_2) -> 
	Expression A0 -> HappyAbsSyn
happyIn64
		 (Maybe Token
-> Maybe Token
-> Maybe Token
-> Maybe (SrcSpan, Name)
-> Expression A0
makeReal (Token -> Maybe Token
forall k1. k1 -> Maybe k1
Just Token
happy_var_1) Maybe Token
forall k1. Maybe k1
Nothing Maybe Token
forall k1. Maybe k1
Nothing ((SrcSpan, Name) -> Maybe (SrcSpan, Name)
forall k1. k1 -> Maybe k1
Just (SrcSpan, Name)
happy_var_2)
	)}}

happyReduce_163 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_163 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_163 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
58# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_163
happyReduction_163 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_163 HappyAbsSyn
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 -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { Token
happy_var_2 -> 
	case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_3 of { (HappyWrap65 Maybe (SrcSpan, Name)
happy_var_3) -> 
	Expression A0 -> HappyAbsSyn
happyIn64
		 (Maybe Token
-> Maybe Token
-> Maybe Token
-> Maybe (SrcSpan, Name)
-> Expression A0
makeReal (Token -> Maybe Token
forall k1. k1 -> Maybe k1
Just Token
happy_var_1) (Token -> Maybe Token
forall k1. k1 -> Maybe k1
Just Token
happy_var_2) Maybe Token
forall k1. Maybe k1
Nothing Maybe (SrcSpan, Name)
happy_var_3
	)}}}

happyReduce_164 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_164 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_164 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
58# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_164
happyReduction_164 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_164 HappyAbsSyn
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 -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { Token
happy_var_2 -> 
	case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_3 of { (HappyWrap65 Maybe (SrcSpan, Name)
happy_var_3) -> 
	Expression A0 -> HappyAbsSyn
happyIn64
		 (Maybe Token
-> Maybe Token
-> Maybe Token
-> Maybe (SrcSpan, Name)
-> Expression A0
makeReal Maybe Token
forall k1. Maybe k1
Nothing (Token -> Maybe Token
forall k1. k1 -> Maybe k1
Just Token
happy_var_1) (Token -> Maybe Token
forall k1. k1 -> Maybe k1
Just Token
happy_var_2) Maybe (SrcSpan, Name)
happy_var_3
	)}}}

happyReduce_165 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_165 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_165 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
4# Int#
58# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_165
happyReduction_165 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_165 (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 -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { Token
happy_var_2 -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_3 of { Token
happy_var_3 -> 
	case HappyAbsSyn -> HappyWrap65
happyOut65 HappyAbsSyn
happy_x_4 of { (HappyWrap65 Maybe (SrcSpan, Name)
happy_var_4) -> 
	Expression A0 -> HappyAbsSyn
happyIn64
		 (Maybe Token
-> Maybe Token
-> Maybe Token
-> Maybe (SrcSpan, Name)
-> Expression A0
makeReal (Token -> Maybe Token
forall k1. k1 -> Maybe k1
Just Token
happy_var_1) (Token -> Maybe Token
forall k1. k1 -> Maybe k1
Just Token
happy_var_2) (Token -> Maybe Token
forall k1. k1 -> Maybe k1
Just Token
happy_var_3) Maybe (SrcSpan, Name)
happy_var_4
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_166 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_166 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_166 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
59# HappyAbsSyn -> HappyAbsSyn
happyReduction_166
happyReduction_166 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_166 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap66
happyOut66 HappyAbsSyn
happy_x_1 of { (HappyWrap66 (SrcSpan, Name)
happy_var_1) -> 
	Maybe (SrcSpan, Name) -> HappyAbsSyn
happyIn65
		 ((SrcSpan, Name) -> Maybe (SrcSpan, Name)
forall k1. k1 -> Maybe k1
Just (SrcSpan, Name)
happy_var_1
	)}

happyReduce_167 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_167 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_167 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_0  Int#
59# HappyAbsSyn
happyReduction_167
happyReduction_167 :: HappyAbsSyn
happyReduction_167  =  Maybe (SrcSpan, Name) -> HappyAbsSyn
happyIn65
		 (Maybe (SrcSpan, Name)
forall k1. Maybe k1
Nothing
	)

happyReduce_168 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_168 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_168 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
60# HappyAbsSyn -> HappyAbsSyn
happyReduction_168
happyReduction_168 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_168 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(SrcSpan, Name) -> HappyAbsSyn
happyIn66
		 (let (TExponent SrcSpan
s Name
exp) = Token
happy_var_1 in (SrcSpan
s, Name
exp)
	)}

happyReduce_169 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_169 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_169 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
61# HappyAbsSyn -> HappyAbsSyn
happyReduction_169
happyReduction_169 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_169 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap61
happyOut61 HappyAbsSyn
happy_x_1 of { (HappyWrap61 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn67
		 (Expression A0
happy_var_1
	)}

happyReduce_170 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_170 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_170 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
61# HappyAbsSyn -> HappyAbsSyn
happyReduction_170
happyReduction_170 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_170 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap63
happyOut63 HappyAbsSyn
happy_x_1 of { (HappyWrap63 Expression A0
happy_var_1) -> 
	Expression A0 -> HappyAbsSyn
happyIn67
		 (Expression A0
happy_var_1
	)}

happyReduce_171 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_171 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_171 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce Int#
5# Int#
62# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_171
happyReduction_171 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_171 (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 -> HappyWrap67
happyOut67 HappyAbsSyn
happy_x_2 of { (HappyWrap67 Expression A0
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap67
happyOut67 HappyAbsSyn
happy_x_4 of { (HappyWrap67 Expression A0
happy_var_4) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_5 of { Token
happy_var_5 -> 
	Expression A0 -> HappyAbsSyn
happyIn68
		 (A0 -> SrcSpan -> Value A0 -> Expression A0
forall a. a -> SrcSpan -> Value a -> Expression a
ExpValue () (Token -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Token
happy_var_5) (Expression A0 -> Expression A0 -> Value A0
forall a. Expression a -> Expression a -> Value a
ValComplex Expression A0
happy_var_2 Expression A0
happy_var_4)
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_172 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_172 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_172 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
63# HappyAbsSyn -> HappyAbsSyn
happyReduction_172
happyReduction_172 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_172 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	Expression A0 -> HappyAbsSyn
happyIn69
		 (let TBool SrcSpan
s Name
b = Token
happy_var_1 in A0 -> SrcSpan -> Value A0 -> Expression A0
forall a. a -> SrcSpan -> Value a -> Expression a
ExpValue () SrcSpan
s (Value A0 -> Expression A0) -> Value A0 -> Expression A0
forall a b. (a -> b) -> a -> b
$ Name -> Value A0
forall a. Name -> Value a
ValLogical Name
b
	)}

happyReduce_173 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_173 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_173 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
64# HappyAbsSyn -> HappyAbsSyn
happyReduction_173
happyReduction_173 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_173 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	Expression A0 -> HappyAbsSyn
happyIn70
		 (A0 -> SrcSpan -> Value A0 -> Expression A0
forall a. a -> SrcSpan -> Value a -> Expression a
ExpValue () (Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1) (Value A0 -> Expression A0) -> Value A0 -> Expression A0
forall a b. (a -> b) -> a -> b
$ let (THollerith SrcSpan
_ Name
h) = Token
happy_var_1 in Name -> Value A0
forall a. Name -> Value a
ValHollerith Name
h
	)}

happyReduce_174 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_174 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_174 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
65# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_174
happyReduction_174 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_174 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap72
happyOut72 HappyAbsSyn
happy_x_1 of { (HappyWrap72 AList Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_2 of { Token
happy_var_2 -> 
	AList Expression A0 -> HappyAbsSyn
happyIn71
		 (SrcSpan -> AList Expression A0 -> AList Expression A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (AList Expression A0 -> Token -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList Expression A0
happy_var_1 Token
happy_var_2) (AList Expression A0 -> AList Expression A0)
-> AList Expression A0 -> AList Expression A0
forall a b. (a -> b) -> a -> b
$ AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. AList t a -> AList t a
aReverse AList Expression A0
happy_var_1
	)}}

happyReduce_175 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_175 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_175 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_3  Int#
66# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall p. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_175
happyReduction_175 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_175 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap72
happyOut72 HappyAbsSyn
happy_x_1 of { (HappyWrap72 AList Expression A0
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap74
happyOut74 HappyAbsSyn
happy_x_3 of { (HappyWrap74 Expression A0
happy_var_3) -> 
	AList Expression A0 -> HappyAbsSyn
happyIn72
		 (SrcSpan -> AList Expression A0 -> AList Expression A0
forall a. Spanned a => SrcSpan -> a -> a
setSpan (AList Expression A0 -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan AList Expression A0
happy_var_1 Expression A0
happy_var_3) (AList Expression A0 -> AList Expression A0)
-> AList Expression A0 -> AList Expression A0
forall a b. (a -> b) -> a -> b
$ Expression A0
happy_var_3 Expression A0 -> AList Expression A0 -> AList Expression A0
forall (t :: * -> *) a. t a -> AList t a -> AList t a
`aCons` AList Expression A0
happy_var_1
	)}}

happyReduce_176 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_176 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_176 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_2  Int#
66# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_176
happyReduction_176 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_176 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap74
happyOut74 HappyAbsSyn
happy_x_2 of { (HappyWrap74 Expression A0
happy_var_2) -> 
	AList Expression A0 -> HappyAbsSyn
happyIn72
		 (A0 -> SrcSpan -> [Expression A0] -> AList Expression A0
forall (t :: * -> *) a. a -> SrcSpan -> [t a] -> AList t a
AList () (Token -> Expression A0 -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan Token
happy_var_1 Expression A0
happy_var_2) [ Expression A0
happy_var_2 ]
	)}}

happyReduce_177 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_177 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_177 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
67# HappyAbsSyn -> HappyAbsSyn
happyReduction_177
happyReduction_177 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_177 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	Expression A0 -> HappyAbsSyn
happyIn73
		 (A0 -> SrcSpan -> Value A0 -> Expression A0
forall a. a -> SrcSpan -> Value a -> Expression a
ExpValue () (Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1) (let (TLabel SrcSpan
_ Name
l) = Token
happy_var_1 in Name -> Value A0
forall a. Name -> Value a
ValInteger Name
l)
	)}

happyReduce_178 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_178 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_178 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
68# HappyAbsSyn -> HappyAbsSyn
happyReduction_178
happyReduction_178 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_178 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	Expression A0 -> HappyAbsSyn
happyIn74
		 (A0 -> SrcSpan -> Value A0 -> Expression A0
forall a. a -> SrcSpan -> Value a -> Expression a
ExpValue () (Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1) (let (TInt SrcSpan
_ Name
l) = Token
happy_var_1 in Name -> Value A0
forall a. Name -> Value a
ValInteger Name
l)
	)}

happyReduce_179 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_179 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_179 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
69# HappyAbsSyn -> HappyAbsSyn
happyReduction_179
happyReduction_179 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_179 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	TypeSpec A0 -> HappyAbsSyn
happyIn75
		 (A0 -> SrcSpan -> BaseType -> Maybe (Selector A0) -> TypeSpec A0
forall a.
a -> SrcSpan -> BaseType -> Maybe (Selector a) -> TypeSpec a
TypeSpec () (Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1) BaseType
TypeInteger Maybe (Selector A0)
forall k1. Maybe k1
Nothing
	)}

happyReduce_180 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_180 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_180 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
69# HappyAbsSyn -> HappyAbsSyn
happyReduction_180
happyReduction_180 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_180 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	TypeSpec A0 -> HappyAbsSyn
happyIn75
		 (A0 -> SrcSpan -> BaseType -> Maybe (Selector A0) -> TypeSpec A0
forall a.
a -> SrcSpan -> BaseType -> Maybe (Selector a) -> TypeSpec a
TypeSpec () (Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1) BaseType
TypeReal Maybe (Selector A0)
forall k1. Maybe k1
Nothing
	)}

happyReduce_181 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_181 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_181 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
69# HappyAbsSyn -> HappyAbsSyn
happyReduction_181
happyReduction_181 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_181 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	TypeSpec A0 -> HappyAbsSyn
happyIn75
		 (A0 -> SrcSpan -> BaseType -> Maybe (Selector A0) -> TypeSpec A0
forall a.
a -> SrcSpan -> BaseType -> Maybe (Selector a) -> TypeSpec a
TypeSpec () (Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1) BaseType
TypeDoublePrecision Maybe (Selector A0)
forall k1. Maybe k1
Nothing
	)}

happyReduce_182 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_182 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_182 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
69# HappyAbsSyn -> HappyAbsSyn
happyReduction_182
happyReduction_182 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_182 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	TypeSpec A0 -> HappyAbsSyn
happyIn75
		 (A0 -> SrcSpan -> BaseType -> Maybe (Selector A0) -> TypeSpec A0
forall a.
a -> SrcSpan -> BaseType -> Maybe (Selector a) -> TypeSpec a
TypeSpec () (Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1) BaseType
TypeLogical Maybe (Selector A0)
forall k1. Maybe k1
Nothing
	)}

happyReduce_183 :: () => Happy_GHC_Exts.Int# -> Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> LexAction (HappyAbsSyn )
happyReduce_183 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyReduce_183 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happySpecReduce_1  Int#
69# HappyAbsSyn -> HappyAbsSyn
happyReduction_183
happyReduction_183 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_183 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	TypeSpec A0 -> HappyAbsSyn
happyIn75
		 (A0 -> SrcSpan -> BaseType -> Maybe (Selector A0) -> TypeSpec A0
forall a.
a -> SrcSpan -> BaseType -> Maybe (Selector a) -> TypeSpec a
TypeSpec () (Token -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan Token
happy_var_1) BaseType
TypeComplex Maybe (Selector A0)
forall k1. Maybe k1
Nothing
	)}

happyNewToken :: Int#
-> Happy_IntList -> HappyStk HappyAbsSyn -> LexAction HappyAbsSyn
happyNewToken Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk
	= (Token -> LexAction HappyAbsSyn) -> LexAction HappyAbsSyn
forall a. (Token -> LexAction a) -> LexAction a
lexer(\Token
tk -> 
	let cont :: Int# -> LexAction HappyAbsSyn
cont Int#
i = Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyDoAction Int#
i Token
tk Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk in
	case Token
tk of {
	TEOF SrcSpan
_ -> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> LexAction HappyAbsSyn
happyDoAction Int#
59# Token
tk Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk;
	TLeftPar SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
1#;
	TRightPar SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
2#;
	TComma SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
3#;
	TDot SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
4#;
	TFunction SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
5#;
	TSubroutine SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
6#;
	TBlockData SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
7#;
	TEnd SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
8#;
	TOpAssign SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
9#;
	TAssign SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
10#;
	TTo SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
11#;
	TGoto SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
12#;
	TIf SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
13#;
	TCall SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
14#;
	TReturn SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
15#;
	TContinue SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
16#;
	TStop SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
17#;
	TPause SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
18#;
	TDo SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
19#;
	TRead SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
20#;
	TWrite SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
21#;
	TRewind SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
22#;
	TBackspace SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
23#;
	TEndfile SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
24#;
	TCommon SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
25#;
	TEquivalence SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
26#;
	TExternal SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
27#;
	TDimension SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
28#;
	TType SrcSpan
_ Name
"integer" -> Int# -> LexAction HappyAbsSyn
cont Int#
29#;
	TType SrcSpan
_ Name
"real" -> Int# -> LexAction HappyAbsSyn
cont Int#
30#;
	TType SrcSpan
_ Name
"doubleprecision" -> Int# -> LexAction HappyAbsSyn
cont Int#
31#;
	TType SrcSpan
_ Name
"logical" -> Int# -> LexAction HappyAbsSyn
cont Int#
32#;
	TType SrcSpan
_ Name
"complex" -> Int# -> LexAction HappyAbsSyn
cont Int#
33#;
	TData SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
34#;
	TFormat SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
35#;
	TBlob SrcSpan
_ Name
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
36#;
	TInt SrcSpan
_ Name
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
37#;
	TExponent SrcSpan
_ Name
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
38#;
	TBool SrcSpan
_ Name
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
39#;
	TOpPlus SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
40#;
	TOpMinus SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
41#;
	TOpExp SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
42#;
	TStar SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
43#;
	TSlash SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
44#;
	TOpOr SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
45#;
	TOpAnd SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
46#;
	TOpNot SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
47#;
	TOpLT SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
48#;
	TOpLE SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
49#;
	TOpGT SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
50#;
	TOpGE SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
51#;
	TOpEQ SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
52#;
	TOpNE SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
53#;
	TId SrcSpan
_ Name
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
54#;
	TComment SrcSpan
_ Name
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
55#;
	THollerith SrcSpan
_ Name
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
56#;
	TLabel SrcSpan
_ Name
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
57#;
	TNewline SrcSpan
_ -> Int# -> LexAction HappyAbsSyn
cont Int#
58#;
	Token
_ -> (Token, [Name]) -> LexAction HappyAbsSyn
forall a. (Token, [Name]) -> LexAction a
happyError' (Token
tk, [])
	})

happyError_ :: [Name] -> Int# -> Token -> LexAction a
happyError_ [Name]
explist Int#
59# Token
tk = (Token, [Name]) -> LexAction a
forall a. (Token, [Name]) -> LexAction a
happyError' (Token
tk, [Name]
explist)
happyError_ [Name]
explist Int#
_ Token
tk = (Token, [Name]) -> LexAction a
forall a. (Token, [Name]) -> LexAction a
happyError' (Token
tk, [Name]
explist)

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

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

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

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

happyThen1 :: () => LexAction a -> (a -> LexAction b) -> LexAction b
happyThen1 :: LexAction a -> (a -> LexAction b) -> LexAction b
happyThen1 = LexAction a -> (a -> LexAction b) -> LexAction b
forall a b. LexAction a -> (a -> LexAction b) -> LexAction b
happyThen
happyReturn1 :: () => a -> LexAction a
happyReturn1 :: a -> LexAction a
happyReturn1 = a -> LexAction a
forall a. a -> LexAction a
happyReturn
happyError' :: () => ((Token), [Prelude.String]) -> LexAction a
happyError' :: (Token, [Name]) -> LexAction a
happyError' (Token, [Name])
tk = (\(Token
tokens, [Name]
_) -> Token -> LexAction a
forall a. Token -> LexAction a
parseError Token
tokens) (Token, [Name])
tk
programParser :: LexAction (ProgramFile A0)
programParser = LexAction (ProgramFile A0)
happySomeParser where
 happySomeParser :: LexAction (ProgramFile A0)
happySomeParser = LexAction HappyAbsSyn
-> (HappyAbsSyn -> LexAction (ProgramFile A0))
-> LexAction (ProgramFile A0)
forall a b. LexAction a -> (a -> LexAction b) -> LexAction b
happyThen (Int# -> LexAction HappyAbsSyn
happyParse Int#
0#) (\HappyAbsSyn
x -> ProgramFile A0 -> LexAction (ProgramFile A0)
forall a. a -> LexAction a
happyReturn (let {(HappyWrap6 ProgramFile A0
x') = HappyAbsSyn -> HappyWrap6
happyOut6 HappyAbsSyn
x} in ProgramFile A0
x'))

statementParser :: LexAction (Statement A0)
statementParser = LexAction (Statement A0)
happySomeParser where
 happySomeParser :: LexAction (Statement A0)
happySomeParser = LexAction HappyAbsSyn
-> (HappyAbsSyn -> LexAction (Statement A0))
-> LexAction (Statement A0)
forall a b. LexAction a -> (a -> LexAction b) -> LexAction b
happyThen (Int# -> LexAction HappyAbsSyn
happyParse Int#
1#) (\HappyAbsSyn
x -> Statement A0 -> LexAction (Statement A0)
forall a. a -> LexAction a
happyReturn (let {(HappyWrap17 Statement A0
x') = HappyAbsSyn -> HappyWrap17
happyOut17 HappyAbsSyn
x} in Statement A0
x'))

expressionParser :: LexAction (Expression A0)
expressionParser = LexAction (Expression A0)
happySomeParser where
 happySomeParser :: LexAction (Expression A0)
happySomeParser = LexAction HappyAbsSyn
-> (HappyAbsSyn -> LexAction (Expression A0))
-> LexAction (Expression A0)
forall a b. LexAction a -> (a -> LexAction b) -> LexAction b
happyThen (Int# -> LexAction HappyAbsSyn
happyParse Int#
2#) (\HappyAbsSyn
x -> Expression A0 -> LexAction (Expression A0)
forall a. a -> LexAction a
happyReturn (let {(HappyWrap53 Expression A0
x') = HappyAbsSyn -> HappyWrap53
happyOut53 HappyAbsSyn
x} in Expression A0
x'))

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


makeReal :: Maybe Token -> Maybe Token -> Maybe Token -> Maybe (SrcSpan, String) -> Expression A0
makeReal :: Maybe Token
-> Maybe Token
-> Maybe Token
-> Maybe (SrcSpan, Name)
-> Expression A0
makeReal Maybe Token
i1 Maybe Token
dot Maybe Token
i2 Maybe (SrcSpan, Name)
exp =
  let span1 :: SrcSpan
span1   = (Maybe Token, Maybe Token, Maybe Token) -> SrcSpan
forall a. Spanned a => a -> SrcSpan
getSpan (Maybe Token
i1, Maybe Token
dot, Maybe Token
i2)
      span2 :: SrcSpan
span2   = case Maybe (SrcSpan, Name)
exp of
                  Just (SrcSpan, Name)
e -> SrcSpan -> SrcSpan -> SrcSpan
forall a b. SpannedPair a b => a -> b -> SrcSpan
getTransSpan SrcSpan
span1 ((SrcSpan, Name) -> SrcSpan
forall a b. (a, b) -> a
fst (SrcSpan, Name)
e)
                  Maybe (SrcSpan, Name)
Nothing -> SrcSpan
span1
      i1Str :: Name
i1Str   = case Maybe Token
i1 of { Just (TInt SrcSpan
_ Name
s) -> Name
s ; Maybe Token
_ -> Name
"" }
      dotStr :: Name
dotStr  = case Maybe Token
dot of { Just (TDot SrcSpan
_) -> Name
"." ; Maybe Token
_ -> Name
"" }
      i2Str :: Name
i2Str   = case Maybe Token
i2 of { Just (TInt SrcSpan
_ Name
s) -> Name
s ; Maybe Token
_ -> Name
"" }
      expStr :: Name
expStr  = case Maybe (SrcSpan, Name)
exp of { Just (SrcSpan
_, Name
s) -> Name
s ; Maybe (SrcSpan, Name)
_ -> Name
"" } in
    A0 -> SrcSpan -> Value A0 -> Expression A0
forall a. a -> SrcSpan -> Value a -> Expression a
ExpValue () SrcSpan
span2 (Name -> Value A0
forall a. Name -> Value a
ValReal (Name -> Value A0) -> Name -> Value A0
forall a b. (a -> b) -> a -> b
$ Name
i1Str Name -> Name -> Name
forall a. [a] -> [a] -> [a]
++ Name
dotStr Name -> Name -> Name
forall a. [a] -> [a] -> [a]
++ Name
i2Str Name -> Name -> Name
forall a. [a] -> [a] -> [a]
++ Name
expStr)

transformations66 :: [Transformation]
transformations66 =
  [ Transformation
GroupLabeledDo
  , Transformation
DisambiguateIntrinsic
  , Transformation
DisambiguateFunction
  ]

fortran66Parser ::
     B.ByteString -> String -> ParseResult AlexInput Token (ProgramFile A0)
fortran66Parser :: ByteString -> Name -> ParseResult AlexInput Token (ProgramFile A0)
fortran66Parser = ModFiles
-> ByteString
-> Name
-> ParseResult AlexInput Token (ProgramFile A0)
fortran66ParserWithModFiles ModFiles
emptyModFiles

fortran66ParserWithModFiles ::
    ModFiles -> B.ByteString -> String -> ParseResult AlexInput Token (ProgramFile A0)
fortran66ParserWithModFiles :: ModFiles
-> ByteString
-> Name
-> ParseResult AlexInput Token (ProgramFile A0)
fortran66ParserWithModFiles ModFiles
mods ByteString
sourceCode Name
filename =
    (ProgramFile A0 -> ProgramFile A0)
-> ParseResult AlexInput Token (ProgramFile A0)
-> ParseResult AlexInput Token (ProgramFile A0)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (Name -> ProgramFile A0 -> ProgramFile A0
forall a. Name -> ProgramFile a -> ProgramFile a
pfSetFilename Name
filename (ProgramFile A0 -> ProgramFile A0)
-> (ProgramFile A0 -> ProgramFile A0)
-> ProgramFile A0
-> ProgramFile A0
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ModFiles -> [Transformation] -> ProgramFile A0 -> ProgramFile A0
forall a.
Data a =>
ModFiles -> [Transformation] -> ProgramFile a -> ProgramFile a
transformWithModFiles ModFiles
mods [Transformation]
transformations66) (ParseResult AlexInput Token (ProgramFile A0)
 -> ParseResult AlexInput Token (ProgramFile A0))
-> ParseResult AlexInput Token (ProgramFile A0)
-> ParseResult AlexInput Token (ProgramFile A0)
forall a b. (a -> b) -> a -> b
$ ParseState AlexInput
-> ParseResult AlexInput Token (ProgramFile A0)
parse ParseState AlexInput
parseState
  where
    parse :: ParseState AlexInput
-> ParseResult AlexInput Token (ProgramFile A0)
parse = LexAction (ProgramFile A0)
-> ParseState AlexInput
-> ParseResult AlexInput Token (ProgramFile A0)
forall b c a.
(Loc b, LastToken b c, Show c) =>
Parse b c a -> ParseState b -> ParseResult b c a
runParse LexAction (ProgramFile A0)
programParser
    parseState :: ParseState AlexInput
parseState = ByteString -> FortranVersion -> Name -> ParseState AlexInput
initParseState ByteString
sourceCode FortranVersion
Fortran66 Name
filename

parseError :: Token -> LexAction a
parseError :: Token -> LexAction a
parseError Token
_ = do
    ParseState AlexInput
parseState <- Parse AlexInput Token (ParseState AlexInput)
forall s (m :: * -> *). MonadState s m => m s
get
#ifdef DEBUG
    tokens <- reverse <$> aiPreviousTokensInLine <$> getAlex
#endif
    Name -> LexAction a
forall (m :: * -> *) a. MonadFail m => Name -> m a
fail (Name -> LexAction a) -> Name -> LexAction a
forall a b. (a -> b) -> a -> b
$ ParseState AlexInput -> Name
forall a. ParseState a -> Name
psFilename ParseState AlexInput
parseState Name -> Name -> Name
forall a. [a] -> [a] -> [a]
++ Name
": parsing failed. "
#ifdef DEBUG
      ++ '\n' : show tokens
#endif

convCmts :: [Block a] -> [ProgramUnit a]
convCmts = (Block a -> ProgramUnit a) -> [Block a] -> [ProgramUnit a]
forall a b. (a -> b) -> [a] -> [b]
map Block a -> ProgramUnit a
forall a. Block a -> ProgramUnit a
convCmt
convCmt :: Block a -> ProgramUnit a
convCmt (BlComment a
a SrcSpan
s Comment a
c) = a -> SrcSpan -> Comment a -> ProgramUnit a
forall a. a -> SrcSpan -> Comment a -> ProgramUnit a
PUComment a
a SrcSpan
s Comment a
c
convCmt Block a
_ = Name -> ProgramUnit a
forall a. HasCallStack => Name -> a
error Name
"convCmt applied to something that is not a comment"
{-# LINE 1 "templates/GenericTemplate.hs" #-}
-- $Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp $













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



















data Happy_IntList = HappyCons Happy_GHC_Exts.Int# Happy_IntList








































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

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

happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll

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

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

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



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




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




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


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






data HappyAddr = HappyA# Happy_GHC_Exts.Addr#


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













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

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

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

-- happyReduce is specialised for the common cases.

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

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

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

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

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

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

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

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




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

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

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

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


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




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

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

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

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

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

-- Internal happy errors:

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

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


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


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

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

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


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

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

-- end of Happy Template.