{-# OPTIONS -fglasgow-exts -cpp #-}
module NewParser (

   parse,
   ParseResult (..),

) where

import Char
import Lexer
import ParseMonad
import qualified ParseTree
import Lift
import Array
#if __GLASGOW_HASKELL__ >= 503
import GHC.Exts
#else
import GlaExts
#endif

-- parser produced by Happy Version 1.15

newtype HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32 = HappyAbsSyn (() -> ())
happyIn4 :: t4 -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn4 x = unsafeCoerce# x
{-# INLINE happyIn4 #-}
happyOut4 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> t4
happyOut4 x = unsafeCoerce# x
{-# INLINE happyOut4 #-}
happyIn5 :: (ParseTree.LineNumber) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn5 x = unsafeCoerce# x
{-# INLINE happyIn5 #-}
happyOut5 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.LineNumber)
happyOut5 x = unsafeCoerce# x
{-# INLINE happyOut5 #-}
happyIn6 :: t6 -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn6 x = unsafeCoerce# x
{-# INLINE happyIn6 #-}
happyOut6 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> t6
happyOut6 x = unsafeCoerce# x
{-# INLINE happyOut6 #-}
happyIn7 :: t7 -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn7 x = unsafeCoerce# x
{-# INLINE happyIn7 #-}
happyOut7 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> t7
happyOut7 x = unsafeCoerce# x
{-# INLINE happyOut7 #-}
happyIn8 :: (ParseTree.TypeSyn) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn8 x = unsafeCoerce# x
{-# INLINE happyIn8 #-}
happyOut8 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.TypeSyn)
happyOut8 x = unsafeCoerce# x
{-# INLINE happyOut8 #-}
happyIn9 :: (ParseTree.TypeDecl) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn9 x = unsafeCoerce# x
{-# INLINE happyIn9 #-}
happyOut9 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.TypeDecl)
happyOut9 x = unsafeCoerce# x
{-# INLINE happyOut9 #-}
happyIn10 :: t10 -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn10 x = unsafeCoerce# x
{-# INLINE happyIn10 #-}
happyOut10 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> t10
happyOut10 x = unsafeCoerce# x
{-# INLINE happyOut10 #-}
happyIn11 :: t11 -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn11 x = unsafeCoerce# x
{-# INLINE happyIn11 #-}
happyOut11 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> t11
happyOut11 x = unsafeCoerce# x
{-# INLINE happyOut11 #-}
happyIn12 :: (ParseTree.AtomType) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn12 x = unsafeCoerce# x
{-# INLINE happyIn12 #-}
happyOut12 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.AtomType)
happyOut12 x = unsafeCoerce# x
{-# INLINE happyOut12 #-}
happyIn13 :: (ParseTree.TypeClass) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn13 x = unsafeCoerce# x
{-# INLINE happyIn13 #-}
happyOut13 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.TypeClass)
happyOut13 x = unsafeCoerce# x
{-# INLINE happyOut13 #-}
happyIn14 :: (ParseTree.TypeDef) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn14 x = unsafeCoerce# x
{-# INLINE happyIn14 #-}
happyOut14 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.TypeDef)
happyOut14 x = unsafeCoerce# x
{-# INLINE happyOut14 #-}
happyIn15 :: ([ParseTree.TypeDef]) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn15 x = unsafeCoerce# x
{-# INLINE happyIn15 #-}
happyOut15 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> ([ParseTree.TypeDef])
happyOut15 x = unsafeCoerce# x
{-# INLINE happyOut15 #-}
happyIn16 :: (ParseTree.AtomType) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn16 x = unsafeCoerce# x
{-# INLINE happyIn16 #-}
happyOut16 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.AtomType)
happyOut16 x = unsafeCoerce# x
{-# INLINE happyOut16 #-}
happyIn17 :: (ParseTree.TypeDef) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn17 x = unsafeCoerce# x
{-# INLINE happyIn17 #-}
happyOut17 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.TypeDef)
happyOut17 x = unsafeCoerce# x
{-# INLINE happyOut17 #-}
happyIn18 :: ([ParseTree.TypeDef]) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn18 x = unsafeCoerce# x
{-# INLINE happyIn18 #-}
happyOut18 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> ([ParseTree.TypeDef])
happyOut18 x = unsafeCoerce# x
{-# INLINE happyOut18 #-}
happyIn19 :: t19 -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn19 x = unsafeCoerce# x
{-# INLINE happyIn19 #-}
happyOut19 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> t19
happyOut19 x = unsafeCoerce# x
{-# INLINE happyOut19 #-}
happyIn20 :: t20 -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn20 x = unsafeCoerce# x
{-# INLINE happyIn20 #-}
happyOut20 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> t20
happyOut20 x = unsafeCoerce# x
{-# INLINE happyOut20 #-}
happyIn21 :: ([ParseTree.TypeDef]) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn21 x = unsafeCoerce# x
{-# INLINE happyIn21 #-}
happyOut21 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> ([ParseTree.TypeDef])
happyOut21 x = unsafeCoerce# x
{-# INLINE happyOut21 #-}
happyIn22 :: t22 -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn22 x = unsafeCoerce# x
{-# INLINE happyIn22 #-}
happyOut22 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> t22
happyOut22 x = unsafeCoerce# x
{-# INLINE happyOut22 #-}
happyIn23 :: t23 -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn23 x = unsafeCoerce# x
{-# INLINE happyIn23 #-}
happyOut23 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> t23
happyOut23 x = unsafeCoerce# x
{-# INLINE happyOut23 #-}
happyIn24 :: t24 -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn24 x = unsafeCoerce# x
{-# INLINE happyIn24 #-}
happyOut24 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> t24
happyOut24 x = unsafeCoerce# x
{-# INLINE happyOut24 #-}
happyIn25 :: (ParseTree.Grammar) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn25 x = unsafeCoerce# x
{-# INLINE happyIn25 #-}
happyOut25 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.Grammar)
happyOut25 x = unsafeCoerce# x
{-# INLINE happyOut25 #-}
happyIn26 :: ([String]) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn26 x = unsafeCoerce# x
{-# INLINE happyIn26 #-}
happyOut26 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> ([String])
happyOut26 x = unsafeCoerce# x
{-# INLINE happyOut26 #-}
happyIn27 :: ([ParseTree.GrammarFunDef]) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn27 x = unsafeCoerce# x
{-# INLINE happyIn27 #-}
happyOut27 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> ([ParseTree.GrammarFunDef])
happyOut27 x = unsafeCoerce# x
{-# INLINE happyOut27 #-}
happyIn28 :: (ParseTree.GrammarFunDef) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn28 x = unsafeCoerce# x
{-# INLINE happyIn28 #-}
happyOut28 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.GrammarFunDef)
happyOut28 x = unsafeCoerce# x
{-# INLINE happyOut28 #-}
happyIn29 :: ([ParseTree.GrammarFunDef]) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn29 x = unsafeCoerce# x
{-# INLINE happyIn29 #-}
happyOut29 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> ([ParseTree.GrammarFunDef])
happyOut29 x = unsafeCoerce# x
{-# INLINE happyOut29 #-}
happyIn30 :: (ParseTree.Production) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn30 x = unsafeCoerce# x
{-# INLINE happyIn30 #-}
happyOut30 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.Production)
happyOut30 x = unsafeCoerce# x
{-# INLINE happyOut30 #-}
happyIn31 :: ([ParseTree.LCExpression]) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn31 x = unsafeCoerce# x
{-# INLINE happyIn31 #-}
happyOut31 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> ([ParseTree.LCExpression])
happyOut31 x = unsafeCoerce# x
{-# INLINE happyOut31 #-}
happyIn32 :: t32 -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn32 x = unsafeCoerce# x
{-# INLINE happyIn32 #-}
happyOut32 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> t32
happyOut32 x = unsafeCoerce# x
{-# INLINE happyOut32 #-}
happyIn33 :: (ParseTree.LCExpression) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn33 x = unsafeCoerce# x
{-# INLINE happyIn33 #-}
happyOut33 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.LCExpression)
happyOut33 x = unsafeCoerce# x
{-# INLINE happyOut33 #-}
happyIn34 :: (ParseTree.Expression) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn34 x = unsafeCoerce# x
{-# INLINE happyIn34 #-}
happyOut34 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.Expression)
happyOut34 x = unsafeCoerce# x
{-# INLINE happyOut34 #-}
happyIn35 :: ([ParseTree.FunDef]) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn35 x = unsafeCoerce# x
{-# INLINE happyIn35 #-}
happyOut35 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> ([ParseTree.FunDef])
happyOut35 x = unsafeCoerce# x
{-# INLINE happyOut35 #-}
happyIn36 :: (ParseTree.FunDef) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn36 x = unsafeCoerce# x
{-# INLINE happyIn36 #-}
happyOut36 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.FunDef)
happyOut36 x = unsafeCoerce# x
{-# INLINE happyOut36 #-}
happyIn37 :: ([ParseTree.Parameter]) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn37 x = unsafeCoerce# x
{-# INLINE happyIn37 #-}
happyOut37 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> ([ParseTree.Parameter])
happyOut37 x = unsafeCoerce# x
{-# INLINE happyOut37 #-}
happyIn38 :: (ParseTree.Parameter) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn38 x = unsafeCoerce# x
{-# INLINE happyIn38 #-}
happyOut38 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.Parameter)
happyOut38 x = unsafeCoerce# x
{-# INLINE happyOut38 #-}
happyIn39 :: ([ParseTree.Parameter]) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn39 x = unsafeCoerce# x
{-# INLINE happyIn39 #-}
happyOut39 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> ([ParseTree.Parameter])
happyOut39 x = unsafeCoerce# x
{-# INLINE happyOut39 #-}
happyIn40 :: (ParseTree.Expression) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn40 x = unsafeCoerce# x
{-# INLINE happyIn40 #-}
happyOut40 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.Expression)
happyOut40 x = unsafeCoerce# x
{-# INLINE happyOut40 #-}
happyIn41 :: (ParseTree.Expression) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn41 x = unsafeCoerce# x
{-# INLINE happyIn41 #-}
happyOut41 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.Expression)
happyOut41 x = unsafeCoerce# x
{-# INLINE happyOut41 #-}
happyIn42 :: ([ParseTree.Expression]) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn42 x = unsafeCoerce# x
{-# INLINE happyIn42 #-}
happyOut42 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> ([ParseTree.Expression])
happyOut42 x = unsafeCoerce# x
{-# INLINE happyOut42 #-}
happyIn43 :: (ParseTree.Expression) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn43 x = unsafeCoerce# x
{-# INLINE happyIn43 #-}
happyOut43 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.Expression)
happyOut43 x = unsafeCoerce# x
{-# INLINE happyOut43 #-}
happyIn44 :: ([ParseTree.Expression]) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn44 x = unsafeCoerce# x
{-# INLINE happyIn44 #-}
happyOut44 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> ([ParseTree.Expression])
happyOut44 x = unsafeCoerce# x
{-# INLINE happyOut44 #-}
happyIn45 :: (ParseTree.Expression) -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyIn45 x = unsafeCoerce# x
{-# INLINE happyIn45 #-}
happyOut45 :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> (ParseTree.Expression)
happyOut45 x = unsafeCoerce# x
{-# INLINE happyOut45 #-}
happyInTok :: Token -> (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32)
happyInTok x = unsafeCoerce# x
{-# INLINE happyInTok #-}
happyOutTok :: (HappyAbsSyn t4 t6 t7 t10 t11 t19 t20 t22 t23 t24 t32) -> Token
happyOutTok x = unsafeCoerce# x
{-# INLINE happyOutTok #-}

happyActOffsets :: HappyAddr
happyActOffsets = HappyA# "\xdd\x02\xdd\x02\x00\x00\xcf\x02\xb2\x01\xda\x02\xe1\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd9\x02\xd6\x02\xd3\x02\xfc\x02\xd4\x02\x36\x00\xdb\x02\xfb\x02\xf9\x02\xe0\x02\x00\x00\xf5\x02\xcb\x02\xf4\x02\x36\x00\x00\x00\xd2\x02\xd0\x02\x00\x00\x00\x00\x36\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf2\x02\xee\x02\xea\x02\x36\x00\x36\x00\x97\x00\xf6\x00\x00\x00\x00\x00\x00\x00\x00\x00\x36\x00\x36\x00\xca\x02\xce\x02\xe7\x02\xc9\x02\xe4\x02\xc7\x02\xde\x02\x00\x00\x00\x00\xc8\x02\xc6\x02\xc6\x02\x36\x00\x00\x00\x00\x00\x9d\x01\xc5\x02\xdc\x02\xd7\x02\x00\x00\x00\x00\x36\x00\xf2\xff\xd5\x02\xc4\x02\xc3\x02\xc2\x02\x00\x00\x36\x00\x00\x00\xbf\x02\xcc\x02\x00\x00\xc1\x02\x00\x00\xbc\x02\x84\x00\xbc\x02\xbe\x02\xcd\x02\xbd\x02\x00\x00\x5d\x00\x00\x00\x00\x00\x84\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x84\x00\x84\x00\xa6\x02\xb9\x02\x87\x00\xd3\x00\x00\x00\x00\x00\x84\x00\x36\x00\xbb\x02\xc0\x02\xba\x02\xb8\x02\xb6\x02\xb5\x02\x84\x00\x00\x00\x00\x00\x00\x00\xb7\x02\xb3\x02\xb4\x02\x48\x01\xb0\x02\xa8\x02\xa9\x02\x00\x00\x2d\x00\xa5\x02\xb1\x02\xb2\x02\x00\x00\x00\x00\x84\x00\x00\x00\x00\x00\x59\x00\xae\x02\x59\x00\x00\x00\x00\x00\x59\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa3\x02\x59\x00\x77\x02\xa1\x02\xa4\x02\x00\x00\x00\x00\xa2\x02\x00\x00\x0b\x00\xbe\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x54\x00\x06\x00\x06\x00\x06\x00\x26\x00\x59\x00\x55\x00\xa0\x02\x9f\x02\x0d\x00\x6e\x02\x9e\x02\x9d\x02\x9c\x02\x99\x02\x00\x00\x2e\x00\x9b\x02\x97\x02\x00\x00\x59\x01\x06\x00\xf5\x00\x9f\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x06\x00\x06\x00\x06\x00\x06\x00\x06\x00\x06\x00\x06\x00\x06\x00\x06\x00\x06\x00\x06\x00\x06\x00\x06\x00\x06\x00\x06\x00\xb0\x01\xb0\x01\xb0\x01\xb0\x01\xb0\x01\xb0\x01\x20\x01\x68\x01\x68\x01\x00\x00\x96\x02\x96\x02\xd3\x01\xd3\x01\xd9\x00\x00\x00\x06\x00\x06\x00\x00\x00\x70\x01\x06\x00\x00\x00\x00\x00\x13\x00\x8c\x00\x13\x00\x02\x00\x02\x00\x02\x00\x02\x00\x00\x00\x00\x00\x00\x00\x88\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x3e\x01\x94\x02\x93\x02\x91\x02\x90\x02\x8e\x02\x02\x00\xaf\x02\x02\x00\x02\x00\x07\x00\x00\x00\x02\x00\x88\x00\x82\x00\x7e\x00\x5e\x00\x8d\x02\x00\x00\x00\x00\x94\x01\x11\x01\x8a\x02\xae\x00\x06\x00\x00\x00\x51\x02\x06\x00\x00\x00\x06\x00\x00\x00\x85\x02\x9a\x02\x9a\x02\x9a\x02\x9a\x02\x42\x00\x84\x02\x00\x00\x00\x00\xad\x02\x08\x00\x42\x00\x00\x00\x68\x02\xab\x02\xac\x02\x7e\x02\xaa\x02\x7c\x02\x8b\x02\x7b\x02\x87\x02\x83\x02\x78\x02\x49\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x06\x00\x00\x00\xa2\x01\x00\x00\x42\x01\x00\x00\x00\x00\x00\x00\x82\x02\x73\x02\x81\x02\x6f\x02\x80\x02\x67\x02\x00\x00\x01\x00\x39\x02\x7f\x02\x35\x02\x5f\x02\x2d\x02\x76\x02\x29\x02\x4f\x02\x23\x02\x00\x00\x2a\x01\x1c\x02\x11\x00\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x43\x02\x7d\x02\x00\x00\xa2\x01\x1b\x02\x06\x00\x3b\x02\x19\x02\xa2\x01\x00\x00\x00\x00"#

happyGotoOffsets :: HappyAddr
happyGotoOffsets = HappyA# "\x38\x02\x00\x00\xb1\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf1\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x98\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1f\x02\x95\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x92\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x8f\x02\x8c\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x89\x02\x86\x02\x00\x00\x00\x00\x1d\x02\x00\x00\x28\x02\x00\x00\x24\x02\x1c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x15\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0f\x00\x00\x00\x99\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x11\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x14\x02\x2f\x01\x10\x02\x00\x00\x00\x00\x00\x00\x00\x00\x15\x01\x00\x00\x00\x00\x03\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfb\x01\xf9\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb5\x01\x6b\x01\x00\x00\x00\x00\x00\x00\xef\x01\x00\x00\x00\x00\x64\x01\x00\x00\x00\x00\x9d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x9c\x00\x00\x00\x00\x00\x00\x00\xab\x01\x00\x00\x00\x00\x31\x01\x60\x00\x00\x00\x3b\x01\x00\x00\x06\x01\x00\x00\x00\x00\x69\x01\x00\x00\x00\x00\x00\x00\x66\x00\x00\x00\x9e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x66\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf7\x00\x62\x02\x5e\x02\x5a\x02\xfb\xff\xe1\x00\xe7\x01\x00\x00\x00\x00\x96\x00\x89\x01\x00\x00\x00\x00\x00\x00\x00\x00\x38\x01\xe6\x01\x00\x00\x00\x00\x00\x00\x00\x00\x56\x02\x00\x00\x00\x00\x00\x00\x52\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x02\x4e\x02\x4a\x02\x46\x02\x42\x02\x3e\x02\x3a\x02\x36\x02\x32\x02\x2e\x02\x2a\x02\x26\x02\x22\x02\x1e\x02\x1a\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\x16\x02\xf1\x01\x00\x00\x00\x00\x12\x02\x00\x00\x00\x00\xf9\xff\x00\x00\xe5\x00\x9e\x01\xe2\x00\xde\x00\xd7\x00\x00\x00\x22\x01\x00\x00\x00\x00\x0a\x01\x00\x01\xa8\x00\xa4\x00\x8d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x91\x00\x00\x00\x8e\x00\x85\x00\x89\x00\x4e\x00\x5f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xed\x01\x00\x00\x00\x00\x0d\x02\x00\x00\x1d\x01\x00\x00\x00\x00\x73\x00\x70\x00\x49\x00\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x38\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x09\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\xef\x00\x05\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1b\x00\x00\x00\x00\x00\x00\x00\xdf\xff\x01\x02\xe0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfd\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#

happyDefActions :: HappyAddr
happyDefActions = HappyA# "\x00\x00\x00\x00\xfd\xff\x00\x00\x00\x00\x00\x00\xfc\xff\xf7\xff\xf6\xff\xfa\xff\xf9\xff\xf8\xff\xfd\xff\xfe\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfb\xff\x00\x00\x00\x00\xbf\xff\x00\x00\xe3\xff\x00\x00\xf4\xff\xe7\xff\xe8\xff\x00\x00\xf0\xff\xef\xff\xee\xff\xed\xff\xec\xff\xeb\xff\xea\xff\xe9\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe4\xff\xe5\xff\xe6\xff\xe2\xff\x00\x00\x00\x00\xf5\xff\x00\x00\xbf\xff\x00\x00\x00\x00\x00\x00\xf2\xff\xfd\xff\xbe\xff\x00\x00\xdd\xff\xe1\xff\x00\x00\xde\xff\xe0\xff\xdc\xff\x00\x00\x00\x00\x00\x00\xfd\xff\xf1\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xdf\xff\x00\x00\xdb\xff\x00\x00\x00\x00\xc8\xff\x00\x00\xf3\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd1\xff\xc6\xff\xc7\xff\xd2\xff\x00\x00\xda\xff\xd9\xff\xd8\xff\xd7\xff\xd6\xff\xd5\xff\xd4\xff\xd3\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd0\xff\xc5\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xcb\xff\xcf\xff\x00\x00\xcc\xff\xce\xff\xfd\xff\x00\x00\x00\x00\x9d\xff\xca\xff\x00\x00\x00\x00\xc2\xff\xfd\xff\x00\x00\x00\x00\xbd\xff\x00\x00\xc3\xff\xcd\xff\x00\x00\xfd\xff\xc4\xff\x99\xff\x00\x00\x99\xff\x97\xff\x96\xff\x00\x00\x9c\xff\xc9\xff\xc1\xff\xfd\xff\x00\x00\x99\xff\x00\x00\x00\x00\x00\x00\xc0\xff\xbc\xff\x00\x00\x98\xff\x00\x00\x9b\xff\x92\xff\x80\xff\x7f\xff\x7e\xff\x7d\xff\x77\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb1\xff\xfd\xff\x00\x00\x00\x00\x00\x00\x00\x00\xfd\xff\x00\x00\x94\xff\x00\x00\x91\xff\x00\x00\x00\x00\x00\x00\x00\x00\x78\xff\x77\xff\x74\xff\x73\xff\x72\xff\x75\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\x85\xff\x86\xff\x89\xff\x8a\xff\x87\xff\x88\xff\x82\xff\x83\xff\x84\xff\x8b\xff\x8c\xff\x8d\xff\x8e\xff\x8f\xff\x00\x00\x76\xff\x00\x00\x00\x00\x7c\xff\x00\x00\x00\x00\x9a\xff\x95\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa9\xff\xfd\xff\xbb\xff\x00\x00\xfd\xff\xfd\xff\xfd\xff\xfd\xff\xfd\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfd\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa8\xff\x93\xff\x00\x00\x7a\xff\x00\x00\x00\x00\x00\x00\x71\xff\x00\x00\x00\x00\x7b\xff\x00\x00\x81\xff\x00\x00\xb1\xff\xb1\xff\xb1\xff\xb1\xff\xad\xff\x00\x00\xab\xff\x9f\xff\x00\x00\xae\xff\xac\xff\xaf\xff\xaa\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb0\xff\xba\xff\xb9\xff\xb8\xff\xb7\xff\x00\x00\x79\xff\x90\xff\x70\xff\x00\x00\x9e\xff\xb2\xff\xb3\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfd\xff\x00\x00\x00\x00\xa6\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa4\xff\xa7\xff\xa2\xff\x00\x00\x00\x00\x00\x00\xfd\xff\xa3\xff\xb4\xff\xb5\xff\x00\x00\x00\x00\xa5\xff\xa0\xff\x00\x00\x00\x00\x00\x00\x00\x00\xa1\xff\xb6\xff"#

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

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

happyReduceArr = array (1, 143) [
	(1 , happyReduce_1),
	(2 , happyReduce_2),
	(3 , happyReduce_3),
	(4 , happyReduce_4),
	(5 , happyReduce_5),
	(6 , happyReduce_6),
	(7 , happyReduce_7),
	(8 , happyReduce_8),
	(9 , happyReduce_9),
	(10 , happyReduce_10),
	(11 , happyReduce_11),
	(12 , happyReduce_12),
	(13 , happyReduce_13),
	(14 , happyReduce_14),
	(15 , happyReduce_15),
	(16 , happyReduce_16),
	(17 , happyReduce_17),
	(18 , happyReduce_18),
	(19 , happyReduce_19),
	(20 , happyReduce_20),
	(21 , happyReduce_21),
	(22 , happyReduce_22),
	(23 , happyReduce_23),
	(24 , happyReduce_24),
	(25 , happyReduce_25),
	(26 , happyReduce_26),
	(27 , happyReduce_27),
	(28 , happyReduce_28),
	(29 , happyReduce_29),
	(30 , happyReduce_30),
	(31 , happyReduce_31),
	(32 , happyReduce_32),
	(33 , happyReduce_33),
	(34 , happyReduce_34),
	(35 , happyReduce_35),
	(36 , happyReduce_36),
	(37 , happyReduce_37),
	(38 , happyReduce_38),
	(39 , happyReduce_39),
	(40 , happyReduce_40),
	(41 , happyReduce_41),
	(42 , happyReduce_42),
	(43 , happyReduce_43),
	(44 , happyReduce_44),
	(45 , happyReduce_45),
	(46 , happyReduce_46),
	(47 , happyReduce_47),
	(48 , happyReduce_48),
	(49 , happyReduce_49),
	(50 , happyReduce_50),
	(51 , happyReduce_51),
	(52 , happyReduce_52),
	(53 , happyReduce_53),
	(54 , happyReduce_54),
	(55 , happyReduce_55),
	(56 , happyReduce_56),
	(57 , happyReduce_57),
	(58 , happyReduce_58),
	(59 , happyReduce_59),
	(60 , happyReduce_60),
	(61 , happyReduce_61),
	(62 , happyReduce_62),
	(63 , happyReduce_63),
	(64 , happyReduce_64),
	(65 , happyReduce_65),
	(66 , happyReduce_66),
	(67 , happyReduce_67),
	(68 , happyReduce_68),
	(69 , happyReduce_69),
	(70 , happyReduce_70),
	(71 , happyReduce_71),
	(72 , happyReduce_72),
	(73 , happyReduce_73),
	(74 , happyReduce_74),
	(75 , happyReduce_75),
	(76 , happyReduce_76),
	(77 , happyReduce_77),
	(78 , happyReduce_78),
	(79 , happyReduce_79),
	(80 , happyReduce_80),
	(81 , happyReduce_81),
	(82 , happyReduce_82),
	(83 , happyReduce_83),
	(84 , happyReduce_84),
	(85 , happyReduce_85),
	(86 , happyReduce_86),
	(87 , happyReduce_87),
	(88 , happyReduce_88),
	(89 , happyReduce_89),
	(90 , happyReduce_90),
	(91 , happyReduce_91),
	(92 , happyReduce_92),
	(93 , happyReduce_93),
	(94 , happyReduce_94),
	(95 , happyReduce_95),
	(96 , happyReduce_96),
	(97 , happyReduce_97),
	(98 , happyReduce_98),
	(99 , happyReduce_99),
	(100 , happyReduce_100),
	(101 , happyReduce_101),
	(102 , happyReduce_102),
	(103 , happyReduce_103),
	(104 , happyReduce_104),
	(105 , happyReduce_105),
	(106 , happyReduce_106),
	(107 , happyReduce_107),
	(108 , happyReduce_108),
	(109 , happyReduce_109),
	(110 , happyReduce_110),
	(111 , happyReduce_111),
	(112 , happyReduce_112),
	(113 , happyReduce_113),
	(114 , happyReduce_114),
	(115 , happyReduce_115),
	(116 , happyReduce_116),
	(117 , happyReduce_117),
	(118 , happyReduce_118),
	(119 , happyReduce_119),
	(120 , happyReduce_120),
	(121 , happyReduce_121),
	(122 , happyReduce_122),
	(123 , happyReduce_123),
	(124 , happyReduce_124),
	(125 , happyReduce_125),
	(126 , happyReduce_126),
	(127 , happyReduce_127),
	(128 , happyReduce_128),
	(129 , happyReduce_129),
	(130 , happyReduce_130),
	(131 , happyReduce_131),
	(132 , happyReduce_132),
	(133 , happyReduce_133),
	(134 , happyReduce_134),
	(135 , happyReduce_135),
	(136 , happyReduce_136),
	(137 , happyReduce_137),
	(138 , happyReduce_138),
	(139 , happyReduce_139),
	(140 , happyReduce_140),
	(141 , happyReduce_141),
	(142 , happyReduce_142),
	(143 , happyReduce_143)
	]

happy_n_terms = 77 :: Int
happy_n_nonterms = 42 :: Int

happyReduce_1 = happyMonadReduce 3# 0# happyReduction_1
happyReduction_1 (happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = happyThen (case happyOut6 happy_x_2 of { happy_var_2 -> 
	 assignBlocks happy_var_2}
	) (\r -> happyReturn (happyIn4 r))

happyReduce_2 = happyMonadReduce 0# 1# happyReduction_2
happyReduction_2 (happyRest)
	 = happyThen ( getLineNo
	) (\r -> happyReturn (happyIn5 r))

happyReduce_3 = happySpecReduce_1 2# happyReduction_3
happyReduction_3 happy_x_1
	 =  case happyOut7 happy_x_1 of { happy_var_1 -> 
	happyIn6
		 ([happy_var_1]
	)}

happyReduce_4 = happySpecReduce_3 2# happyReduction_4
happyReduction_4 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut7 happy_x_1 of { happy_var_1 -> 
	case happyOut6 happy_x_3 of { happy_var_3 -> 
	happyIn6
		 (happy_var_1 : happy_var_3
	)}}

happyReduce_5 = happySpecReduce_1 3# happyReduction_5
happyReduction_5 happy_x_1
	 =  case happyOut10 happy_x_1 of { happy_var_1 -> 
	happyIn7
		 (AlgebraTypeDef happy_var_1
	)}

happyReduce_6 = happySpecReduce_1 3# happyReduction_6
happyReduction_6 happy_x_1
	 =  case happyOut19 happy_x_1 of { happy_var_1 -> 
	happyIn7
		 (AlgebraDef happy_var_1
	)}

happyReduce_7 = happySpecReduce_1 3# happyReduction_7
happyReduction_7 happy_x_1
	 =  case happyOut25 happy_x_1 of { happy_var_1 -> 
	happyIn7
		 (GrammarDef happy_var_1
	)}

happyReduce_8 = happySpecReduce_1 3# happyReduction_8
happyReduction_8 happy_x_1
	 =  case happyOut8 happy_x_1 of { happy_var_1 -> 
	happyIn7
		 (TypeSynDef happy_var_1
	)}

happyReduce_9 = happySpecReduce_1 3# happyReduction_9
happyReduction_9 happy_x_1
	 =  case happyOut9 happy_x_1 of { happy_var_1 -> 
	happyIn7
		 (ExternDef happy_var_1
	)}

happyReduce_10 = happyReduce 5# 4# happyReduction_10
happyReduction_10 (happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_3 of { (TypeIdent happy_var_3) -> 
	case happyOut14 happy_x_5 of { happy_var_5 -> 
	happyIn8
		 (ParseTree.TypeSyn happy_var_1 happy_var_3 happy_var_5
	) `HappyStk` happyRest}}}

happyReduce_11 = happyReduce 4# 5# happyReduction_11
happyReduction_11 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (ExternToken happy_var_2) -> 
	case happyOut14 happy_x_4 of { happy_var_4 -> 
	happyIn9
		 (ParseTree.TypeDecl happy_var_1 happy_var_2 happy_var_4
	) `HappyStk` happyRest}}}

happyReduce_12 = happyReduce 9# 6# happyReduction_12
happyReduction_12 (happy_x_9 `HappyStk`
	happy_x_8 `HappyStk`
	happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_5 of { (TypeIdent happy_var_5) -> 
	case happyOut11 happy_x_6 of { happy_var_6 -> 
	case happyOut14 happy_x_8 of { happy_var_8 -> 
	happyIn10
		 (ParseTree.AlgebraType happy_var_1 happy_var_5 happy_var_6 happy_var_8
	) `HappyStk` happyRest}}}}

happyReduce_13 = happySpecReduce_1 7# happyReduction_13
happyReduction_13 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Ident happy_var_1) -> 
	happyIn11
		 ([happy_var_1]
	)}

happyReduce_14 = happySpecReduce_2 7# happyReduction_14
happyReduction_14 happy_x_2
	happy_x_1
	 =  case happyOutTok happy_x_1 of { (Ident happy_var_1) -> 
	case happyOut11 happy_x_2 of { happy_var_2 -> 
	happyIn11
		 (happy_var_1 : happy_var_2
	)}}

happyReduce_15 = happySpecReduce_1 8# happyReduction_15
happyReduction_15 happy_x_1
	 =  happyIn12
		 (ParseTree.TInt
	)

happyReduce_16 = happySpecReduce_1 8# happyReduction_16
happyReduction_16 happy_x_1
	 =  happyIn12
		 (ParseTree.TInteger
	)

happyReduce_17 = happySpecReduce_1 8# happyReduction_17
happyReduction_17 happy_x_1
	 =  happyIn12
		 (ParseTree.TFloat
	)

happyReduce_18 = happySpecReduce_1 8# happyReduction_18
happyReduction_18 happy_x_1
	 =  happyIn12
		 (ParseTree.TDouble
	)

happyReduce_19 = happySpecReduce_1 8# happyReduction_19
happyReduction_19 happy_x_1
	 =  happyIn12
		 (ParseTree.TChar
	)

happyReduce_20 = happySpecReduce_1 8# happyReduction_20
happyReduction_20 happy_x_1
	 =  happyIn12
		 (ParseTree.TString
	)

happyReduce_21 = happySpecReduce_1 8# happyReduction_21
happyReduction_21 happy_x_1
	 =  happyIn12
		 (ParseTree.TBool
	)

happyReduce_22 = happySpecReduce_1 8# happyReduction_22
happyReduction_22 happy_x_1
	 =  happyIn12
		 (ParseTree.TVoid
	)

happyReduce_23 = happySpecReduce_1 8# happyReduction_23
happyReduction_23 happy_x_1
	 =  case happyOutTok happy_x_1 of { (TypeIdent happy_var_1) -> 
	happyIn12
		 (ParseTree.TTypeSyn happy_var_1
	)}

happyReduce_24 = happySpecReduce_1 8# happyReduction_24
happyReduction_24 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Ident happy_var_1) -> 
	happyIn12
		 (ParseTree.TTypeVar happy_var_1
	)}

happyReduce_25 = happySpecReduce_2 9# happyReduction_25
happyReduction_25 happy_x_2
	happy_x_1
	 =  case happyOutTok happy_x_2 of { (Ident happy_var_2) -> 
	happyIn13
		 (ParseTree.TCNum      happy_var_2
	)}

happyReduce_26 = happySpecReduce_2 9# happyReduction_26
happyReduction_26 happy_x_2
	happy_x_1
	 =  case happyOutTok happy_x_2 of { (Ident happy_var_2) -> 
	happyIn13
		 (ParseTree.TCIntegral happy_var_2
	)}

happyReduce_27 = happySpecReduce_2 9# happyReduction_27
happyReduction_27 happy_x_2
	happy_x_1
	 =  case happyOutTok happy_x_2 of { (Ident happy_var_2) -> 
	happyIn13
		 (ParseTree.TCFloating happy_var_2
	)}

happyReduce_28 = happySpecReduce_1 10# happyReduction_28
happyReduction_28 happy_x_1
	 =  case happyOut12 happy_x_1 of { happy_var_1 -> 
	happyIn14
		 (ParseTree.SingleType happy_var_1
	)}

happyReduce_29 = happySpecReduce_2 10# happyReduction_29
happyReduction_29 happy_x_2
	happy_x_1
	 =  case happyOut14 happy_x_2 of { happy_var_2 -> 
	happyIn14
		 (ParseTree.TParser happy_var_2
	)}

happyReduce_30 = happySpecReduce_3 10# happyReduction_30
happyReduction_30 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut14 happy_x_1 of { happy_var_1 -> 
	case happyOut14 happy_x_3 of { happy_var_3 -> 
	happyIn14
		 (ParseTree.FunType happy_var_1 happy_var_3
	)}}

happyReduce_31 = happySpecReduce_3 10# happyReduction_31
happyReduction_31 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut14 happy_x_2 of { happy_var_2 -> 
	happyIn14
		 (ParseTree.ListType happy_var_2
	)}

happyReduce_32 = happyReduce 5# 10# happyReduction_32
happyReduction_32 (happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut14 happy_x_2 of { happy_var_2 -> 
	case happyOut15 happy_x_4 of { happy_var_4 -> 
	happyIn14
		 (ParseTree.TypeTuple (happy_var_2:happy_var_4)
	) `HappyStk` happyRest}}

happyReduce_33 = happySpecReduce_3 10# happyReduction_33
happyReduction_33 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut14 happy_x_2 of { happy_var_2 -> 
	happyIn14
		 (happy_var_2
	)}

happyReduce_34 = happySpecReduce_3 10# happyReduction_34
happyReduction_34 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut13 happy_x_1 of { happy_var_1 -> 
	case happyOut14 happy_x_3 of { happy_var_3 -> 
	happyIn14
		 (ParseTree.Constraint happy_var_1 happy_var_3
	)}}

happyReduce_35 = happySpecReduce_1 11# happyReduction_35
happyReduction_35 happy_x_1
	 =  case happyOut14 happy_x_1 of { happy_var_1 -> 
	happyIn15
		 ([happy_var_1]
	)}

happyReduce_36 = happySpecReduce_3 11# happyReduction_36
happyReduction_36 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut14 happy_x_1 of { happy_var_1 -> 
	case happyOut15 happy_x_3 of { happy_var_3 -> 
	happyIn15
		 (happy_var_1:happy_var_3
	)}}

happyReduce_37 = happySpecReduce_1 12# happyReduction_37
happyReduction_37 happy_x_1
	 =  happyIn16
		 (ParseTree.TInt
	)

happyReduce_38 = happySpecReduce_1 12# happyReduction_38
happyReduction_38 happy_x_1
	 =  happyIn16
		 (ParseTree.TInteger
	)

happyReduce_39 = happySpecReduce_1 12# happyReduction_39
happyReduction_39 happy_x_1
	 =  happyIn16
		 (ParseTree.TFloat
	)

happyReduce_40 = happySpecReduce_1 12# happyReduction_40
happyReduction_40 happy_x_1
	 =  happyIn16
		 (ParseTree.TDouble
	)

happyReduce_41 = happySpecReduce_1 12# happyReduction_41
happyReduction_41 happy_x_1
	 =  happyIn16
		 (ParseTree.TChar
	)

happyReduce_42 = happySpecReduce_1 12# happyReduction_42
happyReduction_42 happy_x_1
	 =  happyIn16
		 (ParseTree.TString
	)

happyReduce_43 = happySpecReduce_1 12# happyReduction_43
happyReduction_43 happy_x_1
	 =  happyIn16
		 (ParseTree.TBool
	)

happyReduce_44 = happySpecReduce_1 12# happyReduction_44
happyReduction_44 happy_x_1
	 =  happyIn16
		 (ParseTree.TVoid
	)

happyReduce_45 = happySpecReduce_1 12# happyReduction_45
happyReduction_45 happy_x_1
	 =  case happyOutTok happy_x_1 of { (TypeIdent happy_var_1) -> 
	happyIn16
		 (ParseTree.TTypeSyn happy_var_1
	)}

happyReduce_46 = happySpecReduce_1 13# happyReduction_46
happyReduction_46 happy_x_1
	 =  case happyOut16 happy_x_1 of { happy_var_1 -> 
	happyIn17
		 (ParseTree.SingleType happy_var_1
	)}

happyReduce_47 = happySpecReduce_2 13# happyReduction_47
happyReduction_47 happy_x_2
	happy_x_1
	 =  case happyOut17 happy_x_2 of { happy_var_2 -> 
	happyIn17
		 (ParseTree.TParser happy_var_2
	)}

happyReduce_48 = happySpecReduce_3 13# happyReduction_48
happyReduction_48 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut17 happy_x_1 of { happy_var_1 -> 
	case happyOut17 happy_x_3 of { happy_var_3 -> 
	happyIn17
		 (ParseTree.FunType happy_var_1 happy_var_3
	)}}

happyReduce_49 = happySpecReduce_3 13# happyReduction_49
happyReduction_49 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut17 happy_x_2 of { happy_var_2 -> 
	happyIn17
		 (ParseTree.ListType happy_var_2
	)}

happyReduce_50 = happyReduce 5# 13# happyReduction_50
happyReduction_50 (happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut17 happy_x_2 of { happy_var_2 -> 
	case happyOut18 happy_x_4 of { happy_var_4 -> 
	happyIn17
		 (ParseTree.TypeTuple (happy_var_2:happy_var_4)
	) `HappyStk` happyRest}}

happyReduce_51 = happySpecReduce_3 13# happyReduction_51
happyReduction_51 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut17 happy_x_2 of { happy_var_2 -> 
	happyIn17
		 (happy_var_2
	)}

happyReduce_52 = happySpecReduce_3 13# happyReduction_52
happyReduction_52 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut13 happy_x_1 of { happy_var_1 -> 
	case happyOut14 happy_x_3 of { happy_var_3 -> 
	happyIn17
		 (ParseTree.Constraint happy_var_1 happy_var_3
	)}}

happyReduce_53 = happySpecReduce_1 14# happyReduction_53
happyReduction_53 happy_x_1
	 =  case happyOut17 happy_x_1 of { happy_var_1 -> 
	happyIn18
		 ([happy_var_1]
	)}

happyReduce_54 = happySpecReduce_3 14# happyReduction_54
happyReduction_54 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut17 happy_x_1 of { happy_var_1 -> 
	case happyOut18 happy_x_3 of { happy_var_3 -> 
	happyIn18
		 (happy_var_1:happy_var_3
	)}}

happyReduce_55 = happyReduce 9# 15# happyReduction_55
happyReduction_55 (happy_x_9 `HappyStk`
	happy_x_8 `HappyStk`
	happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOut20 happy_x_7 of { happy_var_7 -> 
	case happyOut22 happy_x_8 of { happy_var_8 -> 
	happyIn19
		 (ParseTree.Algebra happy_var_1 happy_var_7 happy_var_8
	) `HappyStk` happyRest}}}

happyReduce_56 = happyReduce 5# 16# happyReduction_56
happyReduction_56 (happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (Ident happy_var_2) -> 
	case happyOutTok happy_x_4 of { (TypeIdent happy_var_4) -> 
	case happyOut21 happy_x_5 of { happy_var_5 -> 
	happyIn20
		 (ParseTree.AlgebraFunType happy_var_1 happy_var_2 happy_var_4 happy_var_5
	) `HappyStk` happyRest}}}}

happyReduce_57 = happySpecReduce_1 17# happyReduction_57
happyReduction_57 happy_x_1
	 =  case happyOut17 happy_x_1 of { happy_var_1 -> 
	happyIn21
		 ([happy_var_1]
	)}

happyReduce_58 = happySpecReduce_2 17# happyReduction_58
happyReduction_58 happy_x_2
	happy_x_1
	 =  case happyOut17 happy_x_1 of { happy_var_1 -> 
	case happyOut21 happy_x_2 of { happy_var_2 -> 
	happyIn21
		 (happy_var_1 : happy_var_2
	)}}

happyReduce_59 = happyReduce 8# 18# happyReduction_59
happyReduction_59 (happy_x_8 `HappyStk`
	happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (Ident happy_var_2) -> 
	case happyOut23 happy_x_4 of { happy_var_4 -> 
	case happyOut35 happy_x_7 of { happy_var_7 -> 
	happyIn22
		 (ParseTree.AlgebraFunDef happy_var_1 happy_var_2 happy_var_4 happy_var_7
	) `HappyStk` happyRest}}}}

happyReduce_60 = happyReduce 5# 19# happyReduction_60
happyReduction_60 (happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOutTok happy_x_2 of { (Ident happy_var_2) -> 
	case happyOut24 happy_x_4 of { happy_var_4 -> 
	happyIn23
		 (happy_var_2 : happy_var_4
	) `HappyStk` happyRest}}

happyReduce_61 = happySpecReduce_1 20# happyReduction_61
happyReduction_61 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Ident happy_var_1) -> 
	happyIn24
		 ([happy_var_1]
	)}

happyReduce_62 = happySpecReduce_3 20# happyReduction_62
happyReduction_62 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOutTok happy_x_1 of { (Ident happy_var_1) -> 
	case happyOut24 happy_x_3 of { happy_var_3 -> 
	happyIn24
		 (happy_var_1 : happy_var_3
	)}}

happyReduce_63 = happyReduce 17# 21# happyReduction_63
happyReduction_63 (happy_x_17 `HappyStk`
	happy_x_16 `HappyStk`
	happy_x_15 `HappyStk`
	happy_x_14 `HappyStk`
	happy_x_13 `HappyStk`
	happy_x_12 `HappyStk`
	happy_x_11 `HappyStk`
	happy_x_10 `HappyStk`
	happy_x_9 `HappyStk`
	happy_x_8 `HappyStk`
	happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_4 of { (Ident happy_var_4) -> 
	case happyOutTok happy_x_8 of { (Ident happy_var_8) -> 
	case happyOut23 happy_x_11 of { happy_var_11 -> 
	case happyOut27 happy_x_15 of { happy_var_15 -> 
	happyIn25
		 (ParseTree.Grammar happy_var_1 happy_var_4 happy_var_8 (ParseTree.TypeTuple [ParseTree.SingleType ParseTree.TInt, ParseTree.SingleType ParseTree.TInt]) happy_var_11 happy_var_15
	) `HappyStk` happyRest}}}}}

happyReduce_64 = happySpecReduce_0 22# happyReduction_64
happyReduction_64  =  happyIn26
		 ([]
	)

happyReduce_65 = happySpecReduce_2 22# happyReduction_65
happyReduction_65 happy_x_2
	happy_x_1
	 =  happyIn26
		 ([]
	)

happyReduce_66 = happySpecReduce_1 23# happyReduction_66
happyReduction_66 happy_x_1
	 =  case happyOut28 happy_x_1 of { happy_var_1 -> 
	happyIn27
		 ([happy_var_1]
	)}

happyReduce_67 = happySpecReduce_3 23# happyReduction_67
happyReduction_67 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut28 happy_x_1 of { happy_var_1 -> 
	case happyOut27 happy_x_3 of { happy_var_3 -> 
	happyIn27
		 (happy_var_1 : happy_var_3
	)}}

happyReduce_68 = happyReduce 6# 24# happyReduction_68
happyReduction_68 (happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (Ident happy_var_2) -> 
	case happyOut37 happy_x_3 of { happy_var_3 -> 
	case happyOut30 happy_x_5 of { happy_var_5 -> 
	case happyOut29 happy_x_6 of { happy_var_6 -> 
	happyIn28
		 (ParseTree.GrammarFunDef happy_var_1 happy_var_2 happy_var_3 ParseTree.TTFree happy_var_5 happy_var_6
	) `HappyStk` happyRest}}}}}

happyReduce_69 = happyReduce 9# 24# happyReduction_69
happyReduction_69 (happy_x_9 `HappyStk`
	happy_x_8 `HappyStk`
	happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (Ident happy_var_2) -> 
	case happyOut37 happy_x_3 of { happy_var_3 -> 
	case happyOut30 happy_x_7 of { happy_var_7 -> 
	case happyOut29 happy_x_9 of { happy_var_9 -> 
	happyIn28
		 (ParseTree.GrammarFunDef happy_var_1 happy_var_2 happy_var_3 (ParseTree.TTTabulated (True, True))  happy_var_7 happy_var_9
	) `HappyStk` happyRest}}}}}

happyReduce_70 = happyReduce 9# 24# happyReduction_70
happyReduction_70 (happy_x_9 `HappyStk`
	happy_x_8 `HappyStk`
	happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (Ident happy_var_2) -> 
	case happyOut37 happy_x_3 of { happy_var_3 -> 
	case happyOut30 happy_x_7 of { happy_var_7 -> 
	case happyOut29 happy_x_9 of { happy_var_9 -> 
	happyIn28
		 (ParseTree.GrammarFunDef happy_var_1 happy_var_2 happy_var_3 (ParseTree.TTTabulated (True, False)) happy_var_7 happy_var_9
	) `HappyStk` happyRest}}}}}

happyReduce_71 = happyReduce 9# 24# happyReduction_71
happyReduction_71 (happy_x_9 `HappyStk`
	happy_x_8 `HappyStk`
	happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (Ident happy_var_2) -> 
	case happyOut37 happy_x_3 of { happy_var_3 -> 
	case happyOut30 happy_x_7 of { happy_var_7 -> 
	case happyOut29 happy_x_9 of { happy_var_9 -> 
	happyIn28
		 (ParseTree.GrammarFunDef happy_var_1 happy_var_2 happy_var_3 (ParseTree.TTTabulated (False, True)) happy_var_7 happy_var_9
	) `HappyStk` happyRest}}}}}

happyReduce_72 = happyReduce 9# 24# happyReduction_72
happyReduction_72 (happy_x_9 `HappyStk`
	happy_x_8 `HappyStk`
	happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (Ident happy_var_2) -> 
	case happyOut37 happy_x_3 of { happy_var_3 -> 
	case happyOut30 happy_x_7 of { happy_var_7 -> 
	case happyOut29 happy_x_9 of { happy_var_9 -> 
	happyIn28
		 (ParseTree.GrammarFunDef happy_var_1 happy_var_2 happy_var_3 ParseTree.TTNontabulated happy_var_7 happy_var_9
	) `HappyStk` happyRest}}}}}

happyReduce_73 = happyReduce 18# 24# happyReduction_73
happyReduction_73 (happy_x_18 `HappyStk`
	happy_x_17 `HappyStk`
	happy_x_16 `HappyStk`
	happy_x_15 `HappyStk`
	happy_x_14 `HappyStk`
	happy_x_13 `HappyStk`
	happy_x_12 `HappyStk`
	happy_x_11 `HappyStk`
	happy_x_10 `HappyStk`
	happy_x_9 `HappyStk`
	happy_x_8 `HappyStk`
	happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_3 of { (ADPNext happy_var_3) -> 
	case happyOutTok happy_x_10 of { (Num happy_var_10) -> 
	case happyOutTok happy_x_12 of { (Num happy_var_12) -> 
	case happyOutTok happy_x_15 of { (Num happy_var_15) -> 
	case happyOutTok happy_x_17 of { (Num happy_var_17) -> 
	happyIn28
		 (ParseTree.CombinatorDef happy_var_1 happy_var_3 (ParseTree.CombinatorTT (d2i happy_var_10, d2i happy_var_12) (d2i happy_var_15, d2i happy_var_17))
	) `HappyStk` happyRest}}}}}}

happyReduce_74 = happyReduce 14# 24# happyReduction_74
happyReduction_74 (happy_x_14 `HappyStk`
	happy_x_13 `HappyStk`
	happy_x_12 `HappyStk`
	happy_x_11 `HappyStk`
	happy_x_10 `HappyStk`
	happy_x_9 `HappyStk`
	happy_x_8 `HappyStk`
	happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_3 of { (ADPNext happy_var_3) -> 
	case happyOutTok happy_x_9 of { (Num happy_var_9) -> 
	case happyOutTok happy_x_11 of { (Num happy_var_11) -> 
	case happyOutTok happy_x_13 of { (Num happy_var_13) -> 
	happyIn28
		 (ParseTree.CombinatorDef happy_var_1 happy_var_3 (ParseTree.CombinatorSTT (d2i happy_var_9) (d2i happy_var_11, d2i happy_var_13))
	) `HappyStk` happyRest}}}}}

happyReduce_75 = happyReduce 14# 24# happyReduction_75
happyReduction_75 (happy_x_14 `HappyStk`
	happy_x_13 `HappyStk`
	happy_x_12 `HappyStk`
	happy_x_11 `HappyStk`
	happy_x_10 `HappyStk`
	happy_x_9 `HappyStk`
	happy_x_8 `HappyStk`
	happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_3 of { (ADPNext happy_var_3) -> 
	case happyOutTok happy_x_10 of { (Num happy_var_10) -> 
	case happyOutTok happy_x_12 of { (Num happy_var_12) -> 
	case happyOutTok happy_x_14 of { (Num happy_var_14) -> 
	happyIn28
		 (ParseTree.CombinatorDef happy_var_1 happy_var_3 (ParseTree.CombinatorTTS (d2i happy_var_10, d2i happy_var_12) (d2i happy_var_14))
	) `HappyStk` happyRest}}}}}

happyReduce_76 = happyReduce 10# 24# happyReduction_76
happyReduction_76 (happy_x_10 `HappyStk`
	happy_x_9 `HappyStk`
	happy_x_8 `HappyStk`
	happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_3 of { (ADPNext happy_var_3) -> 
	case happyOutTok happy_x_9 of { (Num happy_var_9) -> 
	case happyOutTok happy_x_10 of { (Num happy_var_10) -> 
	happyIn28
		 (ParseTree.CombinatorDef happy_var_1 happy_var_3 (ParseTree.CombinatorSTS (d2i happy_var_9) (d2i happy_var_10))
	) `HappyStk` happyRest}}}}

happyReduce_77 = happyReduce 10# 24# happyReduction_77
happyReduction_77 (happy_x_10 `HappyStk`
	happy_x_9 `HappyStk`
	happy_x_8 `HappyStk`
	happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_3 of { (ADPNext happy_var_3) -> 
	case happyOutTok happy_x_9 of { (Ident happy_var_9) -> 
	case happyOutTok happy_x_10 of { (Ident happy_var_10) -> 
	happyIn28
		 (ParseTree.CombinatorDef happy_var_1 happy_var_3 (ParseTree.CombinatorHHH happy_var_9 happy_var_10)
	) `HappyStk` happyRest}}}}

happyReduce_78 = happySpecReduce_0 25# happyReduction_78
happyReduction_78  =  happyIn29
		 ([]
	)

happyReduce_79 = happyReduce 4# 25# happyReduction_79
happyReduction_79 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut27 happy_x_3 of { happy_var_3 -> 
	happyIn29
		 (happy_var_3
	) `HappyStk` happyRest}

happyReduce_80 = happyReduce 4# 26# happyReduction_80
happyReduction_80 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut30 happy_x_1 of { happy_var_1 -> 
	case happyOut5 happy_x_3 of { happy_var_3 -> 
	case happyOutTok happy_x_4 of { (Ident happy_var_4) -> 
	happyIn30
		 (ParseTree.CombinatorAp happy_var_3 happy_var_1 "..." (ParseTree.ProdExpr happy_var_3 (ParseTree.Ident happy_var_4))
	) `HappyStk` happyRest}}}

happyReduce_81 = happyReduce 4# 26# happyReduction_81
happyReduction_81 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut30 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (ADPNext happy_var_2) -> 
	case happyOut5 happy_x_3 of { happy_var_3 -> 
	case happyOut30 happy_x_4 of { happy_var_4 -> 
	happyIn30
		 (ParseTree.CombinatorAp happy_var_3 happy_var_1 happy_var_2 happy_var_4
	) `HappyStk` happyRest}}}}

happyReduce_82 = happyReduce 4# 26# happyReduction_82
happyReduction_82 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut43 happy_x_1 of { happy_var_1 -> 
	case happyOut5 happy_x_3 of { happy_var_3 -> 
	case happyOut30 happy_x_4 of { happy_var_4 -> 
	happyIn30
		 (ParseTree.CombinatorAp happy_var_3 (ParseTree.ProdExpr happy_var_3 happy_var_1) "<<<" happy_var_4
	) `HappyStk` happyRest}}}

happyReduce_83 = happyReduce 4# 26# happyReduction_83
happyReduction_83 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut30 happy_x_1 of { happy_var_1 -> 
	case happyOut5 happy_x_3 of { happy_var_3 -> 
	case happyOut30 happy_x_4 of { happy_var_4 -> 
	happyIn30
		 (ParseTree.CombinatorAp happy_var_3 happy_var_1 "|||" happy_var_4
	) `HappyStk` happyRest}}}

happyReduce_84 = happyReduce 4# 26# happyReduction_84
happyReduction_84 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut30 happy_x_1 of { happy_var_1 -> 
	case happyOut5 happy_x_3 of { happy_var_3 -> 
	case happyOut34 happy_x_4 of { happy_var_4 -> 
	happyIn30
		 (ParseTree.CombinatorAp happy_var_3 happy_var_1 "with" (ParseTree.ProdExpr happy_var_3 happy_var_4)
	) `HappyStk` happyRest}}}

happyReduce_85 = happyReduce 4# 26# happyReduction_85
happyReduction_85 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut30 happy_x_1 of { happy_var_1 -> 
	case happyOut5 happy_x_3 of { happy_var_3 -> 
	case happyOut30 happy_x_4 of { happy_var_4 -> 
	happyIn30
		 (ParseTree.CombinatorAp happy_var_3 happy_var_1 "><" happy_var_4
	) `HappyStk` happyRest}}}

happyReduce_86 = happySpecReduce_2 26# happyReduction_86
happyReduction_86 happy_x_2
	happy_x_1
	 =  case happyOut43 happy_x_1 of { happy_var_1 -> 
	case happyOut5 happy_x_2 of { happy_var_2 -> 
	happyIn30
		 (ParseTree.ProdExpr happy_var_2 happy_var_1
	)}}

happyReduce_87 = happySpecReduce_3 26# happyReduction_87
happyReduction_87 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut30 happy_x_2 of { happy_var_2 -> 
	happyIn30
		 (happy_var_2
	)}

happyReduce_88 = happyReduce 9# 26# happyReduction_88
happyReduction_88 (happy_x_9 `HappyStk`
	happy_x_8 `HappyStk`
	happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_2 of { happy_var_2 -> 
	case happyOut38 happy_x_3 of { happy_var_3 -> 
	case happyOut40 happy_x_6 of { happy_var_6 -> 
	case happyOut31 happy_x_8 of { happy_var_8 -> 
	happyIn30
		 (ParseTree.ListComprehension happy_var_2 happy_var_3 happy_var_6 happy_var_8
	) `HappyStk` happyRest}}}}

happyReduce_89 = happySpecReduce_1 27# happyReduction_89
happyReduction_89 happy_x_1
	 =  case happyOut33 happy_x_1 of { happy_var_1 -> 
	happyIn31
		 ([happy_var_1]
	)}

happyReduce_90 = happyReduce 4# 27# happyReduction_90
happyReduction_90 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut33 happy_x_1 of { happy_var_1 -> 
	case happyOut31 happy_x_4 of { happy_var_4 -> 
	happyIn31
		 (happy_var_1 : happy_var_4
	) `HappyStk` happyRest}}

happyReduce_91 = happySpecReduce_0 28# happyReduction_91
happyReduction_91  =  happyIn32
		 ([]
	)

happyReduce_92 = happySpecReduce_1 28# happyReduction_92
happyReduction_92 happy_x_1
	 =  happyIn32
		 ([]
	)

happyReduce_93 = happySpecReduce_2 29# happyReduction_93
happyReduction_93 happy_x_2
	happy_x_1
	 =  case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOut40 happy_x_2 of { happy_var_2 -> 
	happyIn33
		 (ParseTree.LCFilter happy_var_1 happy_var_2
	)}}

happyReduce_94 = happyReduce 6# 29# happyReduction_94
happyReduction_94 (happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOut38 happy_x_4 of { happy_var_4 -> 
	case happyOut40 happy_x_6 of { happy_var_6 -> 
	happyIn33
		 (ParseTree.LCLet happy_var_1 happy_var_4 happy_var_6
	) `HappyStk` happyRest}}}

happyReduce_95 = happyReduce 4# 29# happyReduction_95
happyReduction_95 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOut40 happy_x_2 of { happy_var_2 -> 
	case happyOut40 happy_x_4 of { happy_var_4 -> 
	happyIn33
		 (ParseTree.LCGenerator happy_var_1 happy_var_2 happy_var_4
	) `HappyStk` happyRest}}}

happyReduce_96 = happySpecReduce_1 30# happyReduction_96
happyReduction_96 happy_x_1
	 =  case happyOut43 happy_x_1 of { happy_var_1 -> 
	happyIn34
		 (happy_var_1
	)}

happyReduce_97 = happySpecReduce_3 30# happyReduction_97
happyReduction_97 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut43 happy_x_2 of { happy_var_2 -> 
	happyIn34
		 (happy_var_2
	)}

happyReduce_98 = happySpecReduce_1 31# happyReduction_98
happyReduction_98 happy_x_1
	 =  case happyOut36 happy_x_1 of { happy_var_1 -> 
	happyIn35
		 ([happy_var_1]
	)}

happyReduce_99 = happySpecReduce_3 31# happyReduction_99
happyReduction_99 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut36 happy_x_1 of { happy_var_1 -> 
	case happyOut35 happy_x_3 of { happy_var_3 -> 
	happyIn35
		 (happy_var_1 : happy_var_3
	)}}

happyReduce_100 = happyReduce 5# 32# happyReduction_100
happyReduction_100 (happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (Ident happy_var_2) -> 
	case happyOut37 happy_x_3 of { happy_var_3 -> 
	case happyOut40 happy_x_5 of { happy_var_5 -> 
	happyIn36
		 (ParseTree.FunDef happy_var_1 happy_var_2 happy_var_3 happy_var_5
	) `HappyStk` happyRest}}}}

happyReduce_101 = happyReduce 7# 32# happyReduction_101
happyReduction_101 (happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (Ident happy_var_2) -> 
	case happyOut37 happy_x_3 of { happy_var_3 -> 
	case happyOut40 happy_x_6 of { happy_var_6 -> 
	happyIn36
		 (ParseTree.FunDef happy_var_1 happy_var_2 happy_var_3 happy_var_6
	) `HappyStk` happyRest}}}}

happyReduce_102 = happySpecReduce_0 33# happyReduction_102
happyReduction_102  =  happyIn37
		 ([]
	)

happyReduce_103 = happySpecReduce_2 33# happyReduction_103
happyReduction_103 happy_x_2
	happy_x_1
	 =  case happyOut38 happy_x_1 of { happy_var_1 -> 
	case happyOut37 happy_x_2 of { happy_var_2 -> 
	happyIn37
		 (happy_var_1 : happy_var_2
	)}}

happyReduce_104 = happySpecReduce_1 34# happyReduction_104
happyReduction_104 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Ident happy_var_1) -> 
	happyIn38
		 (ParseTree.Parameter happy_var_1
	)}

happyReduce_105 = happySpecReduce_1 34# happyReduction_105
happyReduction_105 happy_x_1
	 =  happyIn38
		 (ParseTree.Wildcard
	)

happyReduce_106 = happyReduce 5# 34# happyReduction_106
happyReduction_106 (happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut38 happy_x_2 of { happy_var_2 -> 
	case happyOut39 happy_x_4 of { happy_var_4 -> 
	happyIn38
		 (ParseTree.TupleParam (happy_var_2 : happy_var_4)
	) `HappyStk` happyRest}}

happyReduce_107 = happySpecReduce_1 35# happyReduction_107
happyReduction_107 happy_x_1
	 =  case happyOut38 happy_x_1 of { happy_var_1 -> 
	happyIn39
		 ([happy_var_1]
	)}

happyReduce_108 = happySpecReduce_3 35# happyReduction_108
happyReduction_108 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut38 happy_x_1 of { happy_var_1 -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn39
		 (happy_var_1 : happy_var_3
	)}}

happyReduce_109 = happySpecReduce_1 36# happyReduction_109
happyReduction_109 happy_x_1
	 =  case happyOut41 happy_x_1 of { happy_var_1 -> 
	happyIn40
		 (happy_var_1
	)}

happyReduce_110 = happySpecReduce_2 36# happyReduction_110
happyReduction_110 happy_x_2
	happy_x_1
	 =  case happyOut41 happy_x_2 of { happy_var_2 -> 
	happyIn40
		 (NewParser.negate happy_var_2
	)}

happyReduce_111 = happyReduce 6# 36# happyReduction_111
happyReduction_111 (happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut40 happy_x_2 of { happy_var_2 -> 
	case happyOut40 happy_x_4 of { happy_var_4 -> 
	case happyOut40 happy_x_6 of { happy_var_6 -> 
	happyIn40
		 (ParseTree.If happy_var_2 happy_var_4 happy_var_6
	) `HappyStk` happyRest}}}

happyReduce_112 = happySpecReduce_3 36# happyReduction_112
happyReduction_112 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
	case happyOut40 happy_x_3 of { happy_var_3 -> 
	happyIn40
		 (ParseTree.BinOp happy_var_1 ParseTree.Add happy_var_3
	)}}

happyReduce_113 = happySpecReduce_3 36# happyReduction_113
happyReduction_113 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
	case happyOut40 happy_x_3 of { happy_var_3 -> 
	happyIn40
		 (ParseTree.BinOp happy_var_1 ParseTree.Sub happy_var_3
	)}}

happyReduce_114 = happySpecReduce_3 36# happyReduction_114
happyReduction_114 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
	case happyOut40 happy_x_3 of { happy_var_3 -> 
	happyIn40
		 (ParseTree.BinOp happy_var_1 ParseTree.Mul happy_var_3
	)}}

happyReduce_115 = happySpecReduce_3 36# happyReduction_115
happyReduction_115 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
	case happyOut40 happy_x_3 of { happy_var_3 -> 
	happyIn40
		 (ParseTree.BinOp happy_var_1 ParseTree.Div happy_var_3
	)}}

happyReduce_116 = happySpecReduce_3 36# happyReduction_116
happyReduction_116 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
	case happyOut40 happy_x_3 of { happy_var_3 -> 
	happyIn40
		 (ParseTree.BinOp happy_var_1 ParseTree.Exp happy_var_3
	)}}

happyReduce_117 = happySpecReduce_3 36# happyReduction_117
happyReduction_117 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
	case happyOut40 happy_x_3 of { happy_var_3 -> 
	happyIn40
		 (ParseTree.BinOp happy_var_1 ParseTree.LT happy_var_3
	)}}

happyReduce_118 = happySpecReduce_3 36# happyReduction_118
happyReduction_118 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
	case happyOut40 happy_x_3 of { happy_var_3 -> 
	happyIn40
		 (ParseTree.BinOp happy_var_1 ParseTree.LE happy_var_3
	)}}

happyReduce_119 = happySpecReduce_3 36# happyReduction_119
happyReduction_119 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
	case happyOut40 happy_x_3 of { happy_var_3 -> 
	happyIn40
		 (ParseTree.BinOp happy_var_1 ParseTree.GT happy_var_3
	)}}

happyReduce_120 = happySpecReduce_3 36# happyReduction_120
happyReduction_120 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
	case happyOut40 happy_x_3 of { happy_var_3 -> 
	happyIn40
		 (ParseTree.BinOp happy_var_1 ParseTree.GE happy_var_3
	)}}

happyReduce_121 = happySpecReduce_3 36# happyReduction_121
happyReduction_121 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
	case happyOut40 happy_x_3 of { happy_var_3 -> 
	happyIn40
		 (ParseTree.BinOp happy_var_1 ParseTree.EQ happy_var_3
	)}}

happyReduce_122 = happySpecReduce_3 36# happyReduction_122
happyReduction_122 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
	case happyOut40 happy_x_3 of { happy_var_3 -> 
	happyIn40
		 (ParseTree.BinOp happy_var_1 ParseTree.NE happy_var_3
	)}}

happyReduce_123 = happySpecReduce_3 36# happyReduction_123
happyReduction_123 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
	case happyOut40 happy_x_3 of { happy_var_3 -> 
	happyIn40
		 (ParseTree.BinOp happy_var_1 ParseTree.And happy_var_3
	)}}

happyReduce_124 = happySpecReduce_3 36# happyReduction_124
happyReduction_124 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
	case happyOut40 happy_x_3 of { happy_var_3 -> 
	happyIn40
		 (ParseTree.BinOp happy_var_1 ParseTree.Or happy_var_3
	)}}

happyReduce_125 = happySpecReduce_3 36# happyReduction_125
happyReduction_125 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
	case happyOut40 happy_x_3 of { happy_var_3 -> 
	happyIn40
		 (ParseTree.BinOp happy_var_1 ParseTree.App happy_var_3
	)}}

happyReduce_126 = happyReduce 5# 36# happyReduction_126
happyReduction_126 (happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut40 happy_x_2 of { happy_var_2 -> 
	case happyOut40 happy_x_4 of { happy_var_4 -> 
	happyIn40
		 (happy_var_2 ParseTree.:..: happy_var_4
	) `HappyStk` happyRest}}

happyReduce_127 = happySpecReduce_1 37# happyReduction_127
happyReduction_127 happy_x_1
	 =  case happyOut43 happy_x_1 of { happy_var_1 -> 
	happyIn41
		 (happy_var_1
	)}

happyReduce_128 = happySpecReduce_1 37# happyReduction_128
happyReduction_128 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Num happy_var_1) -> 
	happyIn41
		 (ParseTree.Num happy_var_1
	)}

happyReduce_129 = happySpecReduce_1 37# happyReduction_129
happyReduction_129 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Char happy_var_1) -> 
	happyIn41
		 (ParseTree.Char happy_var_1
	)}

happyReduce_130 = happySpecReduce_1 37# happyReduction_130
happyReduction_130 happy_x_1
	 =  case happyOutTok happy_x_1 of { (String happy_var_1) -> 
	happyIn41
		 (ParseTree.String happy_var_1
	)}

happyReduce_131 = happySpecReduce_3 37# happyReduction_131
happyReduction_131 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_2 of { happy_var_2 -> 
	happyIn41
		 (happy_var_2
	)}

happyReduce_132 = happyReduce 5# 37# happyReduction_132
happyReduction_132 (happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut40 happy_x_2 of { happy_var_2 -> 
	case happyOut42 happy_x_4 of { happy_var_4 -> 
	happyIn41
		 (ParseTree.Tuple (happy_var_2 : happy_var_4)
	) `HappyStk` happyRest}}

happyReduce_133 = happySpecReduce_1 38# happyReduction_133
happyReduction_133 happy_x_1
	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
	happyIn42
		 ([happy_var_1]
	)}

happyReduce_134 = happySpecReduce_3 38# happyReduction_134
happyReduction_134 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
	case happyOut42 happy_x_3 of { happy_var_3 -> 
	happyIn42
		 (happy_var_1 : happy_var_3
	)}}

happyReduce_135 = happySpecReduce_2 39# happyReduction_135
happyReduction_135 happy_x_2
	happy_x_1
	 =  case happyOutTok happy_x_1 of { (Ident happy_var_1) -> 
	case happyOut44 happy_x_2 of { happy_var_2 -> 
	happyIn43
		 (buildFunAp happy_var_1 happy_var_2
	)}}

happyReduce_136 = happySpecReduce_0 40# happyReduction_136
happyReduction_136  =  happyIn44
		 ([]
	)

happyReduce_137 = happySpecReduce_2 40# happyReduction_137
happyReduction_137 happy_x_2
	happy_x_1
	 =  case happyOut45 happy_x_1 of { happy_var_1 -> 
	case happyOut44 happy_x_2 of { happy_var_2 -> 
	happyIn44
		 (happy_var_1 : happy_var_2
	)}}

happyReduce_138 = happySpecReduce_1 41# happyReduction_138
happyReduction_138 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Ident happy_var_1) -> 
	happyIn45
		 (ParseTree.Ident happy_var_1
	)}

happyReduce_139 = happySpecReduce_1 41# happyReduction_139
happyReduction_139 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Num happy_var_1) -> 
	happyIn45
		 (ParseTree.Num happy_var_1
	)}

happyReduce_140 = happySpecReduce_1 41# happyReduction_140
happyReduction_140 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Char happy_var_1) -> 
	happyIn45
		 (ParseTree.Char happy_var_1
	)}

happyReduce_141 = happySpecReduce_1 41# happyReduction_141
happyReduction_141 happy_x_1
	 =  case happyOutTok happy_x_1 of { (String happy_var_1) -> 
	happyIn45
		 (ParseTree.String happy_var_1
	)}

happyReduce_142 = happySpecReduce_3 41# happyReduction_142
happyReduction_142 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut40 happy_x_2 of { happy_var_2 -> 
	happyIn45
		 (happy_var_2
	)}

happyReduce_143 = happyReduce 5# 41# happyReduction_143
happyReduction_143 (happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut40 happy_x_2 of { happy_var_2 -> 
	case happyOut42 happy_x_4 of { happy_var_4 -> 
	happyIn45
		 (ParseTree.Tuple (happy_var_2 : happy_var_4)
	) `HappyStk` happyRest}}

happyNewToken action sts stk
	= lexerP(\tk -> 
	let cont i = happyDoAction i tk action sts stk in
	case tk of {
	EOF -> happyDoAction 76# (error "reading EOF!") action sts stk;
	Num happy_dollar_dollar -> cont 1#;
	Char happy_dollar_dollar -> cont 2#;
	String happy_dollar_dollar -> cont 3#;
	Ident happy_dollar_dollar -> cont 4#;
	Underscore -> cont 5#;
	TypeIdent happy_dollar_dollar -> cont 6#;
	AlgebraTypeToken -> cont 7#;
	AlgebraToken -> cont 8#;
	GrammarToken -> cont 9#;
	TypeSynToken -> cont 10#;
	ExternToken happy_dollar_dollar -> cont 11#;
	TParser -> cont 12#;
	TInt -> cont 13#;
	TInteger -> cont 14#;
	TFloat -> cont 15#;
	TDouble -> cont 16#;
	TChar -> cont 17#;
	TString -> cont 18#;
	TBool -> cont 19#;
	TVoid -> cont 20#;
	TCNum -> cont 21#;
	TCIntegral -> cont 22#;
	TCFloating -> cont 23#;
	Where -> cont 24#;
	If -> cont 25#;
	Then -> cont 26#;
	Else -> cont 27#;
	Type -> cont 28#;
	Let -> cont 29#;
	With -> cont 30#;
	Axiom -> cont 31#;
	Tabulated -> cont 32#;
	Listed -> cont 33#;
	Listedj -> cont 34#;
	Nontabulated -> cont 35#;
	Semicolon -> cont 36#;
	Assign -> cont 37#;
	Comma -> cont 38#;
	RArrow -> cont 39#;
	RArrow2 -> cont 40#;
	LArrow -> cont 41#;
	Pipe -> cont 42#;
	DotDot -> cont 43#;
	Backslash -> cont 44#;
	DoubleColon -> cont 45#;
	OpenBr -> cont 46#;
	CloseBr -> cont 47#;
	OpenCurlBr -> cont 48#;
	CloseCurlBr -> cont 49#;
	OpenSqBr -> cont 50#;
	CloseSqBr -> cont 51#;
	Add -> cont 52#;
	Sub -> cont 53#;
	Mult -> cont 54#;
	Div -> cont 55#;
	Exp -> cont 56#;
	And -> cont 57#;
	Or -> cont 58#;
	Append -> cont 59#;
	Lexer.GT -> cont 60#;
	Lexer.GE -> cont 61#;
	Lexer.LT -> cont 62#;
	Lexer.LE -> cont 63#;
	Lexer.EQ -> cont 64#;
	Lexer.NE -> cont 65#;
	ADPUses -> cont 66#;
	ADPNext happy_dollar_dollar -> cont 67#;
	ADPOr -> cont 68#;
	ADPSelect -> cont 69#;
	ADPTT -> cont 70#;
	ADPNextTT -> cont 71#;
	ADPNextSTT -> cont 72#;
	ADPNextTTS -> cont 73#;
	ADPNextSTS -> cont 74#;
	ADPNextHHH -> cont 75#;
	_ -> happyError'
	})

happyError_ tk = happyError'

happyThen :: () => P a -> (a -> P b) -> P b
happyThen = (thenP)
happyReturn :: () => a -> P a
happyReturn = (returnP)
happyThen1 = happyThen
happyReturn1 :: () => a -> P a
happyReturn1 = happyReturn
happyError' :: () => P a
happyError' = happyError

parse1 = happySomeParser where
  happySomeParser = happyThen (happyParse 0#) (\x -> happyReturn (happyOut4 x))

happySeq = happyDontSeq

parse :: P ParseTree.ADPProgram
parse inp (modname, line) = parse1 inp (modname, line)
































lexerP :: (Token -> P a) -> P a
lexerP cont s (mname, line) = let (lineinc, token, s') = lexer s 
                                  line' = case lineinc of
                                                 (LineInc       inc)   -> (mname, line+inc)
                                                 (ModuleSwitch  mod l) -> (mod, l)
                              in  cont token s' line'










data DefBlock = MainCodeBlock String
              | TargetCodeBlock String
              | AlgebraTypeDef ParseTree.AlgebraType
              | AlgebraDef ParseTree.Algebra
              | GrammarDef ParseTree.Grammar
              | TypeSynDef ParseTree.TypeSyn
              | ExternDef ParseTree.TypeDecl




assignBlocks :: [DefBlock] -> P ParseTree.ADPProgram
assignBlocks blks = let (mc, tc, u, algt, alg, g, ts, ed, fd) = map9 blks
                    in ok (mc,tc) u algt alg g ts ed fd 
    where map9 []  = ([], [], [], [], [], [], [], [], [])
          map9 (a:as) = let (mc, tc, u, algt, alg, g, ts, ed, fd) = map9 as
                        in case a of
                             (MainCodeBlock defs)   -> (defs:mc, tc, u, algt, alg, g, ts, ed, fd)
                             (TargetCodeBlock defs) -> (mc, defs:tc, u, algt, alg, g, ts, ed, fd)
                             (AlgebraTypeDef defs)  -> (mc, tc, u, defs:algt, alg, g, ts, ed, fd)
                             (AlgebraDef defs)      -> (mc, tc, u, algt, defs:alg, g, ts, ed, fd)
                             (GrammarDef defs)      -> (mc, tc, u, algt, alg, defs:g, ts, ed, fd)
                             (TypeSynDef defs)      -> (mc, tc, u, algt, alg, g, defs:ts, ed, fd)
                             (ExternDef defs)       -> (mc, tc, u, algt, alg, g, ts, defs:ed, fd)

          ok (mc,tc) u algt alg g ts ed fd 
                                  | length mc > 1     = failP ("Too many #main definitions.", 1)
                                  | length tc > 1     = failP ("Too many #target definitions.", 1)
                                  | length algt == 0  = failP ("No #algebratype definition given.", 1)
                                  | length algt > 1   = failP ("Too many #algebratype definitions.", 1)
                                  | length alg == 0   = failP ("No #algebra defined.", 1)
                                  | length g == 0     = failP ("No #Grammar definition given.", 1)
                                  | length g > 1      = failP ("Too many grammars defined.", 1)
                                  | otherwise         = returnP $ ParseTree.ADPProgram 
                                                                  ts 
                                                                  ed
                                                                  (head algt) 
                                                                  alg 
                                                                  (head g)





getLineNo :: P ParseTree.LineNumber
getLineNo = \ s l -> Ok l

happyError :: P a
happyError = getLineNo `thenP` (\(modname,line) -> failP (modname ++ ", line " ++ show line ++ ": parse error.", line))



d2i :: Double -> Int
d2i s = let (a,b) = span (/= '.') (show s)
        in if b /= ".0"  then error $ "parser: integer value required: " ++ show s
                         else (read a) :: Int

negate :: ParseTree.Expression -> ParseTree.Expression
negate (ParseTree.Num n) = ParseTree.Num (-1 * n)
negate exp               = ParseTree.BinOp (ParseTree.Num (-1)) ParseTree.Mul exp

buildFunAp :: String -> [ParseTree.Expression] -> ParseTree.Expression
buildFunAp ident []   = ParseTree.Ident ident
buildFunAp ident args = ParseTree.FunAp ident args
{-# LINE 1 "GenericTemplate.hs" #-}
-- $Id$













{-# LINE 27 "GenericTemplate.hs" #-}



data Happy_IntList = HappyCons Int# Happy_IntList






































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

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

happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll

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

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

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



happyDoAction i tk st
	= {- nothing -}


	  case action of
		0#		  -> {- nothing -}
				     happyFail i tk st
		-1# 	  -> {- nothing -}
				     happyAccept i tk st
		n | (n <# (0# :: Int#)) -> {- nothing -}

				     (happyReduceArr ! rule) i tk st
				     where rule = (I# ((negateInt# ((n +# (1# :: Int#))))))
		n		  -> {- nothing -}


				     happyShift new_state i tk st
				     where new_state = (n -# (1# :: Int#))
   where off    = indexShortOffAddr happyActOffsets st
	 off_i  = (off +# i)
	 check  = if (off_i >=# (0# :: Int#))
			then (indexShortOffAddr happyCheck off_i ==#  i)
			else False
 	 action | check     = indexShortOffAddr happyTable off_i
		| otherwise = indexShortOffAddr happyDefActions st











indexShortOffAddr (HappyA# arr) off =
#if __GLASGOW_HASKELL__ > 500
	narrow16Int# i
#elif __GLASGOW_HASKELL__ == 500
	intToInt16# i
#else
	(i `iShiftL#` 16#) `iShiftRA#` 16#
#endif
  where
#if __GLASGOW_HASKELL__ >= 503
	i = word2Int# ((high `uncheckedShiftL#` 8#) `or#` low)
#else
	i = word2Int# ((high `shiftL#` 8#) `or#` low)
#endif
	high = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#)))
	low  = int2Word# (ord# (indexCharOffAddr# arr off'))
	off' = off *# 2#





data HappyAddr = HappyA# Addr#




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

{-# LINE 169 "GenericTemplate.hs" #-}


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

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

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

-- happyReduce is specialised for the common cases.

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

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

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

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

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

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

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

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

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


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




-----------------------------------------------------------------------------
-- Error recovery (0# is the error token)

-- parse error if we are in recovery and we fail again
happyFail  0# tk old_st _ stk =
--	trace "failing" $ 
    	happyError_ tk

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

-- discard a state
happyFail  0# tk old_st (HappyCons ((action)) (sts)) 
						(saved_tok `HappyStk` _ `HappyStk` stk) =
--	trace ("discarding state, depth " ++ show (length stk))  $
	happyDoAction 0# tk action sts ((saved_tok`HappyStk`stk))
-}

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

-- Internal happy errors:

notHappyAtAll = error "Internal Happy error\n"

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


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


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

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

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


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

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

-- end of Happy Template.
