-- parser produced by Happy Version 1.13

-- This parser is based on ParsedPkgConf.y in compiler/main/
-- It's supposed to do the same thing, but without depending on other GHC modules.
-- The disadvantage is the less sophisticated error reporting, and it's probably
-- slower because it doesn't use FastStrings.

module ParsePkgConfLite{- ( parsePackageConfig, parseOnePackageConfig ) -}where

import Package  ( PackageConfig(..), defaultPackageConfig )
import Char(isSpace, isAlpha, isAlphaNum, isUpper)
import List(break)

data HappyAbsSyn 
	= HappyTerminal Token
	| HappyErrorToken Int
	| HappyAbsSyn5 ([ PackageConfig ])
	| HappyAbsSyn7 (PackageConfig)
	| HappyAbsSyn8 (PackageConfig -> PackageConfig)
	| HappyAbsSyn10 ([String])

type HappyReduction = 
	   Int 
	-> (Token)
	-> HappyState (Token) (HappyStk HappyAbsSyn -> [(Token)] -> HappyAbsSyn)
	-> [HappyState (Token) (HappyStk HappyAbsSyn -> [(Token)] -> HappyAbsSyn)] 
	-> HappyStk HappyAbsSyn 
	-> [(Token)] -> 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 :: Int -> HappyReduction

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 :: HappyReduction

action_0 (14) = happyShift action_7
action_0 (5) = happyGoto action_6
action_0 _ = happyFail

action_1 (19) = happyShift action_5
action_1 (7) = happyGoto action_4
action_1 _ = happyFail

action_2 (14) = happyShift action_3
action_2 _ = happyFail

action_3 (15) = happyShift action_10
action_3 _ = happyFail

action_4 (21) = happyAccept
action_4 _ = happyFail

action_5 (12) = happyShift action_11
action_5 _ = happyFail

action_6 (21) = happyAccept
action_6 _ = happyFail

action_7 (15) = happyShift action_10
action_7 (19) = happyShift action_5
action_7 (6) = happyGoto action_8
action_7 (7) = happyGoto action_9
action_7 _ = happyFail

action_8 (15) = happyShift action_15
action_8 (16) = happyShift action_16
action_8 _ = happyFail

action_9 _ = happyReduce_4

action_10 _ = happyReduce_2

action_11 (18) = happyShift action_14
action_11 (8) = happyGoto action_12
action_11 (9) = happyGoto action_13
action_11 _ = happyFail

action_12 (13) = happyShift action_19
action_12 (16) = happyShift action_20
action_12 _ = happyFail

action_13 _ = happyReduce_7

action_14 (17) = happyShift action_18
action_14 _ = happyFail

action_15 _ = happyReduce_3

action_16 (19) = happyShift action_5
action_16 (7) = happyGoto action_17
action_16 _ = happyFail

action_17 _ = happyReduce_5

action_18 (14) = happyShift action_23
action_18 (20) = happyShift action_24
action_18 (10) = happyGoto action_22
action_18 _ = happyFail

action_19 _ = happyReduce_6

action_20 (18) = happyShift action_14
action_20 (9) = happyGoto action_21
action_20 _ = happyFail

action_21 _ = happyReduce_8

action_22 _ = happyReduce_10

action_23 (15) = happyShift action_26
action_23 (20) = happyShift action_27
action_23 (11) = happyGoto action_25
action_23 _ = happyFail

action_24 _ = happyReduce_9

action_25 (15) = happyShift action_28
action_25 (16) = happyShift action_29
action_25 _ = happyFail

action_26 _ = happyReduce_11

action_27 _ = happyReduce_13

action_28 _ = happyReduce_12

action_29 (20) = happyShift action_30
action_29 _ = happyFail

action_30 _ = happyReduce_14

happyReduce_2 = happySpecReduce_2 5 happyReduction_2
happyReduction_2 _
	_
	 =  HappyAbsSyn5
		 ([]
	)

happyReduce_3 = happySpecReduce_3 5 happyReduction_3
happyReduction_3 _
	(HappyAbsSyn5  happy_var_2)
	_
	 =  HappyAbsSyn5
		 (reverse happy_var_2
	)
happyReduction_3 _ _ _  = notHappyAtAll 

happyReduce_4 = happySpecReduce_1 6 happyReduction_4
happyReduction_4 (HappyAbsSyn7  happy_var_1)
	 =  HappyAbsSyn5
		 ([ happy_var_1 ]
	)
happyReduction_4 _  = notHappyAtAll 

happyReduce_5 = happySpecReduce_3 6 happyReduction_5
happyReduction_5 (HappyAbsSyn7  happy_var_3)
	_
	(HappyAbsSyn5  happy_var_1)
	 =  HappyAbsSyn5
		 (happy_var_3 : happy_var_1
	)
happyReduction_5 _ _ _  = notHappyAtAll 

happyReduce_6 = happyReduce 4 7 happyReduction_6
happyReduction_6 (_ `HappyStk`
	(HappyAbsSyn8  happy_var_3) `HappyStk`
	_ `HappyStk`
	_ `HappyStk`
	happyRest)
	 = HappyAbsSyn7
		 (happy_var_3 defaultPackageConfig
	) `HappyStk` happyRest

happyReduce_7 = happySpecReduce_1 8 happyReduction_7
happyReduction_7 (HappyAbsSyn8  happy_var_1)
	 =  HappyAbsSyn8
		 (\p -> happy_var_1 p
	)
happyReduction_7 _  = notHappyAtAll 

happyReduce_8 = happySpecReduce_3 8 happyReduction_8
happyReduction_8 (HappyAbsSyn8  happy_var_3)
	_
	(HappyAbsSyn8  happy_var_1)
	 =  HappyAbsSyn8
		 (\p -> happy_var_1 (happy_var_3 p)
	)
happyReduction_8 _ _ _  = notHappyAtAll 

happyReduce_9 = happySpecReduce_3 9 happyReduction_9
happyReduction_9 (HappyTerminal (ITstring   happy_var_3))
	_
	(HappyTerminal (ITvarid    happy_var_1))
	 =  HappyAbsSyn8
		 (\p -> case happy_var_1 of
		   "name" -> p{name = happy_var_3}
		   _      -> error "unknown key in config file"
	)
happyReduction_9 _ _ _  = notHappyAtAll 

happyReduce_10 = happySpecReduce_3 9 happyReduction_10
happyReduction_10 (HappyAbsSyn10  happy_var_3)
	_
	(HappyTerminal (ITvarid    happy_var_1))
	 =  HappyAbsSyn8
		 (\p -> case happy_var_1 of
		        "import_dirs"     -> p{import_dirs     = happy_var_3}
		        "library_dirs"    -> p{library_dirs    = happy_var_3}
		        "hs_libraries"    -> p{hs_libraries    = happy_var_3}
		        "extra_libraries" -> p{extra_libraries = happy_var_3}
		        "include_dirs"    -> p{include_dirs    = happy_var_3}
		        "c_includes"      -> p{c_includes      = happy_var_3}
		        "package_deps"    -> p{package_deps    = happy_var_3}
		        "extra_ghc_opts"  -> p{extra_ghc_opts  = happy_var_3}
		        "extra_cc_opts"   -> p{extra_cc_opts   = happy_var_3}
		        "extra_ld_opts"   -> p{extra_ld_opts   = happy_var_3}
		        "framework_dirs"  -> p{framework_dirs  = happy_var_3}
		        "extra_frameworks"-> p{extra_frameworks= happy_var_3}
			_other            -> p
	)
happyReduction_10 _ _ _  = notHappyAtAll 

happyReduce_11 = happySpecReduce_2 10 happyReduction_11
happyReduction_11 _
	_
	 =  HappyAbsSyn10
		 ([]
	)

happyReduce_12 = happySpecReduce_3 10 happyReduction_12
happyReduction_12 _
	(HappyAbsSyn10  happy_var_2)
	_
	 =  HappyAbsSyn10
		 (reverse happy_var_2
	)
happyReduction_12 _ _ _  = notHappyAtAll 

happyReduce_13 = happySpecReduce_1 11 happyReduction_13
happyReduction_13 (HappyTerminal (ITstring   happy_var_1))
	 =  HappyAbsSyn10
		 ([ happy_var_1 ]
	)
happyReduction_13 _  = notHappyAtAll 

happyReduce_14 = happySpecReduce_3 11 happyReduction_14
happyReduction_14 (HappyTerminal (ITstring   happy_var_3))
	_
	(HappyAbsSyn10  happy_var_1)
	 =  HappyAbsSyn10
		 (happy_var_3 : happy_var_1
	)
happyReduction_14 _ _ _  = notHappyAtAll 

happyNewToken action sts stk [] =
	action 21 21 (error "reading EOF!") (HappyState action) sts stk []

happyNewToken action sts stk (tk:tks) =
	let cont i = action i i tk (HappyState action) sts stk tks in
	case tk of {
	ITocurly -> cont 12;
	ITccurly -> cont 13;
	ITobrack -> cont 14;
	ITcbrack -> cont 15;
	ITcomma -> cont 16;
	ITequal -> cont 17;
	ITvarid    happy_dollar_dollar -> cont 18;
	ITconid    happy_dollar_dollar -> cont 19;
	ITstring   happy_dollar_dollar -> cont 20;
	_ -> happyError tks
	}

happyThen = \m k -> k m
happyReturn = \a -> a
happyThen1 = happyThen
happyReturn1 = \a tks -> a

parse tks = happyThen (happyParse action_0 tks) (\x -> case x of {HappyAbsSyn5 z -> happyReturn z; _other -> notHappyAtAll })

parseOne tks = happyThen (happyParse action_1 tks) (\x -> case x of {HappyAbsSyn7 z -> happyReturn z; _other -> notHappyAtAll })

happySeq = happyDontSeq

data Token =
	ITocurly
    |	ITccurly
    |	ITobrack
    |	ITcbrack
    |	ITcomma
    |	ITequal
    |	ITvarid String
    |	ITconid String
    |	ITstring String

lexer :: String -> [Token]

lexer [] = []
lexer ('{':cs) = ITocurly : lexer cs
lexer ('}':cs) = ITccurly : lexer cs
lexer ('[':cs) = ITobrack : lexer cs
lexer (']':cs) = ITcbrack : lexer cs
lexer (',':cs) = ITcomma : lexer cs
lexer ('=':cs) = ITequal : lexer cs
lexer ('"':cs) = lexString cs ""
lexer (c:cs)
    | isSpace c = lexer cs
    | isAlpha c = lexID (c:cs) where
lexer _ = error "Unexpected token"

lexID cs = (if isUpper (head cs) then ITconid else ITvarid) id : lexer rest
    where
	(id,rest) = break (\c -> c /= '_' && not (isAlphaNum c)) cs

lexString ('"':cs) s = ITstring (reverse s) : lexer cs
lexString ('\\':c:cs) s = lexString cs (c:s)
lexString (c:cs) s = lexString cs (c:s)

happyError _ = error "Couldn't parse package configuration."

parsePackageConfig :: String -> [PackageConfig]
parsePackageConfig = parse . lexer

parseOnePackageConfig :: String -> PackageConfig
parseOnePackageConfig = parseOne . lexer
{-# LINE 1 "GenericTemplate.hs" #-}
-- $Id: GenericTemplate.hs,v 1.23 2002/05/23 09:24:27 simonmar Exp $

{-# LINE 15 "GenericTemplate.hs" #-}






















































infixr 9 `HappyStk`
data HappyStk a = HappyStk a (HappyStk a)

-----------------------------------------------------------------------------
-- starting the parse

happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll

-----------------------------------------------------------------------------
-- Accepting the parse

happyAccept j tk st sts (HappyStk ans _) = 

					   (happyReturn1 ans)

-----------------------------------------------------------------------------
-- Arrays only: do the next action

{-# LINE 150 "GenericTemplate.hs" #-}


-----------------------------------------------------------------------------
-- HappyState data type (not arrays)



newtype HappyState b c = HappyState
        (Int ->                    -- token number
         Int ->                    -- token number (yes, again)
         b ->                           -- token semantic value
         HappyState b c ->              -- current state
         [HappyState b c] ->            -- state stack
         c)



-----------------------------------------------------------------------------
-- Shifting a token

happyShift new_state (1) tk st sts stk@(x `HappyStk` _) =
     let i = (case x of { HappyErrorToken (i) -> i }) in
--     trace "shifting the error token" $
     new_state i i tk (HappyState (new_state)) ((st):(sts)) (stk)

happyShift new_state i tk st sts stk =
     happyNewToken new_state ((st):(sts)) ((HappyTerminal (tk))`HappyStk`stk)

-- happyReduce is specialised for the common cases.

happySpecReduce_0 i fn (1) tk st sts stk
     = happyFail (1) tk st sts stk
happySpecReduce_0 nt fn j tk st@((HappyState (action))) sts stk
     = action nt j tk st ((st):(sts)) (fn `HappyStk` stk)

happySpecReduce_1 i fn (1) tk st sts stk
     = happyFail (1) tk st sts stk
happySpecReduce_1 nt fn j tk _ sts@(((st@(HappyState (action))):(_))) (v1`HappyStk`stk')
     = let r = fn v1 in
       happySeq r (action nt j tk st sts (r `HappyStk` stk'))

happySpecReduce_2 i fn (1) tk st sts stk
     = happyFail (1) tk st sts stk
happySpecReduce_2 nt fn j tk _ ((_):(sts@(((st@(HappyState (action))):(_))))) (v1`HappyStk`v2`HappyStk`stk')
     = let r = fn v1 v2 in
       happySeq r (action nt j tk st sts (r `HappyStk` stk'))

happySpecReduce_3 i fn (1) tk st sts stk
     = happyFail (1) tk st sts stk
happySpecReduce_3 nt fn j tk _ ((_):(((_):(sts@(((st@(HappyState (action))):(_))))))) (v1`HappyStk`v2`HappyStk`v3`HappyStk`stk')
     = let r = fn v1 v2 v3 in
       happySeq r (action nt j tk st sts (r `HappyStk` stk'))

happyReduce k i fn (1) tk st sts stk
     = happyFail (1) tk st sts stk
happyReduce k nt fn j tk st sts stk
     = case happyDrop (k - ((1) :: Int)) sts of
	 sts1@(((st1@(HappyState (action))):(_))) ->
        	let r = fn stk in  -- it doesn't hurt to always seq here...
       		happyDoSeq r (action nt j tk st1 sts1 r)

happyMonadReduce k nt fn (1) tk st sts stk
     = happyFail (1) tk st sts stk
happyMonadReduce k nt fn j tk st sts stk =
        happyThen1 (fn stk) (\r -> action nt j tk st1 sts1 (r `HappyStk` drop_stk))
       where sts1@(((st1@(HappyState (action))):(_))) = happyDrop k ((st):(sts))
             drop_stk = happyDropStk k stk

happyDrop (0) l = l
happyDrop n ((_):(t)) = happyDrop (n - ((1) :: Int)) t

happyDropStk (0) l = l
happyDropStk n (x `HappyStk` xs) = happyDropStk (n - ((1)::Int)) xs

-----------------------------------------------------------------------------
-- Moving to a new state after a reduction









happyGoto action j tk st = action j j tk (HappyState action)


-----------------------------------------------------------------------------
-- Error recovery ((1) is the error token)

-- parse error if we are in recovery and we fail again
happyFail  (1) tk old_st _ stk =
--	trace "failing" $ 
    	happyError


{-  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  (1) tk old_st (((HappyState (action))):(sts)) 
						(saved_tok `HappyStk` _ `HappyStk` stk) =
--	trace ("discarding state, depth " ++ show (length stk))  $
	action (1) (1) tk (HappyState (action)) sts ((saved_tok`HappyStk`stk))
-}

-- Enter error recovery: generate an error token,
--                       save the old token and carry on.
happyFail  i tk (HappyState (action)) sts stk =
--      trace "entering error recovery" $
	action (1) (1) tk (HappyState (action)) sts ( (HappyErrorToken (i)) `HappyStk` stk)

-- Internal happy errors:

notHappyAtAll = error "Internal Happy error\n"

-----------------------------------------------------------------------------
-- Hack to get the typechecker to accept our action functions







-----------------------------------------------------------------------------
-- 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 `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.









{-# 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.
