#if __GLASGOW_HASKELL__ >= 710
#endif
module SourceParser where
import Lexer
import PureSyntax
import SugarSyntax
import Control.Monad.Except
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)
newtype HappyAbsSyn = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
happyIn7 :: (SuProgram) -> (HappyAbsSyn )
happyIn7 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut7 :: (HappyAbsSyn ) -> (SuProgram)
happyOut7 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn8 :: (Name) -> (HappyAbsSyn )
happyIn8 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut8 :: (HappyAbsSyn ) -> (Name)
happyOut8 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn9 :: (Expression) -> (HappyAbsSyn )
happyIn9 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut9 :: (HappyAbsSyn ) -> (Expression)
happyOut9 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn10 :: (ETree) -> (HappyAbsSyn )
happyIn10 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut10 :: (HappyAbsSyn ) -> (ETree)
happyOut10 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn11 :: ([Expression]) -> (HappyAbsSyn )
happyIn11 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut11 :: (HappyAbsSyn ) -> ([Expression])
happyOut11 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn12 :: ([Expression]) -> (HappyAbsSyn )
happyIn12 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut12 :: (HappyAbsSyn ) -> ([Expression])
happyOut12 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn13 :: (SuCommand) -> (HappyAbsSyn )
happyIn13 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut13 :: (HappyAbsSyn ) -> (SuCommand)
happyOut13 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn14 :: (SuBlock) -> (HappyAbsSyn )
happyIn14 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut14 :: (HappyAbsSyn ) -> (SuBlock)
happyOut14 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn15 :: (SuBlock) -> (HappyAbsSyn )
happyIn15 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut15 :: (HappyAbsSyn ) -> (SuBlock)
happyOut15 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn16 :: (([(Expression, SuBlock)], SuBlock)) -> (HappyAbsSyn )
happyIn16 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut16 :: (HappyAbsSyn ) -> (([(Expression, SuBlock)], SuBlock))
happyOut16 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn17 :: (ETree) -> (HappyAbsSyn )
happyIn17 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut17 :: (HappyAbsSyn ) -> (ETree)
happyOut17 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn18 :: (ETree) -> (HappyAbsSyn )
happyIn18 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut18 :: (HappyAbsSyn ) -> (ETree)
happyOut18 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn19 :: ([ETree]) -> (HappyAbsSyn )
happyIn19 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut19 :: (HappyAbsSyn ) -> ([ETree])
happyOut19 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn20 :: ([ETree]) -> (HappyAbsSyn )
happyIn20 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut20 :: (HappyAbsSyn ) -> ([ETree])
happyOut20 x = Happy_GHC_Exts.unsafeCoerce# x
happyInTok :: (Token) -> (HappyAbsSyn )
happyInTok x = Happy_GHC_Exts.unsafeCoerce# x
happyOutTok :: (HappyAbsSyn ) -> (Token)
happyOutTok x = Happy_GHC_Exts.unsafeCoerce# x
happyExpList :: HappyAddr
happyExpList = HappyA# "\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x40\x14\x3a\x80\xff\xff\x01\x00\x00\x00\x80\x11\x00\x00\x01\x00\x00\x50\x08\x00\xfe\xff\x05\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x38\x04\x00\xff\xff\x02\x00\x00\x50\x08\x00\xfe\xff\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x0a\x1d\xc0\xff\xff\x00\x00\x40\x14\x3a\x80\xff\xff\x01\x00\x80\x28\x74\x00\xff\xff\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x0a\x1d\xc0\xff\xff\x00\x00\x40\x1c\x3a\x80\xff\xff\x01\x00\x00\x20\x04\x00\xff\xff\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa2\xd0\x01\xfc\xff\x0f\x00\x00\x44\xa1\x03\xf8\xff\x1f\x00\x00\x88\x42\x07\xf0\xff\x3f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x44\xa9\x03\xf8\xff\x1f\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x32\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x80\x00\x00\x00\x00\x00\x00\x80\x28\x74\x00\xff\xff\x03\x00\x00\x04\x02\x00\x00\x00\x00\x00\x00\x08\x04\x00\x00\x00\x00\x00\x00\x10\x08\x00\x00\x00\x00\x00\x00\x88\x42\x07\xf0\xff\x3f\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x24\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x42\x00\xf0\xff\x2f\x00\x00\x00\x85\x00\xe0\xff\x5f\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x10\x02\x80\xff\xff\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x23\x00\x00\x02\x00\x00\x10\x00\x18\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x28\x74\x00\xff\xff\x03\x00\x00\x40\x08\x00\xfe\xff\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x19\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x28\x74\x00\xff\xff\x03\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x48\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x88\x42\x07\xf0\xff\x3f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\x04\x00\x40\x00\x00\x00\x00\xc0\x08\x00\x80\x00\x00\x00\x00\x01\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x01\x00\x10\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x18\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#
happyExpListPerState st =
token_strs_expected
where token_strs = ["error","%dummy","%start_parseProg","%start_parseExpr","%start_parseComm","%start_parseLVal","PROGRAM","VAR","EXPR","ATOM","EXPLIST","RESTEXPLIST","COMMAND","BLOCK","CMDS","SWITCHCONT","VAL","LVAL","LVALLIST","RESTLVALLIST","Dot","OpenBrc","ClosBrc","OpenCur","ClosCur","OpenSqu","ClosSqu","OpenAng","ClosAng","Comma","IsEq","Assign","Nil","SemiCo","Cons","Hd","Tl","While","Switch","Case","Default","Colon","If","Else","Read","Write","True","False","AtAsgn","AtDoAsgn","AtWhile","AtDoWhile","AtIf","AtDoIf","AtVar","AtQuote","AtHd","AtDoHd","AtTl","AtDoTl","AtCons","AtDoCons","Var","Int","%eof"]
bit_start = st * 65
bit_end = (st + 1) * 65
read_bit = readArrayBit happyExpList
bits = map read_bit [bit_start..bit_end 1]
bits_indexed = zip bits [0..64]
token_strs_expected = concatMap f bits_indexed
f (False, _) = []
f (True, nr) = [token_strs !! nr]
happyActOffsets :: HappyAddr
happyActOffsets = HappyA# "\xdd\xff\x55\x00\x2d\x00\xf7\x00\xdd\xff\xf1\xff\x00\x00\x00\x00\xe9\xff\x00\x00\xd2\x00\xf7\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0b\x00\x01\x00\x55\x00\x55\x00\x55\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x55\x00\xff\xff\x53\x01\x00\x00\x55\x00\x55\x00\x55\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x2a\x00\x2c\x00\x0e\x00\x00\x00\x08\x00\x55\x00\xe1\x00\x06\x01\x62\x01\x80\x00\x32\x00\x52\x00\x00\x00\x16\x00\x3e\x00\x00\x00\x00\x00\xf7\x00\xf7\x00\x4f\x00\x2e\x01\x00\x00\x1d\x01\xfd\xff\x51\x00\x5f\x00\x00\x00\x00\x00\x00\x00\xab\x00\x53\x01\x5f\x00\x65\x00\x0e\x00\x7f\x00\x00\x00\x00\x00\xab\x00\x6e\x00\x77\x00\x82\x00\x00\x00\x8c\x00\x90\x00\x52\x00\x7a\x00\x83\x00\x00\x00\x00\x00\xab\x00\x00\x00\x2d\x00\x2d\x00\xfe\xff\x00\x00\x00\x00\x00\x00\x2d\x00\xaa\x00\x00\x00\xa5\x00\x00\x00\x00\x00\xfd\xff\x00\x00\x00\x00"#
happyGotoOffsets :: HappyAddr
happyGotoOffsets = HappyA# "\x03\x00\x5d\x00\x3d\x00\x31\x00\xb1\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\x00\x8b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x88\x00\xb3\x00\xda\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xdf\x00\xff\x00\x88\x01\x00\x00\x04\x01\x23\x01\x27\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x36\x01\x00\x00\xba\x00\x00\x00\x00\x00\x3b\x01\xb9\x00\x00\x00\xe0\x00\x5b\x01\x00\x00\xb7\x00\x00\x00\xe5\x00\xe3\x00\x00\x00\x00\x00\xb6\x00\x85\x01\x00\x00\x2b\x01\x00\x00\x30\x00\xe2\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\x01\x89\x01\x00\x00\x00\x00\x07\x01\x08\x01\x00\x00\x00\x00\x7f\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xdb\x00\x00\x00\x0a\x01\x00\x00\x00\x00\x83\x01\x00\x00\x67\x00\x92\x00\x00\x00\x00\x00\x00\x00\x00\x00\xbd\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x29\x01\x00\x00\x00\x00"#
happyAdjustOffset :: Happy_GHC_Exts.Int# -> Happy_GHC_Exts.Int#
happyAdjustOffset off = off
happyDefActions :: HappyAddr
happyDefActions = HappyA# "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfa\xff\xc6\xff\x00\x00\xc7\xff\x00\x00\x00\x00\xcc\xff\xc9\xff\xc8\xff\xf1\xff\xf0\xff\xef\xff\xee\xff\xed\xff\xec\xff\xeb\xff\xea\xff\xe9\xff\xe8\xff\xe7\xff\xe6\xff\xe5\xff\xe4\xff\xca\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf8\xff\x00\x00\xcd\xff\xf3\xff\xf2\xff\x00\x00\x00\x00\x00\x00\xd2\xff\x00\x00\x00\x00\x00\x00\xcf\xff\xce\xff\xd0\xff\x00\x00\xf5\xff\xf6\xff\x00\x00\x00\x00\x00\x00\xe3\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc5\xff\x00\x00\x00\x00\xc4\xff\xc2\xff\x00\x00\x00\x00\xdf\xff\x00\x00\xdd\xff\x00\x00\x00\x00\xdb\xff\xf4\xff\xf7\xff\xe2\xff\xe0\xff\x00\x00\x00\x00\xf9\xff\x00\x00\x00\x00\x00\x00\xda\xff\xd4\xff\x00\x00\x00\x00\xd6\xff\x00\x00\xd9\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc3\xff\xcb\xff\x00\x00\xd8\xff\x00\x00\x00\x00\x00\x00\xdc\xff\xe1\xff\xd1\xff\x00\x00\x00\x00\xd7\xff\xde\xff\xfb\xff\xd3\xff\x00\x00\xd5\xff"#
happyCheck :: HappyAddr
happyCheck = HappyA# "\xff\xff\x02\x00\x05\x00\x00\x00\x01\x00\x06\x00\x07\x00\x08\x00\x2b\x00\x0b\x00\x19\x00\x03\x00\x0d\x00\x0b\x00\x0f\x00\x10\x00\x11\x00\x14\x00\x15\x00\x0b\x00\x16\x00\x07\x00\x2d\x00\x0c\x00\x0a\x00\x0b\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x02\x00\x01\x00\x2d\x00\x2d\x00\x06\x00\x01\x00\x08\x00\x01\x00\x03\x00\x0b\x00\x06\x00\x0d\x00\x08\x00\x0f\x00\x10\x00\x11\x00\x0b\x00\x0c\x00\x01\x00\x12\x00\x13\x00\x2b\x00\x04\x00\x06\x00\x17\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x02\x00\x2b\x00\x07\x00\x0b\x00\x06\x00\x0a\x00\x08\x00\x01\x00\x02\x00\x03\x00\x04\x00\x0d\x00\x03\x00\x0f\x00\x10\x00\x11\x00\x0a\x00\x01\x00\x18\x00\x0b\x00\x0b\x00\x0c\x00\x06\x00\x09\x00\x08\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x02\x00\x04\x00\x16\x00\x0e\x00\x06\x00\x05\x00\x08\x00\x01\x00\x02\x00\x03\x00\x04\x00\x0d\x00\x03\x00\x0f\x00\x10\x00\x11\x00\x0a\x00\x01\x00\x1a\x00\x09\x00\x0b\x00\x0c\x00\x06\x00\x09\x00\x08\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x02\x00\x2b\x00\x05\x00\x0b\x00\x06\x00\x01\x00\x08\x00\x01\x00\x02\x00\x03\x00\x04\x00\x0d\x00\x03\x00\x0f\x00\x10\x00\x11\x00\x0a\x00\x01\x00\x05\x00\x07\x00\x0b\x00\x0c\x00\x06\x00\x0d\x00\x08\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x06\x00\x07\x00\x08\x00\x01\x00\x02\x00\x03\x00\x04\x00\x0d\x00\x01\x00\x02\x00\x03\x00\x04\x00\x0a\x00\x04\x00\x01\x00\x07\x00\x0d\x00\x0a\x00\x07\x00\x09\x00\x0b\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x06\x00\x2c\x00\x08\x00\x01\x00\x02\x00\x03\x00\x04\x00\x0d\x00\x01\x00\x02\x00\x03\x00\x04\x00\x0a\x00\x04\x00\x01\x00\x05\x00\xff\xff\x0a\x00\x07\x00\xff\xff\x0b\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x05\x00\x2c\x00\x01\x00\x02\x00\x03\x00\x04\x00\x01\x00\x02\x00\x03\x00\x04\x00\x01\x00\x0a\x00\x03\x00\x12\x00\x13\x00\x0a\x00\x09\x00\xff\xff\x17\x00\x0a\x00\x08\x00\x01\x00\x02\x00\x03\x00\x04\x00\x0d\x00\x01\x00\x02\x00\x03\x00\x04\x00\x0a\x00\xff\xff\xff\xff\xff\xff\xff\xff\x0a\x00\xff\xff\xff\xff\x2b\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x08\x00\x01\x00\x02\x00\x03\x00\x04\x00\x0d\x00\x01\x00\x02\x00\x03\x00\x04\x00\x0a\x00\x04\x00\xff\xff\xff\xff\xff\xff\x0a\x00\xff\xff\xff\xff\x0b\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x2a\x00\xff\xff\x2c\x00\x01\x00\x02\x00\x03\x00\x04\x00\x01\x00\x02\x00\x03\x00\x04\x00\x03\x00\x0a\x00\xff\xff\x03\x00\x03\x00\x0a\x00\xff\xff\xff\xff\x0b\x00\x0c\x00\x0a\x00\x0a\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"#
happyTable :: HappyAddr
happyTable = HappyA# "\x00\x00\x29\x00\x5a\x00\x32\x00\x05\x00\x2a\x00\x39\x00\x2b\x00\x07\x00\x3b\x00\x43\x00\x50\x00\x2c\x00\x3b\x00\x2d\x00\x2e\x00\x2f\x00\x5b\x00\x5c\x00\x3b\x00\x6f\x00\x52\x00\xff\xff\x3f\x00\x53\x00\x3b\x00\x30\x00\x31\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x07\x00\x32\x00\x29\x00\x54\x00\xff\xff\xff\xff\x2a\x00\x1e\x00\x2b\x00\x48\x00\x07\x00\x3b\x00\x5c\x00\x2c\x00\x5d\x00\x2d\x00\x2e\x00\x2f\x00\x08\x00\x09\x00\x1e\x00\x21\x00\x22\x00\x07\x00\x4c\x00\x1f\x00\x23\x00\x30\x00\x31\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x07\x00\x32\x00\x29\x00\x07\x00\x46\x00\x3b\x00\x2a\x00\x47\x00\x2b\x00\x23\x00\x24\x00\x25\x00\x26\x00\x2c\x00\x07\x00\x2d\x00\x2e\x00\x2f\x00\x27\x00\x1e\x00\x58\x00\x3b\x00\x40\x00\x09\x00\x5c\x00\x6e\x00\x70\x00\x30\x00\x31\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x07\x00\x32\x00\x29\x00\x4c\x00\x6a\x00\x69\x00\x2a\x00\x68\x00\x4a\x00\x23\x00\x3d\x00\x25\x00\x26\x00\x2c\x00\x07\x00\x2d\x00\x2e\x00\x2f\x00\x27\x00\x1e\x00\x64\x00\x67\x00\x3f\x00\x09\x00\x5c\x00\x66\x00\x6f\x00\x30\x00\x31\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x07\x00\x32\x00\x29\x00\x07\x00\x74\x00\x3b\x00\x2a\x00\x05\x00\x2b\x00\x23\x00\x3c\x00\x25\x00\x26\x00\x2c\x00\x07\x00\x2d\x00\x2e\x00\x2f\x00\x27\x00\x1e\x00\x50\x00\x4d\x00\x61\x00\x09\x00\x5c\x00\x44\x00\x74\x00\x30\x00\x31\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x07\x00\x32\x00\x0b\x00\x42\x00\x0c\x00\x23\x00\x3b\x00\x25\x00\x26\x00\x0d\x00\x23\x00\x39\x00\x25\x00\x26\x00\x27\x00\x4c\x00\x43\x00\x4a\x00\x64\x00\x27\x00\x62\x00\x58\x00\x3b\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x0b\x00\x1e\x00\x0c\x00\x23\x00\x37\x00\x25\x00\x26\x00\x0d\x00\x23\x00\x35\x00\x25\x00\x26\x00\x27\x00\x4d\x00\x72\x00\x6c\x00\x00\x00\x27\x00\x6b\x00\x00\x00\x3b\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x5f\x00\x1e\x00\x23\x00\x34\x00\x25\x00\x26\x00\x23\x00\x33\x00\x25\x00\x26\x00\x5f\x00\x27\x00\x25\x00\x21\x00\x22\x00\x27\x00\x75\x00\x00\x00\x23\x00\x36\x00\x2b\x00\x23\x00\x54\x00\x25\x00\x26\x00\x2c\x00\x23\x00\x4e\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x27\x00\x00\x00\x00\x00\x07\x00\x30\x00\x31\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x07\x00\x32\x00\x2b\x00\x23\x00\x48\x00\x25\x00\x26\x00\x2c\x00\x23\x00\x56\x00\x25\x00\x26\x00\x27\x00\x4c\x00\x00\x00\x00\x00\x00\x00\x27\x00\x00\x00\x00\x00\x3b\x00\x30\x00\x31\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x00\x00\x32\x00\x23\x00\x6a\x00\x25\x00\x26\x00\x23\x00\x71\x00\x25\x00\x26\x00\x07\x00\x27\x00\x00\x00\x25\x00\x25\x00\x27\x00\x00\x00\x00\x00\x60\x00\x09\x00\x36\x00\x55\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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 (4, 61) [
(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)
]
happy_n_terms = 46 :: Int
happy_n_nonterms = 14 :: Int
happyReduce_4 = happyReduce 6# 0# happyReduction_4
happyReduction_4 (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 happyOut8 happy_x_1 of { happy_var_1 ->
case happyOut8 happy_x_3 of { happy_var_3 ->
case happyOut14 happy_x_4 of { happy_var_4 ->
case happyOut8 happy_x_6 of { happy_var_6 ->
happyIn7
(SuProgram happy_var_1 happy_var_3 happy_var_4 happy_var_6
) `HappyStk` happyRest}}}}
happyReduce_5 = happySpecReduce_1 1# happyReduction_5
happyReduction_5 happy_x_1
= case happyOutTok happy_x_1 of { happy_var_1 ->
happyIn8
(Name (tkPath happy_var_1, tkVarName happy_var_1)
)}
happyReduce_6 = happySpecReduce_3 2# happyReduction_6
happyReduction_6 happy_x_3
happy_x_2
happy_x_1
= case happyOut9 happy_x_2 of { happy_var_2 ->
case happyOut9 happy_x_3 of { happy_var_3 ->
happyIn9
(Cons happy_var_2 happy_var_3
)}}
happyReduce_7 = happySpecReduce_1 2# happyReduction_7
happyReduction_7 happy_x_1
= case happyOut8 happy_x_1 of { happy_var_1 ->
happyIn9
(Var happy_var_1
)}
happyReduce_8 = happySpecReduce_3 2# happyReduction_8
happyReduction_8 happy_x_3
happy_x_2
happy_x_1
= case happyOut9 happy_x_2 of { happy_var_2 ->
happyIn9
(happy_var_2
)}
happyReduce_9 = happySpecReduce_2 2# happyReduction_9
happyReduction_9 happy_x_2
happy_x_1
= case happyOut9 happy_x_2 of { happy_var_2 ->
happyIn9
(Hd happy_var_2
)}
happyReduce_10 = happySpecReduce_2 2# happyReduction_10
happyReduction_10 happy_x_2
happy_x_1
= case happyOut9 happy_x_2 of { happy_var_2 ->
happyIn9
(Tl happy_var_2
)}
happyReduce_11 = happySpecReduce_3 2# happyReduction_11
happyReduction_11 happy_x_3
happy_x_2
happy_x_1
= case happyOut9 happy_x_1 of { happy_var_1 ->
case happyOut9 happy_x_3 of { happy_var_3 ->
happyIn9
(IsEq happy_var_1 happy_var_3
)}}
happyReduce_12 = happySpecReduce_1 2# happyReduction_12
happyReduction_12 happy_x_1
= case happyOut11 happy_x_1 of { happy_var_1 ->
happyIn9
(expFromHaskellList happy_var_1
)}
happyReduce_13 = happySpecReduce_1 2# happyReduction_13
happyReduction_13 happy_x_1
= case happyOut17 happy_x_1 of { happy_var_1 ->
happyIn9
(Lit happy_var_1
)}
happyReduce_14 = happySpecReduce_1 3# happyReduction_14
happyReduction_14 happy_x_1
= happyIn10
(intToTree 2
)
happyReduce_15 = happySpecReduce_1 3# happyReduction_15
happyReduction_15 happy_x_1
= happyIn10
(intToTree 3
)
happyReduce_16 = happySpecReduce_1 3# happyReduction_16
happyReduction_16 happy_x_1
= happyIn10
(intToTree 5
)
happyReduce_17 = happySpecReduce_1 3# happyReduction_17
happyReduction_17 happy_x_1
= happyIn10
(intToTree 7
)
happyReduce_18 = happySpecReduce_1 3# happyReduction_18
happyReduction_18 happy_x_1
= happyIn10
(intToTree 11
)
happyReduce_19 = happySpecReduce_1 3# happyReduction_19
happyReduction_19 happy_x_1
= happyIn10
(intToTree 13
)
happyReduce_20 = happySpecReduce_1 3# happyReduction_20
happyReduction_20 happy_x_1
= happyIn10
(intToTree 17
)
happyReduce_21 = happySpecReduce_1 3# happyReduction_21
happyReduction_21 happy_x_1
= happyIn10
(intToTree 19
)
happyReduce_22 = happySpecReduce_1 3# happyReduction_22
happyReduction_22 happy_x_1
= happyIn10
(intToTree 23
)
happyReduce_23 = happySpecReduce_1 3# happyReduction_23
happyReduction_23 happy_x_1
= happyIn10
(intToTree 29
)
happyReduce_24 = happySpecReduce_1 3# happyReduction_24
happyReduction_24 happy_x_1
= happyIn10
(intToTree 31
)
happyReduce_25 = happySpecReduce_1 3# happyReduction_25
happyReduction_25 happy_x_1
= happyIn10
(intToTree 37
)
happyReduce_26 = happySpecReduce_1 3# happyReduction_26
happyReduction_26 happy_x_1
= happyIn10
(intToTree 41
)
happyReduce_27 = happySpecReduce_1 3# happyReduction_27
happyReduction_27 happy_x_1
= happyIn10
(intToTree 43
)
happyReduce_28 = happySpecReduce_2 4# happyReduction_28
happyReduction_28 happy_x_2
happy_x_1
= happyIn11
([]
)
happyReduce_29 = happySpecReduce_3 4# happyReduction_29
happyReduction_29 happy_x_3
happy_x_2
happy_x_1
= case happyOut9 happy_x_2 of { happy_var_2 ->
case happyOut12 happy_x_3 of { happy_var_3 ->
happyIn11
(happy_var_2 : happy_var_3
)}}
happyReduce_30 = happySpecReduce_3 5# happyReduction_30
happyReduction_30 happy_x_3
happy_x_2
happy_x_1
= case happyOut9 happy_x_2 of { happy_var_2 ->
case happyOut12 happy_x_3 of { happy_var_3 ->
happyIn12
(happy_var_2 : happy_var_3
)}}
happyReduce_31 = happySpecReduce_1 5# happyReduction_31
happyReduction_31 happy_x_1
= happyIn12
([]
)
happyReduce_32 = happySpecReduce_3 6# happyReduction_32
happyReduction_32 happy_x_3
happy_x_2
happy_x_1
= case happyOut8 happy_x_1 of { happy_var_1 ->
case happyOutTok happy_x_2 of { happy_var_2 ->
case happyOut9 happy_x_3 of { happy_var_3 ->
happyIn13
(SuAssign (Info (tkPath happy_var_2, tkLineNo happy_var_2)) happy_var_1 happy_var_3
)}}}
happyReduce_33 = happyReduce 6# 6# happyReduction_33
happyReduction_33 (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 happyOut8 happy_x_1 of { happy_var_1 ->
case happyOutTok happy_x_2 of { happy_var_2 ->
case happyOut8 happy_x_4 of { happy_var_4 ->
case happyOut9 happy_x_6 of { happy_var_6 ->
happyIn13
(Macro (Info (tkPath happy_var_2, tkLineNo happy_var_2)) happy_var_1 (nameName happy_var_4) happy_var_6
) `HappyStk` happyRest}}}}
happyReduce_34 = happySpecReduce_3 6# happyReduction_34
happyReduction_34 happy_x_3
happy_x_2
happy_x_1
= case happyOutTok happy_x_1 of { happy_var_1 ->
case happyOut9 happy_x_2 of { happy_var_2 ->
case happyOut14 happy_x_3 of { happy_var_3 ->
happyIn13
(SuWhile (Info (tkPath happy_var_1, tkLineNo happy_var_1)) happy_var_2 happy_var_3
)}}}
happyReduce_35 = happyReduce 5# 6# happyReduction_35
happyReduction_35 (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 { happy_var_1 ->
case happyOut9 happy_x_2 of { happy_var_2 ->
case happyOut14 happy_x_3 of { happy_var_3 ->
case happyOut14 happy_x_5 of { happy_var_5 ->
happyIn13
(SuIfElse (Info (tkPath happy_var_1, tkLineNo happy_var_1)) happy_var_2 happy_var_3 happy_var_5
) `HappyStk` happyRest}}}}
happyReduce_36 = happySpecReduce_3 6# happyReduction_36
happyReduction_36 happy_x_3
happy_x_2
happy_x_1
= case happyOutTok happy_x_1 of { happy_var_1 ->
case happyOut9 happy_x_2 of { happy_var_2 ->
case happyOut14 happy_x_3 of { happy_var_3 ->
happyIn13
(SuIfElse (Info (tkPath happy_var_1, tkLineNo happy_var_1)) happy_var_2 happy_var_3 []
)}}}
happyReduce_37 = happyReduce 4# 6# happyReduction_37
happyReduction_37 (happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOutTok happy_x_1 of { happy_var_1 ->
case happyOut9 happy_x_2 of { happy_var_2 ->
case happyOut16 happy_x_4 of { happy_var_4 ->
happyIn13
(Switch (Info (tkPath happy_var_1, tkLineNo happy_var_1)) happy_var_2 (fst happy_var_4) (snd happy_var_4)
) `HappyStk` happyRest}}}
happyReduce_38 = happySpecReduce_2 7# happyReduction_38
happyReduction_38 happy_x_2
happy_x_1
= happyIn14
([]
)
happyReduce_39 = happySpecReduce_3 7# happyReduction_39
happyReduction_39 happy_x_3
happy_x_2
happy_x_1
= case happyOut15 happy_x_2 of { happy_var_2 ->
happyIn14
(happy_var_2
)}
happyReduce_40 = happySpecReduce_3 8# happyReduction_40
happyReduction_40 happy_x_3
happy_x_2
happy_x_1
= case happyOut13 happy_x_1 of { happy_var_1 ->
case happyOut15 happy_x_3 of { happy_var_3 ->
happyIn15
(happy_var_1 : happy_var_3
)}}
happyReduce_41 = happySpecReduce_1 8# happyReduction_41
happyReduction_41 happy_x_1
= case happyOut13 happy_x_1 of { happy_var_1 ->
happyIn15
([happy_var_1]
)}
happyReduce_42 = happyReduce 5# 9# happyReduction_42
happyReduction_42 (happy_x_5 `HappyStk`
happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOut9 happy_x_2 of { happy_var_2 ->
case happyOut15 happy_x_4 of { happy_var_4 ->
case happyOut16 happy_x_5 of { happy_var_5 ->
happyIn16
(((happy_var_2, happy_var_4) : fst happy_var_5, snd happy_var_5)
) `HappyStk` happyRest}}}
happyReduce_43 = happySpecReduce_1 9# happyReduction_43
happyReduction_43 happy_x_1
= happyIn16
(([] , [] )
)
happyReduce_44 = happyReduce 4# 9# happyReduction_44
happyReduction_44 (happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOut15 happy_x_3 of { happy_var_3 ->
happyIn16
(([] , happy_var_3 )
) `HappyStk` happyRest}
happyReduce_45 = happySpecReduce_1 10# happyReduction_45
happyReduction_45 happy_x_1
= happyIn17
(ENil
)
happyReduce_46 = happyReduce 5# 10# happyReduction_46
happyReduction_46 (happy_x_5 `HappyStk`
happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOut17 happy_x_2 of { happy_var_2 ->
case happyOut17 happy_x_4 of { happy_var_4 ->
happyIn17
(ECons happy_var_2 happy_var_4
) `HappyStk` happyRest}}
happyReduce_47 = happySpecReduce_1 10# happyReduction_47
happyReduction_47 happy_x_1
= case happyOutTok happy_x_1 of { (Token ( _, ITkInt happy_var_1 , _ )) ->
happyIn17
(intToTree happy_var_1
)}
happyReduce_48 = happySpecReduce_1 10# happyReduction_48
happyReduction_48 happy_x_1
= happyIn17
(intToTree 1
)
happyReduce_49 = happySpecReduce_1 10# happyReduction_49
happyReduction_49 happy_x_1
= happyIn17
(intToTree 0
)
happyReduce_50 = happySpecReduce_1 10# happyReduction_50
happyReduction_50 happy_x_1
= case happyOut10 happy_x_1 of { happy_var_1 ->
happyIn17
(happy_var_1
)}
happyReduce_51 = happySpecReduce_1 11# happyReduction_51
happyReduction_51 happy_x_1
= happyIn18
(ENil
)
happyReduce_52 = happyReduce 5# 11# happyReduction_52
happyReduction_52 (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_2 of { happy_var_2 ->
case happyOut18 happy_x_4 of { happy_var_4 ->
happyIn18
(ECons happy_var_2 happy_var_4
) `HappyStk` happyRest}}
happyReduce_53 = happySpecReduce_1 11# happyReduction_53
happyReduction_53 happy_x_1
= case happyOutTok happy_x_1 of { (Token ( _, ITkInt happy_var_1 , _ )) ->
happyIn18
(intToTree happy_var_1
)}
happyReduce_54 = happySpecReduce_1 11# happyReduction_54
happyReduction_54 happy_x_1
= happyIn18
(intToTree 1
)
happyReduce_55 = happySpecReduce_1 11# happyReduction_55
happyReduction_55 happy_x_1
= happyIn18
(intToTree 0
)
happyReduce_56 = happySpecReduce_1 11# happyReduction_56
happyReduction_56 happy_x_1
= case happyOut19 happy_x_1 of { happy_var_1 ->
happyIn18
(treeFromHaskellList happy_var_1
)}
happyReduce_57 = happySpecReduce_1 11# happyReduction_57
happyReduction_57 happy_x_1
= case happyOut10 happy_x_1 of { happy_var_1 ->
happyIn18
(happy_var_1
)}
happyReduce_58 = happySpecReduce_2 12# happyReduction_58
happyReduction_58 happy_x_2
happy_x_1
= happyIn19
([]
)
happyReduce_59 = happySpecReduce_3 12# happyReduction_59
happyReduction_59 happy_x_3
happy_x_2
happy_x_1
= case happyOut18 happy_x_2 of { happy_var_2 ->
case happyOut20 happy_x_3 of { happy_var_3 ->
happyIn19
(happy_var_2 : happy_var_3
)}}
happyReduce_60 = happySpecReduce_3 13# happyReduction_60
happyReduction_60 happy_x_3
happy_x_2
happy_x_1
= case happyOut18 happy_x_2 of { happy_var_2 ->
case happyOut20 happy_x_3 of { happy_var_3 ->
happyIn20
(happy_var_2 : happy_var_3
)}}
happyReduce_61 = happySpecReduce_1 13# happyReduction_61
happyReduction_61 happy_x_1
= happyIn20
([]
)
happyNewToken action sts stk [] =
happyDoAction 45# notHappyAtAll action sts stk []
happyNewToken action sts stk (tk:tks) =
let cont i = happyDoAction i tk action sts stk tks in
case tk of {
Token ( _, TkDot , _ ) -> cont 1#;
Token ( _, TkOpenBrc , _ ) -> cont 2#;
Token ( _, TkClosBrc , _ ) -> cont 3#;
Token ( _, TkOpenCur , _ ) -> cont 4#;
Token ( _, TkClosCur , _ ) -> cont 5#;
Token ( _, TkOpenSqu , _ ) -> cont 6#;
Token ( _, TkClosSqu , _ ) -> cont 7#;
Token ( _, TkOpenAng , _ ) -> cont 8#;
Token ( _, TkClosAng , _ ) -> cont 9#;
Token ( _, TkComma , _ ) -> cont 10#;
Token ( _, TkIsEq , _ ) -> cont 11#;
Token ( _, TkAssign , _ ) -> cont 12#;
Token ( _, TkNil , _ ) -> cont 13#;
Token ( _, TkSemiCo , _ ) -> cont 14#;
Token ( _, TkCons , _ ) -> cont 15#;
Token ( _, TkHd , _ ) -> cont 16#;
Token ( _, TkTl , _ ) -> cont 17#;
Token ( _, TkWhile , _ ) -> cont 18#;
Token ( _, TkSwitch , _ ) -> cont 19#;
Token ( _, TkCase , _ ) -> cont 20#;
Token ( _, TkDefault , _ ) -> cont 21#;
Token ( _, TkColon , _ ) -> cont 22#;
Token ( _, TkIf , _ ) -> cont 23#;
Token ( _, TkElse , _ ) -> cont 24#;
Token ( _, TkRead , _ ) -> cont 25#;
Token ( _, TkWrite , _ ) -> cont 26#;
Token ( _, TkTrue , _ ) -> cont 27#;
Token ( _, TkFalse , _ ) -> cont 28#;
Token ( _, TkAtomAsgn , _ ) -> cont 29#;
Token ( _, TkAtomDoAsgn , _ ) -> cont 30#;
Token ( _, TkAtomWhile , _ ) -> cont 31#;
Token ( _, TkAtomDoWhile , _ ) -> cont 32#;
Token ( _, TkAtomIf , _ ) -> cont 33#;
Token ( _, TkAtomDoIf , _ ) -> cont 34#;
Token ( _, TkAtomVar , _ ) -> cont 35#;
Token ( _, TkAtomQuote , _ ) -> cont 36#;
Token ( _, TkAtomHd , _ ) -> cont 37#;
Token ( _, TkAtomDoHd , _ ) -> cont 38#;
Token ( _, TkAtomTl , _ ) -> cont 39#;
Token ( _, TkAtomDoTl , _ ) -> cont 40#;
Token ( _, TkAtomCons , _ ) -> cont 41#;
Token ( _, TkAtomDoCons , _ ) -> cont 42#;
Token ( _, ITkVar _ , _ ) -> cont 43#;
Token ( _, ITkInt happy_dollar_dollar , _ ) -> cont 44#;
_ -> happyError' ((tk:tks), [])
}
happyError_ explist 45# tk tks = happyError' (tks, explist)
happyError_ explist _ tk tks = happyError' ((tk:tks), explist)
happyThen :: () => ExceptT String IO a -> (a -> ExceptT String IO b) -> ExceptT String IO b
happyThen = (>>=)
happyReturn :: () => a -> ExceptT String IO a
happyReturn = (return)
happyThen1 m k tks = (>>=) m (\a -> k a tks)
happyReturn1 :: () => a -> b -> ExceptT String IO a
happyReturn1 = \a tks -> (return) a
happyError' :: () => ([(Token)], [String]) -> ExceptT String IO a
happyError' = (\(tokens, _) -> parseError tokens)
parseProg tks = happySomeParser where
happySomeParser = happyThen (happyParse 0# tks) (\x -> happyReturn (happyOut7 x))
parseExpr tks = happySomeParser where
happySomeParser = happyThen (happyParse 1# tks) (\x -> happyReturn (happyOut9 x))
parseComm tks = happySomeParser where
happySomeParser = happyThen (happyParse 2# tks) (\x -> happyReturn (happyOut13 x))
parseLVal tks = happySomeParser where
happySomeParser = happyThen (happyParse 3# tks) (\x -> happyReturn (happyOut18 x))
happySeq = happyDontSeq
parseError :: [Token] -> ExceptT String IO a
parseError [] = throwError "Parse error: reached end of file while parsing"
parseError (tok : rest) = throwError $ concat
[ "Parse error: "
, (prettyPrintToken tok)
, " in program/macro '"
, tkPath tok
, "', at line "
, (show (tkLineNo tok))
, ", char "
, (show (tkCharNo tok))
]
# 1 "/usr/include/stdc-predef.h" 1 3 4
# 17 "/usr/include/stdc-predef.h" 3 4
#if __GLASGOW_HASKELL__ > 706
#define LT(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.<# m)) :: Bool)
#define GTE(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.>=# m)) :: Bool)
#define EQ(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.==# m)) :: 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)
happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll
happyAccept 0# tk st sts (_ `HappyStk` ans `HappyStk` _) =
happyReturn1 ans
happyAccept j tk st sts (HappyStk ans _) =
(happyTcHack j (happyTcHack st)) (happyReturn1 ans)
happyDoAction i tk st
=
case action of
0# ->
happyFail (happyExpListPerState ((Happy_GHC_Exts.I# (st)) :: Int)) i tk st
1# ->
happyAccept i tk st
n | LT(n,(0# :: Happy_GHC_Exts.Int#)) ->
(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 ->
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 False
action
| check = indexShortOffAddr happyTable off_i
| 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#
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 `mod` 16)
where unbox_int (Happy_GHC_Exts.I# x) = x
data HappyAddr = HappyA# Happy_GHC_Exts.Addr#
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
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)
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
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
happyGoto nt j tk st =
happyDoAction j tk new_state
where off = happyAdjustOffset (indexShortOffAddr happyGotoOffsets st)
off_i = (off Happy_GHC_Exts.+# nt)
new_state = indexShortOffAddr happyTable off_i
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
happyError_ explist i tk
happyFail explist i tk (action) sts stk =
happyDoAction 0# tk action sts ( (Happy_GHC_Exts.unsafeCoerce# (Happy_GHC_Exts.I# (i))) `HappyStk` stk)
notHappyAtAll :: a
notHappyAtAll = error "Internal Happy error\n"
happyTcHack :: Happy_GHC_Exts.Int# -> a -> a
happyTcHack x y = y
happyDoSeq, happyDontSeq :: a -> b -> b
happyDoSeq a b = a `seq` b
happyDontSeq a b = b