{-# OPTIONS_GHC -w #-}
{-# LANGUAGE CPP #-}
{-# LANGUAGE MagicHash #-}
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE TypeSynonymInstances #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE PatternGuards #-}
{-# LANGUAGE NoStrictData #-}
{-# LANGUAGE UnboxedTuples #-}
{-# LANGUAGE PartialTypeSignatures #-}
#if __GLASGOW_HASKELL__ >= 710
{-# LANGUAGE PartialTypeSignatures #-}
#endif
-- | Futhark parser written with Happy.
module Language.Futhark.Parser.Parser
  ( prog
  , expression
  , declaration
  , modExpression
  , futharkType
  , parse
  , parseWithComments
  , SyntaxError(..)
  , Comment(..)
  )
  where

import Data.Bifunctor (second)
import Control.Monad
import Control.Monad.Trans
import Control.Monad.Except
import Control.Monad.Reader
import Control.Monad.Trans.State
import Data.Array
import qualified Data.ByteString as BS
import qualified Data.Text as T
import qualified Data.Text.Encoding as T
import Data.Char (ord)
import Data.Maybe (fromMaybe, fromJust)
import Data.List (genericLength)
import qualified Data.List.NonEmpty as NE
import qualified Data.Map.Strict as M
import Data.Monoid

import Language.Futhark.Syntax hiding (ID)
import Language.Futhark.Prop
import Language.Futhark.Pretty
import Language.Futhark.Parser.Lexer (Token(..))
import Futhark.Util.Pretty
import Futhark.Util.Loc
import Language.Futhark.Parser.Monad
import qualified Data.Function as Happy_Prelude
import qualified Data.Bool as Happy_Prelude
import qualified Data.Function as Happy_Prelude
import qualified Data.Maybe as Happy_Prelude
import qualified Data.Int as Happy_Prelude
import qualified Data.String as Happy_Prelude
import qualified Data.List as Happy_Prelude
import qualified Control.Monad as Happy_Prelude
import qualified Text.Show as Happy_Prelude
import qualified GHC.Num as Happy_Prelude
import qualified GHC.Err as Happy_Prelude
import qualified Data.Array as Happy_Data_Array
import qualified Data.Bits as Bits
import qualified GHC.Exts as Happy_GHC_Exts
import Control.Applicative(Applicative(..))
import Control.Monad (ap)

-- parser produced by Happy Version 2.1.2

newtype HappyAbsSyn t99 t100 t101 t102 = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
newtype HappyWrap9 = HappyWrap9 (DocComment)
happyIn9 :: (DocComment) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn9 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
DocComment -> HappyAbsSyn t99 t100 t101 t102
happyIn9 DocComment
x = HappyWrap9 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (DocComment -> HappyWrap9
HappyWrap9 DocComment
x)
{-# INLINE happyIn9 #-}
happyOut9 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap9
happyOut9 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap9
happyOut9 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap9
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut9 #-}
newtype HappyWrap10 = HappyWrap10 (UncheckedProg)
happyIn10 :: (UncheckedProg) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn10 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedProg -> HappyAbsSyn t99 t100 t101 t102
happyIn10 UncheckedProg
x = HappyWrap10 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedProg -> HappyWrap10
HappyWrap10 UncheckedProg
x)
{-# INLINE happyIn10 #-}
happyOut10 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap10
happyOut10 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap10
happyOut10 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap10
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut10 #-}
newtype HappyWrap11 = HappyWrap11 (UncheckedDec)
happyIn11 :: (UncheckedDec) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn11 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
happyIn11 UncheckedDec
x = HappyWrap11 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedDec -> HappyWrap11
HappyWrap11 UncheckedDec
x)
{-# INLINE happyIn11 #-}
happyOut11 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap11
happyOut11 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap11
happyOut11 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap11
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut11 #-}
newtype HappyWrap12 = HappyWrap12 ([UncheckedDec])
happyIn12 :: ([UncheckedDec]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn12 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedDec] -> HappyAbsSyn t99 t100 t101 t102
happyIn12 [UncheckedDec]
x = HappyWrap12 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([UncheckedDec] -> HappyWrap12
HappyWrap12 [UncheckedDec]
x)
{-# INLINE happyIn12 #-}
happyOut12 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap12
happyOut12 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap12
happyOut12 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap12
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut12 #-}
newtype HappyWrap13 = HappyWrap13 ([UncheckedDec])
happyIn13 :: ([UncheckedDec]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn13 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedDec] -> HappyAbsSyn t99 t100 t101 t102
happyIn13 [UncheckedDec]
x = HappyWrap13 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([UncheckedDec] -> HappyWrap13
HappyWrap13 [UncheckedDec]
x)
{-# INLINE happyIn13 #-}
happyOut13 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap13
happyOut13 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap13
happyOut13 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap13
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut13 #-}
newtype HappyWrap14 = HappyWrap14 (UncheckedDec)
happyIn14 :: (UncheckedDec) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn14 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
happyIn14 UncheckedDec
x = HappyWrap14 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedDec -> HappyWrap14
HappyWrap14 UncheckedDec
x)
{-# INLINE happyIn14 #-}
happyOut14 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap14
happyOut14 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap14
happyOut14 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap14
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut14 #-}
newtype HappyWrap15 = HappyWrap15 (UncheckedModTypeExp)
happyIn15 :: (UncheckedModTypeExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn15 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn15 UncheckedModTypeExp
x = HappyWrap15 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedModTypeExp -> HappyWrap15
HappyWrap15 UncheckedModTypeExp
x)
{-# INLINE happyIn15 #-}
happyOut15 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap15
happyOut15 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
happyOut15 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut15 #-}
newtype HappyWrap16 = HappyWrap16 (TypeRefBase NoInfo Name)
happyIn16 :: (TypeRefBase NoInfo Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn16 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
TypeRefBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn16 TypeRefBase NoInfo Name
x = HappyWrap16 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (TypeRefBase NoInfo Name -> HappyWrap16
HappyWrap16 TypeRefBase NoInfo Name
x)
{-# INLINE happyIn16 #-}
happyOut16 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap16
happyOut16 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap16
happyOut16 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap16
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut16 #-}
newtype HappyWrap17 = HappyWrap17 (ModTypeBindBase NoInfo Name)
happyIn17 :: (ModTypeBindBase NoInfo Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn17 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
ModTypeBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn17 ModTypeBindBase NoInfo Name
x = HappyWrap17 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (ModTypeBindBase NoInfo Name -> HappyWrap17
HappyWrap17 ModTypeBindBase NoInfo Name
x)
{-# INLINE happyIn17 #-}
happyOut17 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap17
happyOut17 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap17
happyOut17 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap17
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut17 #-}
newtype HappyWrap18 = HappyWrap18 (UncheckedModExp)
happyIn18 :: (UncheckedModExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn18 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
happyIn18 UncheckedModExp
x = HappyWrap18 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedModExp -> HappyWrap18
HappyWrap18 UncheckedModExp
x)
{-# INLINE happyIn18 #-}
happyOut18 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap18
happyOut18 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap18
happyOut18 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap18
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut18 #-}
newtype HappyWrap19 = HappyWrap19 (UncheckedModExp)
happyIn19 :: (UncheckedModExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn19 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
happyIn19 UncheckedModExp
x = HappyWrap19 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedModExp -> HappyWrap19
HappyWrap19 UncheckedModExp
x)
{-# INLINE happyIn19 #-}
happyOut19 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap19
happyOut19 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap19
happyOut19 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap19
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut19 #-}
newtype HappyWrap20 = HappyWrap20 (UncheckedModExp)
happyIn20 :: (UncheckedModExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn20 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
happyIn20 UncheckedModExp
x = HappyWrap20 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedModExp -> HappyWrap20
HappyWrap20 UncheckedModExp
x)
{-# INLINE happyIn20 #-}
happyOut20 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap20
happyOut20 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap20
happyOut20 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap20
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut20 #-}
newtype HappyWrap21 = HappyWrap21 (UncheckedModTypeExp)
happyIn21 :: (UncheckedModTypeExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn21 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn21 UncheckedModTypeExp
x = HappyWrap21 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedModTypeExp -> HappyWrap21
HappyWrap21 UncheckedModTypeExp
x)
{-# INLINE happyIn21 #-}
happyOut21 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap21
happyOut21 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap21
happyOut21 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap21
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut21 #-}
newtype HappyWrap22 = HappyWrap22 (ModBindBase NoInfo Name)
happyIn22 :: (ModBindBase NoInfo Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn22 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
ModBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn22 ModBindBase NoInfo Name
x = HappyWrap22 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (ModBindBase NoInfo Name -> HappyWrap22
HappyWrap22 ModBindBase NoInfo Name
x)
{-# INLINE happyIn22 #-}
happyOut22 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap22
happyOut22 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap22
happyOut22 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap22
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut22 #-}
newtype HappyWrap23 = HappyWrap23 (ModParamBase NoInfo Name)
happyIn23 :: (ModParamBase NoInfo Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn23 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
ModParamBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn23 ModParamBase NoInfo Name
x = HappyWrap23 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (ModParamBase NoInfo Name -> HappyWrap23
HappyWrap23 ModParamBase NoInfo Name
x)
{-# INLINE happyIn23 #-}
happyOut23 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap23
happyOut23 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap23
happyOut23 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap23
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut23 #-}
newtype HappyWrap24 = HappyWrap24 ([ModParamBase NoInfo Name])
happyIn24 :: ([ModParamBase NoInfo Name]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn24 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[ModParamBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn24 [ModParamBase NoInfo Name]
x = HappyWrap24 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([ModParamBase NoInfo Name] -> HappyWrap24
HappyWrap24 [ModParamBase NoInfo Name]
x)
{-# INLINE happyIn24 #-}
happyOut24 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap24
happyOut24 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap24
happyOut24 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap24
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut24 #-}
newtype HappyWrap25 = HappyWrap25 (Liftedness)
happyIn25 :: (Liftedness) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn25 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
Liftedness -> HappyAbsSyn t99 t100 t101 t102
happyIn25 Liftedness
x = HappyWrap25 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (Liftedness -> HappyWrap25
HappyWrap25 Liftedness
x)
{-# INLINE happyIn25 #-}
happyOut25 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap25
happyOut25 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap25
happyOut25 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap25
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut25 #-}
newtype HappyWrap26 = HappyWrap26 (SpecBase NoInfo Name)
happyIn26 :: (SpecBase NoInfo Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn26 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn26 SpecBase NoInfo Name
x = HappyWrap26 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (SpecBase NoInfo Name -> HappyWrap26
HappyWrap26 SpecBase NoInfo Name
x)
{-# INLINE happyIn26 #-}
happyOut26 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap26
happyOut26 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap26
happyOut26 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap26
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut26 #-}
newtype HappyWrap27 = HappyWrap27 ([SpecBase NoInfo Name])
happyIn27 :: ([SpecBase NoInfo Name]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn27 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[SpecBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn27 [SpecBase NoInfo Name]
x = HappyWrap27 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([SpecBase NoInfo Name] -> HappyWrap27
HappyWrap27 [SpecBase NoInfo Name]
x)
{-# INLINE happyIn27 #-}
happyOut27 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap27
happyOut27 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap27
happyOut27 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap27
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut27 #-}
newtype HappyWrap28 = HappyWrap28 ([SpecBase NoInfo Name])
happyIn28 :: ([SpecBase NoInfo Name]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn28 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[SpecBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn28 [SpecBase NoInfo Name]
x = HappyWrap28 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([SpecBase NoInfo Name] -> HappyWrap28
HappyWrap28 [SpecBase NoInfo Name]
x)
{-# INLINE happyIn28 #-}
happyOut28 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap28
happyOut28 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap28
happyOut28 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap28
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut28 #-}
newtype HappyWrap29 = HappyWrap29 (SizeBinder Name)
happyIn29 :: (SizeBinder Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn29 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SizeBinder Name -> HappyAbsSyn t99 t100 t101 t102
happyIn29 SizeBinder Name
x = HappyWrap29 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (SizeBinder Name -> HappyWrap29
HappyWrap29 SizeBinder Name
x)
{-# INLINE happyIn29 #-}
happyOut29 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap29
happyOut29 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap29
happyOut29 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap29
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut29 #-}
newtype HappyWrap30 = HappyWrap30 ([SizeBinder Name])
happyIn30 :: ([SizeBinder Name]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn30 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[SizeBinder Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn30 [SizeBinder Name]
x = HappyWrap30 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([SizeBinder Name] -> HappyWrap30
HappyWrap30 [SizeBinder Name]
x)
{-# INLINE happyIn30 #-}
happyOut30 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap30
happyOut30 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap30
happyOut30 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap30
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut30 #-}
newtype HappyWrap31 = HappyWrap31 (TypeParamBase Name)
happyIn31 :: (TypeParamBase Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn31 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
TypeParamBase Name -> HappyAbsSyn t99 t100 t101 t102
happyIn31 TypeParamBase Name
x = HappyWrap31 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (TypeParamBase Name -> HappyWrap31
HappyWrap31 TypeParamBase Name
x)
{-# INLINE happyIn31 #-}
happyOut31 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap31
happyOut31 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap31
happyOut31 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap31
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut31 #-}
newtype HappyWrap32 = HappyWrap32 (TypeParamBase Name)
happyIn32 :: (TypeParamBase Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn32 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
TypeParamBase Name -> HappyAbsSyn t99 t100 t101 t102
happyIn32 TypeParamBase Name
x = HappyWrap32 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (TypeParamBase Name -> HappyWrap32
HappyWrap32 TypeParamBase Name
x)
{-# INLINE happyIn32 #-}
happyOut32 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap32
happyOut32 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap32
happyOut32 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap32
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut32 #-}
newtype HappyWrap33 = HappyWrap33 ([TypeParamBase Name])
happyIn33 :: ([TypeParamBase Name]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn33 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[TypeParamBase Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn33 [TypeParamBase Name]
x = HappyWrap33 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([TypeParamBase Name] -> HappyWrap33
HappyWrap33 [TypeParamBase Name]
x)
{-# INLINE happyIn33 #-}
happyOut33 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap33
happyOut33 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
happyOut33 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut33 #-}
newtype HappyWrap34 = HappyWrap34 ([TypeParamBase Name])
happyIn34 :: ([TypeParamBase Name]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn34 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[TypeParamBase Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn34 [TypeParamBase Name]
x = HappyWrap34 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([TypeParamBase Name] -> HappyWrap34
HappyWrap34 [TypeParamBase Name]
x)
{-# INLINE happyIn34 #-}
happyOut34 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap34
happyOut34 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap34
happyOut34 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap34
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut34 #-}
newtype HappyWrap35 = HappyWrap35 ((QualName Name, Loc))
happyIn35 :: ((QualName Name, Loc)) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn35 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35 (QualName Name, Loc)
x = HappyWrap35 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((QualName Name, Loc) -> HappyWrap35
HappyWrap35 (QualName Name, Loc)
x)
{-# INLINE happyIn35 #-}
happyOut35 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap35
happyOut35 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap35
happyOut35 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap35
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut35 #-}
newtype HappyWrap36 = HappyWrap36 (Name)
happyIn36 :: (Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn36 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
Name -> HappyAbsSyn t99 t100 t101 t102
happyIn36 Name
x = HappyWrap36 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (Name -> HappyWrap36
HappyWrap36 Name
x)
{-# INLINE happyIn36 #-}
happyOut36 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap36
happyOut36 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap36
happyOut36 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap36
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut36 #-}
newtype HappyWrap37 = HappyWrap37 ((Name, Loc))
happyIn37 :: ((Name, Loc)) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn37 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn37 (Name, Loc)
x = HappyWrap37 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((Name, Loc) -> HappyWrap37
HappyWrap37 (Name, Loc)
x)
{-# INLINE happyIn37 #-}
happyOut37 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap37
happyOut37 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap37
happyOut37 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap37
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut37 #-}
newtype HappyWrap38 = HappyWrap38 (ValBindBase NoInfo Name)
happyIn38 :: (ValBindBase NoInfo Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn38 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
ValBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn38 ValBindBase NoInfo Name
x = HappyWrap38 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (ValBindBase NoInfo Name -> HappyWrap38
HappyWrap38 ValBindBase NoInfo Name
x)
{-# INLINE happyIn38 #-}
happyOut38 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap38
happyOut38 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap38
happyOut38 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap38
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut38 #-}
newtype HappyWrap39 = HappyWrap39 (TypeBindBase NoInfo Name)
happyIn39 :: (TypeBindBase NoInfo Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn39 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
TypeBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn39 TypeBindBase NoInfo Name
x = HappyWrap39 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (TypeBindBase NoInfo Name -> HappyWrap39
HappyWrap39 TypeBindBase NoInfo Name
x)
{-# INLINE happyIn39 #-}
happyOut39 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap39
happyOut39 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap39
happyOut39 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap39
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut39 #-}
newtype HappyWrap40 = HappyWrap40 (UncheckedTypeExp)
happyIn40 :: (UncheckedTypeExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn40 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn40 UncheckedTypeExp
x = HappyWrap40 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedTypeExp -> HappyWrap40
HappyWrap40 UncheckedTypeExp
x)
{-# INLINE happyIn40 #-}
happyOut40 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap40
happyOut40 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut40 #-}
newtype HappyWrap41 = HappyWrap41 ([Name])
happyIn41 :: ([Name]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn41 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn41 [Name]
x = HappyWrap41 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([Name] -> HappyWrap41
HappyWrap41 [Name]
x)
{-# INLINE happyIn41 #-}
happyOut41 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap41
happyOut41 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap41
happyOut41 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap41
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut41 #-}
newtype HappyWrap42 = HappyWrap42 (UncheckedTypeExp)
happyIn42 :: (UncheckedTypeExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn42 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn42 UncheckedTypeExp
x = HappyWrap42 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedTypeExp -> HappyWrap42
HappyWrap42 UncheckedTypeExp
x)
{-# INLINE happyIn42 #-}
happyOut42 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap42
happyOut42 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap42
happyOut42 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap42
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut42 #-}
newtype HappyWrap43 = HappyWrap43 (([(Name, [UncheckedTypeExp])], Loc))
happyIn43 :: (([(Name, [UncheckedTypeExp])], Loc)) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn43 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
([(Name, [UncheckedTypeExp])], Loc)
-> HappyAbsSyn t99 t100 t101 t102
happyIn43 ([(Name, [UncheckedTypeExp])], Loc)
x = HappyWrap43 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (([(Name, [UncheckedTypeExp])], Loc) -> HappyWrap43
HappyWrap43 ([(Name, [UncheckedTypeExp])], Loc)
x)
{-# INLINE happyIn43 #-}
happyOut43 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap43
happyOut43 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap43
happyOut43 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap43
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut43 #-}
newtype HappyWrap44 = HappyWrap44 ([UncheckedTypeExp])
happyIn44 :: ([UncheckedTypeExp]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn44 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedTypeExp] -> HappyAbsSyn t99 t100 t101 t102
happyIn44 [UncheckedTypeExp]
x = HappyWrap44 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([UncheckedTypeExp] -> HappyWrap44
HappyWrap44 [UncheckedTypeExp]
x)
{-# INLINE happyIn44 #-}
happyOut44 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap44
happyOut44 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap44
happyOut44 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap44
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut44 #-}
newtype HappyWrap45 = HappyWrap45 ((Name, [UncheckedTypeExp], Loc))
happyIn45 :: ((Name, [UncheckedTypeExp], Loc)) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn45 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(Name, [UncheckedTypeExp], Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn45 (Name, [UncheckedTypeExp], Loc)
x = HappyWrap45 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((Name, [UncheckedTypeExp], Loc) -> HappyWrap45
HappyWrap45 (Name, [UncheckedTypeExp], Loc)
x)
{-# INLINE happyIn45 #-}
happyOut45 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap45
happyOut45 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap45
happyOut45 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap45
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut45 #-}
newtype HappyWrap46 = HappyWrap46 (UncheckedTypeExp)
happyIn46 :: (UncheckedTypeExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn46 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn46 UncheckedTypeExp
x = HappyWrap46 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedTypeExp -> HappyWrap46
HappyWrap46 UncheckedTypeExp
x)
{-# INLINE happyIn46 #-}
happyOut46 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap46
happyOut46 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap46
happyOut46 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap46
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut46 #-}
newtype HappyWrap47 = HappyWrap47 (UncheckedTypeExp)
happyIn47 :: (UncheckedTypeExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn47 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn47 UncheckedTypeExp
x = HappyWrap47 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedTypeExp -> HappyWrap47
HappyWrap47 UncheckedTypeExp
x)
{-# INLINE happyIn47 #-}
happyOut47 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap47
happyOut47 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap47
happyOut47 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap47
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut47 #-}
newtype HappyWrap48 = HappyWrap48 ((Name, Loc))
happyIn48 :: ((Name, Loc)) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn48 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn48 (Name, Loc)
x = HappyWrap48 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((Name, Loc) -> HappyWrap48
HappyWrap48 (Name, Loc)
x)
{-# INLINE happyIn48 #-}
happyOut48 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap48
happyOut48 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap48
happyOut48 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap48
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut48 #-}
newtype HappyWrap49 = HappyWrap49 (TypeArgExp UncheckedExp Name)
happyIn49 :: (TypeArgExp UncheckedExp Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn49 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
TypeArgExp UncheckedExp Name -> HappyAbsSyn t99 t100 t101 t102
happyIn49 TypeArgExp UncheckedExp Name
x = HappyWrap49 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (TypeArgExp UncheckedExp Name -> HappyWrap49
HappyWrap49 TypeArgExp UncheckedExp Name
x)
{-# INLINE happyIn49 #-}
happyOut49 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap49
happyOut49 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap49
happyOut49 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap49
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut49 #-}
newtype HappyWrap50 = HappyWrap50 ((L Name, UncheckedTypeExp))
happyIn50 :: ((L Name, UncheckedTypeExp)) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn50 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(L Name, UncheckedTypeExp) -> HappyAbsSyn t99 t100 t101 t102
happyIn50 (L Name, UncheckedTypeExp)
x = HappyWrap50 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((L Name, UncheckedTypeExp) -> HappyWrap50
HappyWrap50 (L Name, UncheckedTypeExp)
x)
{-# INLINE happyIn50 #-}
happyOut50 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap50
happyOut50 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap50
happyOut50 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap50
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut50 #-}
newtype HappyWrap51 = HappyWrap51 ([(L Name, UncheckedTypeExp)])
happyIn51 :: ([(L Name, UncheckedTypeExp)]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn51 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[(L Name, UncheckedTypeExp)] -> HappyAbsSyn t99 t100 t101 t102
happyIn51 [(L Name, UncheckedTypeExp)]
x = HappyWrap51 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([(L Name, UncheckedTypeExp)] -> HappyWrap51
HappyWrap51 [(L Name, UncheckedTypeExp)]
x)
{-# INLINE happyIn51 #-}
happyOut51 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap51
happyOut51 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap51
happyOut51 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap51
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut51 #-}
newtype HappyWrap52 = HappyWrap52 ([UncheckedTypeExp])
happyIn52 :: ([UncheckedTypeExp]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn52 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedTypeExp] -> HappyAbsSyn t99 t100 t101 t102
happyIn52 [UncheckedTypeExp]
x = HappyWrap52 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([UncheckedTypeExp] -> HappyWrap52
HappyWrap52 [UncheckedTypeExp]
x)
{-# INLINE happyIn52 #-}
happyOut52 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap52
happyOut52 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap52
happyOut52 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap52
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut52 #-}
newtype HappyWrap53 = HappyWrap53 (SizeExp UncheckedExp)
happyIn53 :: (SizeExp UncheckedExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn53 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SizeExp UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn53 SizeExp UncheckedExp
x = HappyWrap53 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (SizeExp UncheckedExp -> HappyWrap53
HappyWrap53 SizeExp UncheckedExp
x)
{-# INLINE happyIn53 #-}
happyOut53 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap53
happyOut53 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap53
happyOut53 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap53
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut53 #-}
newtype HappyWrap54 = HappyWrap54 (PatBase NoInfo Name ParamType)
happyIn54 :: (PatBase NoInfo Name ParamType) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn54 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name ParamType -> HappyAbsSyn t99 t100 t101 t102
happyIn54 PatBase NoInfo Name ParamType
x = HappyWrap54 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (PatBase NoInfo Name ParamType -> HappyWrap54
HappyWrap54 PatBase NoInfo Name ParamType
x)
{-# INLINE happyIn54 #-}
happyOut54 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap54
happyOut54 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap54
happyOut54 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap54
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut54 #-}
newtype HappyWrap55 = HappyWrap55 ((PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType]))
happyIn55 :: ((PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn55 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
-> HappyAbsSyn t99 t100 t101 t102
happyIn55 (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
x = HappyWrap55 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
-> HappyWrap55
HappyWrap55 (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
x)
{-# INLINE happyIn55 #-}
happyOut55 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap55
happyOut55 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap55
happyOut55 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap55
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut55 #-}
newtype HappyWrap56 = HappyWrap56 ([PatBase NoInfo Name ParamType ])
happyIn56 :: ([PatBase NoInfo Name ParamType ]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn56 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[PatBase NoInfo Name ParamType] -> HappyAbsSyn t99 t100 t101 t102
happyIn56 [PatBase NoInfo Name ParamType]
x = HappyWrap56 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([PatBase NoInfo Name ParamType] -> HappyWrap56
HappyWrap56 [PatBase NoInfo Name ParamType]
x)
{-# INLINE happyIn56 #-}
happyOut56 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap56
happyOut56 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap56
happyOut56 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap56
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut56 #-}
newtype HappyWrap57 = HappyWrap57 ((QualName Name, Loc))
happyIn57 :: ((QualName Name, Loc)) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn57 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn57 (QualName Name, Loc)
x = HappyWrap57 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((QualName Name, Loc) -> HappyWrap57
HappyWrap57 (QualName Name, Loc)
x)
{-# INLINE happyIn57 #-}
happyOut57 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap57
happyOut57 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
happyOut57 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut57 #-}
newtype HappyWrap58 = HappyWrap58 (UncheckedExp)
happyIn58 :: (UncheckedExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn58 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn58 UncheckedExp
x = HappyWrap58 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap58
HappyWrap58 UncheckedExp
x)
{-# INLINE happyIn58 #-}
happyOut58 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap58
happyOut58 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut58 #-}
newtype HappyWrap59 = HappyWrap59 (UncheckedExp)
happyIn59 :: (UncheckedExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn59 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59 UncheckedExp
x = HappyWrap59 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap59
HappyWrap59 UncheckedExp
x)
{-# INLINE happyIn59 #-}
happyOut59 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap59
happyOut59 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut59 #-}
newtype HappyWrap60 = HappyWrap60 (NE.NonEmpty UncheckedExp)
happyIn60 :: (NE.NonEmpty UncheckedExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn60 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
NonEmpty UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn60 NonEmpty UncheckedExp
x = HappyWrap60 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (NonEmpty UncheckedExp -> HappyWrap60
HappyWrap60 NonEmpty UncheckedExp
x)
{-# INLINE happyIn60 #-}
happyOut60 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap60
happyOut60 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap60
happyOut60 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap60
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut60 #-}
newtype HappyWrap61 = HappyWrap61 (UncheckedExp)
happyIn61 :: (UncheckedExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn61 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn61 UncheckedExp
x = HappyWrap61 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap61
HappyWrap61 UncheckedExp
x)
{-# INLINE happyIn61 #-}
happyOut61 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap61
happyOut61 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap61
happyOut61 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap61
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut61 #-}
newtype HappyWrap62 = HappyWrap62 (UncheckedExp)
happyIn62 :: (UncheckedExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn62 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62 UncheckedExp
x = HappyWrap62 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap62
HappyWrap62 UncheckedExp
x)
{-# INLINE happyIn62 #-}
happyOut62 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap62
happyOut62 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
happyOut62 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut62 #-}
newtype HappyWrap63 = HappyWrap63 ((PrimValue, Loc))
happyIn63 :: ((PrimValue, Loc)) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn63 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn63 (PrimValue, Loc)
x = HappyWrap63 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((PrimValue, Loc) -> HappyWrap63
HappyWrap63 (PrimValue, Loc)
x)
{-# INLINE happyIn63 #-}
happyOut63 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap63
happyOut63 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap63
happyOut63 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap63
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut63 #-}
newtype HappyWrap64 = HappyWrap64 ((PrimValue, Loc))
happyIn64 :: ((PrimValue, Loc)) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn64 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn64 (PrimValue, Loc)
x = HappyWrap64 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((PrimValue, Loc) -> HappyWrap64
HappyWrap64 (PrimValue, Loc)
x)
{-# INLINE happyIn64 #-}
happyOut64 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap64
happyOut64 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap64
happyOut64 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap64
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut64 #-}
newtype HappyWrap65 = HappyWrap65 ([UncheckedExp])
happyIn65 :: ([UncheckedExp]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn65 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedExp] -> HappyAbsSyn t99 t100 t101 t102
happyIn65 [UncheckedExp]
x = HappyWrap65 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([UncheckedExp] -> HappyWrap65
HappyWrap65 [UncheckedExp]
x)
{-# INLINE happyIn65 #-}
happyOut65 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap65
happyOut65 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap65
happyOut65 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap65
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut65 #-}
newtype HappyWrap66 = HappyWrap66 ([UncheckedExp])
happyIn66 :: ([UncheckedExp]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn66 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedExp] -> HappyAbsSyn t99 t100 t101 t102
happyIn66 [UncheckedExp]
x = HappyWrap66 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([UncheckedExp] -> HappyWrap66
HappyWrap66 [UncheckedExp]
x)
{-# INLINE happyIn66 #-}
happyOut66 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap66
happyOut66 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap66
happyOut66 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap66
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut66 #-}
newtype HappyWrap67 = HappyWrap67 ([L Name])
happyIn67 :: ([L Name]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn67 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[L Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn67 [L Name]
x = HappyWrap67 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([L Name] -> HappyWrap67
HappyWrap67 [L Name]
x)
{-# INLINE happyIn67 #-}
happyOut67 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap67
happyOut67 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap67
happyOut67 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap67
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut67 #-}
newtype HappyWrap68 = HappyWrap68 ([L Name])
happyIn68 :: ([L Name]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn68 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[L Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn68 [L Name]
x = HappyWrap68 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([L Name] -> HappyWrap68
HappyWrap68 [L Name]
x)
{-# INLINE happyIn68 #-}
happyOut68 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap68
happyOut68 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap68
happyOut68 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap68
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut68 #-}
newtype HappyWrap69 = HappyWrap69 (FieldBase NoInfo Name)
happyIn69 :: (FieldBase NoInfo Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn69 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
FieldBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn69 FieldBase NoInfo Name
x = HappyWrap69 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (FieldBase NoInfo Name -> HappyWrap69
HappyWrap69 FieldBase NoInfo Name
x)
{-# INLINE happyIn69 #-}
happyOut69 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap69
happyOut69 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap69
happyOut69 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap69
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut69 #-}
newtype HappyWrap70 = HappyWrap70 ([FieldBase NoInfo Name])
happyIn70 :: ([FieldBase NoInfo Name]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn70 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[FieldBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn70 [FieldBase NoInfo Name]
x = HappyWrap70 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([FieldBase NoInfo Name] -> HappyWrap70
HappyWrap70 [FieldBase NoInfo Name]
x)
{-# INLINE happyIn70 #-}
happyOut70 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap70
happyOut70 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap70
happyOut70 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap70
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut70 #-}
newtype HappyWrap71 = HappyWrap71 (UncheckedExp)
happyIn71 :: (UncheckedExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn71 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn71 UncheckedExp
x = HappyWrap71 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap71
HappyWrap71 UncheckedExp
x)
{-# INLINE happyIn71 #-}
happyOut71 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap71
happyOut71 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap71
happyOut71 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap71
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut71 #-}
newtype HappyWrap72 = HappyWrap72 (UncheckedExp)
happyIn72 :: (UncheckedExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn72 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn72 UncheckedExp
x = HappyWrap72 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap72
HappyWrap72 UncheckedExp
x)
{-# INLINE happyIn72 #-}
happyOut72 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap72
happyOut72 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap72
happyOut72 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap72
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut72 #-}
newtype HappyWrap73 = HappyWrap73 (UncheckedExp)
happyIn73 :: (UncheckedExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn73 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73 UncheckedExp
x = HappyWrap73 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap73
HappyWrap73 UncheckedExp
x)
{-# INLINE happyIn73 #-}
happyOut73 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap73
happyOut73 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap73
happyOut73 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap73
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut73 #-}
newtype HappyWrap74 = HappyWrap74 (UncheckedExp)
happyIn74 :: (UncheckedExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn74 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn74 UncheckedExp
x = HappyWrap74 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap74
HappyWrap74 UncheckedExp
x)
{-# INLINE happyIn74 #-}
happyOut74 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap74
happyOut74 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap74
happyOut74 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap74
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut74 #-}
newtype HappyWrap75 = HappyWrap75 (UncheckedExp)
happyIn75 :: (UncheckedExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn75 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn75 UncheckedExp
x = HappyWrap75 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap75
HappyWrap75 UncheckedExp
x)
{-# INLINE happyIn75 #-}
happyOut75 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap75
happyOut75 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap75
happyOut75 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap75
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut75 #-}
newtype HappyWrap76 = HappyWrap76 (UncheckedExp)
happyIn76 :: (UncheckedExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn76 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn76 UncheckedExp
x = HappyWrap76 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap76
HappyWrap76 UncheckedExp
x)
{-# INLINE happyIn76 #-}
happyOut76 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap76
happyOut76 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap76
happyOut76 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap76
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut76 #-}
newtype HappyWrap77 = HappyWrap77 (UncheckedExp)
happyIn77 :: (UncheckedExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn77 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn77 UncheckedExp
x = HappyWrap77 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap77
HappyWrap77 UncheckedExp
x)
{-# INLINE happyIn77 #-}
happyOut77 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap77
happyOut77 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap77
happyOut77 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap77
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut77 #-}
newtype HappyWrap78 = HappyWrap78 (UncheckedExp)
happyIn78 :: (UncheckedExp) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn78 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn78 UncheckedExp
x = HappyWrap78 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap78
HappyWrap78 UncheckedExp
x)
{-# INLINE happyIn78 #-}
happyOut78 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap78
happyOut78 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap78
happyOut78 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap78
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut78 #-}
newtype HappyWrap79 = HappyWrap79 (NE.NonEmpty (CaseBase NoInfo Name))
happyIn79 :: (NE.NonEmpty (CaseBase NoInfo Name)) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn79 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
NonEmpty (CaseBase NoInfo Name) -> HappyAbsSyn t99 t100 t101 t102
happyIn79 NonEmpty (CaseBase NoInfo Name)
x = HappyWrap79 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (NonEmpty (CaseBase NoInfo Name) -> HappyWrap79
HappyWrap79 NonEmpty (CaseBase NoInfo Name)
x)
{-# INLINE happyIn79 #-}
happyOut79 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap79
happyOut79 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap79
happyOut79 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap79
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut79 #-}
newtype HappyWrap80 = HappyWrap80 (CaseBase NoInfo Name)
happyIn80 :: (CaseBase NoInfo Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn80 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
CaseBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn80 CaseBase NoInfo Name
x = HappyWrap80 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (CaseBase NoInfo Name -> HappyWrap80
HappyWrap80 CaseBase NoInfo Name
x)
{-# INLINE happyIn80 #-}
happyOut80 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap80
happyOut80 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap80
happyOut80 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap80
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut80 #-}
newtype HappyWrap81 = HappyWrap81 (PatBase NoInfo Name StructType)
happyIn81 :: (PatBase NoInfo Name StructType) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn81 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn81 PatBase NoInfo Name StructType
x = HappyWrap81 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (PatBase NoInfo Name StructType -> HappyWrap81
HappyWrap81 PatBase NoInfo Name StructType
x)
{-# INLINE happyIn81 #-}
happyOut81 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap81
happyOut81 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
happyOut81 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut81 #-}
newtype HappyWrap82 = HappyWrap82 (PatBase NoInfo Name StructType)
happyIn82 :: (PatBase NoInfo Name StructType) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn82 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn82 PatBase NoInfo Name StructType
x = HappyWrap82 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (PatBase NoInfo Name StructType -> HappyWrap82
HappyWrap82 PatBase NoInfo Name StructType
x)
{-# INLINE happyIn82 #-}
happyOut82 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap82
happyOut82 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap82
happyOut82 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap82
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut82 #-}
newtype HappyWrap83 = HappyWrap83 ([PatBase NoInfo Name StructType])
happyIn83 :: ([PatBase NoInfo Name StructType]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn83 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[PatBase NoInfo Name StructType] -> HappyAbsSyn t99 t100 t101 t102
happyIn83 [PatBase NoInfo Name StructType]
x = HappyWrap83 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([PatBase NoInfo Name StructType] -> HappyWrap83
HappyWrap83 [PatBase NoInfo Name StructType]
x)
{-# INLINE happyIn83 #-}
happyOut83 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap83
happyOut83 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap83
happyOut83 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap83
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut83 #-}
newtype HappyWrap84 = HappyWrap84 (PatBase NoInfo Name StructType)
happyIn84 :: (PatBase NoInfo Name StructType) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn84 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn84 PatBase NoInfo Name StructType
x = HappyWrap84 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (PatBase NoInfo Name StructType -> HappyWrap84
HappyWrap84 PatBase NoInfo Name StructType
x)
{-# INLINE happyIn84 #-}
happyOut84 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap84
happyOut84 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap84
happyOut84 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap84
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut84 #-}
newtype HappyWrap85 = HappyWrap85 ([PatBase NoInfo Name StructType])
happyIn85 :: ([PatBase NoInfo Name StructType]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn85 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[PatBase NoInfo Name StructType] -> HappyAbsSyn t99 t100 t101 t102
happyIn85 [PatBase NoInfo Name StructType]
x = HappyWrap85 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([PatBase NoInfo Name StructType] -> HappyWrap85
HappyWrap85 [PatBase NoInfo Name StructType]
x)
{-# INLINE happyIn85 #-}
happyOut85 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap85
happyOut85 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap85
happyOut85 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap85
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut85 #-}
newtype HappyWrap86 = HappyWrap86 ((L Name, PatBase NoInfo Name StructType))
happyIn86 :: ((L Name, PatBase NoInfo Name StructType)) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn86 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(L Name, PatBase NoInfo Name StructType)
-> HappyAbsSyn t99 t100 t101 t102
happyIn86 (L Name, PatBase NoInfo Name StructType)
x = HappyWrap86 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((L Name, PatBase NoInfo Name StructType) -> HappyWrap86
HappyWrap86 (L Name, PatBase NoInfo Name StructType)
x)
{-# INLINE happyIn86 #-}
happyOut86 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap86
happyOut86 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap86
happyOut86 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap86
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut86 #-}
newtype HappyWrap87 = HappyWrap87 ([(L Name, PatBase NoInfo Name StructType)])
happyIn87 :: ([(L Name, PatBase NoInfo Name StructType)]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn87 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[(L Name, PatBase NoInfo Name StructType)]
-> HappyAbsSyn t99 t100 t101 t102
happyIn87 [(L Name, PatBase NoInfo Name StructType)]
x = HappyWrap87 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([(L Name, PatBase NoInfo Name StructType)] -> HappyWrap87
HappyWrap87 [(L Name, PatBase NoInfo Name StructType)]
x)
{-# INLINE happyIn87 #-}
happyOut87 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap87
happyOut87 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap87
happyOut87 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap87
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut87 #-}
newtype HappyWrap88 = HappyWrap88 ([(L Name, PatBase NoInfo Name StructType)])
happyIn88 :: ([(L Name, PatBase NoInfo Name StructType)]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn88 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[(L Name, PatBase NoInfo Name StructType)]
-> HappyAbsSyn t99 t100 t101 t102
happyIn88 [(L Name, PatBase NoInfo Name StructType)]
x = HappyWrap88 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([(L Name, PatBase NoInfo Name StructType)] -> HappyWrap88
HappyWrap88 [(L Name, PatBase NoInfo Name StructType)]
x)
{-# INLINE happyIn88 #-}
happyOut88 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap88
happyOut88 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap88
happyOut88 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap88
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut88 #-}
newtype HappyWrap89 = HappyWrap89 ((PatLit, Loc))
happyIn89 :: ((PatLit, Loc)) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn89 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn89 (PatLit, Loc)
x = HappyWrap89 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((PatLit, Loc) -> HappyWrap89
HappyWrap89 (PatLit, Loc)
x)
{-# INLINE happyIn89 #-}
happyOut89 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap89
happyOut89 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap89
happyOut89 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap89
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut89 #-}
newtype HappyWrap90 = HappyWrap90 ((PatLit, Loc))
happyIn90 :: ((PatLit, Loc)) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn90 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn90 (PatLit, Loc)
x = HappyWrap90 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((PatLit, Loc) -> HappyWrap90
HappyWrap90 (PatLit, Loc)
x)
{-# INLINE happyIn90 #-}
happyOut90 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap90
happyOut90 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap90
happyOut90 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap90
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut90 #-}
newtype HappyWrap91 = HappyWrap91 (LoopFormBase NoInfo Name)
happyIn91 :: (LoopFormBase NoInfo Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn91 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
LoopFormBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn91 LoopFormBase NoInfo Name
x = HappyWrap91 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (LoopFormBase NoInfo Name -> HappyWrap91
HappyWrap91 LoopFormBase NoInfo Name
x)
{-# INLINE happyIn91 #-}
happyOut91 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap91
happyOut91 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap91
happyOut91 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap91
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut91 #-}
newtype HappyWrap92 = HappyWrap92 (UncheckedDimIndex)
happyIn92 :: (UncheckedDimIndex) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn92 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
happyIn92 UncheckedDimIndex
x = HappyWrap92 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedDimIndex -> HappyWrap92
HappyWrap92 UncheckedDimIndex
x)
{-# INLINE happyIn92 #-}
happyOut92 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap92
happyOut92 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap92
happyOut92 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap92
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut92 #-}
newtype HappyWrap93 = HappyWrap93 ([UncheckedDimIndex])
happyIn93 :: ([UncheckedDimIndex]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn93 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedDimIndex] -> HappyAbsSyn t99 t100 t101 t102
happyIn93 [UncheckedDimIndex]
x = HappyWrap93 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([UncheckedDimIndex] -> HappyWrap93
HappyWrap93 [UncheckedDimIndex]
x)
{-# INLINE happyIn93 #-}
happyOut93 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap93
happyOut93 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap93
happyOut93 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap93
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut93 #-}
newtype HappyWrap94 = HappyWrap94 (IdentBase NoInfo Name StructType)
happyIn94 :: (IdentBase NoInfo Name StructType) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn94 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
IdentBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn94 IdentBase NoInfo Name StructType
x = HappyWrap94 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (IdentBase NoInfo Name StructType -> HappyWrap94
HappyWrap94 IdentBase NoInfo Name StructType
x)
{-# INLINE happyIn94 #-}
happyOut94 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap94
happyOut94 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap94
happyOut94 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap94
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut94 #-}
newtype HappyWrap95 = HappyWrap95 (L Name)
happyIn95 :: (L Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn95 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
L Name -> HappyAbsSyn t99 t100 t101 t102
happyIn95 L Name
x = HappyWrap95 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (L Name -> HappyWrap95
HappyWrap95 L Name
x)
{-# INLINE happyIn95 #-}
happyOut95 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap95
happyOut95 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap95
happyOut95 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap95
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut95 #-}
newtype HappyWrap96 = HappyWrap96 ((AttrAtom Name, Loc))
happyIn96 :: ((AttrAtom Name, Loc)) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn96 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(AttrAtom Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn96 (AttrAtom Name, Loc)
x = HappyWrap96 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((AttrAtom Name, Loc) -> HappyWrap96
HappyWrap96 (AttrAtom Name, Loc)
x)
{-# INLINE happyIn96 #-}
happyOut96 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap96
happyOut96 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap96
happyOut96 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap96
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut96 #-}
newtype HappyWrap97 = HappyWrap97 (AttrInfo Name)
happyIn97 :: (AttrInfo Name) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn97 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
AttrInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn97 AttrInfo Name
x = HappyWrap97 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (AttrInfo Name -> HappyWrap97
HappyWrap97 AttrInfo Name
x)
{-# INLINE happyIn97 #-}
happyOut97 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap97
happyOut97 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap97
happyOut97 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap97
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut97 #-}
newtype HappyWrap98 = HappyWrap98 ([AttrInfo Name])
happyIn98 :: ([AttrInfo Name]) -> (HappyAbsSyn t99 t100 t101 t102)
happyIn98 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[AttrInfo Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn98 [AttrInfo Name]
x = HappyWrap98 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([AttrInfo Name] -> HappyWrap98
HappyWrap98 [AttrInfo Name]
x)
{-# INLINE happyIn98 #-}
happyOut98 :: (HappyAbsSyn t99 t100 t101 t102) -> HappyWrap98
happyOut98 :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap98
happyOut98 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> HappyWrap98
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut98 #-}
happyIn99 :: t99 -> (HappyAbsSyn t99 t100 t101 t102)
happyIn99 :: forall {k} {k} {k} t99 (t100 :: k) (t101 :: k) (t102 :: k).
t99 -> HappyAbsSyn t99 t100 t101 t102
happyIn99 t99
x = t99 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# t99
x
{-# INLINE happyIn99 #-}
happyOut99 :: (HappyAbsSyn t99 t100 t101 t102) -> t99
happyOut99 :: forall {k} {k} {k} t99 (t100 :: k) (t101 :: k) (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> t99
happyOut99 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> t99
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut99 #-}
happyIn100 :: t100 -> (HappyAbsSyn t99 t100 t101 t102)
happyIn100 :: forall {k} {k} {k} t100 (t99 :: k) (t101 :: k) (t102 :: k).
t100 -> HappyAbsSyn t99 t100 t101 t102
happyIn100 t100
x = t100 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# t100
x
{-# INLINE happyIn100 #-}
happyOut100 :: (HappyAbsSyn t99 t100 t101 t102) -> t100
happyOut100 :: forall {k} {k} {k} (t99 :: k) t100 (t101 :: k) (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> t100
happyOut100 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> t100
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut100 #-}
happyIn101 :: t101 -> (HappyAbsSyn t99 t100 t101 t102)
happyIn101 :: forall {k} {k} {k} t101 (t99 :: k) (t100 :: k) (t102 :: k).
t101 -> HappyAbsSyn t99 t100 t101 t102
happyIn101 t101
x = t101 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# t101
x
{-# INLINE happyIn101 #-}
happyOut101 :: (HappyAbsSyn t99 t100 t101 t102) -> t101
happyOut101 :: forall {k} {k} {k} (t99 :: k) (t100 :: k) t101 (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> t101
happyOut101 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> t101
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut101 #-}
happyIn102 :: t102 -> (HappyAbsSyn t99 t100 t101 t102)
happyIn102 :: forall {k} {k} {k} t102 (t99 :: k) (t100 :: k) (t101 :: k).
t102 -> HappyAbsSyn t99 t100 t101 t102
happyIn102 t102
x = t102 -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# t102
x
{-# INLINE happyIn102 #-}
happyOut102 :: (HappyAbsSyn t99 t100 t101 t102) -> t102
happyOut102 :: forall {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k) t102.
HappyAbsSyn t99 t100 t101 t102 -> t102
happyOut102 HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOut102 #-}
happyInTok :: (L Token) -> (HappyAbsSyn t99 t100 t101 t102)
happyInTok :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
L Token -> HappyAbsSyn t99 t100 t101 t102
happyInTok L Token
x = L Token -> HappyAbsSyn t99 t100 t101 t102
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# L Token
x
{-# INLINE happyInTok #-}
happyOutTok :: (HappyAbsSyn t99 t100 t101 t102) -> (L Token)
happyOutTok :: forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
x = HappyAbsSyn t99 t100 t101 t102 -> L Token
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t99 t100 t101 t102
x
{-# INLINE happyOutTok #-}


{-# NOINLINE happyTokenStrings #-}
happyTokenStrings :: [String]
happyTokenStrings = [String
"if",String
"then",String
"else",String
"let",String
"def",String
"loop",String
"in",String
"match",String
"case",String
"id",String
"'...['",String
"constructor",String
"natlit",String
"intlit",String
"i8lit",String
"i16lit",String
"i32lit",String
"i64lit",String
"u8lit",String
"u16lit",String
"u32lit",String
"u64lit",String
"floatlit",String
"f16lit",String
"f32lit",String
"f64lit",String
"stringlit",String
"charlit",String
"'.'",String
"'..'",String
"'...'",String
"'..<'",String
"'..>'",String
"'='",String
"'*'",String
"'-'",String
"'!'",String
"'<'",String
"'^'",String
"'~'",String
"'|'",String
"'+...'",String
"'-...'",String
"'*...'",String
"'/...'",String
"'%...'",String
"'//...'",String
"'%%...'",String
"'==...'",String
"'!=...'",String
"'<...'",String
"'>...'",String
"'<=...'",String
"'>=...'",String
"'**...'",String
"'<<...'",String
"'>>...'",String
"'|>...'",String
"'<|...'",String
"'|...'",String
"'&...'",String
"'^...'",String
"'||...'",String
"'&&...'",String
"'!...'",String
"'=...'",String
"'('",String
"')'",String
"'{'",String
"'}'",String
"'['",String
"']'",String
"'#['",String
"','",String
"'_'",String
"'\\\\'",String
"'\\''",String
"'\\'^'",String
"'\\'~'",String
"'`'",String
"entry",String
"'->'",String
"':'",String
"':>'",String
"'?'",String
"for",String
"do",String
"with",String
"assert",String
"true",String
"false",String
"while",String
"include",String
"import",String
"type",String
"module",String
"val",String
"open",String
"local",String
"doc",String
"hole",String
"%eof"]

happyActOffsets :: HappyAddr
happyActOffsets :: HappyAddr
happyActOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\x74\x00\x00\x00\x1a\x04\x00\x00\x0b\x03\x00\x00\x5c\x00\x00\x00\x74\x00\x00\x00\xa4\xff\xff\xff\x00\x00\x00\x00\xf8\x00\x00\x00\xc1\xff\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x75\x06\x00\x00\xc7\x06\x00\x00\x77\x02\x00\x00\xbd\x00\x00\x00\x37\x00\x00\x00\xb7\x02\x00\x00\xf7\xff\xff\xff\x5c\x00\x00\x00\x74\x00\x00\x00\x82\x01\x00\x00\x79\x00\x00\x00\x79\x00\x00\x00\x8e\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x00\x00\x00\x00\x00\x1f\x00\x00\x00\x9c\x00\x00\x00\x00\x00\x00\x00\x80\x01\x00\x00\x4a\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc3\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0b\x03\x00\x00\x86\x05\x00\x00\x9f\x05\x00\x00\x0b\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\xff\xff\xff\xff\xd7\x01\x00\x00\x5b\x00\x00\x00\x77\x02\x00\x00\xd8\x06\x00\x00\x36\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x68\x00\x00\x00\xad\x00\x00\x00\x05\x01\x00\x00\x00\x00\x00\x00\x39\x01\x00\x00\x00\x00\x00\x00\x39\x01\x00\x00\xc5\x00\x00\x00\x1c\x01\x00\x00\x81\x00\x00\x00\xc5\x00\x00\x00\xbe\x03\x00\x00\x26\x02\x00\x00\xdd\x00\x00\x00\x3a\x00\x00\x00\x74\x00\x00\x00\xd8\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x74\x00\x00\x00\xf8\x00\x00\x00\x00\x00\x00\x00\x42\x01\x00\x00\x57\x01\x00\x00\x9d\x01\x00\x00\x70\x03\x00\x00\x00\x00\x00\x00\x40\x01\x00\x00\x3f\x01\x00\x00\x76\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x3d\x01\x00\x00\x90\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x04\x00\x00\x92\x04\x00\x00\x00\x00\x00\x00\xc1\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x39\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfe\x01\x00\x00\xfe\x01\x00\x00\x1a\x04\x00\x00\xdc\x03\x00\x00\x00\x00\x00\x00\xd8\x06\x00\x00\xec\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\x90\x04\x00\x00\x26\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc6\x01\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x03\x00\x00\x0d\x02\x00\x00\x1c\x02\x00\x00\x00\x00\x00\x00\x20\x02\x00\x00\x43\x02\x00\x00\x60\x02\x00\x00\xc0\xff\xff\xff\x03\x01\x00\x00\xeb\x03\x00\x00\x7d\x08\x00\x00\x3d\x00\x00\x00\x00\x00\x00\x00\x5f\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\x81\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf9\xff\xff\xff\x5c\x06\x00\x00\xfb\xff\xff\xff\x56\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x87\x15\x00\x00\xe2\x04\x00\x00\x26\x02\x00\x00\x77\x02\x00\x00\x00\x00\x00\x00\x43\x00\x00\x00\x9f\x05\x00\x00\x70\x02\x00\x00\x98\x05\x00\x00\xa1\x02\x00\x00\xae\x02\x00\x00\x78\x00\x00\x00\x00\x00\x00\x00\xc3\x03\x00\x00\x85\x01\x00\x00\xf1\x00\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\xbb\x02\x00\x00\x14\x00\x00\x00\x1a\x04\x00\x00\x1a\x04\x00\x00\x00\x00\x00\x00\x6e\x02\x00\x00\xbf\x02\x00\x00\x85\x02\x00\x00\xe3\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x7c\x00\x00\x00\x00\x00\x00\x00\x7a\x02\x00\x00\xa4\x02\x00\x00\xe0\x02\x00\x00\xe2\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x74\x01\x00\x00\x00\x00\x00\x00\x76\x09\x00\x00\xbd\x02\x00\x00\x74\x01\x00\x00\x76\x09\x00\x00\x9e\x09\x00\x00\x34\x05\x00\x00\x74\x01\x00\x00\xc6\x09\x00\x00\x34\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xce\x02\x00\x00\x44\x01\x00\x00\x87\x15\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd8\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x74\x01\x00\x00\xd8\x06\x00\x00\xf9\x02\x00\x00\x0a\x03\x00\x00\x1f\x03\x00\x00\x23\x03\x00\x00\x29\x03\x00\x00\x93\x01\x00\x00\xd8\x06\x00\x00\xd8\x06\x00\x00\xf8\x00\x00\x00\xf1\x02\x00\x00\xd8\x06\x00\x00\x74\x01\x00\x00\x15\x03\x00\x00\x04\x03\x00\x00\xe9\x02\x00\x00\xba\x01\x00\x00\x32\x03\x00\x00\x9f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfe\x02\x00\x00\x0f\x03\x00\x00\xcb\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x41\x03\x00\x00\x6c\x03\x00\x00\x85\x01\x00\x00\x85\x01\x00\x00\x03\x00\x00\x00\x88\x14\x00\x00\x88\x14\x00\x00\x0d\x0b\x00\x00\xed\x0a\x00\x00\x9f\x14\x00\x00\x9f\x14\x00\x00\x9f\x14\x00\x00\xcd\x0a\x00\x00\xcd\x0a\x00\x00\xaf\x14\x00\x00\xaf\x14\x00\x00\x00\x00\x00\x00\x88\x14\x00\x00\x88\x14\x00\x00\x88\x14\x00\x00\x88\x14\x00\x00\x88\x14\x00\x00\x88\x14\x00\x00\x55\x03\x00\x00\x55\x03\x00\x00\x55\x03\x00\x00\x55\x03\x00\x00\x55\x03\x00\x00\x56\x07\x00\x00\x56\x07\x00\x00\x9f\x14\x00\x00\x9f\x14\x00\x00\x88\x14\x00\x00\x56\x07\x00\x00\x55\x03\x00\x00\xb0\x08\x00\x00\xb0\x08\x00\x00\xb0\x08\x00\x00\xe3\x08\x00\x00\x67\x03\x00\x00\x16\x09\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0b\x03\x00\x00\x75\x07\x00\x00\x45\x03\x00\x00\x63\x03\x00\x00\xe1\x01\x00\x00\x0b\x03\x00\x00\x78\x03\x00\x00\x9d\x03\x00\x00\x74\x01\x00\x00\xd8\x06\x00\x00\x07\x02\x00\x00\xb4\x03\x00\x00\x0b\x03\x00\x00\xdb\x03\x00\x00\x00\x00\x00\x00\xc1\x03\x00\x00\xbd\x03\x00\x00\xc5\x03\x00\x00\x00\x00\x00\x00\x8d\x00\x00\x00\xcc\x03\x00\x00\xed\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x04\x00\x00\xbb\x03\x00\x00\x0b\x03\x00\x00\xf1\x05\x00\x00\x0b\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x06\x00\x00\x00\x00\x00\x00\x0f\x04\x00\x00\x0a\x06\x00\x00\x2c\x00\x00\x00\x00\x00\x00\x00\x12\x04\x00\x00\x07\x02\x00\x00\x18\x04\x00\x00\x0b\x03\x00\x00\x63\x02\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x5c\x04\x00\x00\x00\x00\x00\x00\x0b\x03\x00\x00\xab\x07\x00\x00\x00\x00\x00\x00\x0b\x03\x00\x00\x00\x00\x00\x00\x5b\x02\x00\x00\x0b\x03\x00\x00\x00\x00\x00\x00\x77\x02\x00\x00\x0b\x03\x00\x00\x34\x04\x00\x00\x3b\x04\x00\x00\x19\x02\x00\x00\x2a\x04\x00\x00\xc5\x00\x00\x00\x00\x00\x00\x00\xa1\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x04\x00\x00\x00\x00\x00\x00\x1a\x04\x00\x00\x1a\x04\x00\x00\x00\x00\x00\x00\xa8\x02\x00\x00\x00\x00\x00\x00\x3e\x04\x00\x00\x46\x04\x00\x00\x1a\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x45\x00\x00\x00\x45\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x4b\x04\x00\x00\x74\x04\x00\x00\x99\x04\x00\x00\x00\x00\x00\x00\x0b\x03\x00\x00\x00\x00\x00\x00\x0a\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x03\x00\x00\x4d\x04\x00\x00\xa3\x04\x00\x00\x18\x03\x00\x00\x00\x00\x00\x00\x18\x03\x00\x00\x00\x00\x00\x00\xb9\x04\x00\x00\x5e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xbc\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xda\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x03\x00\x00\x28\x05\x00\x00\x29\x05\x00\x00\x36\x05\x00\x00\x5b\x01\x00\x00\x0b\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x06\x00\x00\x00\x00\x00\x00\x0a\x06\x00\x00\x1a\x04\x00\x00\x00\x00\x00\x00\xa8\x02\x00\x00\x0a\x06\x00\x00\x0b\x03\x00\x00\x59\x00\x00\x00\x3b\x05\x00\x00\x3d\x05\x00\x00\x3a\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\xde\x07\x00\x00\x0b\x03\x00\x00\x00\x00\x00\x00\x89\x02\x00\x00\xe5\x02\x00\x00\x6f\x00\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x59\x05\x00\x00\x5e\x05\x00\x00\x00\x00\x00\x00\xa8\x02\x00\x00\x0b\x03\x00\x00\x00\x00\x00\x00\xa1\x05\x00\x00\xf0\x00\x00\x00\x5c\x00\x00\x00\xf0\x00\x00\x00\x7e\x05\x00\x00\xa7\x02\x00\x00\xed\x00\x00\x00\x82\x05\x00\x00\xf0\x00\x00\x00\xce\x05\x00\x00\xc1\x05\x00\x00\xf0\x00\x00\x00\x00\x00\x00\x00\xf0\x00\x00\x00\xc7\x05\x00\x00\xd8\x06\x00\x00\x9b\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x9b\x05\x00\x00\x9b\x05\x00\x00\x0a\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa9\x05\x00\x00\xac\x05\x00\x00\xb9\x05\x00\x00\x00\x00\x00\x00\xb9\x05\x00\x00\x0a\x06\x00\x00\xee\x09\x00\x00\xb2\x05\x00\x00\xcc\x05\x00\x00\xef\x05\x00\x00\x1a\x04\x00\x00\xf0\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xcf\x05\x00\x00\x03\x06\x00\x00\x05\x06\x00\x00\x0b\x06\x00\x00\x00\x00\x00\x00\x1a\x04\x00\x00\xf9\x01\x00\x00\xf9\x01\x00\x00\x5c\x00\x00\x00\x00\x00\x00\x00\x20\x03\x00\x00\xf9\x01\x00\x00\xf0\x00\x00\x00\x00\x00\x00\x00\xa7\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x77\x02\x00\x00\xf0\x00\x00\x00\xe6\x02\x00\x00\x22\x06\x00\x00\x12\x07\x00\x00\x00\x00\x00\x00\xf9\x00\x00\x00\x00\x00\x00\x00\x3c\x02\x00\x00\xad\x0a\x00\x00\x12\x06\x00\x00\x0e\x06\x00\x00\x10\x06\x00\x00\x46\x09\x00\x00\x16\x09\x00\x00\x16\x09\x00\x00\x16\x09\x00\x00\x00\x00\x00\x00\x14\x08\x00\x00\x0b\x03\x00\x00\x00\x00\x00\x00\x16\x09\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x1b\x06\x00\x00\x1c\x06\x00\x00\x74\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0b\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x59\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xed\x05\x00\x00\x5c\x03\x00\x00\xdc\x05\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\xfb\x05\x00\x00\x0b\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x77\x02\x00\x00\xfd\x05\x00\x00\x5c\x03\x00\x00\xf8\x05\x00\x00\x00\x00\x00\x00\x1a\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x03\x00\x00\x5c\x03\x00\x00\x0b\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x03\x00\x00\x00\x00\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x5c\x03\x00\x00\x16\x09\x00\x00\x16\x09\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x74\x01\x00\x00\x74\x01\x00\x00\xff\x05\x00\x00\x38\x06\x00\x00\xf9\x01\x00\x00\x06\x06\x00\x00\x00\x00\x00\x00\xbe\x02\x00\x00\x21\x06\x00\x00\x01\x06\x00\x00\x00\x00\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x0b\x03\x00\x00\x35\x06\x00\x00\x0b\x03\x00\x00\x00\x00\x00\x00\x0b\x03\x00\x00\x45\x06\x00\x00\x0a\x06\x00\x00\x00\x00\x00\x00\x0b\x03\x00\x00\x5c\x03\x00\x00\x5c\x03\x00\x00\x0b\x03\x00\x00\x5c\x03\x00\x00\x5c\x03\x00\x00\x5c\x03\x00\x00\xc5\x00\x00\x00\x25\x06\x00\x00\xa7\x02\x00\x00\x74\x01\x00\x00\xf0\x00\x00\x00\x26\x06\x00\x00\x27\x06\x00\x00\xad\x0a\x00\x00\xad\x0a\x00\x00\x16\x09\x00\x00\x59\x00\x00\x00\x59\x00\x00\x00\x5c\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x04\x00\x00\x1a\x04\x00\x00\xf9\x01\x00\x00\x59\x06\x00\x00\x00\x00\x00\x00\xf0\x00\x00\x00\x00\x00\x00\x00\x5c\x03\x00\x00\x5c\x03\x00\x00\xf9\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#

happyGotoOffsets :: HappyAddr
happyGotoOffsets :: HappyAddr
happyGotoOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\xf7\x06\x00\x00\xdc\x06\x00\x00\x4b\x0b\x00\x00\xbd\x01\x00\x00\x83\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x54\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\x06\x01\x00\x00\x8a\x01\x00\x00\x6f\x03\x00\x00\x61\x06\x00\x00\x00\x00\x00\x00\x6e\x06\x00\x00\x00\x00\x00\x00\xd2\x01\x00\x00\x87\x14\x00\x00\x00\x00\x00\x00\x21\x01\x00\x00\x23\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf6\x01\x00\x00\xfd\x03\x00\x00\x71\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\x87\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\x0b\x00\x00\x42\x07\x00\x00\x0f\x02\x00\x00\x75\x0b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd5\x0d\x00\x00\xe9\x0d\x00\x00\x7b\x0a\x00\x00\x0d\x03\x00\x00\x21\x0b\x00\x00\xd6\x03\x00\x00\x87\x01\x00\x00\xfc\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\x57\x05\x00\x00\x00\x00\x00\x00\x61\x02\x00\x00\x67\x04\x00\x00\x00\x00\x00\x00\x8a\x0b\x00\x00\x98\x07\x00\x00\x3b\x07\x00\x00\x55\x00\x00\x00\x9f\x0b\x00\x00\x73\x06\x00\x00\x0d\x04\x00\x00\x00\x00\x00\x00\xae\x04\x00\x00\x00\x00\x00\x00\x91\x14\x00\x00\x34\x06\x00\x00\xfd\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\x3b\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x09\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x08\x00\x00\x90\x02\x00\x00\x3c\x09\x00\x00\x38\x04\x00\x00\x00\x00\x00\x00\x0c\x02\x00\x00\x39\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa6\x05\x00\x00\x16\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\xfd\x0d\x00\x00\x00\x00\x00\x00\x77\x06\x00\x00\x78\x01\x00\x00\x00\x00\x00\x00\x11\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x65\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x14\x04\x00\x00\x0e\x03\x00\x00\x46\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x63\x06\x00\x00\xa8\x05\x00\x00\xb5\x04\x00\x00\xfb\x04\x00\x00\x00\x00\x00\x00\x40\x05\x00\x00\x91\x02\x00\x00\x00\x00\x00\x00\xd0\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x87\x03\x00\x00\x41\x04\x00\x00\x00\x00\x00\x00\x25\x0e\x00\x00\x39\x0e\x00\x00\x4d\x0e\x00\x00\x61\x0e\x00\x00\x75\x0e\x00\x00\x89\x0e\x00\x00\x9d\x0e\x00\x00\xb1\x0e\x00\x00\xc5\x0e\x00\x00\xd9\x0e\x00\x00\xed\x0e\x00\x00\x01\x0f\x00\x00\x15\x0f\x00\x00\x29\x0f\x00\x00\x3d\x0f\x00\x00\x51\x0f\x00\x00\x65\x0f\x00\x00\x79\x0f\x00\x00\x8d\x0f\x00\x00\xa1\x0f\x00\x00\xb5\x0f\x00\x00\xc9\x0f\x00\x00\xdd\x0f\x00\x00\xf1\x0f\x00\x00\x05\x10\x00\x00\x19\x10\x00\x00\x2d\x10\x00\x00\x41\x10\x00\x00\x55\x10\x00\x00\x69\x10\x00\x00\x7d\x10\x00\x00\x91\x10\x00\x00\xa5\x10\x00\x00\xb9\x10\x00\x00\xcd\x10\x00\x00\x67\x06\x00\x00\x7b\x01\x00\x00\x76\x14\x00\x00\xc4\x14\x00\x00\x00\x00\x00\x00\x42\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x83\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x48\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x24\x03\x00\x00\x00\x00\x00\x00\x61\x05\x00\x00\x00\x00\x00\x00\x36\x03\x00\x00\x67\x05\x00\x00\x00\x00\x00\x00\x0f\x06\x00\x00\x53\x03\x00\x00\x6e\x05\x00\x00\x11\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x68\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd8\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x9f\x03\x00\x00\xa4\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x63\x04\x00\x00\x6d\x06\x00\x00\xad\x06\x00\x00\x00\x00\x00\x00\xe2\x06\x00\x00\xcd\x03\x00\x00\x00\x00\x00\x00\x7c\x05\x00\x00\x47\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd4\x00\x00\x00\x7a\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6b\x06\x00\x00\x3d\x07\x00\x00\x0e\x0a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x87\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb4\x0b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe1\x10\x00\x00\xc9\x0b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe5\x03\x00\x00\x8e\x02\x00\x00\x26\x0a\x00\x00\x00\x00\x00\x00\xde\x0b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd4\x14\x00\x00\x00\x00\x00\x00\xf3\x0b\x00\x00\x08\x02\x00\x00\x08\x0c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x03\x00\x00\x00\x00\x00\x00\x5f\x05\x00\x00\xcf\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x3e\x0a\x00\x00\x00\x00\x00\x00\xf5\x10\x00\x00\x09\x11\x00\x00\x1d\x11\x00\x00\x31\x11\x00\x00\x45\x11\x00\x00\x59\x11\x00\x00\x6d\x11\x00\x00\x81\x11\x00\x00\x95\x11\x00\x00\xa9\x11\x00\x00\xbd\x11\x00\x00\xd1\x11\x00\x00\xe5\x11\x00\x00\xf9\x11\x00\x00\x0d\x12\x00\x00\x21\x12\x00\x00\x35\x12\x00\x00\x49\x12\x00\x00\x5d\x12\x00\x00\x71\x12\x00\x00\x85\x12\x00\x00\x99\x12\x00\x00\xad\x12\x00\x00\xc1\x12\x00\x00\xd5\x12\x00\x00\xe9\x12\x00\x00\xfd\x12\x00\x00\x11\x13\x00\x00\x25\x13\x00\x00\x39\x13\x00\x00\x76\x06\x00\x00\x00\x00\x00\x00\x36\x0b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1d\x0c\x00\x00\x00\x00\x00\x00\x76\x03\x00\x00\x32\x0c\x00\x00\x00\x00\x00\x00\xbf\x03\x00\x00\x47\x0c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x37\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\xe4\x14\x00\x00\x00\x00\x00\x00\xbe\x04\x00\x00\xf4\x14\x00\x00\x00\x00\x00\x00\x88\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x15\x00\x00\x00\x00\x00\x00\xa5\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x87\x06\x00\x00\x89\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\x5c\x0c\x00\x00\x00\x00\x00\x00\x8a\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5a\x06\x00\x00\x71\x0c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0c\x03\x00\x00\x00\x00\x00\x00\x7d\x0a\x00\x00\x14\x15\x00\x00\x00\x00\x00\x00\xbb\x01\x00\x00\x7f\x0a\x00\x00\x86\x0c\x00\x00\x7f\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x51\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x4d\x13\x00\x00\x00\x00\x00\x00\x56\x0a\x00\x00\x61\x13\x00\x00\x00\x00\x00\x00\x75\x13\x00\x00\x89\x13\x00\x00\x9d\x13\x00\x00\xb1\x13\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5b\x06\x00\x00\xc5\x13\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\xfa\x01\x00\x00\x01\x01\x00\x00\x00\x00\x00\x00\x30\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1e\x01\x00\x00\x53\x01\x00\x00\x00\x00\x00\x00\x25\x01\x00\x00\x00\x00\x00\x00\x35\x01\x00\x00\x00\x00\x00\x00\x3f\x07\x00\x00\x54\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x06\x00\x00\x58\x06\x00\x00\x13\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6a\x06\x00\x00\x00\x00\x00\x00\x70\x06\x00\x00\x74\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x24\x15\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x34\x15\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x3f\x02\x00\x00\x00\x00\x00\x00\x24\x04\x00\x00\x00\x00\x00\x00\x3b\x01\x00\x00\x00\x00\x00\x00\xb2\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\x05\x00\x00\x4e\x01\x00\x00\xb7\x06\x00\x00\x00\x00\x00\x00\xae\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x93\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd9\x13\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xed\x13\x00\x00\x9b\x0c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x53\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb0\x0c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x96\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc5\x0c\x00\x00\xda\x0c\x00\x00\xef\x0c\x00\x00\x00\x00\x00\x00\x01\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x44\x15\x00\x00\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\x0d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x0d\x00\x00\x2e\x0d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x15\x14\x00\x00\x29\x14\x00\x00\x3d\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc1\x04\x00\x00\x13\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x43\x0d\x00\x00\x58\x0d\x00\x00\x6d\x0d\x00\x00\x00\x00\x00\x00\x82\x0d\x00\x00\x00\x00\x00\x00\x97\x0d\x00\x00\x00\x00\x00\x00\x78\x06\x00\x00\x00\x00\x00\x00\xac\x0d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc1\x0d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x69\x09\x00\x00\x00\x00\x00\x00\xba\x02\x00\x00\x22\x05\x00\x00\x5d\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x99\x05\x00\x00\xd1\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x54\x15\x00\x00\x64\x15\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x61\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"#

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

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

happyTable :: HappyAddr
happyTable :: HappyAddr
happyTable = Addr# -> HappyAddr
HappyA# Addr#
"\x00\x00\x00\x00\x30\x00\x00\x00\x0b\x01\x00\x00\x92\x01\x00\x00\x31\x00\x00\x00\x72\x02\x00\x00\x32\x00\x00\x00\x1a\xff\xff\xff\x33\x00\x00\x00\x07\x00\x00\x00\x34\x00\x00\x00\x1a\xff\xff\xff\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\xa0\x00\x00\x00\x8a\x01\x00\x00\x6f\x00\x00\x00\x44\x01\x00\x00\x78\x00\x00\x00\x70\x00\x00\x00\xa1\x00\x00\x00\xa2\x00\x00\x00\x47\x00\x00\x00\xa3\x00\x00\x00\xa4\x00\x00\x00\xff\xff\xff\xff\xa5\x00\x00\x00\xa6\x00\x00\x00\xa7\x00\x00\x00\xa8\x00\x00\x00\xa9\x00\x00\x00\xaa\x00\x00\x00\xab\x00\x00\x00\xac\x00\x00\x00\xad\x00\x00\x00\xae\x00\x00\x00\xaf\x00\x00\x00\xb0\x00\x00\x00\xb1\x00\x00\x00\xb2\x00\x00\x00\xb3\x00\x00\x00\xb4\x00\x00\x00\xb5\x00\x00\x00\xb6\x00\x00\x00\xb7\x00\x00\x00\xb8\x00\x00\x00\xb9\x00\x00\x00\xba\x00\x00\x00\xbb\x00\x00\x00\xbc\x00\x00\x00\xbd\x00\x00\x00\xbe\x00\x00\x00\x48\x00\x00\x00\xbf\x00\x00\x00\x49\x00\x00\x00\x68\x00\x00\x00\x4a\x00\x00\x00\x6f\x00\x00\x00\x4b\x00\x00\x00\x78\x00\x00\x00\x70\x00\x00\x00\x4c\x00\x00\x00\xff\x00\x00\x00\x00\x01\x00\x00\xd3\x00\x00\x00\xc0\x00\x00\x00\x68\x00\x00\x00\x8b\x01\x00\x00\x10\x01\x00\x00\x1c\x02\x00\x00\xff\x00\x00\x00\x00\x01\x00\x00\x0c\x01\x00\x00\x8c\x01\x00\x00\x4d\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x45\x01\x00\x00\x30\x00\x00\x00\x31\x00\x00\x00\x78\x02\x00\x00\x31\x00\x00\x00\x79\x02\x00\x00\x32\x00\x00\x00\x03\x01\x00\x00\x33\x00\x00\x00\x50\x00\x00\x00\x34\x00\x00\x00\x1c\x00\x00\x00\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\x0f\x00\x00\x00\x10\x00\x00\x00\x72\x01\x00\x00\x78\x00\x00\x00\xf7\x01\x00\x00\x6b\x00\x00\x00\x6c\x00\x00\x00\x46\x00\x00\x00\x47\x00\x00\x00\x69\x00\x00\x00\x30\x00\x00\x00\x1c\x00\x00\x00\x96\x01\x00\x00\x31\x00\x00\x00\x1c\x00\x00\x00\x32\x00\x00\x00\x36\x01\x00\x00\x33\x00\x00\x00\xd4\x00\x00\x00\x34\x00\x00\x00\x69\x00\x00\x00\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\x48\x00\x00\x00\x1d\x00\x00\x00\x49\x00\x00\x00\x1e\x00\x00\x00\x4a\x00\x00\x00\x98\x00\x00\x00\x4b\x00\x00\x00\x46\x00\x00\x00\x47\x00\x00\x00\x4c\x00\x00\x00\x1f\x00\x00\x00\x2a\x02\x00\x00\x6d\x00\x00\x00\x78\x00\x00\x00\xff\x00\x00\x00\x00\x01\x00\x00\x88\x02\x00\x00\x05\x02\x00\x00\x6b\x00\x00\x00\xde\x01\x00\x00\x37\x01\x00\x00\x6c\x02\x00\x00\x4d\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x01\x01\x00\x00\x7a\x02\x00\x00\x7b\x02\x00\x00\x20\x00\x00\x00\x21\x02\x00\x00\x1d\x00\x00\x00\x11\x00\x00\x00\x1e\x00\x00\x00\x39\x01\x00\x00\x50\x00\x00\x00\x3a\x01\x00\x00\xff\x00\x00\x00\x00\x01\x00\x00\x48\x00\x00\x00\x12\x00\x00\x00\x49\x00\x00\x00\x12\x01\x00\x00\x4a\x00\x00\x00\x77\x00\x00\x00\x4b\x00\x00\x00\xff\x00\x00\x00\x00\x01\x00\x00\x4c\x00\x00\x00\xff\xff\xff\xff\x1c\x00\x00\x00\x5a\x00\x00\x00\x35\x00\x00\x00\x13\x00\x00\x00\x14\x00\x00\x00\x15\x00\x00\x00\x1c\x00\x00\x00\x16\x00\x00\x00\x17\x00\x00\x00\x07\x00\x00\x00\x28\x02\x00\x00\x4d\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x6d\x00\x00\x00\x30\x00\x00\x00\x22\x02\x00\x00\x06\x02\x00\x00\x31\x00\x00\x00\x39\x01\x00\x00\x32\x00\x00\x00\x3a\x01\x00\x00\x33\x00\x00\x00\x50\x00\x00\x00\x34\x00\x00\x00\x5b\x00\x00\x00\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\x1c\x00\x00\x00\x6b\x01\x00\x00\x0f\x00\x00\x00\x10\x00\x00\x00\x6c\x01\x00\x00\x80\x00\x00\x00\x13\x01\x00\x00\x46\x00\x00\x00\x47\x00\x00\x00\x37\x01\x00\x00\x30\x00\x00\x00\x62\x02\x00\x00\x60\x02\x00\x00\x31\x00\x00\x00\x75\x00\x00\x00\x32\x00\x00\x00\x5d\x00\x00\x00\x33\x00\x00\x00\x5e\x00\x00\x00\x34\x00\x00\x00\x24\x02\x00\x00\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\x48\x00\x00\x00\x18\x01\x00\x00\x49\x00\x00\x00\x54\x02\x00\x00\x4a\x00\x00\x00\x6b\x00\x00\x00\x4b\x00\x00\x00\x46\x00\x00\x00\x47\x00\x00\x00\x4c\x00\x00\x00\x50\x02\x00\x00\x06\x01\x00\x00\x81\x00\x00\x00\x05\x01\x00\x00\x7f\x00\x00\x00\x37\x01\x00\x00\x37\x01\x00\x00\x57\x02\x00\x00\x19\x01\x00\x00\x39\x01\x00\x00\x6d\x01\x00\x00\x3a\x01\x00\x00\x4d\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x78\x00\x00\x00\x4f\x02\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\xaa\x02\x00\x00\xff\xff\xff\xff\x2b\x02\x00\x00\xb1\x02\x00\x00\x11\x00\x00\x00\x50\x00\x00\x00\x1c\x00\x00\x00\x5a\x00\x00\x00\x2c\x02\x00\x00\x48\x00\x00\x00\xba\x01\x00\x00\x49\x00\x00\x00\x12\x00\x00\x00\x4a\x00\x00\x00\x2b\x02\x00\x00\x4b\x00\x00\x00\x37\x01\x00\x00\x85\x00\x00\x00\x4c\x00\x00\x00\x1a\x00\x00\x00\x2c\x02\x00\x00\x1a\x00\x00\x00\xae\x02\x00\x00\x37\x01\x00\x00\x86\x00\x00\x00\x13\x00\x00\x00\x14\x00\x00\x00\x15\x00\x00\x00\x52\x02\x00\x00\x16\x00\x00\x00\x17\x00\x00\x00\x4d\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\xd7\x01\x00\x00\x30\x00\x00\x00\xd6\x01\x00\x00\xd8\x02\x00\x00\x31\x00\x00\x00\x37\x01\x00\x00\x32\x00\x00\x00\xdf\x02\x00\x00\x33\x00\x00\x00\x50\x00\x00\x00\x34\x00\x00\x00\x37\x01\x00\x00\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\x75\x00\x00\x00\x37\x01\x00\x00\x5d\x00\x00\x00\x28\x01\x00\x00\x5e\x00\x00\x00\xcf\x01\x00\x00\x53\x02\x00\x00\x46\x00\x00\x00\x47\x00\x00\x00\xd2\x01\x00\x00\x30\x00\x00\x00\xd0\x01\x00\x00\xe6\x01\x00\x00\x31\x00\x00\x00\xd3\x01\x00\x00\x32\x00\x00\x00\x37\x01\x00\x00\x33\x00\x00\x00\x41\x02\x00\x00\x34\x00\x00\x00\x37\x01\x00\x00\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\x48\x00\x00\x00\x94\x01\x00\x00\x49\x00\x00\x00\x14\x01\x00\x00\x4a\x00\x00\x00\xd5\x01\x00\x00\x4b\x00\x00\x00\x46\x00\x00\x00\x47\x00\x00\x00\x4c\x00\x00\x00\xd8\x00\x00\x00\x81\x00\x00\x00\xff\x00\x00\x00\x00\x01\x00\x00\x81\x00\x00\x00\x8b\x01\x00\x00\x94\x01\x00\x00\x82\x00\x00\x00\x83\x00\x00\x00\x41\x01\x00\x00\x15\x01\x00\x00\x8c\x01\x00\x00\x4d\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x29\x01\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\xd9\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x2a\x01\x00\x00\x2b\x01\x00\x00\x2c\x01\x00\x00\x50\x00\x00\x00\x17\x00\x00\x00\x18\x00\x00\x00\x19\x00\x00\x00\x48\x00\x00\x00\xd1\x01\x00\x00\x49\x00\x00\x00\xcc\x01\x00\x00\x4a\x00\x00\x00\x42\x01\x00\x00\x4b\x00\x00\x00\x85\x00\x00\x00\x42\x01\x00\x00\x4c\x00\x00\x00\x85\x00\x00\x00\xff\x00\x00\x00\x00\x01\x00\x00\x08\x01\x00\x00\x86\x00\x00\x00\xe6\x01\x00\x00\x71\x01\x00\x00\x86\x00\x00\x00\x09\x01\x00\x00\x18\x00\x00\x00\x19\x00\x00\x00\x38\x02\x00\x00\x4d\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x9c\x00\x00\x00\x30\x00\x00\x00\xce\x01\x00\x00\x70\x00\x00\x00\x31\x00\x00\x00\xff\xff\xff\xff\x32\x00\x00\x00\xff\xff\xff\xff\x33\x00\x00\x00\x50\x00\x00\x00\x34\x00\x00\x00\x1a\x00\x00\x00\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\x04\x01\x00\x00\x18\x00\x00\x00\x19\x00\x00\x00\x1a\x00\x00\x00\x61\x02\x00\x00\x18\x00\x00\x00\x19\x00\x00\x00\x46\x00\x00\x00\x47\x00\x00\x00\x7c\x01\x00\x00\x30\x00\x00\x00\x7d\x02\x00\x00\x35\x00\x00\x00\x31\x00\x00\x00\x2b\x02\x00\x00\x32\x00\x00\x00\xc1\x01\x00\x00\x33\x00\x00\x00\x7f\x01\x00\x00\x34\x00\x00\x00\x2c\x02\x00\x00\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\x48\x00\x00\x00\x1a\x00\x00\x00\x49\x00\x00\x00\x3b\x01\x00\x00\x4a\x00\x00\x00\x1a\x00\x00\x00\x4b\x00\x00\x00\x46\x00\x00\x00\x47\x00\x00\x00\x4c\x00\x00\x00\xc3\x00\x00\x00\x57\x02\x00\x00\x6f\x00\x00\x00\x02\x02\x00\x00\x81\x00\x00\x00\x70\x00\x00\x00\x14\x02\x00\x00\xc3\x00\x00\x00\x08\x01\x00\x00\x03\x02\x00\x00\x82\x00\x00\x00\xc6\x01\x00\x00\x4d\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\xc6\x01\x00\x00\x58\x02\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\xc0\x01\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x50\x00\x00\x00\xb3\x02\x00\x00\x18\x00\x00\x00\x19\x00\x00\x00\x48\x00\x00\x00\x2b\x02\x00\x00\x49\x00\x00\x00\x59\x02\x00\x00\x4a\x00\x00\x00\xfb\x01\x00\x00\x4b\x00\x00\x00\x2c\x02\x00\x00\xc5\x00\x00\x00\x4c\x00\x00\x00\x85\x00\x00\x00\xbf\x01\x00\x00\xc4\x00\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\xc5\x00\x00\x00\x71\x01\x00\x00\x86\x00\x00\x00\xfc\x01\x00\x00\xe6\x01\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\x4d\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\xe7\x01\x00\x00\x30\x00\x00\x00\x9c\x00\x00\x00\xbe\x01\x00\x00\x31\x00\x00\x00\x70\x00\x00\x00\x32\x00\x00\x00\xbd\x01\x00\x00\x33\x00\x00\x00\x50\x00\x00\x00\x34\x00\x00\x00\x1a\x00\x00\x00\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\xa9\x02\x00\x00\x92\x00\x00\x00\xbb\x01\x00\x00\x79\x00\x00\x00\x93\x00\x00\x00\x94\x00\x00\x00\x7a\x00\x00\x00\x46\x00\x00\x00\x47\x00\x00\x00\xbc\x01\x00\x00\x30\x00\x00\x00\x1c\x00\x00\x00\x57\x00\x00\x00\x31\x00\x00\x00\x2b\x02\x00\x00\x32\x00\x00\x00\x58\x00\x00\x00\x33\x00\x00\x00\x79\x01\x00\x00\x34\x00\x00\x00\x2c\x02\x00\x00\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\x48\x00\x00\x00\xf3\x01\x00\x00\x49\x00\x00\x00\x88\x01\x00\x00\x4a\x00\x00\x00\x74\x01\x00\x00\x4b\x00\x00\x00\x46\x00\x00\x00\x47\x00\x00\x00\x4c\x00\x00\x00\xc3\x00\x00\x00\x57\x02\x00\x00\x6f\x00\x00\x00\xc9\x01\x00\x00\x81\x00\x00\x00\x70\x00\x00\x00\x56\x00\x00\x00\xc3\x00\x00\x00\x73\x01\x00\x00\x57\x02\x00\x00\x82\x00\x00\x00\x0d\x02\x00\x00\x4d\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x3f\x01\x00\x00\xb0\x02\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x1c\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x50\x00\x00\x00\x3d\x01\x00\x00\xda\x02\x00\x00\x3c\x01\x00\x00\x48\x00\x00\x00\x08\x01\x00\x00\x49\x00\x00\x00\x59\x02\x00\x00\x4a\x00\x00\x00\x42\x02\x00\x00\x4b\x00\x00\x00\x8b\x02\x00\x00\xc5\x00\x00\x00\x4c\x00\x00\x00\x85\x00\x00\x00\x59\x02\x00\x00\x79\x01\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\xc5\x00\x00\x00\x71\x01\x00\x00\x86\x00\x00\x00\x0e\x01\x00\x00\x0f\x01\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\x4d\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x74\x01\x00\x00\x30\x00\x00\x00\x03\x01\x00\x00\x75\x01\x00\x00\x31\x00\x00\x00\x34\x01\x00\x00\x32\x00\x00\x00\x33\x01\x00\x00\x33\x00\x00\x00\x50\x00\x00\x00\x34\x00\x00\x00\x5b\x02\x00\x00\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\xc8\x02\x00\x00\x3d\x02\x00\x00\x5c\x02\x00\x00\x30\x01\x00\x00\x5d\x02\x00\x00\x5e\x02\x00\x00\x5f\x02\x00\x00\x46\x00\x00\x00\x47\x00\x00\x00\x07\x00\x00\x00\x30\x00\x00\x00\x0e\x01\x00\x00\x0f\x01\x00\x00\x31\x00\x00\x00\x2b\x02\x00\x00\x32\x00\x00\x00\x42\x02\x00\x00\x33\x00\x00\x00\x3c\x02\x00\x00\x34\x00\x00\x00\x2c\x02\x00\x00\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\x48\x00\x00\x00\x3b\x02\x00\x00\x49\x00\x00\x00\x28\x01\x00\x00\x4a\x00\x00\x00\x3a\x02\x00\x00\x4b\x00\x00\x00\x46\x00\x00\x00\x47\x00\x00\x00\x4c\x00\x00\x00\xc3\x00\x00\x00\x39\x02\x00\x00\x8c\x01\x00\x00\x34\x02\x00\x00\x8c\x01\x00\x00\x30\x02\x00\x00\x6e\x02\x00\x00\x24\x01\x00\x00\x25\x01\x00\x00\x31\x01\x00\x00\x2e\x02\x00\x00\x78\x00\x00\x00\x4d\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x03\x01\x00\x00\x98\x00\x00\x00\x99\x00\x00\x00\x50\x00\x00\x00\x24\x01\x00\x00\x25\x01\x00\x00\x2e\x01\x00\x00\x48\x00\x00\x00\x78\x00\x00\x00\x49\x00\x00\x00\x26\x02\x00\x00\x4a\x00\x00\x00\x42\x02\x00\x00\x4b\x00\x00\x00\x80\x02\x00\x00\xc5\x00\x00\x00\x4c\x00\x00\x00\x8d\x01\x00\x00\x8e\x01\x00\x00\xf9\x01\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\x25\x02\x00\x00\x9a\x00\x00\x00\x21\x02\x00\x00\x4d\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x29\x01\x00\x00\x24\x01\x00\x00\x25\x01\x00\x00\x26\x01\x00\x00\xff\x00\x00\x00\x00\x01\x00\x00\x2a\x01\x00\x00\x2b\x01\x00\x00\x2c\x01\x00\x00\x50\x00\x00\x00\x34\x00\x00\x00\xd8\x00\x00\x00\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\xd9\x00\x00\x00\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x20\x02\x00\x00\x45\xff\xff\xff\x45\xff\xff\xff\xf1\x00\x00\x00\x45\xff\xff\xff\x45\xff\xff\xff\x16\x02\x00\x00\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x45\xff\xff\xff\x48\x00\x00\x00\x15\x02\x00\x00\x49\x00\x00\x00\x20\x00\x00\x00\x4a\x00\x00\x00\xff\x00\x00\x00\x00\x01\x00\x00\x98\x00\x00\x00\xed\x01\x00\x00\x4c\x00\x00\x00\x24\x01\x00\x00\x25\x01\x00\x00\x3e\x02\x00\x00\x45\xff\xff\xff\xd4\x01\x00\x00\xd5\x00\x00\x00\x24\x00\x00\x00\xd6\x00\x00\x00\x26\x00\x00\x00\x27\x00\x00\x00\x0c\x02\x00\x00\x45\xff\xff\xff\x11\x02\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\xff\x00\x00\x00\x00\x01\x00\x00\x8f\x00\x00\x00\x13\x01\x00\x00\x2a\x00\x00\x00\x72\x00\x00\x00\x5a\x00\x00\x00\x35\x00\x00\x00\x9a\x00\x00\x00\x50\x00\x00\x00\x34\x00\x00\x00\xd8\x00\x00\x00\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\xd9\x00\x00\x00\x5b\x00\x00\x00\x24\x01\x00\x00\x25\x01\x00\x00\x30\x02\x00\x00\x10\x02\x00\x00\x34\x00\x00\x00\xd8\x00\x00\x00\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\xd9\x00\x00\x00\x24\x01\x00\x00\x25\x01\x00\x00\x0e\x02\x00\x00\x0a\x02\x00\x00\x81\x00\x00\x00\x03\x01\x00\x00\x63\x00\x00\x00\x5c\x00\x00\x00\x73\x00\x00\x00\x5d\x00\x00\x00\x3f\x02\x00\x00\x5e\x00\x00\x00\x48\x00\x00\x00\x08\x02\x00\x00\x49\x00\x00\x00\x09\x02\x00\x00\x4a\x00\x00\x00\x07\x02\x00\x00\x64\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x4c\x00\x00\x00\x04\x02\x00\x00\x65\x00\x00\x00\x00\x02\x00\x00\x5f\x00\x00\x00\x0a\x00\x00\x00\x8f\x00\x00\x00\xea\x01\x00\x00\xeb\x01\x00\x00\x92\x01\x00\x00\x0b\x00\x00\x00\x1c\x00\x00\x00\x5a\x00\x00\x00\x35\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x48\x00\x00\x00\x85\x00\x00\x00\x49\x00\x00\x00\x20\x00\x00\x00\x4a\x00\x00\x00\x1c\x00\x00\x00\x5a\x00\x00\x00\x35\x00\x00\x00\x86\x00\x00\x00\x50\x00\x00\x00\x0c\x00\x00\x00\x0d\x00\x00\x00\xca\x01\x00\x00\x8f\x00\x00\x00\x90\x00\x00\x00\x7a\x00\x00\x00\xb7\x01\x00\x00\x80\x00\x00\x00\x26\x00\x00\x00\x27\x00\x00\x00\x5b\x00\x00\x00\x57\x00\x00\x00\xb8\x01\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x58\x00\x00\x00\x24\x01\x00\x00\x25\x01\x00\x00\xb2\x02\x00\x00\x2a\x00\x00\x00\x5b\x00\x00\x00\xff\x00\x00\x00\x00\x01\x00\x00\x34\x00\x00\x00\x50\x00\x00\x00\x35\x00\x00\x00\x36\x00\x00\x00\x37\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x40\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\x5c\x00\x00\x00\x73\x00\x00\x00\x5d\x00\x00\x00\xf6\x01\x00\x00\x5e\x00\x00\x00\x1b\x01\x00\x00\x8f\x01\x00\x00\x90\x01\x00\x00\x0a\x00\x00\x00\xf4\x01\x00\x00\x5c\x00\x00\x00\x20\x00\x00\x00\x5d\x00\x00\x00\x0b\x00\x00\x00\x5e\x00\x00\x00\x7c\x01\x00\x00\xc1\x01\x00\x00\x7e\x01\x00\x00\x5f\x00\x00\x00\x1c\x00\x00\x00\x20\x00\x00\x00\x24\x01\x00\x00\x25\x01\x00\x00\x9e\x02\x00\x00\x7f\x01\x00\x00\xc7\x01\x00\x00\x26\x00\x00\x00\x27\x00\x00\x00\x5f\x00\x00\x00\x0c\x00\x00\x00\x0d\x00\x00\x00\x6d\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\x00\x00\x00\x2a\x00\x00\x00\x48\x00\x00\x00\xe9\x01\x00\x00\x49\x00\x00\x00\xe5\x01\x00\x00\x4a\x00\x00\x00\x28\x00\x00\x00\xe8\x01\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xde\x01\x00\x00\x78\x00\x00\x00\x52\x00\x00\x00\x81\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\xdd\x01\x00\x00\x36\x02\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x57\x00\x00\x00\x6e\x01\x00\x00\x6f\x01\x00\x00\x90\x02\x00\x00\x58\x00\x00\x00\x8b\x02\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\xc9\x00\x00\x00\x50\x00\x00\x00\x35\x00\x00\x00\x89\x00\x00\x00\x8a\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x8b\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x85\x00\x00\x00\x8c\x00\x00\x00\x8f\x00\x00\x00\xea\x01\x00\x00\x95\x02\x00\x00\x62\x00\x00\x00\x63\x00\x00\x00\x86\x00\x00\x00\xa1\x00\x00\x00\x20\x01\x00\x00\x21\x01\x00\x00\xa3\x00\x00\x00\xa4\x00\x00\x00\x8f\x02\x00\x00\xa5\x00\x00\x00\xa6\x00\x00\x00\xa7\x00\x00\x00\xa8\x00\x00\x00\xa9\x00\x00\x00\xaa\x00\x00\x00\xab\x00\x00\x00\xac\x00\x00\x00\xad\x00\x00\x00\xae\x00\x00\x00\xaf\x00\x00\x00\xb0\x00\x00\x00\xb1\x00\x00\x00\xb2\x00\x00\x00\xb3\x00\x00\x00\xb4\x00\x00\x00\xb5\x00\x00\x00\xb6\x00\x00\x00\xb7\x00\x00\x00\xb8\x00\x00\x00\xb9\x00\x00\x00\xba\x00\x00\x00\xbb\x00\x00\x00\xbc\x00\x00\x00\xbd\x00\x00\x00\xbe\x00\x00\x00\xcb\x00\x00\x00\x22\x01\x00\x00\xcc\x00\x00\x00\x24\x01\x00\x00\x25\x01\x00\x00\xcc\x02\x00\x00\xcd\x00\x00\x00\xcd\x01\x00\x00\xce\x00\x00\x00\xe0\x01\x00\x00\x8e\x02\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\xc0\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\xff\x00\x00\x00\x00\x01\x00\x00\x8a\x02\x00\x00\xe1\x01\x00\x00\x57\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\xc9\x00\x00\x00\x58\x00\x00\x00\x35\x00\x00\x00\x89\x00\x00\x00\x8a\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x8b\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x89\x02\x00\x00\x8c\x00\x00\x00\xd7\x01\x00\x00\x63\x00\x00\x00\x7c\x01\x00\x00\x7d\x01\x00\x00\x7e\x01\x00\x00\x87\x02\x00\x00\xa1\x00\x00\x00\x20\x01\x00\x00\x21\x01\x00\x00\xa3\x00\x00\x00\xa4\x00\x00\x00\x7f\x01\x00\x00\xa5\x00\x00\x00\xa6\x00\x00\x00\xa7\x00\x00\x00\xa8\x00\x00\x00\xa9\x00\x00\x00\xaa\x00\x00\x00\xab\x00\x00\x00\xac\x00\x00\x00\xad\x00\x00\x00\xae\x00\x00\x00\xaf\x00\x00\x00\xb0\x00\x00\x00\xb1\x00\x00\x00\xb2\x00\x00\x00\xb3\x00\x00\x00\xb4\x00\x00\x00\xb5\x00\x00\x00\xb6\x00\x00\x00\xb7\x00\x00\x00\xb8\x00\x00\x00\xb9\x00\x00\x00\xba\x00\x00\x00\xbb\x00\x00\x00\xbc\x00\x00\x00\xbd\x00\x00\x00\xbe\x00\x00\x00\xcb\x00\x00\x00\x83\x01\x00\x00\xcc\x00\x00\x00\x24\x01\x00\x00\x25\x01\x00\x00\xcb\x02\x00\x00\xcd\x00\x00\x00\x86\x02\x00\x00\xce\x00\x00\x00\xe0\x01\x00\x00\x85\x02\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\xc0\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x24\x01\x00\x00\x25\x01\x00\x00\xd9\x02\x00\x00\x92\x02\x00\x00\x57\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\xc9\x00\x00\x00\x58\x00\x00\x00\x35\x00\x00\x00\x89\x00\x00\x00\x8a\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x8b\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x84\x02\x00\x00\x8c\x00\x00\x00\x8f\x00\x00\x00\x7b\x01\x00\x00\xce\x00\x00\x00\x7a\x01\x00\x00\x34\x01\x00\x00\x35\x01\x00\x00\xa1\x00\x00\x00\x20\x01\x00\x00\x21\x01\x00\x00\xa3\x00\x00\x00\xa4\x00\x00\x00\x9e\xfe\xff\xff\xa5\x00\x00\x00\xa6\x00\x00\x00\xa7\x00\x00\x00\xa8\x00\x00\x00\xa9\x00\x00\x00\xaa\x00\x00\x00\xab\x00\x00\x00\xac\x00\x00\x00\xad\x00\x00\x00\xae\x00\x00\x00\xaf\x00\x00\x00\xb0\x00\x00\x00\xb1\x00\x00\x00\xb2\x00\x00\x00\xb3\x00\x00\x00\xb4\x00\x00\x00\xb5\x00\x00\x00\xb6\x00\x00\x00\xb7\x00\x00\x00\xb8\x00\x00\x00\xb9\x00\x00\x00\xba\x00\x00\x00\xbb\x00\x00\x00\xbc\x00\x00\x00\xbd\x00\x00\x00\xbe\x00\x00\x00\xcb\x00\x00\x00\x22\x01\x00\x00\xcc\x00\x00\x00\x1c\x01\x00\x00\x30\x01\x00\x00\x7b\x00\x00\x00\xcd\x00\x00\x00\x7c\x00\x00\x00\xce\x00\x00\x00\x1c\x01\x00\x00\x2d\x01\x00\x00\x7d\x00\x00\x00\x75\x02\x00\x00\xc0\x00\x00\x00\x74\x02\x00\x00\x58\x00\x00\x00\x1c\x01\x00\x00\x22\x01\x00\x00\x34\x01\x00\x00\x2e\x02\x00\x00\x26\x02\x00\x00\x27\x02\x00\x00\x46\x02\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\xd2\x00\x00\x00\xd3\x00\x00\x00\x35\x00\x00\x00\x89\x00\x00\x00\x8a\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x8b\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x67\x02\x00\x00\x8c\x00\x00\x00\x77\x01\x00\x00\xf8\x01\x00\x00\x90\x01\x00\x00\x66\x02\x00\x00\xda\x01\x00\x00\x63\x00\x00\x00\xc9\x00\x00\x00\xca\x00\x00\x00\x35\x00\x00\x00\x89\x00\x00\x00\x8a\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x8b\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\xca\xfe\xff\xff\x8c\x00\x00\x00\x75\x02\x00\x00\x76\x02\x00\x00\x78\x00\x00\x00\x1c\x01\x00\x00\xc2\x01\x00\x00\x1c\x01\x00\x00\x80\x01\x00\x00\xca\x00\x00\x00\x60\x02\x00\x00\x8f\x00\x00\x00\xaf\x02\x00\x00\x1c\x01\x00\x00\xaa\x02\x00\x00\xcb\x00\x00\x00\x81\x00\x00\x00\xcc\x00\x00\x00\xc3\x00\x00\x00\xd4\x00\x00\x00\xc3\x00\x00\x00\xcd\x00\x00\x00\x31\x02\x00\x00\xce\x00\x00\x00\x3d\x02\x00\x00\x75\x02\x00\x00\x9c\x02\x00\x00\x56\x02\x00\x00\x75\x02\x00\x00\xd5\x02\x00\x00\x1c\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x78\x01\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\xcb\x00\x00\x00\x52\x02\x00\x00\xcc\x00\x00\x00\x2a\x01\x00\x00\x2b\x01\x00\x00\x2c\x01\x00\x00\xcd\x00\x00\x00\x4f\x02\x00\x00\xce\x00\x00\x00\xca\xfe\xff\xff\x85\x00\x00\x00\xc3\x01\x00\x00\x46\x02\x00\x00\x81\x01\x00\x00\xc5\x00\x00\x00\x49\x02\x00\x00\xc5\x00\x00\x00\x86\x00\x00\x00\x48\x02\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\xfe\x01\x00\x00\xbe\x02\x00\x00\x35\x00\x00\x00\x89\x00\x00\x00\x8a\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x8b\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x46\x02\x00\x00\x8c\x00\x00\x00\x75\x02\x00\x00\xd4\x02\x00\x00\xbd\x02\x00\x00\xbc\x02\x00\x00\xba\x02\x00\x00\xb9\x02\x00\x00\xc9\x00\x00\x00\xca\x00\x00\x00\x35\x00\x00\x00\x89\x00\x00\x00\x8a\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x8b\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\xb8\x02\x00\x00\x8c\x00\x00\x00\xb7\x02\x00\x00\x1c\x01\x00\x00\x1d\x01\x00\x00\x1c\x01\x00\x00\x1d\x01\x00\x00\xad\x02\x00\x00\xb6\x02\x00\x00\xca\x00\x00\x00\x20\x02\x00\x00\xa7\x02\x00\x00\x9c\x02\x00\x00\xa6\x02\x00\x00\x9b\x02\x00\x00\xcb\x00\x00\x00\xc3\x00\x00\x00\xcc\x00\x00\x00\xc3\x00\x00\x00\xd8\x01\x00\x00\xc3\x00\x00\x00\xcd\x00\x00\x00\x0a\x00\x00\x00\xce\x00\x00\x00\xa1\x02\x00\x00\xa0\x02\x00\x00\x97\x02\x00\x00\x0b\x00\x00\x00\x95\x02\x00\x00\xca\x02\x00\x00\xc7\x02\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x94\x02\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\xcb\x00\x00\x00\xc9\x02\x00\x00\xcc\x00\x00\x00\x0c\x00\x00\x00\x0d\x00\x00\x00\xcb\x02\x00\x00\xcd\x00\x00\x00\x08\x01\x00\x00\xce\x00\x00\x00\x2c\x01\x00\x00\xc3\x02\x00\x00\x1e\x01\x00\x00\xc5\x00\x00\x00\x42\x02\x00\x00\xc5\x00\x00\x00\x49\x02\x00\x00\xc5\x00\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\xc9\x00\x00\x00\xc0\x02\x00\x00\x35\x00\x00\x00\x89\x00\x00\x00\x8a\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x8b\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\xdc\x02\x00\x00\x8c\x00\x00\x00\xd8\x02\x00\x00\xd7\x02\x00\x00\x4f\x02\x00\x00\x10\x01\x00\x00\x0c\x01\x00\x00\x01\x01\x00\x00\x17\x01\x00\x00\xca\x00\x00\x00\x35\x00\x00\x00\x89\x00\x00\x00\x8a\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x8b\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x96\x01\x00\x00\x8c\x00\x00\x00\x66\x00\x00\x00\x81\x00\x00\x00\x92\x01\x00\x00\xc4\x01\x00\x00\x45\x01\x00\x00\x88\x01\x00\x00\x83\x01\x00\x00\x31\x02\x00\x00\xc3\x00\x00\x00\x35\x02\x00\x00\x3d\x01\x00\x00\x83\x01\x00\x00\xc3\x00\x00\x00\xcb\x00\x00\x00\x2c\x02\x00\x00\xcc\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x1e\x02\x00\x00\xf1\x01\x00\x00\x91\x02\x00\x00\xce\x00\x00\x00\x90\x02\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x82\x02\x00\x00\x72\x02\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x4c\x02\x00\x00\x64\x02\x00\x00\x34\x02\x00\x00\x4b\x02\x00\x00\x4a\x02\x00\x00\x0a\x00\x00\x00\x85\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x1b\x01\x00\x00\x0b\x00\x00\x00\x8e\x00\x00\x00\x42\x02\x00\x00\x86\x00\x00\x00\x43\x02\x00\x00\xc5\x00\x00\x00\x42\x02\x00\x00\x8f\x00\x00\x00\xbe\x02\x00\x00\xc5\x00\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\x46\x02\x00\x00\xad\x02\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\x0c\x00\x00\x00\x0d\x00\x00\x00\x44\x02\x00\x00\xa7\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x17\x01\x00\x00\x00\x00\x00\x00\x35\x00\x00\x00\x89\x00\x00\x00\x8a\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x8b\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x88\x00\x00\x00\x8c\x00\x00\x00\x35\x00\x00\x00\x89\x00\x00\x00\x8a\x00\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x8b\x00\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x00\x00\x00\x00\x8c\x00\x00\x00\xc3\x00\x00\x00\x5f\x00\x00\x00\x60\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x50\x00\x00\x00\x61\x00\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\x0a\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x0b\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x81\x00\x00\x00\x00\x00\x00\x00\x18\x01\x00\x00\x58\x00\x00\x00\x8e\x00\x00\x00\x00\x00\x00\x00\x31\x02\x00\x00\x00\x00\x00\x00\x32\x02\x00\x00\x00\x00\x00\x00\x8f\x00\x00\x00\x0c\x00\x00\x00\x0d\x00\x00\x00\x00\x00\x00\x00\xf7\x01\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\xc5\x00\x00\x00\x00\x00\x00\x00\x8d\x00\x00\x00\xac\x02\x00\x00\x8e\x00\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\x00\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x8f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x85\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x86\x00\x00\x00\x4e\x00\x00\x00\x4f\x00\x00\x00\x00\x00\x00\x00\xa1\x00\x00\x00\x24\x01\x00\x00\x21\x01\x00\x00\xa3\x00\x00\x00\xa4\x00\x00\x00\x00\x00\x00\x00\xa5\x00\x00\x00\xa6\x00\x00\x00\xa7\x00\x00\x00\xa8\x00\x00\x00\xa9\x00\x00\x00\xaa\x00\x00\x00\xab\x00\x00\x00\xac\x00\x00\x00\xad\x00\x00\x00\xae\x00\x00\x00\xaf\x00\x00\x00\xb0\x00\x00\x00\xb1\x00\x00\x00\xb2\x00\x00\x00\xb3\x00\x00\x00\xb4\x00\x00\x00\xb5\x00\x00\x00\xb6\x00\x00\x00\xb7\x00\x00\x00\xb8\x00\x00\x00\xb9\x00\x00\x00\xba\x00\x00\x00\xbb\x00\x00\x00\xbc\x00\x00\x00\xbd\x00\x00\x00\xbe\x00\x00\x00\xce\x00\x00\x00\xcf\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x70\x00\x00\x00\x00\x00\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\xc0\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x81\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\xc3\x00\x00\x00\x00\x00\x00\x00\x58\x00\x00\x00\x31\x02\x00\x00\x00\x00\x00\x00\x4d\x02\x00\x00\x6d\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x00\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\xdf\x00\x00\x00\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\x85\x00\x00\x00\x00\x00\x00\x00\xd0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc5\x00\x00\x00\xf1\x00\x00\x00\x86\x00\x00\x00\x6e\x01\x00\x00\x1d\x02\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\xdb\x00\x00\x00\xdc\x00\x00\x00\xdd\x00\x00\x00\xde\x00\x00\x00\x00\x00\x00\x00\xdf\x00\x00\x00\xe0\x00\x00\x00\x00\x00\x00\x00\xe1\x00\x00\x00\xe2\x00\x00\x00\x00\x00\x00\x00\xe3\x00\x00\x00\xe4\x00\x00\x00\xe5\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\xeb\x00\x00\x00\xec\x00\x00\x00\xed\x00\x00\x00\xee\x00\x00\x00\xef\x00\x00\x00\xf0\x00\x00\x00\xf1\x00\x00\x00\xf2\x00\x00\x00\xf3\x00\x00\x00\xf4\x00\x00\x00\xf5\x00\x00\x00\xf6\x00\x00\x00\xf7\x00\x00\x00\xf8\x00\x00\x00\xf9\x00\x00\x00\xfa\x00\x00\x00\xfb\x00\x00\x00\xfc\x00\x00\x00\x73\x00\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\xfd\x00\x00\x00\x00\x00\x00\x00\x58\x00\x00\x00\x17\x02\x00\x00\xdb\x00\x00\x00\xdc\x00\x00\x00\xdd\x00\x00\x00\xde\x00\x00\x00\xfe\x00\x00\x00\xdf\x00\x00\x00\xe0\x00\x00\x00\x00\x00\x00\x00\xe1\x00\x00\x00\xe2\x00\x00\x00\x00\x00\x00\x00\xe3\x00\x00\x00\xe4\x00\x00\x00\xe5\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\xeb\x00\x00\x00\xec\x00\x00\x00\xed\x00\x00\x00\xee\x00\x00\x00\xef\x00\x00\x00\xf0\x00\x00\x00\xf1\x00\x00\x00\xf2\x00\x00\x00\xf3\x00\x00\x00\xf4\x00\x00\x00\xf5\x00\x00\x00\xf6\x00\x00\x00\xf7\x00\x00\x00\xf8\x00\x00\x00\xf9\x00\x00\x00\xfa\x00\x00\x00\xfb\x00\x00\x00\xfc\x00\x00\x00\x00\x00\x00\x00\xf0\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\xfd\x00\x00\x00\xdb\x00\x00\x00\xdc\x00\x00\x00\xdd\x00\x00\x00\xde\x00\x00\x00\x00\x00\x00\x00\xdf\x00\x00\x00\xe0\x00\x00\x00\xfe\x00\x00\x00\xe1\x00\x00\x00\xe2\x00\x00\x00\x00\x00\x00\x00\xe3\x00\x00\x00\xe4\x00\x00\x00\xe5\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\xeb\x00\x00\x00\xec\x00\x00\x00\xed\x00\x00\x00\xee\x00\x00\x00\xef\x00\x00\x00\xf0\x00\x00\x00\xf1\x00\x00\x00\xf2\x00\x00\x00\xf3\x00\x00\x00\xf4\x00\x00\x00\xf5\x00\x00\x00\xf6\x00\x00\x00\xf7\x00\x00\x00\xf8\x00\x00\x00\xf9\x00\x00\x00\xfa\x00\x00\x00\xfb\x00\x00\x00\xfc\x00\x00\x00\x78\x00\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\xfd\x00\x00\x00\x00\x00\x00\x00\x58\x00\x00\x00\x71\x02\x00\x00\xdb\x00\x00\x00\xdc\x00\x00\x00\xdd\x00\x00\x00\xde\x00\x00\x00\xfe\x00\x00\x00\xdf\x00\x00\x00\xe0\x00\x00\x00\x00\x00\x00\x00\xe1\x00\x00\x00\xe2\x00\x00\x00\x00\x00\x00\x00\xe3\x00\x00\x00\xe4\x00\x00\x00\xe5\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\xeb\x00\x00\x00\xec\x00\x00\x00\xed\x00\x00\x00\xee\x00\x00\x00\xef\x00\x00\x00\xf0\x00\x00\x00\xf1\x00\x00\x00\xf2\x00\x00\x00\xf3\x00\x00\x00\xf4\x00\x00\x00\xf5\x00\x00\x00\xf6\x00\x00\x00\xf7\x00\x00\x00\xf8\x00\x00\x00\xf9\x00\x00\x00\xfa\x00\x00\x00\xfb\x00\x00\x00\xfc\x00\x00\x00\xe3\x01\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\xfd\x00\x00\x00\x00\x00\x00\x00\x58\x00\x00\x00\xa5\x02\x00\x00\xdb\x00\x00\x00\xdc\x00\x00\x00\xdd\x00\x00\x00\xde\x00\x00\x00\xfe\x00\x00\x00\xdf\x00\x00\x00\xe0\x00\x00\x00\x00\x00\x00\x00\xe1\x00\x00\x00\xe2\x00\x00\x00\x00\x00\x00\x00\xe3\x00\x00\x00\xe4\x00\x00\x00\xe5\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\xeb\x00\x00\x00\xec\x00\x00\x00\xed\x00\x00\x00\xee\x00\x00\x00\xef\x00\x00\x00\xf0\x00\x00\x00\xf1\x00\x00\x00\xf2\x00\x00\x00\xf3\x00\x00\x00\xf4\x00\x00\x00\xf5\x00\x00\x00\xf6\x00\x00\x00\xf7\x00\x00\x00\xf8\x00\x00\x00\xf9\x00\x00\x00\xfa\x00\x00\x00\xfb\x00\x00\x00\xfc\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfd\x00\x00\x00\xdb\x00\x00\x00\xdc\x00\x00\x00\xdd\x00\x00\x00\xde\x00\x00\x00\x00\x00\x00\x00\x98\x01\x00\x00\x99\x01\x00\x00\xfe\x00\x00\x00\x9a\x01\x00\x00\x9b\x01\x00\x00\x00\x00\x00\x00\x9c\x01\x00\x00\x9d\x01\x00\x00\x9e\x01\x00\x00\x9f\x01\x00\x00\xa0\x01\x00\x00\xa1\x01\x00\x00\xa2\x01\x00\x00\xa3\x01\x00\x00\xa4\x01\x00\x00\xa5\x01\x00\x00\xa6\x01\x00\x00\xa7\x01\x00\x00\xa8\x01\x00\x00\xa9\x01\x00\x00\xaa\x01\x00\x00\xab\x01\x00\x00\xac\x01\x00\x00\xad\x01\x00\x00\xae\x01\x00\x00\xaf\x01\x00\x00\xb0\x01\x00\x00\xb1\x01\x00\x00\xb2\x01\x00\x00\xb3\x01\x00\x00\xb4\x01\x00\x00\xb5\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\xb6\x01\x00\x00\xdb\x00\x00\x00\xdc\x00\x00\x00\xdd\x00\x00\x00\xde\x00\x00\x00\x00\x00\x00\x00\xdf\x00\x00\x00\xe0\x00\x00\x00\xfe\x00\x00\x00\xe1\x00\x00\x00\xe2\x00\x00\x00\x00\x00\x00\x00\xe3\x00\x00\x00\xe4\x00\x00\x00\xe5\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\xeb\x00\x00\x00\xec\x00\x00\x00\xed\x00\x00\x00\xee\x00\x00\x00\xef\x00\x00\x00\xf0\x00\x00\x00\xf1\x00\x00\x00\xf2\x00\x00\x00\xf3\x00\x00\x00\xf4\x00\x00\x00\xf5\x00\x00\x00\xf6\x00\x00\x00\xf7\x00\x00\x00\xf8\x00\x00\x00\xf9\x00\x00\x00\xfa\x00\x00\x00\xfb\x00\x00\x00\xfc\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfd\x00\x00\x00\xdb\x00\x00\x00\x19\x02\x00\x00\x1a\x02\x00\x00\x1b\x02\x00\x00\x00\x00\x00\x00\xdf\x00\x00\x00\xe0\x00\x00\x00\xfe\x00\x00\x00\xe1\x00\x00\x00\xe2\x00\x00\x00\x00\x00\x00\x00\xe3\x00\x00\x00\xe4\x00\x00\x00\xe5\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\xeb\x00\x00\x00\xec\x00\x00\x00\xed\x00\x00\x00\xee\x00\x00\x00\xef\x00\x00\x00\xf0\x00\x00\x00\xf1\x00\x00\x00\xf2\x00\x00\x00\xf3\x00\x00\x00\xf4\x00\x00\x00\xf5\x00\x00\x00\xf6\x00\x00\x00\xf7\x00\x00\x00\xf8\x00\x00\x00\xf9\x00\x00\x00\xfa\x00\x00\x00\xfb\x00\x00\x00\xfc\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfd\x00\x00\x00\xdb\x00\x00\x00\xdc\x00\x00\x00\xdd\x00\x00\x00\xde\x00\x00\x00\x00\x00\x00\x00\xdf\x00\x00\x00\xe0\x00\x00\x00\xfe\x00\x00\x00\xe1\x00\x00\x00\xe2\x00\x00\x00\x00\x00\x00\x00\xe3\x00\x00\x00\xe4\x00\x00\x00\xe5\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\xeb\x00\x00\x00\xec\x00\x00\x00\xed\x00\x00\x00\xee\x00\x00\x00\xef\x00\x00\x00\xf0\x00\x00\x00\xf1\x00\x00\x00\xf2\x00\x00\x00\xf3\x00\x00\x00\xf4\x00\x00\x00\xf5\x00\x00\x00\xf6\x00\x00\x00\xf7\x00\x00\x00\xf8\x00\x00\x00\xf9\x00\x00\x00\xfa\x00\x00\x00\xfb\x00\x00\x00\xfc\x00\x00\x00\x00\x00\x00\x00\xc8\x01\x00\x00\x00\x00\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfd\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\xdf\x00\x00\x00\xe0\x00\x00\x00\x58\x00\x00\x00\xe1\x00\x00\x00\xe2\x00\x00\x00\xfe\x00\x00\x00\xe3\x00\x00\x00\xe4\x00\x00\x00\xe5\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\xeb\x00\x00\x00\xec\x00\x00\x00\xed\x00\x00\x00\xee\x00\x00\x00\xef\x00\x00\x00\xf0\x00\x00\x00\xf1\x00\x00\x00\xf2\x00\x00\x00\xf3\x00\x00\x00\xf4\x00\x00\x00\xf5\x00\x00\x00\xf6\x00\x00\x00\xf7\x00\x00\x00\xf8\x00\x00\x00\xf9\x00\x00\x00\xfa\x00\x00\x00\xfb\x00\x00\x00\xfc\x00\x00\x00\xdc\x02\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x58\x00\x00\x00\xa1\x00\x00\x00\x24\x01\x00\x00\x21\x01\x00\x00\xa3\x00\x00\x00\xa4\x00\x00\x00\xfe\x00\x00\x00\xa5\x00\x00\x00\xa6\x00\x00\x00\xa7\x00\x00\x00\xa8\x00\x00\x00\xa9\x00\x00\x00\xaa\x00\x00\x00\xab\x00\x00\x00\xac\x00\x00\x00\xad\x00\x00\x00\xae\x00\x00\x00\xaf\x00\x00\x00\xb0\x00\x00\x00\xb1\x00\x00\x00\xb2\x00\x00\x00\xb3\x00\x00\x00\xb4\x00\x00\x00\xb5\x00\x00\x00\xb6\x00\x00\x00\xb7\x00\x00\x00\xb8\x00\x00\x00\xb9\x00\x00\x00\xba\x00\x00\x00\xbb\x00\x00\x00\xbc\x00\x00\x00\xbd\x00\x00\x00\xbe\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xc0\x00\x00\x00\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\xd6\xfe\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa1\x00\x00\x00\x24\x01\x00\x00\x21\x01\x00\x00\xa3\x00\x00\x00\xa4\x00\x00\x00\xd6\xfe\xff\xff\xa5\x00\x00\x00\xa6\x00\x00\x00\xa7\x00\x00\x00\xa8\x00\x00\x00\xa9\x00\x00\x00\xaa\x00\x00\x00\xab\x00\x00\x00\xac\x00\x00\x00\xad\x00\x00\x00\xae\x00\x00\x00\xaf\x00\x00\x00\xb0\x00\x00\x00\xb1\x00\x00\x00\xb2\x00\x00\x00\xb3\x00\x00\x00\xb4\x00\x00\x00\xb5\x00\x00\x00\xb6\x00\x00\x00\xb7\x00\x00\x00\xb8\x00\x00\x00\xb9\x00\x00\x00\xba\x00\x00\x00\xbb\x00\x00\x00\xbc\x00\x00\x00\xbd\x00\x00\x00\xbe\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xc0\x00\x00\x00\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\xd5\xfe\xff\xff\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\xd5\xfe\xff\xff\x6d\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x28\x00\x00\x00\x20\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6d\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6e\x01\x00\x00\x1c\x02\x00\x00\x00\x00\x00\x00\x28\x00\x00\x00\x20\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6d\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6e\x01\x00\x00\x0c\x02\x00\x00\x00\x00\x00\x00\x28\x00\x00\x00\x20\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6d\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6e\x01\x00\x00\xf4\x01\x00\x00\x00\x00\x00\x00\x28\x00\x00\x00\x9c\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\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\xc3\x00\x00\x00\x00\x00\x00\x00\xc3\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6e\x01\x00\x00\x6e\x02\x00\x00\x00\x00\x00\x00\x9d\x00\x00\x00\x9e\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x26\x00\x00\x00\x84\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x7f\x02\x00\x00\x00\x00\x00\x00\x7c\x02\x00\x00\xc5\x00\x00\x00\x00\x00\x00\x00\xc5\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\xc6\x00\x00\x00\xc7\x00\x00\x00\xdf\x00\x00\x00\xe0\x00\x00\x00\x00\x00\x00\x00\xe1\x00\x00\x00\xe2\x00\x00\x00\x00\x00\x00\x00\xe3\x00\x00\x00\xe4\x00\x00\x00\xe5\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\xeb\x00\x00\x00\xec\x00\x00\x00\xed\x00\x00\x00\xee\x00\x00\x00\xef\x00\x00\x00\xf0\x00\x00\x00\xf1\x00\x00\x00\xf2\x00\x00\x00\xf3\x00\x00\x00\xf4\x00\x00\x00\xf5\x00\x00\x00\xf6\x00\x00\x00\xf7\x00\x00\x00\xf8\x00\x00\x00\xf9\x00\x00\x00\xfa\x00\x00\x00\xfb\x00\x00\x00\xfc\x00\x00\x00\xdf\x00\x00\x00\xe0\x00\x00\x00\x00\x00\x00\x00\xe1\x00\x00\x00\xe2\x00\x00\x00\x00\x00\x00\x00\xe3\x00\x00\x00\xe4\x00\x00\x00\xe5\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\xeb\x00\x00\x00\xec\x00\x00\x00\xed\x00\x00\x00\xee\x00\x00\x00\xef\x00\x00\x00\xf0\x00\x00\x00\xf1\x00\x00\x00\xf2\x00\x00\x00\xf3\x00\x00\x00\x00\x00\x00\x00\xf5\x00\x00\x00\xf6\x00\x00\x00\xf7\x00\x00\x00\xf8\x00\x00\x00\xf9\x00\x00\x00\xfa\x00\x00\x00\xfb\x00\x00\x00\xfc\x00\x00\x00\xdf\x00\x00\x00\xe0\x00\x00\x00\x00\x00\x00\x00\xe1\x00\x00\x00\xe2\x00\x00\x00\x00\x00\x00\x00\xe3\x00\x00\x00\xe4\x00\x00\x00\xe5\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\xeb\x00\x00\x00\xec\x00\x00\x00\xed\x00\x00\x00\xee\x00\x00\x00\xef\x00\x00\x00\xf0\x00\x00\x00\xf1\x00\x00\x00\xf2\x00\x00\x00\xf3\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf6\x00\x00\x00\xf7\x00\x00\x00\xf8\x00\x00\x00\x00\x00\x00\x00\xfa\x00\x00\x00\xfb\x00\x00\x00\xfc\x00\x00\x00\xdf\x00\x00\x00\xe0\x00\x00\x00\x00\x00\x00\x00\xe1\x00\x00\x00\xe2\x00\x00\x00\x00\x00\x00\x00\xe3\x00\x00\x00\xe4\x00\x00\x00\xe5\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\xeb\x00\x00\x00\xec\x00\x00\x00\xed\x00\x00\x00\xee\x00\x00\x00\xef\x00\x00\x00\xf0\x00\x00\x00\xf1\x00\x00\x00\xf2\x00\x00\x00\xf3\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\xf6\x00\x00\x00\xf7\x00\x00\x00\xf8\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfb\x00\x00\x00\xfc\x00\x00\x00\x00\x00\x00\x00\x94\x00\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\x00\x00\x00\x95\x00\x00\x00\x96\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x94\x00\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\x00\x00\x00\xf0\x01\x00\x00\x96\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x21\x00\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xd4\x00\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xc2\x00\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x75\x00\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x69\x00\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x17\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x11\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x0a\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xfe\x01\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xfa\x01\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xee\x01\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xec\x01\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xe9\x01\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x8c\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x81\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x7b\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xa1\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x9d\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x99\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x98\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x97\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xd2\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xd1\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xd0\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xc5\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xc4\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xc3\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xc1\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xc0\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xde\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xdd\x02\x00\x00\x22\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xc1\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xc0\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xb8\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xc1\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x69\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x67\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x68\x01\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x66\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x65\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x64\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x63\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x62\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x61\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x60\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x5f\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x5e\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x5d\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x5c\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x5b\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x5a\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x59\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x58\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x57\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x56\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x55\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x54\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x53\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x52\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x51\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x50\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x4f\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x4e\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x4d\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x4c\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x4b\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x4a\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x49\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x48\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x47\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x46\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x12\x02\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x63\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x62\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x61\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x60\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x5f\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x5e\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x5d\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x5c\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x5b\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x5a\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x59\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x58\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x57\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x56\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x55\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x54\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x53\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x52\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x51\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x50\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x4f\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x4e\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x4d\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x4c\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x4b\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x4a\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x49\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x48\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x47\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x46\x01\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x6f\x02\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x6c\x02\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x6a\x02\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x69\x02\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x68\x02\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x67\x02\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x63\x02\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xa3\x02\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xa2\x02\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x67\x02\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xcf\x02\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xce\x02\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\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\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\xcd\x02\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x28\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2b\x00\x00\x00\x2c\x00\x00\x00\x2d\x00\x00\x00\x2e\x00\x00\x00\x07\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x07\x00\x00\x00\x09\x00\x00\x00\x08\x01\x00\x00\x00\x00\x00\x00\x0a\x00\x00\x00\x09\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\x00\x00\x0b\x00\x00\x00\x07\x00\x00\x00\x00\x00\x00\x00\xd9\x01\x00\x00\x0b\x00\x00\x00\x40\x01\x00\x00\x09\x00\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\x0a\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x0b\x00\x00\x00\x00\x00\x00\x00\x0c\x00\x00\x00\x0d\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\x0c\x00\x00\x00\x0d\x00\x00\x00\x58\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xdf\x00\x00\x00\xe0\x00\x00\x00\x0c\x00\x00\x00\x0d\x00\x00\x00\xe2\x00\x00\x00\x00\x00\x00\x00\xe3\x00\x00\x00\xe4\x00\x00\x00\xe5\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf1\x00\x00\x00\xf2\x00\x00\x00\xf3\x00\x00\x00\xdf\x00\x00\x00\xe0\x00\x00\x00\xf6\x00\x00\x00\xf7\x00\x00\x00\xf8\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe4\x00\x00\x00\xe5\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xdf\x00\x00\x00\xe0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf1\x00\x00\x00\xf2\x00\x00\x00\xf3\x00\x00\x00\xe4\x00\x00\x00\xe5\x00\x00\x00\xe6\x00\x00\x00\xe7\x00\x00\x00\xe8\x00\x00\x00\xe9\x00\x00\x00\xea\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x3f\x01\x00\x00\x00\x00\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\xf1\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x58\x00\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe2\x01\x00\x00\x58\x00\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xdf\x01\x00\x00\x58\x00\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xdb\x01\x00\x00\x58\x00\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x7e\x02\x00\x00\x58\x00\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xba\x02\x00\x00\x58\x00\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb4\x02\x00\x00\x58\x00\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd3\x02\x00\x00\x58\x00\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe1\x02\x00\x00\x58\x00\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe0\x02\x00\x00\x58\x00\x00\x00\x51\x00\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x53\x00\x00\x00\x54\x00\x00\x00\x55\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x58\x00\x00\x00\x85\x01\x00\x00\x86\x01\x00\x00\x38\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x3d\x00\x00\x00\x3e\x00\x00\x00\x3f\x00\x00\x00\x87\x01\x00\x00\x41\x00\x00\x00\x42\x00\x00\x00\x43\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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#
   -> L Token
   -> Int#
   -> Happy_IntList
   -> HappyStk
        (HappyAbsSyn
           (Maybe UncheckedModTypeExp)
           (Maybe UncheckedModTypeExp)
           (Maybe UncheckedTypeExp)
           (Maybe UncheckedTypeExp))
   -> ParserMonad
        (HappyAbsSyn
           (Maybe UncheckedModTypeExp)
           (Maybe UncheckedModTypeExp)
           (Maybe UncheckedTypeExp)
           (Maybe UncheckedTypeExp)))
happyReduceArr = (Int, Int)
-> [(Int,
     Int#
     -> L Token
     -> Int#
     -> Happy_IntList
     -> HappyStk
          (HappyAbsSyn
             (Maybe UncheckedModTypeExp)
             (Maybe UncheckedModTypeExp)
             (Maybe UncheckedTypeExp)
             (Maybe UncheckedTypeExp))
     -> ParserMonad
          (HappyAbsSyn
             (Maybe UncheckedModTypeExp)
             (Maybe UncheckedModTypeExp)
             (Maybe UncheckedTypeExp)
             (Maybe UncheckedTypeExp)))]
-> Array
     Int
     (Int#
      -> L Token
      -> Int#
      -> Happy_IntList
      -> HappyStk
           (HappyAbsSyn
              (Maybe UncheckedModTypeExp)
              (Maybe UncheckedModTypeExp)
              (Maybe UncheckedTypeExp)
              (Maybe UncheckedTypeExp))
      -> ParserMonad
           (HappyAbsSyn
              (Maybe UncheckedModTypeExp)
              (Maybe UncheckedModTypeExp)
              (Maybe UncheckedTypeExp)
              (Maybe UncheckedTypeExp)))
forall i e. Ix i => (i, i) -> [(i, e)] -> Array i e
Happy_Data_Array.array (Int
5, Int
371) [
        (Int
5 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_5),
        (Int
6 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_6),
        (Int
7 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_7),
        (Int
8 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_8),
        (Int
9 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_9),
        (Int
10 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_10),
        (Int
11 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_11),
        (Int
12 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_12),
        (Int
13 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_13),
        (Int
14 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_14),
        (Int
15 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_15),
        (Int
16 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_16),
        (Int
17 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_17),
        (Int
18 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_18),
        (Int
19 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_19),
        (Int
20 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_20),
        (Int
21 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_21),
        (Int
22 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_22),
        (Int
23 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_23),
        (Int
24 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_24),
        (Int
25 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_25),
        (Int
26 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_26),
        (Int
27 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_27),
        (Int
28 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_28),
        (Int
29 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_29),
        (Int
30 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_30),
        (Int
31 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_31),
        (Int
32 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_32),
        (Int
33 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_33),
        (Int
34 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_34),
        (Int
35 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_35),
        (Int
36 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_36),
        (Int
37 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_37),
        (Int
38 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_38),
        (Int
39 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_39),
        (Int
40 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_40),
        (Int
41 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_41),
        (Int
42 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_42),
        (Int
43 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_43),
        (Int
44 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_44),
        (Int
45 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_45),
        (Int
46 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_46),
        (Int
47 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_47),
        (Int
48 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_48),
        (Int
49 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_49),
        (Int
50 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_50),
        (Int
51 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_51),
        (Int
52 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_52),
        (Int
53 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_53),
        (Int
54 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_54),
        (Int
55 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_55),
        (Int
56 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_56),
        (Int
57 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_57),
        (Int
58 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_58),
        (Int
59 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_59),
        (Int
60 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_60),
        (Int
61 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_61),
        (Int
62 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_62),
        (Int
63 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_63),
        (Int
64 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_64),
        (Int
65 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_65),
        (Int
66 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_66),
        (Int
67 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_67),
        (Int
68 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_68),
        (Int
69 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_69),
        (Int
70 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_70),
        (Int
71 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_71),
        (Int
72 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_72),
        (Int
73 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_73),
        (Int
74 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_74),
        (Int
75 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_75),
        (Int
76 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_76),
        (Int
77 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_77),
        (Int
78 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_78),
        (Int
79 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_79),
        (Int
80 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_80),
        (Int
81 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_81),
        (Int
82 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_82),
        (Int
83 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_83),
        (Int
84 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_84),
        (Int
85 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_85),
        (Int
86 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_86),
        (Int
87 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_87),
        (Int
88 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_88),
        (Int
89 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_89),
        (Int
90 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_90),
        (Int
91 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_91),
        (Int
92 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_92),
        (Int
93 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_93),
        (Int
94 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_94),
        (Int
95 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_95),
        (Int
96 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_96),
        (Int
97 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_97),
        (Int
98 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_98),
        (Int
99 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_99),
        (Int
100 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_100),
        (Int
101 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_101),
        (Int
102 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_102),
        (Int
103 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_103),
        (Int
104 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_104),
        (Int
105 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_105),
        (Int
106 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_106),
        (Int
107 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_107),
        (Int
108 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_108),
        (Int
109 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_109),
        (Int
110 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_110),
        (Int
111 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_111),
        (Int
112 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_112),
        (Int
113 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_113),
        (Int
114 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_114),
        (Int
115 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_115),
        (Int
116 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_116),
        (Int
117 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_117),
        (Int
118 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_118),
        (Int
119 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_119),
        (Int
120 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_120),
        (Int
121 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_121),
        (Int
122 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_122),
        (Int
123 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_123),
        (Int
124 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_124),
        (Int
125 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_125),
        (Int
126 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_126),
        (Int
127 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_127),
        (Int
128 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_128),
        (Int
129 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_129),
        (Int
130 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_130),
        (Int
131 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_131),
        (Int
132 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_132),
        (Int
133 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_133),
        (Int
134 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_134),
        (Int
135 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_135),
        (Int
136 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_136),
        (Int
137 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_137),
        (Int
138 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_138),
        (Int
139 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_139),
        (Int
140 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_140),
        (Int
141 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_141),
        (Int
142 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_142),
        (Int
143 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_143),
        (Int
144 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_144),
        (Int
145 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_145),
        (Int
146 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_146),
        (Int
147 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_147),
        (Int
148 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_148),
        (Int
149 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_149),
        (Int
150 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_150),
        (Int
151 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_151),
        (Int
152 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_152),
        (Int
153 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_153),
        (Int
154 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_154),
        (Int
155 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_155),
        (Int
156 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_156),
        (Int
157 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_157),
        (Int
158 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_158),
        (Int
159 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_159),
        (Int
160 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_160),
        (Int
161 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_161),
        (Int
162 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_162),
        (Int
163 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_163),
        (Int
164 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_164),
        (Int
165 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_165),
        (Int
166 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_166),
        (Int
167 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_167),
        (Int
168 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_168),
        (Int
169 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_169),
        (Int
170 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_170),
        (Int
171 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_171),
        (Int
172 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_172),
        (Int
173 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_173),
        (Int
174 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_174),
        (Int
175 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_175),
        (Int
176 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_176),
        (Int
177 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_177),
        (Int
178 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_178),
        (Int
179 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_179),
        (Int
180 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_180),
        (Int
181 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_181),
        (Int
182 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_182),
        (Int
183 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_183),
        (Int
184 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_184),
        (Int
185 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_185),
        (Int
186 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_186),
        (Int
187 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_187),
        (Int
188 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_188),
        (Int
189 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_189),
        (Int
190 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_190),
        (Int
191 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_191),
        (Int
192 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_192),
        (Int
193 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_193),
        (Int
194 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_194),
        (Int
195 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_195),
        (Int
196 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_196),
        (Int
197 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_197),
        (Int
198 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_198),
        (Int
199 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_199),
        (Int
200 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_200),
        (Int
201 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_201),
        (Int
202 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_202),
        (Int
203 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_203),
        (Int
204 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_204),
        (Int
205 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_205),
        (Int
206 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_206),
        (Int
207 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_207),
        (Int
208 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_208),
        (Int
209 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_209),
        (Int
210 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_210),
        (Int
211 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_211),
        (Int
212 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_212),
        (Int
213 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_213),
        (Int
214 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_214),
        (Int
215 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_215),
        (Int
216 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_216),
        (Int
217 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_217),
        (Int
218 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_218),
        (Int
219 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_219),
        (Int
220 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_220),
        (Int
221 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_221),
        (Int
222 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_222),
        (Int
223 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_223),
        (Int
224 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_224),
        (Int
225 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_225),
        (Int
226 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_226),
        (Int
227 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_227),
        (Int
228 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_228),
        (Int
229 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_229),
        (Int
230 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_230),
        (Int
231 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_231),
        (Int
232 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_232),
        (Int
233 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_233),
        (Int
234 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_234),
        (Int
235 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_235),
        (Int
236 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_236),
        (Int
237 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_237),
        (Int
238 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_238),
        (Int
239 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_239),
        (Int
240 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_240),
        (Int
241 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_241),
        (Int
242 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_242),
        (Int
243 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_243),
        (Int
244 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_244),
        (Int
245 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_245),
        (Int
246 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_246),
        (Int
247 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_247),
        (Int
248 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_248),
        (Int
249 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_249),
        (Int
250 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_250),
        (Int
251 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_251),
        (Int
252 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_252),
        (Int
253 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_253),
        (Int
254 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_254),
        (Int
255 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_255),
        (Int
256 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_256),
        (Int
257 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_257),
        (Int
258 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_258),
        (Int
259 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_259),
        (Int
260 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_260),
        (Int
261 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_261),
        (Int
262 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_262),
        (Int
263 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_263),
        (Int
264 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_264),
        (Int
265 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_265),
        (Int
266 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_266),
        (Int
267 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_267),
        (Int
268 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_268),
        (Int
269 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_269),
        (Int
270 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_270),
        (Int
271 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_271),
        (Int
272 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_272),
        (Int
273 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_273),
        (Int
274 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_274),
        (Int
275 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_275),
        (Int
276 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_276),
        (Int
277 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_277),
        (Int
278 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_278),
        (Int
279 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_279),
        (Int
280 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_280),
        (Int
281 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_281),
        (Int
282 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_282),
        (Int
283 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_283),
        (Int
284 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_284),
        (Int
285 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_285),
        (Int
286 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_286),
        (Int
287 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_287),
        (Int
288 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_288),
        (Int
289 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_289),
        (Int
290 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_290),
        (Int
291 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_291),
        (Int
292 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_292),
        (Int
293 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_293),
        (Int
294 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_294),
        (Int
295 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_295),
        (Int
296 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_296),
        (Int
297 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_297),
        (Int
298 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_298),
        (Int
299 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_299),
        (Int
300 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_300),
        (Int
301 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_301),
        (Int
302 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_302),
        (Int
303 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_303),
        (Int
304 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_304),
        (Int
305 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_305),
        (Int
306 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_306),
        (Int
307 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_307),
        (Int
308 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_308),
        (Int
309 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_309),
        (Int
310 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_310),
        (Int
311 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_311),
        (Int
312 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_312),
        (Int
313 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_313),
        (Int
314 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_314),
        (Int
315 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_315),
        (Int
316 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_316),
        (Int
317 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_317),
        (Int
318 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_318),
        (Int
319 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_319),
        (Int
320 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_320),
        (Int
321 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_321),
        (Int
322 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_322),
        (Int
323 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_323),
        (Int
324 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_324),
        (Int
325 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_325),
        (Int
326 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_326),
        (Int
327 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_327),
        (Int
328 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_328),
        (Int
329 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_329),
        (Int
330 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_330),
        (Int
331 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_331),
        (Int
332 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_332),
        (Int
333 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_333),
        (Int
334 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_334),
        (Int
335 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_335),
        (Int
336 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_336),
        (Int
337 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_337),
        (Int
338 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_338),
        (Int
339 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_339),
        (Int
340 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_340),
        (Int
341 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_341),
        (Int
342 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_342),
        (Int
343 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_343),
        (Int
344 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_344),
        (Int
345 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_345),
        (Int
346 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_346),
        (Int
347 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_347),
        (Int
348 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_348),
        (Int
349 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_349),
        (Int
350 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_350),
        (Int
351 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_351),
        (Int
352 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_352),
        (Int
353 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_353),
        (Int
354 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_354),
        (Int
355 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_355),
        (Int
356 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_356),
        (Int
357 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_357),
        (Int
358 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_358),
        (Int
359 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_359),
        (Int
360 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_360),
        (Int
361 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_361),
        (Int
362 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_362),
        (Int
363 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_363),
        (Int
364 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_364),
        (Int
365 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_365),
        (Int
366 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_366),
        (Int
367 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_367),
        (Int
368 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_368),
        (Int
369 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_369),
        (Int
370 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_370),
        (Int
371 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_371)
        ]

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

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

happy_n_terms :: Int
happy_n_terms = Int
104 :: Happy_Prelude.Int
happy_n_nonterms :: Int
happy_n_nonterms = Int
94 :: Happy_Prelude.Int

happy_n_starts :: Int
happy_n_starts = Int
5 :: Happy_Prelude.Int

#if __GLASGOW_HASKELL__ >= 710
happyReduce_5 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_5 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_5 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
0# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_5
happyReduction_5 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_5 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        DocComment -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
DocComment -> HappyAbsSyn t99 t100 t101 t102
happyIn9
                 (let L Loc
loc (DOC Text
s) = L Token
happy_var_1 in Text -> SrcLoc -> DocComment
DocComment Text
s (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_6 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_6 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_6 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
1# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_6
happyReduction_6 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_6 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap9
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap9
happyOut9 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap9 DocComment
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap9
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap9
happyOut9 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap9 DocComment
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap14
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap14
happyOut14 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap14 UncheckedDec
happy_var_3) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap12
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap12
happyOut12 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap12 [UncheckedDec]
happy_var_4) -> 
        UncheckedProg -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedProg -> HappyAbsSyn t99 t100 t101 t102
happyIn10
                 (Maybe DocComment -> [UncheckedDec] -> UncheckedProg
forall (f :: * -> *) vn.
Maybe DocComment -> [DecBase f vn] -> ProgBase f vn
Prog (DocComment -> Maybe DocComment
forall a. a -> Maybe a
Just DocComment
happy_var_1) (DocComment -> UncheckedDec -> UncheckedDec
addDoc DocComment
happy_var_2 UncheckedDec
happy_var_3 UncheckedDec -> [UncheckedDec] -> [UncheckedDec]
forall a. a -> [a] -> [a]
: [UncheckedDec]
happy_var_4)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_7 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_7 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_7 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
1# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_7
happyReduction_7 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_7 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap9
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap9
happyOut9 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap9 DocComment
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap14
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap14
happyOut14 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap14 UncheckedDec
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap12
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap12
happyOut12 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap12 [UncheckedDec]
happy_var_3) -> 
        UncheckedProg -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedProg -> HappyAbsSyn t99 t100 t101 t102
happyIn10
                 (Maybe DocComment -> [UncheckedDec] -> UncheckedProg
forall (f :: * -> *) vn.
Maybe DocComment -> [DecBase f vn] -> ProgBase f vn
Prog (DocComment -> Maybe DocComment
forall a. a -> Maybe a
Just DocComment
happy_var_1) (UncheckedDec
happy_var_2 UncheckedDec -> [UncheckedDec] -> [UncheckedDec]
forall a. a -> [a] -> [a]
: [UncheckedDec]
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_8 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_8 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_8 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
1# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_8
happyReduction_8 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_8 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap14
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap14
happyOut14 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap14 UncheckedDec
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap12
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap12
happyOut12 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap12 [UncheckedDec]
happy_var_2) -> 
        UncheckedProg -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedProg -> HappyAbsSyn t99 t100 t101 t102
happyIn10
                 (Maybe DocComment -> [UncheckedDec] -> UncheckedProg
forall (f :: * -> *) vn.
Maybe DocComment -> [DecBase f vn] -> ProgBase f vn
Prog Maybe DocComment
forall a. Maybe a
Nothing (UncheckedDec
happy_var_1 UncheckedDec -> [UncheckedDec] -> [UncheckedDec]
forall a. a -> [a] -> [a]
: [UncheckedDec]
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_9 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_9 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_9 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
1# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
happyReduction_9
happyReduction_9 :: HappyAbsSyn t99 t100 t101 t102
happyReduction_9  =  UncheckedProg -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedProg -> HappyAbsSyn t99 t100 t101 t102
happyIn10
                 (Maybe DocComment -> [UncheckedDec] -> UncheckedProg
forall (f :: * -> *) vn.
Maybe DocComment -> [DecBase f vn] -> ProgBase f vn
Prog Maybe DocComment
forall a. Maybe a
Nothing []
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_10 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_10 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_10 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
2# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_10
happyReduction_10 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_10 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap14
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap14
happyOut14 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap14 UncheckedDec
happy_var_1) -> 
        UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
happyIn11
                 (UncheckedDec
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_11 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_11 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_11 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
2# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_11
happyReduction_11 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_11 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap9
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap9
happyOut9 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap9 DocComment
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap14
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap14
happyOut14 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap14 UncheckedDec
happy_var_2) -> 
        UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
happyIn11
                 (DocComment -> UncheckedDec -> UncheckedDec
addDoc DocComment
happy_var_1 UncheckedDec
happy_var_2
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_12 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_12 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_12 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
3# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_12
happyReduction_12 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_12 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap13
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap13
happyOut13 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap13 [UncheckedDec]
happy_var_1) -> 
        [UncheckedDec] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedDec] -> HappyAbsSyn t99 t100 t101 t102
happyIn12
                 ([UncheckedDec] -> [UncheckedDec]
forall a. [a] -> [a]
reverse [UncheckedDec]
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_13 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_13 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_13 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
4# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
happyReduction_13
happyReduction_13 :: HappyAbsSyn t99 t100 t101 t102
happyReduction_13  =  [UncheckedDec] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedDec] -> HappyAbsSyn t99 t100 t101 t102
happyIn13
                 ([]
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_14 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_14 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_14 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
4# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_14
happyReduction_14 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_14 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap13
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap13
happyOut13 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap13 [UncheckedDec]
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap11
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap11
happyOut11 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap11 UncheckedDec
happy_var_2) -> 
        [UncheckedDec] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedDec] -> HappyAbsSyn t99 t100 t101 t102
happyIn13
                 (UncheckedDec
happy_var_2 UncheckedDec -> [UncheckedDec] -> [UncheckedDec]
forall a. a -> [a] -> [a]
: [UncheckedDec]
happy_var_1
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_15 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_15 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_15 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
5# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_15
happyReduction_15 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_15 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap38
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap38
happyOut38 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap38 ValBindBase NoInfo Name
happy_var_1) -> 
        UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
happyIn14
                 (ValBindBase NoInfo Name -> UncheckedDec
forall (f :: * -> *) vn. ValBindBase f vn -> DecBase f vn
ValDec ValBindBase NoInfo Name
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_16 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_16 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_16 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
5# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_16
happyReduction_16 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_16 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap39
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap39
happyOut39 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap39 TypeBindBase NoInfo Name
happy_var_1) -> 
        UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
happyIn14
                 (TypeBindBase NoInfo Name -> UncheckedDec
forall (f :: * -> *) vn. TypeBindBase f vn -> DecBase f vn
TypeDec TypeBindBase NoInfo Name
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_17 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_17 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_17 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
5# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_17
happyReduction_17 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_17 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap17
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap17
happyOut17 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap17 ModTypeBindBase NoInfo Name
happy_var_1) -> 
        UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
happyIn14
                 (ModTypeBindBase NoInfo Name -> UncheckedDec
forall (f :: * -> *) vn. ModTypeBindBase f vn -> DecBase f vn
ModTypeDec ModTypeBindBase NoInfo Name
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_18 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_18 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_18 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
5# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_18
happyReduction_18 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_18 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap22
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap22
happyOut22 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap22 ModBindBase NoInfo Name
happy_var_1) -> 
        UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
happyIn14
                 (ModBindBase NoInfo Name -> UncheckedDec
forall (f :: * -> *) vn. ModBindBase f vn -> DecBase f vn
ModDec ModBindBase NoInfo Name
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_19 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_19 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_19 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
5# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_19
happyReduction_19 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_19 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
OPEN) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap18
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap18
happyOut18 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap18 UncheckedModExp
happy_var_2) -> 
        UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
happyIn14
                 (UncheckedModExp -> SrcLoc -> UncheckedDec
forall (f :: * -> *) vn. ModExpBase f vn -> SrcLoc -> DecBase f vn
OpenDec UncheckedModExp
happy_var_2 (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
happy_var_1)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_20 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_20 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_20 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
5# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_20
happyReduction_20 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_20 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
IMPORT) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
happyIn14
                 (let L Loc
_ (STRINGLIT Text
s) = L Token
happy_var_2 in String -> NoInfo ImportName -> SrcLoc -> UncheckedDec
forall (f :: * -> *) vn.
String -> f ImportName -> SrcLoc -> DecBase f vn
ImportDec (Text -> String
T.unpack Text
s) NoInfo ImportName
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> L Token -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 L Token
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_21 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_21 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_21 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
5# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_21
happyReduction_21 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_21 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LOCAL) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap11
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap11
happyOut11 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap11 UncheckedDec
happy_var_2) -> 
        UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
happyIn14
                 (UncheckedDec -> SrcLoc -> UncheckedDec
forall (f :: * -> *) vn. DecBase f vn -> SrcLoc -> DecBase f vn
LocalDec UncheckedDec
happy_var_2 (Loc -> UncheckedDec -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedDec
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_22 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_22 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_22 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
5# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_22
happyReduction_22 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_22 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap97
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap97
happyOut97 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap97 AttrInfo Name
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap14
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap14
happyOut14 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap14 UncheckedDec
happy_var_4) -> 
        UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDec -> HappyAbsSyn t99 t100 t101 t102
happyIn14
                 (AttrInfo Name -> UncheckedDec -> UncheckedDec
addAttr AttrInfo Name
happy_var_2 UncheckedDec
happy_var_4
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_23 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_23 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_23 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
6# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_23
happyReduction_23 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_23 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
happyOut57 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap57 (QualName Name, Loc)
happy_var_1) -> 
        UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn15
                 (let (QualName Name
v, Loc
loc) = (QualName Name, Loc)
happy_var_1 in QualName Name
-> NoInfo (Map VName VName) -> SrcLoc -> UncheckedModTypeExp
forall (f :: * -> *) vn.
QualName vn -> f (Map VName VName) -> SrcLoc -> ModTypeExpBase f vn
ModTypeVar QualName Name
v NoInfo (Map VName VName)
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_24 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_24 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_24 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
6# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_24
happyReduction_24 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_24 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LCURLY) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap27
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap27
happyOut27 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap27 [SpecBase NoInfo Name]
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RCURLY) -> 
        UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn15
                 ([SpecBase NoInfo Name] -> SrcLoc -> UncheckedModTypeExp
forall (f :: * -> *) vn.
[SpecBase f vn] -> SrcLoc -> ModTypeExpBase f vn
ModTypeSpecs [SpecBase NoInfo Name]
happy_var_2 (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_25 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_25 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_25 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
6# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_25
happyReduction_25 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_25 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
happyOut15 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap15 UncheckedModTypeExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap16
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap16
happyOut16 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap16 TypeRefBase NoInfo Name
happy_var_3) -> 
        UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn15
                 (UncheckedModTypeExp
-> TypeRefBase NoInfo Name -> SrcLoc -> UncheckedModTypeExp
forall (f :: * -> *) vn.
ModTypeExpBase f vn
-> TypeRefBase f vn -> SrcLoc -> ModTypeExpBase f vn
ModTypeWith UncheckedModTypeExp
happy_var_1 TypeRefBase NoInfo Name
happy_var_3 (UncheckedModTypeExp -> TypeRefBase NoInfo Name -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedModTypeExp
happy_var_1 TypeRefBase NoInfo Name
happy_var_3)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_26 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_26 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_26 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
6# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_26
happyReduction_26 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_26 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
happyOut15 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap15 UncheckedModTypeExp
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
        UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn15
                 (UncheckedModTypeExp -> SrcLoc -> UncheckedModTypeExp
forall (f :: * -> *) vn.
ModTypeExpBase f vn -> SrcLoc -> ModTypeExpBase f vn
ModTypeParens UncheckedModTypeExp
happy_var_2 (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_27 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_27 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_27 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
6# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_27
happyReduction_27 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_27 (HappyAbsSyn t99 t100 t101 t102
happy_x_7 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
happyOut15 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap15 UncheckedModTypeExp
happy_var_4) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
happyOut15 HappyAbsSyn t99 t100 t101 t102
happy_x_7 of { (HappyWrap15 UncheckedModTypeExp
happy_var_7) -> 
        UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn15
                 (let L Loc
_ (ID Name
name) = L Token
happy_var_2
                                    in Maybe Name
-> UncheckedModTypeExp
-> UncheckedModTypeExp
-> SrcLoc
-> UncheckedModTypeExp
forall (f :: * -> *) vn.
Maybe vn
-> ModTypeExpBase f vn
-> ModTypeExpBase f vn
-> SrcLoc
-> ModTypeExpBase f vn
ModTypeArrow (Name -> Maybe Name
forall a. a -> Maybe a
Just Name
name) UncheckedModTypeExp
happy_var_4 UncheckedModTypeExp
happy_var_7 (Loc -> UncheckedModTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedModTypeExp
happy_var_7)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_28 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_28 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_28 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
6# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_28
happyReduction_28 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_28 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
happyOut15 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap15 UncheckedModTypeExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
happyOut15 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap15 UncheckedModTypeExp
happy_var_3) -> 
        UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn15
                 (Maybe Name
-> UncheckedModTypeExp
-> UncheckedModTypeExp
-> SrcLoc
-> UncheckedModTypeExp
forall (f :: * -> *) vn.
Maybe vn
-> ModTypeExpBase f vn
-> ModTypeExpBase f vn
-> SrcLoc
-> ModTypeExpBase f vn
ModTypeArrow Maybe Name
forall a. Maybe a
Nothing UncheckedModTypeExp
happy_var_1 UncheckedModTypeExp
happy_var_3 (UncheckedModTypeExp -> UncheckedModTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedModTypeExp
happy_var_1 UncheckedModTypeExp
happy_var_3)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_29 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_29 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_29 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
7# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_29
happyReduction_29 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_29 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
happyOut57 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap57 (QualName Name, Loc)
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
happyOut33 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap33 [TypeParamBase Name]
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap42
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap42
happyOut42 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap42 UncheckedTypeExp
happy_var_4) -> 
        TypeRefBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
TypeRefBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn16
                 (QualName Name
-> [TypeParamBase Name]
-> UncheckedTypeExp
-> SrcLoc
-> TypeRefBase NoInfo Name
forall (f :: * -> *) vn.
QualName vn
-> [TypeParamBase vn]
-> TypeExp (ExpBase f vn) vn
-> SrcLoc
-> TypeRefBase f vn
TypeRef ((QualName Name, Loc) -> QualName Name
forall a b. (a, b) -> a
fst (QualName Name, Loc)
happy_var_1) [TypeParamBase Name]
happy_var_2 UncheckedTypeExp
happy_var_4 (Loc -> UncheckedTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan ((QualName Name, Loc) -> Loc
forall a b. (a, b) -> b
snd (QualName Name, Loc)
happy_var_1) UncheckedTypeExp
happy_var_4)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_30 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_30 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_30 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
8# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_30
happyReduction_30 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_30 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
MODULE) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { L Token
happy_var_3 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
happyOut15 HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (HappyWrap15 UncheckedModTypeExp
happy_var_5) -> 
        ModTypeBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
ModTypeBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn17
                 (let L Loc
_ (ID Name
name) = L Token
happy_var_3
            in Name
-> UncheckedModTypeExp
-> Maybe DocComment
-> SrcLoc
-> ModTypeBindBase NoInfo Name
forall (f :: * -> *) vn.
vn
-> ModTypeExpBase f vn
-> Maybe DocComment
-> SrcLoc
-> ModTypeBindBase f vn
ModTypeBind Name
name UncheckedModTypeExp
happy_var_5 Maybe DocComment
forall a. Maybe a
Nothing (Loc -> UncheckedModTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedModTypeExp
happy_var_5)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_31 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_31 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_31 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
9# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_31
happyReduction_31 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_31 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap18
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap18
happyOut18 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap18 UncheckedModExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
happyOut15 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap15 UncheckedModTypeExp
happy_var_3) -> 
        UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
happyIn18
                 (UncheckedModExp
-> UncheckedModTypeExp
-> NoInfo (Map VName VName)
-> SrcLoc
-> UncheckedModExp
forall (f :: * -> *) vn.
ModExpBase f vn
-> ModTypeExpBase f vn
-> f (Map VName VName)
-> SrcLoc
-> ModExpBase f vn
ModAscript UncheckedModExp
happy_var_1 UncheckedModTypeExp
happy_var_3 NoInfo (Map VName VName)
forall {k} (a :: k). NoInfo a
NoInfo (UncheckedModExp -> UncheckedModTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedModExp
happy_var_1 UncheckedModTypeExp
happy_var_3)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_32 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_32 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_32 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
9# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {t99 :: k} {t101 :: k} {t102 :: k}.
HappyStk (HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102)
-> HappyStk (HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102)
happyReduction_32
happyReduction_32 :: HappyStk (HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102)
-> HappyStk (HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102)
happyReduction_32 (HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102)
happyRest)
         = case HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
BACKSLASH) -> 
        case HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
-> HappyWrap23
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap23
happyOut23 HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
happy_x_2 of { (HappyWrap23 ModParamBase NoInfo Name
happy_var_2) -> 
        case HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
-> Maybe UncheckedModTypeExp
forall {k} {k} {k} (t99 :: k) t100 (t101 :: k) (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> t100
happyOut100 HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
happy_x_3 of { Maybe UncheckedModTypeExp
happy_var_3 -> 
        case HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
-> HappyWrap18
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap18
happyOut18 HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
happy_x_5 of { (HappyWrap18 UncheckedModExp
happy_var_5) -> 
        UncheckedModExp
-> HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
happyIn18
                 (ModParamBase NoInfo Name
-> Maybe (UncheckedModTypeExp, NoInfo (Map VName VName))
-> UncheckedModExp
-> SrcLoc
-> UncheckedModExp
forall (f :: * -> *) vn.
ModParamBase f vn
-> Maybe (ModTypeExpBase f vn, f (Map VName VName))
-> ModExpBase f vn
-> SrcLoc
-> ModExpBase f vn
ModLambda ModParamBase NoInfo Name
happy_var_2 ((UncheckedModTypeExp
 -> (UncheckedModTypeExp, NoInfo (Map VName VName)))
-> Maybe UncheckedModTypeExp
-> Maybe (UncheckedModTypeExp, NoInfo (Map VName VName))
forall a b. (a -> b) -> Maybe a -> Maybe b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (,NoInfo (Map VName VName)
forall {k} (a :: k). NoInfo a
NoInfo) Maybe UncheckedModTypeExp
happy_var_3) UncheckedModExp
happy_var_5 (Loc -> UncheckedModExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedModExp
happy_var_5)
        ) HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
-> HappyStk (HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102)
-> HappyStk (HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_33 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_33 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_33 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
9# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_33
happyReduction_33 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_33 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
IMPORT) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
happyIn18
                 (let L Loc
_ (STRINGLIT Text
s) = L Token
happy_var_2 in String -> NoInfo ImportName -> SrcLoc -> UncheckedModExp
forall (f :: * -> *) vn.
String -> f ImportName -> SrcLoc -> ModExpBase f vn
ModImport (Text -> String
T.unpack Text
s) NoInfo ImportName
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> L Token -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 L Token
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_34 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_34 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_34 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
9# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_34
happyReduction_34 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_34 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap19
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap19
happyOut19 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap19 UncheckedModExp
happy_var_1) -> 
        UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
happyIn18
                 (UncheckedModExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_35 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_35 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_35 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
9# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_35
happyReduction_35 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_35 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap20
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap20
happyOut20 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap20 UncheckedModExp
happy_var_1) -> 
        UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
happyIn18
                 (UncheckedModExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_36 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_36 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_36 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
10# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_36
happyReduction_36 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_36 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap20
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap20
happyOut20 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap20 UncheckedModExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap20
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap20
happyOut20 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap20 UncheckedModExp
happy_var_2) -> 
        UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
happyIn19
                 (UncheckedModExp
-> UncheckedModExp
-> NoInfo (Map VName VName)
-> NoInfo (Map VName VName)
-> SrcLoc
-> UncheckedModExp
forall (f :: * -> *) vn.
ModExpBase f vn
-> ModExpBase f vn
-> f (Map VName VName)
-> f (Map VName VName)
-> SrcLoc
-> ModExpBase f vn
ModApply UncheckedModExp
happy_var_1 UncheckedModExp
happy_var_2 NoInfo (Map VName VName)
forall {k} (a :: k). NoInfo a
NoInfo NoInfo (Map VName VName)
forall {k} (a :: k). NoInfo a
NoInfo (UncheckedModExp -> UncheckedModExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedModExp
happy_var_1 UncheckedModExp
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_37 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_37 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_37 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
10# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_37
happyReduction_37 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_37 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap19
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap19
happyOut19 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap19 UncheckedModExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap20
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap20
happyOut20 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap20 UncheckedModExp
happy_var_2) -> 
        UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
happyIn19
                 (UncheckedModExp
-> UncheckedModExp
-> NoInfo (Map VName VName)
-> NoInfo (Map VName VName)
-> SrcLoc
-> UncheckedModExp
forall (f :: * -> *) vn.
ModExpBase f vn
-> ModExpBase f vn
-> f (Map VName VName)
-> f (Map VName VName)
-> SrcLoc
-> ModExpBase f vn
ModApply UncheckedModExp
happy_var_1 UncheckedModExp
happy_var_2 NoInfo (Map VName VName)
forall {k} (a :: k). NoInfo a
NoInfo NoInfo (Map VName VName)
forall {k} (a :: k). NoInfo a
NoInfo (UncheckedModExp -> UncheckedModExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedModExp
happy_var_1 UncheckedModExp
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_38 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_38 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_38 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
11# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_38
happyReduction_38 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_38 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap18
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap18
happyOut18 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap18 UncheckedModExp
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
        UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
happyIn20
                 (UncheckedModExp -> SrcLoc -> UncheckedModExp
forall (f :: * -> *) vn.
ModExpBase f vn -> SrcLoc -> ModExpBase f vn
ModParens UncheckedModExp
happy_var_2 (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_39 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_39 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_39 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
11# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_39
happyReduction_39 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_39 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
happyOut57 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap57 (QualName Name, Loc)
happy_var_1) -> 
        UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
happyIn20
                 (let (QualName Name
v, Loc
loc) = (QualName Name, Loc)
happy_var_1 in QualName Name -> SrcLoc -> UncheckedModExp
forall (f :: * -> *) vn. QualName vn -> SrcLoc -> ModExpBase f vn
ModVar QualName Name
v (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_40 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_40 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_40 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
11# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_40
happyReduction_40 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_40 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LCURLY) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap12
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap12
happyOut12 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap12 [UncheckedDec]
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RCURLY) -> 
        UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModExp -> HappyAbsSyn t99 t100 t101 t102
happyIn20
                 ([UncheckedDec] -> SrcLoc -> UncheckedModExp
forall (f :: * -> *) vn.
[DecBase f vn] -> SrcLoc -> ModExpBase f vn
ModDecs [UncheckedDec]
happy_var_2 (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_41 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_41 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_41 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
12# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_41
happyReduction_41 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_41 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
happyOut57 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap57 (QualName Name, Loc)
happy_var_1) -> 
        UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn21
                 (let (QualName Name
v, Loc
loc) = (QualName Name, Loc)
happy_var_1 in QualName Name
-> NoInfo (Map VName VName) -> SrcLoc -> UncheckedModTypeExp
forall (f :: * -> *) vn.
QualName vn -> f (Map VName VName) -> SrcLoc -> ModTypeExpBase f vn
ModTypeVar QualName Name
v NoInfo (Map VName VName)
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_42 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_42 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_42 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
12# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
p
-> HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_42
happyReduction_42 :: p
-> HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_42 p
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        p
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
happyOut15 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap15 UncheckedModTypeExp
happy_var_2) -> 
        UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedModTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn21
                 (UncheckedModTypeExp
happy_var_2
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_43 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_43 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_43 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
6# Int#
13# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {t100 :: k} {t101 :: k} {t102 :: k}.
HappyStk (HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102)
-> HappyStk
     (HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102)
happyReduction_43
happyReduction_43 :: HappyStk (HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102)
-> HappyStk
     (HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102)
happyReduction_43 (HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
happy_x_6 `HappyStk`
        HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102)
happyRest)
         = case HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
MODULE) -> 
        case HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
-> HappyWrap24
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap24
happyOut24 HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
happy_x_3 of { (HappyWrap24 [ModParamBase NoInfo Name]
happy_var_3) -> 
        case HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
-> Maybe UncheckedModTypeExp
forall {k} {k} {k} t99 (t100 :: k) (t101 :: k) (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> t99
happyOut99 HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
happy_x_4 of { Maybe UncheckedModTypeExp
happy_var_4 -> 
        case HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
-> HappyWrap18
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap18
happyOut18 HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
happy_x_6 of { (HappyWrap18 UncheckedModExp
happy_var_6) -> 
        ModBindBase NoInfo Name
-> HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
ModBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn22
                 (let L Loc
floc (ID Name
fname) = L Token
happy_var_2;
             in Name
-> [ModParamBase NoInfo Name]
-> Maybe (UncheckedModTypeExp, NoInfo (Map VName VName))
-> UncheckedModExp
-> Maybe DocComment
-> SrcLoc
-> ModBindBase NoInfo Name
forall (f :: * -> *) vn.
vn
-> [ModParamBase f vn]
-> Maybe (ModTypeExpBase f vn, f (Map VName VName))
-> ModExpBase f vn
-> Maybe DocComment
-> SrcLoc
-> ModBindBase f vn
ModBind Name
fname [ModParamBase NoInfo Name]
happy_var_3 ((UncheckedModTypeExp
 -> (UncheckedModTypeExp, NoInfo (Map VName VName)))
-> Maybe UncheckedModTypeExp
-> Maybe (UncheckedModTypeExp, NoInfo (Map VName VName))
forall a b. (a -> b) -> Maybe a -> Maybe b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (,NoInfo (Map VName VName)
forall {k} (a :: k). NoInfo a
NoInfo) Maybe UncheckedModTypeExp
happy_var_4) UncheckedModExp
happy_var_6 Maybe DocComment
forall a. Maybe a
Nothing (Loc -> UncheckedModExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedModExp
happy_var_6)
        ) HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
-> HappyStk
     (HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102)
-> HappyStk
     (HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102)
happyRest}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_44 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_44 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_44 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
14# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_44
happyReduction_44 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_44 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
happyOut15 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap15 UncheckedModTypeExp
happy_var_4) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (L Loc
happy_var_5 Token
RPAR) -> 
        ModParamBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
ModParamBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn23
                 (let L Loc
_ (ID Name
name) = L Token
happy_var_2 in Name
-> UncheckedModTypeExp
-> NoInfo [VName]
-> SrcLoc
-> ModParamBase NoInfo Name
forall (f :: * -> *) vn.
vn
-> ModTypeExpBase f vn -> f [VName] -> SrcLoc -> ModParamBase f vn
ModParam Name
name UncheckedModTypeExp
happy_var_4 NoInfo [VName]
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_5)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_45 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_45 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_45 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
15# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_45
happyReduction_45 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_45 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap23
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap23
happyOut23 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap23 ModParamBase NoInfo Name
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap24
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap24
happyOut24 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap24 [ModParamBase NoInfo Name]
happy_var_2) -> 
        [ModParamBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[ModParamBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn24
                 (ModParamBase NoInfo Name
happy_var_1 ModParamBase NoInfo Name
-> [ModParamBase NoInfo Name] -> [ModParamBase NoInfo Name]
forall a. a -> [a] -> [a]
: [ModParamBase NoInfo Name]
happy_var_2
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_46 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_46 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_46 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
15# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
happyReduction_46
happyReduction_46 :: HappyAbsSyn t99 t100 t101 t102
happyReduction_46  =  [ModParamBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[ModParamBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn24
                 ([]
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_47 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_47 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_47 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
16# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
happyReduction_47
happyReduction_47 :: HappyAbsSyn t99 t100 t101 t102
happyReduction_47  =  Liftedness -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
Liftedness -> HappyAbsSyn t99 t100 t101 t102
happyIn25
                 (Liftedness
Unlifted
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_48 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_48 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_48 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
16# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
p -> HappyAbsSyn t99 t100 t101 t102
happyReduction_48
happyReduction_48 :: p -> HappyAbsSyn t99 t100 t101 t102
happyReduction_48 p
happy_x_1
         =  Liftedness -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
Liftedness -> HappyAbsSyn t99 t100 t101 t102
happyIn25
                 (Liftedness
SizeLifted
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_49 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_49 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_49 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
16# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
p -> HappyAbsSyn t99 t100 t101 t102
happyReduction_49
happyReduction_49 :: p -> HappyAbsSyn t99 t100 t101 t102
happyReduction_49 p
happy_x_1
         =  Liftedness -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
Liftedness -> HappyAbsSyn t99 t100 t101 t102
happyIn25
                 (Liftedness
Lifted
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_50 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_50 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_50 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
17# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_50
happyReduction_50 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_50 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
VAL) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
happyOut33 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap33 [TypeParamBase Name]
happy_var_3) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (HappyWrap40 UncheckedTypeExp
happy_var_5) -> 
        SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn26
                 (let L Loc
loc (ID Name
name) = L Token
happy_var_2
          in Name
-> [TypeParamBase Name]
-> UncheckedTypeExp
-> NoInfo StructType
-> Maybe DocComment
-> SrcLoc
-> SpecBase NoInfo Name
forall (f :: * -> *) vn.
vn
-> [TypeParamBase vn]
-> TypeExp (ExpBase f vn) vn
-> f StructType
-> Maybe DocComment
-> SrcLoc
-> SpecBase f vn
ValSpec Name
name [TypeParamBase Name]
happy_var_3 UncheckedTypeExp
happy_var_5 NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo Maybe DocComment
forall a. Maybe a
Nothing (Loc -> UncheckedTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedTypeExp
happy_var_5)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_51 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_51 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_51 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
17# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_51
happyReduction_51 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_51 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
VAL) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap36
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap36
happyOut36 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap36 Name
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
happyOut33 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap33 [TypeParamBase Name]
happy_var_3) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (HappyWrap40 UncheckedTypeExp
happy_var_5) -> 
        SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn26
                 (Name
-> [TypeParamBase Name]
-> UncheckedTypeExp
-> NoInfo StructType
-> Maybe DocComment
-> SrcLoc
-> SpecBase NoInfo Name
forall (f :: * -> *) vn.
vn
-> [TypeParamBase vn]
-> TypeExp (ExpBase f vn) vn
-> f StructType
-> Maybe DocComment
-> SrcLoc
-> SpecBase f vn
ValSpec Name
happy_var_2 [TypeParamBase Name]
happy_var_3 UncheckedTypeExp
happy_var_5 NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo Maybe DocComment
forall a. Maybe a
Nothing (Loc -> UncheckedTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedTypeExp
happy_var_5)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_52 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_52 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_52 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
17# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_52
happyReduction_52 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_52 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap39
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap39
happyOut39 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap39 TypeBindBase NoInfo Name
happy_var_1) -> 
        SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn26
                 (TypeBindBase NoInfo Name -> SpecBase NoInfo Name
forall (f :: * -> *) vn. TypeBindBase f vn -> SpecBase f vn
TypeAbbrSpec TypeBindBase NoInfo Name
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_53 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_53 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_53 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
17# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_53
happyReduction_53 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_53 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
TYPE) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap25
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap25
happyOut25 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap25 Liftedness
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { L Token
happy_var_3 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
happyOut33 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap33 [TypeParamBase Name]
happy_var_4) -> 
        SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn26
                 (let L Loc
_ (ID Name
name) = L Token
happy_var_3
          in Liftedness
-> Name
-> [TypeParamBase Name]
-> Maybe DocComment
-> SrcLoc
-> SpecBase NoInfo Name
forall (f :: * -> *) vn.
Liftedness
-> vn
-> [TypeParamBase vn]
-> Maybe DocComment
-> SrcLoc
-> SpecBase f vn
TypeSpec Liftedness
happy_var_2 Name
name [TypeParamBase Name]
happy_var_4 Maybe DocComment
forall a. Maybe a
Nothing (Loc -> [TypeParamBase Name] -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 [TypeParamBase Name]
happy_var_4)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_54 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_54 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_54 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
17# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_54
happyReduction_54 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_54 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
MODULE) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
happyOut15 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap15 UncheckedModTypeExp
happy_var_4) -> 
        SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn26
                 (let L Loc
_ (ID Name
name) = L Token
happy_var_2
          in Name
-> UncheckedModTypeExp
-> Maybe DocComment
-> SrcLoc
-> SpecBase NoInfo Name
forall (f :: * -> *) vn.
vn
-> ModTypeExpBase f vn
-> Maybe DocComment
-> SrcLoc
-> SpecBase f vn
ModSpec Name
name UncheckedModTypeExp
happy_var_4 Maybe DocComment
forall a. Maybe a
Nothing (Loc -> UncheckedModTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedModTypeExp
happy_var_4)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_55 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_55 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_55 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
17# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_55
happyReduction_55 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_55 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
INCLUDE) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
happyOut15 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap15 UncheckedModTypeExp
happy_var_2) -> 
        SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn26
                 (UncheckedModTypeExp -> SrcLoc -> SpecBase NoInfo Name
forall (f :: * -> *) vn.
ModTypeExpBase f vn -> SrcLoc -> SpecBase f vn
IncludeSpec UncheckedModTypeExp
happy_var_2 (Loc -> UncheckedModTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedModTypeExp
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_56 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_56 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_56 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
17# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_56
happyReduction_56 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_56 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap9
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap9
happyOut9 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap9 DocComment
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap26
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap26
happyOut26 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap26 SpecBase NoInfo Name
happy_var_2) -> 
        SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn26
                 (DocComment -> SpecBase NoInfo Name -> SpecBase NoInfo Name
addDocSpec DocComment
happy_var_1 SpecBase NoInfo Name
happy_var_2
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_57 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_57 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_57 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
17# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_57
happyReduction_57 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_57 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap97
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap97
happyOut97 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap97 AttrInfo Name
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap26
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap26
happyOut26 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap26 SpecBase NoInfo Name
happy_var_4) -> 
        SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn26
                 (AttrInfo Name -> SpecBase NoInfo Name -> SpecBase NoInfo Name
addAttrSpec AttrInfo Name
happy_var_2 SpecBase NoInfo Name
happy_var_4
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_58 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_58 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_58 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
18# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_58
happyReduction_58 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_58 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap28
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap28
happyOut28 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap28 [SpecBase NoInfo Name]
happy_var_1) -> 
        [SpecBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[SpecBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn27
                 ([SpecBase NoInfo Name] -> [SpecBase NoInfo Name]
forall a. [a] -> [a]
reverse [SpecBase NoInfo Name]
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_59 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_59 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_59 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
19# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_59
happyReduction_59 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_59 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap28
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap28
happyOut28 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap28 [SpecBase NoInfo Name]
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap26
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap26
happyOut26 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap26 SpecBase NoInfo Name
happy_var_2) -> 
        [SpecBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[SpecBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn28
                 (SpecBase NoInfo Name
happy_var_2 SpecBase NoInfo Name
-> [SpecBase NoInfo Name] -> [SpecBase NoInfo Name]
forall a. a -> [a] -> [a]
: [SpecBase NoInfo Name]
happy_var_1
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_60 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_60 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_60 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
19# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
happyReduction_60
happyReduction_60 :: HappyAbsSyn t99 t100 t101 t102
happyReduction_60  =  [SpecBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[SpecBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn28
                 ([]
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_61 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_61 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_61 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
20# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_61
happyReduction_61 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_61 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LBRACKET) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RBRACKET) -> 
        SizeBinder Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SizeBinder Name -> HappyAbsSyn t99 t100 t101 t102
happyIn29
                 (let L Loc
_ (ID Name
name) = L Token
happy_var_2 in Name -> SrcLoc -> SizeBinder Name
forall vn. vn -> SrcLoc -> SizeBinder vn
SizeBinder Name
name (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_62 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_62 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_62 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
20# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_62
happyReduction_62 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_62 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RBRACKET) -> 
        SizeBinder Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SizeBinder Name -> HappyAbsSyn t99 t100 t101 t102
happyIn29
                 (let L Loc
_ (ID Name
name) = L Token
happy_var_2 in Name -> SrcLoc -> SizeBinder Name
forall vn. vn -> SrcLoc -> SizeBinder vn
SizeBinder Name
name (L Token -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan L Token
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_63 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_63 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_63 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
21# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_63
happyReduction_63 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_63 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap29
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap29
happyOut29 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap29 SizeBinder Name
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap30
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap30
happyOut30 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap30 [SizeBinder Name]
happy_var_2) -> 
        [SizeBinder Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[SizeBinder Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn30
                 (SizeBinder Name
happy_var_1 SizeBinder Name -> [SizeBinder Name] -> [SizeBinder Name]
forall a. a -> [a] -> [a]
: [SizeBinder Name]
happy_var_2
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_64 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_64 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_64 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
21# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_64
happyReduction_64 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_64 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap29
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap29
happyOut29 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap29 SizeBinder Name
happy_var_1) -> 
        [SizeBinder Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[SizeBinder Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn30
                 ([SizeBinder Name
happy_var_1]
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_65 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_65 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_65 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
22# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_65
happyReduction_65 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_65 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
APOSTROPHE) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        TypeParamBase Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
TypeParamBase Name -> HappyAbsSyn t99 t100 t101 t102
happyIn31
                 (let L Loc
_ (ID Name
name) = L Token
happy_var_2 in Liftedness -> Name -> SrcLoc -> TypeParamBase Name
forall vn. Liftedness -> vn -> SrcLoc -> TypeParamBase vn
TypeParamType Liftedness
Unlifted Name
name (Loc -> L Token -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 L Token
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_66 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_66 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_66 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
22# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_66
happyReduction_66 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_66 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
APOSTROPHE_THEN_TILDE) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        TypeParamBase Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
TypeParamBase Name -> HappyAbsSyn t99 t100 t101 t102
happyIn31
                 (let L Loc
_ (ID Name
name) = L Token
happy_var_2 in Liftedness -> Name -> SrcLoc -> TypeParamBase Name
forall vn. Liftedness -> vn -> SrcLoc -> TypeParamBase vn
TypeParamType Liftedness
SizeLifted Name
name (Loc -> L Token -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 L Token
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_67 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_67 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_67 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
22# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_67
happyReduction_67 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_67 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
APOSTROPHE_THEN_HAT) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        TypeParamBase Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
TypeParamBase Name -> HappyAbsSyn t99 t100 t101 t102
happyIn31
                 (let L Loc
_ (ID Name
name) = L Token
happy_var_2 in Liftedness -> Name -> SrcLoc -> TypeParamBase Name
forall vn. Liftedness -> vn -> SrcLoc -> TypeParamBase vn
TypeParamType Liftedness
Lifted Name
name (Loc -> L Token -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 L Token
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_68 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_68 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_68 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
23# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_68
happyReduction_68 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_68 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LBRACKET) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RBRACKET) -> 
        TypeParamBase Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
TypeParamBase Name -> HappyAbsSyn t99 t100 t101 t102
happyIn32
                 (let L Loc
_ (ID Name
name) = L Token
happy_var_2 in Name -> SrcLoc -> TypeParamBase Name
forall vn. vn -> SrcLoc -> TypeParamBase vn
TypeParamDim Name
name (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_69 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_69 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_69 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
23# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_69
happyReduction_69 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_69 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RBRACKET) -> 
        TypeParamBase Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
TypeParamBase Name -> HappyAbsSyn t99 t100 t101 t102
happyIn32
                 (let L Loc
_ (ID Name
name) = L Token
happy_var_2 in Name -> SrcLoc -> TypeParamBase Name
forall vn. vn -> SrcLoc -> TypeParamBase vn
TypeParamDim Name
name (L Token -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan L Token
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_70 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_70 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_70 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
23# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_70
happyReduction_70 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_70 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap31
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap31
happyOut31 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap31 TypeParamBase Name
happy_var_1) -> 
        TypeParamBase Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
TypeParamBase Name -> HappyAbsSyn t99 t100 t101 t102
happyIn32
                 (TypeParamBase Name
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_71 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_71 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_71 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
24# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_71
happyReduction_71 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_71 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap32
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap32
happyOut32 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap32 TypeParamBase Name
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
happyOut33 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap33 [TypeParamBase Name]
happy_var_2) -> 
        [TypeParamBase Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[TypeParamBase Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn33
                 (TypeParamBase Name
happy_var_1 TypeParamBase Name -> [TypeParamBase Name] -> [TypeParamBase Name]
forall a. a -> [a] -> [a]
: [TypeParamBase Name]
happy_var_2
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_72 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_72 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_72 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
24# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
happyReduction_72
happyReduction_72 :: HappyAbsSyn t99 t100 t101 t102
happyReduction_72  =  [TypeParamBase Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[TypeParamBase Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn33
                 ([]
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_73 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_73 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_73 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
25# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_73
happyReduction_73 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_73 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LBRACKET) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
happyOut33 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap33 [TypeParamBase Name]
happy_var_4) -> 
        [TypeParamBase Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[TypeParamBase Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn34
                 (let L Loc
_ (ID Name
name) = L Token
happy_var_2 in Name -> SrcLoc -> TypeParamBase Name
forall vn. vn -> SrcLoc -> TypeParamBase vn
TypeParamDim Name
name (Loc -> [TypeParamBase Name] -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 [TypeParamBase Name]
happy_var_4) TypeParamBase Name -> [TypeParamBase Name] -> [TypeParamBase Name]
forall a. a -> [a] -> [a]
: [TypeParamBase Name]
happy_var_4
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_74 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_74 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_74 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
25# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_74
happyReduction_74 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_74 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap31
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap31
happyOut31 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap31 TypeParamBase Name
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
happyOut33 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap33 [TypeParamBase Name]
happy_var_2) -> 
        [TypeParamBase Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[TypeParamBase Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn34
                 (TypeParamBase Name
happy_var_1 TypeParamBase Name -> [TypeParamBase Name] -> [TypeParamBase Name]
forall a. a -> [a] -> [a]
: [TypeParamBase Name]
happy_var_2
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_75 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_75 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_75 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
25# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
happyReduction_75
happyReduction_75 :: HappyAbsSyn t99 t100 t101 t102
happyReduction_75  =  [TypeParamBase Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[TypeParamBase Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn34
                 ([]
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_76 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_76 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_76 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_76
happyReduction_76 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_76 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_77 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_77 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_77 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_77
happyReduction_77 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_77 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_78 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_78 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_78 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_78
happyReduction_78 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_78 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_79 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_79 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_79 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_79
happyReduction_79 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_79 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
ASTERISK) -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 ((Name -> QualName Name
forall v. v -> QualName v
qualName (String -> Name
nameFromString String
"*"), Loc
happy_var_1)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_80 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_80 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_80 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_80
happyReduction_80 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_80 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_81 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_81 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_81 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_81
happyReduction_81 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_81 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_82 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_82 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_82 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_82
happyReduction_82 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_82 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_83 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_83 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_83 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_83
happyReduction_83 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_83 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_84 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_84 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_84 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_84
happyReduction_84 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_84 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_85 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_85 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_85 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_85
happyReduction_85 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_85 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_86 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_86 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_86 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_86
happyReduction_86 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_86 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_87 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_87 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_87 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_87
happyReduction_87 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_87 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_88 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_88 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_88 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_88
happyReduction_88 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_88 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_89 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_89 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_89 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_89
happyReduction_89 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_89 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_90 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_90 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_90 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_90
happyReduction_90 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_90 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_91 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_91 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_91 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_91
happyReduction_91 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_91 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_92 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_92 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_92 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_92
happyReduction_92 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_92 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_93 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_93 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_93 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_93
happyReduction_93 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_93 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_94 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_94 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_94 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_94
happyReduction_94 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_94 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
HAT) -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 ((Name -> QualName Name
forall v. v -> QualName v
qualName (String -> Name
nameFromString String
"^"), Loc
happy_var_1)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_95 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_95 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_95 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_95
happyReduction_95 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_95 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_96 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_96 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_96 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_96
happyReduction_96 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_96 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_97 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_97 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_97 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_97
happyReduction_97 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_97 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
PIPE) -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 ((Name -> QualName Name
forall v. v -> QualName v
qualName (String -> Name
nameFromString String
"|"), Loc
happy_var_1)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_98 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_98 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_98 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_98
happyReduction_98 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_98 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_99 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_99 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_99 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_99
happyReduction_99 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_99 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_100 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_100 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_100 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_100
happyReduction_100 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_100 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_101 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_101 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_101 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_101
happyReduction_101 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_101 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_102 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_102 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_102 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_102
happyReduction_102 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_102 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LTH) -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 ((Name -> QualName Name
forall v. v -> QualName v
qualName (String -> Name
nameFromString String
"<"), Loc
happy_var_1)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_103 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_103 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_103 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_103
happyReduction_103 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_103 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_104 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_104 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_104 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_104
happyReduction_104 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_104 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_105 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_105 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_105 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
26# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
p
-> HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_105
happyReduction_105 :: p
-> HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_105 p
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        p
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
happyOut57 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap57 (QualName Name, Loc)
happy_var_2) -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn35
                 ((QualName Name, Loc)
happy_var_2
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_106 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_106 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_106 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
1# Int#
27# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> L Token
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_106
happyReduction_106 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_106 (HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest) p
tk
         = ParserMonad Name
-> (Name -> ParserMonad (HappyAbsSyn t99 t100 t101 t102))
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap35
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap35
happyOut35 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap35 (QualName Name, Loc)
happy_var_1) -> 
        ( let (QualName [Name]
qs Name
name, Loc
loc) = (QualName Name, Loc)
happy_var_1 in do
                   Bool
-> ExceptT SyntaxError (State ParserState) ()
-> ExceptT SyntaxError (State ParserState) ()
forall (f :: * -> *). Applicative f => Bool -> f () -> f ()
unless ([Name] -> Bool
forall a. [a] -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
null [Name]
qs) (ExceptT SyntaxError (State ParserState) ()
 -> ExceptT SyntaxError (State ParserState) ())
-> ExceptT SyntaxError (State ParserState) ()
-> ExceptT SyntaxError (State ParserState) ()
forall a b. (a -> b) -> a -> b
$ Loc -> Maybe Text -> ExceptT SyntaxError (State ParserState) ()
forall loc a. Located loc => loc -> Maybe Text -> ParserMonad a
parseErrorAt Loc
loc (Maybe Text -> ExceptT SyntaxError (State ParserState) ())
-> Maybe Text -> ExceptT SyntaxError (State ParserState) ()
forall a b. (a -> b) -> a -> b
$
                     Text -> Maybe Text
forall a. a -> Maybe a
Just Text
"Cannot use a qualified name in binding position."
                   Name -> ParserMonad Name
forall a. a -> ExceptT SyntaxError (State ParserState) a
forall (f :: * -> *) a. Applicative f => a -> f a
pure Name
name)})
        ) (\Name
r -> HappyAbsSyn t99 t100 t101 t102
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
Name -> HappyAbsSyn t99 t100 t101 t102
happyIn36 Name
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_107 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_107 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_107 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
27# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
p -> HappyAbsSyn t99 t100 t101 t102
happyReduction_107
happyReduction_107 :: p -> HappyAbsSyn t99 t100 t101 t102
happyReduction_107 p
happy_x_1
         =  Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
Name -> HappyAbsSyn t99 t100 t101 t102
happyIn36
                 (String -> Name
nameFromString String
"-"
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_108 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_108 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_108 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
1# Int#
27# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> L Token
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_108
happyReduction_108 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_108 (HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest) p
tk
         = ParserMonad Name
-> (Name -> ParserMonad (HappyAbsSyn t99 t100 t101 t102))
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
BANG) -> 
        ( Loc -> Maybe Text -> ParserMonad Name
forall loc a. Located loc => loc -> Maybe Text -> ParserMonad a
parseErrorAt Loc
happy_var_1 (Maybe Text -> ParserMonad Name) -> Maybe Text -> ParserMonad Name
forall a b. (a -> b) -> a -> b
$ Text -> Maybe Text
forall a. a -> Maybe a
Just (Text -> Maybe Text) -> Text -> Maybe Text
forall a b. (a -> b) -> a -> b
$ Text
"'!' is a prefix operator and cannot be used as infix operator.")})
        ) (\Name
r -> HappyAbsSyn t99 t100 t101 t102
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
Name -> HappyAbsSyn t99 t100 t101 t102
happyIn36 Name
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_109 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_109 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_109 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
28# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_109
happyReduction_109 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_109 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn37
                 (let L Loc
loc (ID Name
name) = L Token
happy_var_1 in (Name
name, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_110 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_110 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_110 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
28# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {p}
       {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k}.
p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_110
happyReduction_110 :: p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_110 p
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap36
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap36
happyOut36 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap36 Name
happy_var_2) -> 
        (Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn37
                 ((Name
happy_var_2, Loc
happy_var_1)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_111 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_111 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_111 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
29# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {t99 :: k} {t100 :: k} {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyReduction_111
happyReduction_111 :: HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyReduction_111 (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_7 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyRest)
         = case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_1 of { (L Loc
happy_var_1 Token
DEF) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap37
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap37
happyOut37 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_2 of { (HappyWrap37 (Name, Loc)
happy_var_2) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap33
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
happyOut33 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_3 of { (HappyWrap33 [TypeParamBase Name]
happy_var_3) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap56
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap56
happyOut56 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_4 of { (HappyWrap56 [PatBase NoInfo Name ParamType]
happy_var_4) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
-> Maybe UncheckedTypeExp
forall {k} {k} {k} (t99 :: k) (t100 :: k) t101 (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> t101
happyOut101 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_5 of { Maybe UncheckedTypeExp
happy_var_5 -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_7 of { (HappyWrap58 UncheckedExp
happy_var_7) -> 
        ValBindBase NoInfo Name
-> HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
ValBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn38
                 (let (Name
name, Loc
_) = (Name, Loc)
happy_var_2
            in Maybe (NoInfo EntryPoint)
-> Name
-> Maybe UncheckedTypeExp
-> NoInfo ResRetType
-> [TypeParamBase Name]
-> [PatBase NoInfo Name ParamType]
-> UncheckedExp
-> Maybe DocComment
-> [AttrInfo Name]
-> SrcLoc
-> ValBindBase NoInfo Name
forall (f :: * -> *) vn.
Maybe (f EntryPoint)
-> vn
-> Maybe (TypeExp (ExpBase f vn) vn)
-> f ResRetType
-> [TypeParamBase vn]
-> [PatBase f vn ParamType]
-> ExpBase f vn
-> Maybe DocComment
-> [AttrInfo vn]
-> SrcLoc
-> ValBindBase f vn
ValBind Maybe (NoInfo EntryPoint)
forall a. Maybe a
Nothing Name
name Maybe UncheckedTypeExp
happy_var_5 NoInfo ResRetType
forall {k} (a :: k). NoInfo a
NoInfo
               [TypeParamBase Name]
happy_var_3 [PatBase NoInfo Name ParamType]
happy_var_4 UncheckedExp
happy_var_7 Maybe DocComment
forall a. Maybe a
Nothing [AttrInfo Name]
forall a. Monoid a => a
mempty (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_7)
        ) HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyRest}}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_112 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_112 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_112 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
29# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {t99 :: k} {t100 :: k} {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyReduction_112
happyReduction_112 :: HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyReduction_112 (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_7 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyRest)
         = case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_1 of { (L Loc
happy_var_1 Token
ENTRY) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap37
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap37
happyOut37 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_2 of { (HappyWrap37 (Name, Loc)
happy_var_2) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap33
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
happyOut33 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_3 of { (HappyWrap33 [TypeParamBase Name]
happy_var_3) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap56
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap56
happyOut56 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_4 of { (HappyWrap56 [PatBase NoInfo Name ParamType]
happy_var_4) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
-> Maybe UncheckedTypeExp
forall {k} {k} {k} (t99 :: k) (t100 :: k) t101 (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> t101
happyOut101 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_5 of { Maybe UncheckedTypeExp
happy_var_5 -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_7 of { (HappyWrap58 UncheckedExp
happy_var_7) -> 
        ValBindBase NoInfo Name
-> HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
ValBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn38
                 (let (Name
name, Loc
loc) = (Name, Loc)
happy_var_2
            in Maybe (NoInfo EntryPoint)
-> Name
-> Maybe UncheckedTypeExp
-> NoInfo ResRetType
-> [TypeParamBase Name]
-> [PatBase NoInfo Name ParamType]
-> UncheckedExp
-> Maybe DocComment
-> [AttrInfo Name]
-> SrcLoc
-> ValBindBase NoInfo Name
forall (f :: * -> *) vn.
Maybe (f EntryPoint)
-> vn
-> Maybe (TypeExp (ExpBase f vn) vn)
-> f ResRetType
-> [TypeParamBase vn]
-> [PatBase f vn ParamType]
-> ExpBase f vn
-> Maybe DocComment
-> [AttrInfo vn]
-> SrcLoc
-> ValBindBase f vn
ValBind (NoInfo EntryPoint -> Maybe (NoInfo EntryPoint)
forall a. a -> Maybe a
Just NoInfo EntryPoint
forall {k} (a :: k). NoInfo a
NoInfo) Name
name Maybe UncheckedTypeExp
happy_var_5 NoInfo ResRetType
forall {k} (a :: k). NoInfo a
NoInfo
               [TypeParamBase Name]
happy_var_3 [PatBase NoInfo Name ParamType]
happy_var_4 UncheckedExp
happy_var_7 Maybe DocComment
forall a. Maybe a
Nothing [AttrInfo Name]
forall a. Monoid a => a
mempty (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_7)
        ) HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyRest}}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_113 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_113 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_113 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
29# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {t99 :: k} {t100 :: k} {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyReduction_113
happyReduction_113 :: HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyReduction_113 (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_7 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyRest)
         = case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_1 of { (L Loc
happy_var_1 Token
DEF) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap54
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap54
happyOut54 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_2 of { (HappyWrap54 PatBase NoInfo Name ParamType
happy_var_2) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap36
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap36
happyOut36 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_3 of { (HappyWrap36 Name
happy_var_3) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap54
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap54
happyOut54 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_4 of { (HappyWrap54 PatBase NoInfo Name ParamType
happy_var_4) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
-> Maybe UncheckedTypeExp
forall {k} {k} {k} (t99 :: k) (t100 :: k) t101 (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> t101
happyOut101 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_5 of { Maybe UncheckedTypeExp
happy_var_5 -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_7 of { (HappyWrap58 UncheckedExp
happy_var_7) -> 
        ValBindBase NoInfo Name
-> HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
ValBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn38
                 (Maybe (NoInfo EntryPoint)
-> Name
-> Maybe UncheckedTypeExp
-> NoInfo ResRetType
-> [TypeParamBase Name]
-> [PatBase NoInfo Name ParamType]
-> UncheckedExp
-> Maybe DocComment
-> [AttrInfo Name]
-> SrcLoc
-> ValBindBase NoInfo Name
forall (f :: * -> *) vn.
Maybe (f EntryPoint)
-> vn
-> Maybe (TypeExp (ExpBase f vn) vn)
-> f ResRetType
-> [TypeParamBase vn]
-> [PatBase f vn ParamType]
-> ExpBase f vn
-> Maybe DocComment
-> [AttrInfo vn]
-> SrcLoc
-> ValBindBase f vn
ValBind Maybe (NoInfo EntryPoint)
forall a. Maybe a
Nothing Name
happy_var_3 Maybe UncheckedTypeExp
happy_var_5 NoInfo ResRetType
forall {k} (a :: k). NoInfo a
NoInfo [] [PatBase NoInfo Name ParamType
happy_var_2,PatBase NoInfo Name ParamType
happy_var_4] UncheckedExp
happy_var_7
            Maybe DocComment
forall a. Maybe a
Nothing [AttrInfo Name]
forall a. Monoid a => a
mempty (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_7)
        ) HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyRest}}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_114 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_114 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_114 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
29# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {t99 :: k} {t100 :: k} {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyReduction_114
happyReduction_114 :: HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyReduction_114 (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_7 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyRest)
         = case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_1 of { (L Loc
happy_var_1 Token
LET) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap37
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap37
happyOut37 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_2 of { (HappyWrap37 (Name, Loc)
happy_var_2) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap33
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
happyOut33 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_3 of { (HappyWrap33 [TypeParamBase Name]
happy_var_3) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap56
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap56
happyOut56 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_4 of { (HappyWrap56 [PatBase NoInfo Name ParamType]
happy_var_4) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
-> Maybe UncheckedTypeExp
forall {k} {k} {k} (t99 :: k) (t100 :: k) t101 (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> t101
happyOut101 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_5 of { Maybe UncheckedTypeExp
happy_var_5 -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_7 of { (HappyWrap58 UncheckedExp
happy_var_7) -> 
        ValBindBase NoInfo Name
-> HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
ValBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn38
                 (let (Name
name, Loc
_) = (Name, Loc)
happy_var_2
            in Maybe (NoInfo EntryPoint)
-> Name
-> Maybe UncheckedTypeExp
-> NoInfo ResRetType
-> [TypeParamBase Name]
-> [PatBase NoInfo Name ParamType]
-> UncheckedExp
-> Maybe DocComment
-> [AttrInfo Name]
-> SrcLoc
-> ValBindBase NoInfo Name
forall (f :: * -> *) vn.
Maybe (f EntryPoint)
-> vn
-> Maybe (TypeExp (ExpBase f vn) vn)
-> f ResRetType
-> [TypeParamBase vn]
-> [PatBase f vn ParamType]
-> ExpBase f vn
-> Maybe DocComment
-> [AttrInfo vn]
-> SrcLoc
-> ValBindBase f vn
ValBind Maybe (NoInfo EntryPoint)
forall a. Maybe a
Nothing Name
name Maybe UncheckedTypeExp
happy_var_5 NoInfo ResRetType
forall {k} (a :: k). NoInfo a
NoInfo
               [TypeParamBase Name]
happy_var_3 [PatBase NoInfo Name ParamType]
happy_var_4 UncheckedExp
happy_var_7 Maybe DocComment
forall a. Maybe a
Nothing [AttrInfo Name]
forall a. Monoid a => a
mempty (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_7)
        ) HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyRest}}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_115 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_115 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_115 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
29# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {t99 :: k} {t100 :: k} {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyReduction_115
happyReduction_115 :: HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyReduction_115 (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_7 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyRest)
         = case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_1 of { (L Loc
happy_var_1 Token
LET) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap54
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap54
happyOut54 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_2 of { (HappyWrap54 PatBase NoInfo Name ParamType
happy_var_2) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap36
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap36
happyOut36 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_3 of { (HappyWrap36 Name
happy_var_3) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap54
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap54
happyOut54 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_4 of { (HappyWrap54 PatBase NoInfo Name ParamType
happy_var_4) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
-> Maybe UncheckedTypeExp
forall {k} {k} {k} (t99 :: k) (t100 :: k) t101 (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> t101
happyOut101 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_5 of { Maybe UncheckedTypeExp
happy_var_5 -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_7 of { (HappyWrap58 UncheckedExp
happy_var_7) -> 
        ValBindBase NoInfo Name
-> HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
ValBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn38
                 (Maybe (NoInfo EntryPoint)
-> Name
-> Maybe UncheckedTypeExp
-> NoInfo ResRetType
-> [TypeParamBase Name]
-> [PatBase NoInfo Name ParamType]
-> UncheckedExp
-> Maybe DocComment
-> [AttrInfo Name]
-> SrcLoc
-> ValBindBase NoInfo Name
forall (f :: * -> *) vn.
Maybe (f EntryPoint)
-> vn
-> Maybe (TypeExp (ExpBase f vn) vn)
-> f ResRetType
-> [TypeParamBase vn]
-> [PatBase f vn ParamType]
-> ExpBase f vn
-> Maybe DocComment
-> [AttrInfo vn]
-> SrcLoc
-> ValBindBase f vn
ValBind Maybe (NoInfo EntryPoint)
forall a. Maybe a
Nothing Name
happy_var_3 Maybe UncheckedTypeExp
happy_var_5 NoInfo ResRetType
forall {k} (a :: k). NoInfo a
NoInfo [] [PatBase NoInfo Name ParamType
happy_var_2,PatBase NoInfo Name ParamType
happy_var_4] UncheckedExp
happy_var_7
            Maybe DocComment
forall a. Maybe a
Nothing [AttrInfo Name]
forall a. Monoid a => a
mempty (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_7)
        ) HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyRest}}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_116 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_116 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_116 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
8# Int#
29# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> L Token
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_116
happyReduction_116 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_116 (HappyAbsSyn t99 t100 t101 t102
happy_x_8 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_7 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest) p
tk
         = ParserMonad (ValBindBase NoInfo Name)
-> (ValBindBase NoInfo Name
    -> ParserMonad (HappyAbsSyn t99 t100 t101 t102))
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (L Loc
happy_var_2 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_6 of { (L Loc
happy_var_6 Token
RPAR) -> 
        ( SrcLoc -> Maybe Text -> ParserMonad (ValBindBase NoInfo Name)
forall loc a. Located loc => loc -> Maybe Text -> ParserMonad a
parseErrorAt (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_2 Loc
happy_var_6) (Maybe Text -> ParserMonad (ValBindBase NoInfo Name))
-> Maybe Text -> ParserMonad (ValBindBase NoInfo Name)
forall a b. (a -> b) -> a -> b
$ Text -> Maybe Text
forall a. a -> Maybe a
Just (Text -> Maybe Text) -> Text -> Maybe Text
forall a b. (a -> b) -> a -> b
$
             [Text] -> Text
T.unlines [Text
"Cannot bind patterns at top level.",
                        Text
"Bind a single name instead."])}})
        ) (\ValBindBase NoInfo Name
r -> HappyAbsSyn t99 t100 t101 t102
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (ValBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
ValBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn38 ValBindBase NoInfo Name
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_117 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_117 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_117 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
8# Int#
29# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> L Token
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_117
happyReduction_117 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_117 (HappyAbsSyn t99 t100 t101 t102
happy_x_8 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_7 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest) p
tk
         = ParserMonad (ValBindBase NoInfo Name)
-> (ValBindBase NoInfo Name
    -> ParserMonad (HappyAbsSyn t99 t100 t101 t102))
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (L Loc
happy_var_2 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_6 of { (L Loc
happy_var_6 Token
RPAR) -> 
        ( SrcLoc -> Maybe Text -> ParserMonad (ValBindBase NoInfo Name)
forall loc a. Located loc => loc -> Maybe Text -> ParserMonad a
parseErrorAt (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_2 Loc
happy_var_6) (Maybe Text -> ParserMonad (ValBindBase NoInfo Name))
-> Maybe Text -> ParserMonad (ValBindBase NoInfo Name)
forall a b. (a -> b) -> a -> b
$ Text -> Maybe Text
forall a. a -> Maybe a
Just (Text -> Maybe Text) -> Text -> Maybe Text
forall a b. (a -> b) -> a -> b
$
             [Text] -> Text
T.unlines [Text
"Cannot bind patterns at top level.",
                        Text
"Bind a single name instead."])}})
        ) (\ValBindBase NoInfo Name
r -> HappyAbsSyn t99 t100 t101 t102
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (ValBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
ValBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn38 ValBindBase NoInfo Name
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_118 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_118 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_118 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
6# Int#
30# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_118
happyReduction_118 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_118 (HappyAbsSyn t99 t100 t101 t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
TYPE) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap25
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap25
happyOut25 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap25 Liftedness
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { L Token
happy_var_3 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap33
happyOut33 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap33 [TypeParamBase Name]
happy_var_4) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_6 of { (HappyWrap40 UncheckedTypeExp
happy_var_6) -> 
        TypeBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
TypeBindBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn39
                 (let L Loc
_ (ID Name
name) = L Token
happy_var_3
              in Name
-> Liftedness
-> [TypeParamBase Name]
-> UncheckedTypeExp
-> NoInfo StructRetType
-> Maybe DocComment
-> SrcLoc
-> TypeBindBase NoInfo Name
forall (f :: * -> *) vn.
vn
-> Liftedness
-> [TypeParamBase vn]
-> TypeExp (ExpBase f vn) vn
-> f StructRetType
-> Maybe DocComment
-> SrcLoc
-> TypeBindBase f vn
TypeBind Name
name Liftedness
happy_var_2 [TypeParamBase Name]
happy_var_4 UncheckedTypeExp
happy_var_6 NoInfo StructRetType
forall {k} (a :: k). NoInfo a
NoInfo Maybe DocComment
forall a. Maybe a
Nothing (Loc -> UncheckedTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedTypeExp
happy_var_6)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_119 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_119 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_119 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
31# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_119
happyReduction_119 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_119 (HappyAbsSyn t99 t100 t101 t102
happy_x_7 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap40 UncheckedTypeExp
happy_var_4) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_7 of { (HappyWrap40 UncheckedTypeExp
happy_var_7) -> 
        UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn40
                 (let L Loc
_ (ID Name
v) = L Token
happy_var_2 in Maybe Name
-> UncheckedTypeExp
-> UncheckedTypeExp
-> SrcLoc
-> UncheckedTypeExp
forall d vn.
Maybe vn -> TypeExp d vn -> TypeExp d vn -> SrcLoc -> TypeExp d vn
TEArrow (Name -> Maybe Name
forall a. a -> Maybe a
Just Name
v) UncheckedTypeExp
happy_var_4 UncheckedTypeExp
happy_var_7 (Loc -> UncheckedTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedTypeExp
happy_var_7)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_120 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_120 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_120 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
31# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_120
happyReduction_120 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_120 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap42
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap42
happyOut42 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap42 UncheckedTypeExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap40 UncheckedTypeExp
happy_var_3) -> 
        UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn40
                 (Maybe Name
-> UncheckedTypeExp
-> UncheckedTypeExp
-> SrcLoc
-> UncheckedTypeExp
forall d vn.
Maybe vn -> TypeExp d vn -> TypeExp d vn -> SrcLoc -> TypeExp d vn
TEArrow Maybe Name
forall a. Maybe a
Nothing UncheckedTypeExp
happy_var_1 UncheckedTypeExp
happy_var_3 (UncheckedTypeExp -> UncheckedTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedTypeExp
happy_var_1 UncheckedTypeExp
happy_var_3)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_121 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_121 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_121 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
31# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_121
happyReduction_121 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_121 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
QUESTION_MARK) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap41
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap41
happyOut41 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap41 [Name]
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap40 UncheckedTypeExp
happy_var_4) -> 
        UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn40
                 ([Name] -> UncheckedTypeExp -> SrcLoc -> UncheckedTypeExp
forall d vn. [vn] -> TypeExp d vn -> SrcLoc -> TypeExp d vn
TEDim [Name]
happy_var_2 UncheckedTypeExp
happy_var_4 (Loc -> UncheckedTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedTypeExp
happy_var_4)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_122 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_122 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_122 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
31# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_122
happyReduction_122 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_122 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap42
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap42
happyOut42 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap42 UncheckedTypeExp
happy_var_1) -> 
        UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn40
                 (UncheckedTypeExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_123 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_123 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_123 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
32# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
p
-> HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_123
happyReduction_123 :: p
-> HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_123 p
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        p
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        [Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn41
                 (let L Loc
_ (ID Name
v) = L Token
happy_var_2 in [Name
v]
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_124 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_124 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_124 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
32# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_124
happyReduction_124 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_124 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap41
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap41
happyOut41 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap41 [Name]
happy_var_4) -> 
        [Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn41
                 (let L Loc
_ (ID Name
v) = L Token
happy_var_2 in Name
v Name -> [Name] -> [Name]
forall a. a -> [a] -> [a]
: [Name]
happy_var_4
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_125 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_125 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_125 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
32# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
p
-> HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_125
happyReduction_125 :: p
-> HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_125 p
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        p
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        [Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn41
                 (let L Loc
_ (ID Name
v) = L Token
happy_var_2 in [Name
v]
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_126 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_126 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_126 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
32# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_126
happyReduction_126 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_126 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap41
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap41
happyOut41 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap41 [Name]
happy_var_4) -> 
        [Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn41
                 (let L Loc
_ (ID Name
v) = L Token
happy_var_2 in Name
v Name -> [Name] -> [Name]
forall a. a -> [a] -> [a]
: [Name]
happy_var_4
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_127 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_127 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_127 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
33# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_127
happyReduction_127 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_127 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
ASTERISK) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap42
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap42
happyOut42 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap42 UncheckedTypeExp
happy_var_2) -> 
        UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn42
                 (UncheckedTypeExp -> SrcLoc -> UncheckedTypeExp
forall d vn. TypeExp d vn -> SrcLoc -> TypeExp d vn
TEUnique UncheckedTypeExp
happy_var_2 (Loc -> UncheckedTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedTypeExp
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_128 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_128 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_128 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
33# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_128
happyReduction_128 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_128 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap46
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap46
happyOut46 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap46 UncheckedTypeExp
happy_var_1) -> 
        UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn42
                 (UncheckedTypeExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_129 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_129 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_129 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
33# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_129
happyReduction_129 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_129 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap43
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap43
happyOut43 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap43 ([(Name, [UncheckedTypeExp])], Loc)
happy_var_1) -> 
        UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn42
                 (let ([(Name, [UncheckedTypeExp])]
cs, Loc
loc) = ([(Name, [UncheckedTypeExp])], Loc)
happy_var_1 in [(Name, [UncheckedTypeExp])] -> SrcLoc -> UncheckedTypeExp
forall d vn. [(Name, [TypeExp d vn])] -> SrcLoc -> TypeExp d vn
TESum [(Name, [UncheckedTypeExp])]
cs (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_130 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_130 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_130 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
34# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_130
happyReduction_130 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_130 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap43
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap43
happyOut43 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap43 ([(Name, [UncheckedTypeExp])], Loc)
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap45
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap45
happyOut45 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap45 (Name, [UncheckedTypeExp], Loc)
happy_var_3) -> 
        ([(Name, [UncheckedTypeExp])], Loc)
-> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
([(Name, [UncheckedTypeExp])], Loc)
-> HappyAbsSyn t99 t100 t101 t102
happyIn43
                 (let ([(Name, [UncheckedTypeExp])]
cs, Loc
loc1) = ([(Name, [UncheckedTypeExp])], Loc)
happy_var_1; (Name
c, [UncheckedTypeExp]
ts, Loc
loc2) = (Name, [UncheckedTypeExp], Loc)
happy_var_3
                in ([(Name, [UncheckedTypeExp])]
cs[(Name, [UncheckedTypeExp])]
-> [(Name, [UncheckedTypeExp])] -> [(Name, [UncheckedTypeExp])]
forall a. [a] -> [a] -> [a]
++[(Name
c, [UncheckedTypeExp]
ts)], SrcLoc -> Loc
forall a. Located a => a -> Loc
locOf (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
loc1 Loc
loc2))
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_131 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_131 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_131 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
34# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_131
happyReduction_131 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_131 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap45
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap45
happyOut45 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap45 (Name, [UncheckedTypeExp], Loc)
happy_var_1) -> 
        ([(Name, [UncheckedTypeExp])], Loc)
-> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
([(Name, [UncheckedTypeExp])], Loc)
-> HappyAbsSyn t99 t100 t101 t102
happyIn43
                 (let (Name
n, [UncheckedTypeExp]
ts, Loc
loc) = (Name, [UncheckedTypeExp], Loc)
happy_var_1 in ([(Name
n, [UncheckedTypeExp]
ts)], Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_132 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_132 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_132 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
35# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
happyReduction_132
happyReduction_132 :: HappyAbsSyn t99 t100 t101 t102
happyReduction_132  =  [UncheckedTypeExp] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedTypeExp] -> HappyAbsSyn t99 t100 t101 t102
happyIn44
                 ([]
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_133 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_133 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_133 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
35# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_133
happyReduction_133 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_133 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap47
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap47
happyOut47 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap47 UncheckedTypeExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap44
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap44
happyOut44 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap44 [UncheckedTypeExp]
happy_var_2) -> 
        [UncheckedTypeExp] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedTypeExp] -> HappyAbsSyn t99 t100 t101 t102
happyIn44
                 (UncheckedTypeExp
happy_var_1 UncheckedTypeExp -> [UncheckedTypeExp] -> [UncheckedTypeExp]
forall a. a -> [a] -> [a]
: [UncheckedTypeExp]
happy_var_2
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_134 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_134 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_134 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
36# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_134
happyReduction_134 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_134 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap48
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap48
happyOut48 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap48 (Name, Loc)
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap44
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap44
happyOut44 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap44 [UncheckedTypeExp]
happy_var_2) -> 
        (Name, [UncheckedTypeExp], Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(Name, [UncheckedTypeExp], Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn45
                 (((Name, Loc) -> Name
forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1, [UncheckedTypeExp]
happy_var_2, SrcLoc -> Loc
forall a. Located a => a -> Loc
locOf (Loc -> [UncheckedTypeExp] -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan ((Name, Loc) -> Loc
forall a b. (a, b) -> b
snd (Name, Loc)
happy_var_1) [UncheckedTypeExp]
happy_var_2))
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_135 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_135 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_135 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
37# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_135
happyReduction_135 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_135 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap46
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap46
happyOut46 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap46 UncheckedTypeExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap49
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap49
happyOut49 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap49 TypeArgExp UncheckedExp Name
happy_var_2) -> 
        UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn46
                 (UncheckedTypeExp
-> TypeArgExp UncheckedExp Name -> SrcLoc -> UncheckedTypeExp
forall d vn.
TypeExp d vn -> TypeArgExp d vn -> SrcLoc -> TypeExp d vn
TEApply UncheckedTypeExp
happy_var_1 TypeArgExp UncheckedExp Name
happy_var_2 (UncheckedTypeExp -> TypeArgExp UncheckedExp Name -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedTypeExp
happy_var_1 TypeArgExp UncheckedExp Name
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_136 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_136 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_136 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
37# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_136
happyReduction_136 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_136 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap47
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap47
happyOut47 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap47 UncheckedTypeExp
happy_var_1) -> 
        UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn46
                 (UncheckedTypeExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_137 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_137 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_137 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
38# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_137
happyReduction_137 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_137 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap40 UncheckedTypeExp
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
        UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn47
                 (UncheckedTypeExp -> SrcLoc -> UncheckedTypeExp
forall d vn. TypeExp d vn -> SrcLoc -> TypeExp d vn
TEParens UncheckedTypeExp
happy_var_2 (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_138 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_138 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_138 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
38# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_138
happyReduction_138 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_138 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (L Loc
happy_var_2 Token
RPAR) -> 
        UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn47
                 ([UncheckedTypeExp] -> SrcLoc -> UncheckedTypeExp
forall d vn. [TypeExp d vn] -> SrcLoc -> TypeExp d vn
TETuple [] (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_139 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_139 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_139 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
38# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_139
happyReduction_139 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_139 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap40 UncheckedTypeExp
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap52
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap52
happyOut52 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap52 [UncheckedTypeExp]
happy_var_4) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (L Loc
happy_var_5 Token
RPAR) -> 
        UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn47
                 ([UncheckedTypeExp] -> SrcLoc -> UncheckedTypeExp
forall d vn. [TypeExp d vn] -> SrcLoc -> TypeExp d vn
TETuple (UncheckedTypeExp
happy_var_2UncheckedTypeExp -> [UncheckedTypeExp] -> [UncheckedTypeExp]
forall a. a -> [a] -> [a]
:[UncheckedTypeExp]
happy_var_4) (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_5)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_140 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_140 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_140 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
38# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_140
happyReduction_140 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_140 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LCURLY) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap51
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap51
happyOut51 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap51 [(L Name, UncheckedTypeExp)]
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RCURLY) -> 
        UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn47
                 ([(L Name, UncheckedTypeExp)] -> SrcLoc -> UncheckedTypeExp
forall d vn. [(L Name, TypeExp d vn)] -> SrcLoc -> TypeExp d vn
TERecord [(L Name, UncheckedTypeExp)]
happy_var_2 (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_141 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_141 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_141 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
38# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_141
happyReduction_141 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_141 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap53
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap53
happyOut53 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap53 SizeExp UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap42
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap42
happyOut42 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap42 UncheckedTypeExp
happy_var_2) -> 
        UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn47
                 (SizeExp UncheckedExp
-> UncheckedTypeExp -> SrcLoc -> UncheckedTypeExp
forall d vn. SizeExp d -> TypeExp d vn -> SrcLoc -> TypeExp d vn
TEArray SizeExp UncheckedExp
happy_var_1 UncheckedTypeExp
happy_var_2 (SizeExp UncheckedExp -> UncheckedTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan SizeExp UncheckedExp
happy_var_1 UncheckedTypeExp
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_142 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_142 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_142 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
38# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_142
happyReduction_142 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_142 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
happyOut57 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap57 (QualName Name, Loc)
happy_var_1) -> 
        UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedTypeExp -> HappyAbsSyn t99 t100 t101 t102
happyIn47
                 (QualName Name -> SrcLoc -> UncheckedTypeExp
forall d vn. QualName vn -> SrcLoc -> TypeExp d vn
TEVar ((QualName Name, Loc) -> QualName Name
forall a b. (a, b) -> a
fst (QualName Name, Loc)
happy_var_1) (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf ((QualName Name, Loc) -> Loc
forall a b. (a, b) -> b
snd (QualName Name, Loc)
happy_var_1))
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_143 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_143 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_143 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
39# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_143
happyReduction_143 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_143 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn48
                 (let L Loc
_ (CONSTRUCTOR Name
c) = L Token
happy_var_1 in (Name
c, L Token -> Loc
forall a. Located a => a -> Loc
locOf L Token
happy_var_1)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_144 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_144 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_144 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
40# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_144
happyReduction_144 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_144 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap53
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap53
happyOut53 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap53 SizeExp UncheckedExp
happy_var_1) -> 
        TypeArgExp UncheckedExp Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
TypeArgExp UncheckedExp Name -> HappyAbsSyn t99 t100 t101 t102
happyIn49
                 (SizeExp UncheckedExp -> TypeArgExp UncheckedExp Name
forall d vn. SizeExp d -> TypeArgExp d vn
TypeArgExpSize SizeExp UncheckedExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_145 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_145 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_145 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
40# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_145
happyReduction_145 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_145 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap47
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap47
happyOut47 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap47 UncheckedTypeExp
happy_var_1) -> 
        TypeArgExp UncheckedExp Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
TypeArgExp UncheckedExp Name -> HappyAbsSyn t99 t100 t101 t102
happyIn49
                 (UncheckedTypeExp -> TypeArgExp UncheckedExp Name
forall d vn. TypeExp d vn -> TypeArgExp d vn
TypeArgExpType UncheckedTypeExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_146 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_146 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_146 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
41# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_146
happyReduction_146 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_146 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap95
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap95
happyOut95 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap95 L Name
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap40 UncheckedTypeExp
happy_var_3) -> 
        (L Name, UncheckedTypeExp) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(L Name, UncheckedTypeExp) -> HappyAbsSyn t99 t100 t101 t102
happyIn50
                 ((L Name
happy_var_1, UncheckedTypeExp
happy_var_3)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_147 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_147 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_147 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
42# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
happyReduction_147
happyReduction_147 :: HappyAbsSyn t99 t100 t101 t102
happyReduction_147  =  [(L Name, UncheckedTypeExp)] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[(L Name, UncheckedTypeExp)] -> HappyAbsSyn t99 t100 t101 t102
happyIn51
                 ([]
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_148 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_148 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_148 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
42# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_148
happyReduction_148 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_148 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap50
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap50
happyOut50 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap50 (L Name, UncheckedTypeExp)
happy_var_1) -> 
        [(L Name, UncheckedTypeExp)] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[(L Name, UncheckedTypeExp)] -> HappyAbsSyn t99 t100 t101 t102
happyIn51
                 ([(L Name, UncheckedTypeExp)
happy_var_1]
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_149 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_149 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_149 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
42# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_149
happyReduction_149 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_149 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap50
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap50
happyOut50 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap50 (L Name, UncheckedTypeExp)
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap51
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap51
happyOut51 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap51 [(L Name, UncheckedTypeExp)]
happy_var_3) -> 
        [(L Name, UncheckedTypeExp)] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[(L Name, UncheckedTypeExp)] -> HappyAbsSyn t99 t100 t101 t102
happyIn51
                 ((L Name, UncheckedTypeExp)
happy_var_1 (L Name, UncheckedTypeExp)
-> [(L Name, UncheckedTypeExp)] -> [(L Name, UncheckedTypeExp)]
forall a. a -> [a] -> [a]
: [(L Name, UncheckedTypeExp)]
happy_var_3
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_150 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_150 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_150 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
43# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_150
happyReduction_150 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_150 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap40 UncheckedTypeExp
happy_var_1) -> 
        [UncheckedTypeExp] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedTypeExp] -> HappyAbsSyn t99 t100 t101 t102
happyIn52
                 ([UncheckedTypeExp
happy_var_1]
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_151 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_151 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_151 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
43# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
p
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_151
happyReduction_151 :: p
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_151 p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap40 UncheckedTypeExp
happy_var_1) -> 
        [UncheckedTypeExp] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedTypeExp] -> HappyAbsSyn t99 t100 t101 t102
happyIn52
                 ([UncheckedTypeExp
happy_var_1]
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_152 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_152 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_152 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
43# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_152
happyReduction_152 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_152 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap40 UncheckedTypeExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap52
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap52
happyOut52 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap52 [UncheckedTypeExp]
happy_var_3) -> 
        [UncheckedTypeExp] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedTypeExp] -> HappyAbsSyn t99 t100 t101 t102
happyIn52
                 (UncheckedTypeExp
happy_var_1 UncheckedTypeExp -> [UncheckedTypeExp] -> [UncheckedTypeExp]
forall a. a -> [a] -> [a]
: [UncheckedTypeExp]
happy_var_3
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_153 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_153 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_153 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
44# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_153
happyReduction_153 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_153 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LBRACKET) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap58 UncheckedExp
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RBRACKET) -> 
        SizeExp UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SizeExp UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn53
                 (UncheckedExp -> SrcLoc -> SizeExp UncheckedExp
forall d. d -> SrcLoc -> SizeExp d
SizeExp UncheckedExp
happy_var_2 (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_154 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_154 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_154 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
44# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_154
happyReduction_154 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_154 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LBRACKET) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (L Loc
happy_var_2 Token
RBRACKET) -> 
        SizeExp UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SizeExp UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn53
                 (SrcLoc -> SizeExp UncheckedExp
forall d. SrcLoc -> SizeExp d
SizeExpAny (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_155 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_155 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_155 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
44# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_155
happyReduction_155 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_155 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap58 UncheckedExp
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RBRACKET) -> 
        SizeExp UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SizeExp UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn53
                 (UncheckedExp -> SrcLoc -> SizeExp UncheckedExp
forall d. d -> SrcLoc -> SizeExp d
SizeExp UncheckedExp
happy_var_2 (L Token -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan L Token
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_156 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_156 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_156 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
44# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_156
happyReduction_156 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_156 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (L Loc
happy_var_2 Token
RBRACKET) -> 
        SizeExp UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
SizeExp UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn53
                 (SrcLoc -> SizeExp UncheckedExp
forall d. SrcLoc -> SizeExp d
SizeExpAny (L Token -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan L Token
happy_var_1 Loc
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_157 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_157 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_157 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
45# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_157
happyReduction_157 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_157 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap82
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap82
happyOut82 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap82 PatBase NoInfo Name StructType
happy_var_1) -> 
        PatBase NoInfo Name ParamType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name ParamType -> HappyAbsSyn t99 t100 t101 t102
happyIn54
                 ((StructType -> ParamType)
-> PatBase NoInfo Name StructType -> PatBase NoInfo Name ParamType
forall a b.
(a -> b) -> PatBase NoInfo Name a -> PatBase NoInfo Name b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (Diet -> StructType -> ParamType
forall u. Diet -> TypeBase Size u -> ParamType
toParam Diet
Observe) PatBase NoInfo Name StructType
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_158 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_158 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_158 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
46# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_158
happyReduction_158 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_158 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap54
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap54
happyOut54 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap54 PatBase NoInfo Name ParamType
happy_var_1) -> 
        (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
-> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
-> HappyAbsSyn t99 t100 t101 t102
happyIn55
                 ((PatBase NoInfo Name ParamType
happy_var_1, [])
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_159 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_159 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_159 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
46# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_159
happyReduction_159 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_159 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap54
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap54
happyOut54 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap54 PatBase NoInfo Name ParamType
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap55
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap55
happyOut55 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap55 (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
happy_var_2) -> 
        (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
-> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
-> HappyAbsSyn t99 t100 t101 t102
happyIn55
                 ((PatBase NoInfo Name ParamType
happy_var_1, (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
-> PatBase NoInfo Name ParamType
forall a b. (a, b) -> a
fst (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
happy_var_2 PatBase NoInfo Name ParamType
-> [PatBase NoInfo Name ParamType]
-> [PatBase NoInfo Name ParamType]
forall a. a -> [a] -> [a]
: (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
-> [PatBase NoInfo Name ParamType]
forall a b. (a, b) -> b
snd (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_160 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_160 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_160 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
47# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
happyReduction_160
happyReduction_160 :: HappyAbsSyn t99 t100 t101 t102
happyReduction_160  =  [PatBase NoInfo Name ParamType] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[PatBase NoInfo Name ParamType] -> HappyAbsSyn t99 t100 t101 t102
happyIn56
                 ([]
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_161 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_161 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_161 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
47# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_161
happyReduction_161 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_161 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap54
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap54
happyOut54 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap54 PatBase NoInfo Name ParamType
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap56
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap56
happyOut56 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap56 [PatBase NoInfo Name ParamType]
happy_var_2) -> 
        [PatBase NoInfo Name ParamType] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[PatBase NoInfo Name ParamType] -> HappyAbsSyn t99 t100 t101 t102
happyIn56
                 (PatBase NoInfo Name ParamType
happy_var_1 PatBase NoInfo Name ParamType
-> [PatBase NoInfo Name ParamType]
-> [PatBase NoInfo Name ParamType]
forall a. a -> [a] -> [a]
: [PatBase NoInfo Name ParamType]
happy_var_2
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_162 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_162 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_162 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
48# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_162
happyReduction_162 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_162 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn57
                 (let L Loc
vloc (ID Name
v) = L Token
happy_var_1 in ([Name] -> Name -> QualName Name
forall vn. [vn] -> vn -> QualName vn
QualName [] Name
v, Loc
vloc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_163 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_163 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_163 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
48# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_163
happyReduction_163 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_163 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
happyOut57 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap57 (QualName Name, Loc)
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { L Token
happy_var_3 -> 
        (QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(QualName Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn57
                 (let {L Loc
ploc (ID Name
f) = L Token
happy_var_3; (QualName [Name]
qs Name
v,Loc
vloc) = (QualName Name, Loc)
happy_var_1;}
              in ([Name] -> Name -> QualName Name
forall vn. [vn] -> vn -> QualName vn
QualName ([Name]
qs[Name] -> [Name] -> [Name]
forall a. [a] -> [a] -> [a]
++[Name
v]) Name
f, SrcLoc -> Loc
forall a. Located a => a -> Loc
locOf (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
ploc Loc
vloc))
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_164 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_164 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_164 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
49# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_164
happyReduction_164 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_164 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap58 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap40 UncheckedTypeExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn58
                 (UncheckedExp -> UncheckedTypeExp -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
ExpBase f vn -> TypeExp (ExpBase f vn) vn -> SrcLoc -> ExpBase f vn
Ascript UncheckedExp
happy_var_1 UncheckedTypeExp
happy_var_3 (UncheckedExp -> UncheckedTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedTypeExp
happy_var_3)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_165 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_165 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_165 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
49# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_165
happyReduction_165 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_165 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap58 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap40 UncheckedTypeExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn58
                 (UncheckedExp
-> UncheckedTypeExp -> NoInfo StructType -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
ExpBase f vn
-> TypeExp (ExpBase f vn) vn
-> f StructType
-> SrcLoc
-> ExpBase f vn
Coerce UncheckedExp
happy_var_1 UncheckedTypeExp
happy_var_3 NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (UncheckedExp -> UncheckedTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedTypeExp
happy_var_3)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_166 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_166 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_166 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
49# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_166
happyReduction_166 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_166 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn58
                 (UncheckedExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_167 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_167 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_167 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
50# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_167
happyReduction_167 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_167 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap76
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap76
happyOut76 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap76 UncheckedExp
happy_var_1) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59
                 (UncheckedExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_168 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_168 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_168 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
50# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_168
happyReduction_168 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_168 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap77
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap77
happyOut77 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap77 UncheckedExp
happy_var_1) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59
                 (UncheckedExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_169 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_169 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_169 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
50# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_169
happyReduction_169 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_169 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap71
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap71
happyOut71 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap71 UncheckedExp
happy_var_1) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59
                 (UncheckedExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_170 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_170 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_170 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
50# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_170
happyReduction_170 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_170 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap78
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap78
happyOut78 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap78 UncheckedExp
happy_var_1) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59
                 (UncheckedExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_171 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_171 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_171 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
50# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_171
happyReduction_171 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_171 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
ASSERT) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
happyOut62 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap62 UncheckedExp
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
happyOut62 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap62 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59
                 (UncheckedExp
-> UncheckedExp -> NoInfo Text -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
ExpBase f vn -> ExpBase f vn -> f Text -> SrcLoc -> ExpBase f vn
Assert UncheckedExp
happy_var_2 UncheckedExp
happy_var_3 NoInfo Text
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_172 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_172 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_172 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
50# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_172
happyReduction_172 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_172 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
HASH_LBRACKET) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap97
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap97
happyOut97 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap97 AttrInfo Name
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap58 UncheckedExp
happy_var_4) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59
                 (AttrInfo Name -> UncheckedExp -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
AttrInfo vn -> ExpBase f vn -> SrcLoc -> ExpBase f vn
Attr AttrInfo Name
happy_var_2 UncheckedExp
happy_var_4 (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_4)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_173 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_173 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_173 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
50# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_173
happyReduction_173 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_173 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap73
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap73
happyOut73 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap73 UncheckedExp
happy_var_1) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59
                 (UncheckedExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_174 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_174 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_174 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
50# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_174
happyReduction_174 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_174 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap75
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap75
happyOut75 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap75 UncheckedExp
happy_var_1) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59
                 (UncheckedExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_175 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_175 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_175 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
3# Int#
50# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> L Token
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_175
happyReduction_175 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_175 (HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest) p
tk
         = ParserMonad UncheckedExp
-> (UncheckedExp -> ParserMonad (HappyAbsSyn t99 t100 t101 t102))
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (L Loc
happy_var_2 Token
TWO_DOTS) -> 
        ( Loc -> ParserMonad UncheckedExp
forall a. Loc -> ParserMonad a
twoDotsRange Loc
happy_var_2)})
        ) (\UncheckedExp
r -> HappyAbsSyn t99 t100 t101 t102
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59 UncheckedExp
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_176 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_176 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_176 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
3# Int#
50# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> L Token
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_176
happyReduction_176 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_176 (HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest) p
tk
         = ParserMonad UncheckedExp
-> (UncheckedExp -> ParserMonad (HappyAbsSyn t99 t100 t101 t102))
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (L Loc
happy_var_2 Token
TWO_DOTS) -> 
        ( Loc -> ParserMonad UncheckedExp
forall a. Loc -> ParserMonad a
twoDotsRange Loc
happy_var_2)})
        ) (\UncheckedExp
r -> HappyAbsSyn t99 t100 t101 t102
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59 UncheckedExp
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_177 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_177 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_177 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
50# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_177
happyReduction_177 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_177 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
NEGATE) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap59 UncheckedExp
happy_var_2) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59
                 (UncheckedExp -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn. ExpBase f vn -> SrcLoc -> ExpBase f vn
Negate UncheckedExp
happy_var_2 (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_178 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_178 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_178 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
50# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_178
happyReduction_178 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_178 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
BANG) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap59 UncheckedExp
happy_var_2) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59
                 (UncheckedExp -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn. ExpBase f vn -> SrcLoc -> ExpBase f vn
Not UncheckedExp
happy_var_2 (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_179 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_179 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_179 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
50# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_179
happyReduction_179 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_179 (HappyAbsSyn t99 t100 t101 t102
happy_x_7 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap93
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap93
happyOut93 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap93 [UncheckedDimIndex]
happy_var_4) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_7 of { (HappyWrap59 UncheckedExp
happy_var_7) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59
                 (UncheckedExp
-> [UncheckedDimIndex] -> UncheckedExp -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
ExpBase f vn
-> SliceBase f vn -> ExpBase f vn -> SrcLoc -> ExpBase f vn
Update UncheckedExp
happy_var_1 [UncheckedDimIndex]
happy_var_4 UncheckedExp
happy_var_7 (UncheckedExp -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_7)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_180 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_180 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_180 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
50# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_180
happyReduction_180 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_180 (HappyAbsSyn t99 t100 t101 t102
happy_x_7 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap93
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap93
happyOut93 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap93 [UncheckedDimIndex]
happy_var_4) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_7 of { (HappyWrap59 UncheckedExp
happy_var_7) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59
                 (UncheckedExp
-> [UncheckedDimIndex] -> UncheckedExp -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
ExpBase f vn
-> SliceBase f vn -> ExpBase f vn -> SrcLoc -> ExpBase f vn
Update UncheckedExp
happy_var_1 [UncheckedDimIndex]
happy_var_4 UncheckedExp
happy_var_7 (UncheckedExp -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_7)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_181 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_181 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_181 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
50# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_181
happyReduction_181 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_181 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap68
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap68
happyOut68 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap68 [L Name]
happy_var_3) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (HappyWrap59 UncheckedExp
happy_var_5) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59
                 (UncheckedExp
-> [Name]
-> UncheckedExp
-> NoInfo StructType
-> SrcLoc
-> UncheckedExp
forall (f :: * -> *) vn.
ExpBase f vn
-> [Name] -> ExpBase f vn -> f StructType -> SrcLoc -> ExpBase f vn
RecordUpdate UncheckedExp
happy_var_1 ((L Name -> Name) -> [L Name] -> [Name]
forall a b. (a -> b) -> [a] -> [b]
map L Name -> Name
forall a. L a -> a
unLoc [L Name]
happy_var_3) UncheckedExp
happy_var_5 NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (UncheckedExp -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_5)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_182 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_182 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_182 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
1# Int#
50# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> L Token
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_182
happyReduction_182 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_182 (HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest) p
tk
         = ParserMonad UncheckedExp
-> (UncheckedExp -> ParserMonad (HappyAbsSyn t99 t100 t101 t102))
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap60
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap60
happyOut60 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap60 NonEmpty UncheckedExp
happy_var_1) -> 
        ( NonEmpty UncheckedExp -> ParserMonad UncheckedExp
applyExp NonEmpty UncheckedExp
happy_var_1)})
        ) (\UncheckedExp
r -> HappyAbsSyn t99 t100 t101 t102
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn59 UncheckedExp
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_183 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_183 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_183 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
51# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_183
happyReduction_183 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_183 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
happyOut62 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap62 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap60
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap60
happyOut60 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap60 NonEmpty UncheckedExp
happy_var_2) -> 
        NonEmpty UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
NonEmpty UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn60
                 (UncheckedExp -> NonEmpty UncheckedExp -> NonEmpty UncheckedExp
forall a. a -> NonEmpty a -> NonEmpty a
NE.cons UncheckedExp
happy_var_1 NonEmpty UncheckedExp
happy_var_2
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_184 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_184 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_184 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
51# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_184
happyReduction_184 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_184 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap61
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap61
happyOut61 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap61 UncheckedExp
happy_var_1) -> 
        NonEmpty UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
NonEmpty UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn60
                 (UncheckedExp -> NonEmpty UncheckedExp
forall a. a -> NonEmpty a
NE.singleton UncheckedExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_185 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_185 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_185 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
52# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp))
-> HappyStk (HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp))
happyReduction_185
happyReduction_185 :: HappyStk (HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp))
-> HappyStk (HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp))
happyReduction_185 (HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp)
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp)
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp)
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp)
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp)
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp))
happyRest)
         = case HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp) -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp)
happy_x_1 of { (L Loc
happy_var_1 Token
BACKSLASH) -> 
        case HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp) -> HappyWrap55
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap55
happyOut55 HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp)
happy_x_2 of { (HappyWrap55 (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp)
-> Maybe UncheckedTypeExp
forall {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k) t102.
HappyAbsSyn t99 t100 t101 t102 -> t102
happyOut102 HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp)
happy_x_3 of { Maybe UncheckedTypeExp
happy_var_3 -> 
        case HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp) -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp)
happy_x_5 of { (HappyWrap58 UncheckedExp
happy_var_5) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn61
                 ([PatBase NoInfo Name ParamType]
-> UncheckedExp
-> Maybe UncheckedTypeExp
-> NoInfo ResRetType
-> SrcLoc
-> UncheckedExp
forall (f :: * -> *) vn.
[PatBase f vn ParamType]
-> ExpBase f vn
-> Maybe (TypeExp (ExpBase f vn) vn)
-> f ResRetType
-> SrcLoc
-> ExpBase f vn
Lambda ((PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
-> PatBase NoInfo Name ParamType
forall a b. (a, b) -> a
fst (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
happy_var_2 PatBase NoInfo Name ParamType
-> [PatBase NoInfo Name ParamType]
-> [PatBase NoInfo Name ParamType]
forall a. a -> [a] -> [a]
: (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
-> [PatBase NoInfo Name ParamType]
forall a b. (a, b) -> b
snd (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
happy_var_2) UncheckedExp
happy_var_5 Maybe UncheckedTypeExp
happy_var_3 NoInfo ResRetType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_5)
        ) HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp)
-> HappyStk (HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp))
-> HappyStk (HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp))
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp))
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_186 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_186 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_186 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
52# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_186
happyReduction_186 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_186 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
happyOut62 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap62 UncheckedExp
happy_var_1) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn61
                 (UncheckedExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_187 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_187 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_187 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_187
happyReduction_187 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_187 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap64
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap64
happyOut64 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap64 (PrimValue, Loc)
happy_var_1) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 (PrimValue -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn. PrimValue -> SrcLoc -> ExpBase f vn
Literal ((PrimValue, Loc) -> PrimValue
forall a b. (a, b) -> a
fst (PrimValue, Loc)
happy_var_1) (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf ((PrimValue, Loc) -> Loc
forall a b. (a, b) -> b
snd (PrimValue, Loc)
happy_var_1))
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_188 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_188 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_188 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_188
happyReduction_188 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_188 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap48
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap48
happyOut48 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap48 (Name, Loc)
happy_var_1) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 (Name
-> [UncheckedExp] -> NoInfo StructType -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
Name -> [ExpBase f vn] -> f StructType -> SrcLoc -> ExpBase f vn
Constr ((Name, Loc) -> Name
forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1) [] NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf ((Name, Loc) -> Loc
forall a b. (a, b) -> b
snd (Name, Loc)
happy_var_1))
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_189 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_189 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_189 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_189
happyReduction_189 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_189 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 (let L Loc
loc (CHARLIT Char
x) = L Token
happy_var_1
                        in Integer -> NoInfo StructType -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
Integer -> f StructType -> SrcLoc -> ExpBase f vn
IntLit (Int -> Integer
forall a. Integral a => a -> Integer
toInteger (Char -> Int
ord Char
x)) NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_190 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_190 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_190 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_190
happyReduction_190 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_190 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 (let L Loc
loc (INTLIT Integer
x) = L Token
happy_var_1 in Integer -> NoInfo StructType -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
Integer -> f StructType -> SrcLoc -> ExpBase f vn
IntLit Integer
x NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_191 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_191 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_191 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_191
happyReduction_191 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_191 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 (let L Loc
loc (NATLIT Name
_ Integer
x) = L Token
happy_var_1 in Integer -> NoInfo StructType -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
Integer -> f StructType -> SrcLoc -> ExpBase f vn
IntLit Integer
x NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_192 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_192 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_192 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_192
happyReduction_192 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_192 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 (let L Loc
loc (FLOATLIT Double
x) = L Token
happy_var_1 in Double -> NoInfo StructType -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
Double -> f StructType -> SrcLoc -> ExpBase f vn
FloatLit Double
x NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_193 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_193 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_193 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_193
happyReduction_193 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_193 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 (let L Loc
loc (STRINGLIT Text
s) = L Token
happy_var_1 in
                        [Word8] -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn. [Word8] -> SrcLoc -> ExpBase f vn
StringLit (ByteString -> [Word8]
BS.unpack (Text -> ByteString
T.encodeUtf8 Text
s)) (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_194 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_194 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_194 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_194
happyReduction_194 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_194 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
HOLE) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 (NoInfo StructType -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn. f StructType -> SrcLoc -> ExpBase f vn
Hole NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
happy_var_1)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_195 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_195 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_195 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_195
happyReduction_195 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_195 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap58 UncheckedExp
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 (UncheckedExp -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn. ExpBase f vn -> SrcLoc -> ExpBase f vn
Parens UncheckedExp
happy_var_2 (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_196 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_196 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_196 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
53# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_196
happyReduction_196 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_196 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap58 UncheckedExp
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap65
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap65
happyOut65 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap65 [UncheckedExp]
happy_var_4) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (L Loc
happy_var_5 Token
RPAR) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 ([UncheckedExp] -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn. [ExpBase f vn] -> SrcLoc -> ExpBase f vn
TupLit (UncheckedExp
happy_var_2 UncheckedExp -> [UncheckedExp] -> [UncheckedExp]
forall a. a -> [a] -> [a]
: [UncheckedExp]
happy_var_4) (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_5)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_197 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_197 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_197 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_197
happyReduction_197 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_197 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (L Loc
happy_var_2 Token
RPAR) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 ([UncheckedExp] -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn. [ExpBase f vn] -> SrcLoc -> ExpBase f vn
TupLit [] (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_198 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_198 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_198 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_198
happyReduction_198 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_198 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LBRACKET) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap65
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap65
happyOut65 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap65 [UncheckedExp]
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RBRACKET) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 ([UncheckedExp] -> SrcLoc -> UncheckedExp
arrayLitExp [UncheckedExp]
happy_var_2 (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_199 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_199 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_199 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_199
happyReduction_199 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_199 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LBRACKET) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (L Loc
happy_var_2 Token
RBRACKET) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 ([UncheckedExp] -> SrcLoc -> UncheckedExp
arrayLitExp [] (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_200 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_200 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_200 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_200
happyReduction_200 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_200 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 (let L Loc
loc (ID Name
v)  = L Token
happy_var_1 in QualName Name -> NoInfo StructType -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
QualName vn -> f StructType -> SrcLoc -> ExpBase f vn
Var ([Name] -> Name -> QualName Name
forall vn. [vn] -> vn -> QualName vn
QualName [] Name
v) NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_201 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_201 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_201 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_201
happyReduction_201 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_201 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
happyOut62 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap62 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { L Token
happy_var_3 -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 (let L Loc
ploc (ID Name
f) = L Token
happy_var_3
         in case UncheckedExp
happy_var_1 of
              Var (QualName [Name]
qs Name
v) NoInfo StructType
NoInfo SrcLoc
vloc ->
                QualName Name -> NoInfo StructType -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
QualName vn -> f StructType -> SrcLoc -> ExpBase f vn
Var ([Name] -> Name -> QualName Name
forall vn. [vn] -> vn -> QualName vn
QualName ([Name]
qs[Name] -> [Name] -> [Name]
forall a. [a] -> [a] -> [a]
++[Name
v]) Name
f) NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (SrcLoc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan SrcLoc
vloc Loc
ploc)
              UncheckedExp
_ ->
                Name -> UncheckedExp -> NoInfo StructType -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
Name -> ExpBase f vn -> f StructType -> SrcLoc -> ExpBase f vn
Project Name
f UncheckedExp
happy_var_1 NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (UncheckedExp -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 Loc
ploc)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_202 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_202 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_202 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_202
happyReduction_202 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_202 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
happyOut62 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap62 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { L Token
happy_var_3 -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 (let L Loc
ploc (NATLIT Name
f Integer
_) = L Token
happy_var_3
         in Name -> UncheckedExp -> NoInfo StructType -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
Name -> ExpBase f vn -> f StructType -> SrcLoc -> ExpBase f vn
Project Name
f UncheckedExp
happy_var_1 NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (UncheckedExp -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 Loc
ploc)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_203 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_203 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_203 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
5# Int#
53# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> L Token
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_203
happyReduction_203 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_203 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest) p
tk
         = ParserMonad UncheckedExp
-> (UncheckedExp -> ParserMonad (HappyAbsSyn t99 t100 t101 t102))
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
happyOut62 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap62 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap58 UncheckedExp
happy_var_4) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (L Loc
happy_var_5 Token
RPAR) -> 
        ( case UncheckedExp
happy_var_1 of
            Var QualName Name
qn NoInfo StructType
NoInfo SrcLoc
vloc ->
              UncheckedExp -> ParserMonad UncheckedExp
forall a. a -> ExceptT SyntaxError (State ParserState) a
forall (f :: * -> *) a. Applicative f => a -> f a
pure ((QualName Name, SrcLoc) -> UncheckedExp -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
(QualName vn, SrcLoc) -> ExpBase f vn -> SrcLoc -> ExpBase f vn
QualParens (QualName Name
qn, SrcLoc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf SrcLoc
vloc) UncheckedExp
happy_var_4 (SrcLoc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan SrcLoc
vloc Loc
happy_var_5))
            UncheckedExp
_ ->
              Loc -> Maybe Text -> ParserMonad UncheckedExp
forall loc a. Located loc => loc -> Maybe Text -> ParserMonad a
parseErrorAt Loc
happy_var_3 (Text -> Maybe Text
forall a. a -> Maybe a
Just Text
"Can only locally open module names, not arbitrary expressions"))}}}})
        ) (\UncheckedExp
r -> HappyAbsSyn t99 t100 t101 t102
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62 UncheckedExp
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_204 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_204 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_204 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
53# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_204
happyReduction_204 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_204 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap62
happyOut62 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap62 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap93
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap93
happyOut93 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap93 [UncheckedDimIndex]
happy_var_3) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (L Loc
happy_var_4 Token
RBRACKET) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 (AppExpBase NoInfo Name -> NoInfo AppRes -> UncheckedExp
forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (UncheckedExp
-> [UncheckedDimIndex] -> SrcLoc -> AppExpBase NoInfo Name
forall (f :: * -> *) vn.
ExpBase f vn -> SliceBase f vn -> SrcLoc -> AppExpBase f vn
Index UncheckedExp
happy_var_1 [UncheckedDimIndex]
happy_var_3 (UncheckedExp -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 Loc
happy_var_4)) NoInfo AppRes
forall {k} (a :: k). NoInfo a
NoInfo
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_205 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_205 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_205 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_205
happyReduction_205 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_205 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LCURLY) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap70
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap70
happyOut70 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap70 [FieldBase NoInfo Name]
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RCURLY) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 ([FieldBase NoInfo Name] -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn. [FieldBase f vn] -> SrcLoc -> ExpBase f vn
RecordLit [FieldBase NoInfo Name]
happy_var_2 (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_206 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_206 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_206 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
53# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_206
happyReduction_206 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_206 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap74
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap74
happyOut74 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap74 UncheckedExp
happy_var_1) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn62
                 (UncheckedExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_207 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_207 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_207 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
54# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_207
happyReduction_207 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_207 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn63
                 (let L Loc
loc (I8LIT Int8
num)  = L Token
happy_var_1 in (IntValue -> PrimValue
SignedValue (IntValue -> PrimValue) -> IntValue -> PrimValue
forall a b. (a -> b) -> a -> b
$ Int8 -> IntValue
Int8Value Int8
num, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_208 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_208 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_208 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
54# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_208
happyReduction_208 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_208 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn63
                 (let L Loc
loc (I16LIT Int16
num) = L Token
happy_var_1 in (IntValue -> PrimValue
SignedValue (IntValue -> PrimValue) -> IntValue -> PrimValue
forall a b. (a -> b) -> a -> b
$ Int16 -> IntValue
Int16Value Int16
num, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_209 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_209 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_209 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
54# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_209
happyReduction_209 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_209 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn63
                 (let L Loc
loc (I32LIT Int32
num) = L Token
happy_var_1 in (IntValue -> PrimValue
SignedValue (IntValue -> PrimValue) -> IntValue -> PrimValue
forall a b. (a -> b) -> a -> b
$ Int32 -> IntValue
Int32Value Int32
num, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_210 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_210 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_210 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
54# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_210
happyReduction_210 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_210 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn63
                 (let L Loc
loc (I64LIT Int64
num) = L Token
happy_var_1 in (IntValue -> PrimValue
SignedValue (IntValue -> PrimValue) -> IntValue -> PrimValue
forall a b. (a -> b) -> a -> b
$ Int64 -> IntValue
Int64Value Int64
num, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_211 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_211 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_211 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
54# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_211
happyReduction_211 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_211 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn63
                 (let L Loc
loc (U8LIT Word8
num)  = L Token
happy_var_1 in (IntValue -> PrimValue
UnsignedValue (IntValue -> PrimValue) -> IntValue -> PrimValue
forall a b. (a -> b) -> a -> b
$ Int8 -> IntValue
Int8Value (Int8 -> IntValue) -> Int8 -> IntValue
forall a b. (a -> b) -> a -> b
$ Word8 -> Int8
forall a b. (Integral a, Num b) => a -> b
fromIntegral Word8
num, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_212 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_212 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_212 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
54# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_212
happyReduction_212 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_212 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn63
                 (let L Loc
loc (U16LIT Word16
num) = L Token
happy_var_1 in (IntValue -> PrimValue
UnsignedValue (IntValue -> PrimValue) -> IntValue -> PrimValue
forall a b. (a -> b) -> a -> b
$ Int16 -> IntValue
Int16Value (Int16 -> IntValue) -> Int16 -> IntValue
forall a b. (a -> b) -> a -> b
$ Word16 -> Int16
forall a b. (Integral a, Num b) => a -> b
fromIntegral Word16
num, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_213 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_213 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_213 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
54# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_213
happyReduction_213 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_213 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn63
                 (let L Loc
loc (U32LIT Word32
num) = L Token
happy_var_1 in (IntValue -> PrimValue
UnsignedValue (IntValue -> PrimValue) -> IntValue -> PrimValue
forall a b. (a -> b) -> a -> b
$ Int32 -> IntValue
Int32Value (Int32 -> IntValue) -> Int32 -> IntValue
forall a b. (a -> b) -> a -> b
$ Word32 -> Int32
forall a b. (Integral a, Num b) => a -> b
fromIntegral Word32
num, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_214 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_214 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_214 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
54# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_214
happyReduction_214 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_214 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn63
                 (let L Loc
loc (U64LIT Word64
num) = L Token
happy_var_1 in (IntValue -> PrimValue
UnsignedValue (IntValue -> PrimValue) -> IntValue -> PrimValue
forall a b. (a -> b) -> a -> b
$ Int64 -> IntValue
Int64Value (Int64 -> IntValue) -> Int64 -> IntValue
forall a b. (a -> b) -> a -> b
$ Word64 -> Int64
forall a b. (Integral a, Num b) => a -> b
fromIntegral Word64
num, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_215 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_215 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_215 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
54# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_215
happyReduction_215 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_215 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn63
                 (let L Loc
loc (F16LIT Half
num) = L Token
happy_var_1 in (FloatValue -> PrimValue
FloatValue (FloatValue -> PrimValue) -> FloatValue -> PrimValue
forall a b. (a -> b) -> a -> b
$ Half -> FloatValue
Float16Value Half
num, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_216 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_216 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_216 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
54# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_216
happyReduction_216 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_216 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn63
                 (let L Loc
loc (F32LIT Float
num) = L Token
happy_var_1 in (FloatValue -> PrimValue
FloatValue (FloatValue -> PrimValue) -> FloatValue -> PrimValue
forall a b. (a -> b) -> a -> b
$ Float -> FloatValue
Float32Value Float
num, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_217 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_217 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_217 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
54# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_217
happyReduction_217 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_217 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn63
                 (let L Loc
loc (F64LIT Double
num) = L Token
happy_var_1 in (FloatValue -> PrimValue
FloatValue (FloatValue -> PrimValue) -> FloatValue -> PrimValue
forall a b. (a -> b) -> a -> b
$ Double -> FloatValue
Float64Value Double
num, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_218 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_218 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_218 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
55# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_218
happyReduction_218 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_218 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
TRUE) -> 
        (PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn64
                 ((Bool -> PrimValue
BoolValue Bool
True, Loc
happy_var_1)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_219 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_219 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_219 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
55# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_219
happyReduction_219 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_219 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
FALSE) -> 
        (PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn64
                 ((Bool -> PrimValue
BoolValue Bool
False, Loc
happy_var_1)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_220 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_220 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_220 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
55# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_220
happyReduction_220 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_220 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap63
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap63
happyOut63 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap63 (PrimValue, Loc)
happy_var_1) -> 
        (PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PrimValue, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn64
                 ((PrimValue, Loc)
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_221 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_221 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_221 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
56# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_221
happyReduction_221 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_221 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap66
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap66
happyOut66 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap66 [UncheckedExp]
happy_var_1) -> 
        [UncheckedExp] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedExp] -> HappyAbsSyn t99 t100 t101 t102
happyIn65
                 ([UncheckedExp] -> [UncheckedExp]
forall a. [a] -> [a]
reverse [UncheckedExp]
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_222 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_222 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_222 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
57# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_222
happyReduction_222 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_222 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap66
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap66
happyOut66 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap66 [UncheckedExp]
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap58 UncheckedExp
happy_var_3) -> 
        [UncheckedExp] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedExp] -> HappyAbsSyn t99 t100 t101 t102
happyIn66
                 (UncheckedExp
happy_var_3 UncheckedExp -> [UncheckedExp] -> [UncheckedExp]
forall a. a -> [a] -> [a]
: [UncheckedExp]
happy_var_1
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_223 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_223 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_223 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
57# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
p
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_223
happyReduction_223 :: p
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_223 p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap66
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap66
happyOut66 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap66 [UncheckedExp]
happy_var_1) -> 
        [UncheckedExp] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedExp] -> HappyAbsSyn t99 t100 t101 t102
happyIn66
                 ([UncheckedExp]
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_224 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_224 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_224 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
57# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_224
happyReduction_224 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_224 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap58 UncheckedExp
happy_var_1) -> 
        [UncheckedExp] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedExp] -> HappyAbsSyn t99 t100 t101 t102
happyIn66
                 ([UncheckedExp
happy_var_1]
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_225 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_225 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_225 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
58# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_225
happyReduction_225 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_225 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        p
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap95
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap95
happyOut95 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap95 L Name
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap67
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap67
happyOut67 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap67 [L Name]
happy_var_3) -> 
        [L Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[L Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn67
                 (L Name
happy_var_2 L Name -> [L Name] -> [L Name]
forall a. a -> [a] -> [a]
: [L Name]
happy_var_3
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_226 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_226 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_226 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
58# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
happyReduction_226
happyReduction_226 :: HappyAbsSyn t99 t100 t101 t102
happyReduction_226  =  [L Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[L Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn67
                 ([]
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_227 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_227 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_227 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
59# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_227
happyReduction_227 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_227 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap95
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap95
happyOut95 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap95 L Name
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap67
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap67
happyOut67 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap67 [L Name]
happy_var_2) -> 
        [L Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[L Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn68
                 (L Name
happy_var_1 L Name -> [L Name] -> [L Name]
forall a. a -> [a] -> [a]
: [L Name]
happy_var_2
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_228 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_228 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_228 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
60# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_228
happyReduction_228 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_228 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap95
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap95
happyOut95 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap95 L Name
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap58 UncheckedExp
happy_var_3) -> 
        FieldBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
FieldBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn69
                 (L Name -> UncheckedExp -> SrcLoc -> FieldBase NoInfo Name
forall (f :: * -> *) vn.
L Name -> ExpBase f vn -> SrcLoc -> FieldBase f vn
RecordFieldExplicit L Name
happy_var_1 UncheckedExp
happy_var_3 (L Name -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan L Name
happy_var_1 UncheckedExp
happy_var_3)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_229 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_229 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_229 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
60# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_229
happyReduction_229 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_229 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        FieldBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
FieldBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn69
                 (let L Loc
loc (ID Name
s) = L Token
happy_var_1 in L Name -> NoInfo StructType -> SrcLoc -> FieldBase NoInfo Name
forall (f :: * -> *) vn.
L vn -> f StructType -> SrcLoc -> FieldBase f vn
RecordFieldImplicit (Loc -> Name -> L Name
forall a. Loc -> a -> L a
L Loc
loc Name
s) NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_230 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_230 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_230 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_230
happyReduction_230 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_230 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap69
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap69
happyOut69 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap69 FieldBase NoInfo Name
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap70
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap70
happyOut70 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap70 [FieldBase NoInfo Name]
happy_var_3) -> 
        [FieldBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[FieldBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn70
                 (FieldBase NoInfo Name
happy_var_1 FieldBase NoInfo Name
-> [FieldBase NoInfo Name] -> [FieldBase NoInfo Name]
forall a. a -> [a] -> [a]
: [FieldBase NoInfo Name]
happy_var_3
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_231 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_231 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_231 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
61# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_231
happyReduction_231 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_231 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap69
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap69
happyOut69 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap69 FieldBase NoInfo Name
happy_var_1) -> 
        [FieldBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[FieldBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn70
                 ([FieldBase NoInfo Name
happy_var_1]
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_232 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_232 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_232 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
61# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
happyReduction_232
happyReduction_232 :: HappyAbsSyn t99 t100 t101 t102
happyReduction_232  =  [FieldBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[FieldBase NoInfo Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn70
                 ([]
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_233 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_233 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_233 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
6# Int#
62# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_233
happyReduction_233 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_233 (HappyAbsSyn t99 t100 t101 t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LET) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap30
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap30
happyOut30 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap30 [SizeBinder Name]
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
happyOut81 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap81 PatBase NoInfo Name StructType
happy_var_3) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (HappyWrap58 UncheckedExp
happy_var_5) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap72
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap72
happyOut72 HappyAbsSyn t99 t100 t101 t102
happy_x_6 of { (HappyWrap72 UncheckedExp
happy_var_6) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn71
                 (AppExpBase NoInfo Name -> NoInfo AppRes -> UncheckedExp
forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp ([SizeBinder Name]
-> PatBase NoInfo Name StructType
-> UncheckedExp
-> UncheckedExp
-> SrcLoc
-> AppExpBase NoInfo Name
forall (f :: * -> *) vn.
[SizeBinder vn]
-> PatBase f vn StructType
-> ExpBase f vn
-> ExpBase f vn
-> SrcLoc
-> AppExpBase f vn
LetPat [SizeBinder Name]
happy_var_2 PatBase NoInfo Name StructType
happy_var_3 UncheckedExp
happy_var_5 UncheckedExp
happy_var_6 (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_6)) NoInfo AppRes
forall {k} (a :: k). NoInfo a
NoInfo
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_234 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_234 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_234 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
62# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_234
happyReduction_234 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_234 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LET) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
happyOut81 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap81 PatBase NoInfo Name StructType
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap58 UncheckedExp
happy_var_4) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap72
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap72
happyOut72 HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (HappyWrap72 UncheckedExp
happy_var_5) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn71
                 (AppExpBase NoInfo Name -> NoInfo AppRes -> UncheckedExp
forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp ([SizeBinder Name]
-> PatBase NoInfo Name StructType
-> UncheckedExp
-> UncheckedExp
-> SrcLoc
-> AppExpBase NoInfo Name
forall (f :: * -> *) vn.
[SizeBinder vn]
-> PatBase f vn StructType
-> ExpBase f vn
-> ExpBase f vn
-> SrcLoc
-> AppExpBase f vn
LetPat [] PatBase NoInfo Name StructType
happy_var_2 UncheckedExp
happy_var_4 UncheckedExp
happy_var_5 (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_5)) NoInfo AppRes
forall {k} (a :: k). NoInfo a
NoInfo
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_235 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_235 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_235 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
8# Int#
62# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {t99 :: k} {t100 :: k} {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyReduction_235
happyReduction_235 :: HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyReduction_235 (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_8 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_7 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyRest)
         = case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_1 of { (L Loc
happy_var_1 Token
LET) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap34
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap34
happyOut34 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_3 of { (HappyWrap34 [TypeParamBase Name]
happy_var_3) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap55
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap55
happyOut55 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_4 of { (HappyWrap55 (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
happy_var_4) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
-> Maybe UncheckedTypeExp
forall {k} {k} {k} (t99 :: k) (t100 :: k) t101 (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> t101
happyOut101 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_5 of { Maybe UncheckedTypeExp
happy_var_5 -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_7 of { (HappyWrap58 UncheckedExp
happy_var_7) -> 
        case HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102 -> HappyWrap72
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap72
happyOut72 HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happy_x_8 of { (HappyWrap72 UncheckedExp
happy_var_8) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn71
                 (let L Loc
_ (ID Name
name) = L Token
happy_var_2
         in AppExpBase NoInfo Name -> NoInfo AppRes -> UncheckedExp
forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (Name
-> ([TypeParamBase Name], [PatBase NoInfo Name ParamType],
    Maybe UncheckedTypeExp, NoInfo ResRetType, UncheckedExp)
-> UncheckedExp
-> SrcLoc
-> AppExpBase NoInfo Name
forall (f :: * -> *) vn.
vn
-> ([TypeParamBase vn], [PatBase f vn ParamType],
    Maybe (TypeExp (ExpBase f vn) vn), f ResRetType, ExpBase f vn)
-> ExpBase f vn
-> SrcLoc
-> AppExpBase f vn
LetFun Name
name ([TypeParamBase Name]
happy_var_3, (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
-> PatBase NoInfo Name ParamType
forall a b. (a, b) -> a
fst (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
happy_var_4 PatBase NoInfo Name ParamType
-> [PatBase NoInfo Name ParamType]
-> [PatBase NoInfo Name ParamType]
forall a. a -> [a] -> [a]
: (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
-> [PatBase NoInfo Name ParamType]
forall a b. (a, b) -> b
snd (PatBase NoInfo Name ParamType, [PatBase NoInfo Name ParamType])
happy_var_4, Maybe UncheckedTypeExp
happy_var_5, NoInfo ResRetType
forall {k} (a :: k). NoInfo a
NoInfo, UncheckedExp
happy_var_7)
                    UncheckedExp
happy_var_8 (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_8))
                   NoInfo AppRes
forall {k} (a :: k). NoInfo a
NoInfo
        ) HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
-> HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102)
happyRest}}}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_236 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_236 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_236 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
8# Int#
62# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_236
happyReduction_236 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_236 (HappyAbsSyn t99 t100 t101 t102
happy_x_8 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_7 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LET) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap93
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap93
happyOut93 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap93 [UncheckedDimIndex]
happy_var_4) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_7 of { (HappyWrap58 UncheckedExp
happy_var_7) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap72
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap72
happyOut72 HappyAbsSyn t99 t100 t101 t102
happy_x_8 of { (HappyWrap72 UncheckedExp
happy_var_8) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn71
                 (let L Loc
vloc (ID Name
v) = L Token
happy_var_2; ident :: IdentBase NoInfo Name t
ident = Name -> NoInfo t -> SrcLoc -> IdentBase NoInfo Name t
forall {k} (f :: k -> *) vn (t :: k).
vn -> f t -> SrcLoc -> IdentBase f vn t
Ident Name
v NoInfo t
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
vloc)
         in AppExpBase NoInfo Name -> NoInfo AppRes -> UncheckedExp
forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (IdentBase NoInfo Name StructType
-> IdentBase NoInfo Name StructType
-> [UncheckedDimIndex]
-> UncheckedExp
-> UncheckedExp
-> SrcLoc
-> AppExpBase NoInfo Name
forall (f :: * -> *) vn.
IdentBase f vn StructType
-> IdentBase f vn StructType
-> SliceBase f vn
-> ExpBase f vn
-> ExpBase f vn
-> SrcLoc
-> AppExpBase f vn
LetWith IdentBase NoInfo Name StructType
forall {k} {t :: k}. IdentBase NoInfo Name t
ident IdentBase NoInfo Name StructType
forall {k} {t :: k}. IdentBase NoInfo Name t
ident [UncheckedDimIndex]
happy_var_4 UncheckedExp
happy_var_7 UncheckedExp
happy_var_8 (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_8)) NoInfo AppRes
forall {k} (a :: k). NoInfo a
NoInfo
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_237 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_237 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_237 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
63# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p -> HappyAbsSyn t99 t100 t101 t102
happyReduction_237
happyReduction_237 :: HappyAbsSyn t99 t100 t101 t102
-> p -> HappyAbsSyn t99 t100 t101 t102
happyReduction_237 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        p
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap58 UncheckedExp
happy_var_2) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn72
                 (UncheckedExp
happy_var_2
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_238 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_238 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_238 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
63# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_238
happyReduction_238 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_238 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap71
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap71
happyOut71 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap71 UncheckedExp
happy_var_1) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn72
                 (UncheckedExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_239 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_239 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_239 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
1# Int#
63# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> L Token
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_239
happyReduction_239 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_239 (HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest) p
tk
         = ParserMonad UncheckedExp
-> (UncheckedExp -> ParserMonad (HappyAbsSyn t99 t100 t101 t102))
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
DEF) -> 
        ( Loc -> Maybe Text -> ParserMonad UncheckedExp
forall loc a. Located loc => loc -> Maybe Text -> ParserMonad a
parseErrorAt Loc
happy_var_1 (Text -> Maybe Text
forall a. a -> Maybe a
Just Text
"Unexpected \"def\" - missing \"in\"?"))})
        ) (\UncheckedExp
r -> HappyAbsSyn t99 t100 t101 t102
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn72 UncheckedExp
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_240 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_240 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_240 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
1# Int#
63# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> L Token
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_240
happyReduction_240 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_240 (HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest) p
tk
         = ParserMonad UncheckedExp
-> (UncheckedExp -> ParserMonad (HappyAbsSyn t99 t100 t101 t102))
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
TYPE) -> 
        ( Loc -> Maybe Text -> ParserMonad UncheckedExp
forall loc a. Located loc => loc -> Maybe Text -> ParserMonad a
parseErrorAt Loc
happy_var_1 (Text -> Maybe Text
forall a. a -> Maybe a
Just Text
"Unexpected \"type\" - missing \"in\"?"))})
        ) (\UncheckedExp
r -> HappyAbsSyn t99 t100 t101 t102
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn72 UncheckedExp
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_241 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_241 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_241 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
1# Int#
63# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> L Token
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_241
happyReduction_241 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> p -> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
happyReduction_241 (HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest) p
tk
         = ParserMonad UncheckedExp
-> (UncheckedExp -> ParserMonad (HappyAbsSyn t99 t100 t101 t102))
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
MODULE) -> 
        ( Loc -> Maybe Text -> ParserMonad UncheckedExp
forall loc a. Located loc => loc -> Maybe Text -> ParserMonad a
parseErrorAt Loc
happy_var_1 (Text -> Maybe Text
forall a. a -> Maybe a
Just Text
"Unexpected \"module\" - missing \"in\"?"))})
        ) (\UncheckedExp
r -> HappyAbsSyn t99 t100 t101 t102
-> ParserMonad (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn72 UncheckedExp
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_242 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_242 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_242 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_242
happyReduction_242 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_242 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_243 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_243 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_243 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_243
happyReduction_243 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_243 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_244 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_244 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_244 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_244
happyReduction_244 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_244 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (L Loc
happy_var_2 Token
NEGATE) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 (Loc -> Token -> L Token
forall a. Loc -> a -> L a
L Loc
happy_var_2 (BinOp -> [Name] -> Name -> Token
SYMBOL BinOp
Minus [] (String -> Name
nameFromString String
"-"))) UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_245 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_245 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_245 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_245
happyReduction_245 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_245 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_246 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_246 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_246 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_246
happyReduction_246 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_246 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (L Loc
happy_var_2 Token
ASTERISK) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 (Loc -> Token -> L Token
forall a. Loc -> a -> L a
L Loc
happy_var_2 (BinOp -> [Name] -> Name -> Token
SYMBOL BinOp
Times [] (String -> Name
nameFromString String
"*"))) UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_247 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_247 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_247 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_247
happyReduction_247 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_247 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_248 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_248 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_248 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_248
happyReduction_248 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_248 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_249 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_249 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_249 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_249
happyReduction_249 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_249 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_250 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_250 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_250 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_250
happyReduction_250 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_250 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_251 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_251 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_251 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_251
happyReduction_251 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_251 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_252 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_252 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_252 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_252
happyReduction_252 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_252 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_253 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_253 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_253 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_253
happyReduction_253 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_253 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_254 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_254 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_254 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_254
happyReduction_254 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_254 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_255 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_255 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_255 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_255
happyReduction_255 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_255 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_256 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_256 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_256 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_256
happyReduction_256 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_256 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (L Loc
happy_var_2 Token
PIPE) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 (Loc -> Token -> L Token
forall a. Loc -> a -> L a
L Loc
happy_var_2 (BinOp -> [Name] -> Name -> Token
SYMBOL BinOp
Bor [] (String -> Name
nameFromString String
"|"))) UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_257 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_257 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_257 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_257
happyReduction_257 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_257 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_258 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_258 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_258 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_258
happyReduction_258 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_258 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_259 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_259 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_259 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_259
happyReduction_259 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_259 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_260 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_260 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_260 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_260
happyReduction_260 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_260 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (L Loc
happy_var_2 Token
HAT) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 (Loc -> Token -> L Token
forall a. Loc -> a -> L a
L Loc
happy_var_2 (BinOp -> [Name] -> Name -> Token
SYMBOL BinOp
Xor [] (String -> Name
nameFromString String
"^"))) UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_261 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_261 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_261 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_261
happyReduction_261 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_261 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_262 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_262 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_262 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_262
happyReduction_262 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_262 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_263 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_263 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_263 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_263
happyReduction_263 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_263 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_264 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_264 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_264 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_264
happyReduction_264 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_264 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_265 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_265 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_265 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_265
happyReduction_265 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_265 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_266 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_266 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_266 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_266
happyReduction_266 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_266 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_267 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_267 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_267 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_267
happyReduction_267 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_267 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_268 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_268 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_268 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_268
happyReduction_268 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_268 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_269 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_269 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_269 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_269
happyReduction_269 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_269 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (L Loc
happy_var_2 Token
LTH) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 (Loc -> Token -> L Token
forall a. Loc -> a -> L a
L Loc
happy_var_2 (BinOp -> [Name] -> Name -> Token
SYMBOL BinOp
Less [] (String -> Name
nameFromString String
"<"))) UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_270 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_270 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_270 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_270
happyReduction_270 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_270 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_271 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_271 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_271 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
64# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_271
happyReduction_271 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_271 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_272 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_272 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_272 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
64# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_272
happyReduction_272 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_272 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap57
happyOut57 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap57 (QualName Name, Loc)
happy_var_3) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (HappyWrap59 UncheckedExp
happy_var_5) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn73
                 (AppExpBase NoInfo Name -> NoInfo AppRes -> UncheckedExp
forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp ((QualName Name, SrcLoc)
-> NoInfo StructType
-> (UncheckedExp, NoInfo (Maybe VName))
-> (UncheckedExp, NoInfo (Maybe VName))
-> SrcLoc
-> AppExpBase NoInfo Name
forall (f :: * -> *) vn.
(QualName vn, SrcLoc)
-> f StructType
-> (ExpBase f vn, f (Maybe VName))
-> (ExpBase f vn, f (Maybe VName))
-> SrcLoc
-> AppExpBase f vn
BinOp ((Loc -> SrcLoc) -> (QualName Name, Loc) -> (QualName Name, SrcLoc)
forall b c a. (b -> c) -> (a, b) -> (a, c)
forall (p :: * -> * -> *) b c a.
Bifunctor p =>
(b -> c) -> p a b -> p a c
second Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf (QualName Name, Loc)
happy_var_3) NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (UncheckedExp
happy_var_1, NoInfo (Maybe VName)
forall {k} (a :: k). NoInfo a
NoInfo) (UncheckedExp
happy_var_5, NoInfo (Maybe VName)
forall {k} (a :: k). NoInfo a
NoInfo) (UncheckedExp -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_5)) NoInfo AppRes
forall {k} (a :: k). NoInfo a
NoInfo
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_273 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_273 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_273 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
65# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_273
happyReduction_273 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_273 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn74
                 (QualName Name -> NoInfo StructType -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
QualName vn -> f StructType -> SrcLoc -> ExpBase f vn
OpSection (Name -> QualName Name
forall v. v -> QualName v
qualName (String -> Name
nameFromString String
"-")) NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_274 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_274 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_274 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
65# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_274
happyReduction_274 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_274 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap59 UncheckedExp
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (L Loc
happy_var_4 Token
RPAR) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn74
                 (QualName Name
-> NoInfo StructType
-> UncheckedExp
-> (NoInfo (PName, ParamType, Maybe VName),
    NoInfo (PName, ParamType))
-> (NoInfo ResRetType, NoInfo [VName])
-> SrcLoc
-> UncheckedExp
forall (f :: * -> *) vn.
QualName vn
-> f StructType
-> ExpBase f vn
-> (f (PName, ParamType, Maybe VName), f (PName, ParamType))
-> (f ResRetType, f [VName])
-> SrcLoc
-> ExpBase f vn
OpSectionLeft (Name -> QualName Name
forall v. v -> QualName v
qualName (String -> Name
nameFromString String
"-"))
      NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo UncheckedExp
happy_var_2 (NoInfo (PName, ParamType, Maybe VName)
forall {k} (a :: k). NoInfo a
NoInfo, NoInfo (PName, ParamType)
forall {k} (a :: k). NoInfo a
NoInfo) (NoInfo ResRetType
forall {k} (a :: k). NoInfo a
NoInfo, NoInfo [VName]
forall {k} (a :: k). NoInfo a
NoInfo) (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_4)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_275 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_275 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_275 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
65# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_275
happyReduction_275 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_275 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap35
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap35
happyOut35 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap35 (QualName Name, Loc)
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (L Loc
happy_var_4 Token
RPAR) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn74
                 (QualName Name
-> NoInfo StructType
-> UncheckedExp
-> (NoInfo (PName, ParamType),
    NoInfo (PName, ParamType, Maybe VName))
-> NoInfo ResRetType
-> SrcLoc
-> UncheckedExp
forall (f :: * -> *) vn.
QualName vn
-> f StructType
-> ExpBase f vn
-> (f (PName, ParamType), f (PName, ParamType, Maybe VName))
-> f ResRetType
-> SrcLoc
-> ExpBase f vn
OpSectionRight ((QualName Name, Loc) -> QualName Name
forall a b. (a, b) -> a
fst (QualName Name, Loc)
happy_var_2) NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo UncheckedExp
happy_var_3 (NoInfo (PName, ParamType)
forall {k} (a :: k). NoInfo a
NoInfo, NoInfo (PName, ParamType, Maybe VName)
forall {k} (a :: k). NoInfo a
NoInfo) NoInfo ResRetType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_4)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_276 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_276 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_276 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
65# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_276
happyReduction_276 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_276 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap59 UncheckedExp
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap35
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap35
happyOut35 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap35 (QualName Name, Loc)
happy_var_3) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (L Loc
happy_var_4 Token
RPAR) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn74
                 (QualName Name
-> NoInfo StructType
-> UncheckedExp
-> (NoInfo (PName, ParamType, Maybe VName),
    NoInfo (PName, ParamType))
-> (NoInfo ResRetType, NoInfo [VName])
-> SrcLoc
-> UncheckedExp
forall (f :: * -> *) vn.
QualName vn
-> f StructType
-> ExpBase f vn
-> (f (PName, ParamType, Maybe VName), f (PName, ParamType))
-> (f ResRetType, f [VName])
-> SrcLoc
-> ExpBase f vn
OpSectionLeft ((QualName Name, Loc) -> QualName Name
forall a b. (a, b) -> a
fst (QualName Name, Loc)
happy_var_3) NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo UncheckedExp
happy_var_2 (NoInfo (PName, ParamType, Maybe VName)
forall {k} (a :: k). NoInfo a
NoInfo, NoInfo (PName, ParamType)
forall {k} (a :: k). NoInfo a
NoInfo) (NoInfo ResRetType
forall {k} (a :: k). NoInfo a
NoInfo, NoInfo [VName]
forall {k} (a :: k). NoInfo a
NoInfo) (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_4)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_277 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_277 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_277 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
65# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_277
happyReduction_277 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_277 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap35
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap35
happyOut35 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap35 (QualName Name, Loc)
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn74
                 (QualName Name -> NoInfo StructType -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
QualName vn -> f StructType -> SrcLoc -> ExpBase f vn
OpSection ((QualName Name, Loc) -> QualName Name
forall a b. (a, b) -> a
fst (QualName Name, Loc)
happy_var_2) NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_278 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_278 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_278 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
65# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_278
happyReduction_278 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_278 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap68
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap68
happyOut68 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap68 [L Name]
happy_var_3) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (L Loc
happy_var_4 Token
RPAR) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn74
                 ([Name] -> NoInfo StructType -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
[Name] -> f StructType -> SrcLoc -> ExpBase f vn
ProjectSection ((L Name -> Name) -> [L Name] -> [Name]
forall a b. (a -> b) -> [a] -> [b]
map L Name -> Name
forall a. L a -> a
unLoc [L Name]
happy_var_3) NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_4)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_279 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_279 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_279 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
6# Int#
65# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_279
happyReduction_279 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_279 (HappyAbsSyn t99 t100 t101 t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap93
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap93
happyOut93 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap93 [UncheckedDimIndex]
happy_var_4) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_6 of { (L Loc
happy_var_6 Token
RPAR) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn74
                 ([UncheckedDimIndex] -> NoInfo StructType -> SrcLoc -> UncheckedExp
forall (f :: * -> *) vn.
SliceBase f vn -> f StructType -> SrcLoc -> ExpBase f vn
IndexSection [UncheckedDimIndex]
happy_var_4 NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_6)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_280 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_280 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_280 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
66# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_280
happyReduction_280 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_280 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn75
                 (AppExpBase NoInfo Name -> NoInfo AppRes -> UncheckedExp
forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (UncheckedExp
-> Maybe UncheckedExp
-> Inclusiveness UncheckedExp
-> SrcLoc
-> AppExpBase NoInfo Name
forall (f :: * -> *) vn.
ExpBase f vn
-> Maybe (ExpBase f vn)
-> Inclusiveness (ExpBase f vn)
-> SrcLoc
-> AppExpBase f vn
Range UncheckedExp
happy_var_1 Maybe UncheckedExp
forall a. Maybe a
Nothing (UncheckedExp -> Inclusiveness UncheckedExp
forall a. a -> Inclusiveness a
ToInclusive UncheckedExp
happy_var_3) (UncheckedExp -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_3)) NoInfo AppRes
forall {k} (a :: k). NoInfo a
NoInfo
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_281 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_281 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_281 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
66# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_281
happyReduction_281 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_281 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn75
                 (AppExpBase NoInfo Name -> NoInfo AppRes -> UncheckedExp
forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (UncheckedExp
-> Maybe UncheckedExp
-> Inclusiveness UncheckedExp
-> SrcLoc
-> AppExpBase NoInfo Name
forall (f :: * -> *) vn.
ExpBase f vn
-> Maybe (ExpBase f vn)
-> Inclusiveness (ExpBase f vn)
-> SrcLoc
-> AppExpBase f vn
Range UncheckedExp
happy_var_1 Maybe UncheckedExp
forall a. Maybe a
Nothing (UncheckedExp -> Inclusiveness UncheckedExp
forall a. a -> Inclusiveness a
UpToExclusive UncheckedExp
happy_var_3) (UncheckedExp -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_3)) NoInfo AppRes
forall {k} (a :: k). NoInfo a
NoInfo
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_282 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_282 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_282 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
66# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_282
happyReduction_282 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_282 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn75
                 (AppExpBase NoInfo Name -> NoInfo AppRes -> UncheckedExp
forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (UncheckedExp
-> Maybe UncheckedExp
-> Inclusiveness UncheckedExp
-> SrcLoc
-> AppExpBase NoInfo Name
forall (f :: * -> *) vn.
ExpBase f vn
-> Maybe (ExpBase f vn)
-> Inclusiveness (ExpBase f vn)
-> SrcLoc
-> AppExpBase f vn
Range UncheckedExp
happy_var_1 Maybe UncheckedExp
forall a. Maybe a
Nothing (UncheckedExp -> Inclusiveness UncheckedExp
forall a. a -> Inclusiveness a
DownToExclusive UncheckedExp
happy_var_3)  (UncheckedExp -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_3)) NoInfo AppRes
forall {k} (a :: k). NoInfo a
NoInfo
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_283 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_283 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_283 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
66# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_283
happyReduction_283 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_283 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (HappyWrap59 UncheckedExp
happy_var_5) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn75
                 (AppExpBase NoInfo Name -> NoInfo AppRes -> UncheckedExp
forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (UncheckedExp
-> Maybe UncheckedExp
-> Inclusiveness UncheckedExp
-> SrcLoc
-> AppExpBase NoInfo Name
forall (f :: * -> *) vn.
ExpBase f vn
-> Maybe (ExpBase f vn)
-> Inclusiveness (ExpBase f vn)
-> SrcLoc
-> AppExpBase f vn
Range UncheckedExp
happy_var_1 (UncheckedExp -> Maybe UncheckedExp
forall a. a -> Maybe a
Just UncheckedExp
happy_var_3) (UncheckedExp -> Inclusiveness UncheckedExp
forall a. a -> Inclusiveness a
ToInclusive UncheckedExp
happy_var_5) (UncheckedExp -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_5)) NoInfo AppRes
forall {k} (a :: k). NoInfo a
NoInfo
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_284 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_284 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_284 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
66# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_284
happyReduction_284 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_284 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (HappyWrap59 UncheckedExp
happy_var_5) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn75
                 (AppExpBase NoInfo Name -> NoInfo AppRes -> UncheckedExp
forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (UncheckedExp
-> Maybe UncheckedExp
-> Inclusiveness UncheckedExp
-> SrcLoc
-> AppExpBase NoInfo Name
forall (f :: * -> *) vn.
ExpBase f vn
-> Maybe (ExpBase f vn)
-> Inclusiveness (ExpBase f vn)
-> SrcLoc
-> AppExpBase f vn
Range UncheckedExp
happy_var_1 (UncheckedExp -> Maybe UncheckedExp
forall a. a -> Maybe a
Just UncheckedExp
happy_var_3) (UncheckedExp -> Inclusiveness UncheckedExp
forall a. a -> Inclusiveness a
UpToExclusive UncheckedExp
happy_var_5) (UncheckedExp -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_5)) NoInfo AppRes
forall {k} (a :: k). NoInfo a
NoInfo
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_285 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_285 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_285 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
66# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_285
happyReduction_285 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_285 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (HappyWrap59 UncheckedExp
happy_var_5) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn75
                 (AppExpBase NoInfo Name -> NoInfo AppRes -> UncheckedExp
forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (UncheckedExp
-> Maybe UncheckedExp
-> Inclusiveness UncheckedExp
-> SrcLoc
-> AppExpBase NoInfo Name
forall (f :: * -> *) vn.
ExpBase f vn
-> Maybe (ExpBase f vn)
-> Inclusiveness (ExpBase f vn)
-> SrcLoc
-> AppExpBase f vn
Range UncheckedExp
happy_var_1 (UncheckedExp -> Maybe UncheckedExp
forall a. a -> Maybe a
Just UncheckedExp
happy_var_3) (UncheckedExp -> Inclusiveness UncheckedExp
forall a. a -> Inclusiveness a
DownToExclusive UncheckedExp
happy_var_5) (UncheckedExp -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_5)) NoInfo AppRes
forall {k} (a :: k). NoInfo a
NoInfo
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_286 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_286 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_286 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
6# Int#
67# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_286
happyReduction_286 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_286 (HappyAbsSyn t99 t100 t101 t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
IF) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap58 UncheckedExp
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap58 UncheckedExp
happy_var_4) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_6 of { (HappyWrap58 UncheckedExp
happy_var_6) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn76
                 (AppExpBase NoInfo Name -> NoInfo AppRes -> UncheckedExp
forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (UncheckedExp
-> UncheckedExp -> UncheckedExp -> SrcLoc -> AppExpBase NoInfo Name
forall (f :: * -> *) vn.
ExpBase f vn
-> ExpBase f vn -> ExpBase f vn -> SrcLoc -> AppExpBase f vn
If UncheckedExp
happy_var_2 UncheckedExp
happy_var_4 UncheckedExp
happy_var_6 (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_6)) NoInfo AppRes
forall {k} (a :: k). NoInfo a
NoInfo
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_287 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_287 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_287 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
68# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_287
happyReduction_287 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_287 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LOOP) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
happyOut81 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap81 PatBase NoInfo Name StructType
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap91
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap91
happyOut91 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap91 LoopFormBase NoInfo Name
happy_var_3) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (HappyWrap58 UncheckedExp
happy_var_5) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn77
                 (AppExpBase NoInfo Name -> NoInfo AppRes -> UncheckedExp
forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp ([VName]
-> PatBase NoInfo Name ParamType
-> LoopInitBase NoInfo Name
-> LoopFormBase NoInfo Name
-> UncheckedExp
-> SrcLoc
-> AppExpBase NoInfo Name
forall (f :: * -> *) vn.
[VName]
-> PatBase f vn ParamType
-> LoopInitBase f vn
-> LoopFormBase f vn
-> ExpBase f vn
-> SrcLoc
-> AppExpBase f vn
Loop [] ((StructType -> ParamType)
-> PatBase NoInfo Name StructType -> PatBase NoInfo Name ParamType
forall a b.
(a -> b) -> PatBase NoInfo Name a -> PatBase NoInfo Name b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (Diet -> StructType -> ParamType
forall u. Diet -> TypeBase Size u -> ParamType
toParam Diet
Observe) PatBase NoInfo Name StructType
happy_var_2) (NoInfo UncheckedExp -> LoopInitBase NoInfo Name
forall (f :: * -> *) vn. f (ExpBase f vn) -> LoopInitBase f vn
LoopInitImplicit NoInfo UncheckedExp
forall {k} (a :: k). NoInfo a
NoInfo) LoopFormBase NoInfo Name
happy_var_3 UncheckedExp
happy_var_5 (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_5)) NoInfo AppRes
forall {k} (a :: k). NoInfo a
NoInfo
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_288 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_288 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_288 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
68# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_288
happyReduction_288 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_288 (HappyAbsSyn t99 t100 t101 t102
happy_x_7 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_6 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LOOP) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
happyOut81 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap81 PatBase NoInfo Name StructType
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap58 UncheckedExp
happy_var_4) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap91
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap91
happyOut91 HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (HappyWrap91 LoopFormBase NoInfo Name
happy_var_5) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_7 of { (HappyWrap58 UncheckedExp
happy_var_7) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn77
                 (AppExpBase NoInfo Name -> NoInfo AppRes -> UncheckedExp
forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp ([VName]
-> PatBase NoInfo Name ParamType
-> LoopInitBase NoInfo Name
-> LoopFormBase NoInfo Name
-> UncheckedExp
-> SrcLoc
-> AppExpBase NoInfo Name
forall (f :: * -> *) vn.
[VName]
-> PatBase f vn ParamType
-> LoopInitBase f vn
-> LoopFormBase f vn
-> ExpBase f vn
-> SrcLoc
-> AppExpBase f vn
Loop [] ((StructType -> ParamType)
-> PatBase NoInfo Name StructType -> PatBase NoInfo Name ParamType
forall a b.
(a -> b) -> PatBase NoInfo Name a -> PatBase NoInfo Name b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (Diet -> StructType -> ParamType
forall u. Diet -> TypeBase Size u -> ParamType
toParam Diet
Observe) PatBase NoInfo Name StructType
happy_var_2) (UncheckedExp -> LoopInitBase NoInfo Name
forall (f :: * -> *) vn. ExpBase f vn -> LoopInitBase f vn
LoopInitExplicit UncheckedExp
happy_var_4) LoopFormBase NoInfo Name
happy_var_5 UncheckedExp
happy_var_7 (Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_7)) NoInfo AppRes
forall {k} (a :: k). NoInfo a
NoInfo
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_289 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_289 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_289 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
69# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_289
happyReduction_289 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_289 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
MATCH) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap58 UncheckedExp
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap79
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap79
happyOut79 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap79 NonEmpty (CaseBase NoInfo Name)
happy_var_3) -> 
        UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedExp -> HappyAbsSyn t99 t100 t101 t102
happyIn78
                 (let loc :: SrcLoc
loc = Loc -> [CaseBase NoInfo Name] -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 (NonEmpty (CaseBase NoInfo Name) -> [CaseBase NoInfo Name]
forall a. NonEmpty a -> [a]
NE.toList NonEmpty (CaseBase NoInfo Name)
happy_var_3)
              in AppExpBase NoInfo Name -> NoInfo AppRes -> UncheckedExp
forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (UncheckedExp
-> NonEmpty (CaseBase NoInfo Name)
-> SrcLoc
-> AppExpBase NoInfo Name
forall (f :: * -> *) vn.
ExpBase f vn
-> NonEmpty (CaseBase f vn) -> SrcLoc -> AppExpBase f vn
Match UncheckedExp
happy_var_2 NonEmpty (CaseBase NoInfo Name)
happy_var_3 SrcLoc
loc) NoInfo AppRes
forall {k} (a :: k). NoInfo a
NoInfo
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_290 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_290 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_290 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
70# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_290
happyReduction_290 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_290 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap80
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap80
happyOut80 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap80 CaseBase NoInfo Name
happy_var_1) -> 
        NonEmpty (CaseBase NoInfo Name) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
NonEmpty (CaseBase NoInfo Name) -> HappyAbsSyn t99 t100 t101 t102
happyIn79
                 (CaseBase NoInfo Name -> NonEmpty (CaseBase NoInfo Name)
forall a. a -> NonEmpty a
NE.singleton CaseBase NoInfo Name
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_291 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_291 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_291 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
70# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_291
happyReduction_291 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_291 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap80
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap80
happyOut80 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap80 CaseBase NoInfo Name
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap79
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap79
happyOut79 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap79 NonEmpty (CaseBase NoInfo Name)
happy_var_2) -> 
        NonEmpty (CaseBase NoInfo Name) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
NonEmpty (CaseBase NoInfo Name) -> HappyAbsSyn t99 t100 t101 t102
happyIn79
                 (CaseBase NoInfo Name
-> NonEmpty (CaseBase NoInfo Name)
-> NonEmpty (CaseBase NoInfo Name)
forall a. a -> NonEmpty a -> NonEmpty a
NE.cons CaseBase NoInfo Name
happy_var_1 NonEmpty (CaseBase NoInfo Name)
happy_var_2
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_292 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_292 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_292 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
71# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_292
happyReduction_292 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_292 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
CASE) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
happyOut81 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap81 PatBase NoInfo Name StructType
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap58 UncheckedExp
happy_var_4) -> 
        CaseBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
CaseBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn80
                 (let loc :: SrcLoc
loc = Loc -> UncheckedExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_4 in PatBase NoInfo Name StructType
-> UncheckedExp -> SrcLoc -> CaseBase NoInfo Name
forall (f :: * -> *) vn.
PatBase f vn StructType -> ExpBase f vn -> SrcLoc -> CaseBase f vn
CasePat PatBase NoInfo Name StructType
happy_var_2 UncheckedExp
happy_var_4 SrcLoc
loc
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_293 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_293 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_293 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
72# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_293
happyReduction_293 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_293 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
HASH_LBRACKET) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap97
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap97
happyOut97 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap97 AttrInfo Name
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
happyOut81 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap81 PatBase NoInfo Name StructType
happy_var_4) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn81
                 (AttrInfo Name
-> PatBase NoInfo Name StructType
-> SrcLoc
-> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t.
AttrInfo vn -> PatBase f vn t -> SrcLoc -> PatBase f vn t
PatAttr AttrInfo Name
happy_var_2 PatBase NoInfo Name StructType
happy_var_4 (Loc -> PatBase NoInfo Name StructType -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 PatBase NoInfo Name StructType
happy_var_4)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_294 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_294 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_294 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
72# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_294
happyReduction_294 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_294 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap84
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap84
happyOut84 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap84 PatBase NoInfo Name StructType
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap40 UncheckedTypeExp
happy_var_3) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn81
                 (PatBase NoInfo Name StructType
-> UncheckedTypeExp -> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t.
PatBase f vn t
-> TypeExp (ExpBase f vn) vn -> SrcLoc -> PatBase f vn t
PatAscription PatBase NoInfo Name StructType
happy_var_1 UncheckedTypeExp
happy_var_3 (PatBase NoInfo Name StructType -> UncheckedTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan PatBase NoInfo Name StructType
happy_var_1 UncheckedTypeExp
happy_var_3)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_295 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_295 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_295 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
72# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_295
happyReduction_295 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_295 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap84
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap84
happyOut84 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap84 PatBase NoInfo Name StructType
happy_var_1) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn81
                 (PatBase NoInfo Name StructType
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_296 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_296 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_296 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
72# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_296
happyReduction_296 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_296 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap48
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap48
happyOut48 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap48 (Name, Loc)
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap85
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap85
happyOut85 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap85 [PatBase NoInfo Name StructType]
happy_var_2) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn81
                 (let (Name
n, Loc
loc) = (Name, Loc)
happy_var_1;
                                            loc' :: SrcLoc
loc' = Loc -> [PatBase NoInfo Name StructType] -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
loc [PatBase NoInfo Name StructType]
happy_var_2
                                        in Name
-> NoInfo StructType
-> [PatBase NoInfo Name StructType]
-> SrcLoc
-> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t.
Name -> f t -> [PatBase f vn t] -> SrcLoc -> PatBase f vn t
PatConstr Name
n NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo [PatBase NoInfo Name StructType]
happy_var_2 SrcLoc
loc'
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_297 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_297 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_297 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
73# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_297
happyReduction_297 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_297 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn82
                 (let L Loc
loc (ID Name
name) = L Token
happy_var_1 in Name
-> NoInfo StructType -> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t. vn -> f t -> SrcLoc -> PatBase f vn t
Id Name
name NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_298 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_298 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_298 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
73# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_298
happyReduction_298 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_298 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap36
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap36
happyOut36 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap36 Name
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn82
                 (Name
-> NoInfo StructType -> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t. vn -> f t -> SrcLoc -> PatBase f vn t
Id Name
happy_var_2 NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_299 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_299 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_299 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
73# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_299
happyReduction_299 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_299 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
UNDERSCORE) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn82
                 (NoInfo StructType -> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t. f t -> SrcLoc -> PatBase f vn t
Wildcard NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
happy_var_1)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_300 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_300 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_300 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
73# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_300
happyReduction_300 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_300 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (L Loc
happy_var_2 Token
RPAR) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn82
                 ([PatBase NoInfo Name StructType]
-> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t.
[PatBase f vn t] -> SrcLoc -> PatBase f vn t
TuplePat [] (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_301 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_301 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_301 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
73# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_301
happyReduction_301 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_301 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
happyOut81 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap81 PatBase NoInfo Name StructType
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn82
                 (PatBase NoInfo Name StructType
-> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t.
PatBase f vn t -> SrcLoc -> PatBase f vn t
PatParens PatBase NoInfo Name StructType
happy_var_2 (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_302 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_302 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_302 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
73# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_302
happyReduction_302 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_302 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
happyOut81 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap81 PatBase NoInfo Name StructType
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap83
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap83
happyOut83 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap83 [PatBase NoInfo Name StructType]
happy_var_4) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (L Loc
happy_var_5 Token
RPAR) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn82
                 ([PatBase NoInfo Name StructType]
-> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t.
[PatBase f vn t] -> SrcLoc -> PatBase f vn t
TuplePat (PatBase NoInfo Name StructType
happy_var_2PatBase NoInfo Name StructType
-> [PatBase NoInfo Name StructType]
-> [PatBase NoInfo Name StructType]
forall a. a -> [a] -> [a]
:[PatBase NoInfo Name StructType]
happy_var_4) (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_5)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_303 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_303 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_303 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
73# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_303
happyReduction_303 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_303 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LCURLY) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap87
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap87
happyOut87 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap87 [(L Name, PatBase NoInfo Name StructType)]
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RCURLY) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn82
                 ([(L Name, PatBase NoInfo Name StructType)]
-> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t.
[(L Name, PatBase f vn t)] -> SrcLoc -> PatBase f vn t
RecordPat [(L Name, PatBase NoInfo Name StructType)]
happy_var_2 (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_304 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_304 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_304 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
73# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_304
happyReduction_304 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_304 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap89
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap89
happyOut89 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap89 (PatLit, Loc)
happy_var_1) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn82
                 (PatLit
-> NoInfo StructType -> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t.
PatLit -> f t -> SrcLoc -> PatBase f vn t
PatLit ((PatLit, Loc) -> PatLit
forall a b. (a, b) -> a
fst (PatLit, Loc)
happy_var_1) NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf ((PatLit, Loc) -> Loc
forall a b. (a, b) -> b
snd (PatLit, Loc)
happy_var_1))
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_305 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_305 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_305 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
73# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_305
happyReduction_305 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_305 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap48
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap48
happyOut48 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap48 (Name, Loc)
happy_var_1) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn82
                 (let (Name
n, Loc
loc) = (Name, Loc)
happy_var_1
                                        in Name
-> NoInfo StructType
-> [PatBase NoInfo Name StructType]
-> SrcLoc
-> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t.
Name -> f t -> [PatBase f vn t] -> SrcLoc -> PatBase f vn t
PatConstr Name
n NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo [] (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_306 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_306 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_306 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
74# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_306
happyReduction_306 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_306 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
happyOut81 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap81 PatBase NoInfo Name StructType
happy_var_1) -> 
        [PatBase NoInfo Name StructType] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[PatBase NoInfo Name StructType] -> HappyAbsSyn t99 t100 t101 t102
happyIn83
                 ([PatBase NoInfo Name StructType
happy_var_1]
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_307 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_307 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_307 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
74# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
p
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_307
happyReduction_307 :: p
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_307 p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
happyOut81 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap81 PatBase NoInfo Name StructType
happy_var_1) -> 
        [PatBase NoInfo Name StructType] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[PatBase NoInfo Name StructType] -> HappyAbsSyn t99 t100 t101 t102
happyIn83
                 ([PatBase NoInfo Name StructType
happy_var_1]
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_308 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_308 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_308 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
74# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_308
happyReduction_308 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_308 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
happyOut81 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap81 PatBase NoInfo Name StructType
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap83
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap83
happyOut83 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap83 [PatBase NoInfo Name StructType]
happy_var_3) -> 
        [PatBase NoInfo Name StructType] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[PatBase NoInfo Name StructType] -> HappyAbsSyn t99 t100 t101 t102
happyIn83
                 (PatBase NoInfo Name StructType
happy_var_1 PatBase NoInfo Name StructType
-> [PatBase NoInfo Name StructType]
-> [PatBase NoInfo Name StructType]
forall a. a -> [a] -> [a]
: [PatBase NoInfo Name StructType]
happy_var_3
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_309 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_309 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_309 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
75# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_309
happyReduction_309 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_309 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn84
                 (let L Loc
loc (ID Name
name) = L Token
happy_var_1 in Name
-> NoInfo StructType -> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t. vn -> f t -> SrcLoc -> PatBase f vn t
Id Name
name NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_310 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_310 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_310 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
75# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_310
happyReduction_310 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_310 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap36
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap36
happyOut36 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap36 Name
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn84
                 (Name
-> NoInfo StructType -> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t. vn -> f t -> SrcLoc -> PatBase f vn t
Id Name
happy_var_2 NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_311 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_311 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_311 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
75# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_311
happyReduction_311 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_311 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
UNDERSCORE) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn84
                 (NoInfo StructType -> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t. f t -> SrcLoc -> PatBase f vn t
Wildcard NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
happy_var_1)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_312 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_312 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_312 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
75# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_312
happyReduction_312 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_312 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (L Loc
happy_var_2 Token
RPAR) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn84
                 ([PatBase NoInfo Name StructType]
-> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t.
[PatBase f vn t] -> SrcLoc -> PatBase f vn t
TuplePat [] (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_2)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_313 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_313 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_313 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
75# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_313
happyReduction_313 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_313 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
happyOut81 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap81 PatBase NoInfo Name StructType
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn84
                 (PatBase NoInfo Name StructType
-> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t.
PatBase f vn t -> SrcLoc -> PatBase f vn t
PatParens PatBase NoInfo Name StructType
happy_var_2 (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_314 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_314 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_314 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
75# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_314
happyReduction_314 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_314 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
happyOut81 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap81 PatBase NoInfo Name StructType
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap83
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap83
happyOut83 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap83 [PatBase NoInfo Name StructType]
happy_var_4) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (L Loc
happy_var_5 Token
RPAR) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn84
                 ([PatBase NoInfo Name StructType]
-> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t.
[PatBase f vn t] -> SrcLoc -> PatBase f vn t
TuplePat (PatBase NoInfo Name StructType
happy_var_2PatBase NoInfo Name StructType
-> [PatBase NoInfo Name StructType]
-> [PatBase NoInfo Name StructType]
forall a. a -> [a] -> [a]
:[PatBase NoInfo Name StructType]
happy_var_4) (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_5)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_315 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_315 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_315 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
75# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t99 :: k} {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_315
happyReduction_315 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_315 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
LCURLY) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap87
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap87
happyOut87 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap87 [(L Name, PatBase NoInfo Name StructType)]
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (L Loc
happy_var_3 Token
RCURLY) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn84
                 ([(L Name, PatBase NoInfo Name StructType)]
-> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t.
[(L Name, PatBase f vn t)] -> SrcLoc -> PatBase f vn t
RecordPat [(L Name, PatBase NoInfo Name StructType)]
happy_var_2 (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
        )}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_316 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_316 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_316 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
75# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_316
happyReduction_316 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_316 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap90
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap90
happyOut90 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap90 (PatLit, Loc)
happy_var_1) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn84
                 (PatLit
-> NoInfo StructType -> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t.
PatLit -> f t -> SrcLoc -> PatBase f vn t
PatLit ((PatLit, Loc) -> PatLit
forall a b. (a, b) -> a
fst (PatLit, Loc)
happy_var_1) NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf ((PatLit, Loc) -> Loc
forall a b. (a, b) -> b
snd (PatLit, Loc)
happy_var_1))
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_317 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_317 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_317 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
75# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_317
happyReduction_317 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_317 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap48
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap48
happyOut48 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap48 (Name, Loc)
happy_var_1) -> 
        PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
PatBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn84
                 (let (Name
n, Loc
loc) = (Name, Loc)
happy_var_1
                                        in Name
-> NoInfo StructType
-> [PatBase NoInfo Name StructType]
-> SrcLoc
-> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t.
Name -> f t -> [PatBase f vn t] -> SrcLoc -> PatBase f vn t
PatConstr Name
n NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo [] (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_318 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_318 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_318 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
76# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_318
happyReduction_318 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_318 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap84
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap84
happyOut84 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap84 PatBase NoInfo Name StructType
happy_var_1) -> 
        [PatBase NoInfo Name StructType] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[PatBase NoInfo Name StructType] -> HappyAbsSyn t99 t100 t101 t102
happyIn85
                 ([PatBase NoInfo Name StructType
happy_var_1]
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_319 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_319 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_319 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
76# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_319
happyReduction_319 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_319 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap85
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap85
happyOut85 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap85 [PatBase NoInfo Name StructType]
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap84
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap84
happyOut84 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap84 PatBase NoInfo Name StructType
happy_var_2) -> 
        [PatBase NoInfo Name StructType] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[PatBase NoInfo Name StructType] -> HappyAbsSyn t99 t100 t101 t102
happyIn85
                 ([PatBase NoInfo Name StructType]
happy_var_1 [PatBase NoInfo Name StructType]
-> [PatBase NoInfo Name StructType]
-> [PatBase NoInfo Name StructType]
forall a. [a] -> [a] -> [a]
++ [PatBase NoInfo Name StructType
happy_var_2]
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_320 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_320 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_320 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
77# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_320
happyReduction_320 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_320 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap95
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap95
happyOut95 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap95 L Name
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
happyOut81 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap81 PatBase NoInfo Name StructType
happy_var_3) -> 
        (L Name, PatBase NoInfo Name StructType)
-> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(L Name, PatBase NoInfo Name StructType)
-> HappyAbsSyn t99 t100 t101 t102
happyIn86
                 ((L Name
happy_var_1, PatBase NoInfo Name StructType
happy_var_3)
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_321 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_321 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_321 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
77# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_321
happyReduction_321 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_321 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap95
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap95
happyOut95 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap95 L Name
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap40 UncheckedTypeExp
happy_var_3) -> 
        (L Name, PatBase NoInfo Name StructType)
-> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(L Name, PatBase NoInfo Name StructType)
-> HappyAbsSyn t99 t100 t101 t102
happyIn86
                 ((L Name
happy_var_1, PatBase NoInfo Name StructType
-> UncheckedTypeExp -> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t.
PatBase f vn t
-> TypeExp (ExpBase f vn) vn -> SrcLoc -> PatBase f vn t
PatAscription (Name
-> NoInfo StructType -> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t. vn -> f t -> SrcLoc -> PatBase f vn t
Id (L Name -> Name
forall a. L a -> a
unLoc L Name
happy_var_1) NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (L Name -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf L Name
happy_var_1)) UncheckedTypeExp
happy_var_3 (L Name -> UncheckedTypeExp -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan L Name
happy_var_1 UncheckedTypeExp
happy_var_3))
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_322 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_322 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_322 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
77# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_322
happyReduction_322 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_322 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap95
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap95
happyOut95 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap95 L Name
happy_var_1) -> 
        (L Name, PatBase NoInfo Name StructType)
-> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(L Name, PatBase NoInfo Name StructType)
-> HappyAbsSyn t99 t100 t101 t102
happyIn86
                 ((L Name
happy_var_1, Name
-> NoInfo StructType -> SrcLoc -> PatBase NoInfo Name StructType
forall (f :: * -> *) vn t. vn -> f t -> SrcLoc -> PatBase f vn t
Id (L Name -> Name
forall a. L a -> a
unLoc L Name
happy_var_1) NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (L Name -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf L Name
happy_var_1))
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_323 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_323 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_323 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
78# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_323
happyReduction_323 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_323 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap88
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap88
happyOut88 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap88 [(L Name, PatBase NoInfo Name StructType)]
happy_var_1) -> 
        [(L Name, PatBase NoInfo Name StructType)]
-> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[(L Name, PatBase NoInfo Name StructType)]
-> HappyAbsSyn t99 t100 t101 t102
happyIn87
                 ([(L Name, PatBase NoInfo Name StructType)]
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_324 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_324 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_324 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
78# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
happyReduction_324
happyReduction_324 :: HappyAbsSyn t99 t100 t101 t102
happyReduction_324  =  [(L Name, PatBase NoInfo Name StructType)]
-> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[(L Name, PatBase NoInfo Name StructType)]
-> HappyAbsSyn t99 t100 t101 t102
happyIn87
                 ([]
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_325 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_325 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_325 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
79# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_325
happyReduction_325 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_325 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap86
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap86
happyOut86 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap86 (L Name, PatBase NoInfo Name StructType)
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap88
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap88
happyOut88 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap88 [(L Name, PatBase NoInfo Name StructType)]
happy_var_3) -> 
        [(L Name, PatBase NoInfo Name StructType)]
-> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[(L Name, PatBase NoInfo Name StructType)]
-> HappyAbsSyn t99 t100 t101 t102
happyIn88
                 ((L Name, PatBase NoInfo Name StructType)
happy_var_1 (L Name, PatBase NoInfo Name StructType)
-> [(L Name, PatBase NoInfo Name StructType)]
-> [(L Name, PatBase NoInfo Name StructType)]
forall a. a -> [a] -> [a]
: [(L Name, PatBase NoInfo Name StructType)]
happy_var_3
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_326 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_326 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_326 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
79# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
p
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_326
happyReduction_326 :: p
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_326 p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap86
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap86
happyOut86 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap86 (L Name, PatBase NoInfo Name StructType)
happy_var_1) -> 
        [(L Name, PatBase NoInfo Name StructType)]
-> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[(L Name, PatBase NoInfo Name StructType)]
-> HappyAbsSyn t99 t100 t101 t102
happyIn88
                 ([(L Name, PatBase NoInfo Name StructType)
happy_var_1]
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_327 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_327 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_327 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
79# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_327
happyReduction_327 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_327 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap86
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap86
happyOut86 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap86 (L Name, PatBase NoInfo Name StructType)
happy_var_1) -> 
        [(L Name, PatBase NoInfo Name StructType)]
-> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[(L Name, PatBase NoInfo Name StructType)]
-> HappyAbsSyn t99 t100 t101 t102
happyIn88
                 ([(L Name, PatBase NoInfo Name StructType)
happy_var_1]
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_328 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_328 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_328 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
80# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_328
happyReduction_328 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_328 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn89
                 (let L Loc
loc (CHARLIT Char
x) = L Token
happy_var_1
                          in (Integer -> PatLit
PatLitInt (Int -> Integer
forall a. Integral a => a -> Integer
toInteger (Char -> Int
ord Char
x)), Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_329 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_329 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_329 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
80# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_329
happyReduction_329 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_329 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap64
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap64
happyOut64 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap64 (PrimValue, Loc)
happy_var_1) -> 
        (PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn89
                 ((PrimValue -> PatLit
PatLitPrim ((PrimValue, Loc) -> PrimValue
forall a b. (a, b) -> a
fst (PrimValue, Loc)
happy_var_1), (PrimValue, Loc) -> Loc
forall a b. (a, b) -> b
snd (PrimValue, Loc)
happy_var_1)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_330 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_330 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_330 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
80# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_330
happyReduction_330 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_330 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn89
                 (let L Loc
loc (INTLIT Integer
x) = L Token
happy_var_1 in (Integer -> PatLit
PatLitInt Integer
x, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_331 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_331 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_331 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
80# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_331
happyReduction_331 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_331 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn89
                 (let L Loc
loc (NATLIT Name
_ Integer
x) = L Token
happy_var_1 in (Integer -> PatLit
PatLitInt Integer
x, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_332 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_332 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_332 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
80# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_332
happyReduction_332 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_332 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn89
                 (let L Loc
loc (FLOATLIT Double
x) = L Token
happy_var_1 in (Double -> PatLit
PatLitFloat Double
x, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_333 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_333 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_333 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
81# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_333
happyReduction_333 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_333 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap89
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap89
happyOut89 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap89 (PatLit, Loc)
happy_var_1) -> 
        (PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn90
                 ((PatLit, Loc)
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_334 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_334 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_334 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
81# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_334
happyReduction_334 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_334 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
NEGATE) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap63
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap63
happyOut63 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap63 (PrimValue, Loc)
happy_var_2) -> 
        (PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn90
                 ((PrimValue -> PatLit
PatLitPrim (PrimValue -> PrimValue
primNegate ((PrimValue, Loc) -> PrimValue
forall a b. (a, b) -> a
fst (PrimValue, Loc)
happy_var_2)), SrcLoc -> Loc
forall a. Located a => a -> Loc
locOf (Loc -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 ((PrimValue, Loc) -> Loc
forall a b. (a, b) -> b
snd (PrimValue, Loc)
happy_var_2)))
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_335 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_335 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_335 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
81# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_335
happyReduction_335 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_335 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
NEGATE) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        (PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn90
                 (let L Loc
loc (INTLIT Integer
x) = L Token
happy_var_2 in (Integer -> PatLit
PatLitInt (Integer -> Integer
forall a. Num a => a -> a
negate Integer
x), SrcLoc -> Loc
forall a. Located a => a -> Loc
locOf (Loc -> L Token -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 L Token
happy_var_2))
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_336 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_336 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_336 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
81# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_336
happyReduction_336 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_336 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
NEGATE) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        (PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn90
                 (let L Loc
loc (NATLIT Name
_ Integer
x) = L Token
happy_var_2 in (Integer -> PatLit
PatLitInt (Integer -> Integer
forall a. Num a => a -> a
negate Integer
x), SrcLoc -> Loc
forall a. Located a => a -> Loc
locOf (Loc -> L Token -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 L Token
happy_var_2))
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_337 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_337 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_337 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
81# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_337
happyReduction_337 :: HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_337 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (L Loc
happy_var_1 Token
NEGATE) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { L Token
happy_var_2 -> 
        (PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(PatLit, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn90
                 (let L Loc
loc (FLOATLIT Double
x) = L Token
happy_var_2 in (Double -> PatLit
PatLitFloat (Double -> Double
forall a. Num a => a -> a
negate Double
x), SrcLoc -> Loc
forall a. Located a => a -> Loc
locOf (Loc -> L Token -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 L Token
happy_var_2))
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_338 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_338 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_338 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
82# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_338
happyReduction_338 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_338 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap94
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap94
happyOut94 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap94 IdentBase NoInfo Name StructType
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap58 UncheckedExp
happy_var_4) -> 
        LoopFormBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
LoopFormBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn91
                 (IdentBase NoInfo Name StructType
-> UncheckedExp -> LoopFormBase NoInfo Name
forall (f :: * -> *) vn.
IdentBase f vn StructType -> ExpBase f vn -> LoopFormBase f vn
For IdentBase NoInfo Name StructType
happy_var_2 UncheckedExp
happy_var_4
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_339 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_339 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_339 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
82# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_339
happyReduction_339 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_339 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap81
happyOut81 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap81 PatBase NoInfo Name StructType
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap58 UncheckedExp
happy_var_4) -> 
        LoopFormBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
LoopFormBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn91
                 (PatBase NoInfo Name StructType
-> UncheckedExp -> LoopFormBase NoInfo Name
forall (f :: * -> *) vn.
PatBase f vn StructType -> ExpBase f vn -> LoopFormBase f vn
ForIn PatBase NoInfo Name StructType
happy_var_2 UncheckedExp
happy_var_4
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_340 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_340 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_340 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
82# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p -> HappyAbsSyn t99 t100 t101 t102
happyReduction_340
happyReduction_340 :: HappyAbsSyn t99 t100 t101 t102
-> p -> HappyAbsSyn t99 t100 t101 t102
happyReduction_340 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        p
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap58 UncheckedExp
happy_var_2) -> 
        LoopFormBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
LoopFormBase NoInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn91
                 (UncheckedExp -> LoopFormBase NoInfo Name
forall (f :: * -> *) vn. ExpBase f vn -> LoopFormBase f vn
While UncheckedExp
happy_var_2
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_341 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_341 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_341 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
83# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_341
happyReduction_341 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_341 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
happyIn92
                 (UncheckedExp -> UncheckedDimIndex
forall (f :: * -> *) vn. ExpBase f vn -> DimIndexBase f vn
DimFix UncheckedExp
happy_var_1
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_342 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_342 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_342 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
83# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_342
happyReduction_342 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_342 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
happyIn92
                 (Maybe UncheckedExp
-> Maybe UncheckedExp -> Maybe UncheckedExp -> UncheckedDimIndex
forall (f :: * -> *) vn.
Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> DimIndexBase f vn
DimSlice (UncheckedExp -> Maybe UncheckedExp
forall a. a -> Maybe a
Just UncheckedExp
happy_var_1) (UncheckedExp -> Maybe UncheckedExp
forall a. a -> Maybe a
Just UncheckedExp
happy_var_3) Maybe UncheckedExp
forall a. Maybe a
Nothing
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_343 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_343 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_343 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
83# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
p
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_343
happyReduction_343 :: p
-> HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_343 p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
happyIn92
                 (Maybe UncheckedExp
-> Maybe UncheckedExp -> Maybe UncheckedExp -> UncheckedDimIndex
forall (f :: * -> *) vn.
Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> DimIndexBase f vn
DimSlice (UncheckedExp -> Maybe UncheckedExp
forall a. a -> Maybe a
Just UncheckedExp
happy_var_1) Maybe UncheckedExp
forall a. Maybe a
Nothing Maybe UncheckedExp
forall a. Maybe a
Nothing
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_344 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_344 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_344 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
83# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p -> HappyAbsSyn t99 t100 t101 t102
happyReduction_344
happyReduction_344 :: HappyAbsSyn t99 t100 t101 t102
-> p -> HappyAbsSyn t99 t100 t101 t102
happyReduction_344 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        p
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap59 UncheckedExp
happy_var_2) -> 
        UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
happyIn92
                 (Maybe UncheckedExp
-> Maybe UncheckedExp -> Maybe UncheckedExp -> UncheckedDimIndex
forall (f :: * -> *) vn.
Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> DimIndexBase f vn
DimSlice Maybe UncheckedExp
forall a. Maybe a
Nothing (UncheckedExp -> Maybe UncheckedExp
forall a. a -> Maybe a
Just UncheckedExp
happy_var_2) Maybe UncheckedExp
forall a. Maybe a
Nothing
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_345 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_345 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_345 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
83# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
p -> HappyAbsSyn t99 t100 t101 t102
happyReduction_345
happyReduction_345 :: p -> HappyAbsSyn t99 t100 t101 t102
happyReduction_345 p
happy_x_1
         =  UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
happyIn92
                 (Maybe UncheckedExp
-> Maybe UncheckedExp -> Maybe UncheckedExp -> UncheckedDimIndex
forall (f :: * -> *) vn.
Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> DimIndexBase f vn
DimSlice Maybe UncheckedExp
forall a. Maybe a
Nothing Maybe UncheckedExp
forall a. Maybe a
Nothing Maybe UncheckedExp
forall a. Maybe a
Nothing
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_346 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_346 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_346 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
83# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_346
happyReduction_346 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_346 (HappyAbsSyn t99 t100 t101 t102
happy_x_5 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_5 of { (HappyWrap59 UncheckedExp
happy_var_5) -> 
        UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
happyIn92
                 (Maybe UncheckedExp
-> Maybe UncheckedExp -> Maybe UncheckedExp -> UncheckedDimIndex
forall (f :: * -> *) vn.
Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> DimIndexBase f vn
DimSlice (UncheckedExp -> Maybe UncheckedExp
forall a. a -> Maybe a
Just UncheckedExp
happy_var_1) (UncheckedExp -> Maybe UncheckedExp
forall a. a -> Maybe a
Just UncheckedExp
happy_var_3) (UncheckedExp -> Maybe UncheckedExp
forall a. a -> Maybe a
Just UncheckedExp
happy_var_5)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_347 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_347 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_347 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
83# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_347
happyReduction_347 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_347 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap59 UncheckedExp
happy_var_2) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap59 UncheckedExp
happy_var_4) -> 
        UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
happyIn92
                 (Maybe UncheckedExp
-> Maybe UncheckedExp -> Maybe UncheckedExp -> UncheckedDimIndex
forall (f :: * -> *) vn.
Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> DimIndexBase f vn
DimSlice Maybe UncheckedExp
forall a. Maybe a
Nothing (UncheckedExp -> Maybe UncheckedExp
forall a. a -> Maybe a
Just UncheckedExp
happy_var_2) (UncheckedExp -> Maybe UncheckedExp
forall a. a -> Maybe a
Just UncheckedExp
happy_var_4)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_348 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_348 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_348 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
83# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_348
happyReduction_348 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_348 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap59 UncheckedExp
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (HappyWrap59 UncheckedExp
happy_var_4) -> 
        UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
happyIn92
                 (Maybe UncheckedExp
-> Maybe UncheckedExp -> Maybe UncheckedExp -> UncheckedDimIndex
forall (f :: * -> *) vn.
Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> DimIndexBase f vn
DimSlice (UncheckedExp -> Maybe UncheckedExp
forall a. a -> Maybe a
Just UncheckedExp
happy_var_1) Maybe UncheckedExp
forall a. Maybe a
Nothing (UncheckedExp -> Maybe UncheckedExp
forall a. a -> Maybe a
Just UncheckedExp
happy_var_4)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_349 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_349 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_349 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
83# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {p} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p -> p -> HappyAbsSyn t99 t100 t101 t102
happyReduction_349
happyReduction_349 :: HappyAbsSyn t99 t100 t101 t102
-> p -> p -> HappyAbsSyn t99 t100 t101 t102
happyReduction_349 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        p
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap59
happyOut59 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap59 UncheckedExp
happy_var_3) -> 
        UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
UncheckedDimIndex -> HappyAbsSyn t99 t100 t101 t102
happyIn92
                 (Maybe UncheckedExp
-> Maybe UncheckedExp -> Maybe UncheckedExp -> UncheckedDimIndex
forall (f :: * -> *) vn.
Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> DimIndexBase f vn
DimSlice Maybe UncheckedExp
forall a. Maybe a
Nothing Maybe UncheckedExp
forall a. Maybe a
Nothing (UncheckedExp -> Maybe UncheckedExp
forall a. a -> Maybe a
Just UncheckedExp
happy_var_3)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_350 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_350 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_350 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
84# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
happyReduction_350
happyReduction_350 :: HappyAbsSyn t99 t100 t101 t102
happyReduction_350  =  [UncheckedDimIndex] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedDimIndex] -> HappyAbsSyn t99 t100 t101 t102
happyIn93
                 ([]
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_351 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_351 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_351 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
84# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_351
happyReduction_351 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_351 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap92
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap92
happyOut92 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap92 UncheckedDimIndex
happy_var_1) -> 
        [UncheckedDimIndex] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedDimIndex] -> HappyAbsSyn t99 t100 t101 t102
happyIn93
                 ([UncheckedDimIndex
happy_var_1]
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_352 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_352 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_352 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
84# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_352
happyReduction_352 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_352 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap92
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap92
happyOut92 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap92 UncheckedDimIndex
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap93
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap93
happyOut93 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap93 [UncheckedDimIndex]
happy_var_3) -> 
        [UncheckedDimIndex] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[UncheckedDimIndex] -> HappyAbsSyn t99 t100 t101 t102
happyIn93
                 (UncheckedDimIndex
happy_var_1 UncheckedDimIndex -> [UncheckedDimIndex] -> [UncheckedDimIndex]
forall a. a -> [a] -> [a]
: [UncheckedDimIndex]
happy_var_3
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_353 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_353 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_353 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
85# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_353
happyReduction_353 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_353 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        IdentBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
IdentBase NoInfo Name StructType -> HappyAbsSyn t99 t100 t101 t102
happyIn94
                 (let L Loc
loc (ID Name
name) = L Token
happy_var_1 in Name
-> NoInfo StructType -> SrcLoc -> IdentBase NoInfo Name StructType
forall {k} (f :: k -> *) vn (t :: k).
vn -> f t -> SrcLoc -> IdentBase f vn t
Ident Name
name NoInfo StructType
forall {k} (a :: k). NoInfo a
NoInfo (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_354 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_354 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_354 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
86# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_354
happyReduction_354 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_354 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        L Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
L Name -> HappyAbsSyn t99 t100 t101 t102
happyIn95
                 (let L Loc
loc (ID Name
name) = L Token
happy_var_1 in Loc -> Name -> L Name
forall a. Loc -> a -> L a
L Loc
loc Name
name
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_355 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_355 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_355 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
86# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_355
happyReduction_355 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_355 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        L Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
L Name -> HappyAbsSyn t99 t100 t101 t102
happyIn95
                 (let L Loc
loc (NATLIT Name
x Integer
_) = L Token
happy_var_1 in Loc -> Name -> L Name
forall a. Loc -> a -> L a
L Loc
loc Name
x
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_356 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_356 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_356 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
87# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_356
happyReduction_356 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_356 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (AttrAtom Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(AttrAtom Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn96
                 (let L Loc
loc (ID Name
s) =     L Token
happy_var_1 in (Name -> AttrAtom Name
forall {k} (vn :: k). Name -> AttrAtom vn
AtomName Name
s, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_357 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_357 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_357 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
87# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_357
happyReduction_357 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_357 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (AttrAtom Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(AttrAtom Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn96
                 (let L Loc
loc (INTLIT Integer
x) = L Token
happy_var_1 in (Integer -> AttrAtom Name
forall {k} (vn :: k). Integer -> AttrAtom vn
AtomInt Integer
x, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_358 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_358 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_358 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
87# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_358
happyReduction_358 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_358 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        (AttrAtom Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
(AttrAtom Name, Loc) -> HappyAbsSyn t99 t100 t101 t102
happyIn96
                 (let L Loc
loc (NATLIT Name
_ Integer
x) = L Token
happy_var_1 in (Integer -> AttrAtom Name
forall {k} (vn :: k). Integer -> AttrAtom vn
AtomInt Integer
x, Loc
loc)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_359 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_359 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_359 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
88# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_359
happyReduction_359 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_359 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap96
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap96
happyOut96 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap96 (AttrAtom Name, Loc)
happy_var_1) -> 
        AttrInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
AttrInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn97
                 (let (AttrAtom Name
x,Loc
y) = (AttrAtom Name, Loc)
happy_var_1 in AttrAtom Name -> SrcLoc -> AttrInfo Name
forall {k} (vn :: k). AttrAtom vn -> SrcLoc -> AttrInfo vn
AttrAtom AttrAtom Name
x (Loc -> SrcLoc
forall a. Located a => a -> SrcLoc
srclocOf Loc
y)
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_360 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_360 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_360 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
88# HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_360
happyReduction_360 :: HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyReduction_360 (HappyAbsSyn t99 t100 t101 t102
happy_x_4 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_3 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_2 `HappyStk`
        HappyAbsSyn t99 t100 t101 t102
happy_x_1 `HappyStk`
        HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest)
         = case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { L Token
happy_var_1 -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap98
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap98
happyOut98 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap98 [AttrInfo Name]
happy_var_3) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> L Token
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> L Token
happyOutTok HappyAbsSyn t99 t100 t101 t102
happy_x_4 of { (L Loc
happy_var_4 Token
RPAR) -> 
        AttrInfo Name -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
AttrInfo Name -> HappyAbsSyn t99 t100 t101 t102
happyIn97
                 (let L Loc
_ (ID Name
s) = L Token
happy_var_1 in Name -> [AttrInfo Name] -> SrcLoc -> AttrInfo Name
forall {k} (vn :: k).
Name -> [AttrInfo vn] -> SrcLoc -> AttrInfo vn
AttrComp Name
s [AttrInfo Name]
happy_var_3 (L Token -> Loc -> SrcLoc
forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan L Token
happy_var_1 Loc
happy_var_4)
        ) HappyAbsSyn t99 t100 t101 t102
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
-> HappyStk (HappyAbsSyn t99 t100 t101 t102)
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t99 t100 t101 t102)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_361 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_361 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_361 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
89# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
happyReduction_361
happyReduction_361 :: HappyAbsSyn t99 t100 t101 t102
happyReduction_361  =  [AttrInfo Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[AttrInfo Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn98
                 ([]
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_362 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_362 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_362 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
89# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_362
happyReduction_362 :: HappyAbsSyn t99 t100 t101 t102 -> HappyAbsSyn t99 t100 t101 t102
happyReduction_362 HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap97
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap97
happyOut97 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap97 AttrInfo Name
happy_var_1) -> 
        [AttrInfo Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[AttrInfo Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn98
                 ([AttrInfo Name
happy_var_1]
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_363 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_363 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_363 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
89# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t99 :: k}
       {t100 :: k} {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {t99 :: k} {t100 :: k} {t101 :: k}
       {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_363
happyReduction_363 :: HappyAbsSyn t99 t100 t101 t102
-> p
-> HappyAbsSyn t99 t100 t101 t102
-> HappyAbsSyn t99 t100 t101 t102
happyReduction_363 HappyAbsSyn t99 t100 t101 t102
happy_x_3
        p
happy_x_2
        HappyAbsSyn t99 t100 t101 t102
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap97
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap97
happyOut97 HappyAbsSyn t99 t100 t101 t102
happy_x_1 of { (HappyWrap97 AttrInfo Name
happy_var_1) -> 
        case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap98
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap98
happyOut98 HappyAbsSyn t99 t100 t101 t102
happy_x_3 of { (HappyWrap98 [AttrInfo Name]
happy_var_3) -> 
        [AttrInfo Name] -> HappyAbsSyn t99 t100 t101 t102
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
[AttrInfo Name] -> HappyAbsSyn t99 t100 t101 t102
happyIn98
                 (AttrInfo Name
happy_var_1 AttrInfo Name -> [AttrInfo Name] -> [AttrInfo Name]
forall a. a -> [a] -> [a]
: [AttrInfo Name]
happy_var_3
        )}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_364 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_364 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_364 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
90# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t100 :: k} {t101 :: k} {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p -> HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
happyReduction_364
happyReduction_364 :: HappyAbsSyn t99 t100 t101 t102
-> p -> HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
happyReduction_364 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        p
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap15
happyOut15 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap15 UncheckedModTypeExp
happy_var_2) -> 
        Maybe UncheckedModTypeExp
-> HappyAbsSyn (Maybe UncheckedModTypeExp) t100 t101 t102
forall {k} {k} {k} t99 (t100 :: k) (t101 :: k) (t102 :: k).
t99 -> HappyAbsSyn t99 t100 t101 t102
happyIn99
                 (UncheckedModTypeExp -> Maybe UncheckedModTypeExp
forall a. a -> Maybe a
Just UncheckedModTypeExp
happy_var_2
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_365 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_365 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_365 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
90# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {a} {t100 :: k} {t101 :: k} {t102 :: k}.
HappyAbsSyn (Maybe a) t100 t101 t102
happyReduction_365
happyReduction_365 :: HappyAbsSyn (Maybe a) t100 t101 t102
happyReduction_365  =  Maybe a -> HappyAbsSyn (Maybe a) t100 t101 t102
forall {k} {k} {k} t99 (t100 :: k) (t101 :: k) (t102 :: k).
t99 -> HappyAbsSyn t99 t100 t101 t102
happyIn99
                 (Maybe a
forall a. Maybe a
Nothing
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_366 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_366 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_366 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
91# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t101 :: k} {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p -> HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
happyReduction_366
happyReduction_366 :: HappyAbsSyn t99 t100 t101 t102
-> p -> HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
happyReduction_366 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        p
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap21
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap21
happyOut21 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap21 UncheckedModTypeExp
happy_var_2) -> 
        Maybe UncheckedModTypeExp
-> HappyAbsSyn t99 (Maybe UncheckedModTypeExp) t101 t102
forall {k} {k} {k} t100 (t99 :: k) (t101 :: k) (t102 :: k).
t100 -> HappyAbsSyn t99 t100 t101 t102
happyIn100
                 (UncheckedModTypeExp -> Maybe UncheckedModTypeExp
forall a. a -> Maybe a
Just UncheckedModTypeExp
happy_var_2
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_367 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_367 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_367 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
91# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {t99 :: k} {a} {t101 :: k} {t102 :: k}.
HappyAbsSyn t99 (Maybe a) t101 t102
happyReduction_367
happyReduction_367 :: HappyAbsSyn t99 (Maybe a) t101 t102
happyReduction_367  =  Maybe a -> HappyAbsSyn t99 (Maybe a) t101 t102
forall {k} {k} {k} t100 (t99 :: k) (t101 :: k) (t102 :: k).
t100 -> HappyAbsSyn t99 t100 t101 t102
happyIn100
                 (Maybe a
forall a. Maybe a
Nothing
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_368 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_368 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_368 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
92# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t102 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p -> HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happyReduction_368
happyReduction_368 :: HappyAbsSyn t99 t100 t101 t102
-> p -> HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
happyReduction_368 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        p
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap40 UncheckedTypeExp
happy_var_2) -> 
        Maybe UncheckedTypeExp
-> HappyAbsSyn t99 t100 (Maybe UncheckedTypeExp) t102
forall {k} {k} {k} t101 (t99 :: k) (t100 :: k) (t102 :: k).
t101 -> HappyAbsSyn t99 t100 t101 t102
happyIn101
                 (UncheckedTypeExp -> Maybe UncheckedTypeExp
forall a. a -> Maybe a
Just UncheckedTypeExp
happy_var_2
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_369 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_369 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_369 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
92# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {t99 :: k} {t100 :: k} {a} {t102 :: k}.
HappyAbsSyn t99 t100 (Maybe a) t102
happyReduction_369
happyReduction_369 :: HappyAbsSyn t99 t100 (Maybe a) t102
happyReduction_369  =  Maybe a -> HappyAbsSyn t99 t100 (Maybe a) t102
forall {k} {k} {k} t101 (t99 :: k) (t100 :: k) (t102 :: k).
t101 -> HappyAbsSyn t99 t100 t101 t102
happyIn101
                 (Maybe a
forall a. Maybe a
Nothing
        )

#if __GLASGOW_HASKELL__ >= 710
happyReduce_370 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_370 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_370 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
93# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
forall {k} {k} {k} {k} {k} {k} {k} {t99 :: k} {t100 :: k}
       {t101 :: k} {t102 :: k} {p} {t99 :: k} {t100 :: k} {t101 :: k}.
HappyAbsSyn t99 t100 t101 t102
-> p -> HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp)
happyReduction_370
happyReduction_370 :: HappyAbsSyn t99 t100 t101 t102
-> p -> HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp)
happyReduction_370 HappyAbsSyn t99 t100 t101 t102
happy_x_2
        p
happy_x_1
         =  case HappyAbsSyn t99 t100 t101 t102 -> HappyWrap42
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap42
happyOut42 HappyAbsSyn t99 t100 t101 t102
happy_x_2 of { (HappyWrap42 UncheckedTypeExp
happy_var_2) -> 
        Maybe UncheckedTypeExp
-> HappyAbsSyn t99 t100 t101 (Maybe UncheckedTypeExp)
forall {k} {k} {k} t102 (t99 :: k) (t100 :: k) (t101 :: k).
t102 -> HappyAbsSyn t99 t100 t101 t102
happyIn102
                 (UncheckedTypeExp -> Maybe UncheckedTypeExp
forall a. a -> Maybe a
Just UncheckedTypeExp
happy_var_2
        )}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_371 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_371 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_371 = Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
93# HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
forall {k} {k} {k} {t99 :: k} {t100 :: k} {t101 :: k} {a}.
HappyAbsSyn t99 t100 t101 (Maybe a)
happyReduction_371
happyReduction_371 :: HappyAbsSyn t99 t100 t101 (Maybe a)
happyReduction_371  =  Maybe a -> HappyAbsSyn t99 t100 t101 (Maybe a)
forall {k} {k} {k} t102 (t99 :: k) (t100 :: k) (t101 :: k).
t102 -> HappyAbsSyn t99 t100 t101 t102
happyIn102
                 (Maybe a
forall a. Maybe a
Nothing
        )

happyTerminalToTok :: L Token -> Int#
happyTerminalToTok L Token
term = case L Token
term of {
        L Loc
_ Token
EOF -> Int#
103#;
        L Loc
happy_dollar_dollar Token
IF -> Int#
2#;
        L Loc
happy_dollar_dollar Token
THEN -> Int#
3#;
        L Loc
happy_dollar_dollar Token
ELSE -> Int#
4#;
        L Loc
happy_dollar_dollar Token
LET -> Int#
5#;
        L Loc
happy_dollar_dollar Token
DEF -> Int#
6#;
        L Loc
happy_dollar_dollar Token
LOOP -> Int#
7#;
        L Loc
happy_dollar_dollar Token
IN -> Int#
8#;
        L Loc
happy_dollar_dollar Token
MATCH -> Int#
9#;
        L Loc
happy_dollar_dollar Token
CASE -> Int#
10#;
        L Loc
_ (ID Name
_) -> Int#
11#;
        L Loc
_ Token
INDEXING -> Int#
12#;
        L Loc
_ (CONSTRUCTOR Name
_) -> Int#
13#;
        L Loc
_ (NATLIT Name
_ Integer
_) -> Int#
14#;
        L Loc
_ (INTLIT Integer
_) -> Int#
15#;
        L Loc
_ (I8LIT Int8
_) -> Int#
16#;
        L Loc
_ (I16LIT Int16
_) -> Int#
17#;
        L Loc
_ (I32LIT Int32
_) -> Int#
18#;
        L Loc
_ (I64LIT Int64
_) -> Int#
19#;
        L Loc
_ (U8LIT Word8
_) -> Int#
20#;
        L Loc
_ (U16LIT Word16
_) -> Int#
21#;
        L Loc
_ (U32LIT Word32
_) -> Int#
22#;
        L Loc
_ (U64LIT Word64
_) -> Int#
23#;
        L Loc
_ (FLOATLIT Double
_) -> Int#
24#;
        L Loc
_ (F16LIT Half
_) -> Int#
25#;
        L Loc
_ (F32LIT Float
_) -> Int#
26#;
        L Loc
_ (F64LIT Double
_) -> Int#
27#;
        L Loc
_ (STRINGLIT Text
_) -> Int#
28#;
        L Loc
_ (CHARLIT Char
_) -> Int#
29#;
        L Loc
happy_dollar_dollar Token
DOT -> Int#
30#;
        L Loc
happy_dollar_dollar Token
TWO_DOTS -> Int#
31#;
        L Loc
happy_dollar_dollar Token
THREE_DOTS -> Int#
32#;
        L Loc
happy_dollar_dollar Token
TWO_DOTS_LT -> Int#
33#;
        L Loc
happy_dollar_dollar Token
TWO_DOTS_GT -> Int#
34#;
        L Loc
happy_dollar_dollar Token
EQU -> Int#
35#;
        L Loc
happy_dollar_dollar Token
ASTERISK -> Int#
36#;
        L Loc
happy_dollar_dollar Token
NEGATE -> Int#
37#;
        L Loc
happy_dollar_dollar Token
BANG -> Int#
38#;
        L Loc
happy_dollar_dollar Token
LTH -> Int#
39#;
        L Loc
happy_dollar_dollar Token
HAT -> Int#
40#;
        L Loc
happy_dollar_dollar Token
TILDE -> Int#
41#;
        L Loc
happy_dollar_dollar Token
PIPE -> Int#
42#;
        L Loc
_ (SYMBOL BinOp
Plus [Name]
_ Name
_) -> Int#
43#;
        L Loc
_ (SYMBOL BinOp
Minus [Name]
_ Name
_) -> Int#
44#;
        L Loc
_ (SYMBOL BinOp
Times [Name]
_ Name
_) -> Int#
45#;
        L Loc
_ (SYMBOL BinOp
Divide [Name]
_ Name
_) -> Int#
46#;
        L Loc
_ (SYMBOL BinOp
Mod [Name]
_ Name
_) -> Int#
47#;
        L Loc
_ (SYMBOL BinOp
Quot [Name]
_ Name
_) -> Int#
48#;
        L Loc
_ (SYMBOL BinOp
Rem [Name]
_ Name
_) -> Int#
49#;
        L Loc
_ (SYMBOL BinOp
Equal [Name]
_ Name
_) -> Int#
50#;
        L Loc
_ (SYMBOL BinOp
NotEqual [Name]
_ Name
_) -> Int#
51#;
        L Loc
_ (SYMBOL BinOp
Less [Name]
_ Name
_) -> Int#
52#;
        L Loc
_ (SYMBOL BinOp
Greater [Name]
_ Name
_) -> Int#
53#;
        L Loc
_ (SYMBOL BinOp
Leq [Name]
_ Name
_) -> Int#
54#;
        L Loc
_ (SYMBOL BinOp
Geq [Name]
_ Name
_) -> Int#
55#;
        L Loc
_ (SYMBOL BinOp
Pow [Name]
_ Name
_) -> Int#
56#;
        L Loc
_ (SYMBOL BinOp
ShiftL [Name]
_ Name
_) -> Int#
57#;
        L Loc
_ (SYMBOL BinOp
ShiftR [Name]
_ Name
_) -> Int#
58#;
        L Loc
_ (SYMBOL BinOp
PipeRight [Name]
_ Name
_) -> Int#
59#;
        L Loc
_ (SYMBOL BinOp
PipeLeft [Name]
_ Name
_) -> Int#
60#;
        L Loc
_ (SYMBOL BinOp
Bor [Name]
_ Name
_) -> Int#
61#;
        L Loc
_ (SYMBOL BinOp
Band [Name]
_ Name
_) -> Int#
62#;
        L Loc
_ (SYMBOL BinOp
Xor [Name]
_ Name
_) -> Int#
63#;
        L Loc
_ (SYMBOL BinOp
LogOr [Name]
_ Name
_) -> Int#
64#;
        L Loc
_ (SYMBOL BinOp
LogAnd [Name]
_ Name
_) -> Int#
65#;
        L Loc
_ (SYMBOL BinOp
Bang [Name]
_ Name
_) -> Int#
66#;
        L Loc
_ (SYMBOL BinOp
Equ [Name]
_ Name
_) -> Int#
67#;
        L Loc
happy_dollar_dollar Token
LPAR -> Int#
68#;
        L Loc
happy_dollar_dollar Token
RPAR -> Int#
69#;
        L Loc
happy_dollar_dollar Token
LCURLY -> Int#
70#;
        L Loc
happy_dollar_dollar Token
RCURLY -> Int#
71#;
        L Loc
happy_dollar_dollar Token
LBRACKET -> Int#
72#;
        L Loc
happy_dollar_dollar Token
RBRACKET -> Int#
73#;
        L Loc
happy_dollar_dollar Token
HASH_LBRACKET -> Int#
74#;
        L Loc
happy_dollar_dollar Token
COMMA -> Int#
75#;
        L Loc
happy_dollar_dollar Token
UNDERSCORE -> Int#
76#;
        L Loc
happy_dollar_dollar Token
BACKSLASH -> Int#
77#;
        L Loc
happy_dollar_dollar Token
APOSTROPHE -> Int#
78#;
        L Loc
happy_dollar_dollar Token
APOSTROPHE_THEN_HAT -> Int#
79#;
        L Loc
happy_dollar_dollar Token
APOSTROPHE_THEN_TILDE -> Int#
80#;
        L Loc
happy_dollar_dollar Token
BACKTICK -> Int#
81#;
        L Loc
happy_dollar_dollar Token
ENTRY -> Int#
82#;
        L Loc
happy_dollar_dollar Token
RIGHT_ARROW -> Int#
83#;
        L Loc
happy_dollar_dollar Token
COLON -> Int#
84#;
        L Loc
happy_dollar_dollar Token
COLON_GT -> Int#
85#;
        L Loc
happy_dollar_dollar Token
QUESTION_MARK -> Int#
86#;
        L Loc
happy_dollar_dollar Token
FOR -> Int#
87#;
        L Loc
happy_dollar_dollar Token
DO -> Int#
88#;
        L Loc
happy_dollar_dollar Token
WITH -> Int#
89#;
        L Loc
happy_dollar_dollar Token
ASSERT -> Int#
90#;
        L Loc
happy_dollar_dollar Token
TRUE -> Int#
91#;
        L Loc
happy_dollar_dollar Token
FALSE -> Int#
92#;
        L Loc
happy_dollar_dollar Token
WHILE -> Int#
93#;
        L Loc
happy_dollar_dollar Token
INCLUDE -> Int#
94#;
        L Loc
happy_dollar_dollar Token
IMPORT -> Int#
95#;
        L Loc
happy_dollar_dollar Token
TYPE -> Int#
96#;
        L Loc
happy_dollar_dollar Token
MODULE -> Int#
97#;
        L Loc
happy_dollar_dollar Token
VAL -> Int#
98#;
        L Loc
happy_dollar_dollar Token
OPEN -> Int#
99#;
        L Loc
happy_dollar_dollar Token
LOCAL -> Int#
100#;
        L Loc
_  (DOC Text
_) -> Int#
101#;
        L Loc
happy_dollar_dollar Token
HOLE -> Int#
102#;
        L Token
_ -> Int#
-1#;
        }
{-# NOINLINE happyTerminalToTok #-}

happyLex :: (L Token -> ParserMonad a)
-> (Int# -> L Token -> ParserMonad a) -> ParserMonad a
happyLex L Token -> ParserMonad a
kend Int# -> L Token -> ParserMonad a
kmore = (L Token -> ParserMonad a) -> ParserMonad a
forall a. (L Token -> ParserMonad a) -> ParserMonad a
lexer (\L Token
tk -> case L Token
tk of {
        L Loc
_ Token
EOF -> L Token -> ParserMonad a
kend L Token
tk;
        L Token
_ -> Int# -> L Token -> ParserMonad a
kmore (L Token -> Int#
happyTerminalToTok L Token
tk) L Token
tk })
{-# INLINE happyLex #-}

happyNewToken :: Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyNewToken Int#
action Happy_IntList
sts HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
stk = (L Token
 -> ParserMonad
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)))
-> (Int#
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {a}.
(L Token -> ParserMonad a)
-> (Int# -> L Token -> ParserMonad a) -> ParserMonad a
happyLex (\L Token
tk -> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyDoAction Int#
103# L Token
tk Int#
action Happy_IntList
sts HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
stk) (\Int#
i L Token
tk -> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyDoAction Int#
i L Token
tk Int#
action Happy_IntList
sts HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
stk)

happyReport :: Int# -> L Token -> [String] -> ParserMonad a -> ParserMonad a
happyReport Int#
103# = L Token -> [String] -> ParserMonad a -> ParserMonad a
forall a. L Token -> [String] -> ParserMonad a -> ParserMonad a
happyReport'
happyReport Int#
_ = L Token -> [String] -> ParserMonad a -> ParserMonad a
forall a. L Token -> [String] -> ParserMonad a -> ParserMonad a
happyReport'


happyThen :: () => (ParserMonad a) -> (a -> (ParserMonad b)) -> (ParserMonad b)
happyThen :: forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen = ExceptT SyntaxError (State ParserState) a
-> (a -> ExceptT SyntaxError (State ParserState) b)
-> ExceptT SyntaxError (State ParserState) b
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
(Happy_Prelude.>>=)
happyReturn :: () => a -> (ParserMonad a)
happyReturn :: forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn = (a -> ExceptT SyntaxError (State ParserState) a
forall a. a -> ExceptT SyntaxError (State ParserState) a
forall (m :: * -> *) a. Monad m => a -> m a
Happy_Prelude.return)
#if __GLASGOW_HASKELL__ >= 710
happyParse :: () => Happy_GHC_Exts.Int# -> ParserMonad (HappyAbsSyn _ _ _ _)

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

happyDoAction :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> (ParserMonad (HappyAbsSyn _ _ _ _))

happyReduceArr :: () => Happy_Data_Array.Array Happy_Prelude.Int (Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> (ParserMonad (HappyAbsSyn _ _ _ _)))

#endif
happyThen1 :: () => ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen1 :: forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen1 = ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen
happyFmap1 :: (t -> b) -> ParserMonad t -> ParserMonad b
happyFmap1 t -> b
f ParserMonad t
m = ParserMonad t -> (t -> ParserMonad b) -> ParserMonad b
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ParserMonad t
m (\t
a -> b -> ParserMonad b
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (t -> b
f t
a))
happyReturn1 :: () => a -> (ParserMonad a)
happyReturn1 :: forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn1 = a -> ParserMonad a
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn
happyReport' :: () => (L Token) -> [Happy_Prelude.String] -> (ParserMonad a) -> (ParserMonad a)
happyReport' :: forall a. L Token -> [String] -> ParserMonad a -> ParserMonad a
happyReport' = (\L Token
tokens [String]
expected ParserMonad a
resume -> (forall a. (L Token, [String]) -> ParserMonad a
parseError) (L Token
tokens, [String]
expected))

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

prog :: ParserMonad UncheckedProg
prog = ParserMonad UncheckedProg
happySomeParser where
 happySomeParser :: ParserMonad UncheckedProg
happySomeParser = ParserMonad
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> ParserMonad UncheckedProg)
-> ParserMonad UncheckedProg
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen (Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyParse Int#
0#) (\HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x -> UncheckedProg -> ParserMonad UncheckedProg
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (let {(HappyWrap10 UncheckedProg
x') = HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyWrap10
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap10
happyOut10 HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x} in UncheckedProg
x'))

futharkType :: ParserMonad UncheckedTypeExp
futharkType = ParserMonad UncheckedTypeExp
happySomeParser where
 happySomeParser :: ParserMonad UncheckedTypeExp
happySomeParser = ParserMonad
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> ParserMonad UncheckedTypeExp)
-> ParserMonad UncheckedTypeExp
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen (Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyParse Int#
1#) (\HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x -> UncheckedTypeExp -> ParserMonad UncheckedTypeExp
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (let {(HappyWrap40 UncheckedTypeExp
x') = HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyWrap40
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap40
happyOut40 HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x} in UncheckedTypeExp
x'))

expression :: ParserMonad UncheckedExp
expression = ParserMonad UncheckedExp
happySomeParser where
 happySomeParser :: ParserMonad UncheckedExp
happySomeParser = ParserMonad
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> ParserMonad UncheckedExp)
-> ParserMonad UncheckedExp
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen (Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyParse Int#
2#) (\HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x -> UncheckedExp -> ParserMonad UncheckedExp
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (let {(HappyWrap58 UncheckedExp
x') = HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyWrap58
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap58
happyOut58 HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x} in UncheckedExp
x'))

modExpression :: ParserMonad UncheckedModExp
modExpression = ParserMonad UncheckedModExp
happySomeParser where
 happySomeParser :: ParserMonad UncheckedModExp
happySomeParser = ParserMonad
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> ParserMonad UncheckedModExp)
-> ParserMonad UncheckedModExp
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen (Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyParse Int#
3#) (\HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x -> UncheckedModExp -> ParserMonad UncheckedModExp
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (let {(HappyWrap18 UncheckedModExp
x') = HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyWrap18
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap18
happyOut18 HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x} in UncheckedModExp
x'))

declaration :: ParserMonad UncheckedDec
declaration = ParserMonad UncheckedDec
happySomeParser where
 happySomeParser :: ParserMonad UncheckedDec
happySomeParser = ParserMonad
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> ParserMonad UncheckedDec)
-> ParserMonad UncheckedDec
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen (Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyParse Int#
4#) (\HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x -> UncheckedDec -> ParserMonad UncheckedDec
forall a. a -> ExceptT SyntaxError (State ParserState) a
happyReturn (let {(HappyWrap11 UncheckedDec
x') = HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyWrap11
forall {k} {k} {k} {k} (t99 :: k) (t100 :: k) (t101 :: k)
       (t102 :: k).
HappyAbsSyn t99 t100 t101 t102 -> HappyWrap11
happyOut11 HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x} in UncheckedDec
x'))

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



#define HAPPY_COERCE 1
-- $Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp $

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

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

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

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

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

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

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

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

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

happyParse :: Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyParse Int#
start_state = Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyNewToken Int#
start_state Happy_IntList
forall a. a
notHappyAtAll HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
forall a. a
notHappyAtAll

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

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

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

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

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

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

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

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

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

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

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

data HappyAddr = HappyA# Happy_GHC_Exts.Addr#

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

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

happyShift Int#
new_state Int#
i L Token
tk Int#
st Happy_IntList
sts HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
stk =
     Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyNewToken Int#
new_state (Int# -> Happy_IntList -> Happy_IntList
HappyCons Int#
st Happy_IntList
sts) (MK_TOKEN(tk) `HappyStk` stk)

-- happyReduce is specialised for the common cases.

happySpecReduce_0 :: Int#
-> HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0 Int#
nt HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
fn Int#
j L Token
tk Int#
st Happy_IntList
sts HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
stk
     = HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall a b. a -> b -> b
happySeq HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
fn (Int#
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyGoto Int#
nt Int#
j L Token
tk Int#
st (Int# -> Happy_IntList -> Happy_IntList
HappyCons Int#
st Happy_IntList
sts) (HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
fn HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
stk))

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

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

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

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

happyMonadReduce :: Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedModTypeExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
k Int#
nt HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> L Token
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
fn Int#
j L Token
tk Int#
st Happy_IntList
sts HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
stk =
      case Int# -> Happy_IntList -> Happy_IntList
happyDrop Int#
k (Int# -> Happy_IntList -> Happy_IntList
HappyCons Int#
st Happy_IntList
sts) of
        sts1 :: Happy_IntList
sts1@(HappyCons Int#
st1 Happy_IntList
_) ->
          let drop_stk :: HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
drop_stk = Int#
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall {a}. Int# -> HappyStk a -> HappyStk a
happyDropStk Int#
k HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
stk in
          Int#
j Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall a. Int# -> a -> a
`happyTcHack` ParserMonad
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> (HappyAbsSyn
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedModTypeExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedModTypeExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen1 (HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
-> L Token
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
fn HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
stk L Token
tk)
                                     (\HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
r -> Int#
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyGoto Int#
nt Int#
j L Token
tk Int#
st1 Happy_IntList
sts1 (HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
r HappyAbsSyn
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedModTypeExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedModTypeExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk
  (HappyAbsSyn
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedModTypeExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
drop_stk))

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

-- Internal happy errors:

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

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

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

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

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

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

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

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

-- end of Happy Template.