module XML.Selectors.CSS.Parse (parsePath) where
import XML.Selectors.CSS.Tokens (lexer)
import XML.Selectors.CSS.Types
import qualified Data.Array as Happy_Data_Array
import qualified GHC.Exts as Happy_GHC_Exts
newtype HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12 = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
happyIn4 :: t4 -> (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12)
happyIn4 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut4 :: (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12) -> t4
happyOut4 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn5 :: t5 -> (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12)
happyIn5 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut5 :: (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12) -> t5
happyOut5 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn6 :: t6 -> (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12)
happyIn6 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut6 :: (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12) -> t6
happyOut6 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn7 :: t7 -> (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12)
happyIn7 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut7 :: (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12) -> t7
happyOut7 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn8 :: t8 -> (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12)
happyIn8 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut8 :: (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12) -> t8
happyOut8 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn9 :: t9 -> (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12)
happyIn9 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut9 :: (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12) -> t9
happyOut9 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn10 :: t10 -> (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12)
happyIn10 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut10 :: (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12) -> t10
happyOut10 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn11 :: t11 -> (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12)
happyIn11 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut11 :: (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12) -> t11
happyOut11 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn12 :: t12 -> (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12)
happyIn12 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut12 :: (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12) -> t12
happyOut12 x = Happy_GHC_Exts.unsafeCoerce# x
happyInTok :: (Token) -> (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12)
happyInTok x = Happy_GHC_Exts.unsafeCoerce# x
happyOutTok :: (HappyAbsSyn t4 t5 t6 t7 t8 t9 t10 t11 t12) -> (Token)
happyOutTok x = Happy_GHC_Exts.unsafeCoerce# x
happyActOffsets :: HappyAddr
happyActOffsets = HappyA# "\xff\xff\xff\xff\x00\x00\x0a\x00\x00\x00\x11\x00\x3d\x00\x3c\x00\x36\x00\x00\x00\x24\x00\x05\x00\xff\xff\x05\x00\x3b\x00\x3a\x00\x39\x00\x02\x00\x36\x00\x01\x00\x00\x00\x00\x00\x0a\x00\x00\x00\x00\x00\x2b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x23\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x00\x00\x00\x00\x00\x00\x00"#
happyGotoOffsets :: HappyAddr
happyGotoOffsets = HappyA# "\x25\x00\x2e\x00\x00\x00\x27\x00\x00\x00\x29\x00\x00\x00\x00\x00\x14\x00\x00\x00\x00\x00\x09\x00\x1e\x00\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x2d\x00\x00\x00\x00\x00\x26\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#
happyDefActions :: HappyAddr
happyDefActions = HappyA# "\x00\x00\x00\x00\x00\x00\xf1\xff\xee\xff\xf4\xff\x00\x00\x00\x00\x00\x00\xef\xff\x00\x00\xfe\xff\x00\x00\xfc\xff\xfa\xff\xf6\xff\xf8\xff\x00\x00\x00\x00\x00\x00\xeb\xff\xec\xff\xf3\xff\xed\xff\xf0\xff\x00\x00\xde\xff\xdd\xff\xf2\xff\xe8\xff\x00\x00\x00\x00\xe3\xff\xe2\xff\xe0\xff\xdf\xff\xe1\xff\xe7\xff\x00\x00\xea\xff\xf7\xff\xf5\xff\xf9\xff\xfb\xff\xfd\xff\xe9\xff\xe6\xff\x00\x00\xe4\xff\xe5\xff"#
happyCheck :: HappyAddr
happyCheck = HappyA# "\xff\xff\x02\x00\x01\x00\x01\x00\x01\x00\x01\x00\x01\x00\x03\x00\x09\x00\x04\x00\x01\x00\x0c\x00\x07\x00\x08\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x09\x00\x15\x00\x05\x00\x0c\x00\x18\x00\x16\x00\x05\x00\x09\x00\x03\x00\x12\x00\x0c\x00\x00\x00\x15\x00\x02\x00\x03\x00\x04\x00\x06\x00\x07\x00\x00\x00\x15\x00\x02\x00\x03\x00\x04\x00\x04\x00\x04\x00\x03\x00\x04\x00\x08\x00\x08\x00\x02\x00\x03\x00\x04\x00\x06\x00\x07\x00\x0a\x00\x0b\x00\x01\x00\x02\x00\x16\x00\x01\x00\x01\x00\x01\x00\x19\x00\x02\x00\x02\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"#
happyTable :: HappyAddr
happyTable = HappyA# "\x00\x00\x06\x00\x20\x00\x27\x00\x2b\x00\x30\x00\x0e\x00\x31\x00\x07\x00\x0f\x00\x0c\x00\x08\x00\x10\x00\x11\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x07\x00\x09\x00\x25\x00\x08\x00\x0a\x00\x28\x00\x11\x00\x07\x00\x32\x00\x1a\x00\x08\x00\x2c\x00\x09\x00\x0b\x00\x03\x00\x04\x00\x2e\x00\x1e\x00\x0a\x00\x09\x00\x0b\x00\x03\x00\x04\x00\x17\x00\x17\x00\x16\x00\x04\x00\x1c\x00\x18\x00\x02\x00\x03\x00\x04\x00\x1d\x00\x1e\x00\x1b\x00\x1c\x00\x13\x00\x14\x00\x2e\x00\x29\x00\x2a\x00\x2b\x00\xff\xff\x15\x00\x16\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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 (1, 34) [
(1 , happyReduce_1),
(2 , happyReduce_2),
(3 , happyReduce_3),
(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)
]
happy_n_terms = 26 :: Int
happy_n_nonterms = 9 :: Int
happyReduce_1 = happySpecReduce_1 0# happyReduction_1
happyReduction_1 happy_x_1
= case happyOut6 happy_x_1 of { happy_var_1 ->
happyIn4
(Selector happy_var_1
)}
happyReduce_2 = happySpecReduce_3 0# happyReduction_2
happyReduction_2 happy_x_3
happy_x_2
happy_x_1
= case happyOut6 happy_x_1 of { happy_var_1 ->
case happyOut5 happy_x_2 of { happy_var_2 ->
case happyOut4 happy_x_3 of { happy_var_3 ->
happyIn4
(Combinator happy_var_1 happy_var_2 happy_var_3
)}}}
happyReduce_3 = happySpecReduce_1 1# happyReduction_3
happyReduction_3 happy_x_1
= happyIn5
(Descendant
)
happyReduce_4 = happySpecReduce_2 1# happyReduction_4
happyReduction_4 happy_x_2
happy_x_1
= case happyOut5 happy_x_2 of { happy_var_2 ->
happyIn5
(happy_var_2
)}
happyReduce_5 = happySpecReduce_1 1# happyReduction_5
happyReduction_5 happy_x_1
= happyIn5
(FollowingSibling
)
happyReduce_6 = happySpecReduce_2 1# happyReduction_6
happyReduction_6 happy_x_2
happy_x_1
= happyIn5
(FollowingSibling
)
happyReduce_7 = happySpecReduce_1 1# happyReduction_7
happyReduction_7 happy_x_1
= happyIn5
(AnySibling
)
happyReduce_8 = happySpecReduce_2 1# happyReduction_8
happyReduction_8 happy_x_2
happy_x_1
= happyIn5
(AnySibling
)
happyReduce_9 = happySpecReduce_1 1# happyReduction_9
happyReduction_9 happy_x_1
= happyIn5
(Child
)
happyReduce_10 = happySpecReduce_2 1# happyReduction_10
happyReduction_10 happy_x_2
happy_x_1
= happyIn5
(Child
)
happyReduce_11 = happySpecReduce_1 2# happyReduction_11
happyReduction_11 happy_x_1
= case happyOutTok happy_x_1 of { (TokenName happy_var_1) ->
happyIn6
(SimpleSelector (Just happy_var_1) [] Nothing
)}
happyReduce_12 = happySpecReduce_2 2# happyReduction_12
happyReduction_12 happy_x_2
happy_x_1
= case happyOutTok happy_x_1 of { (TokenName happy_var_1) ->
case happyOut7 happy_x_2 of { happy_var_2 ->
happyIn6
(SimpleSelector (Just happy_var_1) happy_var_2 Nothing
)}}
happyReduce_13 = happySpecReduce_3 2# happyReduction_13
happyReduction_13 happy_x_3
happy_x_2
happy_x_1
= case happyOutTok happy_x_1 of { (TokenName happy_var_1) ->
case happyOut7 happy_x_2 of { happy_var_2 ->
case happyOut12 happy_x_3 of { happy_var_3 ->
happyIn6
(SimpleSelector (Just happy_var_1) happy_var_2 (Just happy_var_3)
)}}}
happyReduce_14 = happySpecReduce_1 2# happyReduction_14
happyReduction_14 happy_x_1
= case happyOut7 happy_x_1 of { happy_var_1 ->
happyIn6
(SimpleSelector Nothing happy_var_1 Nothing
)}
happyReduce_15 = happySpecReduce_2 2# happyReduction_15
happyReduction_15 happy_x_2
happy_x_1
= case happyOut7 happy_x_1 of { happy_var_1 ->
case happyOut12 happy_x_2 of { happy_var_2 ->
happyIn6
(SimpleSelector Nothing happy_var_1 (Just happy_var_2)
)}}
happyReduce_16 = happySpecReduce_1 2# happyReduction_16
happyReduction_16 happy_x_1
= happyIn6
(Universal
)
happyReduce_17 = happySpecReduce_1 3# happyReduction_17
happyReduction_17 happy_x_1
= case happyOut8 happy_x_1 of { happy_var_1 ->
happyIn7
([happy_var_1]
)}
happyReduce_18 = happySpecReduce_2 3# happyReduction_18
happyReduction_18 happy_x_2
happy_x_1
= case happyOut7 happy_x_1 of { happy_var_1 ->
case happyOut8 happy_x_2 of { happy_var_2 ->
happyIn7
(happy_var_2 : happy_var_1
)}}
happyReduce_19 = happySpecReduce_2 4# happyReduction_19
happyReduction_19 happy_x_2
happy_x_1
= case happyOutTok happy_x_2 of { (TokenName happy_var_2) ->
happyIn8
(ID happy_var_2
)}
happyReduce_20 = happySpecReduce_2 4# happyReduction_20
happyReduction_20 happy_x_2
happy_x_1
= case happyOutTok happy_x_2 of { (TokenName happy_var_2) ->
happyIn8
(Class happy_var_2
)}
happyReduce_21 = happySpecReduce_3 4# happyReduction_21
happyReduction_21 happy_x_3
happy_x_2
happy_x_1
= case happyOut9 happy_x_2 of { happy_var_2 ->
happyIn8
(happy_var_2
)}
happyReduce_22 = happyReduce 4# 4# happyReduction_22
happyReduction_22 (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 ->
happyIn8
(happy_var_2
) `HappyStk` happyRest}
happyReduce_23 = happySpecReduce_2 5# happyReduction_23
happyReduction_23 happy_x_2
happy_x_1
= case happyOutTok happy_x_1 of { (TokenName happy_var_1) ->
case happyOut10 happy_x_2 of { happy_var_2 ->
happyIn9
(Attrib happy_var_1 happy_var_2
)}}
happyReduce_24 = happySpecReduce_2 5# happyReduction_24
happyReduction_24 happy_x_2
happy_x_1
= case happyOut9 happy_x_2 of { happy_var_2 ->
happyIn9
(happy_var_2
)}
happyReduce_25 = happySpecReduce_2 6# happyReduction_25
happyReduction_25 happy_x_2
happy_x_1
= case happyOut10 happy_x_2 of { happy_var_2 ->
happyIn10
(happy_var_2
)}
happyReduce_26 = happySpecReduce_3 6# happyReduction_26
happyReduction_26 happy_x_3
happy_x_2
happy_x_1
= case happyOut11 happy_x_1 of { happy_var_1 ->
case happyOutTok happy_x_3 of { (TokenString happy_var_3) ->
happyIn10
(Pred happy_var_1 happy_var_3
)}}
happyReduce_27 = happySpecReduce_2 6# happyReduction_27
happyReduction_27 happy_x_2
happy_x_1
= case happyOut11 happy_x_1 of { happy_var_1 ->
case happyOutTok happy_x_2 of { (TokenString happy_var_2) ->
happyIn10
(Pred happy_var_1 happy_var_2
)}}
happyReduce_28 = happySpecReduce_1 7# happyReduction_28
happyReduction_28 happy_x_1
= happyIn11
(Equals
)
happyReduce_29 = happySpecReduce_1 7# happyReduction_29
happyReduction_29 happy_x_1
= happyIn11
(Includes
)
happyReduce_30 = happySpecReduce_1 7# happyReduction_30
happyReduction_30 happy_x_1
= happyIn11
(DashMatch
)
happyReduce_31 = happySpecReduce_1 7# happyReduction_31
happyReduction_31 happy_x_1
= happyIn11
(BeginsWith
)
happyReduce_32 = happySpecReduce_1 7# happyReduction_32
happyReduction_32 happy_x_1
= happyIn11
(EndsWith
)
happyReduce_33 = happySpecReduce_2 8# happyReduction_33
happyReduction_33 happy_x_2
happy_x_1
= happyIn12
(FirstChild
)
happyReduce_34 = happySpecReduce_2 8# happyReduction_34
happyReduction_34 happy_x_2
happy_x_1
= happyIn12
(LastChild
)
happyNewToken action sts stk [] =
happyDoAction 25# notHappyAtAll action sts stk []
happyNewToken action sts stk (tk:tks) =
let cont i = happyDoAction i tk action sts stk tks in
case tk of {
TokenSpace -> cont 1#;
TokenName happy_dollar_dollar -> cont 2#;
TokenString happy_dollar_dollar -> cont 3#;
TokenPlus -> cont 4#;
TokenMinus -> cont 5#;
TokenSlash -> cont 6#;
TokenChild -> cont 7#;
TokenAnySibling -> cont 8#;
TokenHash -> cont 9#;
TokenFirstChild -> cont 10#;
TokenLastChild -> cont 11#;
TokenDot -> cont 12#;
TokenEquals -> cont 13#;
TokenIncludes -> cont 14#;
TokenBeginsWith -> cont 15#;
TokenEndsWith -> cont 16#;
TokenDashMatch -> cont 17#;
TokenPseudo -> cont 18#;
TokenOP -> cont 19#;
TokenCP -> cont 20#;
TokenOB -> cont 21#;
TokenCB -> cont 22#;
TokenDigits happy_dollar_dollar -> cont 23#;
TokenAster -> cont 24#;
_ -> happyError' (tk:tks)
}
happyError_ 25# tk tks = happyError' tks
happyError_ _ tk tks = happyError' (tk:tks)
happyThen :: () => Either String a -> (a -> Either String b) -> Either String b
happyThen = (>>=)
happyReturn :: () => a -> Either String a
happyReturn = (return)
happyThen1 m k tks = (>>=) m (\a -> k a tks)
happyReturn1 :: () => a -> b -> Either String a
happyReturn1 = \a tks -> (return) a
happyError' :: () => [(Token)] -> Either String a
happyError' = parseError
cssPath tks = happySomeParser where
happySomeParser = happyThen (happyParse 0# tks) (\x -> happyReturn (happyOut4 x))
happySeq = happyDontSeq
parseError toks = Left $ "parse error: " ++ show toks
parsePath :: String -> Either String Selector
parsePath str = lexer str >>= cssPath
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 i tk st
1# ->
happyAccept i tk st
n | (n Happy_GHC_Exts.<# (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) = indexShortOffAddr happyActOffsets st
(off_i) = (off Happy_GHC_Exts.+# i)
check = if (off_i Happy_GHC_Exts.>=# (0# :: Happy_GHC_Exts.Int#))
then (indexShortOffAddr happyCheck off_i Happy_GHC_Exts.==# 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#
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 =
happyThen1 (fn stk tk) (\r -> happyGoto nt j tk st1 sts1 (r `HappyStk` drop_stk))
where (sts1@((HappyCons (st1@(action)) (_)))) = happyDrop k (HappyCons (st) (sts))
drop_stk = happyDropStk k 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 =
happyThen1 (fn stk tk) (\r -> happyNewToken new_state sts1 (r `HappyStk` drop_stk))
where (sts1@((HappyCons (st1@(action)) (_)))) = happyDrop k (HappyCons (st) (sts))
drop_stk = happyDropStk k stk
(off) = indexShortOffAddr happyGotoOffsets st1
(off_i) = (off Happy_GHC_Exts.+# nt)
(new_state) = indexShortOffAddr happyTable off_i
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) = indexShortOffAddr happyGotoOffsets st
(off_i) = (off Happy_GHC_Exts.+# nt)
(new_state) = indexShortOffAddr happyTable off_i
happyFail 0# tk old_st _ stk@(x `HappyStk` _) =
let (i) = (case Happy_GHC_Exts.unsafeCoerce# x of { (Happy_GHC_Exts.I# (i)) -> i }) in
happyError_ i tk
happyFail 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