module Language.Par where
import Language.Abs
import Language.Lex
import Language.ErrM
import qualified Data.Array as Happy_Data_Array
import qualified GHC.Exts as Happy_GHC_Exts
import Control.Applicative(Applicative(..))
newtype HappyAbsSyn = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
happyIn22 :: (Ident) -> (HappyAbsSyn )
happyIn22 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut22 :: (HappyAbsSyn ) -> (Ident)
happyOut22 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn23 :: (VerIdent) -> (HappyAbsSyn )
happyIn23 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut23 :: (HappyAbsSyn ) -> (VerIdent)
happyOut23 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn24 :: (RouteIdent) -> (HappyAbsSyn )
happyIn24 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut24 :: (HappyAbsSyn ) -> (RouteIdent)
happyOut24 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn25 :: (Specification) -> (HappyAbsSyn )
happyIn25 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut25 :: (HappyAbsSyn ) -> (Specification)
happyOut25 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn26 :: (Name) -> (HappyAbsSyn )
happyIn26 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut26 :: (HappyAbsSyn ) -> (Name)
happyOut26 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn27 :: (Version) -> (HappyAbsSyn )
happyIn27 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut27 :: (HappyAbsSyn ) -> (Version)
happyOut27 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn28 :: (Modules) -> (HappyAbsSyn )
happyIn28 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut28 :: (HappyAbsSyn ) -> (Modules)
happyOut28 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn29 :: (EnumType) -> (HappyAbsSyn )
happyIn29 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut29 :: (HappyAbsSyn ) -> (EnumType)
happyOut29 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn30 :: (StructType) -> (HappyAbsSyn )
happyIn30 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut30 :: (HappyAbsSyn ) -> (StructType)
happyOut30 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn31 :: (Resource) -> (HappyAbsSyn )
happyIn31 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut31 :: (HappyAbsSyn ) -> (Resource)
happyOut31 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn32 :: (Mode) -> (HappyAbsSyn )
happyIn32 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut32 :: (HappyAbsSyn ) -> (Mode)
happyOut32 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn33 :: (Field) -> (HappyAbsSyn )
happyIn33 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut33 :: (HappyAbsSyn ) -> (Field)
happyOut33 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn34 :: (FType) -> (HappyAbsSyn )
happyIn34 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut34 :: (HappyAbsSyn ) -> (FType)
happyOut34 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn35 :: (Annotation) -> (HappyAbsSyn )
happyIn35 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut35 :: (HappyAbsSyn ) -> (Annotation)
happyOut35 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn36 :: (EnumVal) -> (HappyAbsSyn )
happyIn36 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut36 :: (HappyAbsSyn ) -> (EnumVal)
happyOut36 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn37 :: ([EnumType]) -> (HappyAbsSyn )
happyIn37 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut37 :: (HappyAbsSyn ) -> ([EnumType])
happyOut37 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn38 :: ([Field]) -> (HappyAbsSyn )
happyIn38 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut38 :: (HappyAbsSyn ) -> ([Field])
happyOut38 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn39 :: ([StructType]) -> (HappyAbsSyn )
happyIn39 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut39 :: (HappyAbsSyn ) -> ([StructType])
happyOut39 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn40 :: ([Resource]) -> (HappyAbsSyn )
happyIn40 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut40 :: (HappyAbsSyn ) -> ([Resource])
happyOut40 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn41 :: ([EnumVal]) -> (HappyAbsSyn )
happyIn41 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut41 :: (HappyAbsSyn ) -> ([EnumVal])
happyOut41 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn42 :: ([Annotation]) -> (HappyAbsSyn )
happyIn42 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut42 :: (HappyAbsSyn ) -> ([Annotation])
happyOut42 x = Happy_GHC_Exts.unsafeCoerce# x
happyIn43 :: ([Ident]) -> (HappyAbsSyn )
happyIn43 x = Happy_GHC_Exts.unsafeCoerce# x
happyOut43 :: (HappyAbsSyn ) -> ([Ident])
happyOut43 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# "\x86\x00\x86\x00\x87\x00\x89\x00\x8a\x00\x81\x00\x85\x00\x84\x00\x00\x00\x08\x00\x88\x00\x7d\x00\x00\x00\x00\x00\x7b\x00\x7c\x00\x7a\x00\x00\x00\x7a\x00\x7a\x00\x00\x00\x7a\x00\x78\x00\xff\xff\x00\x00\x77\x00\x76\x00\x74\x00\x72\x00\x73\x00\x75\x00\x71\x00\x70\x00\x6f\x00\x6e\x00\x06\x00\x16\x00\x6e\x00\x6e\x00\x6d\x00\x00\x00\x6c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x6c\x00\x6c\x00\x00\x00\x6c\x00\x6c\x00\x6c\x00\x6b\x00\x69\x00\x6a\x00\x66\x00\x68\x00\x65\x00\x67\x00\x44\x00\x64\x00\x62\x00\x63\x00\x61\x00\x60\x00\x5f\x00\x5a\x00\x00\x00\x00\x00\x5d\x00\x00\x00\x00\x00\x5b\x00\x00\x00\x5e\x00\x00\x00\x58\x00\x00\x00\x00\x00\x5c\x00\x00\x00\x00\x00\x08\x00\x00\x00\x57\x00\x57\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf7\xff\x55\x00\x54\x00\x00\x00\x46\x00\x42\x00\x59\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x00\x00\x00\x56\x00\x50\x00\x00\x00\x00\x00"#
happyGotoOffsets :: HappyAddr
happyGotoOffsets = HappyA# "\x05\x00\x4f\x00\x53\x00\x51\x00\x4d\x00\x4e\x00\x4c\x00\x48\x00\x3d\x00\x27\x00\x43\x00\x14\x00\x3f\x00\x2c\x00\x3c\x00\x3a\x00\x0e\x00\x3b\x00\x03\x00\x00\x00\x00\x00\x02\x00\x00\x00\x1f\x00\x00\x00\x00\x00\x00\x00\x34\x00\x00\x00\x4b\x00\x31\x00\x00\x00\x4a\x00\x00\x00\x00\x00\x1e\x00\x33\x00\x00\x00\x00\x00\x49\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x26\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x47\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x29\x00\x22\x00\x45\x00\x2e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0d\x00\x00\x00\x00\x00\x00\x00\x19\x00\x00\x00\x25\x00\x00\x00\x07\x00\x01\x00\x00\x00\x00\x00\x00\x00\xfb\xff\x2d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x28\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x00\x00\x00\x00\xfc\xff\x00\x00\x00\x00"#
happyDefActions :: HappyAddr
happyDefActions = HappyA# "\x00\x00\x00\x00\x00\x00\xe6\xff\x00\x00\x00\x00\x00\x00\xe0\xff\xcc\xff\x00\x00\x00\x00\x00\x00\xd6\xff\xcc\xff\x00\x00\x00\x00\x00\x00\xcc\xff\x00\x00\x00\x00\xec\xff\xca\xff\x00\x00\x00\x00\xd7\xff\xce\xff\x00\x00\xd0\xff\x00\x00\x00\x00\xd2\xff\x00\x00\x00\x00\xd4\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xda\xff\x00\x00\xdb\xff\xdd\xff\xdc\xff\xde\xff\x00\x00\x00\x00\x00\x00\xe1\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe6\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd8\xff\xd5\xff\x00\x00\xcb\xff\xcc\xff\x00\x00\xd1\xff\x00\x00\xcf\xff\x00\x00\xc9\xff\xcd\xff\x00\x00\xcc\xff\xd3\xff\x00\x00\xd9\xff\x00\x00\x00\x00\xe7\xff\xeb\xff\xe8\xff\xd6\xff\x00\x00\x00\x00\x00\x00\xdf\xff\x00\x00\x00\x00\x00\x00\xea\xff\xe3\xff\xe4\xff\xe5\xff\x00\x00\xe9\xff\x00\x00\xe0\xff\xe2\xff"#
happyCheck :: HappyAddr
happyCheck = HappyA# "\xff\xff\x00\x00\x00\x00\x00\x00\x0d\x00\x06\x00\x0a\x00\x00\x00\x03\x00\x04\x00\x0f\x00\x14\x00\x06\x00\x00\x00\x00\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x00\x00\x0e\x00\x15\x00\x15\x00\x15\x00\x1a\x00\x13\x00\x0e\x00\x0e\x00\x17\x00\x00\x00\x17\x00\x13\x00\x13\x00\x0e\x00\x0d\x00\x0b\x00\x00\x00\x00\x00\x00\x00\x06\x00\x10\x00\x02\x00\x0d\x00\x0d\x00\x14\x00\x05\x00\x01\x00\x1a\x00\x0c\x00\x0c\x00\x0c\x00\x07\x00\x08\x00\x0b\x00\x0b\x00\x09\x00\x08\x00\x07\x00\x10\x00\x10\x00\x09\x00\x11\x00\x14\x00\x14\x00\x12\x00\x11\x00\x09\x00\x08\x00\x00\x00\x12\x00\x00\x00\x0b\x00\x00\x00\x00\x00\x00\x00\x12\x00\x11\x00\x0f\x00\x14\x00\x0d\x00\x14\x00\x0a\x00\x04\x00\x07\x00\x09\x00\x08\x00\x06\x00\x05\x00\x03\x00\x01\x00\x19\x00\x16\x00\x01\x00\x1a\x00\x0f\x00\x02\x00\x0c\x00\x05\x00\x11\x00\xff\xff\xff\xff\x0c\x00\xff\xff\xff\xff\xff\xff\x16\x00\x0b\x00\x05\x00\x05\x00\x17\x00\x17\x00\x15\x00\xff\xff\x10\x00\x04\x00\x15\x00\xff\xff\xff\xff\x13\x00\x0e\x00\x18\x00\x17\x00\x04\x00\xff\xff\xff\xff\xff\xff\x1a\x00\x1a\x00\xff\xff\x17\x00\x1a\x00\x17\x00\x11\x00\x1a\x00\x17\x00\x1a\x00\x14\x00\x17\x00\x1a\x00\x1a\x00\x11\x00\x06\x00\x14\x00\x1a\x00\x17\x00\x1a\x00\x0f\x00\x17\x00\x14\x00\x11\x00\x0d\x00\x12\x00\x10\x00\x13\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\xff\xff"#
happyTable :: HappyAddr
happyTable = HappyA# "\x00\x00\x15\x00\x15\x00\x15\x00\x36\x00\x28\x00\x6a\x00\x18\x00\x3c\x00\x3d\x00\x5b\x00\x21\x00\x28\x00\x18\x00\x18\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x18\x00\x19\x00\x5c\x00\x4e\x00\x16\x00\xff\xff\x5d\x00\x19\x00\x19\x00\x15\x00\x46\x00\x15\x00\x4f\x00\x1a\x00\x25\x00\x36\x00\x21\x00\x28\x00\x28\x00\x28\x00\x5a\x00\x5f\x00\x61\x00\x47\x00\x47\x00\x23\x00\x3e\x00\x57\x00\xff\xff\x5e\x00\x43\x00\x29\x00\x45\x00\x1e\x00\x21\x00\x21\x00\x1b\x00\x1e\x00\x45\x00\x52\x00\x22\x00\x1b\x00\x66\x00\x23\x00\x23\x00\x67\x00\x4a\x00\x1b\x00\x1e\x00\x59\x00\x4c\x00\x42\x00\x2f\x00\x44\x00\x49\x00\x4b\x00\x1c\x00\x1f\x00\x24\x00\x17\x00\x26\x00\x23\x00\x30\x00\x3a\x00\x34\x00\x32\x00\x33\x00\x36\x00\x38\x00\x6a\x00\x69\x00\x63\x00\x64\x00\x61\x00\xff\xff\x32\x00\x51\x00\x66\x00\x54\x00\x1e\x00\x00\x00\x00\x00\x55\x00\x00\x00\x00\x00\x00\x00\x65\x00\x57\x00\x40\x00\x41\x00\x15\x00\x15\x00\x52\x00\x00\x00\x38\x00\x49\x00\x56\x00\x00\x00\x00\x00\x3a\x00\x42\x00\x59\x00\x15\x00\x4e\x00\x00\x00\x00\x00\x00\x00\xff\xff\xff\xff\x00\x00\x15\x00\xff\xff\x15\x00\x1e\x00\xff\xff\x15\x00\xff\xff\x21\x00\x15\x00\xff\xff\xff\xff\x1e\x00\x28\x00\x21\x00\xff\xff\x15\x00\xff\xff\x32\x00\x15\x00\x21\x00\x1e\x00\x36\x00\x3c\x00\x38\x00\x3a\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\x00\x00"#
happyReduceArr = Happy_Data_Array.array (19, 54) [
(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),
(35 , happyReduce_35),
(36 , happyReduce_36),
(37 , happyReduce_37),
(38 , happyReduce_38),
(39 , happyReduce_39),
(40 , happyReduce_40),
(41 , happyReduce_41),
(42 , happyReduce_42),
(43 , happyReduce_43),
(44 , happyReduce_44),
(45 , happyReduce_45),
(46 , happyReduce_46),
(47 , happyReduce_47),
(48 , happyReduce_48),
(49 , happyReduce_49),
(50 , happyReduce_50),
(51 , happyReduce_51),
(52 , happyReduce_52),
(53 , happyReduce_53),
(54 , happyReduce_54)
]
happy_n_terms = 27 :: Int
happy_n_nonterms = 22 :: Int
happyReduce_19 = happySpecReduce_1 0# happyReduction_19
happyReduction_19 happy_x_1
= case happyOutTok happy_x_1 of { (PT _ (TV happy_var_1)) ->
happyIn22
(Ident happy_var_1
)}
happyReduce_20 = happySpecReduce_1 1# happyReduction_20
happyReduction_20 happy_x_1
= case happyOutTok happy_x_1 of { (PT _ (T_VerIdent happy_var_1)) ->
happyIn23
(VerIdent (happy_var_1)
)}
happyReduce_21 = happySpecReduce_1 2# happyReduction_21
happyReduction_21 happy_x_1
= case happyOutTok happy_x_1 of { (PT _ (T_RouteIdent happy_var_1)) ->
happyIn24
(RouteIdent (happy_var_1)
)}
happyReduce_22 = happyReduce 6# 3# happyReduction_22
happyReduction_22 (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 happyOut26 happy_x_1 of { happy_var_1 ->
case happyOut27 happy_x_2 of { happy_var_2 ->
case happyOut28 happy_x_3 of { happy_var_3 ->
case happyOut37 happy_x_4 of { happy_var_4 ->
case happyOut39 happy_x_5 of { happy_var_5 ->
case happyOut40 happy_x_6 of { happy_var_6 ->
happyIn25
(Spec happy_var_1 happy_var_2 happy_var_3 (reverse happy_var_4) happy_var_5 happy_var_6
) `HappyStk` happyRest}}}}}}
happyReduce_23 = happySpecReduce_3 4# happyReduction_23
happyReduction_23 happy_x_3
happy_x_2
happy_x_1
= case happyOut22 happy_x_3 of { happy_var_3 ->
happyIn26
(Nm happy_var_3
)}
happyReduce_24 = happySpecReduce_3 5# happyReduction_24
happyReduction_24 happy_x_3
happy_x_2
happy_x_1
= case happyOut23 happy_x_3 of { happy_var_3 ->
happyIn27
(Ver happy_var_3
)}
happyReduce_25 = happySpecReduce_0 6# happyReduction_25
happyReduction_25 = happyIn28
(EmptyMods
)
happyReduce_26 = happyReduce 5# 6# happyReduction_26
happyReduction_26 (happy_x_5 `HappyStk`
happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOut43 happy_x_4 of { happy_var_4 ->
happyIn28
(Mods happy_var_4
) `HappyStk` happyRest}
happyReduce_27 = happyReduce 5# 7# happyReduction_27
happyReduction_27 (happy_x_5 `HappyStk`
happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOut22 happy_x_2 of { happy_var_2 ->
case happyOut41 happy_x_4 of { happy_var_4 ->
happyIn29
(DefEnum happy_var_2 happy_var_4
) `HappyStk` happyRest}}
happyReduce_28 = happyReduce 5# 8# happyReduction_28
happyReduction_28 (happy_x_5 `HappyStk`
happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOut22 happy_x_2 of { happy_var_2 ->
case happyOut38 happy_x_4 of { happy_var_4 ->
happyIn30
(DefStr happy_var_2 happy_var_4
) `HappyStk` happyRest}}
happyReduce_29 = happyReduce 8# 9# happyReduction_29
happyReduction_29 (happy_x_8 `HappyStk`
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 happyOut22 happy_x_2 of { happy_var_2 ->
case happyOut24 happy_x_5 of { happy_var_5 ->
case happyOut32 happy_x_8 of { happy_var_8 ->
happyIn31
(Res happy_var_2 happy_var_5 happy_var_8
) `HappyStk` happyRest}}}
happyReduce_30 = happySpecReduce_1 10# happyReduction_30
happyReduction_30 happy_x_1
= happyIn32
(ReadOnly
)
happyReduce_31 = happySpecReduce_0 10# happyReduction_31
happyReduction_31 = happyIn32
(Write
)
happyReduce_32 = happyReduce 4# 11# happyReduction_32
happyReduction_32 (happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOut42 happy_x_1 of { happy_var_1 ->
case happyOut22 happy_x_2 of { happy_var_2 ->
case happyOut34 happy_x_4 of { happy_var_4 ->
happyIn33
(FDef (reverse happy_var_1) happy_var_2 happy_var_4
) `HappyStk` happyRest}}}
happyReduce_33 = happySpecReduce_1 12# happyReduction_33
happyReduction_33 happy_x_1
= happyIn34
(FString
)
happyReduce_34 = happySpecReduce_1 12# happyReduction_34
happyReduction_34 happy_x_1
= happyIn34
(FInt
)
happyReduce_35 = happySpecReduce_1 12# happyReduction_35
happyReduction_35 happy_x_1
= happyIn34
(FLong
)
happyReduce_36 = happySpecReduce_1 12# happyReduction_36
happyReduction_36 happy_x_1
= happyIn34
(FDouble
)
happyReduce_37 = happySpecReduce_1 12# happyReduction_37
happyReduction_37 happy_x_1
= case happyOut22 happy_x_1 of { happy_var_1 ->
happyIn34
(FDefined happy_var_1
)}
happyReduce_38 = happySpecReduce_3 12# happyReduction_38
happyReduction_38 happy_x_3
happy_x_2
happy_x_1
= case happyOut34 happy_x_2 of { happy_var_2 ->
happyIn34
(FList happy_var_2
)}
happyReduce_39 = happySpecReduce_2 13# happyReduction_39
happyReduction_39 happy_x_2
happy_x_1
= case happyOut22 happy_x_2 of { happy_var_2 ->
happyIn35
(Ann happy_var_2
)}
happyReduce_40 = happySpecReduce_1 14# happyReduction_40
happyReduction_40 happy_x_1
= case happyOut22 happy_x_1 of { happy_var_1 ->
happyIn36
(EnVal happy_var_1
)}
happyReduce_41 = happySpecReduce_0 15# happyReduction_41
happyReduction_41 = happyIn37
([]
)
happyReduce_42 = happySpecReduce_2 15# happyReduction_42
happyReduction_42 happy_x_2
happy_x_1
= case happyOut37 happy_x_1 of { happy_var_1 ->
case happyOut29 happy_x_2 of { happy_var_2 ->
happyIn37
(flip (:) happy_var_1 happy_var_2
)}}
happyReduce_43 = happySpecReduce_1 16# happyReduction_43
happyReduction_43 happy_x_1
= case happyOut33 happy_x_1 of { happy_var_1 ->
happyIn38
((:[]) happy_var_1
)}
happyReduce_44 = happySpecReduce_3 16# happyReduction_44
happyReduction_44 happy_x_3
happy_x_2
happy_x_1
= case happyOut33 happy_x_1 of { happy_var_1 ->
case happyOut38 happy_x_3 of { happy_var_3 ->
happyIn38
((:) happy_var_1 happy_var_3
)}}
happyReduce_45 = happySpecReduce_1 17# happyReduction_45
happyReduction_45 happy_x_1
= case happyOut30 happy_x_1 of { happy_var_1 ->
happyIn39
((:[]) happy_var_1
)}
happyReduce_46 = happySpecReduce_2 17# happyReduction_46
happyReduction_46 happy_x_2
happy_x_1
= case happyOut30 happy_x_1 of { happy_var_1 ->
case happyOut39 happy_x_2 of { happy_var_2 ->
happyIn39
((:) happy_var_1 happy_var_2
)}}
happyReduce_47 = happySpecReduce_1 18# happyReduction_47
happyReduction_47 happy_x_1
= case happyOut31 happy_x_1 of { happy_var_1 ->
happyIn40
((:[]) happy_var_1
)}
happyReduce_48 = happySpecReduce_2 18# happyReduction_48
happyReduction_48 happy_x_2
happy_x_1
= case happyOut31 happy_x_1 of { happy_var_1 ->
case happyOut40 happy_x_2 of { happy_var_2 ->
happyIn40
((:) happy_var_1 happy_var_2
)}}
happyReduce_49 = happySpecReduce_1 19# happyReduction_49
happyReduction_49 happy_x_1
= case happyOut36 happy_x_1 of { happy_var_1 ->
happyIn41
((:[]) happy_var_1
)}
happyReduce_50 = happySpecReduce_3 19# happyReduction_50
happyReduction_50 happy_x_3
happy_x_2
happy_x_1
= case happyOut36 happy_x_1 of { happy_var_1 ->
case happyOut41 happy_x_3 of { happy_var_3 ->
happyIn41
((:) happy_var_1 happy_var_3
)}}
happyReduce_51 = happySpecReduce_0 20# happyReduction_51
happyReduction_51 = happyIn42
([]
)
happyReduce_52 = happySpecReduce_2 20# happyReduction_52
happyReduction_52 happy_x_2
happy_x_1
= case happyOut42 happy_x_1 of { happy_var_1 ->
case happyOut35 happy_x_2 of { happy_var_2 ->
happyIn42
(flip (:) happy_var_1 happy_var_2
)}}
happyReduce_53 = happySpecReduce_1 21# happyReduction_53
happyReduction_53 happy_x_1
= case happyOut22 happy_x_1 of { happy_var_1 ->
happyIn43
((:[]) happy_var_1
)}
happyReduce_54 = happySpecReduce_2 21# happyReduction_54
happyReduction_54 happy_x_2
happy_x_1
= case happyOut22 happy_x_1 of { happy_var_1 ->
case happyOut43 happy_x_2 of { happy_var_2 ->
happyIn43
((:) happy_var_1 happy_var_2
)}}
happyNewToken action sts stk [] =
happyDoAction 26# notHappyAtAll action sts stk []
happyNewToken action sts stk (tk:tks) =
let cont i = happyDoAction i tk action sts stk tks in
case tk of {
PT _ (TS _ 1) -> cont 1#;
PT _ (TS _ 2) -> cont 2#;
PT _ (TS _ 3) -> cont 3#;
PT _ (TS _ 4) -> cont 4#;
PT _ (TS _ 5) -> cont 5#;
PT _ (TS _ 6) -> cont 6#;
PT _ (TS _ 7) -> cont 7#;
PT _ (TS _ 8) -> cont 8#;
PT _ (TS _ 9) -> cont 9#;
PT _ (TS _ 10) -> cont 10#;
PT _ (TS _ 11) -> cont 11#;
PT _ (TS _ 12) -> cont 12#;
PT _ (TS _ 13) -> cont 13#;
PT _ (TS _ 14) -> cont 14#;
PT _ (TS _ 15) -> cont 15#;
PT _ (TS _ 16) -> cont 16#;
PT _ (TS _ 17) -> cont 17#;
PT _ (TS _ 18) -> cont 18#;
PT _ (TS _ 19) -> cont 19#;
PT _ (TS _ 20) -> cont 20#;
PT _ (TS _ 21) -> cont 21#;
PT _ (TS _ 22) -> cont 22#;
PT _ (TV happy_dollar_dollar) -> cont 23#;
PT _ (T_VerIdent happy_dollar_dollar) -> cont 24#;
PT _ (T_RouteIdent happy_dollar_dollar) -> cont 25#;
_ -> happyError' (tk:tks)
}
happyError_ 26# tk tks = happyError' tks
happyError_ _ tk tks = happyError' (tk:tks)
happyThen :: () => Err a -> (a -> Err b) -> Err b
happyThen = (thenM)
happyReturn :: () => a -> Err a
happyReturn = (returnM)
happyThen1 m k tks = (thenM) m (\a -> k a tks)
happyReturn1 :: () => a -> b -> Err a
happyReturn1 = \a tks -> (returnM) a
happyError' :: () => [(Token)] -> Err a
happyError' = happyError
pSpecification tks = happySomeParser where
happySomeParser = happyThen (happyParse 0# tks) (\x -> happyReturn (happyOut25 x))
pName tks = happySomeParser where
happySomeParser = happyThen (happyParse 1# tks) (\x -> happyReturn (happyOut26 x))
pVersion tks = happySomeParser where
happySomeParser = happyThen (happyParse 2# tks) (\x -> happyReturn (happyOut27 x))
pModules tks = happySomeParser where
happySomeParser = happyThen (happyParse 3# tks) (\x -> happyReturn (happyOut28 x))
pEnumType tks = happySomeParser where
happySomeParser = happyThen (happyParse 4# tks) (\x -> happyReturn (happyOut29 x))
pStructType tks = happySomeParser where
happySomeParser = happyThen (happyParse 5# tks) (\x -> happyReturn (happyOut30 x))
pResource tks = happySomeParser where
happySomeParser = happyThen (happyParse 6# tks) (\x -> happyReturn (happyOut31 x))
pMode tks = happySomeParser where
happySomeParser = happyThen (happyParse 7# tks) (\x -> happyReturn (happyOut32 x))
pField tks = happySomeParser where
happySomeParser = happyThen (happyParse 8# tks) (\x -> happyReturn (happyOut33 x))
pFType tks = happySomeParser where
happySomeParser = happyThen (happyParse 9# tks) (\x -> happyReturn (happyOut34 x))
pAnnotation tks = happySomeParser where
happySomeParser = happyThen (happyParse 10# tks) (\x -> happyReturn (happyOut35 x))
pEnumVal tks = happySomeParser where
happySomeParser = happyThen (happyParse 11# tks) (\x -> happyReturn (happyOut36 x))
pListEnumType tks = happySomeParser where
happySomeParser = happyThen (happyParse 12# tks) (\x -> happyReturn (happyOut37 x))
pListField tks = happySomeParser where
happySomeParser = happyThen (happyParse 13# tks) (\x -> happyReturn (happyOut38 x))
pListStructType tks = happySomeParser where
happySomeParser = happyThen (happyParse 14# tks) (\x -> happyReturn (happyOut39 x))
pListResource tks = happySomeParser where
happySomeParser = happyThen (happyParse 15# tks) (\x -> happyReturn (happyOut40 x))
pListEnumVal tks = happySomeParser where
happySomeParser = happyThen (happyParse 16# tks) (\x -> happyReturn (happyOut41 x))
pListAnnotation tks = happySomeParser where
happySomeParser = happyThen (happyParse 17# tks) (\x -> happyReturn (happyOut42 x))
pListIdent tks = happySomeParser where
happySomeParser = happyThen (happyParse 18# tks) (\x -> happyReturn (happyOut43 x))
happySeq = happyDontSeq
returnM :: a -> Err a
returnM = return
thenM :: Err a -> (a -> Err b) -> Err b
thenM = (>>=)
happyError :: [Token] -> Err a
happyError ts =
Bad $ "syntax error at " ++ tokenPos ts ++
case ts of
[] -> []
[Err _] -> " due to lexer error"
_ -> " before " ++ unwords (map (id . prToken) (take 4 ts))
myLexer = tokens
# 1 "/usr/include/stdc-predef.h" 1 3 4
# 17 "/usr/include/stdc-predef.h" 3 4
#if __GLASGOW_HASKELL__ > 706
#define LT(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.<# m)) :: Bool)
#define GTE(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.>=# m)) :: Bool)
#define EQ(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.==# m)) :: 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
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 | LT(n,(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 GTE(off_i,(0# :: Happy_GHC_Exts.Int#))
then EQ(indexShortOffAddr happyCheck off_i, 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 =
case happyDrop k (HappyCons (st) (sts)) of
sts1@((HappyCons (st1@(action)) (_))) ->
let drop_stk = happyDropStk k stk in
happyThen1 (fn stk tk) (\r -> happyGoto nt j tk st1 sts1 (r `HappyStk` drop_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 =
case happyDrop k (HappyCons (st) (sts)) of
sts1@((HappyCons (st1@(action)) (_))) ->
let drop_stk = happyDropStk k stk
off = indexShortOffAddr happyGotoOffsets st1
off_i = (off Happy_GHC_Exts.+# nt)
new_state = indexShortOffAddr happyTable off_i
in
happyThen1 (fn stk tk) (\r -> happyNewToken new_state sts1 (r `HappyStk` drop_stk))
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