{-# OPTIONS_GHC -w #-} {-# LANGUAGE CPP #-} {-# OPTIONS_GHC -w #-} module Happy.Frontend.Parser.Bootstrapped (ourParser) where import Happy.Frontend.ParseMonad.Class import Happy.Frontend.ParseMonad.Bootstrapped import Happy.Frontend.AbsSyn import Happy.Frontend.Lexer 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 (Token) | HappyErrorToken Prelude.Int | HappyAbsSyn4 (BookendedAbsSyn) | HappyAbsSyn5 (AbsSyn) | HappyAbsSyn6 ([Rule]) | HappyAbsSyn7 (Rule) | HappyAbsSyn8 ([String]) | HappyAbsSyn10 ([Prod]) | HappyAbsSyn11 (Prod) | HappyAbsSyn12 (Term) | HappyAbsSyn13 ([Term]) | HappyAbsSyn16 (Prec) | HappyAbsSyn17 ([Directive String]) | HappyAbsSyn18 (Directive String) | HappyAbsSyn19 (Maybe String) | HappyAbsSyn20 ([(String,String)]) | HappyAbsSyn21 ((String,String)) {- 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 -> (Token) -> HappyState (Token) (HappyStk HappyAbsSyn -> m HappyAbsSyn) -> [HappyState (Token) (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, action_48, action_49, action_50, action_51, action_52, action_53, action_54, action_55, action_56, action_57, action_58, action_59, action_60, action_61, action_62, action_63, action_64, action_65, action_66, action_67, action_68, action_69, action_70, action_71, action_72, action_73, action_74, action_75, action_76, action_77, action_78, action_79, action_80, action_81, action_82, action_83, action_84, action_85, action_86, action_87, action_88, action_89, action_90, action_91, action_92, action_93 :: () => Prelude.Int -> ({-HappyReduction (P) = -} Prelude.Int -> (Token) -> HappyState (Token) (HappyStk HappyAbsSyn -> (P) HappyAbsSyn) -> [HappyState (Token) (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, happyReduce_24, happyReduce_25, happyReduce_26, happyReduce_27, happyReduce_28, happyReduce_29, happyReduce_30, happyReduce_31, happyReduce_32, happyReduce_33, happyReduce_34, happyReduce_35, happyReduce_36, happyReduce_37, happyReduce_38, happyReduce_39, happyReduce_40, happyReduce_41, happyReduce_42, happyReduce_43, happyReduce_44, happyReduce_45, happyReduce_46, happyReduce_47, happyReduce_48, happyReduce_49, happyReduce_50, happyReduce_51, happyReduce_52, happyReduce_53, happyReduce_54, happyReduce_55 :: () => ({-HappyReduction (P) = -} Prelude.Int -> (Token) -> HappyState (Token) (HappyStk HappyAbsSyn -> (P) HappyAbsSyn) -> [HappyState (Token) (HappyStk HappyAbsSyn -> (P) HappyAbsSyn)] -> HappyStk HappyAbsSyn -> (P) HappyAbsSyn) happyExpList :: Happy_Data_Array.Array Prelude.Int Prelude.Int happyExpList = Happy_Data_Array.listArray (0,149) ([0,0,512,0,0,8192,0,0,62463,1,0,0,0,0,0,0,0,0,8192,0,0,62463,65,0,0,0,0,0,512,0,2048,0,0,32768,0,0,0,8,0,0,0,512,0,0,0,0,0,0,2,0,8,0,0,128,0,0,2048,0,0,0,0,4,0,0,32,0,128,0,0,2048,0,0,0,0,2,0,0,0,0,0,512,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,512,0,0,8192,0,32768,0,0,0,8,0,0,0,0,0,2048,0,0,0,0,2,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,8,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,512,0,0,0,0,0,0,0,0,0,32,0,0,10240,0,2048,0,0,0,0,0,0,0,24576,0,0,0,0,2048,0,0,0,0,2,0,0,0,0,128,2048,0,0,0,0,0,0,128,0,0,0,0,0,12,0,2048,0,0,0,0,256,0,0,0,0,128,0,0,0,0,0,32768,0,0,0,0,0,0,0,512,0,2048,0,0,0,0,0,0,8,0,0,0,2048,0,2048,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,6,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0 ]) {-# NOINLINE happyExpListPerState #-} happyExpListPerState st = token_strs_expected where token_strs = ["error","%dummy","%start_ourParser","parser","core_parser","rules","rule","params","comma_ids","prods","prod","term","terms","terms_rev","comma_terms","prec","tokInfos","tokInfo","optStart","tokenSpecs","tokenSpec","ids","optCode","id","spec_tokentype","spec_token","spec_name","spec_partial","spec_lexer","spec_imported_identity","spec_monad","spec_nonassoc","spec_left","spec_right","spec_prec","spec_shift","spec_expect","spec_error","spec_errorhandlertype","spec_attribute","spec_attributetype","code","int","\":\"","\";\"","\"::\"","\"%%\"","\"|\"","\"(\"","\")\"","\",\"","%eof"] bit_start = st Prelude.* 52 bit_end = (st Prelude.+ 1) Prelude.* 52 read_bit = readArrayBit happyExpList bits = Prelude.map read_bit [bit_start..bit_end Prelude.- 1] bits_indexed = Prelude.zip bits [0..51] token_strs_expected = Prelude.concatMap f bits_indexed f (Prelude.False, _) = [] f (Prelude.True, nr) = [token_strs Prelude.!! nr] action_0 (42) = happyShift action_3 action_0 (4) = happyGoto action_4 action_0 (23) = happyGoto action_2 action_0 _ = happyReduce_55 action_1 (42) = happyShift action_3 action_1 (23) = happyGoto action_2 action_1 _ = happyFail (happyExpListPerState 1) action_2 (25) = happyShift action_8 action_2 (26) = happyShift action_9 action_2 (27) = happyShift action_10 action_2 (28) = happyShift action_11 action_2 (29) = happyShift action_12 action_2 (30) = happyShift action_13 action_2 (31) = happyShift action_14 action_2 (32) = happyShift action_15 action_2 (33) = happyShift action_16 action_2 (34) = happyShift action_17 action_2 (37) = happyShift action_18 action_2 (38) = happyShift action_19 action_2 (39) = happyShift action_20 action_2 (40) = happyShift action_21 action_2 (41) = happyShift action_22 action_2 (5) = happyGoto action_5 action_2 (17) = happyGoto action_6 action_2 (18) = happyGoto action_7 action_2 _ = happyFail (happyExpListPerState 2) action_3 _ = happyReduce_54 action_4 (52) = happyAccept action_4 _ = happyFail (happyExpListPerState 4) action_5 (42) = happyShift action_3 action_5 (23) = happyGoto action_42 action_5 _ = happyReduce_55 action_6 (25) = happyShift action_8 action_6 (26) = happyShift action_9 action_6 (27) = happyShift action_10 action_6 (28) = happyShift action_11 action_6 (29) = happyShift action_12 action_6 (30) = happyShift action_13 action_6 (31) = happyShift action_14 action_6 (32) = happyShift action_15 action_6 (33) = happyShift action_16 action_6 (34) = happyShift action_17 action_6 (37) = happyShift action_18 action_6 (38) = happyShift action_19 action_6 (39) = happyShift action_20 action_6 (40) = happyShift action_21 action_6 (41) = happyShift action_22 action_6 (47) = happyShift action_41 action_6 (18) = happyGoto action_40 action_6 _ = happyFail (happyExpListPerState 6) action_7 _ = happyReduce_28 action_8 (42) = happyShift action_39 action_8 _ = happyFail (happyExpListPerState 8) action_9 (24) = happyShift action_38 action_9 (20) = happyGoto action_36 action_9 (21) = happyGoto action_37 action_9 _ = happyFail (happyExpListPerState 9) action_10 (24) = happyShift action_35 action_10 _ = happyFail (happyExpListPerState 10) action_11 (24) = happyShift action_34 action_11 _ = happyFail (happyExpListPerState 11) action_12 (42) = happyShift action_33 action_12 _ = happyFail (happyExpListPerState 12) action_13 _ = happyReduce_33 action_14 (42) = happyShift action_32 action_14 _ = happyFail (happyExpListPerState 14) action_15 (24) = happyShift action_29 action_15 (22) = happyGoto action_31 action_15 _ = happyReduce_53 action_16 (24) = happyShift action_29 action_16 (22) = happyGoto action_30 action_16 _ = happyReduce_53 action_17 (24) = happyShift action_29 action_17 (22) = happyGoto action_28 action_17 _ = happyReduce_53 action_18 (43) = happyShift action_27 action_18 _ = happyFail (happyExpListPerState 18) action_19 (42) = happyShift action_26 action_19 _ = happyFail (happyExpListPerState 19) action_20 (24) = happyShift action_25 action_20 _ = happyFail (happyExpListPerState 20) action_21 (24) = happyShift action_24 action_21 _ = happyFail (happyExpListPerState 21) action_22 (42) = happyShift action_23 action_22 _ = happyFail (happyExpListPerState 22) action_23 _ = happyReduce_45 action_24 (42) = happyShift action_54 action_24 _ = happyFail (happyExpListPerState 24) action_25 _ = happyReduce_44 action_26 _ = happyReduce_43 action_27 _ = happyReduce_42 action_28 _ = happyReduce_40 action_29 (24) = happyShift action_29 action_29 (22) = happyGoto action_53 action_29 _ = happyReduce_53 action_30 _ = happyReduce_41 action_31 _ = happyReduce_39 action_32 (42) = happyShift action_52 action_32 _ = happyReduce_35 action_33 (42) = happyShift action_51 action_33 _ = happyFail (happyExpListPerState 33) action_34 (24) = happyShift action_49 action_34 (19) = happyGoto action_50 action_34 _ = happyReduce_48 action_35 (24) = happyShift action_49 action_35 (19) = happyGoto action_48 action_35 _ = happyReduce_48 action_36 _ = happyReduce_30 action_37 (24) = happyShift action_38 action_37 (20) = happyGoto action_47 action_37 (21) = happyGoto action_37 action_37 _ = happyReduce_50 action_38 (42) = happyShift action_46 action_38 _ = happyFail (happyExpListPerState 38) action_39 _ = happyReduce_29 action_40 _ = happyReduce_27 action_41 (24) = happyShift action_45 action_41 (6) = happyGoto action_43 action_41 (7) = happyGoto action_44 action_41 _ = happyFail (happyExpListPerState 41) action_42 _ = happyReduce_1 action_43 (24) = happyShift action_45 action_43 (7) = happyGoto action_58 action_43 _ = happyReduce_2 action_44 _ = happyReduce_4 action_45 (49) = happyShift action_57 action_45 (8) = happyGoto action_56 action_45 _ = happyReduce_9 action_46 _ = happyReduce_51 action_47 _ = happyReduce_49 action_48 _ = happyReduce_31 action_49 _ = happyReduce_47 action_50 _ = happyReduce_32 action_51 _ = happyReduce_34 action_52 (42) = happyShift action_55 action_52 _ = happyReduce_36 action_53 _ = happyReduce_52 action_54 _ = happyReduce_46 action_55 (42) = happyShift action_63 action_55 _ = happyReduce_37 action_56 (44) = happyShift action_61 action_56 (46) = happyShift action_62 action_56 _ = happyFail (happyExpListPerState 56) action_57 (24) = happyShift action_60 action_57 (9) = happyGoto action_59 action_57 _ = happyFail (happyExpListPerState 57) action_58 _ = happyReduce_3 action_59 (50) = happyShift action_71 action_59 (51) = happyShift action_72 action_59 _ = happyFail (happyExpListPerState 59) action_60 _ = happyReduce_10 action_61 (24) = happyShift action_70 action_61 (10) = happyGoto action_65 action_61 (11) = happyGoto action_66 action_61 (12) = happyGoto action_67 action_61 (13) = happyGoto action_68 action_61 (14) = happyGoto action_69 action_61 _ = happyReduce_19 action_62 (42) = happyShift action_64 action_62 _ = happyFail (happyExpListPerState 62) action_63 _ = happyReduce_38 action_64 (24) = happyShift action_80 action_64 (44) = happyShift action_81 action_64 _ = happyFail (happyExpListPerState 64) action_65 _ = happyReduce_7 action_66 (48) = happyShift action_79 action_66 _ = happyReduce_13 action_67 _ = happyReduce_20 action_68 (35) = happyShift action_77 action_68 (36) = happyShift action_78 action_68 (16) = happyGoto action_76 action_68 _ = happyReduce_26 action_69 (24) = happyShift action_70 action_69 (12) = happyGoto action_75 action_69 _ = happyReduce_18 action_70 (49) = happyShift action_74 action_70 _ = happyReduce_16 action_71 _ = happyReduce_8 action_72 (24) = happyShift action_73 action_72 _ = happyFail (happyExpListPerState 72) action_73 _ = happyReduce_11 action_74 (24) = happyShift action_70 action_74 (12) = happyGoto action_87 action_74 (15) = happyGoto action_88 action_74 _ = happyFail (happyExpListPerState 74) action_75 _ = happyReduce_21 action_76 (42) = happyShift action_86 action_76 _ = happyFail (happyExpListPerState 76) action_77 (24) = happyShift action_85 action_77 _ = happyFail (happyExpListPerState 77) action_78 _ = happyReduce_25 action_79 (24) = happyShift action_70 action_79 (10) = happyGoto action_84 action_79 (11) = happyGoto action_66 action_79 (12) = happyGoto action_67 action_79 (13) = happyGoto action_68 action_79 (14) = happyGoto action_69 action_79 _ = happyReduce_19 action_80 (44) = happyShift action_83 action_80 _ = happyFail (happyExpListPerState 80) action_81 (24) = happyShift action_70 action_81 (10) = happyGoto action_82 action_81 (11) = happyGoto action_66 action_81 (12) = happyGoto action_67 action_81 (13) = happyGoto action_68 action_81 (14) = happyGoto action_69 action_81 _ = happyReduce_19 action_82 _ = happyReduce_5 action_83 (24) = happyShift action_70 action_83 (10) = happyGoto action_92 action_83 (11) = happyGoto action_66 action_83 (12) = happyGoto action_67 action_83 (13) = happyGoto action_68 action_83 (14) = happyGoto action_69 action_83 _ = happyReduce_19 action_84 _ = happyReduce_12 action_85 _ = happyReduce_24 action_86 (45) = happyShift action_91 action_86 _ = happyReduce_15 action_87 _ = happyReduce_22 action_88 (50) = happyShift action_89 action_88 (51) = happyShift action_90 action_88 _ = happyFail (happyExpListPerState 88) action_89 _ = happyReduce_17 action_90 (24) = happyShift action_70 action_90 (12) = happyGoto action_93 action_90 _ = happyFail (happyExpListPerState 90) action_91 _ = happyReduce_14 action_92 _ = happyReduce_6 action_93 _ = happyReduce_23 happyReduce_1 = happySpecReduce_3 4 happyReduction_1 happyReduction_1 (HappyAbsSyn19 happy_var_3) (HappyAbsSyn5 happy_var_2) (HappyAbsSyn19 happy_var_1) = HappyAbsSyn4 (BookendedAbsSyn happy_var_1 happy_var_2 happy_var_3 ) happyReduction_1 _ _ _ = notHappyAtAll happyReduce_2 = happySpecReduce_3 5 happyReduction_2 happyReduction_2 (HappyAbsSyn6 happy_var_3) _ (HappyAbsSyn17 happy_var_1) = HappyAbsSyn5 (AbsSyn (reverse happy_var_1) (reverse happy_var_3) ) happyReduction_2 _ _ _ = notHappyAtAll happyReduce_3 = happySpecReduce_2 6 happyReduction_3 happyReduction_3 (HappyAbsSyn7 happy_var_2) (HappyAbsSyn6 happy_var_1) = HappyAbsSyn6 (happy_var_2 : happy_var_1 ) happyReduction_3 _ _ = notHappyAtAll happyReduce_4 = happySpecReduce_1 6 happyReduction_4 happyReduction_4 (HappyAbsSyn7 happy_var_1) = HappyAbsSyn6 ([happy_var_1] ) happyReduction_4 _ = notHappyAtAll happyReduce_5 = happyReduce 6 7 happyReduction_5 happyReduction_5 ((HappyAbsSyn10 happy_var_6) `HappyStk` _ `HappyStk` (HappyTerminal (TokenInfo happy_var_4 TokCodeQuote)) `HappyStk` _ `HappyStk` (HappyAbsSyn8 happy_var_2) `HappyStk` (HappyTerminal (TokenInfo happy_var_1 TokId)) `HappyStk` happyRest) = HappyAbsSyn7 (Rule happy_var_1 happy_var_2 happy_var_6 (Just happy_var_4) ) `HappyStk` happyRest happyReduce_6 = happyReduce 7 7 happyReduction_6 happyReduction_6 ((HappyAbsSyn10 happy_var_7) `HappyStk` _ `HappyStk` _ `HappyStk` (HappyTerminal (TokenInfo happy_var_4 TokCodeQuote)) `HappyStk` _ `HappyStk` (HappyAbsSyn8 happy_var_2) `HappyStk` (HappyTerminal (TokenInfo happy_var_1 TokId)) `HappyStk` happyRest) = HappyAbsSyn7 (Rule happy_var_1 happy_var_2 happy_var_7 (Just happy_var_4) ) `HappyStk` happyRest happyReduce_7 = happyReduce 4 7 happyReduction_7 happyReduction_7 ((HappyAbsSyn10 happy_var_4) `HappyStk` _ `HappyStk` (HappyAbsSyn8 happy_var_2) `HappyStk` (HappyTerminal (TokenInfo happy_var_1 TokId)) `HappyStk` happyRest) = HappyAbsSyn7 (Rule happy_var_1 happy_var_2 happy_var_4 Nothing ) `HappyStk` happyRest happyReduce_8 = happySpecReduce_3 8 happyReduction_8 happyReduction_8 _ (HappyAbsSyn8 happy_var_2) _ = HappyAbsSyn8 (reverse happy_var_2 ) happyReduction_8 _ _ _ = notHappyAtAll happyReduce_9 = happySpecReduce_0 8 happyReduction_9 happyReduction_9 = HappyAbsSyn8 ([] ) happyReduce_10 = happySpecReduce_1 9 happyReduction_10 happyReduction_10 (HappyTerminal (TokenInfo happy_var_1 TokId)) = HappyAbsSyn8 ([happy_var_1] ) happyReduction_10 _ = notHappyAtAll happyReduce_11 = happySpecReduce_3 9 happyReduction_11 happyReduction_11 (HappyTerminal (TokenInfo happy_var_3 TokId)) _ (HappyAbsSyn8 happy_var_1) = HappyAbsSyn8 (happy_var_3 : happy_var_1 ) happyReduction_11 _ _ _ = notHappyAtAll happyReduce_12 = happySpecReduce_3 10 happyReduction_12 happyReduction_12 (HappyAbsSyn10 happy_var_3) _ (HappyAbsSyn11 happy_var_1) = HappyAbsSyn10 (happy_var_1 : happy_var_3 ) happyReduction_12 _ _ _ = notHappyAtAll happyReduce_13 = happySpecReduce_1 10 happyReduction_13 happyReduction_13 (HappyAbsSyn11 happy_var_1) = HappyAbsSyn10 ([happy_var_1] ) happyReduction_13 _ = notHappyAtAll happyReduce_14 = happyMonadReduce 4 11 happyReduction_14 happyReduction_14 (_ `HappyStk` (HappyTerminal (TokenInfo happy_var_3 TokCodeQuote)) `HappyStk` (HappyAbsSyn16 happy_var_2) `HappyStk` (HappyAbsSyn13 happy_var_1) `HappyStk` happyRest) tk = happyThen ((( lineP >>= \l -> return (Prod happy_var_1 happy_var_3 l happy_var_2))) ) (\r -> happyReturn (HappyAbsSyn11 r)) happyReduce_15 = happyMonadReduce 3 11 happyReduction_15 happyReduction_15 ((HappyTerminal (TokenInfo happy_var_3 TokCodeQuote)) `HappyStk` (HappyAbsSyn16 happy_var_2) `HappyStk` (HappyAbsSyn13 happy_var_1) `HappyStk` happyRest) tk = happyThen ((( lineP >>= \l -> return (Prod happy_var_1 happy_var_3 l happy_var_2))) ) (\r -> happyReturn (HappyAbsSyn11 r)) happyReduce_16 = happySpecReduce_1 12 happyReduction_16 happyReduction_16 (HappyTerminal (TokenInfo happy_var_1 TokId)) = HappyAbsSyn12 (App happy_var_1 [] ) happyReduction_16 _ = notHappyAtAll happyReduce_17 = happyReduce 4 12 happyReduction_17 happyReduction_17 (_ `HappyStk` (HappyAbsSyn13 happy_var_3) `HappyStk` _ `HappyStk` (HappyTerminal (TokenInfo happy_var_1 TokId)) `HappyStk` happyRest) = HappyAbsSyn12 (App happy_var_1 (reverse happy_var_3) ) `HappyStk` happyRest happyReduce_18 = happySpecReduce_1 13 happyReduction_18 happyReduction_18 (HappyAbsSyn13 happy_var_1) = HappyAbsSyn13 (reverse happy_var_1 ) happyReduction_18 _ = notHappyAtAll happyReduce_19 = happySpecReduce_0 13 happyReduction_19 happyReduction_19 = HappyAbsSyn13 ([] ) happyReduce_20 = happySpecReduce_1 14 happyReduction_20 happyReduction_20 (HappyAbsSyn12 happy_var_1) = HappyAbsSyn13 ([happy_var_1] ) happyReduction_20 _ = notHappyAtAll happyReduce_21 = happySpecReduce_2 14 happyReduction_21 happyReduction_21 (HappyAbsSyn12 happy_var_2) (HappyAbsSyn13 happy_var_1) = HappyAbsSyn13 (happy_var_2 : happy_var_1 ) happyReduction_21 _ _ = notHappyAtAll happyReduce_22 = happySpecReduce_1 15 happyReduction_22 happyReduction_22 (HappyAbsSyn12 happy_var_1) = HappyAbsSyn13 ([happy_var_1] ) happyReduction_22 _ = notHappyAtAll happyReduce_23 = happySpecReduce_3 15 happyReduction_23 happyReduction_23 (HappyAbsSyn12 happy_var_3) _ (HappyAbsSyn13 happy_var_1) = HappyAbsSyn13 (happy_var_3 : happy_var_1 ) happyReduction_23 _ _ _ = notHappyAtAll happyReduce_24 = happySpecReduce_2 16 happyReduction_24 happyReduction_24 (HappyTerminal (TokenInfo happy_var_2 TokId)) _ = HappyAbsSyn16 (PrecId happy_var_2 ) happyReduction_24 _ _ = notHappyAtAll happyReduce_25 = happySpecReduce_1 16 happyReduction_25 happyReduction_25 _ = HappyAbsSyn16 (PrecShift ) happyReduce_26 = happySpecReduce_0 16 happyReduction_26 happyReduction_26 = HappyAbsSyn16 (PrecNone ) happyReduce_27 = happySpecReduce_2 17 happyReduction_27 happyReduction_27 (HappyAbsSyn18 happy_var_2) (HappyAbsSyn17 happy_var_1) = HappyAbsSyn17 (happy_var_2 : happy_var_1 ) happyReduction_27 _ _ = notHappyAtAll happyReduce_28 = happySpecReduce_1 17 happyReduction_28 happyReduction_28 (HappyAbsSyn18 happy_var_1) = HappyAbsSyn17 ([happy_var_1] ) happyReduction_28 _ = notHappyAtAll happyReduce_29 = happySpecReduce_2 18 happyReduction_29 happyReduction_29 (HappyTerminal (TokenInfo happy_var_2 TokCodeQuote)) _ = HappyAbsSyn18 (TokenType happy_var_2 ) happyReduction_29 _ _ = notHappyAtAll happyReduce_30 = happySpecReduce_2 18 happyReduction_30 happyReduction_30 (HappyAbsSyn20 happy_var_2) _ = HappyAbsSyn18 (TokenSpec happy_var_2 ) happyReduction_30 _ _ = notHappyAtAll happyReduce_31 = happySpecReduce_3 18 happyReduction_31 happyReduction_31 (HappyAbsSyn19 happy_var_3) (HappyTerminal (TokenInfo happy_var_2 TokId)) _ = HappyAbsSyn18 (TokenName happy_var_2 happy_var_3 False ) happyReduction_31 _ _ _ = notHappyAtAll happyReduce_32 = happySpecReduce_3 18 happyReduction_32 happyReduction_32 (HappyAbsSyn19 happy_var_3) (HappyTerminal (TokenInfo happy_var_2 TokId)) _ = HappyAbsSyn18 (TokenName happy_var_2 happy_var_3 True ) happyReduction_32 _ _ _ = notHappyAtAll happyReduce_33 = happySpecReduce_1 18 happyReduction_33 happyReduction_33 _ = HappyAbsSyn18 (TokenImportedIdentity ) happyReduce_34 = happySpecReduce_3 18 happyReduction_34 happyReduction_34 (HappyTerminal (TokenInfo happy_var_3 TokCodeQuote)) (HappyTerminal (TokenInfo happy_var_2 TokCodeQuote)) _ = HappyAbsSyn18 (TokenLexer happy_var_2 happy_var_3 ) happyReduction_34 _ _ _ = notHappyAtAll happyReduce_35 = happySpecReduce_2 18 happyReduction_35 happyReduction_35 (HappyTerminal (TokenInfo happy_var_2 TokCodeQuote)) _ = HappyAbsSyn18 (TokenMonad "()" happy_var_2 "Prelude.>>=" "Prelude.return" ) happyReduction_35 _ _ = notHappyAtAll happyReduce_36 = happySpecReduce_3 18 happyReduction_36 happyReduction_36 (HappyTerminal (TokenInfo happy_var_3 TokCodeQuote)) (HappyTerminal (TokenInfo happy_var_2 TokCodeQuote)) _ = HappyAbsSyn18 (TokenMonad happy_var_2 happy_var_3 "Prelude.>>=" "Prelude.return" ) happyReduction_36 _ _ _ = notHappyAtAll happyReduce_37 = happyReduce 4 18 happyReduction_37 happyReduction_37 ((HappyTerminal (TokenInfo happy_var_4 TokCodeQuote)) `HappyStk` (HappyTerminal (TokenInfo happy_var_3 TokCodeQuote)) `HappyStk` (HappyTerminal (TokenInfo happy_var_2 TokCodeQuote)) `HappyStk` _ `HappyStk` happyRest) = HappyAbsSyn18 (TokenMonad "()" happy_var_2 happy_var_3 happy_var_4 ) `HappyStk` happyRest happyReduce_38 = happyReduce 5 18 happyReduction_38 happyReduction_38 ((HappyTerminal (TokenInfo happy_var_5 TokCodeQuote)) `HappyStk` (HappyTerminal (TokenInfo happy_var_4 TokCodeQuote)) `HappyStk` (HappyTerminal (TokenInfo happy_var_3 TokCodeQuote)) `HappyStk` (HappyTerminal (TokenInfo happy_var_2 TokCodeQuote)) `HappyStk` _ `HappyStk` happyRest) = HappyAbsSyn18 (TokenMonad happy_var_2 happy_var_3 happy_var_4 happy_var_5 ) `HappyStk` happyRest happyReduce_39 = happySpecReduce_2 18 happyReduction_39 happyReduction_39 (HappyAbsSyn8 happy_var_2) _ = HappyAbsSyn18 (TokenNonassoc happy_var_2 ) happyReduction_39 _ _ = notHappyAtAll happyReduce_40 = happySpecReduce_2 18 happyReduction_40 happyReduction_40 (HappyAbsSyn8 happy_var_2) _ = HappyAbsSyn18 (TokenRight happy_var_2 ) happyReduction_40 _ _ = notHappyAtAll happyReduce_41 = happySpecReduce_2 18 happyReduction_41 happyReduction_41 (HappyAbsSyn8 happy_var_2) _ = HappyAbsSyn18 (TokenLeft happy_var_2 ) happyReduction_41 _ _ = notHappyAtAll happyReduce_42 = happySpecReduce_2 18 happyReduction_42 happyReduction_42 (HappyTerminal (TokenNum happy_var_2 TokNum)) _ = HappyAbsSyn18 (TokenExpect happy_var_2 ) happyReduction_42 _ _ = notHappyAtAll happyReduce_43 = happySpecReduce_2 18 happyReduction_43 happyReduction_43 (HappyTerminal (TokenInfo happy_var_2 TokCodeQuote)) _ = HappyAbsSyn18 (TokenError happy_var_2 ) happyReduction_43 _ _ = notHappyAtAll happyReduce_44 = happySpecReduce_2 18 happyReduction_44 happyReduction_44 (HappyTerminal (TokenInfo happy_var_2 TokId)) _ = HappyAbsSyn18 (TokenErrorHandlerType happy_var_2 ) happyReduction_44 _ _ = notHappyAtAll happyReduce_45 = happySpecReduce_2 18 happyReduction_45 happyReduction_45 (HappyTerminal (TokenInfo happy_var_2 TokCodeQuote)) _ = HappyAbsSyn18 (TokenAttributetype happy_var_2 ) happyReduction_45 _ _ = notHappyAtAll happyReduce_46 = happySpecReduce_3 18 happyReduction_46 happyReduction_46 (HappyTerminal (TokenInfo happy_var_3 TokCodeQuote)) (HappyTerminal (TokenInfo happy_var_2 TokId)) _ = HappyAbsSyn18 (TokenAttribute happy_var_2 happy_var_3 ) happyReduction_46 _ _ _ = notHappyAtAll happyReduce_47 = happySpecReduce_1 19 happyReduction_47 happyReduction_47 (HappyTerminal (TokenInfo happy_var_1 TokId)) = HappyAbsSyn19 (Just happy_var_1 ) happyReduction_47 _ = notHappyAtAll happyReduce_48 = happySpecReduce_0 19 happyReduction_48 happyReduction_48 = HappyAbsSyn19 (Nothing ) happyReduce_49 = happySpecReduce_2 20 happyReduction_49 happyReduction_49 (HappyAbsSyn20 happy_var_2) (HappyAbsSyn21 happy_var_1) = HappyAbsSyn20 (happy_var_1:happy_var_2 ) happyReduction_49 _ _ = notHappyAtAll happyReduce_50 = happySpecReduce_1 20 happyReduction_50 happyReduction_50 (HappyAbsSyn21 happy_var_1) = HappyAbsSyn20 ([happy_var_1] ) happyReduction_50 _ = notHappyAtAll happyReduce_51 = happySpecReduce_2 21 happyReduction_51 happyReduction_51 (HappyTerminal (TokenInfo happy_var_2 TokCodeQuote)) (HappyTerminal (TokenInfo happy_var_1 TokId)) = HappyAbsSyn21 ((happy_var_1,happy_var_2) ) happyReduction_51 _ _ = notHappyAtAll happyReduce_52 = happySpecReduce_2 22 happyReduction_52 happyReduction_52 (HappyAbsSyn8 happy_var_2) (HappyTerminal (TokenInfo happy_var_1 TokId)) = HappyAbsSyn8 (happy_var_1 : happy_var_2 ) happyReduction_52 _ _ = notHappyAtAll happyReduce_53 = happySpecReduce_0 22 happyReduction_53 happyReduction_53 = HappyAbsSyn8 ([] ) happyReduce_54 = happySpecReduce_1 23 happyReduction_54 happyReduction_54 (HappyTerminal (TokenInfo happy_var_1 TokCodeQuote)) = HappyAbsSyn19 (Just happy_var_1 ) happyReduction_54 _ = notHappyAtAll happyReduce_55 = happySpecReduce_0 23 happyReduction_55 happyReduction_55 = HappyAbsSyn19 (Nothing ) happyNewToken action sts stk = lexTokenP(\tk -> let cont i = action i i tk (HappyState action) sts stk in case tk of { TokenEOF -> action 52 52 tk (HappyState action) sts stk; TokenInfo happy_dollar_dollar TokId -> cont 24; TokenKW TokSpecId_TokenType -> cont 25; TokenKW TokSpecId_Token -> cont 26; TokenKW TokSpecId_Name -> cont 27; TokenKW TokSpecId_Partial -> cont 28; TokenKW TokSpecId_Lexer -> cont 29; TokenKW TokSpecId_ImportedIdentity -> cont 30; TokenKW TokSpecId_Monad -> cont 31; TokenKW TokSpecId_Nonassoc -> cont 32; TokenKW TokSpecId_Left -> cont 33; TokenKW TokSpecId_Right -> cont 34; TokenKW TokSpecId_Prec -> cont 35; TokenKW TokSpecId_Shift -> cont 36; TokenKW TokSpecId_Expect -> cont 37; TokenKW TokSpecId_Error -> cont 38; TokenKW TokSpecId_ErrorHandlerType -> cont 39; TokenKW TokSpecId_Attribute -> cont 40; TokenKW TokSpecId_Attributetype -> cont 41; TokenInfo happy_dollar_dollar TokCodeQuote -> cont 42; TokenNum happy_dollar_dollar TokNum -> cont 43; TokenKW TokColon -> cont 44; TokenKW TokSemiColon -> cont 45; TokenKW TokDoubleColon -> cont 46; TokenKW TokDoublePercent -> cont 47; TokenKW TokBar -> cont 48; TokenKW TokParenL -> cont 49; TokenKW TokParenR -> cont 50; TokenKW TokComma -> cont 51; _ -> happyError' (tk, []) }) happyError_ explist 52 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' :: () => ((Token), [Prelude.String]) -> P a happyError' tk = (\(tokens, explist) -> happyError) tk ourParser = 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.