{-# OPTIONS_GHC -w #-} {-# LANGUAGE CPP #-} {-# OPTIONS_GHC -w #-} module Happy.Frontend.AttrGrammar.Parser (agParser) where import Happy.Frontend.ParseMonad.Class import Happy.Frontend.ParseMonad.Bootstrapped import Happy.Frontend.AttrGrammar import qualified Data.Array as Happy_Data_Array import qualified Data.Bits as Bits import Control.Applicative(Applicative(..)) import Control.Monad (ap) -- parser produced by Happy Version 2.0 data HappyAbsSyn = HappyTerminal (AgToken) | HappyErrorToken Prelude.Int | HappyAbsSyn4 ([AgRule]) | HappyAbsSyn6 (AgRule) | HappyAbsSyn7 ([AgToken]) {- to allow type-synonyms as our monads (likely - with explicitly-specified bind and return) - in Haskell98, it seems that with - /type M a = .../, then /(HappyReduction M)/ - is not allowed. But Happy is a - code-generator that can just substitute it. type HappyReduction m = Prelude.Int -> (AgToken) -> HappyState (AgToken) (HappyStk HappyAbsSyn -> m HappyAbsSyn) -> [HappyState (AgToken) (HappyStk HappyAbsSyn -> m HappyAbsSyn)] -> HappyStk HappyAbsSyn -> m HappyAbsSyn -} action_0, action_1, action_2, action_3, action_4, action_5, action_6, action_7, action_8, action_9, action_10, action_11, action_12, action_13, action_14, action_15, action_16, action_17, action_18, action_19, action_20, action_21, action_22, action_23, action_24, action_25, action_26, action_27, action_28, action_29, action_30, action_31, action_32, action_33, action_34, action_35, action_36, action_37, action_38, action_39, action_40, action_41, action_42, action_43, action_44, action_45, action_46, action_47 :: () => Prelude.Int -> ({-HappyReduction (P) = -} Prelude.Int -> (AgToken) -> HappyState (AgToken) (HappyStk HappyAbsSyn -> (P) HappyAbsSyn) -> [HappyState (AgToken) (HappyStk HappyAbsSyn -> (P) HappyAbsSyn)] -> HappyStk HappyAbsSyn -> (P) HappyAbsSyn) happyReduce_1, happyReduce_2, happyReduce_3, happyReduce_4, happyReduce_5, happyReduce_6, happyReduce_7, happyReduce_8, happyReduce_9, happyReduce_10, happyReduce_11, happyReduce_12, happyReduce_13, happyReduce_14, happyReduce_15, happyReduce_16, happyReduce_17, happyReduce_18, happyReduce_19, happyReduce_20, happyReduce_21, happyReduce_22, happyReduce_23 :: () => ({-HappyReduction (P) = -} Prelude.Int -> (AgToken) -> HappyState (AgToken) (HappyStk HappyAbsSyn -> (P) HappyAbsSyn) -> [HappyState (AgToken) (HappyStk HappyAbsSyn -> (P) HappyAbsSyn)] -> HappyStk HappyAbsSyn -> (P) HappyAbsSyn) happyExpList :: Happy_Data_Array.Array Prelude.Int Prelude.Int happyExpList = Happy_Data_Array.listArray (0,61) ([61440,49152,3,0,1,489,32,128,512,0,41984,36871,16414,122,0,1972,7824,31296,59648,41985,36871,30,60,0,0,0,0,0,0,8192,16384,123,493,1972,7888,31552,59648,46081,7,0,0,0,0,0,0,0,0,0,32768,0,489,0,7888,0,0 ]) {-# NOINLINE happyExpListPerState #-} happyExpListPerState st = token_strs_expected where token_strs = ["error","%dummy","%start_agParser","agParser","rules","rule","code","code0","\"{\"","\"}\"","\";\"","\"=\"","where","selfRef","subRef","rightRef","unknown","%eof"] bit_start = st Prelude.* 18 bit_end = (st Prelude.+ 1) Prelude.* 18 read_bit = readArrayBit happyExpList bits = Prelude.map read_bit [bit_start..bit_end Prelude.- 1] bits_indexed = Prelude.zip bits [0..17] token_strs_expected = Prelude.concatMap f bits_indexed f (Prelude.False, _) = [] f (Prelude.True, nr) = [token_strs Prelude.!! nr] action_0 (13) = happyShift action_4 action_0 (14) = happyShift action_5 action_0 (15) = happyShift action_6 action_0 (16) = happyShift action_7 action_0 (4) = happyGoto action_8 action_0 (5) = happyGoto action_2 action_0 (6) = happyGoto action_3 action_0 _ = happyReduce_4 action_1 (13) = happyShift action_4 action_1 (14) = happyShift action_5 action_1 (15) = happyShift action_6 action_1 (16) = happyShift action_7 action_1 (5) = happyGoto action_2 action_1 (6) = happyGoto action_3 action_1 _ = happyFail (happyExpListPerState 1) action_2 _ = happyReduce_1 action_3 (11) = happyShift action_19 action_3 _ = happyReduce_3 action_4 (9) = happyShift action_13 action_4 (12) = happyShift action_14 action_4 (14) = happyShift action_15 action_4 (15) = happyShift action_16 action_4 (16) = happyShift action_17 action_4 (17) = happyShift action_18 action_4 (7) = happyGoto action_12 action_4 _ = happyReduce_15 action_5 (12) = happyShift action_11 action_5 _ = happyFail (happyExpListPerState 5) action_6 (12) = happyShift action_10 action_6 _ = happyFail (happyExpListPerState 6) action_7 (12) = happyShift action_9 action_7 _ = happyFail (happyExpListPerState 7) action_8 (18) = happyAccept action_8 _ = happyFail (happyExpListPerState 8) action_9 (9) = happyShift action_13 action_9 (12) = happyShift action_14 action_9 (14) = happyShift action_15 action_9 (15) = happyShift action_16 action_9 (16) = happyShift action_17 action_9 (17) = happyShift action_18 action_9 (7) = happyGoto action_36 action_9 _ = happyReduce_15 action_10 (9) = happyShift action_13 action_10 (12) = happyShift action_14 action_10 (14) = happyShift action_15 action_10 (15) = happyShift action_16 action_10 (16) = happyShift action_17 action_10 (17) = happyShift action_18 action_10 (7) = happyGoto action_35 action_10 _ = happyReduce_15 action_11 (9) = happyShift action_13 action_11 (12) = happyShift action_14 action_11 (14) = happyShift action_15 action_11 (15) = happyShift action_16 action_11 (16) = happyShift action_17 action_11 (17) = happyShift action_18 action_11 (7) = happyGoto action_34 action_11 _ = happyReduce_15 action_12 _ = happyReduce_8 action_13 (9) = happyShift action_27 action_13 (11) = happyShift action_28 action_13 (12) = happyShift action_29 action_13 (14) = happyShift action_30 action_13 (15) = happyShift action_31 action_13 (16) = happyShift action_32 action_13 (17) = happyShift action_33 action_13 (8) = happyGoto action_26 action_13 _ = happyReduce_23 action_14 (9) = happyShift action_13 action_14 (12) = happyShift action_14 action_14 (14) = happyShift action_15 action_14 (15) = happyShift action_16 action_14 (16) = happyShift action_17 action_14 (17) = happyShift action_18 action_14 (7) = happyGoto action_25 action_14 _ = happyReduce_15 action_15 (9) = happyShift action_13 action_15 (12) = happyShift action_14 action_15 (14) = happyShift action_15 action_15 (15) = happyShift action_16 action_15 (16) = happyShift action_17 action_15 (17) = happyShift action_18 action_15 (7) = happyGoto action_24 action_15 _ = happyReduce_15 action_16 (9) = happyShift action_13 action_16 (12) = happyShift action_14 action_16 (14) = happyShift action_15 action_16 (15) = happyShift action_16 action_16 (16) = happyShift action_17 action_16 (17) = happyShift action_18 action_16 (7) = happyGoto action_23 action_16 _ = happyReduce_15 action_17 (9) = happyShift action_13 action_17 (12) = happyShift action_14 action_17 (14) = happyShift action_15 action_17 (15) = happyShift action_16 action_17 (16) = happyShift action_17 action_17 (17) = happyShift action_18 action_17 (7) = happyGoto action_22 action_17 _ = happyReduce_15 action_18 (9) = happyShift action_13 action_18 (12) = happyShift action_14 action_18 (14) = happyShift action_15 action_18 (15) = happyShift action_16 action_18 (16) = happyShift action_17 action_18 (17) = happyShift action_18 action_18 (7) = happyGoto action_21 action_18 _ = happyReduce_15 action_19 (13) = happyShift action_4 action_19 (14) = happyShift action_5 action_19 (15) = happyShift action_6 action_19 (16) = happyShift action_7 action_19 (5) = happyGoto action_20 action_19 (6) = happyGoto action_3 action_19 _ = happyReduce_4 action_20 _ = happyReduce_2 action_21 _ = happyReduce_14 action_22 _ = happyReduce_13 action_23 _ = happyReduce_12 action_24 _ = happyReduce_11 action_25 _ = happyReduce_10 action_26 (10) = happyShift action_44 action_26 _ = happyFail (happyExpListPerState 26) action_27 (9) = happyShift action_27 action_27 (11) = happyShift action_28 action_27 (12) = happyShift action_29 action_27 (14) = happyShift action_30 action_27 (15) = happyShift action_31 action_27 (16) = happyShift action_32 action_27 (17) = happyShift action_33 action_27 (8) = happyGoto action_43 action_27 _ = happyReduce_23 action_28 (9) = happyShift action_27 action_28 (11) = happyShift action_28 action_28 (12) = happyShift action_29 action_28 (14) = happyShift action_30 action_28 (15) = happyShift action_31 action_28 (16) = happyShift action_32 action_28 (17) = happyShift action_33 action_28 (8) = happyGoto action_42 action_28 _ = happyReduce_23 action_29 (9) = happyShift action_27 action_29 (11) = happyShift action_28 action_29 (12) = happyShift action_29 action_29 (14) = happyShift action_30 action_29 (15) = happyShift action_31 action_29 (16) = happyShift action_32 action_29 (17) = happyShift action_33 action_29 (8) = happyGoto action_41 action_29 _ = happyReduce_23 action_30 (9) = happyShift action_27 action_30 (11) = happyShift action_28 action_30 (12) = happyShift action_29 action_30 (14) = happyShift action_30 action_30 (15) = happyShift action_31 action_30 (16) = happyShift action_32 action_30 (17) = happyShift action_33 action_30 (8) = happyGoto action_40 action_30 _ = happyReduce_23 action_31 (9) = happyShift action_27 action_31 (11) = happyShift action_28 action_31 (12) = happyShift action_29 action_31 (14) = happyShift action_30 action_31 (15) = happyShift action_31 action_31 (16) = happyShift action_32 action_31 (17) = happyShift action_33 action_31 (8) = happyGoto action_39 action_31 _ = happyReduce_23 action_32 (9) = happyShift action_13 action_32 (12) = happyShift action_14 action_32 (14) = happyShift action_15 action_32 (15) = happyShift action_16 action_32 (16) = happyShift action_17 action_32 (17) = happyShift action_18 action_32 (7) = happyGoto action_38 action_32 _ = happyReduce_15 action_33 (9) = happyShift action_27 action_33 (11) = happyShift action_28 action_33 (12) = happyShift action_29 action_33 (14) = happyShift action_30 action_33 (15) = happyShift action_31 action_33 (16) = happyShift action_32 action_33 (17) = happyShift action_33 action_33 (8) = happyGoto action_37 action_33 _ = happyReduce_23 action_34 _ = happyReduce_5 action_35 _ = happyReduce_6 action_36 _ = happyReduce_7 action_37 _ = happyReduce_22 action_38 _ = happyReduce_21 action_39 _ = happyReduce_20 action_40 _ = happyReduce_19 action_41 _ = happyReduce_17 action_42 _ = happyReduce_18 action_43 (10) = happyShift action_46 action_43 _ = happyFail (happyExpListPerState 43) action_44 (9) = happyShift action_13 action_44 (12) = happyShift action_14 action_44 (14) = happyShift action_15 action_44 (15) = happyShift action_16 action_44 (16) = happyShift action_17 action_44 (17) = happyShift action_18 action_44 (7) = happyGoto action_45 action_44 _ = happyReduce_15 action_45 _ = happyReduce_9 action_46 (9) = happyShift action_27 action_46 (11) = happyShift action_28 action_46 (12) = happyShift action_29 action_46 (14) = happyShift action_30 action_46 (15) = happyShift action_31 action_46 (16) = happyShift action_32 action_46 (17) = happyShift action_33 action_46 (8) = happyGoto action_47 action_46 _ = happyReduce_23 action_47 _ = happyReduce_16 happyReduce_1 = happySpecReduce_1 4 happyReduction_1 happyReduction_1 (HappyAbsSyn4 happy_var_1) = HappyAbsSyn4 (happy_var_1 ) happyReduction_1 _ = notHappyAtAll happyReduce_2 = happySpecReduce_3 5 happyReduction_2 happyReduction_2 (HappyAbsSyn4 happy_var_3) _ (HappyAbsSyn6 happy_var_1) = HappyAbsSyn4 (happy_var_1 : happy_var_3 ) happyReduction_2 _ _ _ = notHappyAtAll happyReduce_3 = happySpecReduce_1 5 happyReduction_3 happyReduction_3 (HappyAbsSyn6 happy_var_1) = HappyAbsSyn4 (happy_var_1 : [] ) happyReduction_3 _ = notHappyAtAll happyReduce_4 = happySpecReduce_0 5 happyReduction_4 happyReduction_4 = HappyAbsSyn4 ([] ) happyReduce_5 = happySpecReduce_3 6 happyReduction_5 happyReduction_5 (HappyAbsSyn7 happy_var_3) _ (HappyTerminal happy_var_1) = HappyAbsSyn6 (SelfAssign (selfRefVal happy_var_1) happy_var_3 ) happyReduction_5 _ _ _ = notHappyAtAll happyReduce_6 = happySpecReduce_3 6 happyReduction_6 happyReduction_6 (HappyAbsSyn7 happy_var_3) _ (HappyTerminal happy_var_1) = HappyAbsSyn6 (SubAssign (subRefVal happy_var_1) happy_var_3 ) happyReduction_6 _ _ _ = notHappyAtAll happyReduce_7 = happySpecReduce_3 6 happyReduction_7 happyReduction_7 (HappyAbsSyn7 happy_var_3) _ (HappyTerminal happy_var_1) = HappyAbsSyn6 (RightmostAssign (rightRefVal happy_var_1) happy_var_3 ) happyReduction_7 _ _ _ = notHappyAtAll happyReduce_8 = happySpecReduce_2 6 happyReduction_8 happyReduction_8 (HappyAbsSyn7 happy_var_2) _ = HappyAbsSyn6 (Conditional happy_var_2 ) happyReduction_8 _ _ = notHappyAtAll happyReduce_9 = happyReduce 4 7 happyReduction_9 happyReduction_9 ((HappyAbsSyn7 happy_var_4) `HappyStk` (HappyTerminal happy_var_3) `HappyStk` (HappyAbsSyn7 happy_var_2) `HappyStk` (HappyTerminal happy_var_1) `HappyStk` happyRest) = HappyAbsSyn7 ([happy_var_1] ++ happy_var_2 ++ [happy_var_3] ++ happy_var_4 ) `HappyStk` happyRest happyReduce_10 = happySpecReduce_2 7 happyReduction_10 happyReduction_10 (HappyAbsSyn7 happy_var_2) (HappyTerminal happy_var_1) = HappyAbsSyn7 (happy_var_1 : happy_var_2 ) happyReduction_10 _ _ = notHappyAtAll happyReduce_11 = happySpecReduce_2 7 happyReduction_11 happyReduction_11 (HappyAbsSyn7 happy_var_2) (HappyTerminal happy_var_1) = HappyAbsSyn7 (happy_var_1 : happy_var_2 ) happyReduction_11 _ _ = notHappyAtAll happyReduce_12 = happySpecReduce_2 7 happyReduction_12 happyReduction_12 (HappyAbsSyn7 happy_var_2) (HappyTerminal happy_var_1) = HappyAbsSyn7 (happy_var_1 : happy_var_2 ) happyReduction_12 _ _ = notHappyAtAll happyReduce_13 = happySpecReduce_2 7 happyReduction_13 happyReduction_13 (HappyAbsSyn7 happy_var_2) (HappyTerminal happy_var_1) = HappyAbsSyn7 (happy_var_1 : happy_var_2 ) happyReduction_13 _ _ = notHappyAtAll happyReduce_14 = happySpecReduce_2 7 happyReduction_14 happyReduction_14 (HappyAbsSyn7 happy_var_2) (HappyTerminal happy_var_1) = HappyAbsSyn7 (happy_var_1 : happy_var_2 ) happyReduction_14 _ _ = notHappyAtAll happyReduce_15 = happySpecReduce_0 7 happyReduction_15 happyReduction_15 = HappyAbsSyn7 ([] ) happyReduce_16 = happyReduce 4 8 happyReduction_16 happyReduction_16 ((HappyAbsSyn7 happy_var_4) `HappyStk` (HappyTerminal happy_var_3) `HappyStk` (HappyAbsSyn7 happy_var_2) `HappyStk` (HappyTerminal happy_var_1) `HappyStk` happyRest) = HappyAbsSyn7 ([happy_var_1] ++ happy_var_2 ++ [happy_var_3] ++ happy_var_4 ) `HappyStk` happyRest happyReduce_17 = happySpecReduce_2 8 happyReduction_17 happyReduction_17 (HappyAbsSyn7 happy_var_2) (HappyTerminal happy_var_1) = HappyAbsSyn7 (happy_var_1 : happy_var_2 ) happyReduction_17 _ _ = notHappyAtAll happyReduce_18 = happySpecReduce_2 8 happyReduction_18 happyReduction_18 (HappyAbsSyn7 happy_var_2) (HappyTerminal happy_var_1) = HappyAbsSyn7 (happy_var_1 : happy_var_2 ) happyReduction_18 _ _ = notHappyAtAll happyReduce_19 = happySpecReduce_2 8 happyReduction_19 happyReduction_19 (HappyAbsSyn7 happy_var_2) (HappyTerminal happy_var_1) = HappyAbsSyn7 (happy_var_1 : happy_var_2 ) happyReduction_19 _ _ = notHappyAtAll happyReduce_20 = happySpecReduce_2 8 happyReduction_20 happyReduction_20 (HappyAbsSyn7 happy_var_2) (HappyTerminal happy_var_1) = HappyAbsSyn7 (happy_var_1 : happy_var_2 ) happyReduction_20 _ _ = notHappyAtAll happyReduce_21 = happySpecReduce_2 8 happyReduction_21 happyReduction_21 (HappyAbsSyn7 happy_var_2) (HappyTerminal happy_var_1) = HappyAbsSyn7 (happy_var_1 : happy_var_2 ) happyReduction_21 _ _ = notHappyAtAll happyReduce_22 = happySpecReduce_2 8 happyReduction_22 happyReduction_22 (HappyAbsSyn7 happy_var_2) (HappyTerminal happy_var_1) = HappyAbsSyn7 (happy_var_1 : happy_var_2 ) happyReduction_22 _ _ = notHappyAtAll happyReduce_23 = happySpecReduce_0 8 happyReduction_23 happyReduction_23 = HappyAbsSyn7 ([] ) happyNewToken action sts stk = lexTokenP(\tk -> let cont i = action i i tk (HappyState action) sts stk in case tk of { AgTok_EOF -> action 18 18 tk (HappyState action) sts stk; AgTok_LBrace -> cont 9; AgTok_RBrace -> cont 10; AgTok_Semicolon -> cont 11; AgTok_Eq -> cont 12; AgTok_Where -> cont 13; AgTok_SelfRef _ -> cont 14; AgTok_SubRef _ -> cont 15; AgTok_RightmostRef _ -> cont 16; AgTok_Unknown _ -> cont 17; _ -> happyError' (tk, []) }) happyError_ explist 18 tk = happyError' (tk, explist) happyError_ explist _ tk = happyError' (tk, explist) happyThen :: () => P a -> (a -> P b) -> P b happyThen = (Prelude.>>=) happyReturn :: () => a -> P a happyReturn = (Prelude.return) happyThen1 :: () => P a -> (a -> P b) -> P b happyThen1 = happyThen happyReturn1 :: () => a -> P a happyReturn1 = happyReturn happyError' :: () => ((AgToken), [Prelude.String]) -> P a happyError' tk = (\(tokens, explist) -> happyError) tk agParser = happySomeParser where happySomeParser = happyThen (happyParse action_0) (\x -> case x of {HappyAbsSyn4 z -> happyReturn z; _other -> notHappyAtAll }) happySeq = happyDontSeq happyError :: P a happyError = failP (\l -> show l ++ ": Parse error\n") -- $Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp $ #ifdef HAPPY_GHC # if !defined(__GLASGOW_HASKELL__) # error `HAPPY_GHC` is defined but this code isn't being built with GHC. # endif # define ILIT(n) n# # define IBOX(n) (Happy_GHC_Exts.I# (n)) # define FAST_INT Happy_GHC_Exts.Int# -- 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 # define PLUS(n,m) (n Happy_GHC_Exts.+# m) # define MINUS(n,m) (n Happy_GHC_Exts.-# m) # define TIMES(n,m) (n Happy_GHC_Exts.*# m) # define NEGATE(n) (Happy_GHC_Exts.negateInt# (n)) # define IF_GHC(x) (x) #else # define ILIT(n) (n) # define IBOX(n) (n) # define FAST_INT Prelude.Int # define LT(n,m) (n Prelude.< m) # define GTE(n,m) (n Prelude.>= m) # define EQ(n,m) (n Prelude.== m) # define PLUS(n,m) (n Prelude.+ m) # define MINUS(n,m) (n Prelude.- m) # define TIMES(n,m) (n Prelude.* m) # define NEGATE(n) (Prelude.negate (n)) # define IF_GHC(x) #endif data Happy_IntList = HappyCons FAST_INT Happy_IntList #if defined(HAPPY_ARRAY) # define CONS(h,t) (HappyCons (h) (t)) #else # define CONS(h,t) ((h):(t)) #endif #if defined(HAPPY_ARRAY) # define ERROR_TOK ILIT(0) # define DO_ACTION(state,i,tk,sts,stk) happyDoAction i tk state sts (stk) # define HAPPYSTATE(i) (i) # define GOTO(action) happyGoto # define IF_ARRAYS(x) (x) #else # define ERROR_TOK ILIT(1) # define DO_ACTION(state,i,tk,sts,stk) state i i tk HAPPYSTATE(state) sts (stk) # define HAPPYSTATE(i) (HappyState (i)) # define GOTO(action) action # define IF_ARRAYS(x) #endif #if defined(HAPPY_COERCE) # if !defined(HAPPY_GHC) # error `HAPPY_COERCE` requires `HAPPY_GHC` # endif # define GET_ERROR_TOKEN(x) (case Happy_GHC_Exts.unsafeCoerce# x of { IBOX(i) -> i }) # define MK_ERROR_TOKEN(i) (Happy_GHC_Exts.unsafeCoerce# IBOX(i)) # define MK_TOKEN(x) (happyInTok (x)) #else # define GET_ERROR_TOKEN(x) (case x of { HappyErrorToken IBOX(i) -> i }) # define MK_ERROR_TOKEN(i) (HappyErrorToken IBOX(i)) # define MK_TOKEN(x) (HappyTerminal (x)) #endif #if defined(HAPPY_DEBUG) # define DEBUG_TRACE(s) (happyTrace (s)) $ happyTrace string expr = Happy_System_IO_Unsafe.unsafePerformIO $ do Happy_System_IO.hPutStr Happy_System_IO.stderr string return expr #else # define DEBUG_TRACE(s) {- nothing -} #endif 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 ERROR_TOK tk st sts (_ `HappyStk` ans `HappyStk` _) = happyReturn1 ans happyAccept j tk st sts (HappyStk ans _) = IF_GHC(happyTcHack j IF_ARRAYS(happyTcHack st)) (happyReturn1 ans) ----------------------------------------------------------------------------- -- Arrays only: do the next action #if defined(HAPPY_ARRAY) happyDoAction i tk st = DEBUG_TRACE("state: " ++ show IBOX(st) ++ ",\ttoken: " ++ show IBOX(i) ++ ",\taction: ") case action of ILIT(0) -> DEBUG_TRACE("fail.\n") happyFail (happyExpListPerState (IBOX(st) :: Prelude.Int)) i tk st ILIT(-1) -> DEBUG_TRACE("accept.\n") happyAccept i tk st n | LT(n,(ILIT(0) :: FAST_INT)) -> DEBUG_TRACE("reduce (rule " ++ show rule ++ ")") (happyReduceArr Happy_Data_Array.! rule) i tk st where rule = IBOX(NEGATE(PLUS(n,(ILIT(1) :: FAST_INT)))) n -> DEBUG_TRACE("shift, enter state " ++ show IBOX(new_state) ++ "\n") happyShift new_state i tk st where new_state = MINUS(n,(ILIT(1) :: FAST_INT)) where off = happyAdjustOffset (indexShortOffAddr happyActOffsets st) off_i = PLUS(off, i) check = if GTE(off_i,(ILIT(0) :: FAST_INT)) then EQ(indexShortOffAddr happyCheck off_i, i) else Prelude.False action | check = indexShortOffAddr happyTable off_i | Prelude.otherwise = indexShortOffAddr happyDefActions st #endif /* HAPPY_ARRAY */ #ifdef HAPPY_GHC 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# #else indexShortOffAddr arr off = arr Happy_Data_Array.! off #endif {-# INLINE happyLt #-} happyLt x y = LT(x,y) #ifdef HAPPY_GHC readArrayBit arr bit = Bits.testBit IBOX(indexShortOffAddr arr ((unbox_int bit) `Happy_GHC_Exts.iShiftRA#` 4#)) (bit `Prelude.mod` 16) where unbox_int (Happy_GHC_Exts.I# x) = x #else readArrayBit arr bit = Bits.testBit IBOX(indexShortOffAddr arr (bit `Prelude.div` 16)) (bit `Prelude.mod` 16) #endif #ifdef HAPPY_GHC data HappyAddr = HappyA# Happy_GHC_Exts.Addr# #endif ----------------------------------------------------------------------------- -- HappyState data type (not arrays) #if !defined(HAPPY_ARRAY) newtype HappyState b c = HappyState (FAST_INT -> -- token number FAST_INT -> -- token number (yes, again) b -> -- token semantic value HappyState b c -> -- current state [HappyState b c] -> -- state stack c) #endif ----------------------------------------------------------------------------- -- Shifting a token happyShift new_state ERROR_TOK tk st sts stk@(x `HappyStk` _) = let i = GET_ERROR_TOKEN(x) in -- trace "shifting the error token" $ DO_ACTION(new_state,i,tk,CONS(st,sts),stk) happyShift new_state i tk st sts stk = happyNewToken new_state CONS(st,sts) (MK_TOKEN(tk)`HappyStk`stk) -- happyReduce is specialised for the common cases. happySpecReduce_0 i fn ERROR_TOK tk st sts stk = happyFail [] ERROR_TOK tk st sts stk happySpecReduce_0 nt fn j tk st@(HAPPYSTATE(action)) sts stk = GOTO(action) nt j tk st CONS(st,sts) (fn `HappyStk` stk) happySpecReduce_1 i fn ERROR_TOK tk st sts stk = happyFail [] ERROR_TOK tk st sts stk happySpecReduce_1 nt fn j tk _ sts@(CONS(st@HAPPYSTATE(action),_)) (v1`HappyStk`stk') = let r = fn v1 in happySeq r (GOTO(action) nt j tk st sts (r `HappyStk` stk')) happySpecReduce_2 i fn ERROR_TOK tk st sts stk = happyFail [] ERROR_TOK tk st sts stk happySpecReduce_2 nt fn j tk _ CONS(_,sts@(CONS(st@HAPPYSTATE(action),_))) (v1`HappyStk`v2`HappyStk`stk') = let r = fn v1 v2 in happySeq r (GOTO(action) nt j tk st sts (r `HappyStk` stk')) happySpecReduce_3 i fn ERROR_TOK tk st sts stk = happyFail [] ERROR_TOK tk st sts stk happySpecReduce_3 nt fn j tk _ CONS(_,CONS(_,sts@(CONS(st@HAPPYSTATE(action),_)))) (v1`HappyStk`v2`HappyStk`v3`HappyStk`stk') = let r = fn v1 v2 v3 in happySeq r (GOTO(action) nt j tk st sts (r `HappyStk` stk')) happyReduce k i fn ERROR_TOK tk st sts stk = happyFail [] ERROR_TOK tk st sts stk happyReduce k nt fn j tk st sts stk = case happyDrop MINUS(k,(ILIT(1) :: FAST_INT)) sts of sts1@(CONS(st1@HAPPYSTATE(action),_)) -> let r = fn stk in -- it doesn't hurt to always seq here... happyDoSeq r (GOTO(action) nt j tk st1 sts1 r) happyMonadReduce k nt fn ERROR_TOK tk st sts stk = happyFail [] ERROR_TOK tk st sts stk happyMonadReduce k nt fn j tk st sts stk = case happyDrop k CONS(st,sts) of sts1@(CONS(st1@HAPPYSTATE(action),_)) -> let drop_stk = happyDropStk k stk in happyThen1 (fn stk tk) (\r -> GOTO(action) nt j tk st1 sts1 (r `HappyStk` drop_stk)) happyMonad2Reduce k nt fn ERROR_TOK tk st sts stk = happyFail [] ERROR_TOK tk st sts stk happyMonad2Reduce k nt fn j tk st sts stk = case happyDrop k CONS(st,sts) of sts1@(CONS(st1@HAPPYSTATE(action),_)) -> let drop_stk = happyDropStk k stk #if defined(HAPPY_ARRAY) off = happyAdjustOffset (indexShortOffAddr happyGotoOffsets st1) off_i = PLUS(off, nt) new_state = indexShortOffAddr happyTable off_i #else _ = nt :: FAST_INT new_state = action #endif in happyThen1 (fn stk tk) (\r -> happyNewToken new_state sts1 (r `HappyStk` drop_stk)) happyDrop ILIT(0) l = l happyDrop n CONS(_,t) = happyDrop MINUS(n,(ILIT(1) :: FAST_INT)) t happyDropStk ILIT(0) l = l happyDropStk n (x `HappyStk` xs) = happyDropStk MINUS(n,(ILIT(1)::FAST_INT)) xs ----------------------------------------------------------------------------- -- Moving to a new state after a reduction #if defined(HAPPY_ARRAY) happyGoto nt j tk st = DEBUG_TRACE(", goto state " ++ show IBOX(new_state) ++ "\n") happyDoAction j tk new_state where off = happyAdjustOffset (indexShortOffAddr happyGotoOffsets st) off_i = PLUS(off, nt) new_state = indexShortOffAddr happyTable off_i #else happyGoto action j tk st = action j j tk (HappyState action) #endif ----------------------------------------------------------------------------- -- Error recovery (ERROR_TOK is the error token) -- parse error if we are in recovery and we fail again happyFail explist ERROR_TOK tk old_st _ stk@(x `HappyStk` _) = let i = GET_ERROR_TOKEN(x) 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 HAPPYSTATE(action) sts stk = -- trace "entering error recovery" $ DO_ACTION(action,ERROR_TOK,tk,sts, MK_ERROR_TOKEN(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 #if defined(HAPPY_GHC) happyTcHack :: Happy_GHC_Exts.Int# -> a -> a happyTcHack x y = y {-# INLINE happyTcHack #-} #endif ----------------------------------------------------------------------------- -- 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. #if defined(HAPPY_ARRAY) {-# NOINLINE happyDoAction #-} {-# NOINLINE happyTable #-} {-# NOINLINE happyCheck #-} {-# NOINLINE happyActOffsets #-} {-# NOINLINE happyGotoOffsets #-} {-# NOINLINE happyDefActions #-} #endif {-# 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.