module Parser where import Syntax import Lexer -- parser produced by Happy Version 1.15 data HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12 t13 t14 = HappyTerminal Token | HappyErrorToken Int | HappyAbsSyn4 t4 | HappyAbsSyn5 t5 | HappyAbsSyn6 t6 | HappyAbsSyn7 t7 | HappyAbsSyn8 t8 | HappyAbsSyn9 t9 | HappyAbsSyn10 t10 | HappyAbsSyn11 t11 | HappyAbsSyn12 t12 | HappyAbsSyn13 t13 | HappyAbsSyn14 t14 action_0 (17) = happyShift action_4 action_0 (4) = happyGoto action_5 action_0 (5) = happyGoto action_2 action_0 (6) = happyGoto action_3 action_0 _ = happyReduce_2 action_1 (17) = happyShift action_4 action_1 (5) = happyGoto action_2 action_1 (6) = happyGoto action_3 action_1 _ = happyFail action_2 _ = happyReduce_1 action_3 (17) = happyShift action_4 action_3 (5) = happyGoto action_7 action_3 (6) = happyGoto action_3 action_3 _ = happyReduce_2 action_4 (15) = happyShift action_6 action_4 _ = happyFail action_5 (28) = happyAccept action_5 _ = happyFail action_6 (15) = happyShift action_9 action_6 (7) = happyGoto action_8 action_6 _ = happyReduce_5 action_7 _ = happyReduce_3 action_8 (26) = happyShift action_11 action_8 _ = happyFail action_9 (15) = happyShift action_9 action_9 (7) = happyGoto action_10 action_9 _ = happyReduce_5 action_10 _ = happyReduce_6 action_11 (15) = happyShift action_14 action_11 (8) = happyGoto action_12 action_11 (9) = happyGoto action_13 action_11 _ = happyFail action_12 (18) = happyShift action_19 action_12 (14) = happyGoto action_18 action_12 _ = happyReduce_20 action_13 (19) = happyShift action_17 action_13 _ = happyReduce_8 action_14 (20) = happyShift action_16 action_14 (10) = happyGoto action_15 action_14 _ = happyReduce_10 action_15 _ = happyReduce_9 action_16 (15) = happyShift action_23 action_16 (11) = happyGoto action_22 action_16 _ = happyFail action_17 (15) = happyShift action_14 action_17 (8) = happyGoto action_21 action_17 (9) = happyGoto action_13 action_17 _ = happyFail action_18 _ = happyReduce_4 action_19 (15) = happyShift action_20 action_19 _ = happyFail action_20 (15) = happyShift action_26 action_20 _ = happyFail action_21 _ = happyReduce_7 action_22 (21) = happyShift action_25 action_22 _ = happyFail action_23 (16) = happyShift action_24 action_23 _ = happyFail action_24 (15) = happyShift action_30 action_24 (22) = happyShift action_31 action_24 (24) = happyShift action_32 action_24 (12) = happyGoto action_28 action_24 (13) = happyGoto action_29 action_24 _ = happyFail action_25 _ = happyReduce_11 action_26 (18) = happyShift action_19 action_26 (14) = happyGoto action_27 action_26 _ = happyReduce_20 action_27 _ = happyReduce_19 action_28 (15) = happyShift action_30 action_28 (22) = happyShift action_31 action_28 (24) = happyShift action_32 action_28 (27) = happyShift action_36 action_28 (13) = happyGoto action_35 action_28 _ = happyReduce_13 action_29 _ = happyReduce_15 action_30 _ = happyReduce_16 action_31 (15) = happyShift action_30 action_31 (22) = happyShift action_31 action_31 (24) = happyShift action_32 action_31 (12) = happyGoto action_34 action_31 (13) = happyGoto action_29 action_31 _ = happyFail action_32 (15) = happyShift action_30 action_32 (22) = happyShift action_31 action_32 (24) = happyShift action_32 action_32 (12) = happyGoto action_33 action_32 (13) = happyGoto action_29 action_32 _ = happyFail action_33 (15) = happyShift action_30 action_33 (22) = happyShift action_31 action_33 (24) = happyShift action_32 action_33 (25) = happyShift action_39 action_33 (13) = happyGoto action_35 action_33 _ = happyFail action_34 (15) = happyShift action_30 action_34 (22) = happyShift action_31 action_34 (23) = happyShift action_38 action_34 (24) = happyShift action_32 action_34 (13) = happyGoto action_35 action_34 _ = happyFail action_35 _ = happyReduce_14 action_36 (15) = happyShift action_23 action_36 (11) = happyGoto action_37 action_36 _ = happyFail action_37 _ = happyReduce_12 action_38 _ = happyReduce_17 action_39 _ = happyReduce_18 happyReduce_1 = happySpecReduce_1 4 happyReduction_1 happyReduction_1 (HappyAbsSyn5 happy_var_1) = HappyAbsSyn4 (happy_var_1 ) happyReduction_1 _ = notHappyAtAll happyReduce_2 = happySpecReduce_0 5 happyReduction_2 happyReduction_2 = HappyAbsSyn5 ([] ) happyReduce_3 = happySpecReduce_2 5 happyReduction_3 happyReduction_3 (HappyAbsSyn5 happy_var_2) (HappyAbsSyn6 happy_var_1) = HappyAbsSyn5 (happy_var_1 : happy_var_2 ) happyReduction_3 _ _ = notHappyAtAll happyReduce_4 = happyReduce 6 6 happyReduction_4 happyReduction_4 ((HappyAbsSyn14 happy_var_6) `HappyStk` (HappyAbsSyn8 happy_var_5) `HappyStk` _ `HappyStk` (HappyAbsSyn7 happy_var_3) `HappyStk` (HappyTerminal (TkId happy_var_2)) `HappyStk` _ `HappyStk` happyRest) = HappyAbsSyn6 (Data happy_var_2 happy_var_3 happy_var_5 happy_var_6 ) `HappyStk` happyRest happyReduce_5 = happySpecReduce_0 7 happyReduction_5 happyReduction_5 = HappyAbsSyn7 ([] ) happyReduce_6 = happySpecReduce_2 7 happyReduction_6 happyReduction_6 (HappyAbsSyn7 happy_var_2) (HappyTerminal (TkId happy_var_1)) = HappyAbsSyn7 (happy_var_1 : happy_var_2 ) happyReduction_6 _ _ = notHappyAtAll happyReduce_7 = happySpecReduce_3 8 happyReduction_7 happyReduction_7 (HappyAbsSyn8 happy_var_3) _ (HappyAbsSyn9 happy_var_1) = HappyAbsSyn8 (happy_var_1 : happy_var_3 ) happyReduction_7 _ _ _ = notHappyAtAll happyReduce_8 = happySpecReduce_1 8 happyReduction_8 happyReduction_8 (HappyAbsSyn9 happy_var_1) = HappyAbsSyn8 ([happy_var_1] ) happyReduction_8 _ = notHappyAtAll happyReduce_9 = happySpecReduce_2 9 happyReduction_9 happyReduction_9 (HappyAbsSyn10 happy_var_2) (HappyTerminal (TkId happy_var_1)) = HappyAbsSyn9 (Constructor happy_var_1 happy_var_2 ) happyReduction_9 _ _ = notHappyAtAll happyReduce_10 = happySpecReduce_1 9 happyReduction_10 happyReduction_10 (HappyTerminal (TkId happy_var_1)) = HappyAbsSyn9 (Constructor happy_var_1 [] ) happyReduction_10 _ = notHappyAtAll happyReduce_11 = happySpecReduce_3 10 happyReduction_11 happyReduction_11 _ (HappyAbsSyn11 happy_var_2) _ = HappyAbsSyn10 (happy_var_2 ) happyReduction_11 _ _ _ = notHappyAtAll happyReduce_12 = happyReduce 5 11 happyReduction_12 happyReduction_12 ((HappyAbsSyn11 happy_var_5) `HappyStk` _ `HappyStk` (HappyAbsSyn12 happy_var_3) `HappyStk` _ `HappyStk` (HappyTerminal (TkId happy_var_1)) `HappyStk` happyRest) = HappyAbsSyn11 (Field happy_var_1 happy_var_3 : happy_var_5 ) `HappyStk` happyRest happyReduce_13 = happySpecReduce_3 11 happyReduction_13 happyReduction_13 (HappyAbsSyn12 happy_var_3) _ (HappyTerminal (TkId happy_var_1)) = HappyAbsSyn11 ([Field happy_var_1 happy_var_3] ) happyReduction_13 _ _ _ = notHappyAtAll happyReduce_14 = happySpecReduce_2 12 happyReduction_14 happyReduction_14 (HappyAbsSyn13 happy_var_2) (HappyAbsSyn12 happy_var_1) = HappyAbsSyn12 (App happy_var_1 happy_var_2 ) happyReduction_14 _ _ = notHappyAtAll happyReduce_15 = happySpecReduce_1 12 happyReduction_15 happyReduction_15 (HappyAbsSyn13 happy_var_1) = HappyAbsSyn12 (happy_var_1 ) happyReduction_15 _ = notHappyAtAll happyReduce_16 = happySpecReduce_1 13 happyReduction_16 happyReduction_16 (HappyTerminal (TkId happy_var_1)) = HappyAbsSyn13 (Name happy_var_1 ) happyReduction_16 _ = notHappyAtAll happyReduce_17 = happySpecReduce_3 13 happyReduction_17 happyReduction_17 _ (HappyAbsSyn12 happy_var_2) _ = HappyAbsSyn13 (List happy_var_2 ) happyReduction_17 _ _ _ = notHappyAtAll happyReduce_18 = happySpecReduce_3 13 happyReduction_18 happyReduction_18 _ (HappyAbsSyn12 happy_var_2) _ = HappyAbsSyn13 (happy_var_2 ) happyReduction_18 _ _ _ = notHappyAtAll happyReduce_19 = happyReduce 4 14 happyReduction_19 happyReduction_19 ((HappyAbsSyn14 happy_var_4) `HappyStk` (HappyTerminal (TkId happy_var_3)) `HappyStk` (HappyTerminal (TkId happy_var_2)) `HappyStk` _ `HappyStk` happyRest) = HappyAbsSyn14 (Visitor happy_var_3 (TypeId happy_var_2) : happy_var_4 ) `HappyStk` happyRest happyReduce_20 = happySpecReduce_0 14 happyReduction_20 happyReduction_20 = HappyAbsSyn14 ([] ) happyNewToken action sts stk [] = action 28 28 (error "reading EOF!") (HappyState action) sts stk [] happyNewToken action sts stk (tk:tks) = let cont i = action i i tk (HappyState action) sts stk tks in case tk of { TkId happy_dollar_dollar -> cont 15; TkColon -> cont 16; TkData -> cont 17; TkVisitor -> cont 18; TkBar -> cont 19; TkOpenBrace -> cont 20; TkCloseBrace -> cont 21; TkOpenSquare -> cont 22; TkCloseSquare -> cont 23; TkOpenParen -> cont 24; TkCloseParen -> cont 25; TkEqual -> cont 26; TkComma -> cont 27; _ -> happyError' (tk:tks) } happyError_ tk tks = happyError' (tk:tks) newtype HappyIdentity a = HappyIdentity a happyIdentity = HappyIdentity happyRunIdentity (HappyIdentity a) = a instance Monad HappyIdentity where return = HappyIdentity (HappyIdentity p) >>= q = q p happyThen :: () => HappyIdentity a -> (a -> HappyIdentity b) -> HappyIdentity b happyThen = (>>=) happyReturn :: () => a -> HappyIdentity a happyReturn = (return) happyThen1 m k tks = (>>=) m (\a -> k a tks) happyReturn1 :: () => a -> b -> HappyIdentity a happyReturn1 = \a tks -> (return) a happyError' :: () => [Token] -> HappyIdentity a happyError' = HappyIdentity . happyError parser tks = happyRunIdentity happySomeParser where happySomeParser = happyThen (happyParse action_0 tks) (\x -> case x of {HappyAbsSyn4 z -> happyReturn z; _other -> notHappyAtAll }) happySeq = happyDontSeq -- parser :: Parser [Data] happyError = error "Parse error" {-# LINE 1 "GenericTemplate.hs" #-} -- $Id$ {-# LINE 15 "GenericTemplate.hs" #-} infixr 9 `HappyStk` data HappyStk a = HappyStk a (HappyStk a) ----------------------------------------------------------------------------- -- starting the parse happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll ----------------------------------------------------------------------------- -- Accepting the parse -- If the current token is (1), 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 (1) tk st sts (_ `HappyStk` ans `HappyStk` _) = happyReturn1 ans happyAccept j tk st sts (HappyStk ans _) = (happyReturn1 ans) ----------------------------------------------------------------------------- -- Arrays only: do the next action {-# LINE 154 "GenericTemplate.hs" #-} ----------------------------------------------------------------------------- -- HappyState data type (not arrays) newtype HappyState b c = HappyState (Int -> -- token number Int -> -- token number (yes, again) b -> -- token semantic value HappyState b c -> -- current state [HappyState b c] -> -- state stack c) ----------------------------------------------------------------------------- -- Shifting a token happyShift new_state (1) tk st sts stk@(x `HappyStk` _) = let i = (case x of { HappyErrorToken (i) -> i }) in -- trace "shifting the error token" $ new_state i i tk (HappyState (new_state)) ((st):(sts)) (stk) happyShift new_state i tk st sts stk = happyNewToken new_state ((st):(sts)) ((HappyTerminal (tk))`HappyStk`stk) -- happyReduce is specialised for the common cases. happySpecReduce_0 i fn (1) tk st sts stk = happyFail (1) tk st sts stk happySpecReduce_0 nt fn j tk st@((HappyState (action))) sts stk = action nt j tk st ((st):(sts)) (fn `HappyStk` stk) happySpecReduce_1 i fn (1) tk st sts stk = happyFail (1) tk st sts stk happySpecReduce_1 nt fn j tk _ sts@(((st@(HappyState (action))):(_))) (v1`HappyStk`stk') = let r = fn v1 in happySeq r (action nt j tk st sts (r `HappyStk` stk')) happySpecReduce_2 i fn (1) tk st sts stk = happyFail (1) tk st sts stk happySpecReduce_2 nt fn j tk _ ((_):(sts@(((st@(HappyState (action))):(_))))) (v1`HappyStk`v2`HappyStk`stk') = let r = fn v1 v2 in happySeq r (action nt j tk st sts (r `HappyStk` stk')) happySpecReduce_3 i fn (1) tk st sts stk = happyFail (1) tk st sts stk happySpecReduce_3 nt fn j tk _ ((_):(((_):(sts@(((st@(HappyState (action))):(_))))))) (v1`HappyStk`v2`HappyStk`v3`HappyStk`stk') = let r = fn v1 v2 v3 in happySeq r (action nt j tk st sts (r `HappyStk` stk')) happyReduce k i fn (1) tk st sts stk = happyFail (1) tk st sts stk happyReduce k nt fn j tk st sts stk = case happyDrop (k - ((1) :: Int)) sts of sts1@(((st1@(HappyState (action))):(_))) -> let r = fn stk in -- it doesn't hurt to always seq here... happyDoSeq r (action nt j tk st1 sts1 r) happyMonadReduce k nt fn (1) tk st sts stk = happyFail (1) tk st sts stk happyMonadReduce k nt fn j tk st sts stk = happyThen1 (fn stk) (\r -> action nt j tk st1 sts1 (r `HappyStk` drop_stk)) where sts1@(((st1@(HappyState (action))):(_))) = happyDrop k ((st):(sts)) drop_stk = happyDropStk k stk happyDrop (0) l = l happyDrop n ((_):(t)) = happyDrop (n - ((1) :: Int)) t happyDropStk (0) l = l happyDropStk n (x `HappyStk` xs) = happyDropStk (n - ((1)::Int)) xs ----------------------------------------------------------------------------- -- Moving to a new state after a reduction happyGoto action j tk st = action j j tk (HappyState action) ----------------------------------------------------------------------------- -- Error recovery ((1) is the error token) -- parse error if we are in recovery and we fail again happyFail (1) tk old_st _ stk = -- trace "failing" $ happyError_ tk {- We don't need state discarding for our restricted implementation of "error". In fact, it can cause some bogus parses, so I've disabled it for now --SDM -- discard a state happyFail (1) tk old_st (((HappyState (action))):(sts)) (saved_tok `HappyStk` _ `HappyStk` stk) = -- trace ("discarding state, depth " ++ show (length stk)) $ action (1) (1) tk (HappyState (action)) sts ((saved_tok`HappyStk`stk)) -} -- Enter error recovery: generate an error token, -- save the old token and carry on. happyFail i tk (HappyState (action)) sts stk = -- trace "entering error recovery" $ action (1) (1) tk (HappyState (action)) sts ( (HappyErrorToken (i)) `HappyStk` stk) -- Internal happy errors: notHappyAtAll = error "Internal Happy error\n" ----------------------------------------------------------------------------- -- Hack to get the typechecker to accept our action functions ----------------------------------------------------------------------------- -- Seq-ing. If the --strict flag is given, then Happy emits -- happySeq = happyDoSeq -- otherwise it emits -- happySeq = happyDontSeq happyDoSeq, happyDontSeq :: a -> b -> b happyDoSeq a b = a `seq` b happyDontSeq a b = b ----------------------------------------------------------------------------- -- Don't inline any functions from the template. GHC has a nasty habit -- of deciding to inline happyGoto everywhere, which increases the size of -- the generated parser quite a bit. {-# NOINLINE 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.