module Bindings.Bfd.Disasm.I386.Parse where
import Data.Array
import qualified Data.IntMap as IntMap
import qualified Data.Map as Map
import Data.Maybe
import Data.Word
import Bindings.Bfd.Disasm.I386.Address
import Bindings.Bfd.Disasm.I386.EffectiveAddr
import Bindings.Bfd.Disasm.I386.Insn as I
import Bindings.Bfd.Disasm.I386.Lex as L
import Bindings.Bfd.Disasm.I386.Mnemonic as R
import Bindings.Bfd.Disasm.I386.Operand as O
import Bindings.Bfd.Disasm.I386.Prefix
import qualified Data.Array as Happy_Data_Array
import qualified GHC.Exts as Happy_GHC_Exts
newtype HappyAbsSyn = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
happyIn4 :: (Insn) -> (HappyAbsSyn )
happyIn4 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut4 :: (HappyAbsSyn ) -> (Insn)
happyOut4 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn5 :: ([Operand]) -> (HappyAbsSyn )
happyIn5 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut5 :: (HappyAbsSyn ) -> ([Operand])
happyOut5 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn6 :: (Maybe Address) -> (HappyAbsSyn )
happyIn6 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut6 :: (HappyAbsSyn ) -> (Maybe Address)
happyOut6 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn7 :: (Operand) -> (HappyAbsSyn )
happyIn7 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut7 :: (HappyAbsSyn ) -> (Operand)
happyOut7 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn8 :: (Operand) -> (HappyAbsSyn )
happyIn8 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut8 :: (HappyAbsSyn ) -> (Operand)
happyOut8 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn9 :: (Operand) -> (HappyAbsSyn )
happyIn9 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut9 :: (HappyAbsSyn ) -> (Operand)
happyOut9 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn10 :: (Operand) -> (HappyAbsSyn )
happyIn10 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut10 :: (HappyAbsSyn ) -> (Operand)
happyOut10 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn11 :: (Operand) -> (HappyAbsSyn )
happyIn11 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut11 :: (HappyAbsSyn ) -> (Operand)
happyOut11 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn12 :: (Operand) -> (HappyAbsSyn )
happyIn12 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut12 :: (HappyAbsSyn ) -> (Operand)
happyOut12 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn13 :: ((EffectiveAddr, Maybe Int)) -> (HappyAbsSyn )
happyIn13 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut13 :: (HappyAbsSyn ) -> ((EffectiveAddr, Maybe Int))
happyOut13 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn14 :: (EffectiveAddr) -> (HappyAbsSyn )
happyIn14 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut14 :: (HappyAbsSyn ) -> (EffectiveAddr)
happyOut14 x = Happy_GHC_Exts.unsafeCoerce# x
happyInTok :: (Token) -> (HappyAbsSyn )
happyInTok x = Happy_GHC_Exts.unsafeCoerce# x
happyOutTok :: (HappyAbsSyn ) -> (Token)
happyOutTok x = Happy_GHC_Exts.unsafeCoerce# x
happyActOffsets :: HappyAddr
happyActOffsets = HappyA# "\x3f\x00\x59\x00\x01\x00\x55\x00\x01\x00\x00\x00\x00\x00\x57\x00\x56\x00\x00\x00\x31\x00\x53\x00\x00\x00\x00\x00\x4f\x00\x00\x00\x00\x00\x52\x00\x26\x00\x23\x00\x00\x00\x00\x00\x00\x00\x39\x00\x54\x00\x2a\x00\x00\x00\x00\x00\x51\x00\x00\x00\x21\x00\x04\x00\x21\x00\x50\x00\x2c\x00\x00\x00\x00\x00\x4d\x00\x4d\x00\x00\x00\x00\x00\x00\x00\x4c\x00\x00\x00\x4b\x00\x49\x00\x4e\x00\x00\x00\x00\x00\x00\x00\x48\x00\x48\x00\x00\x00\x00\x00\x41\x00\x45\x00\x4a\x00\x42\x00\x00\x00\x00\x00\x00\x00\x00\x00"#
happyGotoOffsets :: HappyAddr
happyGotoOffsets = HappyA# "\x3b\x00\x00\x00\x15\x00\x00\x00\x0b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x47\x00\x46\x00\x00\x00\x00\x00\x3d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x36\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x34\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x1c\x00\x29\x00\x00\x00\x44\x00\x00\x00\x00\x00\x43\x00\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x28\x00\x12\x00\x00\x00\x00\x00\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#
happyDefActions :: HappyAddr
happyDefActions = HappyA# "\x00\x00\x00\x00\xfc\xff\x00\x00\xfc\xff\xfd\xff\xfb\xff\xfa\xff\xf9\xff\xf8\xff\xec\xff\xec\xff\xe6\xff\xe2\xff\xe1\xff\xe9\xff\xea\xff\xe8\xff\x00\x00\x00\x00\xfe\xff\xe4\xff\xe7\xff\x00\x00\x00\x00\x00\x00\xe3\xff\xf6\xff\x00\x00\xf7\xff\x00\x00\x00\x00\x00\x00\xf0\xff\xec\xff\xf3\xff\xf5\xff\xec\xff\xec\xff\xf1\xff\xeb\xff\xe5\xff\x00\x00\xe0\xff\x00\x00\x00\x00\x00\x00\xf2\xff\xf4\xff\xef\xff\x00\x00\x00\x00\xee\xff\xe8\xff\xec\xff\x00\x00\x00\x00\x00\x00\xdf\xff\xed\xff\xde\xff"#
happyCheck :: HappyAddr
happyCheck = HappyA# "\xff\xff\x02\x00\x01\x00\x02\x00\x03\x00\x01\x00\x02\x00\x06\x00\x07\x00\x02\x00\x06\x00\x07\x00\x01\x00\x0c\x00\x03\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x01\x00\x05\x00\x03\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x04\x00\x05\x00\x01\x00\x07\x00\x01\x00\x09\x00\x0a\x00\x06\x00\x07\x00\x06\x00\x07\x00\x01\x00\x06\x00\x05\x00\x05\x00\x09\x00\x07\x00\x07\x00\x09\x00\x0a\x00\x05\x00\x09\x00\x07\x00\x0b\x00\x09\x00\x0a\x00\x09\x00\x00\x00\x0b\x00\x09\x00\x0a\x00\x09\x00\x0a\x00\x08\x00\x09\x00\x04\x00\x05\x00\x02\x00\x02\x00\x0a\x00\x02\x00\x02\x00\x08\x00\x01\x00\x0b\x00\x08\x00\x06\x00\x01\x00\xff\xff\x06\x00\x09\x00\xff\xff\x03\x00\x09\x00\x07\x00\xff\xff\x0b\x00\x09\x00\x06\x00\xff\xff\x0a\x00\x04\x00\x0b\x00\x09\x00\x09\x00\xff\xff\x0d\x00\xff\xff\xff\xff\xff\xff\xff\xff"#
happyTable :: HappyAddr
happyTable = HappyA# "\x00\x00\x3b\x00\x0f\x00\x10\x00\x11\x00\x0f\x00\x10\x00\x12\x00\x13\x00\x2f\x00\x12\x00\x13\x00\x05\x00\x14\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x14\x00\x34\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x23\x00\x24\x00\x0f\x00\x25\x00\x0f\x00\x0c\x00\x0d\x00\x12\x00\x13\x00\x17\x00\x13\x00\x0f\x00\x18\x00\x36\x00\x21\x00\x19\x00\x22\x00\x13\x00\x0c\x00\x0d\x00\x26\x00\x33\x00\x27\x00\x1d\x00\x0c\x00\x0d\x00\x1f\x00\x03\x00\x1d\x00\x29\x00\x0d\x00\x15\x00\x0d\x00\x2c\x00\x2d\x00\x03\x00\x05\x00\x30\x00\x31\x00\x1a\x00\x1b\x00\x1d\x00\x3d\x00\x3a\x00\x1d\x00\x3b\x00\x36\x00\x38\x00\x00\x00\x2e\x00\x39\x00\x00\x00\x29\x00\x2f\x00\x13\x00\x00\x00\x1d\x00\x34\x00\x2b\x00\x00\x00\x1a\x00\x03\x00\x1d\x00\x20\x00\x21\x00\x00\x00\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00"#
happyReduceArr = Happy_Data_Array.array (1, 33) [
(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)
]
happy_n_terms = 14 :: Int
happy_n_nonterms = 11 :: Int
happyReduce_1 = happySpecReduce_2 0# happyReduction_1
happyReduction_1 happy_x_2
happy_x_1
= case happyOutTok happy_x_1 of { (PrefixedMnemonic happy_var_1) ->
case happyOut5 happy_x_2 of { happy_var_2 ->
happyIn4
(Insn (toPrefix $ head happy_var_1) (toMnemonic $ head $ tail happy_var_1) happy_var_2
)}}
happyReduce_2 = happySpecReduce_2 0# happyReduction_2
happyReduction_2 happy_x_2
happy_x_1
= case happyOutTok happy_x_1 of { (L.Mnemonic happy_var_1) ->
case happyOut5 happy_x_2 of { happy_var_2 ->
happyIn4
(Insn (Nothing ) (toMnemonic happy_var_1) happy_var_2
)}}
happyReduce_3 = happySpecReduce_0 1# happyReduction_3
happyReduction_3 = happyIn5
([ ]
)
happyReduce_4 = happySpecReduce_1 1# happyReduction_4
happyReduction_4 happy_x_1
= case happyOut7 happy_x_1 of { happy_var_1 ->
happyIn5
([happy_var_1 ]
)}
happyReduce_5 = happySpecReduce_1 1# happyReduction_5
happyReduction_5 happy_x_1
= case happyOut8 happy_x_1 of { happy_var_1 ->
happyIn5
([happy_var_1 ]
)}
happyReduce_6 = happySpecReduce_1 1# happyReduction_6
happyReduction_6 happy_x_1
= case happyOut9 happy_x_1 of { happy_var_1 ->
happyIn5
([happy_var_1 ]
)}
happyReduce_7 = happySpecReduce_1 1# happyReduction_7
happyReduction_7 happy_x_1
= case happyOut10 happy_x_1 of { happy_var_1 ->
happyIn5
([happy_var_1 ]
)}
happyReduce_8 = happySpecReduce_2 1# happyReduction_8
happyReduction_8 happy_x_2
happy_x_1
= case happyOut11 happy_x_1 of { happy_var_1 ->
case happyOut6 happy_x_2 of { happy_var_2 ->
happyIn5
([happy_var_1 { O.mbAddress = happy_var_2 } ]
)}}
happyReduce_9 = happySpecReduce_2 1# happyReduction_9
happyReduction_9 happy_x_2
happy_x_1
= case happyOut12 happy_x_1 of { happy_var_1 ->
case happyOut6 happy_x_2 of { happy_var_2 ->
happyIn5
([happy_var_1 { O.mbAddress = happy_var_2 } ]
)}}
happyReduce_10 = happySpecReduce_3 1# happyReduction_10
happyReduction_10 happy_x_3
happy_x_2
happy_x_1
= case happyOut9 happy_x_1 of { happy_var_1 ->
case happyOut9 happy_x_3 of { happy_var_3 ->
happyIn5
([happy_var_1 , happy_var_3 ]
)}}
happyReduce_11 = happyReduce 4# 1# happyReduction_11
happyReduction_11 (happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOut9 happy_x_1 of { happy_var_1 ->
case happyOut11 happy_x_3 of { happy_var_3 ->
case happyOut6 happy_x_4 of { happy_var_4 ->
happyIn5
([happy_var_1 , happy_var_3 { O.mbAddress = happy_var_4 } ]
) `HappyStk` happyRest}}}
happyReduce_12 = happySpecReduce_3 1# happyReduction_12
happyReduction_12 happy_x_3
happy_x_2
happy_x_1
= case happyOut9 happy_x_1 of { happy_var_1 ->
case happyOut8 happy_x_3 of { happy_var_3 ->
happyIn5
([happy_var_1 , happy_var_3 ]
)}}
happyReduce_13 = happyReduce 4# 1# happyReduction_13
happyReduction_13 (happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOut11 happy_x_1 of { happy_var_1 ->
case happyOut9 happy_x_3 of { happy_var_3 ->
case happyOut6 happy_x_4 of { happy_var_4 ->
happyIn5
([happy_var_1 { O.mbAddress = happy_var_4 }, happy_var_3 ]
) `HappyStk` happyRest}}}
happyReduce_14 = happySpecReduce_3 1# happyReduction_14
happyReduction_14 happy_x_3
happy_x_2
happy_x_1
= case happyOut11 happy_x_1 of { happy_var_1 ->
case happyOut11 happy_x_3 of { happy_var_3 ->
happyIn5
([happy_var_1 , happy_var_3 ]
)}}
happyReduce_15 = happySpecReduce_3 1# happyReduction_15
happyReduction_15 happy_x_3
happy_x_2
happy_x_1
= case happyOut8 happy_x_1 of { happy_var_1 ->
case happyOut9 happy_x_3 of { happy_var_3 ->
happyIn5
([happy_var_1 , happy_var_3 ]
)}}
happyReduce_16 = happyReduce 4# 1# happyReduction_16
happyReduction_16 (happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOut8 happy_x_1 of { happy_var_1 ->
case happyOut11 happy_x_3 of { happy_var_3 ->
case happyOut6 happy_x_4 of { happy_var_4 ->
happyIn5
([happy_var_1 , happy_var_3 { O.mbAddress = happy_var_4 } ]
) `HappyStk` happyRest}}}
happyReduce_17 = happyReduce 5# 1# happyReduction_17
happyReduction_17 (happy_x_5 `HappyStk`
happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOut8 happy_x_1 of { happy_var_1 ->
case happyOut9 happy_x_3 of { happy_var_3 ->
case happyOut9 happy_x_5 of { happy_var_5 ->
happyIn5
([happy_var_1 , happy_var_3 , happy_var_5]
) `HappyStk` happyRest}}}
happyReduce_18 = happyReduce 6# 1# happyReduction_18
happyReduction_18 (happy_x_6 `HappyStk`
happy_x_5 `HappyStk`
happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOut8 happy_x_1 of { happy_var_1 ->
case happyOut11 happy_x_3 of { happy_var_3 ->
case happyOut9 happy_x_5 of { happy_var_5 ->
happyIn5
([happy_var_1 , happy_var_3 , happy_var_5]
) `HappyStk` happyRest}}}
happyReduce_19 = happySpecReduce_0 2# happyReduction_19
happyReduction_19 = happyIn6
(Nothing
)
happyReduce_20 = happySpecReduce_2 2# happyReduction_20
happyReduction_20 happy_x_2
happy_x_1
= case happyOutTok happy_x_2 of { (Address happy_var_2) ->
happyIn6
(Just $ Left happy_var_2
)}
happyReduce_21 = happySpecReduce_1 3# happyReduction_21
happyReduction_21 happy_x_1
= case happyOutTok happy_x_1 of { (Address happy_var_1) ->
happyIn7
(Abs $ Left happy_var_1
)}
happyReduce_22 = happySpecReduce_1 4# happyReduction_22
happyReduction_22 happy_x_1
= case happyOutTok happy_x_1 of { (Constant happy_var_1) ->
happyIn8
(Imm happy_var_1
)}
happyReduce_23 = happySpecReduce_1 5# happyReduction_23
happyReduction_23 happy_x_1
= case happyOutTok happy_x_1 of { (Register happy_var_1) ->
happyIn9
(DirD happy_var_1
)}
happyReduce_24 = happySpecReduce_2 6# happyReduction_24
happyReduction_24 happy_x_2
happy_x_1
= case happyOutTok happy_x_2 of { (Register happy_var_2) ->
happyIn10
(DirJ happy_var_2
)}
happyReduce_25 = happySpecReduce_1 7# happyReduction_25
happyReduction_25 happy_x_1
= case happyOut13 happy_x_1 of { happy_var_1 ->
happyIn11
(IndD "" (fst happy_var_1) (snd happy_var_1) Nothing
)}
happyReduce_26 = happySpecReduce_3 7# happyReduction_26
happyReduction_26 happy_x_3
happy_x_2
happy_x_1
= case happyOutTok happy_x_1 of { (Register happy_var_1) ->
case happyOut13 happy_x_3 of { happy_var_3 ->
happyIn11
(IndD happy_var_1 (fst happy_var_3) (snd happy_var_3) Nothing
)}}
happyReduce_27 = happySpecReduce_2 8# happyReduction_27
happyReduction_27 happy_x_2
happy_x_1
= case happyOut13 happy_x_2 of { happy_var_2 ->
happyIn12
(IndJ (fst happy_var_2) (snd happy_var_2) Nothing
)}
happyReduce_28 = happySpecReduce_2 9# happyReduction_28
happyReduction_28 happy_x_2
happy_x_1
= case happyOutTok happy_x_1 of { (Offset happy_var_1) ->
case happyOut14 happy_x_2 of { happy_var_2 ->
happyIn13
((happy_var_2 , Just happy_var_1)
)}}
happyReduce_29 = happySpecReduce_1 9# happyReduction_29
happyReduction_29 happy_x_1
= case happyOut14 happy_x_1 of { happy_var_1 ->
happyIn13
((happy_var_1 , Nothing)
)}
happyReduce_30 = happySpecReduce_1 9# happyReduction_30
happyReduction_30 happy_x_1
= case happyOutTok happy_x_1 of { (Offset happy_var_1) ->
happyIn13
((NoEA, Just happy_var_1)
)}
happyReduce_31 = happySpecReduce_3 10# happyReduction_31
happyReduction_31 happy_x_3
happy_x_2
happy_x_1
= case happyOutTok happy_x_2 of { (Register happy_var_2) ->
happyIn14
(EA happy_var_2 "" 1
)}
happyReduce_32 = happyReduce 6# 10# happyReduction_32
happyReduction_32 (happy_x_6 `HappyStk`
happy_x_5 `HappyStk`
happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOutTok happy_x_3 of { (Register happy_var_3) ->
case happyOutTok happy_x_5 of { (Offset happy_var_5) ->
happyIn14
(EA "" happy_var_3 happy_var_5
) `HappyStk` happyRest}}
happyReduce_33 = happyReduce 7# 10# happyReduction_33
happyReduction_33 (happy_x_7 `HappyStk`
happy_x_6 `HappyStk`
happy_x_5 `HappyStk`
happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOutTok happy_x_2 of { (Register happy_var_2) ->
case happyOutTok happy_x_4 of { (Register happy_var_4) ->
case happyOutTok happy_x_6 of { (Offset happy_var_6) ->
happyIn14
(EA happy_var_2 happy_var_4 happy_var_6
) `HappyStk` happyRest}}}
happyNewToken action sts stk [] =
happyDoAction 13# notHappyAtAll action sts stk []
happyNewToken action sts stk (tk:tks) =
let cont i = happyDoAction i tk action sts stk tks in
case tk of {
Offset happy_dollar_dollar -> cont 1#;
Constant happy_dollar_dollar -> cont 2#;
Address happy_dollar_dollar -> cont 3#;
PrefixedMnemonic happy_dollar_dollar -> cont 4#;
L.Mnemonic happy_dollar_dollar -> cont 5#;
Register happy_dollar_dollar -> cont 6#;
ParensL -> cont 7#;
ParensR -> cont 8#;
Comma -> cont 9#;
Colon -> cont 10#;
Hash -> cont 11#;
Star -> cont 12#;
_ -> 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
parse tks = happyRunIdentity happySomeParser where
happySomeParser = happyThen (happyParse 0# tks) (\x -> happyReturn (happyOut4 x))
happySeq = happyDontSeq
happyError :: [Token] -> a
happyError tks = error $ "Parse.y: parse error at: " ++ (show $ take 10 tks)
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 =
happyError_ 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