{-# OPTIONS_GHC -w #-}
{-# OPTIONS -fglasgow-exts -cpp #-}
module Syntax.Parser.Parser
    ( pDefs, pExpr
    ) where

import Control.Monad.Trans
import Control.Monad.State
import Control.Monad.Error
import Data.Bifunctor
import Data.Void
import Data.Maybe

import Syntax.Parser.Lexer
import Syntax
import TypeChecking.Monad.Warn
import qualified Data.Array as Happy_Data_Array
import qualified GHC.Exts as Happy_GHC_Exts

-- parser produced by Happy Version 1.18.10

newtype HappyAbsSyn  = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
happyIn5 :: (PName) -> (HappyAbsSyn )
happyIn5 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn5 #-}
happyOut5 :: (HappyAbsSyn ) -> (PName)
happyOut5 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut5 #-}
happyIn6 :: (PName) -> (HappyAbsSyn )
happyIn6 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn6 #-}
happyOut6 :: (HappyAbsSyn ) -> (PName)
happyOut6 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut6 #-}
happyIn7 :: ([PName]) -> (HappyAbsSyn )
happyIn7 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn7 #-}
happyOut7 :: (HappyAbsSyn ) -> ([PName])
happyOut7 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut7 #-}
happyIn8 :: (Posn) -> (HappyAbsSyn )
happyIn8 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn8 #-}
happyOut8 :: (HappyAbsSyn ) -> (Posn)
happyOut8 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut8 #-}
happyIn9 :: (()) -> (HappyAbsSyn )
happyIn9 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn9 #-}
happyOut9 :: (HappyAbsSyn ) -> (())
happyOut9 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut9 #-}
happyIn10 :: (()) -> (HappyAbsSyn )
happyIn10 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn10 #-}
happyOut10 :: (HappyAbsSyn ) -> (())
happyOut10 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut10 #-}
happyIn11 :: (()) -> (HappyAbsSyn )
happyIn11 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn11 #-}
happyOut11 :: (HappyAbsSyn ) -> (())
happyOut11 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut11 #-}
happyIn12 :: (Def) -> (HappyAbsSyn )
happyIn12 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn12 #-}
happyOut12 :: (HappyAbsSyn ) -> (Def)
happyOut12 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut12 #-}
happyIn13 :: ([Def]) -> (HappyAbsSyn )
happyIn13 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn13 #-}
happyOut13 :: (HappyAbsSyn ) -> ([Def])
happyOut13 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut13 #-}
happyIn14 :: (Maybe PName) -> (HappyAbsSyn )
happyIn14 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn14 #-}
happyOut14 :: (HappyAbsSyn ) -> (Maybe PName)
happyOut14 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut14 #-}
happyIn15 :: ([Field]) -> (HappyAbsSyn )
happyIn15 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn15 #-}
happyOut15 :: (HappyAbsSyn ) -> ([Field])
happyOut15 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut15 #-}
happyIn16 :: (Field) -> (HappyAbsSyn )
happyIn16 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn16 #-}
happyOut16 :: (HappyAbsSyn ) -> (Field)
happyOut16 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut16 #-}
happyIn17 :: ([Clause]) -> (HappyAbsSyn )
happyIn17 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn17 #-}
happyOut17 :: (HappyAbsSyn ) -> ([Clause])
happyOut17 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut17 #-}
happyIn18 :: ([Clause]) -> (HappyAbsSyn )
happyIn18 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn18 #-}
happyOut18 :: (HappyAbsSyn ) -> ([Clause])
happyOut18 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut18 #-}
happyIn19 :: (Term PName Void) -> (HappyAbsSyn )
happyIn19 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn19 #-}
happyOut19 :: (HappyAbsSyn ) -> (Term PName Void)
happyOut19 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut19 #-}
happyIn20 :: ([Term PName Void]) -> (HappyAbsSyn )
happyIn20 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn20 #-}
happyOut20 :: (HappyAbsSyn ) -> ([Term PName Void])
happyOut20 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut20 #-}
happyIn21 :: (Con) -> (HappyAbsSyn )
happyIn21 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn21 #-}
happyOut21 :: (HappyAbsSyn ) -> (Con)
happyOut21 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut21 #-}
happyIn22 :: ([Con]) -> (HappyAbsSyn )
happyIn22 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn22 #-}
happyOut22 :: (HappyAbsSyn ) -> ([Con])
happyOut22 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut22 #-}
happyIn23 :: (Tele) -> (HappyAbsSyn )
happyIn23 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn23 #-}
happyOut23 :: (HappyAbsSyn ) -> (Tele)
happyOut23 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut23 #-}
happyIn24 :: ([Tele]) -> (HappyAbsSyn )
happyIn24 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn24 #-}
happyOut24 :: (HappyAbsSyn ) -> ([Tele])
happyOut24 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut24 #-}
happyIn25 :: ((Explicit,PiTele)) -> (HappyAbsSyn )
happyIn25 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn25 #-}
happyOut25 :: (HappyAbsSyn ) -> ((Explicit,PiTele))
happyOut25 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut25 #-}
happyIn26 :: ([(Explicit,PiTele)]) -> (HappyAbsSyn )
happyIn26 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn26 #-}
happyOut26 :: (HappyAbsSyn ) -> ([(Explicit,PiTele)])
happyOut26 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut26 #-}
happyIn27 :: ([PIdent]) -> (HappyAbsSyn )
happyIn27 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn27 #-}
happyOut27 :: (HappyAbsSyn ) -> ([PIdent])
happyOut27 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut27 #-}
happyIn28 :: (RawExpr) -> (HappyAbsSyn )
happyIn28 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn28 #-}
happyOut28 :: (HappyAbsSyn ) -> (RawExpr)
happyOut28 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut28 #-}
happyIn29 :: (RawExpr) -> (HappyAbsSyn )
happyIn29 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn29 #-}
happyOut29 :: (HappyAbsSyn ) -> (RawExpr)
happyOut29 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut29 #-}
happyIn30 :: (RawExpr) -> (HappyAbsSyn )
happyIn30 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn30 #-}
happyOut30 :: (HappyAbsSyn ) -> (RawExpr)
happyOut30 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut30 #-}
happyIn31 :: (RawExpr) -> (HappyAbsSyn )
happyIn31 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn31 #-}
happyOut31 :: (HappyAbsSyn ) -> (RawExpr)
happyOut31 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut31 #-}
happyIn32 :: (RawExpr) -> (HappyAbsSyn )
happyIn32 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn32 #-}
happyOut32 :: (HappyAbsSyn ) -> (RawExpr)
happyOut32 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut32 #-}
happyIn33 :: ([RawExpr]) -> (HappyAbsSyn )
happyIn33 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn33 #-}
happyOut33 :: (HappyAbsSyn ) -> ([RawExpr])
happyOut33 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut33 #-}
happyIn34 :: ([RawExpr]) -> (HappyAbsSyn )
happyIn34 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn34 #-}
happyOut34 :: (HappyAbsSyn ) -> ([RawExpr])
happyOut34 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut34 #-}
happyIn35 :: (RawExpr) -> (HappyAbsSyn )
happyIn35 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn35 #-}
happyOut35 :: (HappyAbsSyn ) -> (RawExpr)
happyOut35 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut35 #-}
happyIn36 :: (([Term PName Void], [RawExpr])) -> (HappyAbsSyn )
happyIn36 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn36 #-}
happyOut36 :: (HappyAbsSyn ) -> (([Term PName Void], [RawExpr]))
happyOut36 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut36 #-}
happyInTok :: (Token) -> (HappyAbsSyn )
happyInTok x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyInTok #-}
happyOutTok :: (HappyAbsSyn ) -> (Token)
happyOutTok x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOutTok #-}


happyActOffsets :: HappyAddr
happyActOffsets = HappyA# "\xba\x01\x99\x01\x82\x01\x00\x00\x00\x00\xa9\x00\x00\x00\x9e\x00\x5f\x01\x00\x00\x5e\x01\x5a\x01\x6f\x01\xa9\x00\x00\x00\x73\x01\x81\x01\x99\x01\x00\x00\x64\x01\x00\x00\xe5\x00\x00\x00\x6d\x01\x6c\x01\x87\x00\x87\x00\x00\x00\x00\x00\x59\x01\xa5\x00\xba\x01\xb1\x01\x99\x01\x62\x01\x57\x01\x1c\x01\x4b\x00\x00\x00\x00\x00\x81\x01\x00\x00\xa9\x00\x00\x00\xa9\x00\xa9\x00\x67\x01\xa3\x01\x00\x00\xa9\x00\xa3\x01\xf5\x00\x99\x01\x00\x00\xf2\x00\x00\x00\x36\x01\x48\x01\x6b\x00\x48\x01\xa9\x00\x00\x00\x99\x01\x99\x01\x00\x00\x87\x00\xcc\x00\x00\x00\x00\x00\x00\x00\x66\x01\x99\x01\x00\x00\x00\x00\xa5\x00\x00\x00\x8d\x01\x8b\x01\xa9\x00\x4b\x01\x00\x00\x00\x00\x81\x01\xb0\x00\x87\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x14\x01\x3b\x01\x00\x00\x00\x00\x00\x00\x3a\x01\x00\x00\x00\x00\x00\x00\x87\x00\x82\x00\xcf\x00\x00\x00\x00\x00\xba\x00\x00\x00\x00\x00\xa4\x00\x4a\x01\x87\x00\x02\x00\x37\x01\x00\x00\x7e\x01\x00\x00\x0f\x01\x00\x00\x39\x01\x7e\x01\x87\x00\x00\x00\x87\x00\x57\x00\x9e\x01\x00\x00\x7e\x01\x00\x00\x7d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0c\x01\x32\x01\x7e\x01\x2b\x01\x41\x01\x2f\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x87\x00\xad\x01\x7e\x01\x00\x00\x7e\x01\x00\x00\xa8\x01\x00\x00\x7e\x01\x00\x00\x00\x00"#

happyGotoOffsets :: HappyAddr
happyGotoOffsets = HappyA# "\x05\x00\x3c\x01\x00\x00\x00\x00\x00\x00\x47\x00\x00\x00\x03\x00\x00\x00\x00\x00\x00\x00\x35\x01\x00\x00\x62\x00\x00\x00\x1b\x01\x20\x01\x15\x01\x00\x00\x0d\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x28\x01\x19\x01\xfc\x00\xed\x00\x00\x00\xf3\x00\x09\x00\xcb\x00\xf9\x00\xf1\x00\x00\x00\x62\x00\x00\x00\x00\x00\x00\x00\xee\x00\xd6\x00\x3b\x00\x00\x00\x15\x00\x1a\x00\x00\x00\x63\x01\x00\x00\x41\x00\x47\x01\x62\x00\xd2\x00\x00\x00\x62\x00\x00\x00\x00\x00\x00\x00\xa8\x00\x00\x00\x61\x00\x00\x00\xc7\x00\xab\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd4\x00\xa0\x00\x00\x00\x00\x00\xa6\x00\x00\x00\x13\x00\x40\x01\x3d\x00\xc8\x00\x00\x00\x00\x00\x84\x00\x00\x00\x0a\x01\x00\x00\x00\x00\x95\x00\x00\x00\x00\x00\x00\x00\x7a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x86\x00\xcb\x00\xcb\x00\x6a\x00\x00\x00\xca\x00\x00\x00\x00\x00\x3e\x00\x81\x00\x14\x00\x3e\x00\x00\x00\x00\x00\x79\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5d\x00\xcd\x00\x00\x00\xd8\x00\x00\x00\x13\x00\x00\x00\x52\x00\x64\x00\xcb\x00\x00\x00\x00\x00\x00\x00\x00\x00\xff\xff\x00\x00\x00\x00\x36\x00\x30\x00\x2f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\xcb\x00\x2b\x00\x00\x00\x0f\x00\xf3\xff\xcb\x00\x00\x00\x04\x00\x00\x00\x00\x00"#

happyDefActions :: HappyAddr
happyDefActions = HappyA# "\xe8\xff\x00\x00\x00\x00\xfd\xff\xb4\xff\x00\x00\xc8\xff\x00\x00\x00\x00\xc4\xff\xc2\xff\xbf\xff\xbd\xff\xba\xff\xb6\xff\x00\x00\x00\x00\x00\x00\xf7\xff\xd5\xff\xe7\xff\x00\x00\xe9\xff\x00\x00\x00\x00\x00\x00\x00\x00\xcc\xff\xcc\xff\x00\x00\x00\x00\xe6\xff\xee\xff\x00\x00\x00\x00\x00\x00\xba\xff\x00\x00\xc6\xff\xb5\xff\x00\x00\xb8\xff\x00\x00\xfb\xff\x00\x00\x00\x00\x00\x00\x00\x00\xc7\xff\x00\x00\x00\x00\x00\x00\x00\x00\xc0\xff\x00\x00\xc1\xff\x00\x00\xbc\xff\xbe\xff\xbb\xff\xb9\xff\xc5\xff\x00\x00\x00\x00\xb3\xff\x00\x00\x00\x00\xf0\xff\xd8\xff\xd4\xff\x00\x00\x00\x00\xe5\xff\xf9\xff\xea\xff\xfc\xff\xed\xff\x00\x00\x00\x00\xe4\xff\xcb\xff\xd0\xff\x00\x00\x00\x00\x00\x00\xf8\xff\xef\xff\xd5\xff\xd7\xff\xf1\xff\xf2\xff\xd5\xff\x00\x00\x00\x00\xc3\xff\xb7\xff\xfa\xff\x00\x00\xc9\xff\xca\xff\xb2\xff\xb0\xff\x00\x00\x00\x00\xcc\xff\xd2\xff\xdd\xff\xf3\xff\xf4\xff\xba\xff\xe2\xff\x00\x00\x00\x00\xb6\xff\xcf\xff\x00\x00\xe3\xff\x00\x00\xe1\xff\x00\x00\x00\x00\x00\x00\xec\xff\x00\x00\x00\x00\xd3\xff\xd6\xff\x00\x00\xd5\xff\x00\x00\xb1\xff\xf5\xff\xf6\xff\xd1\xff\xd5\xff\x00\x00\x00\x00\x00\x00\xdd\xff\xe0\xff\x00\x00\xcd\xff\xdf\xff\xeb\xff\xde\xff\xce\xff\xdc\xff\xda\xff\x00\x00\x00\x00\xaf\xff\x00\x00\xd5\xff\x00\x00\xdb\xff\x00\x00\xd9\xff"#

happyCheck :: HappyAddr
happyCheck = HappyA# "\xff\xff\x00\x00\x0f\x00\x01\x00\x00\x00\x00\x00\x03\x00\x03\x00\x00\x00\x00\x00\x08\x00\x09\x00\x07\x00\x08\x00\x0f\x00\x00\x00\x07\x00\x0f\x00\x03\x00\x00\x00\x00\x00\x00\x00\x03\x00\x14\x00\x14\x00\x15\x00\x00\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1f\x00\x1d\x00\x1e\x00\x14\x00\x15\x00\x12\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x1d\x00\x1e\x00\x03\x00\x1a\x00\x1b\x00\x1e\x00\x1d\x00\x1e\x00\x04\x00\x1b\x00\x00\x00\x1d\x00\x1e\x00\x03\x00\x0b\x00\x00\x00\x0c\x00\x00\x00\x00\x00\x14\x00\x15\x00\x00\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x1d\x00\x1e\x00\x14\x00\x15\x00\x01\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x1d\x00\x1e\x00\x03\x00\x1b\x00\x00\x00\x1d\x00\x1e\x00\x1d\x00\x1e\x00\x1e\x00\x00\x00\x1d\x00\x1e\x00\x03\x00\x00\x00\x00\x00\x18\x00\x1d\x00\x1e\x00\x14\x00\x15\x00\x11\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x03\x00\x1d\x00\x1e\x00\x14\x00\x15\x00\x0f\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x1d\x00\x1e\x00\x03\x00\x13\x00\x01\x00\x1e\x00\x1e\x00\x16\x00\x17\x00\x01\x00\x00\x00\x08\x00\x00\x00\x03\x00\x01\x00\x0f\x00\x08\x00\x0a\x00\x0b\x00\x14\x00\x15\x00\x08\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x18\x00\x1d\x00\x1e\x00\x14\x00\x15\x00\x18\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x1d\x00\x1e\x00\x03\x00\x0f\x00\x01\x00\x08\x00\x01\x00\x03\x00\x01\x00\x01\x00\x00\x00\x08\x00\x09\x00\x03\x00\x11\x00\x00\x00\x08\x00\x09\x00\x0f\x00\x14\x00\x15\x00\x18\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x17\x00\x1d\x00\x1e\x00\x14\x00\x15\x00\x11\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x1d\x00\x1e\x00\x03\x00\x00\x00\x00\x00\x00\x00\x04\x00\x15\x00\x01\x00\x09\x00\x00\x00\x19\x00\x00\x00\x03\x00\x0c\x00\x08\x00\x00\x00\x0e\x00\x0d\x00\x14\x00\x15\x00\x11\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x14\x00\x1d\x00\x1e\x00\x14\x00\x15\x00\x10\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x1d\x00\x1e\x00\x03\x00\x1c\x00\x01\x00\x01\x00\x02\x00\x01\x00\x06\x00\x13\x00\x00\x00\x08\x00\x09\x00\x03\x00\x08\x00\x09\x00\x1a\x00\x13\x00\x0f\x00\x14\x00\x15\x00\x0f\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x1d\x00\x1e\x00\x14\x00\x15\x00\x13\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x1d\x00\x1e\x00\x03\x00\x00\x00\x10\x00\x11\x00\x0f\x00\x01\x00\x12\x00\x13\x00\x00\x00\x12\x00\x13\x00\x03\x00\x08\x00\x09\x00\x12\x00\x13\x00\x00\x00\x14\x00\x15\x00\x0f\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x16\x00\x1d\x00\x1e\x00\x14\x00\x15\x00\x01\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x1d\x00\x1e\x00\x03\x00\x00\x00\x12\x00\x01\x00\x03\x00\x19\x00\x05\x00\x14\x00\x00\x00\x0f\x00\x12\x00\x03\x00\x01\x00\x12\x00\x17\x00\x06\x00\x14\x00\x14\x00\x15\x00\x12\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x0d\x00\x1d\x00\x1e\x00\x14\x00\x15\x00\x03\x00\x1e\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x1d\x00\x1e\x00\x03\x00\x01\x00\x01\x00\x03\x00\x10\x00\x14\x00\x0a\x00\x14\x00\x08\x00\x03\x00\x16\x00\x17\x00\x05\x00\x0f\x00\x01\x00\x06\x00\x18\x00\x14\x00\x15\x00\x1a\x00\x14\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x01\x00\x1d\x00\x1e\x00\x01\x00\x01\x00\x03\x00\x07\x00\x08\x00\x09\x00\x07\x00\x08\x00\x09\x00\xff\xff\x01\x00\xff\xff\x01\x00\x11\x00\xff\xff\xff\xff\x11\x00\x08\x00\x09\x00\x08\x00\x09\x00\xff\xff\xff\xff\x0e\x00\x01\x00\xff\xff\x11\x00\x10\x00\x11\x00\x01\x00\x07\x00\x08\x00\x09\x00\xff\xff\x01\x00\xff\xff\x08\x00\x09\x00\xff\xff\x01\x00\x11\x00\x08\x00\x09\x00\xff\xff\x01\x00\x11\x00\x08\x00\xff\xff\x01\x00\xff\xff\x11\x00\x08\x00\xff\xff\xff\xff\x10\x00\x08\x00\xff\xff\x01\x00\x02\x00\x10\x00\x04\x00\xff\xff\xff\xff\x10\x00\x08\x00\xff\xff\xff\xff\x0b\x00\x0c\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"#

happyTable :: HappyAddr
happyTable = HappyA# "\x00\x00\x5b\x00\x99\x00\x04\x00\x04\x00\x13\x00\x05\x00\x05\x00\x98\x00\x13\x00\x29\x00\x12\x00\x14\x00\x15\x00\x94\x00\x04\x00\x48\x00\x74\x00\x05\x00\x04\x00\x74\x00\x04\x00\x4e\x00\x30\x00\x06\x00\x07\x00\x04\x00\x9c\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x5c\x00\x0d\x00\x0e\x00\x06\x00\x07\x00\x50\x00\x9a\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x04\x00\x0d\x00\x0e\x00\x05\x00\x3a\x00\x0c\x00\x51\x00\x0d\x00\x0e\x00\x79\x00\x39\x00\x04\x00\x0d\x00\x0e\x00\x05\x00\x8e\x00\x04\x00\x8f\x00\x04\x00\x04\x00\x06\x00\x07\x00\x04\x00\x96\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x04\x00\x0d\x00\x0e\x00\x06\x00\x07\x00\x3e\x00\x90\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x04\x00\x0d\x00\x0e\x00\x05\x00\x3b\x00\x84\x00\x0d\x00\x0e\x00\x70\x00\x71\x00\x27\x00\x04\x00\x36\x00\x0e\x00\x05\x00\x04\x00\x04\x00\x3f\x00\x33\x00\x0e\x00\x06\x00\x07\x00\x85\x00\x82\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x2c\x00\x0d\x00\x0e\x00\x06\x00\x07\x00\x81\x00\x88\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x04\x00\x0d\x00\x0e\x00\x05\x00\x7d\x00\x04\x00\x5f\x00\x27\x00\x2e\x00\x2f\x00\x04\x00\x04\x00\x47\x00\x80\x00\x05\x00\x04\x00\x66\x00\x47\x00\x75\x00\x76\x00\x06\x00\x07\x00\x19\x00\x8c\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x96\x00\x0d\x00\x0e\x00\x06\x00\x07\x00\x80\x00\x23\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x04\x00\x6d\x00\x0e\x00\x05\x00\x67\x00\x04\x00\x32\x00\x55\x00\x2c\x00\x2a\x00\x04\x00\x04\x00\x29\x00\x12\x00\x05\x00\x13\x00\x6c\x00\x29\x00\x12\x00\x79\x00\x06\x00\x07\x00\x33\x00\x56\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x2f\x00\x0d\x00\x0e\x00\x06\x00\x07\x00\x6d\x00\x5d\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x04\x00\x0d\x00\x0e\x00\x05\x00\x44\x00\x5a\x00\x86\x00\x79\x00\x7c\x00\x04\x00\x6e\x00\x04\x00\x7d\x00\x57\x00\x05\x00\x7a\x00\x47\x00\x68\x00\x45\x00\x87\x00\x06\x00\x07\x00\x5b\x00\x5e\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x7f\x00\x0d\x00\x0e\x00\x06\x00\x07\x00\x85\x00\x61\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x04\x00\x0d\x00\x0e\x00\x05\x00\x3c\x00\x04\x00\x49\x00\x4a\x00\x04\x00\x41\x00\x20\x00\x04\x00\x29\x00\x12\x00\x05\x00\x29\x00\x12\x00\xff\xff\x4c\x00\x40\x00\x06\x00\x07\x00\x35\x00\x23\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x68\x00\x0d\x00\x0e\x00\x06\x00\x07\x00\x4d\x00\x43\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x04\x00\x0d\x00\x0e\x00\x05\x00\x1b\x00\x69\x00\x6a\x00\x20\x00\x04\x00\x93\x00\x94\x00\x04\x00\x8b\x00\x8c\x00\x05\x00\x29\x00\x12\x00\x65\x00\x66\x00\x1c\x00\x06\x00\x07\x00\x40\x00\x22\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x25\x00\x0d\x00\x0e\x00\x06\x00\x07\x00\x2a\x00\x23\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x04\x00\x24\x00\x0e\x00\x05\x00\x04\x00\x8e\x00\x78\x00\x4e\x00\x7d\x00\x4f\x00\x92\x00\x04\x00\x8a\x00\x73\x00\x05\x00\x78\x00\x63\x00\x61\x00\x2a\x00\x64\x00\x06\x00\x07\x00\x50\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x70\x00\x0d\x00\x0e\x00\x06\x00\x07\x00\x2c\x00\x51\x00\x35\x00\x0a\x00\x0b\x00\x0c\x00\x04\x00\x0d\x00\x0e\x00\x05\x00\x04\x00\x39\x00\x1e\x00\x2d\x00\x41\x00\x43\x00\x4c\x00\x19\x00\x1e\x00\x2e\x00\x2f\x00\x1f\x00\x22\x00\x27\x00\x2a\x00\x30\x00\x06\x00\x07\x00\xff\xff\x59\x00\x37\x00\x0a\x00\x0b\x00\x0c\x00\x04\x00\x0d\x00\x0e\x00\x04\x00\x04\x00\x1e\x00\x10\x00\x11\x00\x12\x00\x10\x00\x11\x00\x12\x00\x00\x00\x04\x00\x00\x00\x04\x00\x13\x00\x00\x00\x00\x00\x13\x00\x53\x00\x12\x00\x53\x00\x12\x00\x00\x00\x00\x00\x54\x00\x04\x00\x00\x00\x13\x00\x55\x00\x13\x00\x04\x00\x10\x00\x11\x00\x12\x00\x00\x00\x04\x00\x00\x00\x53\x00\x12\x00\x00\x00\x04\x00\x13\x00\x11\x00\x12\x00\x00\x00\x04\x00\x13\x00\x47\x00\x00\x00\x04\x00\x00\x00\x13\x00\x47\x00\x00\x00\x00\x00\x9c\x00\x47\x00\x00\x00\x04\x00\x17\x00\x98\x00\x18\x00\x00\x00\x00\x00\x48\x00\x19\x00\x00\x00\x00\x00\x1a\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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 = Happy_Data_Array.array (2, 80) [
	(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)
	]

happy_n_terms = 27 :: Int
happy_n_nonterms = 32 :: Int

happyReduce_2 = happySpecReduce_1  0# happyReduction_2
happyReduction_2 happy_x_1
	 =  case happyOutTok happy_x_1 of { (TokIdent    happy_var_1) -> 
	happyIn5
		 ((getPos happy_var_1, Ident (getName happy_var_1))
	)}

happyReduce_3 = happySpecReduce_3  0# happyReduction_3
happyReduction_3 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOutTok happy_x_2 of { (TokOperator happy_var_2) -> 
	happyIn5
		 ((getPos happy_var_2, Operator (getName happy_var_2))
	)}

happyReduce_4 = happySpecReduce_1  1# happyReduction_4
happyReduction_4 happy_x_1
	 =  case happyOutTok happy_x_1 of { (TokOperator happy_var_1) -> 
	happyIn6
		 ((getPos happy_var_1, Operator (getName happy_var_1))
	)}

happyReduce_5 = happySpecReduce_3  1# happyReduction_5
happyReduction_5 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOutTok happy_x_2 of { (TokIdent    happy_var_2) -> 
	happyIn6
		 ((getPos happy_var_2, Ident (getName happy_var_2))
	)}

happyReduce_6 = happySpecReduce_1  2# happyReduction_6
happyReduction_6 happy_x_1
	 =  case happyOut6 happy_x_1 of { happy_var_1 -> 
	happyIn7
		 ([happy_var_1]
	)}

happyReduce_7 = happySpecReduce_2  2# happyReduction_7
happyReduction_7 happy_x_2
	happy_x_1
	 =  case happyOut7 happy_x_1 of { happy_var_1 -> 
	case happyOut6 happy_x_2 of { happy_var_2 -> 
	happyIn7
		 (happy_var_2:happy_var_1
	)}}

happyReduce_8 = happyMonadReduce 1# 3# happyReduction_8
happyReduction_8 (happy_x_1 `HappyStk`
	happyRest) tk
	 = happyThen (case happyOutTok happy_x_1 of { (TokLBrace   happy_var_1) -> 
	( \_ -> lift  (modify (NoLayout :)) >> return happy_var_1)}
	) (\r -> happyReturn (happyIn8 r))

happyReduce_9 = happyMonadReduce 2# 4# happyReduction_9
happyReduction_9 (happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest) tk
	 = happyThen (( \_ -> lift $ modify (NoLayout  :))
	) (\r -> happyReturn (happyIn9 r))

happyReduce_10 = happyMonadReduce 2# 4# happyReduction_10
happyReduction_10 (happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest) tk
	 = happyThen (case happyOutTok happy_x_1 of { (TokWith     happy_var_1) -> 
	( \_ -> lift $ modify (Layout happy_var_1 :))}
	) (\r -> happyReturn (happyIn9 r))

happyReduce_11 = happyMonadReduce 2# 5# happyReduction_11
happyReduction_11 (happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest) tk
	 = happyThen (( \_ -> lift $ modify (NoLayout  :))
	) (\r -> happyReturn (happyIn10 r))

happyReduce_12 = happyMonadReduce 2# 5# happyReduction_12
happyReduction_12 (happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest) tk
	 = happyThen (case happyOutTok happy_x_1 of { (TokWhere    happy_var_1) -> 
	( \_ -> lift $ modify (Layout happy_var_1 :))}
	) (\r -> happyReturn (happyIn10 r))

happyReduce_13 = happyMonadReduce 2# 6# happyReduction_13
happyReduction_13 (happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest) tk
	 = happyThen (( \_ -> lift $ modify (NoLayout  :))
	) (\r -> happyReturn (happyIn11 r))

happyReduce_14 = happyMonadReduce 2# 6# happyReduction_14
happyReduction_14 (happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest) tk
	 = happyThen (case happyOutTok happy_x_1 of { (TokOf       happy_var_1) -> 
	( \_ -> lift $ modify (Layout happy_var_1 :))}
	) (\r -> happyReturn (happyIn11 r))

happyReduce_15 = happySpecReduce_3  7# happyReduction_15
happyReduction_15 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOut28 happy_x_3 of { happy_var_3 -> 
	happyIn12
		 (DefType happy_var_1 happy_var_3
	)}}

happyReduce_16 = happyReduce 4# 7# happyReduction_16
happyReduction_16 (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_2 of { happy_var_2 -> 
	case happyOut28 happy_x_4 of { happy_var_4 -> 
	happyIn12
		 (DefFun happy_var_1 (reverse happy_var_2) (Just happy_var_4)
	) `HappyStk` happyRest}}}

happyReduce_17 = happySpecReduce_2  7# happyReduction_17
happyReduction_17 happy_x_2
	happy_x_1
	 =  case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOut20 happy_x_2 of { happy_var_2 -> 
	happyIn12
		 (DefFun happy_var_1 (reverse happy_var_2) Nothing
	)}}

happyReduce_18 = happySpecReduce_3  7# happyReduction_18
happyReduction_18 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut5 happy_x_2 of { happy_var_2 -> 
	case happyOut24 happy_x_3 of { happy_var_3 -> 
	happyIn12
		 (DefData happy_var_2 (reverse happy_var_3) [] []
	)}}

happyReduce_19 = happyReduce 6# 7# happyReduction_19
happyReduction_19 (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 happyOut24 happy_x_3 of { happy_var_3 -> 
	case happyOut22 happy_x_5 of { happy_var_5 -> 
	case happyOut17 happy_x_6 of { happy_var_6 -> 
	happyIn12
		 (DefData happy_var_2 (reverse happy_var_3) (reverse happy_var_5) happy_var_6
	) `HappyStk` happyRest}}}}

happyReduce_20 = happyReduce 8# 7# happyReduction_20
happyReduction_20 (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 happyOut24 happy_x_3 of { happy_var_3 -> 
	case happyOut14 happy_x_5 of { happy_var_5 -> 
	case happyOut15 happy_x_6 of { happy_var_6 -> 
	case happyOut17 happy_x_8 of { happy_var_8 -> 
	happyIn12
		 (DefRecord happy_var_2 (reverse happy_var_3) happy_var_5 (reverse happy_var_6) happy_var_8
	) `HappyStk` happyRest}}}}}

happyReduce_21 = happySpecReduce_3  7# happyReduction_21
happyReduction_21 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOutTok happy_x_1 of { (TokInfix    happy_var_1) -> 
	case happyOutTok happy_x_2 of { (TokInteger  happy_var_2) -> 
	case happyOut7 happy_x_3 of { happy_var_3 -> 
	happyIn12
		 (DefFixity (fst happy_var_1) (snd happy_var_1) (snd happy_var_2) (map snd happy_var_3)
	)}}}

happyReduce_22 = happySpecReduce_1  7# happyReduction_22
happyReduction_22 happy_x_1
	 =  case happyOutTok happy_x_1 of { (TokImport   happy_var_1) -> 
	happyIn12
		 (DefImport happy_var_1
	)}

happyReduce_23 = happySpecReduce_0  8# happyReduction_23
happyReduction_23  =  happyIn13
		 ([]
	)

happyReduce_24 = happySpecReduce_1  8# happyReduction_24
happyReduction_24 happy_x_1
	 =  case happyOut12 happy_x_1 of { happy_var_1 -> 
	happyIn13
		 ([happy_var_1]
	)}

happyReduce_25 = happySpecReduce_2  8# happyReduction_25
happyReduction_25 happy_x_2
	happy_x_1
	 =  case happyOut13 happy_x_1 of { happy_var_1 -> 
	happyIn13
		 (happy_var_1
	)}

happyReduce_26 = happySpecReduce_3  8# happyReduction_26
happyReduction_26 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut13 happy_x_1 of { happy_var_1 -> 
	case happyOut12 happy_x_3 of { happy_var_3 -> 
	happyIn13
		 (happy_var_3:happy_var_1
	)}}

happyReduce_27 = happySpecReduce_0  9# happyReduction_27
happyReduction_27  =  happyIn14
		 (Nothing
	)

happyReduce_28 = happySpecReduce_2  9# happyReduction_28
happyReduction_28 happy_x_2
	happy_x_1
	 =  case happyOut5 happy_x_2 of { happy_var_2 -> 
	happyIn14
		 (Just happy_var_2
	)}

happyReduce_29 = happySpecReduce_0  10# happyReduction_29
happyReduction_29  =  happyIn15
		 ([]
	)

happyReduce_30 = happySpecReduce_1  10# happyReduction_30
happyReduction_30 happy_x_1
	 =  case happyOut16 happy_x_1 of { happy_var_1 -> 
	happyIn15
		 ([happy_var_1]
	)}

happyReduce_31 = happySpecReduce_2  10# happyReduction_31
happyReduction_31 happy_x_2
	happy_x_1
	 =  case happyOut15 happy_x_1 of { happy_var_1 -> 
	happyIn15
		 (happy_var_1
	)}

happyReduce_32 = happySpecReduce_3  10# happyReduction_32
happyReduction_32 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut15 happy_x_1 of { happy_var_1 -> 
	case happyOut16 happy_x_3 of { happy_var_3 -> 
	happyIn15
		 (happy_var_3:happy_var_1
	)}}

happyReduce_33 = happySpecReduce_3  11# happyReduction_33
happyReduction_33 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOutTok happy_x_1 of { (TokIdent    happy_var_1) -> 
	case happyOut28 happy_x_3 of { happy_var_3 -> 
	happyIn16
		 (Field happy_var_1 happy_var_3
	)}}

happyReduce_34 = happySpecReduce_0  12# happyReduction_34
happyReduction_34  =  happyIn17
		 ([]
	)

happyReduce_35 = happySpecReduce_3  12# happyReduction_35
happyReduction_35 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut18 happy_x_2 of { happy_var_2 -> 
	happyIn17
		 (reverse happy_var_2
	)}

happyReduce_36 = happyReduce 4# 13# happyReduction_36
happyReduction_36 (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_2 of { happy_var_2 -> 
	case happyOut28 happy_x_4 of { happy_var_4 -> 
	happyIn18
		 ([Clause happy_var_1 (reverse happy_var_2) happy_var_4]
	) `HappyStk` happyRest}}}

happyReduce_37 = happySpecReduce_2  13# happyReduction_37
happyReduction_37 happy_x_2
	happy_x_1
	 =  case happyOut18 happy_x_1 of { happy_var_1 -> 
	happyIn18
		 (happy_var_1
	)}

happyReduce_38 = happyReduce 6# 13# happyReduction_38
happyReduction_38 (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 happyOut18 happy_x_1 of { happy_var_1 -> 
	case happyOut5 happy_x_3 of { happy_var_3 -> 
	case happyOut20 happy_x_4 of { happy_var_4 -> 
	case happyOut28 happy_x_6 of { happy_var_6 -> 
	happyIn18
		 (Clause happy_var_3 (reverse happy_var_4) happy_var_6 : happy_var_1
	) `HappyStk` happyRest}}}}

happyReduce_39 = happySpecReduce_1  14# happyReduction_39
happyReduction_39 happy_x_1
	 =  case happyOut5 happy_x_1 of { happy_var_1 -> 
	happyIn19
		 (Apply (fst happy_var_1, snd happy_var_1) []
	)}

happyReduce_40 = happySpecReduce_2  14# happyReduction_40
happyReduction_40 happy_x_2
	happy_x_1
	 =  case happyOutTok happy_x_1 of { (TokLParen   happy_var_1) -> 
	happyIn19
		 (Apply (happy_var_1, Operator "") []
	)}

happyReduce_41 = happyReduce 4# 14# happyReduction_41
happyReduction_41 (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 happyOut20 happy_x_3 of { happy_var_3 -> 
	happyIn19
		 (Apply (fst happy_var_2, snd happy_var_2) (reverse happy_var_3)
	) `HappyStk` happyRest}}

happyReduce_42 = happySpecReduce_0  15# happyReduction_42
happyReduction_42  =  happyIn20
		 ([]
	)

happyReduce_43 = happySpecReduce_2  15# happyReduction_43
happyReduction_43 happy_x_2
	happy_x_1
	 =  case happyOut20 happy_x_1 of { happy_var_1 -> 
	case happyOut19 happy_x_2 of { happy_var_2 -> 
	happyIn20
		 (happy_var_2:happy_var_1
	)}}

happyReduce_44 = happySpecReduce_2  16# happyReduction_44
happyReduction_44 happy_x_2
	happy_x_1
	 =  case happyOut5 happy_x_1 of { happy_var_1 -> 
	case happyOut24 happy_x_2 of { happy_var_2 -> 
	happyIn21
		 (ConDef happy_var_1 (reverse happy_var_2)
	)}}

happyReduce_45 = happySpecReduce_1  17# happyReduction_45
happyReduction_45 happy_x_1
	 =  case happyOut21 happy_x_1 of { happy_var_1 -> 
	happyIn22
		 ([happy_var_1]
	)}

happyReduce_46 = happySpecReduce_3  17# happyReduction_46
happyReduction_46 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut22 happy_x_1 of { happy_var_1 -> 
	case happyOut21 happy_x_3 of { happy_var_3 -> 
	happyIn22
		 (happy_var_3:happy_var_1
	)}}

happyReduce_47 = happySpecReduce_1  18# happyReduction_47
happyReduction_47 happy_x_1
	 =  case happyOut35 happy_x_1 of { happy_var_1 -> 
	happyIn23
		 (TypeTele Explicit happy_var_1
	)}

happyReduce_48 = happySpecReduce_3  18# happyReduction_48
happyReduction_48 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut35 happy_x_2 of { happy_var_2 -> 
	happyIn23
		 (TypeTele Implicit happy_var_2
	)}

happyReduce_49 = happyMonadReduce 5# 18# happyReduction_49
happyReduction_49 (happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest) tk
	 = happyThen (case happyOut34 happy_x_2 of { happy_var_2 -> 
	case happyOut28 happy_x_4 of { happy_var_4 -> 
	( \_ -> mapM exprToVar happy_var_2 >>= \vars -> return (VarsTele Explicit (reverse vars) happy_var_4))}}
	) (\r -> happyReturn (happyIn23 r))

happyReduce_50 = happyMonadReduce 5# 18# 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) tk
	 = happyThen (case happyOut34 happy_x_2 of { happy_var_2 -> 
	case happyOut28 happy_x_4 of { happy_var_4 -> 
	( \_ -> mapM exprToVar happy_var_2 >>= \vars -> return (VarsTele Implicit (reverse vars) happy_var_4))}}
	) (\r -> happyReturn (happyIn23 r))

happyReduce_51 = happySpecReduce_0  19# happyReduction_51
happyReduction_51  =  happyIn24
		 ([]
	)

happyReduce_52 = happySpecReduce_2  19# happyReduction_52
happyReduction_52 happy_x_2
	happy_x_1
	 =  case happyOut24 happy_x_1 of { happy_var_1 -> 
	case happyOut23 happy_x_2 of { happy_var_2 -> 
	happyIn24
		 (happy_var_2:happy_var_1
	)}}

happyReduce_53 = happyReduce 5# 20# happyReduction_53
happyReduction_53 (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_1 of { (TokLParen   happy_var_1) -> 
	case happyOut34 happy_x_2 of { happy_var_2 -> 
	case happyOut28 happy_x_4 of { happy_var_4 -> 
	happyIn25
		 ((Explicit, PiTele happy_var_1 (reverse happy_var_2) happy_var_4)
	) `HappyStk` happyRest}}}

happyReduce_54 = happyReduce 5# 20# happyReduction_54
happyReduction_54 (happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut8 happy_x_1 of { happy_var_1 -> 
	case happyOut34 happy_x_2 of { happy_var_2 -> 
	case happyOut28 happy_x_4 of { happy_var_4 -> 
	happyIn25
		 ((Implicit, PiTele happy_var_1 (reverse happy_var_2) happy_var_4)
	) `HappyStk` happyRest}}}

happyReduce_55 = happySpecReduce_1  21# happyReduction_55
happyReduction_55 happy_x_1
	 =  case happyOut25 happy_x_1 of { happy_var_1 -> 
	happyIn26
		 ([happy_var_1]
	)}

happyReduce_56 = happySpecReduce_2  21# happyReduction_56
happyReduction_56 happy_x_2
	happy_x_1
	 =  case happyOut26 happy_x_1 of { happy_var_1 -> 
	case happyOut25 happy_x_2 of { happy_var_2 -> 
	happyIn26
		 (happy_var_2:happy_var_1
	)}}

happyReduce_57 = happySpecReduce_1  22# happyReduction_57
happyReduction_57 happy_x_1
	 =  case happyOutTok happy_x_1 of { (TokIdent    happy_var_1) -> 
	happyIn27
		 ([happy_var_1]
	)}

happyReduce_58 = happySpecReduce_2  22# happyReduction_58
happyReduction_58 happy_x_2
	happy_x_1
	 =  case happyOut27 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (TokIdent    happy_var_2) -> 
	happyIn27
		 (happy_var_2:happy_var_1
	)}}

happyReduce_59 = happySpecReduce_1  23# happyReduction_59
happyReduction_59 happy_x_1
	 =  case happyOut29 happy_x_1 of { happy_var_1 -> 
	happyIn28
		 (happy_var_1
	)}

happyReduce_60 = happyReduce 4# 23# happyReduction_60
happyReduction_60 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOutTok happy_x_1 of { (TokLam      happy_var_1) -> 
	case happyOut27 happy_x_2 of { happy_var_2 -> 
	case happyOut28 happy_x_4 of { happy_var_4 -> 
	happyIn28
		 (Apply (happy_var_1, Lam $ reverse $ map getName happy_var_2) [happy_var_4]
	) `HappyStk` happyRest}}}

happyReduce_61 = happySpecReduce_1  24# happyReduction_61
happyReduction_61 happy_x_1
	 =  case happyOut30 happy_x_1 of { happy_var_1 -> 
	happyIn29
		 (happy_var_1
	)}

happyReduce_62 = happySpecReduce_3  24# happyReduction_62
happyReduction_62 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut30 happy_x_1 of { happy_var_1 -> 
	case happyOut29 happy_x_3 of { happy_var_3 -> 
	happyIn29
		 (Apply (termPos happy_var_1, Pi Explicit []) [happy_var_1, happy_var_3]
	)}}

happyReduce_63 = happyMonadReduce 3# 24# happyReduction_63
happyReduction_63 (happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest) tk
	 = happyThen (case happyOut26 happy_x_1 of { happy_var_1 -> 
	case happyOut29 happy_x_3 of { happy_var_3 -> 
	( \_ -> piExpr (reverse happy_var_1) happy_var_3)}}
	) (\r -> happyReturn (happyIn29 r))

happyReduce_64 = happySpecReduce_1  25# happyReduction_64
happyReduction_64 happy_x_1
	 =  case happyOut31 happy_x_1 of { happy_var_1 -> 
	happyIn30
		 (happy_var_1
	)}

happyReduce_65 = happySpecReduce_3  25# happyReduction_65
happyReduction_65 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut31 happy_x_1 of { happy_var_1 -> 
	case happyOut31 happy_x_3 of { happy_var_3 -> 
	happyIn30
		 (Apply (termPos happy_var_1, PathImp) [happy_var_1,happy_var_3]
	)}}

happyReduce_66 = happySpecReduce_1  26# happyReduction_66
happyReduction_66 happy_x_1
	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
	happyIn31
		 (Apply (termPos happy_var_1, Null) [happy_var_1]
	)}

happyReduce_67 = happySpecReduce_3  26# happyReduction_67
happyReduction_67 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut31 happy_x_1 of { happy_var_1 -> 
	case happyOut32 happy_x_3 of { happy_var_3 -> 
	happyIn31
		 (Apply (termPos happy_var_1, At) [happy_var_1, happy_var_3]
	)}}

happyReduce_68 = happySpecReduce_3  26# happyReduction_68
happyReduction_68 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut31 happy_x_1 of { happy_var_1 -> 
	case happyOut6 happy_x_2 of { happy_var_2 -> 
	case happyOut32 happy_x_3 of { happy_var_3 -> 
	happyIn31
		 (Apply (termPos happy_var_1, Name (Infix InfixL 90) $ snd happy_var_2) [happy_var_1, happy_var_3]
	)}}}

happyReduce_69 = happySpecReduce_1  27# happyReduction_69
happyReduction_69 happy_x_1
	 =  case happyOut34 happy_x_1 of { happy_var_1 -> 
	happyIn32
		 (let e:es = reverse happy_var_1 in apps e es
	)}

happyReduce_70 = happySpecReduce_3  27# happyReduction_70
happyReduction_70 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (TokField    happy_var_2) -> 
	case happyOut33 happy_x_3 of { happy_var_3 -> 
	happyIn32
		 (Apply (termPos happy_var_1, FieldAcc 0 happy_var_2) (happy_var_1 : reverse happy_var_3)
	)}}}

happyReduce_71 = happySpecReduce_0  28# happyReduction_71
happyReduction_71  =  happyIn33
		 ([]
	)

happyReduce_72 = happySpecReduce_2  28# happyReduction_72
happyReduction_72 happy_x_2
	happy_x_1
	 =  case happyOut33 happy_x_1 of { happy_var_1 -> 
	case happyOut35 happy_x_2 of { happy_var_2 -> 
	happyIn33
		 (happy_var_2:happy_var_1
	)}}

happyReduce_73 = happySpecReduce_1  29# happyReduction_73
happyReduction_73 happy_x_1
	 =  case happyOut35 happy_x_1 of { happy_var_1 -> 
	happyIn34
		 ([happy_var_1]
	)}

happyReduce_74 = happySpecReduce_2  29# happyReduction_74
happyReduction_74 happy_x_2
	happy_x_1
	 =  case happyOut34 happy_x_1 of { happy_var_1 -> 
	case happyOut35 happy_x_2 of { happy_var_2 -> 
	happyIn34
		 (happy_var_2:happy_var_1
	)}}

happyReduce_75 = happySpecReduce_1  30# happyReduction_75
happyReduction_75 happy_x_1
	 =  case happyOut5 happy_x_1 of { happy_var_1 -> 
	happyIn35
		 (Apply (fst happy_var_1, Name Prefix $ snd happy_var_1) []
	)}

happyReduce_76 = happySpecReduce_3  30# happyReduction_76
happyReduction_76 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut28 happy_x_2 of { happy_var_2 -> 
	happyIn35
		 (happy_var_2
	)}

happyReduce_77 = happyReduce 5# 30# happyReduction_77
happyReduction_77 (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_1 of { (TokCase     happy_var_1) -> 
	case happyOut28 happy_x_2 of { happy_var_2 -> 
	case happyOut36 happy_x_4 of { happy_var_4 -> 
	happyIn35
		 (Apply (happy_var_1, Case $ map vacuous $ reverse $ fst happy_var_4) (happy_var_2 : reverse (snd happy_var_4))
	) `HappyStk` happyRest}}}

happyReduce_78 = happyReduce 4# 31# happyReduction_78
happyReduction_78 (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_2 of { happy_var_2 -> 
	case happyOut28 happy_x_4 of { happy_var_4 -> 
	happyIn36
		 (([Apply happy_var_1 $ reverse happy_var_2], [happy_var_4])
	) `HappyStk` happyRest}}}

happyReduce_79 = happySpecReduce_2  31# happyReduction_79
happyReduction_79 happy_x_2
	happy_x_1
	 =  case happyOut36 happy_x_1 of { happy_var_1 -> 
	happyIn36
		 (happy_var_1
	)}

happyReduce_80 = happyReduce 6# 31# happyReduction_80
happyReduction_80 (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 happyOut36 happy_x_1 of { happy_var_1 -> 
	case happyOut5 happy_x_3 of { happy_var_3 -> 
	case happyOut20 happy_x_4 of { happy_var_4 -> 
	case happyOut28 happy_x_6 of { happy_var_6 -> 
	happyIn36
		 ((Apply happy_var_3 (reverse happy_var_4) : fst happy_var_1, happy_var_6 : snd happy_var_1)
	) `HappyStk` happyRest}}}}

happyNewToken action sts stk
	= alexScanTokens(\tk -> 
	let cont i = happyDoAction i tk action sts stk in
	case tk of {
	TokEOF -> happyDoAction 26# tk action sts stk;
	TokIdent    happy_dollar_dollar -> cont 1#;
	TokImport   happy_dollar_dollar -> cont 2#;
	TokOperator happy_dollar_dollar -> cont 3#;
	TokInfix    happy_dollar_dollar -> cont 4#;
	TokInteger  happy_dollar_dollar -> cont 5#;
	TokField    happy_dollar_dollar -> cont 6#;
	TokLam      happy_dollar_dollar -> cont 7#;
	TokLParen   happy_dollar_dollar -> cont 8#;
	TokCase     happy_dollar_dollar -> cont 9#;
	TokOf       happy_dollar_dollar -> cont 10#;
	TokData -> cont 11#;
	TokRecord -> cont 12#;
	TokConstructor -> cont 13#;
	TokWhere    happy_dollar_dollar -> cont 14#;
	TokColon -> cont 15#;
	TokEquals -> cont 16#;
	TokLBrace   happy_dollar_dollar -> cont 17#;
	TokRBrace -> cont 18#;
	TokSemicolon -> cont 19#;
	TokRParen -> cont 20#;
	TokPipe -> cont 21#;
	TokAt -> cont 22#;
	TokApos -> cont 23#;
	TokArrow -> cont 24#;
	TokWith     happy_dollar_dollar -> cont 25#;
	_ -> happyError' tk
	})

happyError_ 26# tk = happyError' tk
happyError_ _ tk = happyError' tk

happyThen :: () => Parser a -> (a -> Parser b) -> Parser b
happyThen = (bind)
happyReturn :: () => a -> Parser a
happyReturn = (return')
happyThen1 = happyThen
happyReturn1 :: () => a -> Parser a
happyReturn1 = happyReturn
happyError' :: () => (Token) -> Parser a
happyError' tk = parseError tk

pDefs = happySomeParser where
  happySomeParser = happyThen (happyParse 0#) (\x -> happyReturn (happyOut13 x))

pExpr = happySomeParser where
  happySomeParser = happyThen (happyParse 1#) (\x -> happyReturn (happyOut28 x))

happySeq = happyDontSeq


return' :: a -> Parser a
return' a _ = return a

bind :: Parser a -> (a -> Parser b) -> Parser b
bind p k e = p e >>= \a -> k a e

data PiTele = PiTele Posn [RawExpr] RawExpr

piExpr :: [(Explicit,PiTele)] -> RawExpr -> ParserErr RawExpr
piExpr [] term = return term
piExpr ((e, PiTele pos t1 t2) : teles) term = do
    vars <- mapM exprToVar t1
    term' <- piExpr teles term
    return $ Apply (pos, Pi e $ map getName vars) [t2,term']

termPos :: RawExpr -> Posn
termPos (Apply (pos, _) _) = pos
termPos _ = error "termPos"

exprToVar :: RawExpr -> ParserErr PIdent
exprToVar (Apply (pos, Name Prefix (Ident v)) []) = return (PIdent pos v)
exprToVar term = throwError [(termPos term, "Expected a list of identifiers")]

parseError :: Token -> Parser a
parseError tok (pos,_) = throwError [(maybe pos id (tokGetPos tok), "Syntax error")]

myLexer = alexScanTokens
{-# LINE 1 "templates/GenericTemplate.hs" #-}
{-# LINE 1 "templates/GenericTemplate.hs" #-}
{-# LINE 1 "<command-line>" #-}
{-# LINE 1 "templates/GenericTemplate.hs" #-}
-- Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp 

{-# LINE 30 "templates/GenericTemplate.hs" #-}


data Happy_IntList = HappyCons Happy_GHC_Exts.Int# Happy_IntList





{-# LINE 51 "templates/GenericTemplate.hs" #-}

{-# LINE 61 "templates/GenericTemplate.hs" #-}

{-# LINE 70 "templates/GenericTemplate.hs" #-}

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 Happy_GHC_Exts.<# (0# :: Happy_GHC_Exts.Int#)) -> {- nothing -}

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


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

{-# LINE 130 "templates/GenericTemplate.hs" #-}


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





data HappyAddr = HappyA# Happy_GHC_Exts.Addr#




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

{-# LINE 163 "templates/GenericTemplate.hs" #-}

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

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

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

-- happyReduce is specialised for the common cases.

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

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

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

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

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

happyMonadReduce k nt fn 0# tk st sts stk
     = happyFail 0# tk st sts stk
happyMonadReduce k nt fn j tk st sts stk =
        happyThen1 (fn stk tk) (\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

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

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




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

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

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


happyGoto nt j tk st = 
   {- nothing -}
   happyDoAction j tk new_state
   where (off) = indexShortOffAddr happyGotoOffsets st
         (off_i) = (off Happy_GHC_Exts.+# 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@(x `HappyStk` _) =
     let (i) = (case Happy_GHC_Exts.unsafeCoerce# x of { (Happy_GHC_Exts.I# (i)) -> i }) in
--	trace "failing" $ 
        happyError_ i tk

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

-- discard a state
happyFail  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 ( (Happy_GHC_Exts.unsafeCoerce# (Happy_GHC_Exts.I# (i))) `HappyStk` stk)

-- Internal happy errors:

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

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


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


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

happyDoSeq, happyDontSeq :: a -> b -> b
happyDoSeq   a b = a `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.