{-# OPTIONS_GHC -w #-}
{-# OPTIONS -XMagicHash -XBangPatterns -XTypeSynonymInstances -XFlexibleInstances -cpp #-}
#if __GLASGOW_HASKELL__ >= 710
{-# OPTIONS_GHC -XPartialTypeSignatures #-}
#endif
{-# OPTIONS_GHC -fno-warn-incomplete-patterns -fno-warn-overlapping-patterns #-}
{-# LANGUAGE PatternSynonyms #-}

module Language.LambdaPi.Syntax.Par
  ( happyError
  , myLexer
  , pProgram
  , pCommand
  , pListCommand
  , pTerm2
  , pTerm
  , pTerm1
  , pScopedTerm
  , pPattern
  ) where

import Prelude

import qualified Language.LambdaPi.Syntax.Abs
import Language.LambdaPi.Syntax.Lex
import qualified Data.Array as Happy_Data_Array
import qualified Data.Bits as Bits
import qualified GHC.Exts as Happy_GHC_Exts
import Control.Applicative(Applicative(..))
import Control.Monad (ap)

-- parser produced by Happy Version 1.20.1.1

newtype HappyAbsSyn  = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
newtype HappyWrap11 = HappyWrap11 ((Language.LambdaPi.Syntax.Abs.BNFC'Position, Language.LambdaPi.Syntax.Abs.VarIdent))
happyIn11 :: ((Language.LambdaPi.Syntax.Abs.BNFC'Position, Language.LambdaPi.Syntax.Abs.VarIdent)) -> (HappyAbsSyn )
happyIn11 :: (BNFC'Position, VarIdent) -> HappyAbsSyn
happyIn11 (BNFC'Position, VarIdent)
x = HappyWrap11 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, VarIdent) -> HappyWrap11
HappyWrap11 (BNFC'Position, VarIdent)
x)
{-# INLINE happyIn11 #-}
happyOut11 :: (HappyAbsSyn ) -> HappyWrap11
happyOut11 :: HappyAbsSyn -> HappyWrap11
happyOut11 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap11
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut11 #-}
newtype HappyWrap12 = HappyWrap12 ((Language.LambdaPi.Syntax.Abs.BNFC'Position, Language.LambdaPi.Syntax.Abs.Program))
happyIn12 :: ((Language.LambdaPi.Syntax.Abs.BNFC'Position, Language.LambdaPi.Syntax.Abs.Program)) -> (HappyAbsSyn )
happyIn12 :: (BNFC'Position, Program) -> HappyAbsSyn
happyIn12 (BNFC'Position, Program)
x = HappyWrap12 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Program) -> HappyWrap12
HappyWrap12 (BNFC'Position, Program)
x)
{-# INLINE happyIn12 #-}
happyOut12 :: (HappyAbsSyn ) -> HappyWrap12
happyOut12 :: HappyAbsSyn -> HappyWrap12
happyOut12 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap12
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut12 #-}
newtype HappyWrap13 = HappyWrap13 ((Language.LambdaPi.Syntax.Abs.BNFC'Position, Language.LambdaPi.Syntax.Abs.Command))
happyIn13 :: ((Language.LambdaPi.Syntax.Abs.BNFC'Position, Language.LambdaPi.Syntax.Abs.Command)) -> (HappyAbsSyn )
happyIn13 :: (BNFC'Position, Command) -> HappyAbsSyn
happyIn13 (BNFC'Position, Command)
x = HappyWrap13 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Command) -> HappyWrap13
HappyWrap13 (BNFC'Position, Command)
x)
{-# INLINE happyIn13 #-}
happyOut13 :: (HappyAbsSyn ) -> HappyWrap13
happyOut13 :: HappyAbsSyn -> HappyWrap13
happyOut13 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap13
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut13 #-}
newtype HappyWrap14 = HappyWrap14 ((Language.LambdaPi.Syntax.Abs.BNFC'Position, [Language.LambdaPi.Syntax.Abs.Command]))
happyIn14 :: ((Language.LambdaPi.Syntax.Abs.BNFC'Position, [Language.LambdaPi.Syntax.Abs.Command])) -> (HappyAbsSyn )
happyIn14 :: (BNFC'Position, [Command]) -> HappyAbsSyn
happyIn14 (BNFC'Position, [Command])
x = HappyWrap14 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, [Command]) -> HappyWrap14
HappyWrap14 (BNFC'Position, [Command])
x)
{-# INLINE happyIn14 #-}
happyOut14 :: (HappyAbsSyn ) -> HappyWrap14
happyOut14 :: HappyAbsSyn -> HappyWrap14
happyOut14 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap14
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut14 #-}
newtype HappyWrap15 = HappyWrap15 ((Language.LambdaPi.Syntax.Abs.BNFC'Position, Language.LambdaPi.Syntax.Abs.Term))
happyIn15 :: ((Language.LambdaPi.Syntax.Abs.BNFC'Position, Language.LambdaPi.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn15 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn15 (BNFC'Position, Term)
x = HappyWrap15 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap15
HappyWrap15 (BNFC'Position, Term)
x)
{-# INLINE happyIn15 #-}
happyOut15 :: (HappyAbsSyn ) -> HappyWrap15
happyOut15 :: HappyAbsSyn -> HappyWrap15
happyOut15 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap15
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut15 #-}
newtype HappyWrap16 = HappyWrap16 ((Language.LambdaPi.Syntax.Abs.BNFC'Position, Language.LambdaPi.Syntax.Abs.Term))
happyIn16 :: ((Language.LambdaPi.Syntax.Abs.BNFC'Position, Language.LambdaPi.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn16 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn16 (BNFC'Position, Term)
x = HappyWrap16 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap16
HappyWrap16 (BNFC'Position, Term)
x)
{-# INLINE happyIn16 #-}
happyOut16 :: (HappyAbsSyn ) -> HappyWrap16
happyOut16 :: HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap16
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut16 #-}
newtype HappyWrap17 = HappyWrap17 ((Language.LambdaPi.Syntax.Abs.BNFC'Position, Language.LambdaPi.Syntax.Abs.Term))
happyIn17 :: ((Language.LambdaPi.Syntax.Abs.BNFC'Position, Language.LambdaPi.Syntax.Abs.Term)) -> (HappyAbsSyn )
happyIn17 :: (BNFC'Position, Term) -> HappyAbsSyn
happyIn17 (BNFC'Position, Term)
x = HappyWrap17 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Term) -> HappyWrap17
HappyWrap17 (BNFC'Position, Term)
x)
{-# INLINE happyIn17 #-}
happyOut17 :: (HappyAbsSyn ) -> HappyWrap17
happyOut17 :: HappyAbsSyn -> HappyWrap17
happyOut17 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap17
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut17 #-}
newtype HappyWrap18 = HappyWrap18 ((Language.LambdaPi.Syntax.Abs.BNFC'Position, Language.LambdaPi.Syntax.Abs.ScopedTerm))
happyIn18 :: ((Language.LambdaPi.Syntax.Abs.BNFC'Position, Language.LambdaPi.Syntax.Abs.ScopedTerm)) -> (HappyAbsSyn )
happyIn18 :: (BNFC'Position, ScopedTerm) -> HappyAbsSyn
happyIn18 (BNFC'Position, ScopedTerm)
x = HappyWrap18 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, ScopedTerm) -> HappyWrap18
HappyWrap18 (BNFC'Position, ScopedTerm)
x)
{-# INLINE happyIn18 #-}
happyOut18 :: (HappyAbsSyn ) -> HappyWrap18
happyOut18 :: HappyAbsSyn -> HappyWrap18
happyOut18 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap18
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut18 #-}
newtype HappyWrap19 = HappyWrap19 ((Language.LambdaPi.Syntax.Abs.BNFC'Position, Language.LambdaPi.Syntax.Abs.Pattern))
happyIn19 :: ((Language.LambdaPi.Syntax.Abs.BNFC'Position, Language.LambdaPi.Syntax.Abs.Pattern)) -> (HappyAbsSyn )
happyIn19 :: (BNFC'Position, Pattern) -> HappyAbsSyn
happyIn19 (BNFC'Position, Pattern)
x = HappyWrap19 -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((BNFC'Position, Pattern) -> HappyWrap19
HappyWrap19 (BNFC'Position, Pattern)
x)
{-# INLINE happyIn19 #-}
happyOut19 :: (HappyAbsSyn ) -> HappyWrap19
happyOut19 :: HappyAbsSyn -> HappyWrap19
happyOut19 HappyAbsSyn
x = HappyAbsSyn -> HappyWrap19
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOut19 #-}
happyInTok :: (Token) -> (HappyAbsSyn )
happyInTok :: Token -> HappyAbsSyn
happyInTok Token
x = Token -> HappyAbsSyn
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# Token
x
{-# INLINE happyInTok #-}
happyOutTok :: (HappyAbsSyn ) -> (Token)
happyOutTok :: HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
x = HappyAbsSyn -> Token
forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn
x
{-# INLINE happyOutTok #-}


happyExpList :: HappyAddr
happyExpList :: HappyAddr
happyExpList = Addr# -> HappyAddr
HappyA# Addr#
"\x00\x00\x00\x0c\x00\x00\x00\x80\x01\x00\x00\x00\x30\x00\x00\x00\x04\x00\x04\x00\x80\x00\xde\x00\x00\x10\x00\x10\x00\x00\x02\x78\x03\x00\x40\x10\x40\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x20\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x02\x01\x00\x00\x00\x00\x00\x00\x04\xf0\x06\x00\x80\x00\x00\x00\x00\x10\x04\x10\x00\x00\x02\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x01\x00\x20\x80\x37\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x40\x00\x6f\x00\x00\x08\xe0\x0d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x01\x00\x00\x00\x00\x03\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\xbc\x01\x00\x20\x80\x37\x00\x00\x20\x00\x00\x00\x80\x20\x80\x00\x00\x60\x00\x00\x00\x00\x02\x00\x02\x00\x00\x01\x00\x00\x00\x08\x02\x08\x00\x00\x01\x00\x01\x00\x00\x00\x00\x00\x00\x04\xf0\x06\x00\x00\x08\x00\x00\x00\x10\xc0\x1b\x00\x00\x04\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\xbc\x01\x00\x20\x80\x37\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\xe0\x0d\x00\x00\x02\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x80\x00\x00\x40\x00\x6f\x00\x00\x00\x00\x00\x00\x00"#

{-# NOINLINE happyExpListPerState #-}
happyExpListPerState :: Int -> [String]
happyExpListPerState Int
st =
    [String]
token_strs_expected
  where token_strs :: [String]
token_strs = [String
"error",String
"%dummy",String
"%start_pProgram_internal",String
"%start_pCommand_internal",String
"%start_pListCommand_internal",String
"%start_pTerm2_internal",String
"%start_pTerm_internal",String
"%start_pTerm1_internal",String
"%start_pScopedTerm_internal",String
"%start_pPattern_internal",String
"VarIdent",String
"Program",String
"Command",String
"ListCommand",String
"Term2",String
"Term",String
"Term1",String
"ScopedTerm",String
"Pattern",String
"'('",String
"')'",String
"','",String
"'.'",String
"':'",String
"';'",String
"'_'",String
"'check'",String
"'compute'",String
"'\215'",String
"'\928'",String
"'\955'",String
"'\960\8321'",String
"'\960\8322'",String
"'\8594'",String
"'\120140'",String
"L_VarIdent",String
"%eof"]
        bit_start :: Int
bit_start = Int
st Int -> Int -> Int
forall a. Num a => a -> a -> a
Prelude.* Int
37
        bit_end :: Int
bit_end = (Int
st Int -> Int -> Int
forall a. Num a => a -> a -> a
Prelude.+ Int
1) Int -> Int -> Int
forall a. Num a => a -> a -> a
Prelude.* Int
37
        read_bit :: Int -> Bool
read_bit = HappyAddr -> Int -> Bool
readArrayBit HappyAddr
happyExpList
        bits :: [Bool]
bits = (Int -> Bool) -> [Int] -> [Bool]
forall a b. (a -> b) -> [a] -> [b]
Prelude.map Int -> Bool
read_bit [Int
bit_start..Int
bit_end Int -> Int -> Int
forall a. Num a => a -> a -> a
Prelude.- Int
1]
        bits_indexed :: [(Bool, Int)]
bits_indexed = [Bool] -> [Int] -> [(Bool, Int)]
forall a b. [a] -> [b] -> [(a, b)]
Prelude.zip [Bool]
bits [Int
0..Int
36]
        token_strs_expected :: [String]
token_strs_expected = ((Bool, Int) -> [String]) -> [(Bool, Int)] -> [String]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
Prelude.concatMap (Bool, Int) -> [String]
f [(Bool, Int)]
bits_indexed
        f :: (Bool, Int) -> [String]
f (Bool
Prelude.False, Int
_) = []
        f (Bool
Prelude.True, Int
nr) = [[String]
token_strs [String] -> Int -> String
forall a. HasCallStack => [a] -> Int -> a
Prelude.!! Int
nr]

happyActOffsets :: HappyAddr
happyActOffsets :: HappyAddr
happyActOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\xfe\xff\xfe\xff\xfe\xff\x0c\x00\x09\x00\x0c\x00\x09\x00\x07\x00\xf0\xff\x00\x00\x00\x00\x11\x00\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x00\x11\x00\x09\x00\x33\x00\x1b\x00\x3b\x00\x4c\x00\x00\x00\x01\x00\x09\x00\x18\x00\x18\x00\x46\x00\x45\x00\x09\x00\x09\x00\x45\x00\x45\x00\x00\x00\x51\x00\x5b\x00\xfe\xff\x68\x00\x00\x00\x09\x00\x09\x00\x5d\x00\x1b\x00\x30\x00\x0c\x00\x71\x00\x1b\x00\x0c\x00\x00\x00\x09\x00\x66\x00\x09\x00\x7c\x00\x7e\x00\x00\x00\x09\x00\x09\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\x80\x00\x81\x00\x00\x00\x00\x00\x82\x00\x6e\x00\x09\x00\x00\x00\x00\x00"#

happyGotoOffsets :: HappyAddr
happyGotoOffsets :: HappyAddr
happyGotoOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\x0e\x00\x83\x00\x38\x00\x05\x00\x41\x00\x76\x00\x29\x00\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x21\x00\x00\x00\x44\x00\x00\x00\x1e\x00\x00\x00\x00\x00\x00\x00\x21\x00\x4b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x4e\x00\x55\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x58\x00\x5f\x00\x00\x00\x1f\x00\x00\x00\x7b\x00\x00\x00\x20\x00\x21\x00\x00\x00\x62\x00\x00\x00\x31\x00\x00\x00\x00\x00\x00\x00\x69\x00\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x73\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x39\x00\x00\x00\x00\x00"#

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

happyDefActions :: HappyAddr
happyDefActions :: HappyAddr
happyDefActions = Addr# -> HappyAddr
HappyA# Addr#
"\xf3\xff\x00\x00\xf3\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf7\xff\xe3\xff\x00\x00\x00\x00\xe4\xff\xf1\xff\xe6\xff\xe5\xff\xe8\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe9\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf6\xff\x00\x00\x00\x00\xf3\xff\x00\x00\xe7\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xed\xff\xf0\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf2\xff\x00\x00\x00\x00\xf4\xff\xf5\xff\xea\xff\xeb\xff\xee\xff\x00\x00\x00\x00\x00\x00\xe2\xff\xec\xff\x00\x00\x00\x00\x00\x00\xef\xff"#

happyCheck :: HappyAddr
happyCheck :: HappyAddr
happyCheck = Addr# -> HappyAddr
HappyA# Addr#
"\xff\xff\x11\x00\x01\x00\x00\x00\x00\x00\x00\x00\x08\x00\x09\x00\x01\x00\x04\x00\x01\x00\x08\x00\x08\x00\x01\x00\x07\x00\x01\x00\x02\x00\x03\x00\x11\x00\x12\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x11\x00\x10\x00\x11\x00\x01\x00\x01\x00\x11\x00\x00\x00\x00\x00\x00\x00\x00\x00\x07\x00\x12\x00\x0a\x00\x04\x00\x08\x00\x08\x00\x08\x00\x00\x00\x12\x00\x11\x00\x11\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x02\x00\x03\x00\x01\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x02\x00\x03\x00\x01\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x02\x00\x03\x00\x00\x00\x04\x00\x05\x00\x06\x00\x04\x00\x05\x00\x06\x00\x00\x00\x06\x00\x01\x00\x00\x00\x04\x00\x05\x00\x06\x00\x04\x00\x05\x00\x06\x00\x00\x00\x05\x00\x12\x00\x00\x00\x04\x00\x05\x00\x06\x00\x04\x00\x05\x00\x06\x00\x00\x00\x05\x00\x04\x00\x00\x00\x04\x00\x05\x00\x06\x00\x04\x00\x05\x00\x06\x00\x00\x00\x02\x00\x05\x00\x00\x00\x04\x00\x05\x00\x06\x00\x04\x00\x05\x00\x06\x00\x00\x00\x03\x00\xff\xff\x00\x00\x04\x00\x05\x00\x06\x00\x04\x00\x00\x00\x06\x00\x0f\x00\x02\x00\x04\x00\x02\x00\x06\x00\x02\x00\x02\x00\x02\x00\x02\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"#

happyTable :: HappyAddr
happyTable :: HappyAddr
happyTable = Addr# -> HappyAddr
HappyA# Addr#
"\x00\x00\x0a\x00\x1b\x00\x0a\x00\x0a\x00\x0e\x00\x20\x00\x21\x00\x0d\x00\x1c\x00\x14\x00\x0b\x00\x2f\x00\x1b\x00\x0e\x00\x22\x00\x1d\x00\x23\x00\x0a\x00\xff\xff\x15\x00\x16\x00\x17\x00\x18\x00\x0a\x00\x19\x00\x0a\x00\x1b\x00\x0d\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0e\x00\x0e\x00\xff\xff\x2f\x00\x28\x00\x2b\x00\x34\x00\x42\x00\x0e\x00\xff\xff\x0a\x00\x0a\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x0e\x00\x33\x00\x34\x00\x2d\x00\x0f\x00\x10\x00\x11\x00\x3f\x00\x0e\x00\x1d\x00\x1e\x00\x2b\x00\x0f\x00\x10\x00\x11\x00\x48\x00\x0e\x00\x1d\x00\x38\x00\x0e\x00\x0f\x00\x1b\x00\x11\x00\x0f\x00\x2d\x00\x11\x00\x0e\x00\x27\x00\x2a\x00\x0e\x00\x0f\x00\x27\x00\x11\x00\x0f\x00\x25\x00\x11\x00\x0e\x00\x3b\x00\xff\xff\x0e\x00\x0f\x00\x24\x00\x11\x00\x0f\x00\x37\x00\x11\x00\x0e\x00\x3a\x00\x36\x00\x0e\x00\x0f\x00\x36\x00\x11\x00\x0f\x00\x41\x00\x11\x00\x0e\x00\x33\x00\x41\x00\x0e\x00\x0f\x00\x3c\x00\x11\x00\x0f\x00\x3b\x00\x11\x00\x0e\x00\x31\x00\x00\x00\x0e\x00\x0f\x00\x45\x00\x11\x00\x0f\x00\x0e\x00\x19\x00\x48\x00\x3f\x00\x0f\x00\x3e\x00\x31\x00\x45\x00\x44\x00\x47\x00\x21\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#

happyReduceArr :: Array
  Int
  (Int#
   -> Token
   -> Int#
   -> Happy_IntList
   -> HappyStk HappyAbsSyn
   -> [Token]
   -> Err HappyAbsSyn)
happyReduceArr = (Int, Int)
-> [(Int,
     Int#
     -> Token
     -> Int#
     -> Happy_IntList
     -> HappyStk HappyAbsSyn
     -> [Token]
     -> Err HappyAbsSyn)]
-> Array
     Int
     (Int#
      -> Token
      -> Int#
      -> Happy_IntList
      -> HappyStk HappyAbsSyn
      -> [Token]
      -> Err HappyAbsSyn)
forall i e. Ix i => (i, i) -> [(i, e)] -> Array i e
Happy_Data_Array.array (Int
8, Int
29) [
	(Int
8 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_8),
	(Int
9 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_9),
	(Int
10 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_10),
	(Int
11 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_11),
	(Int
12 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_12),
	(Int
13 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_13),
	(Int
14 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_14),
	(Int
15 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_15),
	(Int
16 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_16),
	(Int
17 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_17),
	(Int
18 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_18),
	(Int
19 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_19),
	(Int
20 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_20),
	(Int
21 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_21),
	(Int
22 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_22),
	(Int
23 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_23),
	(Int
24 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_24),
	(Int
25 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_25),
	(Int
26 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_26),
	(Int
27 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_27),
	(Int
28 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_28),
	(Int
29 , Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_29)
	]

happy_n_terms :: Int
happy_n_terms = Int
19 :: Prelude.Int
happy_n_nonterms :: Int
happy_n_nonterms = Int
9 :: Prelude.Int

happyReduce_8 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_8 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
0# HappyAbsSyn -> HappyAbsSyn
happyReduction_8
happyReduction_8 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_8 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, VarIdent) -> HappyAbsSyn
happyIn11
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), String -> VarIdent
Language.LambdaPi.Syntax.Abs.VarIdent (Token -> String
tokenText Token
happy_var_1))
	)}

happyReduce_9 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_9 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
1# HappyAbsSyn -> HappyAbsSyn
happyReduction_9
happyReduction_9 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_9 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap14
happyOut14 HappyAbsSyn
happy_x_1 of { (HappyWrap14 (BNFC'Position, [Command])
happy_var_1) -> 
	(BNFC'Position, Program) -> HappyAbsSyn
happyIn12
		 (((BNFC'Position, [Command]) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, [Command])
happy_var_1, BNFC'Position -> [Command] -> Program
forall a. a -> [Command' a] -> Program' a
Language.LambdaPi.Syntax.Abs.AProgram ((BNFC'Position, [Command]) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, [Command])
happy_var_1) ((BNFC'Position, [Command]) -> [Command]
forall a b. (a, b) -> b
snd (BNFC'Position, [Command])
happy_var_1))
	)}

happyReduce_10 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_10 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
2# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_10
happyReduction_10 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_10 (HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
happy_x_2 of { (HappyWrap16 (BNFC'Position, Term)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
happy_x_4 of { (HappyWrap16 (BNFC'Position, Term)
happy_var_4) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn13
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term -> Command
forall a. a -> Term' a -> Term' a -> Command' a
Language.LambdaPi.Syntax.Abs.CommandCheck ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_11 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_11 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
2# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_11
happyReduction_11 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_11 (HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
happy_x_2 of { (HappyWrap16 (BNFC'Position, Term)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
happy_x_4 of { (HappyWrap16 (BNFC'Position, Term)
happy_var_4) -> 
	(BNFC'Position, Command) -> HappyAbsSyn
happyIn13
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term -> Command
forall a. a -> Term' a -> Term' a -> Command' a
Language.LambdaPi.Syntax.Abs.CommandCompute ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_12 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_12 = Int#
-> HappyAbsSyn
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_0  Int#
3# HappyAbsSyn
happyReduction_12
happyReduction_12 :: HappyAbsSyn
happyReduction_12  =  (BNFC'Position, [Command]) -> HappyAbsSyn
happyIn14
		 ((BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'NoPosition, [])
	)

happyReduce_13 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_13 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
3# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_13
happyReduction_13 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_13 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap13
happyOut13 HappyAbsSyn
happy_x_1 of { (HappyWrap13 (BNFC'Position, Command)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap14
happyOut14 HappyAbsSyn
happy_x_3 of { (HappyWrap14 (BNFC'Position, [Command])
happy_var_3) -> 
	(BNFC'Position, [Command]) -> HappyAbsSyn
happyIn14
		 (((BNFC'Position, Command) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Command)
happy_var_1, (:) ((BNFC'Position, Command) -> Command
forall a b. (a, b) -> b
snd (BNFC'Position, Command)
happy_var_1) ((BNFC'Position, [Command]) -> [Command]
forall a b. (a, b) -> b
snd (BNFC'Position, [Command])
happy_var_3))
	)}}

happyReduce_14 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_14 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
4# HappyAbsSyn -> HappyAbsSyn
happyReduction_14
happyReduction_14 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_14 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap11
happyOut11 HappyAbsSyn
happy_x_1 of { (HappyWrap11 (BNFC'Position, VarIdent)
happy_var_1) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn15
		 (((BNFC'Position, VarIdent) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1, BNFC'Position -> VarIdent -> Term
forall a. a -> VarIdent -> Term' a
Language.LambdaPi.Syntax.Abs.Var ((BNFC'Position, VarIdent) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1) ((BNFC'Position, VarIdent) -> VarIdent
forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_1))
	)}

happyReduce_15 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_15 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
4# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_15
happyReduction_15 :: p -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_15 p
happy_x_3
	HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
happy_x_2 of { (HappyWrap16 (BNFC'Position, Term)
happy_var_2) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn15
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
	)}}

happyReduce_16 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_16 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
8# Int#
5# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_16
happyReduction_16 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_16 (HappyAbsSyn
happy_x_8 `HappyStk`
	HappyAbsSyn
happy_x_7 `HappyStk`
	HappyAbsSyn
happy_x_6 `HappyStk`
	HappyAbsSyn
happy_x_5 `HappyStk`
	HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap19
happyOut19 HappyAbsSyn
happy_x_3 of { (HappyWrap19 (BNFC'Position, Pattern)
happy_var_3) -> 
	case HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
happy_x_5 of { (HappyWrap16 (BNFC'Position, Term)
happy_var_5) -> 
	case HappyAbsSyn -> HappyWrap18
happyOut18 HappyAbsSyn
happy_x_8 of { (HappyWrap18 (BNFC'Position, ScopedTerm)
happy_var_8) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn16
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Pattern -> Term -> ScopedTerm -> Term
forall a. a -> Pattern' a -> Term' a -> ScopedTerm' a -> Term' a
Language.LambdaPi.Syntax.Abs.Pi ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_3) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_5) ((BNFC'Position, ScopedTerm) -> ScopedTerm
forall a b. (a, b) -> b
snd (BNFC'Position, ScopedTerm)
happy_var_8))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}}

happyReduce_17 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_17 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
5# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_17
happyReduction_17 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_17 (HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap19
happyOut19 HappyAbsSyn
happy_x_2 of { (HappyWrap19 (BNFC'Position, Pattern)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap18
happyOut18 HappyAbsSyn
happy_x_4 of { (HappyWrap18 (BNFC'Position, ScopedTerm)
happy_var_4) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn16
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Pattern -> ScopedTerm -> Term
forall a. a -> Pattern' a -> ScopedTerm' a -> Term' a
Language.LambdaPi.Syntax.Abs.Lam ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_2) ((BNFC'Position, ScopedTerm) -> ScopedTerm
forall a b. (a, b) -> b
snd (BNFC'Position, ScopedTerm)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_18 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_18 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_3  Int#
5# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
forall {p}. HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_18
happyReduction_18 :: HappyAbsSyn -> p -> HappyAbsSyn -> HappyAbsSyn
happyReduction_18 HappyAbsSyn
happy_x_3
	p
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap17
happyOut17 HappyAbsSyn
happy_x_1 of { (HappyWrap17 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap17
happyOut17 HappyAbsSyn
happy_x_3 of { (HappyWrap17 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn16
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.LambdaPi.Syntax.Abs.Product ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	)}}

happyReduce_19 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_19 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
5# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_19
happyReduction_19 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_19 (HappyAbsSyn
happy_x_5 `HappyStk`
	HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
happy_x_2 of { (HappyWrap16 (BNFC'Position, Term)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
happy_x_4 of { (HappyWrap16 (BNFC'Position, Term)
happy_var_4) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn16
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.LambdaPi.Syntax.Abs.Pair ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyReduce_20 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_20 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
5# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_20
happyReduction_20 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_20 (HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
happy_x_3 of { (HappyWrap16 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn16
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term
forall a. a -> Term' a -> Term' a
Language.LambdaPi.Syntax.Abs.First ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_21 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_21 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
4# Int#
5# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_21
happyReduction_21 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_21 (HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
happy_x_3 of { (HappyWrap16 (BNFC'Position, Term)
happy_var_3) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn16
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term -> Term
forall a. a -> Term' a -> Term' a
Language.LambdaPi.Syntax.Abs.Second ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_3))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}

happyReduce_22 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_22 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
5# HappyAbsSyn -> HappyAbsSyn
happyReduction_22
happyReduction_22 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_22 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn16
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Term
forall a. a -> Term' a
Language.LambdaPi.Syntax.Abs.Universe ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_23 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_23 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
5# HappyAbsSyn -> HappyAbsSyn
happyReduction_23
happyReduction_23 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_23 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap17
happyOut17 HappyAbsSyn
happy_x_1 of { (HappyWrap17 (BNFC'Position, Term)
happy_var_1) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn16
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
	)}

happyReduce_24 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_24 = Int#
-> (HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_2  Int#
6# HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_24
happyReduction_24 :: HappyAbsSyn -> HappyAbsSyn -> HappyAbsSyn
happyReduction_24 HappyAbsSyn
happy_x_2
	HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap17
happyOut17 HappyAbsSyn
happy_x_1 of { (HappyWrap17 (BNFC'Position, Term)
happy_var_1) -> 
	case HappyAbsSyn -> HappyWrap15
happyOut15 HappyAbsSyn
happy_x_2 of { (HappyWrap15 (BNFC'Position, Term)
happy_var_2) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn17
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> Term -> Term
forall a. a -> Term' a -> Term' a -> Term' a
Language.LambdaPi.Syntax.Abs.App ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_2))
	)}}

happyReduce_25 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_25 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
6# HappyAbsSyn -> HappyAbsSyn
happyReduction_25
happyReduction_25 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_25 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap15
happyOut15 HappyAbsSyn
happy_x_1 of { (HappyWrap15 (BNFC'Position, Term)
happy_var_1) -> 
	(BNFC'Position, Term) -> HappyAbsSyn
happyIn17
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
	)}

happyReduce_26 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_26 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
7# HappyAbsSyn -> HappyAbsSyn
happyReduction_26
happyReduction_26 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_26 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
happy_x_1 of { (HappyWrap16 (BNFC'Position, Term)
happy_var_1) -> 
	(BNFC'Position, ScopedTerm) -> HappyAbsSyn
happyIn18
		 (((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1, BNFC'Position -> Term -> ScopedTerm
forall a. a -> Term' a -> ScopedTerm' a
Language.LambdaPi.Syntax.Abs.AScopedTerm ((BNFC'Position, Term) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, Term)
happy_var_1) ((BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (BNFC'Position, Term)
happy_var_1))
	)}

happyReduce_27 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_27 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
8# HappyAbsSyn -> HappyAbsSyn
happyReduction_27
happyReduction_27 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_27 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	(BNFC'Position, Pattern) -> HappyAbsSyn
happyIn19
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Pattern
forall a. a -> Pattern' a
Language.LambdaPi.Syntax.Abs.PatternWildcard ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)))
	)}

happyReduce_28 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_28 = Int#
-> (HappyAbsSyn -> HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happySpecReduce_1  Int#
8# HappyAbsSyn -> HappyAbsSyn
happyReduction_28
happyReduction_28 :: HappyAbsSyn -> HappyAbsSyn
happyReduction_28 HappyAbsSyn
happy_x_1
	 =  case HappyAbsSyn -> HappyWrap11
happyOut11 HappyAbsSyn
happy_x_1 of { (HappyWrap11 (BNFC'Position, VarIdent)
happy_var_1) -> 
	(BNFC'Position, Pattern) -> HappyAbsSyn
happyIn19
		 (((BNFC'Position, VarIdent) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1, BNFC'Position -> VarIdent -> Pattern
forall a. a -> VarIdent -> Pattern' a
Language.LambdaPi.Syntax.Abs.PatternVar ((BNFC'Position, VarIdent) -> BNFC'Position
forall a b. (a, b) -> a
fst (BNFC'Position, VarIdent)
happy_var_1) ((BNFC'Position, VarIdent) -> VarIdent
forall a b. (a, b) -> b
snd (BNFC'Position, VarIdent)
happy_var_1))
	)}

happyReduce_29 :: Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce_29 = Int#
-> Int#
-> (HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn)
-> Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyReduce Int#
5# Int#
8# HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_29
happyReduction_29 :: HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
happyReduction_29 (HappyAbsSyn
happy_x_5 `HappyStk`
	HappyAbsSyn
happy_x_4 `HappyStk`
	HappyAbsSyn
happy_x_3 `HappyStk`
	HappyAbsSyn
happy_x_2 `HappyStk`
	HappyAbsSyn
happy_x_1 `HappyStk`
	HappyStk HappyAbsSyn
happyRest)
	 = case HappyAbsSyn -> Token
happyOutTok HappyAbsSyn
happy_x_1 of { Token
happy_var_1 -> 
	case HappyAbsSyn -> HappyWrap19
happyOut19 HappyAbsSyn
happy_x_2 of { (HappyWrap19 (BNFC'Position, Pattern)
happy_var_2) -> 
	case HappyAbsSyn -> HappyWrap19
happyOut19 HappyAbsSyn
happy_x_4 of { (HappyWrap19 (BNFC'Position, Pattern)
happy_var_4) -> 
	(BNFC'Position, Pattern) -> HappyAbsSyn
happyIn19
		 (((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1), BNFC'Position -> Pattern -> Pattern -> Pattern
forall a. a -> Pattern' a -> Pattern' a -> Pattern' a
Language.LambdaPi.Syntax.Abs.PatternPair ((Int -> Int -> BNFC'Position) -> (Int, Int) -> BNFC'Position
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry Int -> Int -> BNFC'Position
Language.LambdaPi.Syntax.Abs.BNFC'Position (Token -> (Int, Int)
tokenLineCol Token
happy_var_1)) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_2) ((BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (BNFC'Position, Pattern)
happy_var_4))
	) HappyAbsSyn -> HappyStk HappyAbsSyn -> HappyStk HappyAbsSyn
forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk HappyAbsSyn
happyRest}}}

happyNewToken :: Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyNewToken Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk [] =
	Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyDoAction Int#
18# Token
forall a. a
notHappyAtAll Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk []

happyNewToken Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk (Token
tk:[Token]
tks) =
	let cont :: Int# -> Err HappyAbsSyn
cont Int#
i = Int#
-> Token
-> Int#
-> Happy_IntList
-> HappyStk HappyAbsSyn
-> [Token]
-> Err HappyAbsSyn
happyDoAction Int#
i Token
tk Int#
action Happy_IntList
sts HappyStk HappyAbsSyn
stk [Token]
tks in
	case Token
tk of {
	PT Posn
_ (TS String
_ Int
1) -> Int# -> Err HappyAbsSyn
cont Int#
1#;
	PT Posn
_ (TS String
_ Int
2) -> Int# -> Err HappyAbsSyn
cont Int#
2#;
	PT Posn
_ (TS String
_ Int
3) -> Int# -> Err HappyAbsSyn
cont Int#
3#;
	PT Posn
_ (TS String
_ Int
4) -> Int# -> Err HappyAbsSyn
cont Int#
4#;
	PT Posn
_ (TS String
_ Int
5) -> Int# -> Err HappyAbsSyn
cont Int#
5#;
	PT Posn
_ (TS String
_ Int
6) -> Int# -> Err HappyAbsSyn
cont Int#
6#;
	PT Posn
_ (TS String
_ Int
7) -> Int# -> Err HappyAbsSyn
cont Int#
7#;
	PT Posn
_ (TS String
_ Int
8) -> Int# -> Err HappyAbsSyn
cont Int#
8#;
	PT Posn
_ (TS String
_ Int
9) -> Int# -> Err HappyAbsSyn
cont Int#
9#;
	PT Posn
_ (TS String
_ Int
10) -> Int# -> Err HappyAbsSyn
cont Int#
10#;
	PT Posn
_ (TS String
_ Int
11) -> Int# -> Err HappyAbsSyn
cont Int#
11#;
	PT Posn
_ (TS String
_ Int
12) -> Int# -> Err HappyAbsSyn
cont Int#
12#;
	PT Posn
_ (TS String
_ Int
13) -> Int# -> Err HappyAbsSyn
cont Int#
13#;
	PT Posn
_ (TS String
_ Int
14) -> Int# -> Err HappyAbsSyn
cont Int#
14#;
	PT Posn
_ (TS String
_ Int
15) -> Int# -> Err HappyAbsSyn
cont Int#
15#;
	PT Posn
_ (TS String
_ Int
16) -> Int# -> Err HappyAbsSyn
cont Int#
16#;
	PT Posn
_ (T_VarIdent String
_) -> Int# -> Err HappyAbsSyn
cont Int#
17#;
	Token
_ -> ([Token], [String]) -> Err HappyAbsSyn
forall a. ([Token], [String]) -> Err a
happyError' ((Token
tkToken -> [Token] -> [Token]
forall a. a -> [a] -> [a]
:[Token]
tks), [])
	}

happyError_ :: [String] -> Int# -> Token -> [Token] -> Err a
happyError_ [String]
explist Int#
18# Token
tk [Token]
tks = ([Token], [String]) -> Err a
forall a. ([Token], [String]) -> Err a
happyError' ([Token]
tks, [String]
explist)
happyError_ [String]
explist Int#
_ Token
tk [Token]
tks = ([Token], [String]) -> Err a
forall a. ([Token], [String]) -> Err a
happyError' ((Token
tkToken -> [Token] -> [Token]
forall a. a -> [a] -> [a]
:[Token]
tks), [String]
explist)

happyThen :: () => Err a -> (a -> Err b) -> Err b
happyThen :: forall a b. Err a -> (a -> Err b) -> Err b
happyThen = (Either String a -> (a -> Either String b) -> Either String b
forall a b. Err a -> (a -> Err b) -> Err b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
(>>=))
happyReturn :: () => a -> Err a
happyReturn :: forall a. a -> Err a
happyReturn = (a -> Either String a
forall a. a -> Err a
forall (m :: * -> *) a. Monad m => a -> m a
return)
happyThen1 :: m t -> (t -> t -> m b) -> t -> m b
happyThen1 m t
m t -> t -> m b
k t
tks = (forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
(>>=)) m t
m (\t
a -> t -> t -> m b
k t
a t
tks)
happyReturn1 :: () => a -> b -> Err a
happyReturn1 :: forall a b. a -> b -> Err a
happyReturn1 = \a
a b
tks -> (forall (m :: * -> *) a. Monad m => a -> m a
return) a
a
happyError' :: () => ([(Token)], [Prelude.String]) -> Err a
happyError' :: forall a. ([Token], [String]) -> Err a
happyError' = (\([Token]
tokens, [String]
_) -> [Token] -> Err a
forall a. [Token] -> Err a
happyError [Token]
tokens)
pProgram_internal :: [Token] -> Err (BNFC'Position, Program)
pProgram_internal [Token]
tks = Err (BNFC'Position, Program)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Program)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Program))
-> Err (BNFC'Position, Program)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
0# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Program) -> Err (BNFC'Position, Program)
forall a. a -> Err a
happyReturn (let {(HappyWrap12 (BNFC'Position, Program)
x') = HappyAbsSyn -> HappyWrap12
happyOut12 HappyAbsSyn
x} in (BNFC'Position, Program)
x'))

pCommand_internal :: [Token] -> Err (BNFC'Position, Command)
pCommand_internal [Token]
tks = Err (BNFC'Position, Command)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Command)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Command))
-> Err (BNFC'Position, Command)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
1# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Command) -> Err (BNFC'Position, Command)
forall a. a -> Err a
happyReturn (let {(HappyWrap13 (BNFC'Position, Command)
x') = HappyAbsSyn -> HappyWrap13
happyOut13 HappyAbsSyn
x} in (BNFC'Position, Command)
x'))

pListCommand_internal :: [Token] -> Err (BNFC'Position, [Command])
pListCommand_internal [Token]
tks = Err (BNFC'Position, [Command])
happySomeParser where
 happySomeParser :: Err (BNFC'Position, [Command])
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, [Command]))
-> Err (BNFC'Position, [Command])
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
2# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, [Command]) -> Err (BNFC'Position, [Command])
forall a. a -> Err a
happyReturn (let {(HappyWrap14 (BNFC'Position, [Command])
x') = HappyAbsSyn -> HappyWrap14
happyOut14 HappyAbsSyn
x} in (BNFC'Position, [Command])
x'))

pTerm2_internal :: [Token] -> Err (BNFC'Position, Term)
pTerm2_internal [Token]
tks = Err (BNFC'Position, Term)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Term)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Term))
-> Err (BNFC'Position, Term)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
3# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Term) -> Err (BNFC'Position, Term)
forall a. a -> Err a
happyReturn (let {(HappyWrap15 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap15
happyOut15 HappyAbsSyn
x} in (BNFC'Position, Term)
x'))

pTerm_internal :: [Token] -> Err (BNFC'Position, Term)
pTerm_internal [Token]
tks = Err (BNFC'Position, Term)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Term)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Term))
-> Err (BNFC'Position, Term)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
4# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Term) -> Err (BNFC'Position, Term)
forall a. a -> Err a
happyReturn (let {(HappyWrap16 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap16
happyOut16 HappyAbsSyn
x} in (BNFC'Position, Term)
x'))

pTerm1_internal :: [Token] -> Err (BNFC'Position, Term)
pTerm1_internal [Token]
tks = Err (BNFC'Position, Term)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Term)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Term))
-> Err (BNFC'Position, Term)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
5# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Term) -> Err (BNFC'Position, Term)
forall a. a -> Err a
happyReturn (let {(HappyWrap17 (BNFC'Position, Term)
x') = HappyAbsSyn -> HappyWrap17
happyOut17 HappyAbsSyn
x} in (BNFC'Position, Term)
x'))

pScopedTerm_internal :: [Token] -> Err (BNFC'Position, ScopedTerm)
pScopedTerm_internal [Token]
tks = Err (BNFC'Position, ScopedTerm)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, ScopedTerm)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, ScopedTerm))
-> Err (BNFC'Position, ScopedTerm)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
6# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, ScopedTerm) -> Err (BNFC'Position, ScopedTerm)
forall a. a -> Err a
happyReturn (let {(HappyWrap18 (BNFC'Position, ScopedTerm)
x') = HappyAbsSyn -> HappyWrap18
happyOut18 HappyAbsSyn
x} in (BNFC'Position, ScopedTerm)
x'))

pPattern_internal :: [Token] -> Err (BNFC'Position, Pattern)
pPattern_internal [Token]
tks = Err (BNFC'Position, Pattern)
happySomeParser where
 happySomeParser :: Err (BNFC'Position, Pattern)
happySomeParser = Err HappyAbsSyn
-> (HappyAbsSyn -> Err (BNFC'Position, Pattern))
-> Err (BNFC'Position, Pattern)
forall a b. Err a -> (a -> Err b) -> Err b
happyThen (Int# -> [Token] -> Err HappyAbsSyn
happyParse Int#
7# [Token]
tks) (\HappyAbsSyn
x -> (BNFC'Position, Pattern) -> Err (BNFC'Position, Pattern)
forall a. a -> Err a
happyReturn (let {(HappyWrap19 (BNFC'Position, Pattern)
x') = HappyAbsSyn -> HappyWrap19
happyOut19 HappyAbsSyn
x} in (BNFC'Position, Pattern)
x'))

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


type Err = Either String

happyError :: [Token] -> Err a
happyError :: forall a. [Token] -> Err a
happyError [Token]
ts = String -> Either String a
forall a b. a -> Either a b
Left (String -> Either String a) -> String -> Either String a
forall a b. (a -> b) -> a -> b
$
  String
"syntax error at " String -> String -> String
forall a. [a] -> [a] -> [a]
++ [Token] -> String
tokenPos [Token]
ts String -> String -> String
forall a. [a] -> [a] -> [a]
++
  case [Token]
ts of
    []      -> []
    [Err Posn
_] -> String
" due to lexer error"
    Token
t:[Token]
_     -> String
" before `" String -> String -> String
forall a. [a] -> [a] -> [a]
++ (Token -> String
prToken Token
t) String -> String -> String
forall a. [a] -> [a] -> [a]
++ String
"'"

myLexer :: String -> [Token]
myLexer :: String -> [Token]
myLexer = String -> [Token]
tokens

-- Entrypoints

pProgram :: [Token] -> Err Language.LambdaPi.Syntax.Abs.Program
pProgram :: [Token] -> Err Program
pProgram = ((BNFC'Position, Program) -> Program)
-> Err (BNFC'Position, Program) -> Err Program
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Program) -> Program
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Program) -> Err Program)
-> ([Token] -> Err (BNFC'Position, Program))
-> [Token]
-> Err Program
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Program)
pProgram_internal

pCommand :: [Token] -> Err Language.LambdaPi.Syntax.Abs.Command
pCommand :: [Token] -> Err Command
pCommand = ((BNFC'Position, Command) -> Command)
-> Err (BNFC'Position, Command) -> Err Command
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Command) -> Command
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Command) -> Err Command)
-> ([Token] -> Err (BNFC'Position, Command))
-> [Token]
-> Err Command
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Command)
pCommand_internal

pListCommand :: [Token] -> Err [Language.LambdaPi.Syntax.Abs.Command]
pListCommand :: [Token] -> Err [Command]
pListCommand = ((BNFC'Position, [Command]) -> [Command])
-> Err (BNFC'Position, [Command]) -> Err [Command]
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, [Command]) -> [Command]
forall a b. (a, b) -> b
snd (Err (BNFC'Position, [Command]) -> Err [Command])
-> ([Token] -> Err (BNFC'Position, [Command]))
-> [Token]
-> Err [Command]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, [Command])
pListCommand_internal

pTerm2 :: [Token] -> Err Language.LambdaPi.Syntax.Abs.Term
pTerm2 :: [Token] -> Err Term
pTerm2 = ((BNFC'Position, Term) -> Term)
-> Err (BNFC'Position, Term) -> Err Term
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Term) -> Err Term)
-> ([Token] -> Err (BNFC'Position, Term)) -> [Token] -> Err Term
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Term)
pTerm2_internal

pTerm :: [Token] -> Err Language.LambdaPi.Syntax.Abs.Term
pTerm :: [Token] -> Err Term
pTerm = ((BNFC'Position, Term) -> Term)
-> Err (BNFC'Position, Term) -> Err Term
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Term) -> Err Term)
-> ([Token] -> Err (BNFC'Position, Term)) -> [Token] -> Err Term
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Term)
pTerm_internal

pTerm1 :: [Token] -> Err Language.LambdaPi.Syntax.Abs.Term
pTerm1 :: [Token] -> Err Term
pTerm1 = ((BNFC'Position, Term) -> Term)
-> Err (BNFC'Position, Term) -> Err Term
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Term) -> Term
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Term) -> Err Term)
-> ([Token] -> Err (BNFC'Position, Term)) -> [Token] -> Err Term
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Term)
pTerm1_internal

pScopedTerm :: [Token] -> Err Language.LambdaPi.Syntax.Abs.ScopedTerm
pScopedTerm :: [Token] -> Err ScopedTerm
pScopedTerm = ((BNFC'Position, ScopedTerm) -> ScopedTerm)
-> Err (BNFC'Position, ScopedTerm) -> Err ScopedTerm
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, ScopedTerm) -> ScopedTerm
forall a b. (a, b) -> b
snd (Err (BNFC'Position, ScopedTerm) -> Err ScopedTerm)
-> ([Token] -> Err (BNFC'Position, ScopedTerm))
-> [Token]
-> Err ScopedTerm
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, ScopedTerm)
pScopedTerm_internal

pPattern :: [Token] -> Err Language.LambdaPi.Syntax.Abs.Pattern
pPattern :: [Token] -> Err Pattern
pPattern = ((BNFC'Position, Pattern) -> Pattern)
-> Err (BNFC'Position, Pattern) -> Err Pattern
forall a b. (a -> b) -> Either String a -> Either String b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (BNFC'Position, Pattern) -> Pattern
forall a b. (a, b) -> b
snd (Err (BNFC'Position, Pattern) -> Err Pattern)
-> ([Token] -> Err (BNFC'Position, Pattern))
-> [Token]
-> Err Pattern
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Token] -> Err (BNFC'Position, Pattern)
pPattern_internal
{-# LINE 1 "templates/GenericTemplate.hs" #-}
-- $Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp $













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



















data Happy_IntList = HappyCons Happy_GHC_Exts.Int# Happy_IntList








































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

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

happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll

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

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

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



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




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




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


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






data HappyAddr = HappyA# Happy_GHC_Exts.Addr#


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













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

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

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

-- happyReduce is specialised for the common cases.

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

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

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

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

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

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

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

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




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

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

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

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


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




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

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

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

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

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

-- Internal happy errors:

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

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


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


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

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

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


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

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

-- end of Happy Template.