{-# OPTIONS_GHC -w #-}
{-# OPTIONS -XMagicHash -XBangPatterns -XTypeSynonymInstances -XFlexibleInstances -cpp #-}
#if __GLASGOW_HASKELL__ >= 710
{-# OPTIONS_GHC -XPartialTypeSignatures #-}
#endif
-- | Generated parser for text @.dta@ files.
module Data.DTA.Parse (parse) where

import Data.DTA.Base
import qualified Data.DTA.Lex as L
import qualified Data.Array as Happy_Data_Array
import qualified Data.Bits as Bits
import qualified GHC.Exts as Happy_GHC_Exts
import Control.Applicative(Applicative(..))
import Control.Monad (ap)

-- parser produced by Happy Version 1.19.9

newtype HappyAbsSyn t4 t5 t6 t7 = 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)
happyIn4 :: t4 -> HappyAbsSyn t4 t5 t6 t7
happyIn4 t4
x = t4 -> HappyAbsSyn t4 t5 t6 t7
Happy_GHC_Exts.unsafeCoerce# t4
x
{-# INLINE happyIn4 #-}
happyOut4 :: (HappyAbsSyn t4 t5 t6 t7) -> t4
happyOut4 :: HappyAbsSyn t4 t5 t6 t7 -> t4
happyOut4 HappyAbsSyn t4 t5 t6 t7
x = HappyAbsSyn t4 t5 t6 t7 -> t4
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t4 t5 t6 t7
x
{-# INLINE happyOut4 #-}
happyIn5 :: t5 -> (HappyAbsSyn t4 t5 t6 t7)
happyIn5 :: t5 -> HappyAbsSyn t4 t5 t6 t7
happyIn5 t5
x = t5 -> HappyAbsSyn t4 t5 t6 t7
Happy_GHC_Exts.unsafeCoerce# t5
x
{-# INLINE happyIn5 #-}
happyOut5 :: (HappyAbsSyn t4 t5 t6 t7) -> t5
happyOut5 :: HappyAbsSyn t4 t5 t6 t7 -> t5
happyOut5 HappyAbsSyn t4 t5 t6 t7
x = HappyAbsSyn t4 t5 t6 t7 -> t5
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t4 t5 t6 t7
x
{-# INLINE happyOut5 #-}
happyIn6 :: t6 -> (HappyAbsSyn t4 t5 t6 t7)
happyIn6 :: t6 -> HappyAbsSyn t4 t5 t6 t7
happyIn6 t6
x = t6 -> HappyAbsSyn t4 t5 t6 t7
Happy_GHC_Exts.unsafeCoerce# t6
x
{-# INLINE happyIn6 #-}
happyOut6 :: (HappyAbsSyn t4 t5 t6 t7) -> t6
happyOut6 :: HappyAbsSyn t4 t5 t6 t7 -> t6
happyOut6 HappyAbsSyn t4 t5 t6 t7
x = HappyAbsSyn t4 t5 t6 t7 -> t6
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t4 t5 t6 t7
x
{-# INLINE happyOut6 #-}
happyIn7 :: t7 -> (HappyAbsSyn t4 t5 t6 t7)
happyIn7 :: t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7 t7
x = t7 -> HappyAbsSyn t4 t5 t6 t7
Happy_GHC_Exts.unsafeCoerce# t7
x
{-# INLINE happyIn7 #-}
happyOut7 :: (HappyAbsSyn t4 t5 t6 t7) -> t7
happyOut7 :: HappyAbsSyn t4 t5 t6 t7 -> t7
happyOut7 HappyAbsSyn t4 t5 t6 t7
x = HappyAbsSyn t4 t5 t6 t7 -> t7
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t4 t5 t6 t7
x
{-# INLINE happyOut7 #-}
happyInTok :: ((L.AlexPosn, L.Token)) -> (HappyAbsSyn t4 t5 t6 t7)
happyInTok :: (AlexPosn, Token) -> HappyAbsSyn t4 t5 t6 t7
happyInTok (AlexPosn, Token)
x = (AlexPosn, Token) -> HappyAbsSyn t4 t5 t6 t7
Happy_GHC_Exts.unsafeCoerce# (AlexPosn, Token)
x
{-# INLINE happyInTok #-}
happyOutTok :: (HappyAbsSyn t4 t5 t6 t7) -> ((L.AlexPosn, L.Token))
happyOutTok :: HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
happyOutTok HappyAbsSyn t4 t5 t6 t7
x = HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t4 t5 t6 t7
x
{-# INLINE happyOutTok #-}


happyExpList :: HappyAddr
happyExpList :: HappyAddr
happyExpList = Addr# -> HappyAddr
HappyA# Addr#
"\x80\xff\xda\x0f\xf0\x5f\xfb\x01\x00\x00\x00\x00\x00\x00\x00\xf8\xaf\xfd\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xff\xb5\x1f\xe0\xbf\xf6\x03\x00\x00\x00\x80\xff\xda\x0f\x80\x00\x00\x00\x10\x00\x00\x00\x02\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x01\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\x40\x00\x00\x00\x01\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#

{-# NOINLINE happyExpListPerState #-}
happyExpListPerState :: Int -> [[Char]]
happyExpListPerState Int
st =
    [[Char]]
token_strs_expected
  where token_strs :: [[Char]]
token_strs = [[Char]
"error",[Char]
"%dummy",[Char]
"%start_parse",[Char]
"File",[Char]
"Tree",[Char]
"Chunks",[Char]
"Chunk",[Char]
"int",[Char]
"float",[Char]
"var",[Char]
"sym",[Char]
"unhandled",[Char]
"ifdef",[Char]
"else",[Char]
"endif",[Char]
"'('",[Char]
"')'",[Char]
"'{'",[Char]
"'}'",[Char]
"string",[Char]
"'['",[Char]
"']'",[Char]
"define",[Char]
"include",[Char]
"merge",[Char]
"ifndef",[Char]
"autorun",[Char]
"undef",[Char]
"%eof"]
        bit_start :: Int
bit_start = Int
st Int -> Int -> Int
forall a. Num a => a -> a -> a
* Int
29
        bit_end :: Int
bit_end = (Int
st Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1) Int -> Int -> Int
forall a. Num a => a -> a -> a
* Int
29
        read_bit :: Int -> Bool
read_bit = HappyAddr -> Int -> Bool
readArrayBit HappyAddr
happyExpList
        bits :: [Bool]
bits = (Int -> Bool) -> [Int] -> [Bool]
forall a b. (a -> b) -> [a] -> [b]
map Int -> Bool
read_bit [Int
bit_start..Int
bit_end Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
1]
        bits_indexed :: [(Bool, Int)]
bits_indexed = [Bool] -> [Int] -> [(Bool, Int)]
forall a b. [a] -> [b] -> [(a, b)]
zip [Bool]
bits [Int
0..Int
28]
        token_strs_expected :: [[Char]]
token_strs_expected = ((Bool, Int) -> [[Char]]) -> [(Bool, Int)] -> [[Char]]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
concatMap (Bool, Int) -> [[Char]]
f [(Bool, Int)]
bits_indexed
        f :: (Bool, Int) -> [[Char]]
f (Bool
False, Int
_) = []
        f (Bool
True, Int
nr) = [[[Char]]
token_strs [[Char]] -> Int -> [Char]
forall a. [a] -> Int -> a
!! Int
nr]

happyActOffsets :: HappyAddr
happyActOffsets :: HappyAddr
happyActOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\x01\x00\x01\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfd\xff\x00\x00\x00\x00\x01\x00\x01\x00\x00\x00\x01\x00\x07\x00\x09\x00\x0c\x00\x26\x00\x00\x00\x27\x00\x13\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1e\x00\x22\x00\x28\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#

happyGotoOffsets :: HappyAddr
happyGotoOffsets :: HappyAddr
happyGotoOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\x17\x00\x1a\x00\x00\x00\x00\x00\x25\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x20\x00\x00\x00\x23\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"#

happyAdjustOffset :: Happy_GHC_Exts.Int# -> Happy_GHC_Exts.Int#
happyAdjustOffset :: Int# -> Int#
happyAdjustOffset Int#
off = Int#
off

happyDefActions :: HappyAddr
happyDefActions :: HappyAddr
happyDefActions = Addr# -> HappyAddr
HappyA# Addr#
"\xfb\xff\x00\x00\xfe\xff\xfd\xff\xfb\xff\xfa\xff\xf9\xff\xf8\xff\xf7\xff\xf6\xff\x00\x00\xf4\xff\xf3\xff\xfb\xff\xfb\xff\xf0\xff\xfb\xff\x00\x00\x00\x00\x00\x00\x00\x00\xea\xff\x00\x00\x00\x00\xe9\xff\xeb\xff\xec\xff\xed\xff\xee\xff\x00\x00\x00\x00\x00\x00\xf5\xff\xfc\xff\xf2\xff\xf1\xff\xef\xff"#

happyCheck :: HappyAddr
happyCheck :: HappyAddr
happyCheck = Addr# -> HappyAddr
HappyA# Addr#
"\xff\xff\x04\x00\x01\x00\x02\x00\x03\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x09\x00\x04\x00\x0b\x00\x04\x00\x0d\x00\x0e\x00\x04\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x00\x00\x01\x00\x02\x00\x03\x00\x01\x00\x02\x00\x03\x00\x01\x00\x02\x00\x03\x00\x01\x00\x02\x00\x03\x00\x01\x00\x02\x00\x03\x00\x02\x00\x03\x00\x16\x00\x04\x00\x04\x00\xff\xff\x0f\x00\x0c\x00\xff\xff\xff\xff\xff\xff\x0a\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"#

happyTable :: HappyAddr
happyTable :: HappyAddr
happyTable = Addr# -> HappyAddr
HappyA# Addr#
"\x00\x00\x21\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x1d\x00\x0f\x00\x1c\x00\x10\x00\x11\x00\x1b\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x17\x00\x02\x00\x03\x00\x04\x00\x02\x00\x03\x00\x04\x00\x1f\x00\x03\x00\x04\x00\x1e\x00\x03\x00\x04\x00\x1d\x00\x03\x00\x04\x00\x21\x00\x04\x00\xff\xff\x1a\x00\x19\x00\x00\x00\x25\x00\x24\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\x00\x00\x00\x00\x00\x00\x00\x00"#

happyReduceArr :: Array
  Int
  (Int#
   -> (AlexPosn, Token)
   -> Int#
   -> Happy_IntList
   -> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
   -> [(AlexPosn, Token)]
   -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk))
happyReduceArr = (Int, Int)
-> [(Int,
     Int#
     -> (AlexPosn, Token)
     -> Int#
     -> Happy_IntList
     -> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
     -> [(AlexPosn, Token)]
     -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk))]
-> Array
     Int
     (Int#
      -> (AlexPosn, Token)
      -> Int#
      -> Happy_IntList
      -> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
      -> [(AlexPosn, Token)]
      -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk))
forall i e. Ix i => (i, i) -> [(i, e)] -> Array i e
Happy_Data_Array.array (Int
1, Int
22) [
	(Int
1 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_1),
	(Int
2 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_2),
	(Int
3 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_3),
	(Int
4 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_4),
	(Int
5 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_5),
	(Int
6 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_6),
	(Int
7 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_7),
	(Int
8 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_8),
	(Int
9 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_9),
	(Int
10 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_10),
	(Int
11 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_11),
	(Int
12 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_12),
	(Int
13 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_13),
	(Int
14 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_14),
	(Int
15 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_15),
	(Int
16 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_16),
	(Int
17 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_17),
	(Int
18 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_18),
	(Int
19 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_19),
	(Int
20 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_20),
	(Int
21 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_21),
	(Int
22 , Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_22)
	]

happy_n_terms :: Int
happy_n_terms = Int
23 :: Int
happy_n_nonterms :: Int
happy_n_nonterms = Int
4 :: Int

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_1 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_1 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_1  Int#
0# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall t4 t6 t7 t5 t6 t7.
HappyAbsSyn t4 Tree t6 t7 -> HappyAbsSyn DTA t5 t6 t7
happyReduction_1
happyReduction_1 :: HappyAbsSyn t4 Tree t6 t7 -> HappyAbsSyn DTA t5 t6 t7
happyReduction_1 HappyAbsSyn t4 Tree t6 t7
happy_x_1
	 =  case HappyAbsSyn t4 Tree t6 t7 -> Tree
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> t5
happyOut5 HappyAbsSyn t4 Tree t6 t7
happy_x_1 of { Tree
happy_var_1 -> 
	DTA -> HappyAbsSyn DTA t5 t6 t7
forall t4 t5 t6 t7. t4 -> HappyAbsSyn t4 t5 t6 t7
happyIn4
		 (Word8 -> Tree -> DTA
DTA Word8
1 Tree
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_2 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_2 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_1  Int#
1# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall t4 t5 t7 t4 t6 t7.
HappyAbsSyn t4 t5 [Chunk] t7 -> HappyAbsSyn t4 Tree t6 t7
happyReduction_2
happyReduction_2 :: HappyAbsSyn t4 t5 [Chunk] t7 -> HappyAbsSyn t4 Tree t6 t7
happyReduction_2 HappyAbsSyn t4 t5 [Chunk] t7
happy_x_1
	 =  case HappyAbsSyn t4 t5 [Chunk] t7 -> [Chunk]
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> t6
happyOut6 HappyAbsSyn t4 t5 [Chunk] t7
happy_x_1 of { [Chunk]
happy_var_1 -> 
	Tree -> HappyAbsSyn t4 Tree t6 t7
forall t5 t4 t6 t7. t5 -> HappyAbsSyn t4 t5 t6 t7
happyIn5
		 (Word32 -> [Chunk] -> Tree
Tree Word32
0 [Chunk]
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_3 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_3 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_2  Int#
2# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall t4 t5 a t7 t4 t5 t6 t4 t5 t7.
HappyAbsSyn t4 t5 [a] t7
-> HappyAbsSyn t4 t5 t6 a -> HappyAbsSyn t4 t5 [a] t7
happyReduction_3
happyReduction_3 :: HappyAbsSyn t4 t5 [a] t7
-> HappyAbsSyn t4 t5 t6 a -> HappyAbsSyn t4 t5 [a] t7
happyReduction_3 HappyAbsSyn t4 t5 [a] t7
happy_x_2
	HappyAbsSyn t4 t5 t6 a
happy_x_1
	 =  case HappyAbsSyn t4 t5 t6 a -> a
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> t7
happyOut7 HappyAbsSyn t4 t5 t6 a
happy_x_1 of { a
happy_var_1 -> 
	case HappyAbsSyn t4 t5 [a] t7 -> [a]
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> t6
happyOut6 HappyAbsSyn t4 t5 [a] t7
happy_x_2 of { [a]
happy_var_2 -> 
	[a] -> HappyAbsSyn t4 t5 [a] t7
forall t6 t4 t5 t7. t6 -> HappyAbsSyn t4 t5 t6 t7
happyIn6
		 (a
happy_var_1 a -> [a] -> [a]
forall k1. k1 -> [k1] -> [k1]
: [a]
happy_var_2
	)}}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_4 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_4 = Int#
-> HappyAbsSyn DTA Tree [Chunk] Chunk
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_0  Int#
2# HappyAbsSyn DTA Tree [Chunk] Chunk
forall t4 t5 a t7. HappyAbsSyn t4 t5 [a] t7
happyReduction_4
happyReduction_4 :: HappyAbsSyn t4 t5 [a] t7
happyReduction_4  =  [a] -> HappyAbsSyn t4 t5 [a] t7
forall t6 t4 t5 t7. t6 -> HappyAbsSyn t4 t5 t6 t7
happyIn6
		 ([]
	)

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_5 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_5 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_1  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall t4 t5 t6 t7 t4 t5 t6.
HappyAbsSyn t4 t5 t6 t7 -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_5
happyReduction_5 :: HappyAbsSyn t4 t5 t6 t7 -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_5 HappyAbsSyn t4 t5 t6 t7
happy_x_1
	 =  case HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
happyOutTok HappyAbsSyn t4 t5 t6 t7
happy_x_1 of { ((AlexPosn
_, L.Int Int32
happy_var_1)) -> 
	Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (Int32 -> Chunk
Int Int32
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_6 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_6 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_1  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall t4 t5 t6 t7 t4 t5 t6.
HappyAbsSyn t4 t5 t6 t7 -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_6
happyReduction_6 :: HappyAbsSyn t4 t5 t6 t7 -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_6 HappyAbsSyn t4 t5 t6 t7
happy_x_1
	 =  case HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
happyOutTok HappyAbsSyn t4 t5 t6 t7
happy_x_1 of { ((AlexPosn
_, L.Float Float
happy_var_1)) -> 
	Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (Float -> Chunk
Float Float
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_7 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_7 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_1  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall t4 t5 t6 t7 t4 t5 t6.
HappyAbsSyn t4 t5 t6 t7 -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_7
happyReduction_7 :: HappyAbsSyn t4 t5 t6 t7 -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_7 HappyAbsSyn t4 t5 t6 t7
happy_x_1
	 =  case HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
happyOutTok HappyAbsSyn t4 t5 t6 t7
happy_x_1 of { ((AlexPosn
_, L.Var ByteString
happy_var_1)) -> 
	Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (ByteString -> Chunk
Var ByteString
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_8 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_8 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_1  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall t4 t5 t6 t7 t4 t5 t6.
HappyAbsSyn t4 t5 t6 t7 -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_8
happyReduction_8 :: HappyAbsSyn t4 t5 t6 t7 -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_8 HappyAbsSyn t4 t5 t6 t7
happy_x_1
	 =  case HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
happyOutTok HappyAbsSyn t4 t5 t6 t7
happy_x_1 of { ((AlexPosn
_, L.Sym ByteString
happy_var_1)) -> 
	Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (ByteString -> Chunk
Sym ByteString
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_9 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_9 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_1  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall p t4 t5 t6. p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_9
happyReduction_9 :: p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_9 p
happy_x_1
	 =  Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (Chunk
Unhandled
	)

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_10 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_10 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_2  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall t4 t5 t6 t7 p t4 t5 t6.
HappyAbsSyn t4 t5 t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_10
happyReduction_10 :: HappyAbsSyn t4 t5 t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_10 HappyAbsSyn t4 t5 t6 t7
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
happyOutTok HappyAbsSyn t4 t5 t6 t7
happy_x_2 of { ((AlexPosn
_, L.Sym ByteString
happy_var_2)) -> 
	Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (ByteString -> Chunk
IfDef ByteString
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_11 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_11 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_1  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall p t4 t5 t6. p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_11
happyReduction_11 :: p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_11 p
happy_x_1
	 =  Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (Chunk
Else
	)

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_12 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_12 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_1  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall p t4 t5 t6. p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_12
happyReduction_12 :: p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_12 p
happy_x_1
	 =  Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (Chunk
EndIf
	)

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_13 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_13 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_3  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall p t4 t6 t7 p t4 t5 t6.
p -> HappyAbsSyn t4 Tree t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_13
happyReduction_13 :: p -> HappyAbsSyn t4 Tree t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_13 p
happy_x_3
	HappyAbsSyn t4 Tree t6 t7
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn t4 Tree t6 t7 -> Tree
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> t5
happyOut5 HappyAbsSyn t4 Tree t6 t7
happy_x_2 of { Tree
happy_var_2 -> 
	Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (Tree -> Chunk
Parens Tree
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_14 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_14 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_3  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall p t4 t6 t7 p t4 t5 t6.
p -> HappyAbsSyn t4 Tree t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_14
happyReduction_14 :: p -> HappyAbsSyn t4 Tree t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_14 p
happy_x_3
	HappyAbsSyn t4 Tree t6 t7
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn t4 Tree t6 t7 -> Tree
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> t5
happyOut5 HappyAbsSyn t4 Tree t6 t7
happy_x_2 of { Tree
happy_var_2 -> 
	Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (Tree -> Chunk
Braces Tree
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_15 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_15 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_1  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall t4 t5 t6 t7 t4 t5 t6.
HappyAbsSyn t4 t5 t6 t7 -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_15
happyReduction_15 :: HappyAbsSyn t4 t5 t6 t7 -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_15 HappyAbsSyn t4 t5 t6 t7
happy_x_1
	 =  case HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
happyOutTok HappyAbsSyn t4 t5 t6 t7
happy_x_1 of { ((AlexPosn
_, L.String ByteString
happy_var_1)) -> 
	Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (ByteString -> Chunk
String ByteString
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_16 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_16 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_3  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall p t4 t6 t7 p t4 t5 t6.
p -> HappyAbsSyn t4 Tree t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_16
happyReduction_16 :: p -> HappyAbsSyn t4 Tree t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_16 p
happy_x_3
	HappyAbsSyn t4 Tree t6 t7
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn t4 Tree t6 t7 -> Tree
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> t5
happyOut5 HappyAbsSyn t4 Tree t6 t7
happy_x_2 of { Tree
happy_var_2 -> 
	Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (Tree -> Chunk
Brackets Tree
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_17 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_17 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_2  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall t4 t5 t6 t7 p t4 t5 t6.
HappyAbsSyn t4 t5 t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_17
happyReduction_17 :: HappyAbsSyn t4 t5 t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_17 HappyAbsSyn t4 t5 t6 t7
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
happyOutTok HappyAbsSyn t4 t5 t6 t7
happy_x_2 of { ((AlexPosn
_, L.Sym ByteString
happy_var_2)) -> 
	Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (ByteString -> Chunk
Define ByteString
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_18 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_18 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_2  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall t4 t5 t6 t7 p t4 t5 t6.
HappyAbsSyn t4 t5 t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_18
happyReduction_18 :: HappyAbsSyn t4 t5 t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_18 HappyAbsSyn t4 t5 t6 t7
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
happyOutTok HappyAbsSyn t4 t5 t6 t7
happy_x_2 of { ((AlexPosn
_, L.Sym ByteString
happy_var_2)) -> 
	Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (ByteString -> Chunk
Include ByteString
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_19 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_19 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_2  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall t4 t5 t6 t7 p t4 t5 t6.
HappyAbsSyn t4 t5 t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_19
happyReduction_19 :: HappyAbsSyn t4 t5 t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_19 HappyAbsSyn t4 t5 t6 t7
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
happyOutTok HappyAbsSyn t4 t5 t6 t7
happy_x_2 of { ((AlexPosn
_, L.Sym ByteString
happy_var_2)) -> 
	Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (ByteString -> Chunk
Merge ByteString
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_20 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_20 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_2  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall t4 t5 t6 t7 p t4 t5 t6.
HappyAbsSyn t4 t5 t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_20
happyReduction_20 :: HappyAbsSyn t4 t5 t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_20 HappyAbsSyn t4 t5 t6 t7
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
happyOutTok HappyAbsSyn t4 t5 t6 t7
happy_x_2 of { ((AlexPosn
_, L.Sym ByteString
happy_var_2)) -> 
	Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (ByteString -> Chunk
IfNDef ByteString
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_21 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_21 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_1  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall p t4 t5 t6. p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_21
happyReduction_21 :: p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_21 p
happy_x_1
	 =  Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (Chunk
Autorun
	)

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_22 :: Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyReduce_22 = Int#
-> (HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk
    -> HappyAbsSyn DTA Tree [Chunk] Chunk)
-> Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happySpecReduce_2  Int#
3# HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
-> HappyAbsSyn DTA Tree [Chunk] Chunk
forall t4 t5 t6 t7 p t4 t5 t6.
HappyAbsSyn t4 t5 t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_22
happyReduction_22 :: HappyAbsSyn t4 t5 t6 t7 -> p -> HappyAbsSyn t4 t5 t6 Chunk
happyReduction_22 HappyAbsSyn t4 t5 t6 t7
happy_x_2
	p
happy_x_1
	 =  case HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> (AlexPosn, Token)
happyOutTok HappyAbsSyn t4 t5 t6 t7
happy_x_2 of { ((AlexPosn
_, L.Sym ByteString
happy_var_2)) -> 
	Chunk -> HappyAbsSyn t4 t5 t6 Chunk
forall t7 t4 t5 t6. t7 -> HappyAbsSyn t4 t5 t6 t7
happyIn7
		 (ByteString -> Chunk
Undef ByteString
happy_var_2
	)}

happyNewToken :: Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyNewToken Int#
action Happy_IntList
sts HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
stk [] =
	Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyDoAction Int#
22# (AlexPosn, Token)
forall a. a
notHappyAtAll Int#
action Happy_IntList
sts HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
stk []

happyNewToken Int#
action Happy_IntList
sts HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
stk ((AlexPosn, Token)
tk:[(AlexPosn, Token)]
tks) =
	let cont :: Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
i = Int#
-> (AlexPosn, Token)
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyDoAction Int#
i (AlexPosn, Token)
tk Int#
action Happy_IntList
sts HappyStk (HappyAbsSyn DTA Tree [Chunk] Chunk)
stk [(AlexPosn, Token)]
tks in
	case (AlexPosn, Token)
tk of {
	(AlexPosn
_, L.Int Int32
happy_dollar_dollar) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
1#;
	(AlexPosn
_, L.Float Float
happy_dollar_dollar) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
2#;
	(AlexPosn
_, L.Var ByteString
happy_dollar_dollar) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
3#;
	(AlexPosn
_, L.Sym ByteString
happy_dollar_dollar) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
4#;
	(AlexPosn
_, Token
L.Unhandled) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
5#;
	(AlexPosn
_, Token
L.IfDef) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
6#;
	(AlexPosn
_, Token
L.Else) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
7#;
	(AlexPosn
_, Token
L.EndIf) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
8#;
	(AlexPosn
_, Token
L.LParen) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
9#;
	(AlexPosn
_, Token
L.RParen) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
10#;
	(AlexPosn
_, Token
L.LBrace) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
11#;
	(AlexPosn
_, Token
L.RBrace) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
12#;
	(AlexPosn
_, L.String ByteString
happy_dollar_dollar) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
13#;
	(AlexPosn
_, Token
L.LBracket) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
14#;
	(AlexPosn
_, Token
L.RBracket) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
15#;
	(AlexPosn
_, Token
L.Define) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
16#;
	(AlexPosn
_, Token
L.Include) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
17#;
	(AlexPosn
_, Token
L.Merge) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
18#;
	(AlexPosn
_, Token
L.IfNDef) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
19#;
	(AlexPosn
_, Token
L.Autorun) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
20#;
	(AlexPosn
_, Token
L.Undef) -> Int# -> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
cont Int#
21#;
	(AlexPosn, Token)
_ -> ([(AlexPosn, Token)], [[Char]])
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
forall a. ([(AlexPosn, Token)], [[Char]]) -> HappyIdentity a
happyError' (((AlexPosn, Token)
tk(AlexPosn, Token) -> [(AlexPosn, Token)] -> [(AlexPosn, Token)]
forall k1. k1 -> [k1] -> [k1]
:[(AlexPosn, Token)]
tks), [])
	}

happyError_ :: [[Char]]
-> Int#
-> (AlexPosn, Token)
-> [(AlexPosn, Token)]
-> HappyIdentity a
happyError_ [[Char]]
explist Int#
22# (AlexPosn, Token)
tk [(AlexPosn, Token)]
tks = ([(AlexPosn, Token)], [[Char]]) -> HappyIdentity a
forall a. ([(AlexPosn, Token)], [[Char]]) -> HappyIdentity a
happyError' ([(AlexPosn, Token)]
tks, [[Char]]
explist)
happyError_ [[Char]]
explist Int#
_ (AlexPosn, Token)
tk [(AlexPosn, Token)]
tks = ([(AlexPosn, Token)], [[Char]]) -> HappyIdentity a
forall a. ([(AlexPosn, Token)], [[Char]]) -> HappyIdentity a
happyError' (((AlexPosn, Token)
tk(AlexPosn, Token) -> [(AlexPosn, Token)] -> [(AlexPosn, Token)]
forall k1. k1 -> [k1] -> [k1]
:[(AlexPosn, Token)]
tks), [[Char]]
explist)

newtype HappyIdentity a = HappyIdentity a
happyIdentity :: a -> HappyIdentity a
happyIdentity = a -> HappyIdentity a
forall a. a -> HappyIdentity a
HappyIdentity
happyRunIdentity :: HappyIdentity a -> a
happyRunIdentity (HappyIdentity a
a) = a
a

instance Functor HappyIdentity where
    fmap :: (a -> b) -> HappyIdentity a -> HappyIdentity b
fmap a -> b
f (HappyIdentity a
a) = b -> HappyIdentity b
forall a. a -> HappyIdentity a
HappyIdentity (a -> b
f a
a)

instance Applicative HappyIdentity where
    pure :: a -> HappyIdentity a
pure  = a -> HappyIdentity a
forall a. a -> HappyIdentity a
HappyIdentity
    <*> :: HappyIdentity (a -> b) -> HappyIdentity a -> HappyIdentity b
(<*>) = HappyIdentity (a -> b) -> HappyIdentity a -> HappyIdentity b
forall (m :: * -> *) a b. Monad m => m (a -> b) -> m a -> m b
ap
instance Monad HappyIdentity where
    return :: a -> HappyIdentity a
return = a -> HappyIdentity a
forall (f :: * -> *) a. Applicative f => a -> f a
pure
    (HappyIdentity a
p) >>= :: HappyIdentity a -> (a -> HappyIdentity b) -> HappyIdentity b
>>= a -> HappyIdentity b
q = a -> HappyIdentity b
q a
p

happyThen :: () => HappyIdentity a -> (a -> HappyIdentity b) -> HappyIdentity b
happyThen :: HappyIdentity a -> (a -> HappyIdentity b) -> HappyIdentity b
happyThen = HappyIdentity a -> (a -> HappyIdentity b) -> HappyIdentity b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
(>>=)
happyReturn :: () => a -> HappyIdentity a
happyReturn :: a -> HappyIdentity a
happyReturn = (a -> HappyIdentity a
forall (m :: * -> *) a. Monad m => a -> m a
return)
happyThen1 :: m t -> (t -> t -> m b) -> t -> m b
happyThen1 m t
m t -> t -> m b
k t
tks = m t -> (t -> m b) -> m b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
(>>=) m t
m (\t
a -> t -> t -> m b
k t
a t
tks)
happyReturn1 :: () => a -> b -> HappyIdentity a
happyReturn1 :: a -> b -> HappyIdentity a
happyReturn1 = \a
a b
tks -> (a -> HappyIdentity a
forall (m :: * -> *) a. Monad m => a -> m a
return) a
a
happyError' :: () => ([((L.AlexPosn, L.Token))], [String]) -> HappyIdentity a
happyError' :: ([(AlexPosn, Token)], [[Char]]) -> HappyIdentity a
happyError' = a -> HappyIdentity a
forall a. a -> HappyIdentity a
HappyIdentity (a -> HappyIdentity a)
-> (([(AlexPosn, Token)], [[Char]]) -> a)
-> ([(AlexPosn, Token)], [[Char]])
-> HappyIdentity a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (\([(AlexPosn, Token)]
tokens, [[Char]]
_) -> [(AlexPosn, Token)] -> a
forall a. [(AlexPosn, Token)] -> a
parseError [(AlexPosn, Token)]
tokens)
parse :: [(AlexPosn, Token)] -> DTA
parse [(AlexPosn, Token)]
tks = HappyIdentity DTA -> DTA
forall a. HappyIdentity a -> a
happyRunIdentity HappyIdentity DTA
happySomeParser where
 happySomeParser :: HappyIdentity DTA
happySomeParser = HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
-> (HappyAbsSyn DTA Tree [Chunk] Chunk -> HappyIdentity DTA)
-> HappyIdentity DTA
forall a b.
HappyIdentity a -> (a -> HappyIdentity b) -> HappyIdentity b
happyThen (Int#
-> [(AlexPosn, Token)]
-> HappyIdentity (HappyAbsSyn DTA Tree [Chunk] Chunk)
happyParse Int#
0# [(AlexPosn, Token)]
tks) (\HappyAbsSyn DTA Tree [Chunk] Chunk
x -> DTA -> HappyIdentity DTA
forall a. a -> HappyIdentity a
happyReturn (HappyAbsSyn DTA Tree [Chunk] Chunk -> DTA
forall t4 t5 t6 t7. HappyAbsSyn t4 t5 t6 t7 -> t4
happyOut4 HappyAbsSyn DTA Tree [Chunk] Chunk
x))

happySeq :: a -> b -> b
happySeq = a -> b -> b
forall a b. a -> b -> b
happyDontSeq


-- | If instead of this error, "Internal Happy error" is sometimes printed, make
-- sure you are using Happy 1.18.7 or later.
parseError :: [(L.AlexPosn, L.Token)] -> a
parseError :: [(AlexPosn, Token)] -> a
parseError [] = [Char] -> a
forall a. HasCallStack => [Char] -> a
error [Char]
"Parse error at EOF"
parseError ((L.AlexPn Int
_ Int
ln Int
col, Token
tok) : [(AlexPosn, Token)]
_) = [Char] -> a
forall a. HasCallStack => [Char] -> a
error ([Char] -> a) -> [Char] -> a
forall a b. (a -> b) -> a -> b
$
  [Char]
"Parse error at " [Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ Int -> [Char]
forall a. Show a => a -> [Char]
show Int
ln [Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ [Char]
":" [Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ Int -> [Char]
forall a. Show a => a -> [Char]
show Int
col [Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ [Char]
", token " [Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ Token -> [Char]
forall a. Show a => a -> [Char]
show Token
tok
{-# LINE 1 "templates/GenericTemplate.hs" #-}
{-# LINE 1 "templates/GenericTemplate.hs" #-}
{-# LINE 1 "<built-in>" #-}
{-# LINE 1 "<command-line>" #-}
{-# LINE 10 "<command-line>" #-}
# 1 "/usr/include/stdc-predef.h" 1 3 4

# 17 "/usr/include/stdc-predef.h" 3 4














































{-# LINE 10 "<command-line>" #-}
{-# LINE 1 "/opt/ghc/8.6.3/lib/ghc-8.6.3/include/ghcversion.h" #-}















{-# LINE 10 "<command-line>" #-}
{-# LINE 1 "/tmp/ghc780_0/ghc_2.h" #-}






































































































































































































{-# LINE 10 "<command-line>" #-}
{-# LINE 1 "templates/GenericTemplate.hs" #-}
-- Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp 













-- Do not remove this comment. Required to fix CPP parsing when using GCC and a clang-compiled alex.
#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
{-# LINE 43 "templates/GenericTemplate.hs" #-}

data Happy_IntList = HappyCons Happy_GHC_Exts.Int# Happy_IntList







{-# LINE 65 "templates/GenericTemplate.hs" #-}

{-# LINE 75 "templates/GenericTemplate.hs" #-}

{-# LINE 84 "templates/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

-- If the current token is 0#, it means we've just accepted a partial
-- parse (a %partial parser).  We must ignore the saved token on the top of
-- the stack in this case.
happyAccept 0# tk st sts (_ `HappyStk` ans `HappyStk` _) =
        happyReturn1 ans
happyAccept j tk st sts (HappyStk ans _) = 
        (happyTcHack j (happyTcHack st)) (happyReturn1 ans)

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



happyDoAction i tk st
        = {- nothing -}


          case action of
                0#           -> {- nothing -}
                                     happyFail (happyExpListPerState ((Happy_GHC_Exts.I# (st)) :: Int)) i tk st
                -1#          -> {- nothing -}
                                     happyAccept i tk st
                n | LT(n,(0# :: Happy_GHC_Exts.Int#)) -> {- nothing -}

                                                   (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                 -> {- nothing -}


                                     happyShift new_state i tk st
                                     where new_state = (n Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#))
   where off    = happyAdjustOffset (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#




{-# INLINE happyLt #-}
happyLt x y = LT(x,y)


readArrayBit arr bit =
    Bits.testBit (Happy_GHC_Exts.I# (indexShortOffAddr arr ((unbox_int bit) `Happy_GHC_Exts.iShiftRA#` 4#))) (bit `mod` 16)
  where unbox_int (Happy_GHC_Exts.I# x) = x






data HappyAddr = HappyA# Happy_GHC_Exts.Addr#


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

{-# LINE 180 "templates/GenericTemplate.hs" #-}

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

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
--     trace "shifting the error token" $
     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)

-- happyReduce is specialised for the common cases.

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  -- it doesn't hurt to always seq here...
                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 = happyAdjustOffset (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

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


happyGoto nt j tk st = 
   {- nothing -}
   happyDoAction j tk new_state
   where off = happyAdjustOffset (indexShortOffAddr happyGotoOffsets st)
         off_i = (off Happy_GHC_Exts.+#  nt)
         new_state = indexShortOffAddr happyTable off_i




-----------------------------------------------------------------------------
-- Error recovery (0# is the error token)

-- parse error if we are in recovery and we fail again
happyFail explist 0# tk old_st _ stk@(x `HappyStk` _) =
     let i = (case Happy_GHC_Exts.unsafeCoerce# x of { (Happy_GHC_Exts.I# (i)) -> i }) in
--      trace "failing" $ 
        happyError_ explist i tk

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

-- Enter error recovery: generate an error token,
--                       save the old token and carry on.
happyFail explist i tk (action) sts stk =
--      trace "entering error recovery" $
        happyDoAction 0# tk action sts ( (Happy_GHC_Exts.unsafeCoerce# (Happy_GHC_Exts.I# (i))) `HappyStk` stk)

-- Internal happy errors:

notHappyAtAll :: a
notHappyAtAll = error "Internal Happy error\n"

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


happyTcHack :: Happy_GHC_Exts.Int# -> a -> a
happyTcHack x y = y
{-# INLINE happyTcHack #-}


-----------------------------------------------------------------------------
-- 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 happyDoAction #-}
{-# NOINLINE happyTable #-}
{-# NOINLINE happyCheck #-}
{-# NOINLINE happyActOffsets #-}
{-# NOINLINE happyGotoOffsets #-}
{-# NOINLINE happyDefActions #-}

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