module Lighttpd.Conf.Parser (
parseConf
, parseConf'
) where
import Lighttpd.Conf.Syntax
import Lighttpd.Conf.Lexer
import Data.Char
import Data.Monoid
import Data.ByteString.Char8 (ByteString)
import qualified Data.ByteString.Char8 as B
#if __GLASGOW_HASKELL__ >= 503
import Data.Array
#else
import Array
#endif
#if __GLASGOW_HASKELL__ >= 503
import GHC.Exts
#else
import GlaExts
#endif
newtype HappyAbsSyn = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = GHC.Exts.Any
#else
type HappyAny = forall a . a
#endif
happyIn4 :: (Config) -> (HappyAbsSyn )
happyIn4 x = unsafeCoerce# x
happyOut4 :: (HappyAbsSyn ) -> (Config)
happyOut4 x = unsafeCoerce# x
happyIn5 :: (Exp) -> (HappyAbsSyn )
happyIn5 x = unsafeCoerce# x
happyOut5 :: (HappyAbsSyn ) -> (Exp)
happyOut5 x = unsafeCoerce# x
happyIn6 :: (CondElse) -> (HappyAbsSyn )
happyIn6 x = unsafeCoerce# x
happyOut6 :: (HappyAbsSyn ) -> (CondElse)
happyOut6 x = unsafeCoerce# x
happyIn7 :: ([CondElse]) -> (HappyAbsSyn )
happyIn7 x = unsafeCoerce# x
happyOut7 :: (HappyAbsSyn ) -> ([CondElse])
happyOut7 x = unsafeCoerce# x
happyIn8 :: ([CondElse]) -> (HappyAbsSyn )
happyIn8 x = unsafeCoerce# x
happyOut8 :: (HappyAbsSyn ) -> ([CondElse])
happyOut8 x = unsafeCoerce# x
happyIn9 :: ([Exp]) -> (HappyAbsSyn )
happyIn9 x = unsafeCoerce# x
happyOut9 :: (HappyAbsSyn ) -> ([Exp])
happyOut9 x = unsafeCoerce# x
happyIn10 :: ([Exp]) -> (HappyAbsSyn )
happyIn10 x = unsafeCoerce# x
happyOut10 :: (HappyAbsSyn ) -> ([Exp])
happyOut10 x = unsafeCoerce# x
happyIn11 :: (Val) -> (HappyAbsSyn )
happyIn11 x = unsafeCoerce# x
happyOut11 :: (HappyAbsSyn ) -> (Val)
happyOut11 x = unsafeCoerce# x
happyIn12 :: (ArrayElem) -> (HappyAbsSyn )
happyIn12 x = unsafeCoerce# x
happyOut12 :: (HappyAbsSyn ) -> (ArrayElem)
happyOut12 x = unsafeCoerce# x
happyIn13 :: ([ArrayElem]) -> (HappyAbsSyn )
happyIn13 x = unsafeCoerce# x
happyOut13 :: (HappyAbsSyn ) -> ([ArrayElem])
happyOut13 x = unsafeCoerce# x
happyIn14 :: ([ArrayElem]) -> (HappyAbsSyn )
happyIn14 x = unsafeCoerce# x
happyOut14 :: (HappyAbsSyn ) -> ([ArrayElem])
happyOut14 x = unsafeCoerce# x
happyIn15 :: (Name) -> (HappyAbsSyn )
happyIn15 x = unsafeCoerce# x
happyOut15 :: (HappyAbsSyn ) -> (Name)
happyOut15 x = unsafeCoerce# x
happyIn16 :: (QName) -> (HappyAbsSyn )
happyIn16 x = unsafeCoerce# x
happyOut16 :: (HappyAbsSyn ) -> (QName)
happyOut16 x = unsafeCoerce# x
happyIn17 :: (Cond) -> (HappyAbsSyn )
happyIn17 x = unsafeCoerce# x
happyOut17 :: (HappyAbsSyn ) -> (Cond)
happyOut17 x = unsafeCoerce# x
happyIn18 :: (Op) -> (HappyAbsSyn )
happyIn18 x = unsafeCoerce# x
happyOut18 :: (HappyAbsSyn ) -> (Op)
happyOut18 x = unsafeCoerce# x
happyIn19 :: (Include) -> (HappyAbsSyn )
happyIn19 x = unsafeCoerce# x
happyOut19 :: (HappyAbsSyn ) -> (Include)
happyOut19 x = unsafeCoerce# x
happyInTok :: Token -> (HappyAbsSyn )
happyInTok x = unsafeCoerce# x
happyOutTok :: (HappyAbsSyn ) -> Token
happyOutTok x = unsafeCoerce# x
happyActOffsets :: HappyAddr
happyActOffsets = HappyA# "\x23\x00\x23\x00\x23\x00\x00\x00\x00\x00\x33\x00\x63\x00\x00\x00\x00\x00\x61\x00\x62\x00\x5d\x00\x0a\x00\x6f\x00\x57\x00\x00\x00\x60\x00\x00\x00\x00\x00\x00\x00\x00\x00\x06\x00\x6c\x00\x64\x00\x23\x00\x23\x00\x02\x00\x02\x00\x00\x00\x5e\x00\x5e\x00\x4e\x00\x39\x00\x00\x00\x46\x00\x53\x00\x3e\x00\x36\x00\x00\x00\xff\xff\x02\x00\x3f\x00\x02\x00\x00\x00\xfe\xff\x4d\x00\x00\x00\x45\x00\x45\x00\x00\x00\x00\x00\x44\x00\x42\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x34\x00\x00\x00\x1f\x00\x00\x00\x23\x00\x0e\x00\x00\x00\x00\x00"#
happyGotoOffsets :: HappyAddr
happyGotoOffsets = HappyA# "\x14\x00\x48\x00\x50\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x38\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x59\x00\x00\x00\x00\x00\x3b\x00\x2e\x00\x32\x00\x2b\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\x2a\x00\x00\x00\x11\x00\x00\x00\x5f\x00\x27\x00\x00\x00\x6a\x00\x1a\x00\x00\x00\x00\x00\x09\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x21\x00\x00\x00\x00\x00\x00\x00"#
happyDefActions :: HappyAddr
happyDefActions = HappyA# "\xf2\xff\x00\x00\xef\xff\xfe\xff\xf1\xff\x00\x00\x00\x00\xf9\xff\xfd\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xda\xff\xdb\xff\xe9\xff\xed\xff\xee\xff\xec\xff\xe6\xff\x00\x00\x00\x00\xf2\xff\xf2\xff\x00\x00\x00\x00\xf0\xff\xfa\xff\xfb\xff\x00\x00\x00\x00\xe1\xff\x00\x00\xe7\xff\xe3\xff\x00\x00\xe5\xff\x00\x00\x00\x00\xea\xff\x00\x00\xeb\xff\x00\x00\x00\x00\xfc\xff\xf6\xff\xf3\xff\xf8\xff\xf5\xff\x00\x00\x00\x00\xdf\xff\xde\xff\xdd\xff\xdc\xff\xe4\xff\xe8\xff\xe0\xff\x00\x00\xf4\xff\xf2\xff\x00\x00\xf7\xff"#
happyCheck :: HappyAddr
happyCheck = HappyA# "\xff\xff\x03\x00\x04\x00\x05\x00\x06\x00\x03\x00\x04\x00\x05\x00\x06\x00\x03\x00\x04\x00\x05\x00\x06\x00\x03\x00\x04\x00\x05\x00\x06\x00\x12\x00\x13\x00\x15\x00\x00\x00\x01\x00\x0d\x00\x15\x00\x07\x00\x05\x00\x06\x00\x15\x00\x02\x00\x0c\x00\x04\x00\x15\x00\x0c\x00\x0d\x00\x01\x00\x0f\x00\x01\x00\x02\x00\x05\x00\x06\x00\x1a\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x0d\x00\x01\x00\x0f\x00\x07\x00\x07\x00\x05\x00\x06\x00\x0e\x00\x0c\x00\x0c\x00\x19\x00\x07\x00\x0c\x00\x0d\x00\x01\x00\x0f\x00\x0c\x00\x07\x00\x05\x00\x06\x00\x0f\x00\x10\x00\x0c\x00\x11\x00\x04\x00\x0c\x00\x0d\x00\x01\x00\x0f\x00\x07\x00\x16\x00\x05\x00\x06\x00\x0a\x00\x11\x00\x01\x00\x14\x00\x1a\x00\x0c\x00\x0d\x00\x06\x00\x0f\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0c\x00\x0d\x00\x18\x00\x0f\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x11\x00\x0c\x00\x07\x00\x08\x00\x1a\x00\x0a\x00\x06\x00\x0c\x00\x02\x00\x03\x00\x04\x00\x11\x00\x04\x00\x11\x00\x1b\x00\x04\x00\x17\x00\x13\x00\xff\xff\xff\xff\xff\xff\xff\xff\x19\x00\xff\xff\x19\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"#
happyTable :: HappyAddr
happyTable = HappyA# "\x00\x00\x13\x00\x14\x00\x15\x00\x28\x00\x13\x00\x14\x00\x15\x00\x0b\x00\x13\x00\x14\x00\x15\x00\x28\x00\x13\x00\x14\x00\x15\x00\x0b\x00\x2b\x00\x18\x00\x16\x00\x0e\x00\x02\x00\x3c\x00\x16\x00\x3a\x00\x03\x00\x04\x00\x16\x00\x30\x00\x11\x00\x3d\x00\x16\x00\x05\x00\x06\x00\x02\x00\x07\x00\x09\x00\x0a\x00\x3f\x00\x04\x00\x41\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x05\x00\x06\x00\x02\x00\x07\x00\x29\x00\x1d\x00\x1f\x00\x04\x00\x34\x00\x11\x00\x11\x00\x3f\x00\x1e\x00\x05\x00\x06\x00\x02\x00\x07\x00\x11\x00\x10\x00\x20\x00\x04\x00\x1b\x00\x1c\x00\x11\x00\x29\x00\x3c\x00\x05\x00\x06\x00\x02\x00\x07\x00\x0c\x00\x2c\x00\x03\x00\x04\x00\x34\x00\x29\x00\x02\x00\x2d\x00\x2f\x00\x05\x00\x06\x00\x1c\x00\x07\x00\x36\x00\x37\x00\x38\x00\x39\x00\x05\x00\x06\x00\x2e\x00\x07\x00\x23\x00\x24\x00\x25\x00\x26\x00\x29\x00\x11\x00\x23\x00\x24\x00\x30\x00\x39\x00\x22\x00\x11\x00\x30\x00\x31\x00\x32\x00\x29\x00\x23\x00\x29\x00\xff\xff\x10\x00\x17\x00\x18\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x00\x00\x00\x1a\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 = array (1, 37) [
(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),
(35 , happyReduce_35),
(36 , happyReduce_36),
(37 , happyReduce_37)
]
happy_n_terms = 28 :: Int
happy_n_nonterms = 16 :: Int
happyReduce_1 = happySpecReduce_1 0# happyReduction_1
happyReduction_1 happy_x_1
= case happyOut9 happy_x_1 of { happy_var_1 ->
happyIn4
(Config happy_var_1
)}
happyReduce_2 = happySpecReduce_1 1# happyReduction_2
happyReduction_2 happy_x_1
= case happyOutTok happy_x_1 of { (TComment happy_var_1) ->
happyIn5
(CommentE happy_var_1
)}
happyReduce_3 = happyReduce 4# 1# happyReduction_3
happyReduction_3 (happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOut9 happy_x_3 of { happy_var_3 ->
happyIn5
(GlobalCxtE happy_var_3
) `HappyStk` happyRest}
happyReduce_4 = happySpecReduce_3 1# happyReduction_4
happyReduction_4 happy_x_3
happy_x_2
happy_x_1
= case happyOut16 happy_x_1 of { happy_var_1 ->
case happyOut11 happy_x_3 of { happy_var_3 ->
happyIn5
(OptionE happy_var_1 happy_var_3
)}}
happyReduce_5 = happySpecReduce_3 1# happyReduction_5
happyReduction_5 happy_x_3
happy_x_2
happy_x_1
= case happyOut16 happy_x_1 of { happy_var_1 ->
case happyOut11 happy_x_3 of { happy_var_3 ->
happyIn5
(MergeE happy_var_1 happy_var_3
)}}
happyReduce_6 = happySpecReduce_1 1# happyReduction_6
happyReduction_6 happy_x_1
= case happyOut19 happy_x_1 of { happy_var_1 ->
happyIn5
(IncludeE happy_var_1
)}
happyReduce_7 = happyReduce 5# 1# happyReduction_7
happyReduction_7 (happy_x_5 `HappyStk`
happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOut17 happy_x_1 of { happy_var_1 ->
case happyOut9 happy_x_3 of { happy_var_3 ->
case happyOut7 happy_x_5 of { happy_var_5 ->
happyIn5
(CondE happy_var_1 happy_var_3 happy_var_5
) `HappyStk` happyRest}}}
happyReduce_8 = happyReduce 5# 2# happyReduction_8
happyReduction_8 (happy_x_5 `HappyStk`
happy_x_4 `HappyStk`
happy_x_3 `HappyStk`
happy_x_2 `HappyStk`
happy_x_1 `HappyStk`
happyRest)
= case happyOut17 happy_x_2 of { happy_var_2 ->
case happyOut9 happy_x_4 of { happy_var_4 ->
happyIn6
(CondElse happy_var_2 happy_var_4
) `HappyStk` happyRest}}
happyReduce_9 = happySpecReduce_0 3# happyReduction_9
happyReduction_9 = happyIn7
([]
)
happyReduce_10 = happySpecReduce_1 3# happyReduction_10
happyReduction_10 happy_x_1
= case happyOut8 happy_x_1 of { happy_var_1 ->
happyIn7
(happy_var_1
)}
happyReduce_11 = happySpecReduce_2 4# happyReduction_11
happyReduction_11 happy_x_2
happy_x_1
= case happyOut6 happy_x_1 of { happy_var_1 ->
case happyOut8 happy_x_2 of { happy_var_2 ->
happyIn8
(happy_var_1 : happy_var_2
)}}
happyReduce_12 = happySpecReduce_1 4# happyReduction_12
happyReduction_12 happy_x_1
= case happyOut6 happy_x_1 of { happy_var_1 ->
happyIn8
([happy_var_1]
)}
happyReduce_13 = happySpecReduce_0 5# happyReduction_13
happyReduction_13 = happyIn9
([]
)
happyReduce_14 = happySpecReduce_1 5# happyReduction_14
happyReduction_14 happy_x_1
= case happyOut10 happy_x_1 of { happy_var_1 ->
happyIn9
(happy_var_1
)}
happyReduce_15 = happySpecReduce_2 6# happyReduction_15
happyReduction_15 happy_x_2
happy_x_1
= case happyOut5 happy_x_1 of { happy_var_1 ->
case happyOut10 happy_x_2 of { happy_var_2 ->
happyIn10
(happy_var_1 : happy_var_2
)}}
happyReduce_16 = happySpecReduce_1 6# happyReduction_16
happyReduction_16 happy_x_1
= case happyOut5 happy_x_1 of { happy_var_1 ->
happyIn10
([happy_var_1]
)}
happyReduce_17 = happySpecReduce_1 7# happyReduction_17
happyReduction_17 happy_x_1
= case happyOutTok happy_x_1 of { (TString happy_var_1) ->
happyIn11
(StringV happy_var_1
)}
happyReduce_18 = happySpecReduce_1 7# happyReduction_18
happyReduction_18 happy_x_1
= case happyOutTok happy_x_1 of { (TInteger happy_var_1) ->
happyIn11
(IntegerV happy_var_1
)}
happyReduce_19 = happySpecReduce_1 7# happyReduction_19
happyReduction_19 happy_x_1
= case happyOutTok happy_x_1 of { (TBoolean happy_var_1) ->
happyIn11
(BooleanV (if happy_var_1 then Enable else Disable)
)}
happyReduce_20 = happySpecReduce_3 7# happyReduction_20
happyReduction_20 happy_x_3
happy_x_2
happy_x_1
= case happyOut13 happy_x_2 of { happy_var_2 ->
happyIn11
(ArrayV happy_var_2
)}
happyReduce_21 = happySpecReduce_3 7# happyReduction_21
happyReduction_21 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 ->
happyIn11
(ManyV [happy_var_1,happy_var_3]
)}}
happyReduce_22 = happySpecReduce_1 7# happyReduction_22
happyReduction_22 happy_x_1
= case happyOut16 happy_x_1 of { happy_var_1 ->
happyIn11
(VarV happy_var_1
)}
happyReduce_23 = happySpecReduce_3 8# happyReduction_23
happyReduction_23 happy_x_3
happy_x_2
happy_x_1
= case happyOutTok happy_x_1 of { (TName happy_var_1) ->
case happyOut11 happy_x_3 of { happy_var_3 ->
happyIn12
(ArrayElem (Just (Name happy_var_1)) happy_var_3
)}}
happyReduce_24 = happySpecReduce_1 8# happyReduction_24
happyReduction_24 happy_x_1
= case happyOut11 happy_x_1 of { happy_var_1 ->
happyIn12
(ArrayElem Nothing happy_var_1
)}
happyReduce_25 = happySpecReduce_0 9# happyReduction_25
happyReduction_25 = happyIn13
([]
)
happyReduce_26 = happySpecReduce_1 9# happyReduction_26
happyReduction_26 happy_x_1
= case happyOut14 happy_x_1 of { happy_var_1 ->
happyIn13
(happy_var_1
)}
happyReduce_27 = happySpecReduce_3 10# happyReduction_27
happyReduction_27 happy_x_3
happy_x_2
happy_x_1
= case happyOut12 happy_x_1 of { happy_var_1 ->
case happyOut14 happy_x_3 of { happy_var_3 ->
happyIn14
(happy_var_1 : happy_var_3
)}}
happyReduce_28 = happySpecReduce_1 10# happyReduction_28
happyReduction_28 happy_x_1
= case happyOut12 happy_x_1 of { happy_var_1 ->
happyIn14
([happy_var_1]
)}
happyReduce_29 = happySpecReduce_1 11# happyReduction_29
happyReduction_29 happy_x_1
= case happyOutTok happy_x_1 of { (TName happy_var_1) ->
happyIn15
(Name happy_var_1
)}
happyReduce_30 = happySpecReduce_3 12# happyReduction_30
happyReduction_30 happy_x_3
happy_x_2
happy_x_1
= case happyOutTok happy_x_1 of { (TName happy_var_1) ->
case happyOutTok happy_x_3 of { (TName happy_var_3) ->
happyIn16
(QName (Name happy_var_1) (Name happy_var_3)
)}}
happyReduce_31 = happyReduce 6# 13# happyReduction_31
happyReduction_31 (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_1 of { (TFieldName happy_var_1) ->
case happyOutTok happy_x_3 of { (TString happy_var_3) ->
case happyOut18 happy_x_5 of { happy_var_5 ->
case happyOutTok happy_x_6 of { (TString happy_var_6) ->
happyIn17
(Cond (Field (Name happy_var_1) happy_var_3) happy_var_5
((case happy_var_5 of
op | op `elem` [Equal,NotEqual]
-> StringP
_ -> RegexP) happy_var_6)
) `HappyStk` happyRest}}}}
happyReduce_32 = happySpecReduce_1 14# happyReduction_32
happyReduction_32 happy_x_1
= happyIn18
(Equal
)
happyReduce_33 = happySpecReduce_1 14# happyReduction_33
happyReduction_33 happy_x_1
= happyIn18
(NotEqual
)
happyReduce_34 = happySpecReduce_1 14# happyReduction_34
happyReduction_34 happy_x_1
= happyIn18
(Match
)
happyReduce_35 = happySpecReduce_1 14# happyReduction_35
happyReduction_35 happy_x_1
= happyIn18
(NotMatch
)
happyReduce_36 = happySpecReduce_2 15# happyReduction_36
happyReduction_36 happy_x_2
happy_x_1
= case happyOut11 happy_x_2 of { happy_var_2 ->
happyIn19
(ValueI happy_var_2
)}
happyReduce_37 = happySpecReduce_2 15# happyReduction_37
happyReduction_37 happy_x_2
happy_x_1
= case happyOutTok happy_x_2 of { (TString happy_var_2) ->
happyIn19
(ShellI happy_var_2
)}
happyNewToken action sts stk [] =
happyDoAction 27# notHappyAtAll action sts stk []
happyNewToken action sts stk (tk:tks) =
let cont i = happyDoAction i tk action sts stk tks in
case tk of {
TComment happy_dollar_dollar -> cont 1#;
TGlobal -> cont 2#;
TInteger happy_dollar_dollar -> cont 3#;
TString happy_dollar_dollar -> cont 4#;
TBoolean happy_dollar_dollar -> cont 5#;
TName happy_dollar_dollar -> cont 6#;
TFieldName happy_dollar_dollar -> cont 7#;
TIncludeValue -> cont 8#;
TIncludeShell -> cont 9#;
TElse -> cont 10#;
TEq -> cont 11#;
TNEq -> cont 12#;
TMatch -> cont 13#;
TNotMatch -> cont 14#;
TOptionOp -> cont 15#;
TMergeOp -> cont 16#;
TPlusVal -> cont 17#;
TArrayValOp -> cont 18#;
TDot -> cont 19#;
TComma -> cont 20#;
TOParen -> cont 21#;
TCParen -> cont 22#;
TOBrack -> cont 23#;
TCBrack -> cont 24#;
TOBrace -> cont 25#;
TCBrace -> cont 26#;
_ -> 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 . parseError
parseConfig tks = happyRunIdentity happySomeParser where
happySomeParser = happyThen (happyParse 0# tks) (\x -> happyReturn (happyOut4 x))
happySeq = happyDontSeq
parseError :: [Token] -> a
parseError xs = error ("Parse error"++(show xs))
lexConf :: ByteString -> [Token]
lexConf = scanTokens
parseConf :: ByteString -> Maybe Config
parseConf s =
let toks = lexConf s
in if null toks
then Nothing
else Just (parseConfig toks)
parseConf' :: String -> Maybe Config
parseConf' = parseConf . B.pack
data Happy_IntList = HappyCons 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 <# (0# :: Int#)) ->
(happyReduceArr ! rule) i tk st
where rule = (I# ((negateInt# ((n +# (1# :: Int#))))))
n ->
happyShift new_state i tk st
where new_state = (n -# (1# :: Int#))
where off = indexShortOffAddr happyActOffsets st
off_i = (off +# i)
check = if (off_i >=# (0# :: Int#))
then (indexShortOffAddr happyCheck off_i ==# i)
else False
action | check = indexShortOffAddr happyTable off_i
| otherwise = indexShortOffAddr happyDefActions st
indexShortOffAddr (HappyA# arr) off =
#if __GLASGOW_HASKELL__ > 500
narrow16Int# i
#elif __GLASGOW_HASKELL__ == 500
intToInt16# i
#else
(i `iShiftL#` 16#) `iShiftRA#` 16#
#endif
where
#if __GLASGOW_HASKELL__ >= 503
i = word2Int# ((high `uncheckedShiftL#` 8#) `or#` low)
#else
i = word2Int# ((high `shiftL#` 8#) `or#` low)
#endif
high = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#)))
low = int2Word# (ord# (indexCharOffAddr# arr off'))
off' = off *# 2#
data HappyAddr = HappyA# Addr#
happyShift new_state 0# tk st sts stk@(x `HappyStk` _) =
let i = (case unsafeCoerce# x of { (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 -# (1# :: 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 +# nt)
new_state = indexShortOffAddr happyTable off_i
happyDrop 0# l = l
happyDrop n (HappyCons (_) (t)) = happyDrop (n -# (1# :: Int#)) t
happyDropStk 0# l = l
happyDropStk n (x `HappyStk` xs) = happyDropStk (n -# (1#::Int#)) xs
happyGoto nt j tk st =
happyDoAction j tk new_state
where off = indexShortOffAddr happyGotoOffsets st
off_i = (off +# 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 ( (unsafeCoerce# (I# (i))) `HappyStk` stk)
notHappyAtAll = error "Internal Happy error\n"
happyTcHack :: Int# -> a -> a
happyTcHack x y = y
happyDoSeq, happyDontSeq :: a -> b -> b
happyDoSeq a b = a `seq` b
happyDontSeq a b = b