{-# OPTIONS_GHC -w #-}
{-# OPTIONS -XMagicHash -XBangPatterns -XTypeSynonymInstances -XFlexibleInstances -cpp #-}
#if __GLASGOW_HASKELL__ >= 710
{-# OPTIONS_GHC -XPartialTypeSignatures #-}
#endif
{-# LANGUAGE CPP               #-}
{-# LANGUAGE OverloadedStrings #-}

{-# OPTIONS_GHC -fno-warn-incomplete-patterns #-}
{-# OPTIONS_GHC -fno-warn-missing-signatures  #-}
{-# OPTIONS_GHC -fno-warn-name-shadowing      #-}
{-# OPTIONS_GHC -fno-warn-tabs                #-}
{-# OPTIONS_GHC -fno-warn-unused-binds        #-}
{-# OPTIONS_GHC -fno-warn-unused-matches      #-}

module Language.Sexp.Parser
  ( parseSexp_
  , parseSexps_
  ) where

import qualified Data.ByteString.Lazy.Char8 as B8
import qualified Data.List.NonEmpty as NE
import Data.Maybe (catMaybes)
import qualified Data.Scientific
import Data.Text (Text)
import qualified Data.Text as T
import Data.Text.Prettyprint.Doc

#if MIN_VERSION_prettyprinter(1,7,0)
import qualified Data.Text.Prettyprint.Doc.Render.String as Render
#else
import qualified Data.Text.Prettyprint.Doc.Render.ShowS as Render
#endif

import Language.Sexp.Token
import Language.Sexp.Lexer
import Language.Sexp.Types
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.20.0

newtype HappyAbsSyn t11 t12 t13 = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
newtype HappyWrap5 = HappyWrap5 ([Sexp])
happyIn5 :: ([Sexp]) -> (HappyAbsSyn t11 t12 t13)
happyIn5 :: forall t11 t12 t13. [Sexp] -> HappyAbsSyn t11 t12 t13
happyIn5 [Sexp]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([Sexp] -> HappyWrap5
HappyWrap5 [Sexp]
x)
{-# INLINE happyIn5 #-}
happyOut5 :: (HappyAbsSyn t11 t12 t13) -> HappyWrap5
happyOut5 :: forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap5
happyOut5 HappyAbsSyn t11 t12 t13
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t11 t12 t13
x
{-# INLINE happyOut5 #-}
newtype HappyWrap6 = HappyWrap6 ([Sexp])
happyIn6 :: ([Sexp]) -> (HappyAbsSyn t11 t12 t13)
happyIn6 :: forall t11 t12 t13. [Sexp] -> HappyAbsSyn t11 t12 t13
happyIn6 [Sexp]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([Sexp] -> HappyWrap6
HappyWrap6 [Sexp]
x)
{-# INLINE happyIn6 #-}
happyOut6 :: (HappyAbsSyn t11 t12 t13) -> HappyWrap6
happyOut6 :: forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap6
happyOut6 HappyAbsSyn t11 t12 t13
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t11 t12 t13
x
{-# INLINE happyOut6 #-}
newtype HappyWrap7 = HappyWrap7 (Sexp)
happyIn7 :: (Sexp) -> (HappyAbsSyn t11 t12 t13)
happyIn7 :: forall t11 t12 t13. Sexp -> HappyAbsSyn t11 t12 t13
happyIn7 Sexp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (Sexp -> HappyWrap7
HappyWrap7 Sexp
x)
{-# INLINE happyIn7 #-}
happyOut7 :: (HappyAbsSyn t11 t12 t13) -> HappyWrap7
happyOut7 :: forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap7
happyOut7 HappyAbsSyn t11 t12 t13
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t11 t12 t13
x
{-# INLINE happyOut7 #-}
newtype HappyWrap8 = HappyWrap8 (Sexp)
happyIn8 :: (Sexp) -> (HappyAbsSyn t11 t12 t13)
happyIn8 :: forall t11 t12 t13. Sexp -> HappyAbsSyn t11 t12 t13
happyIn8 Sexp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (Sexp -> HappyWrap8
HappyWrap8 Sexp
x)
{-# INLINE happyIn8 #-}
happyOut8 :: (HappyAbsSyn t11 t12 t13) -> HappyWrap8
happyOut8 :: forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap8
happyOut8 HappyAbsSyn t11 t12 t13
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t11 t12 t13
x
{-# INLINE happyOut8 #-}
newtype HappyWrap9 = HappyWrap9 (Maybe Sexp)
happyIn9 :: (Maybe Sexp) -> (HappyAbsSyn t11 t12 t13)
happyIn9 :: forall t11 t12 t13. Maybe Sexp -> HappyAbsSyn t11 t12 t13
happyIn9 Maybe Sexp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (Maybe Sexp -> HappyWrap9
HappyWrap9 Maybe Sexp
x)
{-# INLINE happyIn9 #-}
happyOut9 :: (HappyAbsSyn t11 t12 t13) -> HappyWrap9
happyOut9 :: forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap9
happyOut9 HappyAbsSyn t11 t12 t13
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t11 t12 t13
x
{-# INLINE happyOut9 #-}
newtype HappyWrap10 = HappyWrap10 (LocatedBy Position Atom)
happyIn10 :: (LocatedBy Position Atom) -> (HappyAbsSyn t11 t12 t13)
happyIn10 :: forall t11 t12 t13.
LocatedBy Position Atom -> HappyAbsSyn t11 t12 t13
happyIn10 LocatedBy Position Atom
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (LocatedBy Position Atom -> HappyWrap10
HappyWrap10 LocatedBy Position Atom
x)
{-# INLINE happyIn10 #-}
happyOut10 :: (HappyAbsSyn t11 t12 t13) -> HappyWrap10
happyOut10 :: forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap10
happyOut10 HappyAbsSyn t11 t12 t13
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t11 t12 t13
x
{-# INLINE happyOut10 #-}
happyIn11 :: t11 -> (HappyAbsSyn t11 t12 t13)
happyIn11 :: forall t11 t12 t13. t11 -> HappyAbsSyn t11 t12 t13
happyIn11 t11
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# t11
x
{-# INLINE happyIn11 #-}
happyOut11 :: (HappyAbsSyn t11 t12 t13) -> t11
happyOut11 :: forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> t11
happyOut11 HappyAbsSyn t11 t12 t13
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t11 t12 t13
x
{-# INLINE happyOut11 #-}
happyIn12 :: t12 -> (HappyAbsSyn t11 t12 t13)
happyIn12 :: forall t12 t11 t13. t12 -> HappyAbsSyn t11 t12 t13
happyIn12 t12
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# t12
x
{-# INLINE happyIn12 #-}
happyOut12 :: (HappyAbsSyn t11 t12 t13) -> t12
happyOut12 :: forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> t12
happyOut12 HappyAbsSyn t11 t12 t13
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t11 t12 t13
x
{-# INLINE happyOut12 #-}
happyIn13 :: t13 -> (HappyAbsSyn t11 t12 t13)
happyIn13 :: forall t13 t11 t12. t13 -> HappyAbsSyn t11 t12 t13
happyIn13 t13
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# t13
x
{-# INLINE happyIn13 #-}
happyOut13 :: (HappyAbsSyn t11 t12 t13) -> t13
happyOut13 :: forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> t13
happyOut13 HappyAbsSyn t11 t12 t13
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t11 t12 t13
x
{-# INLINE happyOut13 #-}
happyInTok :: (LocatedBy Position Token) -> (HappyAbsSyn t11 t12 t13)
happyInTok :: forall t11 t12 t13.
LocatedBy Position Token -> HappyAbsSyn t11 t12 t13
happyInTok LocatedBy Position Token
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# LocatedBy Position Token
x
{-# INLINE happyInTok #-}
happyOutTok :: (HappyAbsSyn t11 t12 t13) -> (LocatedBy Position Token)
happyOutTok :: forall t11 t12 t13.
HappyAbsSyn t11 t12 t13 -> LocatedBy Position Token
happyOutTok HappyAbsSyn t11 t12 t13
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t11 t12 t13
x
{-# INLINE happyOutTok #-}


happyExpList :: HappyAddr
happyExpList :: HappyAddr
happyExpList = Addr# -> HappyAddr
HappyA# Addr#
"\x00\xa0\x7a\x00\x80\xea\x03\x00\xaa\x0f\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\xea\x03\x00\xaa\x0f\x00\xa8\x3e\x00\xa0\xfa\x00\x80\xea\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\xea\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x04\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#

{-# NOINLINE happyExpListPerState #-}
happyExpListPerState :: Int -> [a]
happyExpListPerState Int
st =
    [a]
token_strs_expected
  where token_strs :: [a]
token_strs = [a
"error",a
"%dummy",a
"%start_parseSexp_",a
"%start_parseSexps_",a
"Sexps_",a
"Sexps",a
"Sexp_",a
"Sexp",a
"MSexp",a
"Atom",a
"list__MSexp__",a
"list1__MSexp__",a
"rev_list1__MSexp__",a
"'('",a
"')'",a
"'['",a
"']'",a
"'{'",a
"'}'",a
"PREFIX",a
"SYMBOL",a
"NUMBER",a
"STRING",a
"COMMENT",a
"EOF",a
"%eof"]
        bit_start :: Int
bit_start = Int
st forall a. Num a => a -> a -> a
Prelude.* Int
26
        bit_end :: Int
bit_end = (Int
st forall a. Num a => a -> a -> a
Prelude.+ Int
1) forall a. Num a => a -> a -> a
Prelude.* Int
26
        read_bit :: Int -> Bool
read_bit = HappyAddr -> Int -> Bool
readArrayBit HappyAddr
happyExpList
        bits :: [Bool]
bits = forall a b. (a -> b) -> [a] -> [b]
Prelude.map Int -> Bool
read_bit [Int
bit_start..Int
bit_end forall a. Num a => a -> a -> a
Prelude.- Int
1]
        bits_indexed :: [(Bool, Int)]
bits_indexed = forall a b. [a] -> [b] -> [(a, b)]
Prelude.zip [Bool]
bits [Int
0..Int
25]
        token_strs_expected :: [a]
token_strs_expected = forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
Prelude.concatMap (Bool, Int) -> [a]
f [(Bool, Int)]
bits_indexed
        f :: (Bool, Int) -> [a]
f (Bool
Prelude.False, Int
_) = []
        f (Bool
Prelude.True, Int
nr) = [[a]
token_strs forall a. [a] -> Int -> a
Prelude.!! Int
nr]

happyActOffsets :: HappyAddr
happyActOffsets :: HappyAddr
happyActOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\x0c\x00\x01\x00\x01\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x01\x00\x01\x00\x01\x00\x0c\x00\x00\x00\x00\x00\x00\x00\x0c\x00\x05\x00\x05\x00\x0d\x00\x00\x00\x00\x00\x00\x00\x08\x00\x1d\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#

happyGotoOffsets :: HappyAddr
happyGotoOffsets :: HappyAddr
happyGotoOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\x3e\x00\x17\x00\x1f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x41\x00\x27\x00\x2f\x00\x37\x00\xfe\xff\x00\x00\x00\x00\x00\x00\x02\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#
"\x00\x00\xf0\xff\x00\x00\x00\x00\xf5\xff\xed\xff\xfa\xff\xfc\xff\xef\xff\xee\xff\xf0\xff\xf0\xff\xf0\xff\x00\x00\xf1\xff\xf3\xff\xf2\xff\x00\x00\x00\x00\x00\x00\x00\x00\xfb\xff\xf4\xff\xf6\xff\x00\x00\x00\x00\x00\x00\xec\xff\xfd\xff\xf9\xff\xf8\xff\xf7\xff"#

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

happyReduceArr :: Array
  Int
  (Int#
   -> LocatedBy Position Token
   -> Int#
   -> Happy_IntList
   -> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
   -> [LocatedBy Position Token]
   -> Either
        String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]))
happyReduceArr = forall i e. Ix i => (i, i) -> [(i, e)] -> Array i e
Happy_Data_Array.array (Int
2, Int
19) [
	(Int
2 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_2),
	(Int
3 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_3),
	(Int
4 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_4),
	(Int
5 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_5),
	(Int
6 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_6),
	(Int
7 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_7),
	(Int
8 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_8),
	(Int
9 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_9),
	(Int
10 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_10),
	(Int
11 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_11),
	(Int
12 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_12),
	(Int
13 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_13),
	(Int
14 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_14),
	(Int
15 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_15),
	(Int
16 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_16),
	(Int
17 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_17),
	(Int
18 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_18),
	(Int
19 , Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_19)
	]

happy_n_terms :: Int
happy_n_terms = Int
14 :: Prelude.Int
happy_n_nonterms :: Int
happy_n_nonterms = Int
9 :: Prelude.Int

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_2 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_2 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_2  Int#
0# forall {p} {t11} {t12} {t13} {t11} {t12} {t13}.
p -> HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_2
happyReduction_2 :: p -> HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_2 p
happy_x_2
	HappyAbsSyn t11 t12 t13
happy_x_1
	 =  case forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap6
happyOut6 HappyAbsSyn t11 t12 t13
happy_x_1 of { (HappyWrap6 [Sexp]
happy_var_1) -> 
	forall t11 t12 t13. [Sexp] -> HappyAbsSyn t11 t12 t13
happyIn5
		 ([Sexp]
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_3 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_3 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_1  Int#
1# forall {t12} {t13} {t11} {t12} {t13}.
HappyAbsSyn [Maybe Sexp] t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_3
happyReduction_3 :: HappyAbsSyn [Maybe Sexp] t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_3 HappyAbsSyn [Maybe Sexp] t12 t13
happy_x_1
	 =  case forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> t11
happyOut11 HappyAbsSyn [Maybe Sexp] t12 t13
happy_x_1 of { [Maybe Sexp]
happy_var_1 -> 
	forall t11 t12 t13. [Sexp] -> HappyAbsSyn t11 t12 t13
happyIn6
		 (forall a. [Maybe a] -> [a]
catMaybes [Maybe Sexp]
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_4 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_4 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_2  Int#
2# forall {p} {t11} {t12} {t13} {t11} {t12} {t13}.
p -> HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_4
happyReduction_4 :: p -> HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_4 p
happy_x_2
	HappyAbsSyn t11 t12 t13
happy_x_1
	 =  case forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap8
happyOut8 HappyAbsSyn t11 t12 t13
happy_x_1 of { (HappyWrap8 Sexp
happy_var_1) -> 
	forall t11 t12 t13. Sexp -> HappyAbsSyn t11 t12 t13
happyIn7
		 (Sexp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_5 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_5 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_1  Int#
3# forall {t11} {t12} {t13} {t11} {t12} {t13}.
HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_5
happyReduction_5 :: HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_5 HappyAbsSyn t11 t12 t13
happy_x_1
	 =  case forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap10
happyOut10 HappyAbsSyn t11 t12 t13
happy_x_1 of { (HappyWrap10 LocatedBy Position Atom
happy_var_1) -> 
	forall t11 t12 t13. Sexp -> HappyAbsSyn t11 t12 t13
happyIn8
		 (forall e. Atom -> SexpF e
AtomF                       forall a (e :: * -> *) p.
(a -> e (Fix (Compose (LocatedBy p) e)))
-> LocatedBy p a -> Fix (Compose (LocatedBy p) e)
@@ LocatedBy Position Atom
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_6 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_6 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_3  Int#
3# forall {p} {t11} {t12} {t13} {t11} {t12} {t13} {t11} {t12} {t13}.
p
-> HappyAbsSyn t11 t12 t13
-> HappyAbsSyn t11 t12 t13
-> HappyAbsSyn t11 t12 t13
happyReduction_6
happyReduction_6 :: p
-> HappyAbsSyn t11 t12 t13
-> HappyAbsSyn t11 t12 t13
-> HappyAbsSyn t11 t12 t13
happyReduction_6 p
happy_x_3
	HappyAbsSyn t11 t12 t13
happy_x_2
	HappyAbsSyn t11 t12 t13
happy_x_1
	 =  case forall t11 t12 t13.
HappyAbsSyn t11 t12 t13 -> LocatedBy Position Token
happyOutTok HappyAbsSyn t11 t12 t13
happy_x_1 of { LocatedBy Position Token
happy_var_1 -> 
	case forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap6
happyOut6 HappyAbsSyn t11 t12 t13
happy_x_2 of { (HappyWrap6 [Sexp]
happy_var_2) -> 
	forall t11 t12 t13. Sexp -> HappyAbsSyn t11 t12 t13
happyIn8
		 (forall a b. a -> b -> a
const (forall e. [e] -> SexpF e
ParenListF [Sexp]
happy_var_2)       forall a (e :: * -> *) p.
(a -> e (Fix (Compose (LocatedBy p) e)))
-> LocatedBy p a -> Fix (Compose (LocatedBy p) e)
@@ LocatedBy Position Token
happy_var_1
	)}}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_7 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_7 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_3  Int#
3# forall {p} {t11} {t12} {t13} {t11} {t12} {t13} {t11} {t12} {t13}.
p
-> HappyAbsSyn t11 t12 t13
-> HappyAbsSyn t11 t12 t13
-> HappyAbsSyn t11 t12 t13
happyReduction_7
happyReduction_7 :: p
-> HappyAbsSyn t11 t12 t13
-> HappyAbsSyn t11 t12 t13
-> HappyAbsSyn t11 t12 t13
happyReduction_7 p
happy_x_3
	HappyAbsSyn t11 t12 t13
happy_x_2
	HappyAbsSyn t11 t12 t13
happy_x_1
	 =  case forall t11 t12 t13.
HappyAbsSyn t11 t12 t13 -> LocatedBy Position Token
happyOutTok HappyAbsSyn t11 t12 t13
happy_x_1 of { LocatedBy Position Token
happy_var_1 -> 
	case forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap6
happyOut6 HappyAbsSyn t11 t12 t13
happy_x_2 of { (HappyWrap6 [Sexp]
happy_var_2) -> 
	forall t11 t12 t13. Sexp -> HappyAbsSyn t11 t12 t13
happyIn8
		 (forall a b. a -> b -> a
const (forall e. [e] -> SexpF e
BracketListF [Sexp]
happy_var_2)     forall a (e :: * -> *) p.
(a -> e (Fix (Compose (LocatedBy p) e)))
-> LocatedBy p a -> Fix (Compose (LocatedBy p) e)
@@ LocatedBy Position Token
happy_var_1
	)}}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_8 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_8 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_3  Int#
3# forall {p} {t11} {t12} {t13} {t11} {t12} {t13} {t11} {t12} {t13}.
p
-> HappyAbsSyn t11 t12 t13
-> HappyAbsSyn t11 t12 t13
-> HappyAbsSyn t11 t12 t13
happyReduction_8
happyReduction_8 :: p
-> HappyAbsSyn t11 t12 t13
-> HappyAbsSyn t11 t12 t13
-> HappyAbsSyn t11 t12 t13
happyReduction_8 p
happy_x_3
	HappyAbsSyn t11 t12 t13
happy_x_2
	HappyAbsSyn t11 t12 t13
happy_x_1
	 =  case forall t11 t12 t13.
HappyAbsSyn t11 t12 t13 -> LocatedBy Position Token
happyOutTok HappyAbsSyn t11 t12 t13
happy_x_1 of { LocatedBy Position Token
happy_var_1 -> 
	case forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap6
happyOut6 HappyAbsSyn t11 t12 t13
happy_x_2 of { (HappyWrap6 [Sexp]
happy_var_2) -> 
	forall t11 t12 t13. Sexp -> HappyAbsSyn t11 t12 t13
happyIn8
		 (forall a b. a -> b -> a
const (forall e. [e] -> SexpF e
BraceListF [Sexp]
happy_var_2)       forall a (e :: * -> *) p.
(a -> e (Fix (Compose (LocatedBy p) e)))
-> LocatedBy p a -> Fix (Compose (LocatedBy p) e)
@@ LocatedBy Position Token
happy_var_1
	)}}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_9 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_9 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_2  Int#
3# forall {t11} {t12} {t13} {t11} {t12} {t13} {t11} {t12} {t13}.
HappyAbsSyn t11 t12 t13
-> HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_9
happyReduction_9 :: HappyAbsSyn t11 t12 t13
-> HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_9 HappyAbsSyn t11 t12 t13
happy_x_2
	HappyAbsSyn t11 t12 t13
happy_x_1
	 =  case forall t11 t12 t13.
HappyAbsSyn t11 t12 t13 -> LocatedBy Position Token
happyOutTok HappyAbsSyn t11 t12 t13
happy_x_1 of { LocatedBy Position Token
happy_var_1 -> 
	case forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap8
happyOut8 HappyAbsSyn t11 t12 t13
happy_x_2 of { (HappyWrap8 Sexp
happy_var_2) -> 
	forall t11 t12 t13. Sexp -> HappyAbsSyn t11 t12 t13
happyIn8
		 (forall a b. a -> b -> a
const (forall e. Prefix -> e -> SexpF e
ModifiedF
                                                    (Token -> Prefix
getPrefix (forall a e. LocatedBy a e -> e
extract LocatedBy Position Token
happy_var_1))
                                                    Sexp
happy_var_2)                 forall a (e :: * -> *) p.
(a -> e (Fix (Compose (LocatedBy p) e)))
-> LocatedBy p a -> Fix (Compose (LocatedBy p) e)
@@ LocatedBy Position Token
happy_var_1
	)}}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_10 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_10 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_1  Int#
4# forall {t11} {t12} {t13} {t11} {t12} {t13}.
HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_10
happyReduction_10 :: HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_10 HappyAbsSyn t11 t12 t13
happy_x_1
	 =  case forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap8
happyOut8 HappyAbsSyn t11 t12 t13
happy_x_1 of { (HappyWrap8 Sexp
happy_var_1) -> 
	forall t11 t12 t13. Maybe Sexp -> HappyAbsSyn t11 t12 t13
happyIn9
		 (forall a. a -> Maybe a
Just Sexp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_11 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_11 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_2  Int#
4# forall {p} {p} {t11} {t12} {t13}. p -> p -> HappyAbsSyn t11 t12 t13
happyReduction_11
happyReduction_11 :: p -> p -> HappyAbsSyn t11 t12 t13
happyReduction_11 p
happy_x_2
	p
happy_x_1
	 =  forall t11 t12 t13. Maybe Sexp -> HappyAbsSyn t11 t12 t13
happyIn9
		 (forall a. Maybe a
Nothing
	)

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_12 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_12 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_1  Int#
5# forall {t11} {t12} {t13} {t11} {t12} {t13}.
HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_12
happyReduction_12 :: HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_12 HappyAbsSyn t11 t12 t13
happy_x_1
	 =  case forall t11 t12 t13.
HappyAbsSyn t11 t12 t13 -> LocatedBy Position Token
happyOutTok HappyAbsSyn t11 t12 t13
happy_x_1 of { LocatedBy Position Token
happy_var_1 -> 
	forall t11 t12 t13.
LocatedBy Position Atom -> HappyAbsSyn t11 t12 t13
happyIn10
		 (forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (Scientific -> Atom
AtomNumber forall b c a. (b -> c) -> (a -> b) -> a -> c
. Token -> Scientific
getNumber) LocatedBy Position Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_13 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_13 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_1  Int#
5# forall {t11} {t12} {t13} {t11} {t12} {t13}.
HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_13
happyReduction_13 :: HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_13 HappyAbsSyn t11 t12 t13
happy_x_1
	 =  case forall t11 t12 t13.
HappyAbsSyn t11 t12 t13 -> LocatedBy Position Token
happyOutTok HappyAbsSyn t11 t12 t13
happy_x_1 of { LocatedBy Position Token
happy_var_1 -> 
	forall t11 t12 t13.
LocatedBy Position Atom -> HappyAbsSyn t11 t12 t13
happyIn10
		 (forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (Text -> Atom
AtomString forall b c a. (b -> c) -> (a -> b) -> a -> c
. Token -> Text
getString) LocatedBy Position Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_14 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_14 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_1  Int#
5# forall {t11} {t12} {t13} {t11} {t12} {t13}.
HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_14
happyReduction_14 :: HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_14 HappyAbsSyn t11 t12 t13
happy_x_1
	 =  case forall t11 t12 t13.
HappyAbsSyn t11 t12 t13 -> LocatedBy Position Token
happyOutTok HappyAbsSyn t11 t12 t13
happy_x_1 of { LocatedBy Position Token
happy_var_1 -> 
	forall t11 t12 t13.
LocatedBy Position Atom -> HappyAbsSyn t11 t12 t13
happyIn10
		 (forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (Text -> Atom
AtomSymbol forall b c a. (b -> c) -> (a -> b) -> a -> c
. Token -> Text
getSymbol) LocatedBy Position Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_15 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_15 = Int#
-> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_0  Int#
6# forall {a} {t12} {t13}. HappyAbsSyn [a] t12 t13
happyReduction_15
happyReduction_15 :: HappyAbsSyn [a] t12 t13
happyReduction_15  =  forall t11 t12 t13. t11 -> HappyAbsSyn t11 t12 t13
happyIn11
		 ([]
	)

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_16 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_16 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_1  Int#
6# forall {t11} {t11} {t13} {t12} {t13}.
HappyAbsSyn t11 t11 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_16
happyReduction_16 :: HappyAbsSyn t11 t11 t13 -> HappyAbsSyn t11 t12 t13
happyReduction_16 HappyAbsSyn t11 t11 t13
happy_x_1
	 =  case forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> t12
happyOut12 HappyAbsSyn t11 t11 t13
happy_x_1 of { t11
happy_var_1 -> 
	forall t11 t12 t13. t11 -> HappyAbsSyn t11 t12 t13
happyIn11
		 (t11
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_17 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_17 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_1  Int#
7# forall {t11} {t12} {a} {t11} {t13}.
HappyAbsSyn t11 t12 [a] -> HappyAbsSyn t11 [a] t13
happyReduction_17
happyReduction_17 :: HappyAbsSyn t11 t12 [a] -> HappyAbsSyn t11 [a] t13
happyReduction_17 HappyAbsSyn t11 t12 [a]
happy_x_1
	 =  case forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> t13
happyOut13 HappyAbsSyn t11 t12 [a]
happy_x_1 of { [a]
happy_var_1 -> 
	forall t12 t11 t13. t12 -> HappyAbsSyn t11 t12 t13
happyIn12
		 (forall a. [a] -> [a]
reverse [a]
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_18 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_18 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_1  Int#
8# forall {t11} {t12} {t13} {t11} {t12}.
HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 [Maybe Sexp]
happyReduction_18
happyReduction_18 :: HappyAbsSyn t11 t12 t13 -> HappyAbsSyn t11 t12 [Maybe Sexp]
happyReduction_18 HappyAbsSyn t11 t12 t13
happy_x_1
	 =  case forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap9
happyOut9 HappyAbsSyn t11 t12 t13
happy_x_1 of { (HappyWrap9 Maybe Sexp
happy_var_1) -> 
	forall t13 t11 t12. t13 -> HappyAbsSyn t11 t12 t13
happyIn13
		 ([Maybe Sexp
happy_var_1]
	)}

#if __GLASGOW_HASKELL__ >= 710
#endif
happyReduce_19 :: Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyReduce_19 = Int#
-> (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
    -> HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happySpecReduce_2  Int#
8# forall {t11} {t12} {t13} {t11} {t12} {t11} {t12}.
HappyAbsSyn t11 t12 t13
-> HappyAbsSyn t11 t12 [Maybe Sexp]
-> HappyAbsSyn t11 t12 [Maybe Sexp]
happyReduction_19
happyReduction_19 :: HappyAbsSyn t11 t12 t13
-> HappyAbsSyn t11 t12 [Maybe Sexp]
-> HappyAbsSyn t11 t12 [Maybe Sexp]
happyReduction_19 HappyAbsSyn t11 t12 t13
happy_x_2
	HappyAbsSyn t11 t12 [Maybe Sexp]
happy_x_1
	 =  case forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> t13
happyOut13 HappyAbsSyn t11 t12 [Maybe Sexp]
happy_x_1 of { [Maybe Sexp]
happy_var_1 -> 
	case forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap9
happyOut9 HappyAbsSyn t11 t12 t13
happy_x_2 of { (HappyWrap9 Maybe Sexp
happy_var_2) -> 
	forall t13 t11 t12. t13 -> HappyAbsSyn t11 t12 t13
happyIn13
		 (Maybe Sexp
happy_var_2 forall a. a -> [a] -> [a]
: [Maybe Sexp]
happy_var_1
	)}}

happyNewToken :: Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyNewToken Int#
action Happy_IntList
sts HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
stk [] =
	Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyDoAction Int#
13# forall a. a
notHappyAtAll Int#
action Happy_IntList
sts HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
stk []

happyNewToken Int#
action Happy_IntList
sts HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
stk (LocatedBy Position Token
tk:[LocatedBy Position Token]
tks) =
	let cont :: Int#
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
cont Int#
i = Int#
-> LocatedBy Position Token
-> Int#
-> Happy_IntList
-> HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyDoAction Int#
i LocatedBy Position Token
tk Int#
action Happy_IntList
sts HappyStk (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
stk [LocatedBy Position Token]
tks in
	case LocatedBy Position Token
tk of {
	Position
_ :< Token
TokLParen -> Int#
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
cont Int#
1#;
	Position
_ :< Token
TokRParen -> Int#
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
cont Int#
2#;
	Position
_ :< Token
TokLBracket -> Int#
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
cont Int#
3#;
	Position
_ :< Token
TokRBracket -> Int#
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
cont Int#
4#;
	Position
_ :< Token
TokLBrace -> Int#
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
cont Int#
5#;
	Position
_ :< Token
TokRBrace -> Int#
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
cont Int#
6#;
	Position
_ :< (TokPrefix Prefix
_) -> Int#
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
cont Int#
7#;
	Position
_ :< (TokSymbol Text
_) -> Int#
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
cont Int#
8#;
	Position
_ :< (TokNumber Scientific
_) -> Int#
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
cont Int#
9#;
	Position
_ :< (TokString Text
_) -> Int#
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
cont Int#
10#;
	Position
_ :< Token
TokCommentIntro -> Int#
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
cont Int#
11#;
	Position
_ :< Token
TokEOF -> Int#
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
cont Int#
12#;
	LocatedBy Position Token
_ -> forall a. ([LocatedBy Position Token], [String]) -> Either String a
happyError' ((LocatedBy Position Token
tkforall a. a -> [a] -> [a]
:[LocatedBy Position Token]
tks), [])
	}

happyError_ :: [String]
-> Int#
-> LocatedBy Position Token
-> [LocatedBy Position Token]
-> Either String a
happyError_ [String]
explist Int#
13# LocatedBy Position Token
tk [LocatedBy Position Token]
tks = forall a. ([LocatedBy Position Token], [String]) -> Either String a
happyError' ([LocatedBy Position Token]
tks, [String]
explist)
happyError_ [String]
explist Int#
_ LocatedBy Position Token
tk [LocatedBy Position Token]
tks = forall a. ([LocatedBy Position Token], [String]) -> Either String a
happyError' ((LocatedBy Position Token
tkforall a. a -> [a] -> [a]
:[LocatedBy Position Token]
tks), [String]
explist)

happyThen :: () => Either String a -> (a -> Either String b) -> Either String b
happyThen :: forall a b.
Either String a -> (a -> Either String b) -> Either String b
happyThen = forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
(Prelude.>>=)
happyReturn :: () => a -> Either String a
happyReturn :: forall a. a -> Either String a
happyReturn = (forall (m :: * -> *) a. Monad m => a -> m a
Prelude.return)
happyThen1 :: m t -> (t -> t -> m b) -> t -> m b
happyThen1 m t
m t -> t -> m b
k t
tks = forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
(Prelude.>>=) m t
m (\t
a -> t -> t -> m b
k t
a t
tks)
happyReturn1 :: () => a -> b -> Either String a
happyReturn1 :: forall a b. a -> b -> Either String a
happyReturn1 = \a
a b
tks -> (forall (m :: * -> *) a. Monad m => a -> m a
Prelude.return) a
a
happyError' :: () => ([(LocatedBy Position Token)], [Prelude.String]) -> Either String a
happyError' :: forall a. ([LocatedBy Position Token], [String]) -> Either String a
happyError' = (\([LocatedBy Position Token]
tokens, [String]
_) -> forall b. [LocatedBy Position Token] -> Either String b
parseError [LocatedBy Position Token]
tokens)
parseSexp_ :: [LocatedBy Position Token] -> Either String Sexp
parseSexp_ [LocatedBy Position Token]
tks = Either String Sexp
happySomeParser where
 happySomeParser :: Either String Sexp
happySomeParser = forall a b.
Either String a -> (a -> Either String b) -> Either String b
happyThen (Int#
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyParse Int#
0# [LocatedBy Position Token]
tks) (\HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
x -> forall a. a -> Either String a
happyReturn (let {(HappyWrap7 Sexp
x') = forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap7
happyOut7 HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
x} in Sexp
x'))

parseSexps_ :: [LocatedBy Position Token] -> Either String [Sexp]
parseSexps_ [LocatedBy Position Token]
tks = Either String [Sexp]
happySomeParser where
 happySomeParser :: Either String [Sexp]
happySomeParser = forall a b.
Either String a -> (a -> Either String b) -> Either String b
happyThen (Int#
-> [LocatedBy Position Token]
-> Either
     String (HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp])
happyParse Int#
1# [LocatedBy Position Token]
tks) (\HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
x -> forall a. a -> Either String a
happyReturn (let {(HappyWrap5 [Sexp]
x') = forall t11 t12 t13. HappyAbsSyn t11 t12 t13 -> HappyWrap5
happyOut5 HappyAbsSyn [Maybe Sexp] [Maybe Sexp] [Maybe Sexp]
x} in [Sexp]
x'))

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


type Sexp = Fix (Compose (LocatedBy Position) SexpF)

(@@) :: (a -> e (Fix (Compose (LocatedBy p) e))) -> LocatedBy p a -> Fix (Compose (LocatedBy p) e)
@@ :: forall a (e :: * -> *) p.
(a -> e (Fix (Compose (LocatedBy p) e)))
-> LocatedBy p a -> Fix (Compose (LocatedBy p) e)
(@@) a -> e (Fix (Compose (LocatedBy p) e))
f (p
p :< a
a) = forall (f :: * -> *). f (Fix f) -> Fix f
Fix forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall {k} {k1} (f :: k -> *) (g :: k1 -> k) (a :: k1).
f (g a) -> Compose f g a
Compose forall b c a. (b -> c) -> (a -> b) -> a -> c
. (p
p forall a e. a -> e -> LocatedBy a e
:<) forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> e (Fix (Compose (LocatedBy p) e))
f forall a b. (a -> b) -> a -> b
$ a
a

parseError :: [LocatedBy Position Token] -> Either String b
parseError :: forall b. [LocatedBy Position Token] -> Either String b
parseError [LocatedBy Position Token]
toks = case [LocatedBy Position Token]
toks of
  [] ->
    forall a b. a -> Either a b
Left String
"EOF: Unexpected end of file"
  (Position
pos :< Token
tok : [LocatedBy Position Token]
_) ->
    forall a b. a -> Either a b
Left forall a b. (a -> b) -> a -> b
$ forall a b c. (a -> b -> c) -> b -> a -> c
flip forall ann. SimpleDocStream ann -> ShowS
Render.renderShowS [] forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall ann. LayoutOptions -> Doc ann -> SimpleDocStream ann
layoutPretty (PageWidth -> LayoutOptions
LayoutOptions (Int -> Double -> PageWidth
AvailablePerLine Int
80 Double
0.8)) forall a b. (a -> b) -> a -> b
$
      forall a ann. Pretty a => a -> Doc ann
pretty Position
pos forall a. Semigroup a => a -> a -> a
<> forall ann. Doc ann
colon forall ann. Doc ann -> Doc ann -> Doc ann
<+> Doc Any
"Unexpected token:" forall ann. Doc ann -> Doc ann -> Doc ann
<+> forall a ann. Pretty a => a -> Doc ann
pretty Token
tok
{-# 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)) :: Prelude.Bool)
#define GTE(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.>=# m)) :: Prelude.Bool)
#define EQ(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.==# m)) :: Prelude.Bool)
#else
#define LT(n,m) (n Happy_GHC_Exts.<# m)
#define GTE(n,m) (n Happy_GHC_Exts.>=# m)
#define EQ(n,m) (n Happy_GHC_Exts.==# m)
#endif



















data Happy_IntList = HappyCons Happy_GHC_Exts.Int# Happy_IntList








































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

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

happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll

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

-- If the current token is ERROR_TOK, 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)) :: Prelude.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 Prelude.False
         action
          | check     = indexShortOffAddr happyTable off_i
          | Prelude.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 `Prelude.mod` 16)
  where unbox_int (Happy_GHC_Exts.I# x) = x






data HappyAddr = HappyA# Happy_GHC_Exts.Addr#


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













-----------------------------------------------------------------------------
-- 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 (ERROR_TOK 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  ERROR_TOK tk old_st CONS(HAPPYSTATE(action),sts) 
                                                (saved_tok `HappyStk` _ `HappyStk` stk) =
--      trace ("discarding state, depth " ++ show (length stk))  $
        DO_ACTION(action,ERROR_TOK,tk,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 = Prelude.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 `Prelude.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.