summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
authorkrasimir <krasimir@chalmers.se>2009-09-14 16:23:23 +0000
committerkrasimir <krasimir@chalmers.se>2009-09-14 16:23:23 +0000
commit14dfbcc624dadffcb54e58cbb26f3af24b77595a (patch)
tree980f52c77f0f9bb55242aee874fcc7dc88979870 /src
parent9f3534b3bb4e6bc45301b0ddb9468ca721b3dc17 (diff)
clean up the GF.Grammar API
Diffstat (limited to 'src')
-rw-r--r--src/GF/Command/Importing.hs2
-rw-r--r--src/GF/Compile.hs4
-rw-r--r--src/GF/Compile/AbsCompute.hs2
-rw-r--r--src/GF/Compile/GrammarToGFCC.hs2
-rw-r--r--src/GF/Compile/ReadFiles.hs1
-rw-r--r--src/GF/Compile/TC.hs3
-rw-r--r--src/GF/Compile/TypeCheck.hs3
-rw-r--r--src/GF/Grammar.hs (renamed from src/GF/Grammar/Abstract.hs)4
-rw-r--r--src/GF/Grammar/CF.hs (renamed from src/GF/Source/CF.hs)2
-rw-r--r--src/GF/Grammar/Parser.hs3406
-rw-r--r--src/GF/Grammar/PrGrammar.hs255
-rw-r--r--src/GF/Grammar/Unify.hs2
-rw-r--r--src/GF/Infra/Modules.hs8
-rw-r--r--src/GF/Source/AbsGF.hs323
-rw-r--r--src/GF/Source/GF.cf372
-rw-r--r--src/GF/Source/GrammarToSource.hs233
-rw-r--r--src/GF/Source/Makefile7
-rw-r--r--src/GF/Source/PrintGF.hs551
-rw-r--r--src/GF/Source/SourceToGrammar.hs733
-rw-r--r--src/GFC.hs2
20 files changed, 11 insertions, 5904 deletions
diff --git a/src/GF/Command/Importing.hs b/src/GF/Command/Importing.hs
index 9d31d3dc3..06deab6c6 100644
--- a/src/GF/Command/Importing.hs
+++ b/src/GF/Command/Importing.hs
@@ -5,10 +5,10 @@ import PGF.Data
import GF.Compile
import GF.Grammar.Grammar (SourceGrammar) -- for cc command
+import GF.Grammar.CF
import GF.Infra.UseIO
import GF.Infra.Option
import GF.Data.ErrM
-import GF.Source.CF
import Data.List (nubBy)
import System.FilePath
diff --git a/src/GF/Compile.hs b/src/GF/Compile.hs
index c23cfe655..e3bdee456 100644
--- a/src/GF/Compile.hs
+++ b/src/GF/Compile.hs
@@ -25,10 +25,6 @@ import GF.Infra.Option
import GF.Infra.Modules
import GF.Infra.UseIO
-import GF.Source.GrammarToSource
-import qualified GF.Source.AbsGF as A
-import qualified GF.Source.PrintGF as P
-
import GF.Data.Operations
import Control.Monad
diff --git a/src/GF/Compile/AbsCompute.hs b/src/GF/Compile/AbsCompute.hs
index f08313895..48499eb74 100644
--- a/src/GF/Compile/AbsCompute.hs
+++ b/src/GF/Compile/AbsCompute.hs
@@ -23,7 +23,7 @@ module GF.Compile.AbsCompute (LookDef,
import GF.Data.Operations
-import GF.Grammar.Abstract
+import GF.Grammar
import GF.Grammar.Lookup
import GF.Compile.Compute
diff --git a/src/GF/Compile/GrammarToGFCC.hs b/src/GF/Compile/GrammarToGFCC.hs
index df9203f4f..bd60e7bdb 100644
--- a/src/GF/Compile/GrammarToGFCC.hs
+++ b/src/GF/Compile/GrammarToGFCC.hs
@@ -14,7 +14,7 @@ import GF.Grammar.Predef
import GF.Grammar.Printer
import GF.Grammar.Grammar
import qualified GF.Grammar.Lookup as Look
-import qualified GF.Grammar.Abstract as A
+import qualified GF.Grammar as A
import qualified GF.Grammar.Macros as GM
import qualified GF.Compile.Compute as Compute ----
import qualified GF.Infra.Modules as M
diff --git a/src/GF/Compile/ReadFiles.hs b/src/GF/Compile/ReadFiles.hs
index b12ced07e..a1e0c287d 100644
--- a/src/GF/Compile/ReadFiles.hs
+++ b/src/GF/Compile/ReadFiles.hs
@@ -28,7 +28,6 @@ import GF.Infra.Option
import GF.Infra.Ident
import GF.Infra.Modules
import GF.Data.Operations
-import qualified GF.Source.AbsGF as S
import GF.Grammar.Lexer
import GF.Grammar.Parser
import GF.Grammar.Grammar
diff --git a/src/GF/Compile/TC.hs b/src/GF/Compile/TC.hs
index 4508c8a17..7ee3e9755 100644
--- a/src/GF/Compile/TC.hs
+++ b/src/GF/Compile/TC.hs
@@ -22,9 +22,8 @@ module GF.Compile.TC (AExp(..),
) where
import GF.Data.Operations
+import GF.Grammar
import GF.Grammar.Predef
-import GF.Grammar.Abstract
-import GF.Grammar.Printer
import Control.Monad
import Data.List (sortBy)
diff --git a/src/GF/Compile/TypeCheck.hs b/src/GF/Compile/TypeCheck.hs
index 20c53c234..f2f494c31 100644
--- a/src/GF/Compile/TypeCheck.hs
+++ b/src/GF/Compile/TypeCheck.hs
@@ -22,10 +22,9 @@ module GF.Compile.TypeCheck (-- * top-level type checking functions; TC should n
import GF.Data.Operations
import GF.Infra.CheckM
-import GF.Grammar.Abstract
+import GF.Grammar
import GF.Grammar.Lookup
import GF.Grammar.Unify
-import GF.Grammar.Printer
import GF.Compile.Refresh
import GF.Compile.AbsCompute
import GF.Compile.TC
diff --git a/src/GF/Grammar/Abstract.hs b/src/GF/Grammar.hs
index 8777c1287..71c95a73d 100644
--- a/src/GF/Grammar/Abstract.hs
+++ b/src/GF/Grammar.hs
@@ -12,12 +12,12 @@
-- (Description of the module)
-----------------------------------------------------------------------------
-module GF.Grammar.Abstract (
+module GF.Grammar (
+module GF.Infra.Ident,
module GF.Grammar.Grammar,
module GF.Grammar.Values,
module GF.Grammar.Macros,
-module GF.Infra.Ident,
module GF.Grammar.MMacros,
module GF.Grammar.Printer,
diff --git a/src/GF/Source/CF.hs b/src/GF/Grammar/CF.hs
index 7f0dcd5da..5d88916cd 100644
--- a/src/GF/Source/CF.hs
+++ b/src/GF/Grammar/CF.hs
@@ -12,7 +12,7 @@
-- parsing CF grammars and converting them to GF
-----------------------------------------------------------------------------
-module GF.Source.CF (getCF) where
+module GF.Grammar.CF (getCF) where
import GF.Grammar.Grammar
import GF.Grammar.Macros
diff --git a/src/GF/Grammar/Parser.hs b/src/GF/Grammar/Parser.hs
deleted file mode 100644
index e9d0d7c3a..000000000
--- a/src/GF/Grammar/Parser.hs
+++ /dev/null
@@ -1,3406 +0,0 @@
-{-# OPTIONS -fglasgow-exts -cpp #-}
-{-# OPTIONS -fno-warn-overlapping-patterns #-}
-module GF.Grammar.Parser
- ( P, runP
- , pModDef
- , pModHeader
- , pExp
- ) where
-
-import GF.Infra.Ident
-import GF.Infra.Modules
-import GF.Infra.Option
-import GF.Data.Operations
-import GF.Grammar.Predef
-import GF.Grammar.Grammar
-import GF.Grammar.Macros
-import GF.Grammar.Lexer
-import qualified Data.ByteString.Char8 as BS
-import GF.Compile.Update (buildAnyTree)
-#if __GLASGOW_HASKELL__ >= 503
-import Data.Array
-#else
-import Array
-#endif
-#if __GLASGOW_HASKELL__ >= 503
-import GHC.Exts
-#else
-import GlaExts
-#endif
-
--- parser produced by Happy Version 1.16
-
-newtype HappyAbsSyn = HappyAbsSyn (() -> ())
-happyIn6 :: (SourceModule) -> (HappyAbsSyn )
-happyIn6 x = unsafeCoerce# x
-{-# INLINE happyIn6 #-}
-happyOut6 :: (HappyAbsSyn ) -> (SourceModule)
-happyOut6 x = unsafeCoerce# x
-{-# INLINE happyOut6 #-}
-happyIn7 :: (SourceModule) -> (HappyAbsSyn )
-happyIn7 x = unsafeCoerce# x
-{-# INLINE happyIn7 #-}
-happyOut7 :: (HappyAbsSyn ) -> (SourceModule)
-happyOut7 x = unsafeCoerce# x
-{-# INLINE happyOut7 #-}
-happyIn8 :: (ModuleStatus) -> (HappyAbsSyn )
-happyIn8 x = unsafeCoerce# x
-{-# INLINE happyIn8 #-}
-happyOut8 :: (HappyAbsSyn ) -> (ModuleStatus)
-happyOut8 x = unsafeCoerce# x
-{-# INLINE happyOut8 #-}
-happyIn9 :: ((ModuleType Ident,Ident)) -> (HappyAbsSyn )
-happyIn9 x = unsafeCoerce# x
-{-# INLINE happyIn9 #-}
-happyOut9 :: (HappyAbsSyn ) -> ((ModuleType Ident,Ident))
-happyOut9 x = unsafeCoerce# x
-{-# INLINE happyOut9 #-}
-happyIn10 :: (( [(Ident,MInclude Ident)]
- , Maybe (Ident,MInclude Ident,[(Ident,Ident)])
- , [OpenSpec Ident]
- )) -> (HappyAbsSyn )
-happyIn10 x = unsafeCoerce# x
-{-# INLINE happyIn10 #-}
-happyOut10 :: (HappyAbsSyn ) -> (( [(Ident,MInclude Ident)]
- , Maybe (Ident,MInclude Ident,[(Ident,Ident)])
- , [OpenSpec Ident]
- ))
-happyOut10 x = unsafeCoerce# x
-{-# INLINE happyOut10 #-}
-happyIn11 :: ([OpenSpec Ident]) -> (HappyAbsSyn )
-happyIn11 x = unsafeCoerce# x
-{-# INLINE happyIn11 #-}
-happyOut11 :: (HappyAbsSyn ) -> ([OpenSpec Ident])
-happyOut11 x = unsafeCoerce# x
-{-# INLINE happyOut11 #-}
-happyIn12 :: (( [(Ident,MInclude Ident)]
- , Maybe (Ident,MInclude Ident,[(Ident,Ident)])
- , Maybe ([OpenSpec Ident],[(Ident,SrcSpan,Info)],Options)
- )) -> (HappyAbsSyn )
-happyIn12 x = unsafeCoerce# x
-{-# INLINE happyIn12 #-}
-happyOut12 :: (HappyAbsSyn ) -> (( [(Ident,MInclude Ident)]
- , Maybe (Ident,MInclude Ident,[(Ident,Ident)])
- , Maybe ([OpenSpec Ident],[(Ident,SrcSpan,Info)],Options)
- ))
-happyOut12 x = unsafeCoerce# x
-{-# INLINE happyOut12 #-}
-happyIn13 :: (([OpenSpec Ident],[(Ident,SrcSpan,Info)],Options)) -> (HappyAbsSyn )
-happyIn13 x = unsafeCoerce# x
-{-# INLINE happyIn13 #-}
-happyOut13 :: (HappyAbsSyn ) -> (([OpenSpec Ident],[(Ident,SrcSpan,Info)],Options))
-happyOut13 x = unsafeCoerce# x
-{-# INLINE happyOut13 #-}
-happyIn14 :: ([Either [(Ident,SrcSpan,Info)] Options]) -> (HappyAbsSyn )
-happyIn14 x = unsafeCoerce# x
-{-# INLINE happyIn14 #-}
-happyOut14 :: (HappyAbsSyn ) -> ([Either [(Ident,SrcSpan,Info)] Options])
-happyOut14 x = unsafeCoerce# x
-{-# INLINE happyOut14 #-}
-happyIn15 :: ([OpenSpec Ident]) -> (HappyAbsSyn )
-happyIn15 x = unsafeCoerce# x
-{-# INLINE happyIn15 #-}
-happyOut15 :: (HappyAbsSyn ) -> ([OpenSpec Ident])
-happyOut15 x = unsafeCoerce# x
-{-# INLINE happyOut15 #-}
-happyIn16 :: (OpenSpec Ident) -> (HappyAbsSyn )
-happyIn16 x = unsafeCoerce# x
-{-# INLINE happyIn16 #-}
-happyOut16 :: (HappyAbsSyn ) -> (OpenSpec Ident)
-happyOut16 x = unsafeCoerce# x
-{-# INLINE happyOut16 #-}
-happyIn17 :: ([(Ident,Ident)]) -> (HappyAbsSyn )
-happyIn17 x = unsafeCoerce# x
-{-# INLINE happyIn17 #-}
-happyOut17 :: (HappyAbsSyn ) -> ([(Ident,Ident)])
-happyOut17 x = unsafeCoerce# x
-{-# INLINE happyOut17 #-}
-happyIn18 :: ((Ident,Ident)) -> (HappyAbsSyn )
-happyIn18 x = unsafeCoerce# x
-{-# INLINE happyIn18 #-}
-happyOut18 :: (HappyAbsSyn ) -> ((Ident,Ident))
-happyOut18 x = unsafeCoerce# x
-{-# INLINE happyOut18 #-}
-happyIn19 :: ([(Ident,MInclude Ident)]) -> (HappyAbsSyn )
-happyIn19 x = unsafeCoerce# x
-{-# INLINE happyIn19 #-}
-happyOut19 :: (HappyAbsSyn ) -> ([(Ident,MInclude Ident)])
-happyOut19 x = unsafeCoerce# x
-{-# INLINE happyOut19 #-}
-happyIn20 :: ((Ident,MInclude Ident)) -> (HappyAbsSyn )
-happyIn20 x = unsafeCoerce# x
-{-# INLINE happyIn20 #-}
-happyOut20 :: (HappyAbsSyn ) -> ((Ident,MInclude Ident))
-happyOut20 x = unsafeCoerce# x
-{-# INLINE happyOut20 #-}
-happyIn21 :: (Either [(Ident,SrcSpan,Info)] Options) -> (HappyAbsSyn )
-happyIn21 x = unsafeCoerce# x
-{-# INLINE happyIn21 #-}
-happyOut21 :: (HappyAbsSyn ) -> (Either [(Ident,SrcSpan,Info)] Options)
-happyOut21 x = unsafeCoerce# x
-{-# INLINE happyOut21 #-}
-happyIn22 :: ([(Ident,SrcSpan,Info)]) -> (HappyAbsSyn )
-happyIn22 x = unsafeCoerce# x
-{-# INLINE happyIn22 #-}
-happyOut22 :: (HappyAbsSyn ) -> ([(Ident,SrcSpan,Info)])
-happyOut22 x = unsafeCoerce# x
-{-# INLINE happyOut22 #-}
-happyIn23 :: ([(Ident,SrcSpan,Info)]) -> (HappyAbsSyn )
-happyIn23 x = unsafeCoerce# x
-{-# INLINE happyIn23 #-}
-happyOut23 :: (HappyAbsSyn ) -> ([(Ident,SrcSpan,Info)])
-happyOut23 x = unsafeCoerce# x
-{-# INLINE happyOut23 #-}
-happyIn24 :: ([(Ident,SrcSpan,Info)]) -> (HappyAbsSyn )
-happyIn24 x = unsafeCoerce# x
-{-# INLINE happyIn24 #-}
-happyOut24 :: (HappyAbsSyn ) -> ([(Ident,SrcSpan,Info)])
-happyOut24 x = unsafeCoerce# x
-{-# INLINE happyOut24 #-}
-happyIn25 :: ([(Ident,SrcSpan,Info)]) -> (HappyAbsSyn )
-happyIn25 x = unsafeCoerce# x
-{-# INLINE happyIn25 #-}
-happyOut25 :: (HappyAbsSyn ) -> ([(Ident,SrcSpan,Info)])
-happyOut25 x = unsafeCoerce# x
-{-# INLINE happyOut25 #-}
-happyIn26 :: ([(Ident,SrcSpan,Info)]) -> (HappyAbsSyn )
-happyIn26 x = unsafeCoerce# x
-{-# INLINE happyIn26 #-}
-happyOut26 :: (HappyAbsSyn ) -> ([(Ident,SrcSpan,Info)])
-happyOut26 x = unsafeCoerce# x
-{-# INLINE happyOut26 #-}
-happyIn27 :: ([(Ident,SrcSpan,Info)]) -> (HappyAbsSyn )
-happyIn27 x = unsafeCoerce# x
-{-# INLINE happyIn27 #-}
-happyOut27 :: (HappyAbsSyn ) -> ([(Ident,SrcSpan,Info)])
-happyOut27 x = unsafeCoerce# x
-{-# INLINE happyOut27 #-}
-happyIn28 :: ([(Ident,SrcSpan,Info)]) -> (HappyAbsSyn )
-happyIn28 x = unsafeCoerce# x
-{-# INLINE happyIn28 #-}
-happyOut28 :: (HappyAbsSyn ) -> ([(Ident,SrcSpan,Info)])
-happyOut28 x = unsafeCoerce# x
-{-# INLINE happyOut28 #-}
-happyIn29 :: ([(Ident,SrcSpan,Term)]) -> (HappyAbsSyn )
-happyIn29 x = unsafeCoerce# x
-{-# INLINE happyIn29 #-}
-happyOut29 :: (HappyAbsSyn ) -> ([(Ident,SrcSpan,Term)])
-happyOut29 x = unsafeCoerce# x
-{-# INLINE happyOut29 #-}
-happyIn30 :: (Options) -> (HappyAbsSyn )
-happyIn30 x = unsafeCoerce# x
-{-# INLINE happyIn30 #-}
-happyOut30 :: (HappyAbsSyn ) -> (Options)
-happyOut30 x = unsafeCoerce# x
-{-# INLINE happyOut30 #-}
-happyIn31 :: ([Ident]) -> (HappyAbsSyn )
-happyIn31 x = unsafeCoerce# x
-{-# INLINE happyIn31 #-}
-happyOut31 :: (HappyAbsSyn ) -> ([Ident])
-happyOut31 x = unsafeCoerce# x
-{-# INLINE happyOut31 #-}
-happyIn32 :: (Param) -> (HappyAbsSyn )
-happyIn32 x = unsafeCoerce# x
-{-# INLINE happyIn32 #-}
-happyOut32 :: (HappyAbsSyn ) -> (Param)
-happyOut32 x = unsafeCoerce# x
-{-# INLINE happyOut32 #-}
-happyIn33 :: ([(Ident,SrcSpan,Info)]) -> (HappyAbsSyn )
-happyIn33 x = unsafeCoerce# x
-{-# INLINE happyIn33 #-}
-happyOut33 :: (HappyAbsSyn ) -> ([(Ident,SrcSpan,Info)])
-happyOut33 x = unsafeCoerce# x
-{-# INLINE happyOut33 #-}
-happyIn34 :: ([(Ident,SrcSpan,Info)]) -> (HappyAbsSyn )
-happyIn34 x = unsafeCoerce# x
-{-# INLINE happyIn34 #-}
-happyOut34 :: (HappyAbsSyn ) -> ([(Ident,SrcSpan,Info)])
-happyOut34 x = unsafeCoerce# x
-{-# INLINE happyOut34 #-}
-happyIn35 :: ([(Ident,SrcSpan,Info)]) -> (HappyAbsSyn )
-happyIn35 x = unsafeCoerce# x
-{-# INLINE happyIn35 #-}
-happyOut35 :: (HappyAbsSyn ) -> ([(Ident,SrcSpan,Info)])
-happyOut35 x = unsafeCoerce# x
-{-# INLINE happyOut35 #-}
-happyIn36 :: ([(Ident,SrcSpan,Info)]) -> (HappyAbsSyn )
-happyIn36 x = unsafeCoerce# x
-{-# INLINE happyIn36 #-}
-happyOut36 :: (HappyAbsSyn ) -> ([(Ident,SrcSpan,Info)])
-happyOut36 x = unsafeCoerce# x
-{-# INLINE happyOut36 #-}
-happyIn37 :: ([(Ident,SrcSpan,Info)]) -> (HappyAbsSyn )
-happyIn37 x = unsafeCoerce# x
-{-# INLINE happyIn37 #-}
-happyOut37 :: (HappyAbsSyn ) -> ([(Ident,SrcSpan,Info)])
-happyOut37 x = unsafeCoerce# x
-{-# INLINE happyOut37 #-}
-happyIn38 :: ([(Ident,SrcSpan,Info)]) -> (HappyAbsSyn )
-happyIn38 x = unsafeCoerce# x
-{-# INLINE happyIn38 #-}
-happyOut38 :: (HappyAbsSyn ) -> ([(Ident,SrcSpan,Info)])
-happyOut38 x = unsafeCoerce# x
-{-# INLINE happyOut38 #-}
-happyIn39 :: ([(Ident,SrcSpan,Info)]) -> (HappyAbsSyn )
-happyIn39 x = unsafeCoerce# x
-{-# INLINE happyIn39 #-}
-happyOut39 :: (HappyAbsSyn ) -> ([(Ident,SrcSpan,Info)])
-happyOut39 x = unsafeCoerce# x
-{-# INLINE happyOut39 #-}
-happyIn40 :: ([(Ident,SrcSpan,Term)]) -> (HappyAbsSyn )
-happyIn40 x = unsafeCoerce# x
-{-# INLINE happyIn40 #-}
-happyOut40 :: (HappyAbsSyn ) -> ([(Ident,SrcSpan,Term)])
-happyOut40 x = unsafeCoerce# x
-{-# INLINE happyOut40 #-}
-happyIn41 :: (Options) -> (HappyAbsSyn )
-happyIn41 x = unsafeCoerce# x
-{-# INLINE happyIn41 #-}
-happyOut41 :: (HappyAbsSyn ) -> (Options)
-happyOut41 x = unsafeCoerce# x
-{-# INLINE happyOut41 #-}
-happyIn42 :: ([Param]) -> (HappyAbsSyn )
-happyIn42 x = unsafeCoerce# x
-{-# INLINE happyIn42 #-}
-happyOut42 :: (HappyAbsSyn ) -> ([Param])
-happyOut42 x = unsafeCoerce# x
-{-# INLINE happyOut42 #-}
-happyIn43 :: ([Ident]) -> (HappyAbsSyn )
-happyIn43 x = unsafeCoerce# x
-{-# INLINE happyIn43 #-}
-happyOut43 :: (HappyAbsSyn ) -> ([Ident])
-happyOut43 x = unsafeCoerce# x
-{-# INLINE happyOut43 #-}
-happyIn44 :: (Ident) -> (HappyAbsSyn )
-happyIn44 x = unsafeCoerce# x
-{-# INLINE happyIn44 #-}
-happyOut44 :: (HappyAbsSyn ) -> (Ident)
-happyOut44 x = unsafeCoerce# x
-{-# INLINE happyOut44 #-}
-happyIn45 :: ([Ident]) -> (HappyAbsSyn )
-happyIn45 x = unsafeCoerce# x
-{-# INLINE happyIn45 #-}
-happyOut45 :: (HappyAbsSyn ) -> ([Ident])
-happyOut45 x = unsafeCoerce# x
-{-# INLINE happyOut45 #-}
-happyIn46 :: ([(Ident, Maybe Type, Maybe Term)]) -> (HappyAbsSyn )
-happyIn46 x = unsafeCoerce# x
-{-# INLINE happyIn46 #-}
-happyOut46 :: (HappyAbsSyn ) -> ([(Ident, Maybe Type, Maybe Term)])
-happyOut46 x = unsafeCoerce# x
-{-# INLINE happyOut46 #-}
-happyIn47 :: ([(Ident, Maybe Type, Maybe Term)]) -> (HappyAbsSyn )
-happyIn47 x = unsafeCoerce# x
-{-# INLINE happyIn47 #-}
-happyOut47 :: (HappyAbsSyn ) -> ([(Ident, Maybe Type, Maybe Term)])
-happyOut47 x = unsafeCoerce# x
-{-# INLINE happyOut47 #-}
-happyIn48 :: (Term) -> (HappyAbsSyn )
-happyIn48 x = unsafeCoerce# x
-{-# INLINE happyIn48 #-}
-happyOut48 :: (HappyAbsSyn ) -> (Term)
-happyOut48 x = unsafeCoerce# x
-{-# INLINE happyOut48 #-}
-happyIn49 :: (Term) -> (HappyAbsSyn )
-happyIn49 x = unsafeCoerce# x
-{-# INLINE happyIn49 #-}
-happyOut49 :: (HappyAbsSyn ) -> (Term)
-happyOut49 x = unsafeCoerce# x
-{-# INLINE happyOut49 #-}
-happyIn50 :: (Term) -> (HappyAbsSyn )
-happyIn50 x = unsafeCoerce# x
-{-# INLINE happyIn50 #-}
-happyOut50 :: (HappyAbsSyn ) -> (Term)
-happyOut50 x = unsafeCoerce# x
-{-# INLINE happyOut50 #-}
-happyIn51 :: (Term) -> (HappyAbsSyn )
-happyIn51 x = unsafeCoerce# x
-{-# INLINE happyIn51 #-}
-happyOut51 :: (HappyAbsSyn ) -> (Term)
-happyOut51 x = unsafeCoerce# x
-{-# INLINE happyOut51 #-}
-happyIn52 :: (Term) -> (HappyAbsSyn )
-happyIn52 x = unsafeCoerce# x
-{-# INLINE happyIn52 #-}
-happyOut52 :: (HappyAbsSyn ) -> (Term)
-happyOut52 x = unsafeCoerce# x
-{-# INLINE happyOut52 #-}
-happyIn53 :: (Term) -> (HappyAbsSyn )
-happyIn53 x = unsafeCoerce# x
-{-# INLINE happyIn53 #-}
-happyOut53 :: (HappyAbsSyn ) -> (Term)
-happyOut53 x = unsafeCoerce# x
-{-# INLINE happyOut53 #-}
-happyIn54 :: (Term) -> (HappyAbsSyn )
-happyIn54 x = unsafeCoerce# x
-{-# INLINE happyIn54 #-}
-happyOut54 :: (HappyAbsSyn ) -> (Term)
-happyOut54 x = unsafeCoerce# x
-{-# INLINE happyOut54 #-}
-happyIn55 :: ([Term]) -> (HappyAbsSyn )
-happyIn55 x = unsafeCoerce# x
-{-# INLINE happyIn55 #-}
-happyOut55 :: (HappyAbsSyn ) -> ([Term])
-happyOut55 x = unsafeCoerce# x
-{-# INLINE happyOut55 #-}
-happyIn56 :: ([Term]) -> (HappyAbsSyn )
-happyIn56 x = unsafeCoerce# x
-{-# INLINE happyIn56 #-}
-happyOut56 :: (HappyAbsSyn ) -> ([Term])
-happyOut56 x = unsafeCoerce# x
-{-# INLINE happyOut56 #-}
-happyIn57 :: (Patt) -> (HappyAbsSyn )
-happyIn57 x = unsafeCoerce# x
-{-# INLINE happyIn57 #-}
-happyOut57 :: (HappyAbsSyn ) -> (Patt)
-happyOut57 x = unsafeCoerce# x
-{-# INLINE happyOut57 #-}
-happyIn58 :: (Patt) -> (HappyAbsSyn )
-happyIn58 x = unsafeCoerce# x
-{-# INLINE happyIn58 #-}
-happyOut58 :: (HappyAbsSyn ) -> (Patt)
-happyOut58 x = unsafeCoerce# x
-{-# INLINE happyOut58 #-}
-happyIn59 :: (Patt) -> (HappyAbsSyn )
-happyIn59 x = unsafeCoerce# x
-{-# INLINE happyIn59 #-}
-happyOut59 :: (HappyAbsSyn ) -> (Patt)
-happyOut59 x = unsafeCoerce# x
-{-# INLINE happyOut59 #-}
-happyIn60 :: (Ident) -> (HappyAbsSyn )
-happyIn60 x = unsafeCoerce# x
-{-# INLINE happyIn60 #-}
-happyOut60 :: (HappyAbsSyn ) -> (Ident)
-happyOut60 x = unsafeCoerce# x
-{-# INLINE happyOut60 #-}
-happyIn61 :: ([(Label,Patt)]) -> (HappyAbsSyn )
-happyIn61 x = unsafeCoerce# x
-{-# INLINE happyIn61 #-}
-happyOut61 :: (HappyAbsSyn ) -> ([(Label,Patt)])
-happyOut61 x = unsafeCoerce# x
-{-# INLINE happyOut61 #-}
-happyIn62 :: (Label) -> (HappyAbsSyn )
-happyIn62 x = unsafeCoerce# x
-{-# INLINE happyIn62 #-}
-happyOut62 :: (HappyAbsSyn ) -> (Label)
-happyOut62 x = unsafeCoerce# x
-{-# INLINE happyOut62 #-}
-happyIn63 :: (Ident) -> (HappyAbsSyn )
-happyIn63 x = unsafeCoerce# x
-{-# INLINE happyIn63 #-}
-happyOut63 :: (HappyAbsSyn ) -> (Ident)
-happyOut63 x = unsafeCoerce# x
-{-# INLINE happyOut63 #-}
-happyIn64 :: ([(Label,Patt)]) -> (HappyAbsSyn )
-happyIn64 x = unsafeCoerce# x
-{-# INLINE happyIn64 #-}
-happyOut64 :: (HappyAbsSyn ) -> ([(Label,Patt)])
-happyOut64 x = unsafeCoerce# x
-{-# INLINE happyOut64 #-}
-happyIn65 :: ([Patt]) -> (HappyAbsSyn )
-happyIn65 x = unsafeCoerce# x
-{-# INLINE happyIn65 #-}
-happyOut65 :: (HappyAbsSyn ) -> ([Patt])
-happyOut65 x = unsafeCoerce# x
-{-# INLINE happyOut65 #-}
-happyIn66 :: ([Ident]) -> (HappyAbsSyn )
-happyIn66 x = unsafeCoerce# x
-{-# INLINE happyIn66 #-}
-happyOut66 :: (HappyAbsSyn ) -> ([Ident])
-happyOut66 x = unsafeCoerce# x
-{-# INLINE happyOut66 #-}
-happyIn67 :: (Ident) -> (HappyAbsSyn )
-happyIn67 x = unsafeCoerce# x
-{-# INLINE happyIn67 #-}
-happyOut67 :: (HappyAbsSyn ) -> (Ident)
-happyOut67 x = unsafeCoerce# x
-{-# INLINE happyOut67 #-}
-happyIn68 :: ([Ident]) -> (HappyAbsSyn )
-happyIn68 x = unsafeCoerce# x
-{-# INLINE happyIn68 #-}
-happyOut68 :: (HappyAbsSyn ) -> ([Ident])
-happyOut68 x = unsafeCoerce# x
-{-# INLINE happyOut68 #-}
-happyIn69 :: ([Decl]) -> (HappyAbsSyn )
-happyIn69 x = unsafeCoerce# x
-{-# INLINE happyIn69 #-}
-happyOut69 :: (HappyAbsSyn ) -> ([Decl])
-happyOut69 x = unsafeCoerce# x
-{-# INLINE happyOut69 #-}
-happyIn70 :: ([Term]) -> (HappyAbsSyn )
-happyIn70 x = unsafeCoerce# x
-{-# INLINE happyIn70 #-}
-happyOut70 :: (HappyAbsSyn ) -> ([Term])
-happyOut70 x = unsafeCoerce# x
-{-# INLINE happyOut70 #-}
-happyIn71 :: ([Patt]) -> (HappyAbsSyn )
-happyIn71 x = unsafeCoerce# x
-{-# INLINE happyIn71 #-}
-happyOut71 :: (HappyAbsSyn ) -> ([Patt])
-happyOut71 x = unsafeCoerce# x
-{-# INLINE happyOut71 #-}
-happyIn72 :: (Case) -> (HappyAbsSyn )
-happyIn72 x = unsafeCoerce# x
-{-# INLINE happyIn72 #-}
-happyOut72 :: (HappyAbsSyn ) -> (Case)
-happyOut72 x = unsafeCoerce# x
-{-# INLINE happyOut72 #-}
-happyIn73 :: ([Case]) -> (HappyAbsSyn )
-happyIn73 x = unsafeCoerce# x
-{-# INLINE happyIn73 #-}
-happyOut73 :: (HappyAbsSyn ) -> ([Case])
-happyOut73 x = unsafeCoerce# x
-{-# INLINE happyOut73 #-}
-happyIn74 :: ((Term,Term)) -> (HappyAbsSyn )
-happyIn74 x = unsafeCoerce# x
-{-# INLINE happyIn74 #-}
-happyOut74 :: (HappyAbsSyn ) -> ((Term,Term))
-happyOut74 x = unsafeCoerce# x
-{-# INLINE happyOut74 #-}
-happyIn75 :: ([(Term,Term)]) -> (HappyAbsSyn )
-happyIn75 x = unsafeCoerce# x
-{-# INLINE happyIn75 #-}
-happyOut75 :: (HappyAbsSyn ) -> ([(Term,Term)])
-happyOut75 x = unsafeCoerce# x
-{-# INLINE happyOut75 #-}
-happyIn76 :: ([Decl]) -> (HappyAbsSyn )
-happyIn76 x = unsafeCoerce# x
-{-# INLINE happyIn76 #-}
-happyOut76 :: (HappyAbsSyn ) -> ([Decl])
-happyOut76 x = unsafeCoerce# x
-{-# INLINE happyOut76 #-}
-happyIn77 :: ([Decl]) -> (HappyAbsSyn )
-happyIn77 x = unsafeCoerce# x
-{-# INLINE happyIn77 #-}
-happyOut77 :: (HappyAbsSyn ) -> ([Decl])
-happyOut77 x = unsafeCoerce# x
-{-# INLINE happyOut77 #-}
-happyIn78 :: (Posn) -> (HappyAbsSyn )
-happyIn78 x = unsafeCoerce# x
-{-# INLINE happyIn78 #-}
-happyOut78 :: (HappyAbsSyn ) -> (Posn)
-happyOut78 x = unsafeCoerce# x
-{-# INLINE happyOut78 #-}
-happyInTok :: Token -> (HappyAbsSyn )
-happyInTok x = unsafeCoerce# x
-{-# INLINE happyInTok #-}
-happyOutTok :: (HappyAbsSyn ) -> Token
-happyOutTok x = unsafeCoerce# x
-{-# INLINE happyOutTok #-}
-
-happyActOffsets :: HappyAddr
-happyActOffsets = HappyA# "\xcc\x04\xcc\x04\x3b\x00\xcc\x04\x92\x01\x00\x00\xb1\x04\xd7\x04\xd6\x04\x06\x00\x90\x01\xd1\x04\x00\x00\x00\x00\xcf\x04\x82\x01\xff\xff\x3b\x00\x00\x00\x95\x00\x97\x04\xa2\x00\xa2\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x3b\x00\x15\x02\x0d\x00\x96\x04\x91\x04\x15\x02\xbf\x04\xbd\x04\xdf\x01\xbc\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd4\x04\x92\x01\x8b\x04\xad\x04\x7c\x04\x7b\x04\x7a\x04\x78\x04\x75\x04\x74\x04\x3b\x00\x6e\x01\x3b\x00\x78\x01\x3b\x00\x60\x01\xac\x04\xcb\x01\xcb\x01\x19\x02\xa5\x04\x8c\x04\x71\x04\x9b\x04\xf5\xff\x70\x04\x99\x04\x8f\x04\x00\x00\x00\x00\x92\x04\x87\x04\x00\x00\x85\x04\xcb\x01\xcf\x01\x88\x04\x95\x04\x89\x04\xd4\x00\x00\x00\x55\x04\x48\x01\x48\x01\x00\x00\x44\x04\x41\x04\x00\x00\x00\x00\x00\x00\x00\x00\x79\x04\x3b\x00\x01\x00\x77\x04\xb3\x00\xb3\x00\xb3\x00\x77\x00\x3b\x00\x6c\x04\x77\x00\x3b\x00\x6f\x04\xb8\x00\x00\x00\x00\x00\x7a\x01\xcb\x01\x3a\x04\x00\x00\x00\x00\xcb\x01\xcb\x01\xcb\x01\x00\x00\x3d\x04\x00\x00\x00\x00\x38\x04\x6b\x04\x5b\x04\x61\x04\xc5\x00\x52\x04\xbf\x00\x00\x00\x63\x04\x54\x04\x82\x01\x2c\x01\x69\x00\x56\x04\x3b\x00\x00\x00\x00\x00\x3b\x00\x3b\x00\xcb\x01\x4f\x04\x00\x00\x00\x00\x3b\x00\x3b\x00\xa2\x00\x4b\x04\x00\x00\x1c\x04\x47\x04\x3b\x00\x1a\x04\x3b\x00\x3b\x00\x51\x04\x51\x04\xf9\x00\x3e\x04\x33\x04\x3c\x04\x0e\x01\x37\x04\x31\x04\x30\x04\xf8\x00\x3b\x00\x48\x01\x2c\x04\x35\x04\x00\x00\x00\x00\x11\x04\x0f\x04\x00\x00\xe8\xff\x00\x00\x00\x00\x28\x04\x20\x00\x02\x00\x97\x00\xfb\x03\xeb\x03\x02\x00\x00\x00\x16\x04\x15\x04\x82\x01\x00\x00\xe8\x03\x82\x01\x00\x00\x00\x00\x3b\x00\x3b\x00\x3b\x00\x00\x00\x48\x01\x48\x01\x3b\x00\x48\x01\x00\x00\x18\x04\x00\x00\x00\x00\xfd\x03\x00\x00\x48\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x14\x04\x1d\x04\x00\x00\x21\x04\xde\x03\x00\x00\x00\x00\x00\x00\x00\x00\x48\x01\x00\x00\x00\x00\x00\x00\xcd\x03\x48\x01\x00\x00\x00\x00\xfa\x03\x02\x04\x00\x00\x0a\x04\x09\x00\xc9\x04\x02\x00\xe4\x03\x03\x04\xc6\x03\x00\x00\xf1\x03\xc9\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xbc\x00\xc4\x03\x05\x04\xb8\x00\x00\x00\x00\x00\xd2\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xdd\x03\x3b\x00\x3b\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf9\x03\xe6\x03\xdb\x03\xda\x03\x00\x00\x00\x00\x82\x01\x00\x00\x00\x00\x00\x00\xe7\x03\x00\x00\x00\x00\xd9\x03\xa9\x03\x00\x00\xe9\x03\xe8\xff\x00\x00\xad\x03\xe5\x03\xe0\x03\x94\x03\xbe\x03\x92\x03\x02\x00\x00\x00\x00\x00\x00\x00\x3b\x00\x3b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x98\x03\xd0\x03\x00\x00\xc9\x03\x00\x00\x00\x00\xc1\x03\x00\x00\x8c\x03\xc0\x03\x00\x00\x5b\x00\xbf\x03\x00\x00\x5b\x00\x00\x00\xbd\x03\x00\x00\x5b\x00\xac\x03\x00\x00\x77\x03\xab\x03\x00\x00\x74\x03\xa6\x03\x00\x00\x5b\x00\xa5\x03\x00\x00\x73\x03\xa4\x03\x00\x00\x59\x00\x00\x00\x00\x00\xa1\x03\x02\x00\x97\x03\xc9\x04\x00\x00\x6c\x03\x5a\x03\xc6\x01\x6f\x02\x90\x03\x16\x01\x58\x03\x18\x01\x8b\x03\x56\x03\x00\x00\x5c\x02\x86\x03\x53\x03\x88\x03\x50\x03\x08\x00\x83\x03\x49\x02\x89\x03\x71\x03\x36\x02\x08\x00\x51\x01\x13\x02\x70\x03\x3b\x03\x00\x00\x00\x00\x51\x00\x7c\x03\x00\x00\x00\x00\x00\x00\x67\x03\x00\x00\x6a\x03\x76\x03\x46\x03\x75\x03\x6f\x03\x00\x00\x00\x00\x32\x03\x00\x00\x5f\x03\x00\x00\x00\x00\x00\x00\x1f\x03\x00\x00\x3b\x00\x3b\x00\x4c\x00\x52\x03\xee\xff\x00\x00\x00\x00\x00\x00\x3b\x00\x00\x00\x3b\x00\x51\x03\x00\x00\x3b\x00\x00\x00\x1c\x03\x00\x00\x48\x03\x3b\x00\x4c\x03\x00\x00\x17\x03\x3b\x00\x00\x00\x00\x00\xc6\x01\x00\x00\xff\xff\xc6\x01\x57\x03\x41\x03\x00\x00\x00\x00\x42\x03\x39\x03\x00\x00\x00\x00\x00\x00\x00\x00\x29\x03\x3b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x3b\x00\x00\x00\x00\x00\x00\x00\x3b\x00\x00\x00\x00\x00\x34\x03\x1e\x03\x00\x00\xc6\x01\x51\x00\x11\x03\xf1\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xcd\x02\x00\x00\x3b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xca\x02\x00\x00\x00\x00\x3b\x00\xe4\x02\x00\x00\xb7\x02\xe1\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc7\x02\x00\x00\x00\x00\x00\x00"#
-
-happyGotoOffsets :: HappyAddr
-happyGotoOffsets = HappyA# "\x64\x00\x30\x03\xbe\x04\x92\x02\xda\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x02\x00\x00\x00\x00\x00\x00\x00\x00\xa6\x02\xc8\x02\xaa\x02\x00\x00\x00\x00\x76\x02\x07\x03\x04\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb7\x04\x93\x01\x63\x02\x00\x00\x00\x00\x7e\x01\x00\x00\x00\x00\xfd\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb5\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x03\x00\x00\xa1\x04\xd2\x01\x0a\x03\xfb\x02\x00\x00\x4f\x01\x3d\x01\x00\x00\x00\x00\x00\x00\x50\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa8\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xab\x02\x77\x01\x00\x00\x00\x00\xdf\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x9a\x04\x8b\x02\x00\x00\x24\x02\xc3\x01\x1f\x01\x8e\x02\x84\x04\x00\x00\xd9\x04\x7d\x04\x00\x00\x9e\x00\x00\x00\x00\x00\x00\x00\x3a\x01\x3d\x02\x00\x00\x00\x00\x3a\x01\x3a\x01\x3a\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\x00\x00\x00\x4c\x02\x1a\x02\x00\x00\x00\x00\x67\x04\x00\x00\x00\x00\xf0\x01\x60\x04\xd8\xff\x00\x00\x00\x00\x00\x00\x4a\x04\x43\x04\x02\x03\x00\x00\x00\x00\x65\x02\x00\x00\x2d\x04\xee\x01\x26\x04\x10\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x02\x00\x00\x00\x00\x00\x00\x1a\x02\xf4\x02\xe5\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xdc\x00\x00\x00\x00\x00\x00\x00\x00\x00\x22\x03\x00\x00\x00\x00\x00\x00\x6d\x02\x00\x00\x00\x00\x00\x00\xdd\x01\x00\x00\x00\x00\x39\x02\x00\x00\x00\x00\xde\x02\xa3\x02\x87\x02\x00\x00\xcf\x02\xf5\x02\x09\x04\xe7\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfe\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\x00\x00\x00\x33\x01\x00\x00\x00\x00\x00\x00\xc9\x00\x95\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xbf\x01\x0b\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x3c\x01\x17\x00\x55\x00\x53\x00\x6a\x00\x1b\x00\x88\x00\xac\x00\xab\x00\x76\x00\x70\x00\x00\x00\xee\x02\xd9\x02\x8f\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf3\x03\xec\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc8\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x3f\x02\x00\x00\x91\x02\x24\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x31\x02\x44\x02\x00\x00\x00\x00\x00\x00\x80\x02\xd6\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa9\x00\x8f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x9b\x02\x00\x00\x00\x00\x81\x02\x00\x00\x00\x00\x00\x00\x7d\x02\x00\x00\x00\x00\x02\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6a\x02\x00\x00\x00\x00\x9a\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x74\x02\x00\x00\x38\x01\x00\x00\x00\x00\x00\x00\x0f\x01\x05\x00\x00\x00\x00\x00\x42\x00\xba\x01\x00\x00\x00\x00\x00\x00\x3d\x00\x00\x00\x10\x00\x00\x00\xf8\xff\x95\x01\x00\x00\x79\x00\x00\x00\x00\x00\x7e\x00\x64\x01\x00\x00\x34\x00\xf7\x01\x62\x00\x00\x00\x00\x00\xa1\x01\x5f\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x02\x8b\x01\x37\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x12\x01\x00\x00\xcf\x03\xb9\x03\x5c\x01\x00\x00\x8e\x01\x00\x00\x00\x00\x00\x00\xb2\x03\x00\x00\x9c\x03\x00\x00\x00\x00\x95\x03\x00\x00\x00\x00\x00\x00\x00\x00\x7f\x03\x00\x00\x00\x00\x3e\x01\x78\x03\x00\x00\x00\x00\xf1\x00\xf2\x01\xc1\x02\xed\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xbc\x01\xb1\x01\x00\x00\x62\x03\x81\x01\x00\x00\x75\x01\x56\x01\x5b\x03\x30\x01\xfe\x00\x00\x00\x45\x03\x00\x00\xea\x00\xd0\x00\x00\x00\xc3\x00\xcd\x00\x01\x01\x00\x00\xf6\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc2\x00\x00\x00\x3e\x03\x00\x00\xb7\x00\x00\x00\x00\x00\x7d\x00\x00\x00\x00\x00\x00\x00\x41\x00\x8e\x00\x00\x00\x00\x00\x28\x03\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc7\xff\x00\x00\x00\x00\x00\x00\x00\x00\xc3\xff\x00\x00\x00\x00"#
-
-happyDefActions :: HappyAddr
-happyDefActions = HappyA# "\xfa\xff\xfa\xff\x00\x00\x00\x00\x00\x00\xf9\xff\x00\x00\x87\xff\x85\xff\x83\xff\x7c\xff\x70\xff\x6e\xff\x6c\xff\x00\x00\x00\x00\x00\x00\x2c\xff\x68\xff\x00\x00\x93\xff\x00\x00\x00\x00\x3d\xff\x3b\xff\x3a\xff\x3c\xff\x3e\xff\x00\x00\x00\x00\x93\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6a\xff\x69\xff\x6b\xff\x61\xff\x6d\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5f\xff\x00\x00\x00\x00\x93\xff\x5f\xff\x00\x00\x73\xff\x00\x00\x00\x00\x00\x00\x92\xff\x00\x00\x93\xff\x9c\xff\x00\x00\x00\x00\x30\xff\x00\x00\x31\xff\x32\xff\x00\x00\x00\x00\x67\xff\x00\x00\x5c\xff\x2b\xff\x00\x00\x00\x00\x00\x00\x6d\xff\x74\xff\x00\x00\x00\x00\x29\xff\x51\xff\x00\x00\x39\xff\x4d\xff\x49\xff\x48\xff\x47\xff\x4c\xff\x00\x00\x00\x00\x7b\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x90\xff\x86\xff\x83\xff\x7c\xff\x93\xff\x8c\xff\x84\xff\x7d\xff\x7e\xff\x82\xff\x6f\xff\x00\x00\x40\xff\x8d\xff\x00\x00\x00\x00\x38\xff\x00\x00\x9c\xff\x00\x00\x28\xff\x58\xff\x52\xff\x00\x00\x00\x00\x4c\xff\x00\x00\x4f\xff\x00\x00\x60\xff\x63\xff\x2c\xff\x00\x00\x5c\xff\x00\x00\x65\xff\x64\xff\x00\x00\x00\x00\x00\x00\x00\x00\x88\xff\x00\x00\x00\x00\x00\x00\x93\xff\x00\x00\x00\x00\x71\xff\x72\xff\x00\x00\x25\xff\x00\x00\x47\xff\x4c\xff\x5e\xff\x00\x00\x00\x00\x4c\xff\x5f\xff\x00\x00\x00\x00\x00\x00\xf7\xff\xf6\xff\x00\x00\x00\x00\xf8\xff\xeb\xff\xfb\xff\xec\xff\xef\xff\xd6\xff\x00\x00\xd4\xff\x00\x00\x00\x00\x00\x00\x79\xff\x00\x00\x00\x00\x36\xff\x57\xff\x00\x00\x00\x00\x81\xff\x75\xff\x5f\xff\x00\x00\x00\x00\x78\xff\x00\x00\x00\x00\x00\x00\x00\x00\x95\xff\x96\xff\x91\xff\x8a\xff\x00\x00\x9b\xff\x00\x00\x2f\xff\x8e\xff\x8f\xff\x66\xff\x5b\xff\x00\x00\x2b\xff\x2a\xff\x00\x00\x00\x00\x44\xff\x53\xff\x45\xff\x55\xff\x29\xff\x50\xff\x4b\xff\x46\xff\x39\xff\x00\x00\x4a\xff\x3f\xff\x00\x00\xfc\xff\xe3\xff\xe6\xff\xd6\xff\xdf\xff\x00\x00\x00\x00\xdd\xff\x00\x00\xdb\xff\x00\x00\xdf\xff\x1c\xff\x1c\xff\x1c\xff\x1c\xff\x1c\xff\x1c\xff\x1c\xff\x1c\xff\x1c\xff\x1c\xff\x00\x00\x00\x00\x00\x00\x00\x00\xe2\xff\x89\xff\x41\xff\x37\xff\x27\xff\x4e\xff\x2e\xff\x62\xff\x00\x00\x00\x00\x00\x00\x5a\xff\x26\xff\x59\xff\x24\xff\x00\x00\x22\xff\x00\x00\x00\x00\x5d\xff\x54\xff\x4a\xff\x35\xff\x7f\xff\x80\xff\x00\x00\xf4\xff\xf5\xff\x00\x00\x00\x00\xea\xff\x00\x00\xeb\xff\xf0\xff\x00\x00\xed\xff\xd9\xff\x00\x00\x00\x00\x00\x00\x00\x00\x56\xff\x76\xff\x77\xff\x00\x00\x00\x00\x94\xff\x8b\xff\x7a\xff\xe7\xff\x00\x00\xe4\xff\xd5\xff\xd6\xff\x1c\xff\x1c\xff\x00\x00\xcd\xff\x00\x00\x00\x00\xcc\xff\x00\x00\x00\x00\xca\xff\x00\x00\xcb\xff\x00\x00\xc9\xff\x00\x00\x00\x00\xd0\xff\x00\x00\x00\x00\xc6\xff\x00\x00\x00\x00\xcf\xff\x00\x00\x00\x00\xce\xff\x00\x00\x00\x00\xd1\xff\x00\x00\xde\xff\xe1\xff\x00\x00\x00\x00\x00\x00\xdf\xff\xdc\xff\x00\x00\x00\x00\x1e\xff\x1c\xff\x00\x00\x9c\xff\xa6\xff\x98\xff\x00\x00\x00\x00\x9a\xff\x1c\xff\x00\x00\xa0\xff\x00\x00\xa8\xff\x98\xff\x00\x00\x1c\xff\x98\xff\x00\x00\x1c\xff\x98\xff\x00\x00\x1c\xff\x1c\xff\xa4\xff\xc7\xff\xc8\xff\x00\x00\x00\x00\x23\xff\x21\xff\xf3\xff\x00\x00\xd3\xff\x00\x00\x00\x00\xeb\xff\x00\x00\xf1\xff\xee\xff\xd8\xff\x00\x00\xd2\xff\xe8\xff\xe5\xff\xa3\xff\xbc\xff\x00\x00\xab\xff\x00\x00\x00\x00\x34\xff\x00\x00\x00\x00\x43\xff\x42\xff\xa1\xff\x00\x00\xaf\xff\x00\x00\x00\x00\xa7\xff\x00\x00\x9f\xff\x00\x00\xad\xff\x00\x00\x00\x00\x00\x00\xa5\xff\x00\x00\x00\x00\xa9\xff\x1f\xff\x1e\xff\x1c\xff\x00\x00\x1e\xff\x00\x00\x00\x00\xe0\xff\xda\xff\x00\x00\x00\x00\xc5\xff\x1d\xff\x1c\xff\x1c\xff\xb3\xff\x00\x00\x1c\xff\x99\xff\x1c\xff\x1c\xff\x00\x00\x1c\xff\x1c\xff\x97\xff\x00\x00\x33\xff\x1c\xff\x1c\xff\x9e\xff\x1c\xff\x1e\xff\x00\x00\x00\x00\xeb\xff\xf2\xff\xd7\xff\xe9\xff\xb1\xff\xbd\xff\x00\x00\xbb\xff\x00\x00\xba\xff\x1c\xff\xb5\xff\xb7\xff\x1c\xff\xc2\xff\xb4\xff\xc1\xff\x1c\xff\x00\x00\xbf\xff\xbe\xff\x00\x00\x1c\xff\xc4\xff\x00\x00\x00\x00\xb2\xff\xc0\xff\xb6\xff\xb9\xff\x1c\xff\x9d\xff\xb8\xff\x20\xff\x00\x00\x1c\xff\xc3\xff"#
-
-happyCheck :: HappyAddr
-happyCheck = HappyA# "\xff\xff\x02\x00\x0d\x00\x04\x00\x03\x00\x17\x00\x04\x00\x01\x00\x30\x00\x11\x00\x32\x00\x48\x00\x06\x00\x07\x00\x08\x00\x48\x00\x11\x00\x39\x00\x0a\x00\x0a\x00\x15\x00\x10\x00\x17\x00\x1f\x00\x19\x00\x13\x00\x1b\x00\x1c\x00\x1d\x00\x35\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x1e\x00\x25\x00\x1d\x00\x19\x00\x10\x00\x18\x00\x05\x00\x0a\x00\x2c\x00\x11\x00\x30\x00\x46\x00\x30\x00\x31\x00\x32\x00\x0e\x00\x23\x00\x46\x00\x1e\x00\x39\x00\x38\x00\x39\x00\x44\x00\x1f\x00\x3c\x00\x3d\x00\x02\x00\x3f\x00\x04\x00\x48\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x40\x00\x46\x00\x46\x00\x15\x00\x41\x00\x48\x00\x11\x00\x48\x00\x46\x00\x12\x00\x15\x00\x1d\x00\x17\x00\x46\x00\x19\x00\x13\x00\x1b\x00\x1c\x00\x48\x00\x1c\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x48\x00\x25\x00\x41\x00\x20\x00\x48\x00\x00\x00\x12\x00\x02\x00\x2c\x00\x13\x00\x1d\x00\x19\x00\x30\x00\x31\x00\x32\x00\x05\x00\x1c\x00\x17\x00\x08\x00\x17\x00\x38\x00\x39\x00\x20\x00\x14\x00\x3c\x00\x3d\x00\x02\x00\x3f\x00\x04\x00\x48\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x18\x00\x21\x00\x14\x00\x48\x00\x35\x00\x1e\x00\x11\x00\x48\x00\x48\x00\x15\x00\x15\x00\x23\x00\x17\x00\x16\x00\x19\x00\x21\x00\x46\x00\x1d\x00\x1b\x00\x17\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x48\x00\x25\x00\x48\x00\x16\x00\x46\x00\x22\x00\x46\x00\x0b\x00\x1b\x00\x06\x00\x07\x00\x17\x00\x19\x00\x31\x00\x32\x00\x48\x00\x0d\x00\x0e\x00\x18\x00\x17\x00\x38\x00\x39\x00\x22\x00\x48\x00\x3c\x00\x3d\x00\x02\x00\x3f\x00\x04\x00\x48\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x48\x00\x1d\x00\x17\x00\x48\x00\x17\x00\x17\x00\x11\x00\x48\x00\x48\x00\x08\x00\x15\x00\x0a\x00\x17\x00\x22\x00\x19\x00\x22\x00\x22\x00\x0a\x00\x48\x00\x19\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x48\x00\x25\x00\x44\x00\x08\x00\x46\x00\x1a\x00\x1e\x00\x0a\x00\x1a\x00\x04\x00\x05\x00\x26\x00\x0f\x00\x31\x00\x32\x00\x24\x00\x2b\x00\x46\x00\x0d\x00\x0e\x00\x38\x00\x39\x00\x35\x00\x25\x00\x3c\x00\x1e\x00\x48\x00\x3f\x00\x48\x00\x48\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x02\x00\x05\x00\x04\x00\x30\x00\x46\x00\x48\x00\x37\x00\x08\x00\x0a\x00\x3a\x00\x25\x00\x0d\x00\x39\x00\x0f\x00\x07\x00\x11\x00\x12\x00\x48\x00\x13\x00\x15\x00\x16\x00\x17\x00\x02\x00\x19\x00\x04\x00\x46\x00\x47\x00\x1d\x00\x37\x00\x1e\x00\x48\x00\x3a\x00\x02\x00\x0d\x00\x04\x00\x30\x00\x10\x00\x11\x00\x0a\x00\x30\x00\x0a\x00\x15\x00\x16\x00\x17\x00\x39\x00\x19\x00\x12\x00\x11\x00\x39\x00\x1d\x00\x1a\x00\x15\x00\x02\x00\x17\x00\x04\x00\x19\x00\x48\x00\x46\x00\x47\x00\x1d\x00\x24\x00\x46\x00\x47\x00\x0d\x00\x42\x00\x43\x00\x44\x00\x11\x00\x46\x00\x30\x00\x08\x00\x15\x00\x16\x00\x17\x00\x08\x00\x19\x00\x48\x00\x0f\x00\x39\x00\x1d\x00\x02\x00\x0f\x00\x04\x00\x2e\x00\x2f\x00\x30\x00\x42\x00\x43\x00\x44\x00\x0b\x00\x46\x00\x46\x00\x47\x00\x19\x00\x39\x00\x11\x00\x42\x00\x43\x00\x44\x00\x15\x00\x46\x00\x17\x00\x0f\x00\x19\x00\x02\x00\x12\x00\x04\x00\x1d\x00\x33\x00\x34\x00\x35\x00\x2f\x00\x30\x00\x0b\x00\x2f\x00\x30\x00\x42\x00\x43\x00\x44\x00\x11\x00\x46\x00\x39\x00\x41\x00\x15\x00\x39\x00\x17\x00\x48\x00\x19\x00\x02\x00\x01\x00\x04\x00\x1d\x00\x2f\x00\x30\x00\x06\x00\x07\x00\x08\x00\x0b\x00\x02\x00\x17\x00\x04\x00\x19\x00\x39\x00\x11\x00\x42\x00\x43\x00\x44\x00\x15\x00\x46\x00\x17\x00\x05\x00\x19\x00\x36\x00\x11\x00\x04\x00\x1d\x00\x07\x00\x15\x00\x3c\x00\x17\x00\x36\x00\x19\x00\x0c\x00\x0e\x00\x48\x00\x1d\x00\x3c\x00\x11\x00\x42\x00\x43\x00\x44\x00\x15\x00\x46\x00\x17\x00\x07\x00\x19\x00\x33\x00\x34\x00\x35\x00\x2f\x00\x30\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x26\x00\x27\x00\x24\x00\x39\x00\x41\x00\x27\x00\x42\x00\x43\x00\x44\x00\x48\x00\x46\x00\x25\x00\x2e\x00\x2f\x00\x2f\x00\x30\x00\x42\x00\x43\x00\x44\x00\x08\x00\x46\x00\x48\x00\x04\x00\x36\x00\x39\x00\x3b\x00\x0f\x00\x04\x00\x3e\x00\x3c\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x11\x00\x30\x00\x0a\x00\x32\x00\x15\x00\x11\x00\x17\x00\x0f\x00\x19\x00\x15\x00\x39\x00\x17\x00\x04\x00\x19\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x35\x00\x11\x00\x2e\x00\x2f\x00\x30\x00\x15\x00\x3b\x00\x17\x00\x25\x00\x19\x00\x48\x00\x28\x00\x29\x00\x39\x00\x35\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x3b\x00\x48\x00\x33\x00\x34\x00\x35\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x35\x00\x25\x00\x42\x00\x43\x00\x28\x00\x29\x00\x3b\x00\x04\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x11\x00\x25\x00\x0f\x00\x39\x00\x15\x00\x12\x00\x17\x00\x1a\x00\x19\x00\x3f\x00\x40\x00\x33\x00\x34\x00\x35\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x26\x00\x48\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x48\x00\x42\x00\x43\x00\x0b\x00\x0c\x00\x31\x00\x32\x00\x33\x00\x2f\x00\x30\x00\x36\x00\x37\x00\x0b\x00\x0c\x00\x3a\x00\x0a\x00\x35\x00\x1a\x00\x39\x00\x2e\x00\x2f\x00\x30\x00\x3b\x00\x25\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x26\x00\x39\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x25\x00\x1a\x00\x25\x00\x28\x00\x29\x00\x31\x00\x32\x00\x33\x00\x0b\x00\x0c\x00\x36\x00\x37\x00\x35\x00\x26\x00\x3a\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x25\x00\x1a\x00\x0a\x00\x28\x00\x29\x00\x31\x00\x32\x00\x33\x00\x09\x00\x0a\x00\x36\x00\x37\x00\x35\x00\x26\x00\x3a\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x25\x00\x1a\x00\x25\x00\x28\x00\x29\x00\x31\x00\x32\x00\x33\x00\x26\x00\x27\x00\x36\x00\x37\x00\x02\x00\x26\x00\x3a\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x25\x00\x0b\x00\x0c\x00\x28\x00\x29\x00\x31\x00\x32\x00\x33\x00\x26\x00\x27\x00\x36\x00\x37\x00\x26\x00\x27\x00\x3a\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x03\x00\x39\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x3f\x00\x39\x00\x26\x00\x27\x00\x38\x00\x44\x00\x45\x00\x3f\x00\x39\x00\x33\x00\x34\x00\x35\x00\x44\x00\x45\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x35\x00\x39\x00\x03\x00\x33\x00\x34\x00\x35\x00\x1a\x00\x3f\x00\x39\x00\x0b\x00\x0c\x00\x05\x00\x44\x00\x45\x00\x3f\x00\x40\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x42\x00\x39\x00\x0d\x00\x0e\x00\x19\x00\x3d\x00\x3e\x00\x3f\x00\x39\x00\x33\x00\x34\x00\x35\x00\x3d\x00\x3e\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x46\x00\x42\x00\x43\x00\x46\x00\x09\x00\x0a\x00\x05\x00\x39\x00\x33\x00\x34\x00\x35\x00\x34\x00\x35\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x35\x00\x42\x00\x43\x00\x34\x00\x35\x00\x09\x00\x0a\x00\x39\x00\x33\x00\x34\x00\x35\x00\x01\x00\x02\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x1e\x00\x42\x00\x43\x00\x3d\x00\x3e\x00\x3d\x00\x3e\x00\x39\x00\x3d\x00\x3e\x00\x12\x00\x1e\x00\x0f\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x39\x00\x18\x00\x1a\x00\x05\x00\x46\x00\x12\x00\x3f\x00\x18\x00\x39\x00\x46\x00\x12\x00\x12\x00\x46\x00\x07\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x07\x00\x39\x00\x46\x00\x04\x00\x04\x00\x35\x00\x12\x00\x3f\x00\x39\x00\x18\x00\x04\x00\x46\x00\x12\x00\x12\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x0a\x00\x39\x00\x12\x00\x46\x00\x0f\x00\x12\x00\x46\x00\x3f\x00\x39\x00\x46\x00\x12\x00\x46\x00\x0f\x00\x46\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x19\x00\x39\x00\x46\x00\x12\x00\x10\x00\x10\x00\x10\x00\x3f\x00\x39\x00\x46\x00\x46\x00\x10\x00\x10\x00\x46\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x10\x00\x39\x00\x10\x00\x10\x00\x10\x00\x46\x00\x0a\x00\x3f\x00\x39\x00\x18\x00\x07\x00\x46\x00\x41\x00\x46\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x0a\x00\x39\x00\x07\x00\x04\x00\x41\x00\x46\x00\x17\x00\x3f\x00\x39\x00\x0c\x00\x1a\x00\x1a\x00\x10\x00\x1a\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x0e\x00\x39\x00\x04\x00\x46\x00\x1a\x00\x46\x00\x0a\x00\x3f\x00\x39\x00\x2c\x00\x07\x00\x10\x00\x46\x00\x1a\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x46\x00\x39\x00\x05\x00\x0a\x00\x14\x00\x2c\x00\x12\x00\x3f\x00\x39\x00\x18\x00\x46\x00\x07\x00\x1a\x00\x46\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x46\x00\x39\x00\x34\x00\x0f\x00\x34\x00\x1a\x00\x10\x00\x3f\x00\x39\x00\x1a\x00\x1a\x00\x10\x00\x1a\x00\x10\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x0d\x00\x39\x00\x46\x00\x1a\x00\x46\x00\x0d\x00\x19\x00\x3f\x00\x39\x00\x18\x00\x14\x00\x06\x00\x18\x00\x10\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x1a\x00\x39\x00\x12\x00\x46\x00\x42\x00\x46\x00\x12\x00\x3f\x00\x39\x00\x0d\x00\x19\x00\x0d\x00\x46\x00\x44\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x0f\x00\x39\x00\x05\x00\x46\x00\x14\x00\x18\x00\x0c\x00\x3f\x00\x39\x00\x1a\x00\x13\x00\x0a\x00\x34\x00\x0a\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x10\x00\x39\x00\x46\x00\x2c\x00\x0d\x00\x46\x00\x46\x00\x3f\x00\x39\x00\x46\x00\x12\x00\x46\x00\x46\x00\x46\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x47\x00\x39\x00\x00\x00\x19\x00\x19\x00\x46\x00\x19\x00\x3f\x00\x39\x00\x0c\x00\x46\x00\x46\x00\x0d\x00\x09\x00\x3f\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x26\x00\x39\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x1e\x00\x3f\x00\x39\x00\x47\x00\x2d\x00\x31\x00\x32\x00\x33\x00\x3f\x00\xff\xff\x36\x00\x37\x00\xff\xff\xff\xff\x3a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"#
-
-happyTable :: HappyAddr
-happyTable = HappyA# "\x00\x00\x10\x00\x61\x00\x11\x00\x78\x00\x68\x01\xf2\x00\x63\x00\x8d\x00\x48\x01\xd6\x00\xef\x01\x64\x00\x65\x00\x66\x00\xeb\x01\x12\x00\x0d\x00\x96\x01\x01\x01\x13\x00\x54\x01\x14\x00\x9d\x01\x15\x00\x67\x00\x16\x00\x17\x00\x48\x00\xb6\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\xa8\x01\x1d\x00\x97\x01\x42\x00\x54\x01\x4b\x01\x24\x01\x01\x01\x1e\x00\x48\x01\x36\x00\xb7\x00\x1f\x00\x20\x00\x21\x00\x25\x01\x9f\x01\x69\x01\x55\x01\x0d\x00\x22\x00\x23\x00\x96\x00\x49\x01\x24\x00\x25\x00\x10\x00\x26\x00\x11\x00\x4a\x01\x27\x00\x28\x00\x29\x00\x2a\x00\x53\x00\x68\x00\x79\x00\xf3\x00\x3e\x01\x02\x01\xe2\x01\x12\x00\x56\x01\x98\x01\x4e\x01\x13\x00\x90\x01\x14\x00\x43\x00\x15\x00\x51\x01\x16\x00\x17\x00\x4d\x01\xa1\x01\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x56\x01\x1d\x00\x23\x01\xa5\x01\x4a\x01\x2d\x00\x4e\x01\x04\x00\x1e\x00\x51\x01\x97\x01\xee\x00\x1f\x00\x20\x00\x21\x00\xdd\x00\x4f\x01\x60\x01\xc9\x00\x68\x01\x22\x00\x23\x00\x52\x01\x3b\x01\x24\x00\x25\x00\x10\x00\x26\x00\x38\x00\x40\x01\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x4b\x01\x8d\x01\x3b\x01\x50\x01\xef\x00\xcb\x00\x12\x00\xe6\x01\x53\x01\x3e\x01\x13\x00\x4c\x01\x14\x00\x45\x01\x15\x00\x3c\x01\x98\x01\x3f\x01\x9a\x01\x41\x01\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x50\x01\x1d\x00\x53\x01\x45\x01\x61\x01\x98\x01\x69\x01\x20\x01\x46\x01\xe9\x00\xea\x00\x41\x01\xe5\x01\x20\x00\x21\x00\x3d\x01\xeb\x00\xec\x00\x4c\x00\x21\x01\x22\x00\x23\x00\x79\x01\x4d\x01\x24\x00\x25\x00\x10\x00\x26\x00\x38\x00\x3d\x01\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x40\x01\x48\x00\x41\x01\x47\x01\x41\x01\x41\x01\x12\x00\xe7\x01\x43\x01\xc9\x00\x13\x00\xe1\x00\x14\x00\x7a\x01\x15\x00\x42\x01\x44\x01\x97\x00\x47\x01\xee\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x43\x01\x1d\x00\x4d\x00\xc9\x00\x4e\x00\xc6\x01\xcb\x00\x32\xff\xe3\x00\xb1\x00\xb2\x00\x3a\x01\x32\xff\x20\x00\x21\x00\xea\x01\x3b\x01\x49\x00\xb3\x00\xb4\x00\x22\x00\x23\x00\xef\x00\x7b\x00\x24\x00\xcb\x00\x43\x01\x26\x00\x43\x01\x43\x01\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x55\x00\xcc\x01\x56\x00\xa9\x01\xb7\x00\xe8\x01\x7c\x00\xc9\x00\x97\x00\x06\x01\x7b\x00\xc0\x00\x0d\x00\x9c\xff\xce\x01\x57\x00\x9c\xff\xd0\x01\xca\x00\x58\x00\xc1\x00\x59\x00\x55\x00\x5a\x00\x56\x00\xaa\x01\xcf\x01\x5b\x00\x7c\x00\xcb\x00\xd2\x01\x7d\x00\x55\x00\xc0\x00\x56\x00\xa9\x01\xc5\x00\x57\x00\x97\x00\xa9\x01\x96\x01\x58\x00\xc1\x00\x59\x00\x0d\x00\x5a\x00\xa7\x01\x57\x00\x0d\x00\x5b\x00\xc6\x01\x58\x00\x55\x00\x59\x00\x56\x00\x5a\x00\xd4\x01\xaa\x01\xb2\x01\x5b\x00\xc7\x01\xaa\x01\xb5\x01\xc0\x00\x5c\x00\x5d\x00\x5e\x00\x57\x00\x5f\x00\xa9\x01\xaf\x01\x58\x00\xc1\x00\x59\x00\x57\x01\x5a\x00\xd6\x01\xf4\x00\x0d\x00\x5b\x00\x55\x00\xf4\x00\x56\x00\x73\x00\x0b\x00\x0c\x00\x5c\x00\x5d\x00\x5e\x00\x85\x00\x5f\x00\xaa\x01\xab\x01\xb7\x01\x0d\x00\x57\x00\x5c\x00\x5d\x00\x5e\x00\x58\x00\x5f\x00\x59\x00\x92\x01\x5a\x00\x55\x00\x93\x01\x56\x00\x5b\x00\x80\x00\x81\x00\x82\x00\x61\x00\x0c\x00\x85\x00\x9c\x00\x0c\x00\x5c\x00\x5d\x00\x5e\x00\x57\x00\x5f\x00\x0d\x00\x07\x01\x58\x00\x0d\x00\x59\x00\xd7\x01\x5a\x00\x55\x00\x63\x00\x56\x00\x5b\x00\x9d\x00\x0c\x00\x64\x00\x65\x00\x66\x00\x85\x00\x55\x00\xa8\x00\x56\x00\xa9\x00\x0d\x00\x57\x00\x5c\x00\x5d\x00\x5e\x00\x58\x00\x86\x00\x59\x00\x87\x01\x5a\x00\x93\x01\x57\x00\x38\x00\x5b\x00\x34\x01\x58\x00\xc3\x01\x59\x00\x93\x01\x5a\x00\x2d\xff\x35\x01\xd9\x01\x5b\x00\x94\x01\x12\x00\x5c\x00\x5d\x00\xa2\x00\x13\x00\xa3\x00\x14\x00\x8c\x01\x15\x00\x80\x00\x81\x00\x82\x00\x3b\x00\x0c\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x71\x01\xc1\x01\x30\x00\x0d\x00\x83\x00\x31\x00\x5c\x00\x5d\x00\x5e\x00\xda\x01\xa7\x00\x62\x01\x32\x00\x33\x00\x43\x00\x0c\x00\x5c\x00\x5d\x00\x5e\x00\xf3\x00\x5f\x00\xdb\x01\xad\x01\x93\x01\x0d\x00\x34\x00\xf4\x00\x38\x00\x35\x00\x9c\x01\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x12\x00\x8d\x00\x8c\x00\x8e\x00\x13\x00\x12\x00\x14\x00\x8d\x00\x15\x00\x13\x00\x0d\x00\x14\x00\x38\x00\x15\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\xbd\x00\x12\x00\x74\x00\x0b\x00\x0c\x00\x13\x00\xa4\x01\x14\x00\x3e\x00\x39\x00\xde\x01\x3f\x00\x4a\x00\x0d\x00\xbd\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x2c\x01\xdf\x01\x9e\x00\x81\x00\x82\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\xbd\x00\x3e\x00\x9f\x00\xa5\x00\x3f\x00\xcd\x00\x19\x01\x38\x00\xd8\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x12\x00\x6c\x01\x9b\x00\x0d\x00\x13\x00\x9c\x00\x14\x00\xac\xff\x15\x00\x0e\x00\xd9\x00\x9e\x00\x81\x00\x82\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\xac\xff\xb4\x01\xac\xff\xac\xff\xac\xff\xac\xff\x8e\x01\x9f\x00\x0b\x01\x86\x01\x27\x01\xac\xff\xac\xff\xac\xff\x61\x00\x0c\x00\xac\xff\xac\xff\x88\x01\x27\x01\xac\xff\x7f\x01\xbd\x00\xa2\xff\x0d\x00\x75\x00\x0b\x00\x0c\x00\xbe\x00\x80\x01\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\xa2\xff\x0d\x00\xa2\xff\xa2\xff\xa2\xff\xa2\xff\x3e\x00\xb0\xff\x29\x01\x3f\x00\xe8\x00\xa2\xff\xa2\xff\xa2\xff\x8b\x01\x27\x01\xa2\xff\xa2\xff\x17\x01\xb0\xff\xa2\xff\xb0\xff\xb0\xff\xb0\xff\xb0\xff\x3e\x00\xae\xff\x1c\x01\x3f\x00\x97\x00\xb0\xff\xb0\xff\xb0\xff\x5d\x01\xf0\x00\xb0\xff\xb0\xff\xdd\x00\xae\xff\xb0\xff\xae\xff\xae\xff\xae\xff\xae\xff\x3e\x00\xaa\xff\xd0\x00\x3f\x00\x40\x00\xae\xff\xae\xff\xae\xff\x65\x01\x66\x01\xae\xff\xae\xff\x04\x00\xaa\xff\xae\xff\xaa\xff\xaa\xff\xaa\xff\xaa\xff\x3e\x00\x26\x01\x27\x01\x3f\x00\x4a\x00\xaa\xff\xaa\xff\xaa\xff\x6e\x01\x6f\x01\xaa\xff\xaa\xff\x71\x01\x72\x01\xaa\xff\x12\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x12\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x2e\x00\x0d\x00\x72\x00\x6e\x00\x6f\x00\x0b\x00\x0c\x00\x0e\x00\x0d\x00\x74\x01\x75\x01\x76\x00\x13\x01\x7e\x01\x0e\x00\x0d\x00\x05\x01\x81\x00\x82\x00\x13\x01\x14\x01\x12\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x4e\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x53\x00\x0d\x00\x6a\x00\x86\x00\x81\x00\x82\x00\xef\x01\x0e\x00\x0d\x00\x36\x01\x27\x01\xed\x01\x13\x01\x15\x01\x0e\x00\x4f\x00\x50\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x50\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xee\x01\x0d\x00\x37\x01\x38\x01\xe4\x01\x45\x00\xb3\x01\x0e\x00\x0d\x00\x9e\x00\x81\x00\x82\x00\x45\x00\x51\x00\x0e\x00\xa3\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x16\x01\xb9\x01\x9f\x00\x11\x01\xc9\x01\xef\x00\xf0\x00\xce\x01\x0d\x00\x9e\x00\x81\x00\x82\x00\x0e\x01\x82\x00\x0e\x00\xa3\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xbc\x00\xb6\x00\x9f\x00\xbb\x00\x10\x01\x82\x00\x21\x01\xf0\x00\x0d\x00\x9e\x00\x81\x00\x82\x00\x2b\x00\x2c\x00\x0e\x00\xa3\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xa4\x00\xd2\x01\x9f\x00\xa0\x00\x45\x00\xd2\x00\x45\x00\x46\x00\x0d\x00\x45\x00\x49\x00\xd4\x01\xde\x01\xe1\x01\x0e\x00\xa3\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xa9\x00\xe4\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\xe2\x01\xb1\x01\xb2\x01\xb9\x01\xba\x01\x0e\x00\xbc\x01\x0d\x00\xbd\x01\xbf\x01\xc3\x01\xc9\x01\xca\x01\x0e\x00\xe9\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xd5\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xcc\x01\x0d\x00\xcb\x01\x29\x01\x29\x01\xb6\x00\x8a\x01\x0e\x00\x0d\x00\x8b\x01\x29\x01\x1c\xff\x90\x01\x9a\x01\x0e\x00\xd8\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xdc\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x96\x01\x0d\x00\x9c\x01\x1c\xff\x9f\x01\xa1\x01\x1c\xff\x0e\x00\x0d\x00\xa3\x01\xa4\x01\x1c\xff\xa8\x01\xae\x01\x0e\x00\xb6\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xba\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x5d\x01\x0d\x00\xaf\x01\x5f\x01\x62\x01\x65\x01\x6a\x01\x0e\x00\x0d\x00\x64\x01\x6b\x01\x6c\x01\x6e\x01\x43\x00\x0e\x00\xbd\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xbf\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x71\x01\x0d\x00\x74\x01\x77\x01\x79\x01\x78\x01\x01\x01\x0e\x00\x0d\x00\x82\x01\x7c\x01\x43\x00\x7d\x01\x83\x01\x0e\x00\xc0\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xc4\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x84\x01\x0d\x00\x85\x01\x29\x01\x86\x01\x43\x00\x2b\x01\x0e\x00\x0d\x00\x2c\x01\x2e\x01\x2f\x01\x30\x01\x34\x01\x0e\x00\xc5\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x7d\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x31\x01\x0d\x00\x29\x01\xb7\x00\x59\x01\x5a\x01\x5b\x01\x0e\x00\x0d\x00\x5c\x01\x03\x01\x04\x01\x43\x00\x05\x01\x0e\x00\x31\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x32\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x09\x01\x0d\x00\x0a\x01\x8c\x00\x0b\x01\x0d\x01\x0e\x01\x0e\x00\x0d\x00\x1b\x01\x19\x01\x24\x01\x1c\x01\x1e\x01\x0e\x00\x0f\x01\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xcb\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x1f\x01\x0d\x00\xb8\x00\xba\x00\xb9\x00\xbb\x00\xc4\x00\x0e\x00\x0d\x00\xc2\x00\xc3\x00\xc6\x00\xc7\x00\xc8\x00\x0e\x00\xcc\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xce\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x61\x00\x0d\x00\x43\x00\xd0\x00\x43\x00\xdc\x00\xd2\x00\x0e\x00\x0d\x00\xd6\x00\xdf\x00\xe0\x00\xe2\x00\xe5\x00\x0e\x00\xd3\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xd4\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xe4\x00\x0d\x00\xe6\x00\xe7\x00\xe8\x00\x43\x00\x6c\x00\x0e\x00\x0d\x00\x61\x00\x71\x00\x7b\x00\x7f\x00\x80\x00\x0e\x00\xd7\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xda\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x89\x00\x0d\x00\x8a\x00\x88\x00\x8b\x00\x90\x00\x92\x00\x0e\x00\x0d\x00\x91\x00\x93\x00\x94\x00\x95\x00\x97\x00\x0e\x00\x6c\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x71\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x9a\x00\x0d\x00\x43\x00\x99\x00\x61\x00\xab\x00\xac\x00\x0e\x00\x0d\x00\xad\x00\xb1\x00\xae\x00\xaf\x00\xb0\x00\x0e\x00\x79\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x50\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xff\xff\x0d\x00\xff\xff\x36\x00\x3a\x00\x3d\x00\x3b\x00\x0e\x00\x0d\x00\x60\x00\x3e\x00\x43\x00\x61\x00\x69\x00\x0e\x00\x44\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\xf6\x00\x0d\x00\xf7\x00\xf8\x00\xf9\x00\xfa\x00\x6a\x00\x0e\x00\x0d\x00\xff\xff\x06\x00\xfb\x00\xfc\x00\xfd\x00\x0e\x00\x00\x00\xfe\x00\xff\x00\x00\x00\x00\x00\x00\x01\x6d\x00\x08\x00\x6e\x00\x6f\x00\x0b\x00\x0c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#
-
-happyReduceArr = array (3, 227) [
- (3 , happyReduce_3),
- (4 , happyReduce_4),
- (5 , happyReduce_5),
- (6 , happyReduce_6),
- (7 , happyReduce_7),
- (8 , happyReduce_8),
- (9 , happyReduce_9),
- (10 , happyReduce_10),
- (11 , happyReduce_11),
- (12 , happyReduce_12),
- (13 , happyReduce_13),
- (14 , happyReduce_14),
- (15 , happyReduce_15),
- (16 , happyReduce_16),
- (17 , happyReduce_17),
- (18 , happyReduce_18),
- (19 , happyReduce_19),
- (20 , happyReduce_20),
- (21 , happyReduce_21),
- (22 , happyReduce_22),
- (23 , happyReduce_23),
- (24 , happyReduce_24),
- (25 , happyReduce_25),
- (26 , happyReduce_26),
- (27 , happyReduce_27),
- (28 , happyReduce_28),
- (29 , happyReduce_29),
- (30 , happyReduce_30),
- (31 , happyReduce_31),
- (32 , happyReduce_32),
- (33 , happyReduce_33),
- (34 , happyReduce_34),
- (35 , happyReduce_35),
- (36 , happyReduce_36),
- (37 , happyReduce_37),
- (38 , happyReduce_38),
- (39 , happyReduce_39),
- (40 , happyReduce_40),
- (41 , happyReduce_41),
- (42 , happyReduce_42),
- (43 , happyReduce_43),
- (44 , happyReduce_44),
- (45 , happyReduce_45),
- (46 , happyReduce_46),
- (47 , happyReduce_47),
- (48 , happyReduce_48),
- (49 , happyReduce_49),
- (50 , happyReduce_50),
- (51 , happyReduce_51),
- (52 , happyReduce_52),
- (53 , happyReduce_53),
- (54 , happyReduce_54),
- (55 , happyReduce_55),
- (56 , happyReduce_56),
- (57 , happyReduce_57),
- (58 , happyReduce_58),
- (59 , happyReduce_59),
- (60 , happyReduce_60),
- (61 , happyReduce_61),
- (62 , happyReduce_62),
- (63 , happyReduce_63),
- (64 , happyReduce_64),
- (65 , happyReduce_65),
- (66 , happyReduce_66),
- (67 , happyReduce_67),
- (68 , happyReduce_68),
- (69 , happyReduce_69),
- (70 , happyReduce_70),
- (71 , happyReduce_71),
- (72 , happyReduce_72),
- (73 , happyReduce_73),
- (74 , happyReduce_74),
- (75 , happyReduce_75),
- (76 , happyReduce_76),
- (77 , happyReduce_77),
- (78 , happyReduce_78),
- (79 , happyReduce_79),
- (80 , happyReduce_80),
- (81 , happyReduce_81),
- (82 , happyReduce_82),
- (83 , happyReduce_83),
- (84 , happyReduce_84),
- (85 , happyReduce_85),
- (86 , happyReduce_86),
- (87 , happyReduce_87),
- (88 , happyReduce_88),
- (89 , happyReduce_89),
- (90 , happyReduce_90),
- (91 , happyReduce_91),
- (92 , happyReduce_92),
- (93 , happyReduce_93),
- (94 , happyReduce_94),
- (95 , happyReduce_95),
- (96 , happyReduce_96),
- (97 , happyReduce_97),
- (98 , happyReduce_98),
- (99 , happyReduce_99),
- (100 , happyReduce_100),
- (101 , happyReduce_101),
- (102 , happyReduce_102),
- (103 , happyReduce_103),
- (104 , happyReduce_104),
- (105 , happyReduce_105),
- (106 , happyReduce_106),
- (107 , happyReduce_107),
- (108 , happyReduce_108),
- (109 , happyReduce_109),
- (110 , happyReduce_110),
- (111 , happyReduce_111),
- (112 , happyReduce_112),
- (113 , happyReduce_113),
- (114 , happyReduce_114),
- (115 , happyReduce_115),
- (116 , happyReduce_116),
- (117 , happyReduce_117),
- (118 , happyReduce_118),
- (119 , happyReduce_119),
- (120 , happyReduce_120),
- (121 , happyReduce_121),
- (122 , happyReduce_122),
- (123 , happyReduce_123),
- (124 , happyReduce_124),
- (125 , happyReduce_125),
- (126 , happyReduce_126),
- (127 , happyReduce_127),
- (128 , happyReduce_128),
- (129 , happyReduce_129),
- (130 , happyReduce_130),
- (131 , happyReduce_131),
- (132 , happyReduce_132),
- (133 , happyReduce_133),
- (134 , happyReduce_134),
- (135 , happyReduce_135),
- (136 , happyReduce_136),
- (137 , happyReduce_137),
- (138 , happyReduce_138),
- (139 , happyReduce_139),
- (140 , happyReduce_140),
- (141 , happyReduce_141),
- (142 , happyReduce_142),
- (143 , happyReduce_143),
- (144 , happyReduce_144),
- (145 , happyReduce_145),
- (146 , happyReduce_146),
- (147 , happyReduce_147),
- (148 , happyReduce_148),
- (149 , happyReduce_149),
- (150 , happyReduce_150),
- (151 , happyReduce_151),
- (152 , happyReduce_152),
- (153 , happyReduce_153),
- (154 , happyReduce_154),
- (155 , happyReduce_155),
- (156 , happyReduce_156),
- (157 , happyReduce_157),
- (158 , happyReduce_158),
- (159 , happyReduce_159),
- (160 , happyReduce_160),
- (161 , happyReduce_161),
- (162 , happyReduce_162),
- (163 , happyReduce_163),
- (164 , happyReduce_164),
- (165 , happyReduce_165),
- (166 , happyReduce_166),
- (167 , happyReduce_167),
- (168 , happyReduce_168),
- (169 , happyReduce_169),
- (170 , happyReduce_170),
- (171 , happyReduce_171),
- (172 , happyReduce_172),
- (173 , happyReduce_173),
- (174 , happyReduce_174),
- (175 , happyReduce_175),
- (176 , happyReduce_176),
- (177 , happyReduce_177),
- (178 , happyReduce_178),
- (179 , happyReduce_179),
- (180 , happyReduce_180),
- (181 , happyReduce_181),
- (182 , happyReduce_182),
- (183 , happyReduce_183),
- (184 , happyReduce_184),
- (185 , happyReduce_185),
- (186 , happyReduce_186),
- (187 , happyReduce_187),
- (188 , happyReduce_188),
- (189 , happyReduce_189),
- (190 , happyReduce_190),
- (191 , happyReduce_191),
- (192 , happyReduce_192),
- (193 , happyReduce_193),
- (194 , happyReduce_194),
- (195 , happyReduce_195),
- (196 , happyReduce_196),
- (197 , happyReduce_197),
- (198 , happyReduce_198),
- (199 , happyReduce_199),
- (200 , happyReduce_200),
- (201 , happyReduce_201),
- (202 , happyReduce_202),
- (203 , happyReduce_203),
- (204 , happyReduce_204),
- (205 , happyReduce_205),
- (206 , happyReduce_206),
- (207 , happyReduce_207),
- (208 , happyReduce_208),
- (209 , happyReduce_209),
- (210 , happyReduce_210),
- (211 , happyReduce_211),
- (212 , happyReduce_212),
- (213 , happyReduce_213),
- (214 , happyReduce_214),
- (215 , happyReduce_215),
- (216 , happyReduce_216),
- (217 , happyReduce_217),
- (218 , happyReduce_218),
- (219 , happyReduce_219),
- (220 , happyReduce_220),
- (221 , happyReduce_221),
- (222 , happyReduce_222),
- (223 , happyReduce_223),
- (224 , happyReduce_224),
- (225 , happyReduce_225),
- (226 , happyReduce_226),
- (227 , happyReduce_227)
- ]
-
-happy_n_terms = 72 :: Int
-happy_n_nonterms = 73 :: Int
-
-happyReduce_3 = happyMonadReduce 4# 0# happyReduction_3
-happyReduction_3 (happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest) tk
- = happyThen (case happyOut8 happy_x_1 of { happy_var_1 ->
- case happyOut9 happy_x_2 of { happy_var_2 ->
- case happyOut12 happy_x_4 of { happy_var_4 ->
- (
- do let mstat = happy_var_1
- (mtype,id) = happy_var_2
- (extends,with,content) = happy_var_4
- (opens,jments,opts) = case content of { Just c -> c; Nothing -> ([],[],noOptions) }
- mapM_ (checkInfoType mtype) jments
- defs <- case buildAnyTree id [(i,d) | (i,_,d) <- jments] of
- Ok x -> return x
- Bad msg -> fail msg
- let poss = buildTree [(i,(fname,mkSrcSpan p)) | (i,p,_) <- jments]
- fname = showIdent id ++ ".gf"
-
- mkSrcSpan :: (Posn, Posn) -> (Int,Int)
- mkSrcSpan (Pn l1 _, Pn l2 _) = (l1,l2)
-
- return (id, ModInfo mtype mstat opts extends with opens [] defs poss))}}}
- ) (\r -> happyReturn (happyIn6 r))
-
-happyReduce_4 = happyReduce 4# 1# happyReduction_4
-happyReduction_4 (happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut8 happy_x_1 of { happy_var_1 ->
- case happyOut9 happy_x_2 of { happy_var_2 ->
- case happyOut10 happy_x_4 of { happy_var_4 ->
- happyIn7
- (let { mstat = happy_var_1 ;
- (mtype,id) = happy_var_2 ;
- (extends,with,opens) = happy_var_4 }
- in (id, ModInfo mtype mstat noOptions extends with opens [] emptyBinTree emptyBinTree)
- ) `HappyStk` happyRest}}}
-
-happyReduce_5 = happySpecReduce_0 2# happyReduction_5
-happyReduction_5 = happyIn8
- (MSComplete
- )
-
-happyReduce_6 = happySpecReduce_1 2# happyReduction_6
-happyReduction_6 happy_x_1
- = happyIn8
- (MSIncomplete
- )
-
-happyReduce_7 = happySpecReduce_2 3# happyReduction_7
-happyReduction_7 happy_x_2
- happy_x_1
- = case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- happyIn9
- ((MTAbstract, happy_var_2)
- )}
-
-happyReduce_8 = happySpecReduce_2 3# happyReduction_8
-happyReduction_8 happy_x_2
- happy_x_1
- = case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- happyIn9
- ((MTResource, happy_var_2)
- )}
-
-happyReduce_9 = happySpecReduce_2 3# happyReduction_9
-happyReduction_9 happy_x_2
- happy_x_1
- = case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- happyIn9
- ((MTInterface, happy_var_2)
- )}
-
-happyReduce_10 = happyReduce 4# 3# happyReduction_10
-happyReduction_10 (happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- case happyOutTok happy_x_4 of { ((T_Ident happy_var_4)) ->
- happyIn9
- ((MTConcrete happy_var_4, happy_var_2)
- ) `HappyStk` happyRest}}
-
-happyReduce_11 = happyReduce 4# 3# happyReduction_11
-happyReduction_11 (happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- case happyOutTok happy_x_4 of { ((T_Ident happy_var_4)) ->
- happyIn9
- ((MTInstance happy_var_4, happy_var_2)
- ) `HappyStk` happyRest}}
-
-happyReduce_12 = happyReduce 6# 3# happyReduction_12
-happyReduction_12 (happy_x_6 `HappyStk`
- happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- case happyOut16 happy_x_4 of { happy_var_4 ->
- case happyOut16 happy_x_6 of { happy_var_6 ->
- happyIn9
- ((MTTransfer happy_var_4 happy_var_6,happy_var_2)
- ) `HappyStk` happyRest}}}
-
-happyReduce_13 = happyReduce 7# 4# happyReduction_13
-happyReduction_13 (happy_x_7 `HappyStk`
- happy_x_6 `HappyStk`
- happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut19 happy_x_1 of { happy_var_1 ->
- case happyOut20 happy_x_3 of { happy_var_3 ->
- case happyOut17 happy_x_5 of { happy_var_5 ->
- case happyOut11 happy_x_7 of { happy_var_7 ->
- happyIn10
- ((happy_var_1, Just (fst happy_var_3,snd happy_var_3,happy_var_5), happy_var_7)
- ) `HappyStk` happyRest}}}}
-
-happyReduce_14 = happyReduce 5# 4# happyReduction_14
-happyReduction_14 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut19 happy_x_1 of { happy_var_1 ->
- case happyOut20 happy_x_3 of { happy_var_3 ->
- case happyOut17 happy_x_5 of { happy_var_5 ->
- happyIn10
- ((happy_var_1, Just (fst happy_var_3,snd happy_var_3,happy_var_5), [])
- ) `HappyStk` happyRest}}}
-
-happyReduce_15 = happySpecReduce_3 4# happyReduction_15
-happyReduction_15 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut19 happy_x_1 of { happy_var_1 ->
- case happyOut11 happy_x_3 of { happy_var_3 ->
- happyIn10
- ((happy_var_1, Nothing, happy_var_3)
- )}}
-
-happyReduce_16 = happySpecReduce_1 4# happyReduction_16
-happyReduction_16 happy_x_1
- = case happyOut19 happy_x_1 of { happy_var_1 ->
- happyIn10
- ((happy_var_1, Nothing, [])
- )}
-
-happyReduce_17 = happyReduce 5# 4# happyReduction_17
-happyReduction_17 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut20 happy_x_1 of { happy_var_1 ->
- case happyOut17 happy_x_3 of { happy_var_3 ->
- case happyOut11 happy_x_5 of { happy_var_5 ->
- happyIn10
- (([], Just (fst happy_var_1,snd happy_var_1,happy_var_3), happy_var_5)
- ) `HappyStk` happyRest}}}
-
-happyReduce_18 = happySpecReduce_3 4# happyReduction_18
-happyReduction_18 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut20 happy_x_1 of { happy_var_1 ->
- case happyOut17 happy_x_3 of { happy_var_3 ->
- happyIn10
- (([], Just (fst happy_var_1,snd happy_var_1,happy_var_3), [])
- )}}
-
-happyReduce_19 = happySpecReduce_1 4# happyReduction_19
-happyReduction_19 happy_x_1
- = case happyOut11 happy_x_1 of { happy_var_1 ->
- happyIn10
- (([], Nothing, happy_var_1)
- )}
-
-happyReduce_20 = happySpecReduce_0 5# happyReduction_20
-happyReduction_20 = happyIn11
- ([]
- )
-
-happyReduce_21 = happySpecReduce_2 5# happyReduction_21
-happyReduction_21 happy_x_2
- happy_x_1
- = case happyOut15 happy_x_2 of { happy_var_2 ->
- happyIn11
- (happy_var_2
- )}
-
-happyReduce_22 = happyReduce 7# 6# happyReduction_22
-happyReduction_22 (happy_x_7 `HappyStk`
- happy_x_6 `HappyStk`
- happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut19 happy_x_1 of { happy_var_1 ->
- case happyOut20 happy_x_3 of { happy_var_3 ->
- case happyOut17 happy_x_5 of { happy_var_5 ->
- case happyOut13 happy_x_7 of { happy_var_7 ->
- happyIn12
- ((happy_var_1, Just (fst happy_var_3,snd happy_var_3,happy_var_5), Just happy_var_7)
- ) `HappyStk` happyRest}}}}
-
-happyReduce_23 = happyReduce 5# 6# happyReduction_23
-happyReduction_23 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut19 happy_x_1 of { happy_var_1 ->
- case happyOut20 happy_x_3 of { happy_var_3 ->
- case happyOut17 happy_x_5 of { happy_var_5 ->
- happyIn12
- ((happy_var_1, Just (fst happy_var_3,snd happy_var_3,happy_var_5), Nothing)
- ) `HappyStk` happyRest}}}
-
-happyReduce_24 = happySpecReduce_3 6# happyReduction_24
-happyReduction_24 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut19 happy_x_1 of { happy_var_1 ->
- case happyOut13 happy_x_3 of { happy_var_3 ->
- happyIn12
- ((happy_var_1, Nothing, Just happy_var_3)
- )}}
-
-happyReduce_25 = happySpecReduce_1 6# happyReduction_25
-happyReduction_25 happy_x_1
- = case happyOut19 happy_x_1 of { happy_var_1 ->
- happyIn12
- ((happy_var_1, Nothing, Nothing)
- )}
-
-happyReduce_26 = happyReduce 5# 6# happyReduction_26
-happyReduction_26 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut20 happy_x_1 of { happy_var_1 ->
- case happyOut17 happy_x_3 of { happy_var_3 ->
- case happyOut13 happy_x_5 of { happy_var_5 ->
- happyIn12
- (([], Just (fst happy_var_1,snd happy_var_1,happy_var_3), Just happy_var_5)
- ) `HappyStk` happyRest}}}
-
-happyReduce_27 = happySpecReduce_3 6# happyReduction_27
-happyReduction_27 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut20 happy_x_1 of { happy_var_1 ->
- case happyOut17 happy_x_3 of { happy_var_3 ->
- happyIn12
- (([], Just (fst happy_var_1,snd happy_var_1,happy_var_3), Nothing)
- )}}
-
-happyReduce_28 = happySpecReduce_1 6# happyReduction_28
-happyReduction_28 happy_x_1
- = case happyOut13 happy_x_1 of { happy_var_1 ->
- happyIn12
- (([], Nothing, Just happy_var_1)
- )}
-
-happyReduce_29 = happySpecReduce_2 6# happyReduction_29
-happyReduction_29 happy_x_2
- happy_x_1
- = case happyOut12 happy_x_1 of { happy_var_1 ->
- happyIn12
- (happy_var_1
- )}
-
-happyReduce_30 = happySpecReduce_3 7# happyReduction_30
-happyReduction_30 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut14 happy_x_2 of { happy_var_2 ->
- happyIn13
- (([],[d | Left ds <- happy_var_2, d <- ds],concatOptions [o | Right o <- happy_var_2])
- )}
-
-happyReduce_31 = happyReduce 6# 7# happyReduction_31
-happyReduction_31 (happy_x_6 `HappyStk`
- happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut15 happy_x_2 of { happy_var_2 ->
- case happyOut14 happy_x_5 of { happy_var_5 ->
- happyIn13
- ((happy_var_2,[d | Left ds <- happy_var_5, d <- ds],concatOptions [o | Right o <- happy_var_5])
- ) `HappyStk` happyRest}}
-
-happyReduce_32 = happySpecReduce_0 8# happyReduction_32
-happyReduction_32 = happyIn14
- ([]
- )
-
-happyReduce_33 = happySpecReduce_2 8# happyReduction_33
-happyReduction_33 happy_x_2
- happy_x_1
- = case happyOut21 happy_x_1 of { happy_var_1 ->
- case happyOut14 happy_x_2 of { happy_var_2 ->
- happyIn14
- (happy_var_1 : happy_var_2
- )}}
-
-happyReduce_34 = happySpecReduce_1 9# happyReduction_34
-happyReduction_34 happy_x_1
- = case happyOut16 happy_x_1 of { happy_var_1 ->
- happyIn15
- ([happy_var_1]
- )}
-
-happyReduce_35 = happySpecReduce_3 9# happyReduction_35
-happyReduction_35 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut16 happy_x_1 of { happy_var_1 ->
- case happyOut15 happy_x_3 of { happy_var_3 ->
- happyIn15
- (happy_var_1 : happy_var_3
- )}}
-
-happyReduce_36 = happySpecReduce_1 10# happyReduction_36
-happyReduction_36 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- happyIn16
- (OSimple happy_var_1
- )}
-
-happyReduce_37 = happyReduce 5# 10# happyReduction_37
-happyReduction_37 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- case happyOutTok happy_x_4 of { ((T_Ident happy_var_4)) ->
- happyIn16
- (OQualif happy_var_2 happy_var_4
- ) `HappyStk` happyRest}}
-
-happyReduce_38 = happySpecReduce_1 11# happyReduction_38
-happyReduction_38 happy_x_1
- = case happyOut18 happy_x_1 of { happy_var_1 ->
- happyIn17
- ([happy_var_1]
- )}
-
-happyReduce_39 = happySpecReduce_3 11# happyReduction_39
-happyReduction_39 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut18 happy_x_1 of { happy_var_1 ->
- case happyOut17 happy_x_3 of { happy_var_3 ->
- happyIn17
- (happy_var_1 : happy_var_3
- )}}
-
-happyReduce_40 = happyReduce 5# 12# happyReduction_40
-happyReduction_40 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- case happyOutTok happy_x_4 of { ((T_Ident happy_var_4)) ->
- happyIn18
- ((happy_var_2,happy_var_4)
- ) `HappyStk` happyRest}}
-
-happyReduce_41 = happySpecReduce_1 13# happyReduction_41
-happyReduction_41 happy_x_1
- = case happyOut20 happy_x_1 of { happy_var_1 ->
- happyIn19
- ([happy_var_1]
- )}
-
-happyReduce_42 = happySpecReduce_3 13# happyReduction_42
-happyReduction_42 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut20 happy_x_1 of { happy_var_1 ->
- case happyOut19 happy_x_3 of { happy_var_3 ->
- happyIn19
- (happy_var_1 : happy_var_3
- )}}
-
-happyReduce_43 = happySpecReduce_1 14# happyReduction_43
-happyReduction_43 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- happyIn20
- ((happy_var_1,MIAll )
- )}
-
-happyReduce_44 = happyReduce 4# 14# happyReduction_44
-happyReduction_44 (happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- case happyOut43 happy_x_3 of { happy_var_3 ->
- happyIn20
- ((happy_var_1,MIOnly happy_var_3)
- ) `HappyStk` happyRest}}
-
-happyReduce_45 = happyReduce 5# 14# happyReduction_45
-happyReduction_45 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- case happyOut43 happy_x_4 of { happy_var_4 ->
- happyIn20
- ((happy_var_1,MIExcept happy_var_4)
- ) `HappyStk` happyRest}}
-
-happyReduce_46 = happySpecReduce_2 15# happyReduction_46
-happyReduction_46 happy_x_2
- happy_x_1
- = case happyOut36 happy_x_2 of { happy_var_2 ->
- happyIn21
- (Left happy_var_2
- )}
-
-happyReduce_47 = happySpecReduce_2 15# happyReduction_47
-happyReduction_47 happy_x_2
- happy_x_1
- = case happyOut37 happy_x_2 of { happy_var_2 ->
- happyIn21
- (Left happy_var_2
- )}
-
-happyReduce_48 = happySpecReduce_2 15# happyReduction_48
-happyReduction_48 happy_x_2
- happy_x_1
- = case happyOut34 happy_x_2 of { happy_var_2 ->
- happyIn21
- (Left happy_var_2
- )}
-
-happyReduce_49 = happySpecReduce_2 15# happyReduction_49
-happyReduction_49 happy_x_2
- happy_x_1
- = case happyOut38 happy_x_2 of { happy_var_2 ->
- happyIn21
- (Left happy_var_2
- )}
-
-happyReduce_50 = happySpecReduce_2 15# happyReduction_50
-happyReduction_50 happy_x_2
- happy_x_1
- = case happyOut39 happy_x_2 of { happy_var_2 ->
- happyIn21
- (Left happy_var_2
- )}
-
-happyReduce_51 = happySpecReduce_2 15# happyReduction_51
-happyReduction_51 happy_x_2
- happy_x_1
- = case happyOut35 happy_x_2 of { happy_var_2 ->
- happyIn21
- (Left happy_var_2
- )}
-
-happyReduce_52 = happySpecReduce_2 15# happyReduction_52
-happyReduction_52 happy_x_2
- happy_x_1
- = case happyOut40 happy_x_2 of { happy_var_2 ->
- happyIn21
- (Left [(f, pos, CncCat (Just e) Nothing Nothing ) | (f,pos,e) <- happy_var_2]
- )}
-
-happyReduce_53 = happySpecReduce_2 15# happyReduction_53
-happyReduction_53 happy_x_2
- happy_x_1
- = case happyOut40 happy_x_2 of { happy_var_2 ->
- happyIn21
- (Left [(f, pos, CncCat Nothing (Just e) Nothing ) | (f,pos,e) <- happy_var_2]
- )}
-
-happyReduce_54 = happySpecReduce_2 15# happyReduction_54
-happyReduction_54 happy_x_2
- happy_x_1
- = case happyOut33 happy_x_2 of { happy_var_2 ->
- happyIn21
- (Left happy_var_2
- )}
-
-happyReduce_55 = happySpecReduce_3 15# happyReduction_55
-happyReduction_55 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut40 happy_x_3 of { happy_var_3 ->
- happyIn21
- (Left [(f, pos, CncCat Nothing Nothing (Just e)) | (f,pos,e) <- happy_var_3]
- )}
-
-happyReduce_56 = happySpecReduce_3 15# happyReduction_56
-happyReduction_56 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut40 happy_x_3 of { happy_var_3 ->
- happyIn21
- (Left [(f, pos, CncFun Nothing Nothing (Just e)) | (f,pos,e) <- happy_var_3]
- )}
-
-happyReduce_57 = happySpecReduce_2 15# happyReduction_57
-happyReduction_57 happy_x_2
- happy_x_1
- = case happyOut41 happy_x_2 of { happy_var_2 ->
- happyIn21
- (Right happy_var_2
- )}
-
-happyReduce_58 = happyReduce 4# 16# happyReduction_58
-happyReduction_58 (happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- case happyOut77 happy_x_3 of { happy_var_3 ->
- case happyOut78 happy_x_4 of { happy_var_4 ->
- happyIn22
- ([(happy_var_2, (happy_var_1,happy_var_4), AbsCat (Just happy_var_3) Nothing)]
- ) `HappyStk` happyRest}}}}
-
-happyReduce_59 = happyReduce 6# 16# happyReduction_59
-happyReduction_59 (happy_x_6 `HappyStk`
- happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOutTok happy_x_3 of { ((T_Ident happy_var_3)) ->
- case happyOut77 happy_x_4 of { happy_var_4 ->
- case happyOut78 happy_x_6 of { happy_var_6 ->
- happyIn22
- (listCatDef happy_var_3 (happy_var_1,happy_var_6) happy_var_4 0
- ) `HappyStk` happyRest}}}}
-
-happyReduce_60 = happyReduce 9# 16# happyReduction_60
-happyReduction_60 (happy_x_9 `HappyStk`
- happy_x_8 `HappyStk`
- happy_x_7 `HappyStk`
- happy_x_6 `HappyStk`
- happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOutTok happy_x_3 of { ((T_Ident happy_var_3)) ->
- case happyOut77 happy_x_4 of { happy_var_4 ->
- case happyOutTok happy_x_7 of { ((T_Integer happy_var_7)) ->
- case happyOut78 happy_x_9 of { happy_var_9 ->
- happyIn22
- (listCatDef happy_var_3 (happy_var_1,happy_var_9) happy_var_4 (fromIntegral happy_var_7)
- ) `HappyStk` happyRest}}}}}
-
-happyReduce_61 = happyReduce 5# 17# happyReduction_61
-happyReduction_61 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOut43 happy_x_2 of { happy_var_2 ->
- case happyOut48 happy_x_4 of { happy_var_4 ->
- case happyOut78 happy_x_5 of { happy_var_5 ->
- happyIn23
- ([(fun, (happy_var_1,happy_var_5), AbsFun (Just happy_var_4) Nothing (Just [])) | fun <- happy_var_2]
- ) `HappyStk` happyRest}}}}
-
-happyReduce_62 = happyReduce 5# 18# happyReduction_62
-happyReduction_62 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOut45 happy_x_2 of { happy_var_2 ->
- case happyOut48 happy_x_4 of { happy_var_4 ->
- case happyOut78 happy_x_5 of { happy_var_5 ->
- happyIn24
- ([(f, (happy_var_1,happy_var_5),AbsFun Nothing (Just 0) (Just [([],happy_var_4)])) | f <- happy_var_2]
- ) `HappyStk` happyRest}}}}
-
-happyReduce_63 = happyReduce 6# 18# happyReduction_63
-happyReduction_63 (happy_x_6 `HappyStk`
- happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOut44 happy_x_2 of { happy_var_2 ->
- case happyOut65 happy_x_3 of { happy_var_3 ->
- case happyOut48 happy_x_5 of { happy_var_5 ->
- case happyOut78 happy_x_6 of { happy_var_6 ->
- happyIn24
- ([(happy_var_2,(happy_var_1,happy_var_6),AbsFun Nothing (Just (length happy_var_3)) (Just [(happy_var_3,happy_var_5)]))]
- ) `HappyStk` happyRest}}}}}
-
-happyReduce_64 = happyReduce 5# 19# happyReduction_64
-happyReduction_64 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- case happyOut31 happy_x_4 of { happy_var_4 ->
- case happyOut78 happy_x_5 of { happy_var_5 ->
- happyIn25
- ((happy_var_2, (happy_var_1,happy_var_5), AbsCat Nothing (Just (map Cn happy_var_4))) :
- [(fun, (happy_var_1,happy_var_5), AbsFun Nothing Nothing Nothing) | fun <- happy_var_4]
- ) `HappyStk` happyRest}}}}
-
-happyReduce_65 = happyReduce 5# 19# happyReduction_65
-happyReduction_65 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOut43 happy_x_2 of { happy_var_2 ->
- case happyOut48 happy_x_4 of { happy_var_4 ->
- case happyOut78 happy_x_5 of { happy_var_5 ->
- happyIn25
- ([(cat, (happy_var_1,happy_var_5), AbsCat Nothing (Just (map Cn happy_var_2))) | Ok (_,cat) <- [valCat happy_var_4]] ++
- [(fun, (happy_var_1,happy_var_5), AbsFun (Just happy_var_4) Nothing Nothing) | fun <- happy_var_2]
- ) `HappyStk` happyRest}}}}
-
-happyReduce_66 = happyReduce 5# 20# happyReduction_66
-happyReduction_66 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- case happyOut42 happy_x_4 of { happy_var_4 ->
- case happyOut78 happy_x_5 of { happy_var_5 ->
- happyIn26
- ((happy_var_2, (happy_var_1,happy_var_5), ResParam (Just (happy_var_4,Nothing))) :
- [(f, (happy_var_1,happy_var_5), ResValue (Just (mkProdSimple co (Cn happy_var_2),Nothing))) | (f,co) <- happy_var_4]
- ) `HappyStk` happyRest}}}}
-
-happyReduce_67 = happySpecReduce_3 20# happyReduction_67
-happyReduction_67 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- case happyOut78 happy_x_3 of { happy_var_3 ->
- happyIn26
- ([(happy_var_2, (happy_var_1,happy_var_3), ResParam Nothing)]
- )}}}
-
-happyReduce_68 = happyReduce 5# 21# happyReduction_68
-happyReduction_68 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOut45 happy_x_2 of { happy_var_2 ->
- case happyOut48 happy_x_4 of { happy_var_4 ->
- case happyOut78 happy_x_5 of { happy_var_5 ->
- happyIn27
- ([(i, (happy_var_1,happy_var_5), info) | i <- happy_var_2, info <- mkOverload (Just happy_var_4) Nothing ]
- ) `HappyStk` happyRest}}}}
-
-happyReduce_69 = happyReduce 5# 21# happyReduction_69
-happyReduction_69 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOut45 happy_x_2 of { happy_var_2 ->
- case happyOut48 happy_x_4 of { happy_var_4 ->
- case happyOut78 happy_x_5 of { happy_var_5 ->
- happyIn27
- ([(i, (happy_var_1,happy_var_5), info) | i <- happy_var_2, info <- mkOverload Nothing (Just happy_var_4)]
- ) `HappyStk` happyRest}}}}
-
-happyReduce_70 = happyReduce 6# 21# happyReduction_70
-happyReduction_70 (happy_x_6 `HappyStk`
- happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOut44 happy_x_2 of { happy_var_2 ->
- case happyOut66 happy_x_3 of { happy_var_3 ->
- case happyOut48 happy_x_5 of { happy_var_5 ->
- case happyOut78 happy_x_6 of { happy_var_6 ->
- happyIn27
- ([(i, (happy_var_1,happy_var_6), info) | i <- [happy_var_2], info <- mkOverload Nothing (Just (mkAbs happy_var_3 happy_var_5))]
- ) `HappyStk` happyRest}}}}}
-
-happyReduce_71 = happyReduce 7# 21# happyReduction_71
-happyReduction_71 (happy_x_7 `HappyStk`
- happy_x_6 `HappyStk`
- happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOut45 happy_x_2 of { happy_var_2 ->
- case happyOut48 happy_x_4 of { happy_var_4 ->
- case happyOut48 happy_x_6 of { happy_var_6 ->
- case happyOut78 happy_x_7 of { happy_var_7 ->
- happyIn27
- ([(i, (happy_var_1,happy_var_7), info) | i <- happy_var_2, info <- mkOverload (Just happy_var_4) (Just happy_var_6)]
- ) `HappyStk` happyRest}}}}}
-
-happyReduce_72 = happyReduce 5# 22# happyReduction_72
-happyReduction_72 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOut45 happy_x_2 of { happy_var_2 ->
- case happyOut48 happy_x_4 of { happy_var_4 ->
- case happyOut78 happy_x_5 of { happy_var_5 ->
- happyIn28
- ([(f, (happy_var_1,happy_var_5), CncFun Nothing (Just happy_var_4) Nothing) | f <- happy_var_2]
- ) `HappyStk` happyRest}}}}
-
-happyReduce_73 = happyReduce 6# 22# happyReduction_73
-happyReduction_73 (happy_x_6 `HappyStk`
- happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOut44 happy_x_2 of { happy_var_2 ->
- case happyOut66 happy_x_3 of { happy_var_3 ->
- case happyOut48 happy_x_5 of { happy_var_5 ->
- case happyOut78 happy_x_6 of { happy_var_6 ->
- happyIn28
- ([(happy_var_2, (happy_var_1,happy_var_6), CncFun Nothing (Just (mkAbs happy_var_3 happy_var_5)) Nothing)]
- ) `HappyStk` happyRest}}}}}
-
-happyReduce_74 = happyReduce 5# 23# happyReduction_74
-happyReduction_74 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOut45 happy_x_2 of { happy_var_2 ->
- case happyOut48 happy_x_4 of { happy_var_4 ->
- case happyOut78 happy_x_5 of { happy_var_5 ->
- happyIn29
- ([(i,(happy_var_1,happy_var_5),happy_var_4) | i <- happy_var_2]
- ) `HappyStk` happyRest}}}}
-
-happyReduce_75 = happyMonadReduce 5# 24# happyReduction_75
-happyReduction_75 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest) tk
- = happyThen (case happyOut78 happy_x_1 of { happy_var_1 ->
- case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- case happyOutTok happy_x_4 of { ((T_Ident happy_var_4)) ->
- ( case parseModuleOptions ["--" ++ prIdent happy_var_2 ++ "=" ++ prIdent happy_var_4] of
- Ok x -> return x
- Bad msg -> failLoc happy_var_1 msg)}}}
- ) (\r -> happyReturn (happyIn30 r))
-
-happyReduce_76 = happySpecReduce_1 25# happyReduction_76
-happyReduction_76 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- happyIn31
- ([happy_var_1]
- )}
-
-happyReduce_77 = happySpecReduce_3 25# happyReduction_77
-happyReduction_77 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- case happyOut31 happy_x_3 of { happy_var_3 ->
- happyIn31
- (happy_var_1 : happy_var_3
- )}}
-
-happyReduce_78 = happySpecReduce_2 26# happyReduction_78
-happyReduction_78 happy_x_2
- happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- case happyOut77 happy_x_2 of { happy_var_2 ->
- happyIn32
- ((happy_var_1,happy_var_2)
- )}}
-
-happyReduce_79 = happySpecReduce_2 27# happyReduction_79
-happyReduction_79 happy_x_2
- happy_x_1
- = case happyOut28 happy_x_1 of { happy_var_1 ->
- happyIn33
- (happy_var_1
- )}
-
-happyReduce_80 = happySpecReduce_3 27# happyReduction_80
-happyReduction_80 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut28 happy_x_1 of { happy_var_1 ->
- case happyOut33 happy_x_3 of { happy_var_3 ->
- happyIn33
- (happy_var_1 ++ happy_var_3
- )}}
-
-happyReduce_81 = happySpecReduce_2 28# happyReduction_81
-happyReduction_81 happy_x_2
- happy_x_1
- = case happyOut24 happy_x_1 of { happy_var_1 ->
- happyIn34
- (happy_var_1
- )}
-
-happyReduce_82 = happySpecReduce_3 28# happyReduction_82
-happyReduction_82 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut24 happy_x_1 of { happy_var_1 ->
- case happyOut34 happy_x_3 of { happy_var_3 ->
- happyIn34
- (happy_var_1 ++ happy_var_3
- )}}
-
-happyReduce_83 = happySpecReduce_2 29# happyReduction_83
-happyReduction_83 happy_x_2
- happy_x_1
- = case happyOut27 happy_x_1 of { happy_var_1 ->
- happyIn35
- (happy_var_1
- )}
-
-happyReduce_84 = happySpecReduce_3 29# happyReduction_84
-happyReduction_84 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut27 happy_x_1 of { happy_var_1 ->
- case happyOut35 happy_x_3 of { happy_var_3 ->
- happyIn35
- (happy_var_1 ++ happy_var_3
- )}}
-
-happyReduce_85 = happySpecReduce_2 30# happyReduction_85
-happyReduction_85 happy_x_2
- happy_x_1
- = case happyOut22 happy_x_1 of { happy_var_1 ->
- happyIn36
- (happy_var_1
- )}
-
-happyReduce_86 = happySpecReduce_3 30# happyReduction_86
-happyReduction_86 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut22 happy_x_1 of { happy_var_1 ->
- case happyOut36 happy_x_3 of { happy_var_3 ->
- happyIn36
- (happy_var_1 ++ happy_var_3
- )}}
-
-happyReduce_87 = happySpecReduce_2 31# happyReduction_87
-happyReduction_87 happy_x_2
- happy_x_1
- = case happyOut23 happy_x_1 of { happy_var_1 ->
- happyIn37
- (happy_var_1
- )}
-
-happyReduce_88 = happySpecReduce_3 31# happyReduction_88
-happyReduction_88 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut23 happy_x_1 of { happy_var_1 ->
- case happyOut37 happy_x_3 of { happy_var_3 ->
- happyIn37
- (happy_var_1 ++ happy_var_3
- )}}
-
-happyReduce_89 = happySpecReduce_2 32# happyReduction_89
-happyReduction_89 happy_x_2
- happy_x_1
- = case happyOut25 happy_x_1 of { happy_var_1 ->
- happyIn38
- (happy_var_1
- )}
-
-happyReduce_90 = happySpecReduce_3 32# happyReduction_90
-happyReduction_90 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut25 happy_x_1 of { happy_var_1 ->
- case happyOut38 happy_x_3 of { happy_var_3 ->
- happyIn38
- (happy_var_1 ++ happy_var_3
- )}}
-
-happyReduce_91 = happySpecReduce_2 33# happyReduction_91
-happyReduction_91 happy_x_2
- happy_x_1
- = case happyOut26 happy_x_1 of { happy_var_1 ->
- happyIn39
- (happy_var_1
- )}
-
-happyReduce_92 = happySpecReduce_3 33# happyReduction_92
-happyReduction_92 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut26 happy_x_1 of { happy_var_1 ->
- case happyOut39 happy_x_3 of { happy_var_3 ->
- happyIn39
- (happy_var_1 ++ happy_var_3
- )}}
-
-happyReduce_93 = happySpecReduce_2 34# happyReduction_93
-happyReduction_93 happy_x_2
- happy_x_1
- = case happyOut29 happy_x_1 of { happy_var_1 ->
- happyIn40
- (happy_var_1
- )}
-
-happyReduce_94 = happySpecReduce_3 34# happyReduction_94
-happyReduction_94 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut29 happy_x_1 of { happy_var_1 ->
- case happyOut40 happy_x_3 of { happy_var_3 ->
- happyIn40
- (happy_var_1 ++ happy_var_3
- )}}
-
-happyReduce_95 = happySpecReduce_2 35# happyReduction_95
-happyReduction_95 happy_x_2
- happy_x_1
- = case happyOut30 happy_x_1 of { happy_var_1 ->
- happyIn41
- (happy_var_1
- )}
-
-happyReduce_96 = happySpecReduce_3 35# happyReduction_96
-happyReduction_96 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut30 happy_x_1 of { happy_var_1 ->
- case happyOut41 happy_x_3 of { happy_var_3 ->
- happyIn41
- (addOptions happy_var_1 happy_var_3
- )}}
-
-happyReduce_97 = happySpecReduce_1 36# happyReduction_97
-happyReduction_97 happy_x_1
- = case happyOut32 happy_x_1 of { happy_var_1 ->
- happyIn42
- ([happy_var_1]
- )}
-
-happyReduce_98 = happySpecReduce_3 36# happyReduction_98
-happyReduction_98 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut32 happy_x_1 of { happy_var_1 ->
- case happyOut42 happy_x_3 of { happy_var_3 ->
- happyIn42
- (happy_var_1 : happy_var_3
- )}}
-
-happyReduce_99 = happySpecReduce_1 37# happyReduction_99
-happyReduction_99 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- happyIn43
- ([happy_var_1]
- )}
-
-happyReduce_100 = happySpecReduce_3 37# happyReduction_100
-happyReduction_100 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- case happyOut43 happy_x_3 of { happy_var_3 ->
- happyIn43
- (happy_var_1 : happy_var_3
- )}}
-
-happyReduce_101 = happySpecReduce_1 38# happyReduction_101
-happyReduction_101 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- happyIn44
- (happy_var_1
- )}
-
-happyReduce_102 = happySpecReduce_3 38# happyReduction_102
-happyReduction_102 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- happyIn44
- (mkListId happy_var_2
- )}
-
-happyReduce_103 = happySpecReduce_1 39# happyReduction_103
-happyReduction_103 happy_x_1
- = case happyOut44 happy_x_1 of { happy_var_1 ->
- happyIn45
- ([happy_var_1]
- )}
-
-happyReduce_104 = happySpecReduce_3 39# happyReduction_104
-happyReduction_104 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut44 happy_x_1 of { happy_var_1 ->
- case happyOut45 happy_x_3 of { happy_var_3 ->
- happyIn45
- (happy_var_1 : happy_var_3
- )}}
-
-happyReduce_105 = happySpecReduce_3 40# happyReduction_105
-happyReduction_105 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut43 happy_x_1 of { happy_var_1 ->
- case happyOut48 happy_x_3 of { happy_var_3 ->
- happyIn46
- ([(lab,Just happy_var_3,Nothing) | lab <- happy_var_1]
- )}}
-
-happyReduce_106 = happySpecReduce_3 40# happyReduction_106
-happyReduction_106 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut43 happy_x_1 of { happy_var_1 ->
- case happyOut48 happy_x_3 of { happy_var_3 ->
- happyIn46
- ([(lab,Nothing,Just happy_var_3) | lab <- happy_var_1]
- )}}
-
-happyReduce_107 = happyReduce 5# 40# happyReduction_107
-happyReduction_107 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut43 happy_x_1 of { happy_var_1 ->
- case happyOut48 happy_x_3 of { happy_var_3 ->
- case happyOut48 happy_x_5 of { happy_var_5 ->
- happyIn46
- ([(lab,Just happy_var_3,Just happy_var_5) | lab <- happy_var_1]
- ) `HappyStk` happyRest}}}
-
-happyReduce_108 = happySpecReduce_0 41# happyReduction_108
-happyReduction_108 = happyIn47
- ([]
- )
-
-happyReduce_109 = happySpecReduce_1 41# happyReduction_109
-happyReduction_109 happy_x_1
- = case happyOut46 happy_x_1 of { happy_var_1 ->
- happyIn47
- (happy_var_1
- )}
-
-happyReduce_110 = happySpecReduce_3 41# happyReduction_110
-happyReduction_110 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut46 happy_x_1 of { happy_var_1 ->
- case happyOut47 happy_x_3 of { happy_var_3 ->
- happyIn47
- (happy_var_1 ++ happy_var_3
- )}}
-
-happyReduce_111 = happySpecReduce_3 42# happyReduction_111
-happyReduction_111 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut49 happy_x_1 of { happy_var_1 ->
- case happyOut48 happy_x_3 of { happy_var_3 ->
- happyIn48
- (FV [happy_var_1,happy_var_3]
- )}}
-
-happyReduce_112 = happyReduce 4# 42# happyReduction_112
-happyReduction_112 (happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut68 happy_x_2 of { happy_var_2 ->
- case happyOut48 happy_x_4 of { happy_var_4 ->
- happyIn48
- (mkAbs happy_var_2 happy_var_4
- ) `HappyStk` happyRest}}
-
-happyReduce_113 = happyReduce 4# 42# happyReduction_113
-happyReduction_113 (happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut68 happy_x_2 of { happy_var_2 ->
- case happyOut48 happy_x_4 of { happy_var_4 ->
- happyIn48
- (mkCTable happy_var_2 happy_var_4
- ) `HappyStk` happyRest}}
-
-happyReduce_114 = happySpecReduce_3 42# happyReduction_114
-happyReduction_114 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut69 happy_x_1 of { happy_var_1 ->
- case happyOut48 happy_x_3 of { happy_var_3 ->
- happyIn48
- (mkProdSimple happy_var_1 happy_var_3
- )}}
-
-happyReduce_115 = happySpecReduce_3 42# happyReduction_115
-happyReduction_115 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut51 happy_x_1 of { happy_var_1 ->
- case happyOut48 happy_x_3 of { happy_var_3 ->
- happyIn48
- (Table happy_var_1 happy_var_3
- )}}
-
-happyReduce_116 = happyMonadReduce 6# 42# happyReduction_116
-happyReduction_116 (happy_x_6 `HappyStk`
- happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest) tk
- = happyThen (case happyOut47 happy_x_3 of { happy_var_3 ->
- case happyOut48 happy_x_6 of { happy_var_6 ->
- (
- do defs <- mapM tryLoc happy_var_3
- return $ mkLet defs happy_var_6)}}
- ) (\r -> happyReturn (happyIn48 r))
-
-happyReduce_117 = happyMonadReduce 4# 42# happyReduction_117
-happyReduction_117 (happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest) tk
- = happyThen (case happyOut47 happy_x_2 of { happy_var_2 ->
- case happyOut48 happy_x_4 of { happy_var_4 ->
- (
- do defs <- mapM tryLoc happy_var_2
- return $ mkLet defs happy_var_4)}}
- ) (\r -> happyReturn (happyIn48 r))
-
-happyReduce_118 = happyMonadReduce 5# 42# happyReduction_118
-happyReduction_118 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest) tk
- = happyThen (case happyOut51 happy_x_1 of { happy_var_1 ->
- case happyOut47 happy_x_4 of { happy_var_4 ->
- (
- do defs <- mapM tryLoc happy_var_4
- return $ mkLet defs happy_var_1)}}
- ) (\r -> happyReturn (happyIn48 r))
-
-happyReduce_119 = happySpecReduce_3 42# happyReduction_119
-happyReduction_119 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut53 happy_x_2 of { happy_var_2 ->
- case happyOutTok happy_x_3 of { ((T_String happy_var_3)) ->
- happyIn48
- (Example happy_var_2 happy_var_3
- )}}
-
-happyReduce_120 = happySpecReduce_1 42# happyReduction_120
-happyReduction_120 happy_x_1
- = case happyOut49 happy_x_1 of { happy_var_1 ->
- happyIn48
- (happy_var_1
- )}
-
-happyReduce_121 = happySpecReduce_3 43# happyReduction_121
-happyReduction_121 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut50 happy_x_1 of { happy_var_1 ->
- case happyOut49 happy_x_3 of { happy_var_3 ->
- happyIn49
- (C happy_var_1 happy_var_3
- )}}
-
-happyReduce_122 = happySpecReduce_1 43# happyReduction_122
-happyReduction_122 happy_x_1
- = case happyOut50 happy_x_1 of { happy_var_1 ->
- happyIn49
- (happy_var_1
- )}
-
-happyReduce_123 = happySpecReduce_3 44# happyReduction_123
-happyReduction_123 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut51 happy_x_1 of { happy_var_1 ->
- case happyOut50 happy_x_3 of { happy_var_3 ->
- happyIn50
- (Glue happy_var_1 happy_var_3
- )}}
-
-happyReduce_124 = happySpecReduce_1 44# happyReduction_124
-happyReduction_124 happy_x_1
- = case happyOut51 happy_x_1 of { happy_var_1 ->
- happyIn50
- (happy_var_1
- )}
-
-happyReduce_125 = happySpecReduce_3 45# happyReduction_125
-happyReduction_125 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut51 happy_x_1 of { happy_var_1 ->
- case happyOut52 happy_x_3 of { happy_var_3 ->
- happyIn51
- (S happy_var_1 happy_var_3
- )}}
-
-happyReduce_126 = happyReduce 4# 45# happyReduction_126
-happyReduction_126 (happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut73 happy_x_3 of { happy_var_3 ->
- happyIn51
- (T TRaw happy_var_3
- ) `HappyStk` happyRest}
-
-happyReduce_127 = happyReduce 5# 45# happyReduction_127
-happyReduction_127 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut54 happy_x_2 of { happy_var_2 ->
- case happyOut73 happy_x_4 of { happy_var_4 ->
- happyIn51
- (T (TTyped happy_var_2) happy_var_4
- ) `HappyStk` happyRest}}
-
-happyReduce_128 = happyReduce 5# 45# happyReduction_128
-happyReduction_128 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut54 happy_x_2 of { happy_var_2 ->
- case happyOut55 happy_x_4 of { happy_var_4 ->
- happyIn51
- (V happy_var_2 happy_var_4
- ) `HappyStk` happyRest}}
-
-happyReduce_129 = happySpecReduce_3 45# happyReduction_129
-happyReduction_129 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut51 happy_x_1 of { happy_var_1 ->
- case happyOut52 happy_x_3 of { happy_var_3 ->
- happyIn51
- (case happy_var_1 of
- RecType xs -> RecType (xs ++ [(tupleLabel (length xs+1),happy_var_3)])
- t -> RecType [(tupleLabel 1,happy_var_1), (tupleLabel 2,happy_var_3)]
- )}}
-
-happyReduce_130 = happySpecReduce_3 45# happyReduction_130
-happyReduction_130 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut51 happy_x_1 of { happy_var_1 ->
- case happyOut52 happy_x_3 of { happy_var_3 ->
- happyIn51
- (ExtR happy_var_1 happy_var_3
- )}}
-
-happyReduce_131 = happySpecReduce_1 45# happyReduction_131
-happyReduction_131 happy_x_1
- = case happyOut52 happy_x_1 of { happy_var_1 ->
- happyIn51
- (happy_var_1
- )}
-
-happyReduce_132 = happySpecReduce_2 46# happyReduction_132
-happyReduction_132 happy_x_2
- happy_x_1
- = case happyOut52 happy_x_1 of { happy_var_1 ->
- case happyOut53 happy_x_2 of { happy_var_2 ->
- happyIn52
- (App happy_var_1 happy_var_2
- )}}
-
-happyReduce_133 = happyReduce 6# 46# happyReduction_133
-happyReduction_133 (happy_x_6 `HappyStk`
- happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut48 happy_x_2 of { happy_var_2 ->
- case happyOut73 happy_x_5 of { happy_var_5 ->
- happyIn52
- (let annot = case happy_var_2 of
- Typed _ t -> TTyped t
- _ -> TRaw
- in S (T annot happy_var_5) happy_var_2
- ) `HappyStk` happyRest}}
-
-happyReduce_134 = happyReduce 4# 46# happyReduction_134
-happyReduction_134 (happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut55 happy_x_3 of { happy_var_3 ->
- happyIn52
- (FV happy_var_3
- ) `HappyStk` happyRest}
-
-happyReduce_135 = happyMonadReduce 4# 46# happyReduction_135
-happyReduction_135 (happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest) tk
- = happyThen (case happyOut73 happy_x_3 of { happy_var_3 ->
- ( mkAlts happy_var_3)}
- ) (\r -> happyReturn (happyIn52 r))
-
-happyReduce_136 = happyReduce 6# 46# happyReduction_136
-happyReduction_136 (happy_x_6 `HappyStk`
- happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOutTok happy_x_3 of { ((T_String happy_var_3)) ->
- case happyOut75 happy_x_5 of { happy_var_5 ->
- happyIn52
- (Alts (K happy_var_3, happy_var_5)
- ) `HappyStk` happyRest}}
-
-happyReduce_137 = happyReduce 6# 46# happyReduction_137
-happyReduction_137 (happy_x_6 `HappyStk`
- happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOutTok happy_x_3 of { ((T_Ident happy_var_3)) ->
- case happyOut75 happy_x_5 of { happy_var_5 ->
- happyIn52
- (Alts (Vr happy_var_3, happy_var_5)
- ) `HappyStk` happyRest}}
-
-happyReduce_138 = happyReduce 4# 46# happyReduction_138
-happyReduction_138 (happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut55 happy_x_3 of { happy_var_3 ->
- happyIn52
- (Strs happy_var_3
- ) `HappyStk` happyRest}
-
-happyReduce_139 = happySpecReduce_2 46# happyReduction_139
-happyReduction_139 happy_x_2
- happy_x_1
- = case happyOut59 happy_x_2 of { happy_var_2 ->
- happyIn52
- (EPatt happy_var_2
- )}
-
-happyReduce_140 = happySpecReduce_2 46# happyReduction_140
-happyReduction_140 happy_x_2
- happy_x_1
- = case happyOut53 happy_x_2 of { happy_var_2 ->
- happyIn52
- (EPattType happy_var_2
- )}
-
-happyReduce_141 = happySpecReduce_3 46# happyReduction_141
-happyReduction_141 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- case happyOut53 happy_x_3 of { happy_var_3 ->
- happyIn52
- (ELincat happy_var_2 happy_var_3
- )}}
-
-happyReduce_142 = happySpecReduce_3 46# happyReduction_142
-happyReduction_142 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- case happyOut53 happy_x_3 of { happy_var_3 ->
- happyIn52
- (ELin happy_var_2 happy_var_3
- )}}
-
-happyReduce_143 = happySpecReduce_1 46# happyReduction_143
-happyReduction_143 happy_x_1
- = case happyOut53 happy_x_1 of { happy_var_1 ->
- happyIn52
- (happy_var_1
- )}
-
-happyReduce_144 = happySpecReduce_3 47# happyReduction_144
-happyReduction_144 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut53 happy_x_1 of { happy_var_1 ->
- case happyOut62 happy_x_3 of { happy_var_3 ->
- happyIn53
- (P happy_var_1 happy_var_3
- )}}
-
-happyReduce_145 = happySpecReduce_1 47# happyReduction_145
-happyReduction_145 happy_x_1
- = case happyOut54 happy_x_1 of { happy_var_1 ->
- happyIn53
- (happy_var_1
- )}
-
-happyReduce_146 = happySpecReduce_1 48# happyReduction_146
-happyReduction_146 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- happyIn54
- (Vr happy_var_1
- )}
-
-happyReduce_147 = happySpecReduce_1 48# happyReduction_147
-happyReduction_147 happy_x_1
- = case happyOut63 happy_x_1 of { happy_var_1 ->
- happyIn54
- (Sort happy_var_1
- )}
-
-happyReduce_148 = happySpecReduce_1 48# happyReduction_148
-happyReduction_148 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_String happy_var_1)) ->
- happyIn54
- (K happy_var_1
- )}
-
-happyReduce_149 = happySpecReduce_1 48# happyReduction_149
-happyReduction_149 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Integer happy_var_1)) ->
- happyIn54
- (EInt happy_var_1
- )}
-
-happyReduce_150 = happySpecReduce_1 48# happyReduction_150
-happyReduction_150 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Double happy_var_1)) ->
- happyIn54
- (EFloat happy_var_1
- )}
-
-happyReduce_151 = happySpecReduce_1 48# happyReduction_151
-happyReduction_151 happy_x_1
- = happyIn54
- (Meta (int2meta 0)
- )
-
-happyReduce_152 = happySpecReduce_2 48# happyReduction_152
-happyReduction_152 happy_x_2
- happy_x_1
- = happyIn54
- (Empty
- )
-
-happyReduce_153 = happyReduce 4# 48# happyReduction_153
-happyReduction_153 (happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- case happyOut56 happy_x_3 of { happy_var_3 ->
- happyIn54
- (foldl App (Vr (mkListId happy_var_2)) happy_var_3
- ) `HappyStk` happyRest}}
-
-happyReduce_154 = happySpecReduce_3 48# happyReduction_154
-happyReduction_154 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOutTok happy_x_2 of { ((T_String happy_var_2)) ->
- happyIn54
- (case happy_var_2 of
- [] -> Empty
- str -> foldr1 C (map K (words str))
- )}
-
-happyReduce_155 = happyMonadReduce 3# 48# happyReduction_155
-happyReduction_155 (happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest) tk
- = happyThen (case happyOut47 happy_x_2 of { happy_var_2 ->
- ( mkR happy_var_2)}
- ) (\r -> happyReturn (happyIn54 r))
-
-happyReduce_156 = happySpecReduce_3 48# happyReduction_156
-happyReduction_156 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut70 happy_x_2 of { happy_var_2 ->
- happyIn54
- (R (tuple2record happy_var_2)
- )}
-
-happyReduce_157 = happyReduce 5# 48# happyReduction_157
-happyReduction_157 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut48 happy_x_2 of { happy_var_2 ->
- case happyOut48 happy_x_4 of { happy_var_4 ->
- happyIn54
- (Typed happy_var_2 happy_var_4
- ) `HappyStk` happyRest}}
-
-happyReduce_158 = happySpecReduce_1 48# happyReduction_158
-happyReduction_158 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_LString happy_var_1)) ->
- happyIn54
- (K happy_var_1
- )}
-
-happyReduce_159 = happySpecReduce_3 48# happyReduction_159
-happyReduction_159 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut48 happy_x_2 of { happy_var_2 ->
- happyIn54
- (happy_var_2
- )}
-
-happyReduce_160 = happySpecReduce_0 49# happyReduction_160
-happyReduction_160 = happyIn55
- ([]
- )
-
-happyReduce_161 = happySpecReduce_1 49# happyReduction_161
-happyReduction_161 happy_x_1
- = case happyOut48 happy_x_1 of { happy_var_1 ->
- happyIn55
- ([happy_var_1]
- )}
-
-happyReduce_162 = happySpecReduce_3 49# happyReduction_162
-happyReduction_162 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut48 happy_x_1 of { happy_var_1 ->
- case happyOut55 happy_x_3 of { happy_var_3 ->
- happyIn55
- (happy_var_1 : happy_var_3
- )}}
-
-happyReduce_163 = happySpecReduce_0 50# happyReduction_163
-happyReduction_163 = happyIn56
- ([]
- )
-
-happyReduce_164 = happySpecReduce_2 50# happyReduction_164
-happyReduction_164 happy_x_2
- happy_x_1
- = case happyOut54 happy_x_1 of { happy_var_1 ->
- case happyOut56 happy_x_2 of { happy_var_2 ->
- happyIn56
- (happy_var_1 : happy_var_2
- )}}
-
-happyReduce_165 = happySpecReduce_3 51# happyReduction_165
-happyReduction_165 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut57 happy_x_1 of { happy_var_1 ->
- case happyOut58 happy_x_3 of { happy_var_3 ->
- happyIn57
- (PAlt happy_var_1 happy_var_3
- )}}
-
-happyReduce_166 = happySpecReduce_3 51# happyReduction_166
-happyReduction_166 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut57 happy_x_1 of { happy_var_1 ->
- case happyOut58 happy_x_3 of { happy_var_3 ->
- happyIn57
- (PSeq happy_var_1 happy_var_3
- )}}
-
-happyReduce_167 = happySpecReduce_1 51# happyReduction_167
-happyReduction_167 happy_x_1
- = case happyOut58 happy_x_1 of { happy_var_1 ->
- happyIn57
- (happy_var_1
- )}
-
-happyReduce_168 = happySpecReduce_2 52# happyReduction_168
-happyReduction_168 happy_x_2
- happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- case happyOut65 happy_x_2 of { happy_var_2 ->
- happyIn58
- (PC happy_var_1 happy_var_2
- )}}
-
-happyReduce_169 = happyReduce 4# 52# happyReduction_169
-happyReduction_169 (happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- case happyOutTok happy_x_3 of { ((T_Ident happy_var_3)) ->
- case happyOut65 happy_x_4 of { happy_var_4 ->
- happyIn58
- (PP happy_var_1 happy_var_3 happy_var_4
- ) `HappyStk` happyRest}}}
-
-happyReduce_170 = happySpecReduce_2 52# happyReduction_170
-happyReduction_170 happy_x_2
- happy_x_1
- = case happyOut59 happy_x_1 of { happy_var_1 ->
- happyIn58
- (PRep happy_var_1
- )}
-
-happyReduce_171 = happySpecReduce_3 52# happyReduction_171
-happyReduction_171 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- case happyOut59 happy_x_3 of { happy_var_3 ->
- happyIn58
- (PAs happy_var_1 happy_var_3
- )}}
-
-happyReduce_172 = happySpecReduce_2 52# happyReduction_172
-happyReduction_172 happy_x_2
- happy_x_1
- = case happyOut59 happy_x_2 of { happy_var_2 ->
- happyIn58
- (PNeg happy_var_2
- )}
-
-happyReduce_173 = happySpecReduce_1 52# happyReduction_173
-happyReduction_173 happy_x_1
- = case happyOut59 happy_x_1 of { happy_var_1 ->
- happyIn58
- (happy_var_1
- )}
-
-happyReduce_174 = happySpecReduce_1 53# happyReduction_174
-happyReduction_174 happy_x_1
- = happyIn59
- (PChar
- )
-
-happyReduce_175 = happySpecReduce_3 53# happyReduction_175
-happyReduction_175 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOutTok happy_x_2 of { ((T_String happy_var_2)) ->
- happyIn59
- (PChars happy_var_2
- )}
-
-happyReduce_176 = happySpecReduce_2 53# happyReduction_176
-happyReduction_176 happy_x_2
- happy_x_1
- = case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- happyIn59
- (PMacro happy_var_2
- )}
-
-happyReduce_177 = happyReduce 4# 53# happyReduction_177
-happyReduction_177 (happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- case happyOutTok happy_x_4 of { ((T_Ident happy_var_4)) ->
- happyIn59
- (PM happy_var_2 happy_var_4
- ) `HappyStk` happyRest}}
-
-happyReduce_178 = happySpecReduce_1 53# happyReduction_178
-happyReduction_178 happy_x_1
- = happyIn59
- (PW
- )
-
-happyReduce_179 = happySpecReduce_1 53# happyReduction_179
-happyReduction_179 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- happyIn59
- (PV happy_var_1
- )}
-
-happyReduce_180 = happySpecReduce_3 53# happyReduction_180
-happyReduction_180 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOutTok happy_x_2 of { ((T_Ident happy_var_2)) ->
- happyIn59
- (PC happy_var_2 []
- )}
-
-happyReduce_181 = happySpecReduce_3 53# happyReduction_181
-happyReduction_181 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- case happyOutTok happy_x_3 of { ((T_Ident happy_var_3)) ->
- happyIn59
- (PP happy_var_1 happy_var_3 []
- )}}
-
-happyReduce_182 = happySpecReduce_1 53# happyReduction_182
-happyReduction_182 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Integer happy_var_1)) ->
- happyIn59
- (PInt happy_var_1
- )}
-
-happyReduce_183 = happySpecReduce_1 53# happyReduction_183
-happyReduction_183 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Double happy_var_1)) ->
- happyIn59
- (PFloat happy_var_1
- )}
-
-happyReduce_184 = happySpecReduce_1 53# happyReduction_184
-happyReduction_184 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_String happy_var_1)) ->
- happyIn59
- (PString happy_var_1
- )}
-
-happyReduce_185 = happySpecReduce_3 53# happyReduction_185
-happyReduction_185 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut64 happy_x_2 of { happy_var_2 ->
- happyIn59
- (PR happy_var_2
- )}
-
-happyReduce_186 = happySpecReduce_3 53# happyReduction_186
-happyReduction_186 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut71 happy_x_2 of { happy_var_2 ->
- happyIn59
- ((PR . tuple2recordPatt) happy_var_2
- )}
-
-happyReduce_187 = happySpecReduce_3 53# happyReduction_187
-happyReduction_187 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut57 happy_x_2 of { happy_var_2 ->
- happyIn59
- (happy_var_2
- )}
-
-happyReduce_188 = happySpecReduce_1 54# happyReduction_188
-happyReduction_188 happy_x_1
- = happyIn60
- (identW
- )
-
-happyReduce_189 = happySpecReduce_1 54# happyReduction_189
-happyReduction_189 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- happyIn60
- (happy_var_1
- )}
-
-happyReduce_190 = happySpecReduce_3 55# happyReduction_190
-happyReduction_190 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut43 happy_x_1 of { happy_var_1 ->
- case happyOut57 happy_x_3 of { happy_var_3 ->
- happyIn61
- ([(LIdent (ident2bs i),happy_var_3) | i <- happy_var_1]
- )}}
-
-happyReduce_191 = happySpecReduce_1 56# happyReduction_191
-happyReduction_191 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- happyIn62
- (LIdent (ident2bs happy_var_1)
- )}
-
-happyReduce_192 = happySpecReduce_2 56# happyReduction_192
-happyReduction_192 happy_x_2
- happy_x_1
- = case happyOutTok happy_x_2 of { ((T_Integer happy_var_2)) ->
- happyIn62
- (LVar (fromIntegral happy_var_2)
- )}
-
-happyReduce_193 = happySpecReduce_1 57# happyReduction_193
-happyReduction_193 happy_x_1
- = happyIn63
- (cType
- )
-
-happyReduce_194 = happySpecReduce_1 57# happyReduction_194
-happyReduction_194 happy_x_1
- = happyIn63
- (cPType
- )
-
-happyReduce_195 = happySpecReduce_1 57# happyReduction_195
-happyReduction_195 happy_x_1
- = happyIn63
- (cTok
- )
-
-happyReduce_196 = happySpecReduce_1 57# happyReduction_196
-happyReduction_196 happy_x_1
- = happyIn63
- (cStr
- )
-
-happyReduce_197 = happySpecReduce_1 57# happyReduction_197
-happyReduction_197 happy_x_1
- = happyIn63
- (cStrs
- )
-
-happyReduce_198 = happySpecReduce_0 58# happyReduction_198
-happyReduction_198 = happyIn64
- ([]
- )
-
-happyReduce_199 = happySpecReduce_1 58# happyReduction_199
-happyReduction_199 happy_x_1
- = case happyOut61 happy_x_1 of { happy_var_1 ->
- happyIn64
- (happy_var_1
- )}
-
-happyReduce_200 = happySpecReduce_3 58# happyReduction_200
-happyReduction_200 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut61 happy_x_1 of { happy_var_1 ->
- case happyOut64 happy_x_3 of { happy_var_3 ->
- happyIn64
- (happy_var_1 ++ happy_var_3
- )}}
-
-happyReduce_201 = happySpecReduce_1 59# happyReduction_201
-happyReduction_201 happy_x_1
- = case happyOut59 happy_x_1 of { happy_var_1 ->
- happyIn65
- ([happy_var_1]
- )}
-
-happyReduce_202 = happySpecReduce_2 59# happyReduction_202
-happyReduction_202 happy_x_2
- happy_x_1
- = case happyOut59 happy_x_1 of { happy_var_1 ->
- case happyOut65 happy_x_2 of { happy_var_2 ->
- happyIn65
- (happy_var_1 : happy_var_2
- )}}
-
-happyReduce_203 = happySpecReduce_1 60# happyReduction_203
-happyReduction_203 happy_x_1
- = case happyOut60 happy_x_1 of { happy_var_1 ->
- happyIn66
- ([happy_var_1]
- )}
-
-happyReduce_204 = happySpecReduce_2 60# happyReduction_204
-happyReduction_204 happy_x_2
- happy_x_1
- = case happyOut60 happy_x_1 of { happy_var_1 ->
- case happyOut66 happy_x_2 of { happy_var_2 ->
- happyIn66
- (happy_var_1 : happy_var_2
- )}}
-
-happyReduce_205 = happySpecReduce_1 61# happyReduction_205
-happyReduction_205 happy_x_1
- = case happyOutTok happy_x_1 of { ((T_Ident happy_var_1)) ->
- happyIn67
- (happy_var_1
- )}
-
-happyReduce_206 = happySpecReduce_1 61# happyReduction_206
-happyReduction_206 happy_x_1
- = happyIn67
- (identW
- )
-
-happyReduce_207 = happySpecReduce_1 62# happyReduction_207
-happyReduction_207 happy_x_1
- = case happyOut67 happy_x_1 of { happy_var_1 ->
- happyIn68
- ([happy_var_1]
- )}
-
-happyReduce_208 = happySpecReduce_3 62# happyReduction_208
-happyReduction_208 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut67 happy_x_1 of { happy_var_1 ->
- case happyOut68 happy_x_3 of { happy_var_3 ->
- happyIn68
- (happy_var_1 : happy_var_3
- )}}
-
-happyReduce_209 = happyReduce 5# 63# happyReduction_209
-happyReduction_209 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut68 happy_x_2 of { happy_var_2 ->
- case happyOut48 happy_x_4 of { happy_var_4 ->
- happyIn69
- ([(x,happy_var_4) | x <- happy_var_2]
- ) `HappyStk` happyRest}}
-
-happyReduce_210 = happySpecReduce_1 63# happyReduction_210
-happyReduction_210 happy_x_1
- = case happyOut52 happy_x_1 of { happy_var_1 ->
- happyIn69
- ([mkDecl happy_var_1]
- )}
-
-happyReduce_211 = happySpecReduce_0 64# happyReduction_211
-happyReduction_211 = happyIn70
- ([]
- )
-
-happyReduce_212 = happySpecReduce_1 64# happyReduction_212
-happyReduction_212 happy_x_1
- = case happyOut48 happy_x_1 of { happy_var_1 ->
- happyIn70
- ([happy_var_1]
- )}
-
-happyReduce_213 = happySpecReduce_3 64# happyReduction_213
-happyReduction_213 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut48 happy_x_1 of { happy_var_1 ->
- case happyOut70 happy_x_3 of { happy_var_3 ->
- happyIn70
- (happy_var_1 : happy_var_3
- )}}
-
-happyReduce_214 = happySpecReduce_0 65# happyReduction_214
-happyReduction_214 = happyIn71
- ([]
- )
-
-happyReduce_215 = happySpecReduce_1 65# happyReduction_215
-happyReduction_215 happy_x_1
- = case happyOut57 happy_x_1 of { happy_var_1 ->
- happyIn71
- ([happy_var_1]
- )}
-
-happyReduce_216 = happySpecReduce_3 65# happyReduction_216
-happyReduction_216 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut57 happy_x_1 of { happy_var_1 ->
- case happyOut71 happy_x_3 of { happy_var_3 ->
- happyIn71
- (happy_var_1 : happy_var_3
- )}}
-
-happyReduce_217 = happySpecReduce_3 66# happyReduction_217
-happyReduction_217 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut57 happy_x_1 of { happy_var_1 ->
- case happyOut48 happy_x_3 of { happy_var_3 ->
- happyIn72
- ((happy_var_1,happy_var_3)
- )}}
-
-happyReduce_218 = happySpecReduce_1 67# happyReduction_218
-happyReduction_218 happy_x_1
- = case happyOut72 happy_x_1 of { happy_var_1 ->
- happyIn73
- ([happy_var_1]
- )}
-
-happyReduce_219 = happySpecReduce_3 67# happyReduction_219
-happyReduction_219 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut72 happy_x_1 of { happy_var_1 ->
- case happyOut73 happy_x_3 of { happy_var_3 ->
- happyIn73
- (happy_var_1 : happy_var_3
- )}}
-
-happyReduce_220 = happySpecReduce_3 68# happyReduction_220
-happyReduction_220 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut48 happy_x_1 of { happy_var_1 ->
- case happyOut48 happy_x_3 of { happy_var_3 ->
- happyIn74
- ((happy_var_1,happy_var_3)
- )}}
-
-happyReduce_221 = happySpecReduce_1 69# happyReduction_221
-happyReduction_221 happy_x_1
- = case happyOut74 happy_x_1 of { happy_var_1 ->
- happyIn75
- ([happy_var_1]
- )}
-
-happyReduce_222 = happySpecReduce_3 69# happyReduction_222
-happyReduction_222 happy_x_3
- happy_x_2
- happy_x_1
- = case happyOut74 happy_x_1 of { happy_var_1 ->
- case happyOut75 happy_x_3 of { happy_var_3 ->
- happyIn75
- (happy_var_1 : happy_var_3
- )}}
-
-happyReduce_223 = happyReduce 5# 70# happyReduction_223
-happyReduction_223 (happy_x_5 `HappyStk`
- happy_x_4 `HappyStk`
- happy_x_3 `HappyStk`
- happy_x_2 `HappyStk`
- happy_x_1 `HappyStk`
- happyRest)
- = case happyOut68 happy_x_2 of { happy_var_2 ->
- case happyOut48 happy_x_4 of { happy_var_4 ->
- happyIn76
- ([(x,happy_var_4) | x <- happy_var_2]
- ) `HappyStk` happyRest}}
-
-happyReduce_224 = happySpecReduce_1 70# happyReduction_224
-happyReduction_224 happy_x_1
- = case happyOut54 happy_x_1 of { happy_var_1 ->
- happyIn76
- ([mkDecl happy_var_1]
- )}
-
-happyReduce_225 = happySpecReduce_0 71# happyReduction_225
-happyReduction_225 = happyIn77
- ([]
- )
-
-happyReduce_226 = happySpecReduce_2 71# happyReduction_226
-happyReduction_226 happy_x_2
- happy_x_1
- = case happyOut76 happy_x_1 of { happy_var_1 ->
- case happyOut77 happy_x_2 of { happy_var_2 ->
- happyIn77
- (happy_var_1 ++ happy_var_2
- )}}
-
-happyReduce_227 = happyMonadReduce 0# 72# happyReduction_227
-happyReduction_227 (happyRest) tk
- = happyThen (( getPosn)
- ) (\r -> happyReturn (happyIn78 r))
-
-happyNewToken action sts stk
- = lexer(\tk ->
- let cont i = happyDoAction i tk action sts stk in
- case tk of {
- T_EOF -> happyDoAction 71# tk action sts stk;
- T_exclmark -> cont 1#;
- T_patt -> cont 2#;
- T_int_label -> cont 3#;
- T_oparen -> cont 4#;
- T_cparen -> cont 5#;
- T_star -> cont 6#;
- T_starstar -> cont 7#;
- T_plus -> cont 8#;
- T_plusplus -> cont 9#;
- T_comma -> cont 10#;
- T_minus -> cont 11#;
- T_rarrow -> cont 12#;
- T_dot -> cont 13#;
- T_alt -> cont 14#;
- T_colon -> cont 15#;
- T_semicolon -> cont 16#;
- T_less -> cont 17#;
- T_equal -> cont 18#;
- T_big_rarrow -> cont 19#;
- T_great -> cont 20#;
- T_questmark -> cont 21#;
- T_at -> cont 22#;
- T_obrack -> cont 23#;
- T_cbrack -> cont 24#;
- T_ocurly -> cont 25#;
- T_ccurly -> cont 26#;
- T_lam -> cont 27#;
- T_lamlam -> cont 28#;
- T_underscore -> cont 29#;
- T_bar -> cont 30#;
- T_PType -> cont 31#;
- T_Str -> cont 32#;
- T_Strs -> cont 33#;
- T_Tok -> cont 34#;
- T_Type -> cont 35#;
- T_abstract -> cont 36#;
- T_case -> cont 37#;
- T_cat -> cont 38#;
- T_concrete -> cont 39#;
- T_data -> cont 40#;
- T_def -> cont 41#;
- T_flags -> cont 42#;
- T_fun -> cont 43#;
- T_in -> cont 44#;
- T_incomplete -> cont 45#;
- T_instance -> cont 46#;
- T_interface -> cont 47#;
- T_let -> cont 48#;
- T_lin -> cont 49#;
- T_lincat -> cont 50#;
- T_lindef -> cont 51#;
- T_of -> cont 52#;
- T_open -> cont 53#;
- T_oper -> cont 54#;
- T_param -> cont 55#;
- T_pattern -> cont 56#;
- T_pre -> cont 57#;
- T_printname -> cont 58#;
- T_resource -> cont 59#;
- T_strs -> cont 60#;
- T_table -> cont 61#;
- T_transfer -> cont 62#;
- T_variants -> cont 63#;
- T_where -> cont 64#;
- T_with -> cont 65#;
- (T_Integer happy_dollar_dollar) -> cont 66#;
- (T_Double happy_dollar_dollar) -> cont 67#;
- (T_String happy_dollar_dollar) -> cont 68#;
- (T_LString happy_dollar_dollar) -> cont 69#;
- (T_Ident happy_dollar_dollar) -> cont 70#;
- _ -> happyError' tk
- })
-
-happyError_ tk = happyError' tk
-
-happyThen :: () => P a -> (a -> P b) -> P b
-happyThen = (>>=)
-happyReturn :: () => a -> P a
-happyReturn = (return)
-happyThen1 = happyThen
-happyReturn1 :: () => a -> P a
-happyReturn1 = happyReturn
-happyError' :: () => Token -> P a
-happyError' tk = (\token -> happyError) tk
-
-pModDef = happySomeParser where
- happySomeParser = happyThen (happyParse 0#) (\x -> happyReturn (happyOut6 x))
-
-pModHeader = happySomeParser where
- happySomeParser = happyThen (happyParse 1#) (\x -> happyReturn (happyOut7 x))
-
-pExp = happySomeParser where
- happySomeParser = happyThen (happyParse 2#) (\x -> happyReturn (happyOut48 x))
-
-happySeq = happyDontSeq
-
-
-happyError :: P a
-happyError = fail "parse error"
-
-mkListId,mkConsId,mkBaseId :: Ident -> Ident
-mkListId = prefixId (BS.pack "List")
-mkConsId = prefixId (BS.pack "Cons")
-mkBaseId = prefixId (BS.pack "Base")
-
-prefixId :: BS.ByteString -> Ident -> Ident
-prefixId pref id = identC (BS.append pref (ident2bs id))
-
-listCatDef id pos cont size = [catd,nilfund,consfund]
- where
- listId = mkListId id
- baseId = mkBaseId id
- consId = mkConsId id
-
- catd = (listId, pos, AbsCat (Just cont') (Just [Cn baseId,Cn consId]))
- nilfund = (baseId, pos, AbsFun (Just niltyp) Nothing Nothing)
- consfund = (consId, pos, AbsFun (Just constyp) Nothing Nothing)
-
- cont' = [(mkId x i,ty) | (i,(x,ty)) <- zip [0..] cont]
- xs = map (Vr . fst) cont'
- cd = mkDecl (mkApp (Vr id) xs)
- lc = mkApp (Vr listId) xs
-
- niltyp = mkProdSimple (cont' ++ replicate size cd) lc
- constyp = mkProdSimple (cont' ++ [cd, mkDecl lc]) lc
-
- mkId x i = if isWildIdent x then (varX i) else x
-
-tryLoc (c,mty,Just e) = return (c,(mty,e))
-tryLoc (c,_ ,_ ) = fail ("local definition of" +++ prIdent c +++ "without value")
-
-mkR [] = return $ RecType [] --- empty record always interpreted as record type
-mkR fs@(f:_) =
- case f of
- (lab,Just ty,Nothing) -> mapM tryRT fs >>= return . RecType
- _ -> mapM tryR fs >>= return . R
- where
- tryRT (lab,Just ty,Nothing) = return (ident2label lab,ty)
- tryRT (lab,_ ,_ ) = fail $ "illegal record type field" +++ prIdent lab --- manifest fields ?!
-
- tryR (lab,mty,Just t) = return (ident2label lab,(mty,t))
- tryR (lab,_ ,_ ) = fail $ "illegal record field" +++ prIdent lab
-
-mkOverload pdt pdf@(Just df) =
- case appForm df of
- (keyw, ts@(_:_)) | isOverloading keyw ->
- case last ts of
- R fs -> [ResOverload [m | Vr m <- ts] [(ty,fu) | (_,(Just ty,fu)) <- fs]]
- _ -> [ResOper pdt pdf]
- _ -> [ResOper pdt pdf]
-
- -- to enable separare type signature --- not type-checked
-mkOverload pdt@(Just df) pdf =
- case appForm df of
- (keyw, ts@(_:_)) | isOverloading keyw ->
- case last ts of
- RecType _ -> []
- _ -> [ResOper pdt pdf]
- _ -> [ResOper pdt pdf]
-mkOverload pdt pdf = [ResOper pdt pdf]
-
-isOverloading t =
- case t of
- Vr keyw | prIdent keyw == "overload" -> True -- overload is a "soft keyword"
- _ -> False
-
-
-type SrcSpan = (Posn,Posn)
-
-
-checkInfoType MTAbstract (id,pos,info) =
- case info of
- AbsCat _ _ -> return ()
- AbsFun _ _ _ -> return ()
- _ -> failLoc (fst pos) "illegal definition in abstract module"
-checkInfoType MTResource (id,pos,info) =
- case info of
- ResParam _ -> return ()
- ResValue _ -> return ()
- ResOper _ _ -> return ()
- ResOverload _ _ -> return ()
- _ -> failLoc (fst pos) "illegal definition in resource module"
-checkInfoType MTInterface (id,pos,info) =
- case info of
- ResParam _ -> return ()
- ResValue _ -> return ()
- ResOper _ _ -> return ()
- ResOverload _ _ -> return ()
- _ -> failLoc (fst pos) "illegal definition in interface module"
-checkInfoType (MTConcrete _) (id,pos,info) =
- case info of
- CncCat _ _ _ -> return ()
- CncFun _ _ _ -> return ()
- ResParam _ -> return ()
- ResValue _ -> return ()
- ResOper _ _ -> return ()
- ResOverload _ _ -> return ()
- _ -> failLoc (fst pos) "illegal definition in concrete module"
-checkInfoType (MTInstance _) (id,pos,info) =
- case info of
- ResParam _ -> return ()
- ResValue _ -> return ()
- ResOper _ _ -> return ()
- _ -> failLoc (fst pos) "illegal definition in instance module"
-checkInfoType (MTTransfer _ _) (id,pos,info) =
- case info of
- AbsCat _ _ -> return ()
- AbsFun _ _ _ -> return ()
- _ -> failLoc (fst pos) "illegal definition in transfer module"
-
-
-mkAlts cs = case cs of
- _:_ -> do
- def <- mkDef (last cs)
- alts <- mapM mkAlt (init cs)
- return (Alts (def,alts))
- _ -> fail "empty alts"
- where
- mkDef (_,t) = return t
- mkAlt (p,t) = do
- ss <- mkStrs p
- return (t,ss)
- mkStrs p = case p of
- PAlt a b -> do
- Strs as <- mkStrs a
- Strs bs <- mkStrs b
- return $ Strs $ as ++ bs
- PString s -> return $ Strs [K s]
- PV x -> return (Vr x) --- for macros; not yet complete
- PMacro x -> return (Vr x) --- for macros; not yet complete
- PM m c -> return (Q m c) --- for macros; not yet complete
- _ -> fail "no strs from pattern"
-{-# LINE 1 "GenericTemplate.hs" #-}
-{-# LINE 1 "<built-in>" #-}
-{-# LINE 1 "<command line>" #-}
-{-# LINE 1 "GenericTemplate.hs" #-}
--- Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp
-
-{-# LINE 28 "GenericTemplate.hs" #-}
-
-
-data Happy_IntList = HappyCons Int# Happy_IntList
-
-
-
-
-
-{-# LINE 49 "GenericTemplate.hs" #-}
-
-{-# LINE 59 "GenericTemplate.hs" #-}
-
-{-# LINE 68 "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 i tk st
- -1# -> {- nothing -}
- happyAccept i tk st
- n | (n <# (0# :: Int#)) -> {- nothing -}
-
- (happyReduceArr ! rule) i tk st
- where rule = (I# ((negateInt# ((n +# (1# :: Int#))))))
- n -> {- nothing -}
-
-
- happyShift new_state i tk st
- where new_state = (n -# (1# :: Int#))
- where off = indexShortOffAddr happyActOffsets st
- off_i = (off +# i)
- check = if (off_i >=# (0# :: Int#))
- then (indexShortOffAddr happyCheck off_i ==# i)
- else False
- action | check = indexShortOffAddr happyTable off_i
- | otherwise = indexShortOffAddr happyDefActions st
-
-{-# LINE 127 "GenericTemplate.hs" #-}
-
-
-indexShortOffAddr (HappyA# arr) off =
-#if __GLASGOW_HASKELL__ > 500
- narrow16Int# i
-#elif __GLASGOW_HASKELL__ == 500
- intToInt16# i
-#else
- (i `iShiftL#` 16#) `iShiftRA#` 16#
-#endif
- where
-#if __GLASGOW_HASKELL__ >= 503
- i = word2Int# ((high `uncheckedShiftL#` 8#) `or#` low)
-#else
- i = word2Int# ((high `shiftL#` 8#) `or#` low)
-#endif
- high = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#)))
- low = int2Word# (ord# (indexCharOffAddr# arr off'))
- off' = off *# 2#
-
-
-
-
-
-data HappyAddr = HappyA# Addr#
-
-
-
-
------------------------------------------------------------------------------
--- HappyState data type (not arrays)
-
-{-# LINE 170 "GenericTemplate.hs" #-}
-
------------------------------------------------------------------------------
--- Shifting a token
-
-happyShift new_state 0# tk st sts stk@(x `HappyStk` _) =
- let i = (case unsafeCoerce# x of { (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 -# (1# :: 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 =
- happyThen1 (fn stk tk) (\r -> happyGoto nt j tk st1 sts1 (r `HappyStk` drop_stk))
- where sts1@((HappyCons (st1@(action)) (_))) = happyDrop k (HappyCons (st) (sts))
- drop_stk = happyDropStk k stk
-
-happyMonad2Reduce k nt fn 0# tk st sts stk
- = happyFail 0# tk st sts stk
-happyMonad2Reduce k nt fn j tk st sts stk =
- happyThen1 (fn stk tk) (\r -> happyNewToken new_state sts1 (r `HappyStk` drop_stk))
- where sts1@((HappyCons (st1@(action)) (_))) = happyDrop k (HappyCons (st) (sts))
- drop_stk = happyDropStk k stk
-
- off = indexShortOffAddr happyGotoOffsets st1
- off_i = (off +# nt)
- new_state = indexShortOffAddr happyTable off_i
-
-
-
-
-happyDrop 0# l = l
-happyDrop n (HappyCons (_) (t)) = happyDrop (n -# (1# :: Int#)) t
-
-happyDropStk 0# l = l
-happyDropStk n (x `HappyStk` xs) = happyDropStk (n -# (1#::Int#)) xs
-
------------------------------------------------------------------------------
--- Moving to a new state after a reduction
-
-
-happyGoto nt j tk st =
- {- nothing -}
- happyDoAction j tk new_state
- where off = indexShortOffAddr happyGotoOffsets st
- off_i = (off +# 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 0# tk old_st _ stk =
--- trace "failing" $
- happyError_ 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 i tk (action) sts stk =
--- trace "entering error recovery" $
- happyDoAction 0# tk action sts ( (unsafeCoerce# (I# (i))) `HappyStk` stk)
-
--- Internal happy errors:
-
-notHappyAtAll = error "Internal Happy error\n"
-
------------------------------------------------------------------------------
--- Hack to get the typechecker to accept our action functions
-
-
-happyTcHack :: 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.
diff --git a/src/GF/Grammar/PrGrammar.hs b/src/GF/Grammar/PrGrammar.hs
deleted file mode 100644
index 8a203bedc..000000000
--- a/src/GF/Grammar/PrGrammar.hs
+++ /dev/null
@@ -1,255 +0,0 @@
-----------------------------------------------------------------------
--- |
--- Module : PrGrammar
--- Maintainer : AR
--- Stability : (stable)
--- Portability : (portable)
---
--- > CVS $Date: 2005/09/04 11:45:38 $
--- > CVS $Author: aarne $
--- > CVS $Revision: 1.16 $
---
--- AR 7\/12\/1999 - 1\/4\/2000 - 10\/5\/2003
---
--- printing and prettyprinting class
---
--- 8\/1\/2004:
--- Usually followed principle: 'prt_' for displaying in the editor, 'prt'
--- in writing grammars to a file. For some constructs, e.g. 'prMarkedTree',
--- only the former is ever needed.
------------------------------------------------------------------------------
-
-module GF.Grammar.PrGrammar (Print(..),
- prtBad,
- prGrammar,
- prConstrs,
- prTermTabular
- ) where
-
-import GF.Data.Operations
---import GF.Data.Zipper
-import GF.Grammar.Grammar
-import GF.Infra.Modules
-import qualified GF.Source.PrintGF as P
-import GF.Grammar.Values
-import GF.Source.GrammarToSource
---- import GFC (CanonGrammar) --- cycle of modules
-
-import GF.Infra.Option
-import GF.Infra.Ident
-
-import GF.Infra.CompactPrint
-
-import Data.List (intersperse)
-
-class Print a where
- prt :: a -> String
- -- | printing with parentheses, if needed
- prt2 :: a -> String
- -- | pretty printing
- prpr :: a -> [String]
- -- | printing without ident qualifications
- prt_ :: a -> String
- prt2 = prt
- prt_ = prt
- prpr = return . prt
-
--- 8/1/2004
---- Usually followed principle: prt_ for displaying in the editor, prt
---- in writing grammars to a file. For some constructs, e.g. prMarkedTree,
---- only the former is ever needed.
-
--- | to show terms etc in error messages
-prtBad :: Print a => String -> a -> Err b
-prtBad s a = Bad (s +++ prt a)
-
-pprintTree :: P.Print a => a -> String
-pprintTree = compactPrint . P.printTree
-
-prGrammar :: SourceGrammar -> String
-prGrammar = pprintTree . trGrammar
-
-prModule :: SourceModule -> String
-prModule = pprintTree . trModule
-
-instance Print Term where
- prt = pprintTree . trt
- prt_ = prExp
-
-instance Print Ident where
- prt = pprintTree . tri
-
-instance Print Patt where
- prt = pprintTree . trp
- prt_ = prt . unqual where
- unqual p = case p of
- PP _ c [] -> PV c --- to remove curlies
- PP _ c ps -> PC c (map unqual ps)
- PC c ps -> PC c (map unqual ps)
- _ -> p ---- records
-
-instance Print Label where
- prt = pprintTree . trLabel
-
-instance Print MetaSymb where
- prt (MetaSymb i) = "?" ++ show i
-
-prParam :: Param -> String
-prParam (c,co) = prt c +++ prContext co
-
-prContext :: Context -> String
-prContext co = unwords $ map prParenth [prt x +++ ":" +++ prt t | (x,t) <- co]
-
--- some GFC notions
-{-
-instance Print a => Print (Tr a) where
- prt (Tr (n, trees)) = prt n +++ unwords (map prt2 trees)
- prt2 t@(Tr (_,args)) = if null args then prt t else prParenth (prt t)
-
--- | we cannot define the method prt_ in this way
-prt_Tree :: Tree -> String
-prt_Tree = prt_ . tree2exp
-
-instance Print TrNode where
- prt (N (bi,at,vt,(cs,ms),_)) =
- prBinds bi ++
- prt at +++ ":" +++ prt vt
- +++ prConstraints cs +++ prMetaSubst ms
- prt_ (N (bi,at,vt,(cs,ms),_)) =
- prBinds bi ++
- prt_ at +++ ":" +++ prt_ vt
- +++ prConstraints cs +++ prMetaSubst ms
-
-prMarkedTree :: Tr (TrNode,Bool) -> [String]
-prMarkedTree = prf 1 where
- prf ind t@(Tr (node, trees)) =
- prNode ind node : concatMap (prf (ind + 2)) trees
- prNode ind node = case node of
- (n, False) -> indent ind (prt_ n)
- (n, _) -> '*' : indent (ind - 1) (prt_ n)
-
-prTree :: Tree -> [String]
-prTree = prMarkedTree . mapTr (\n -> (n,False))
-
--- | a pretty-printer for parsable output
-tree2string :: Tree -> String
-tree2string = unlines . prprTree
-
-prprTree :: Tree -> [String]
-prprTree = prf False where
- prf par t@(Tr (node, trees)) =
- parIf par (prn node : concat [prf (ifPar t) t | t <- trees])
- prn (N (bi,at,_,_,_)) = prb bi ++ prt_ at
- prb [] = ""
- prb bi = "\\" ++ concat (intersperse "," (map (prt_ . fst) bi)) ++ " -> "
- parIf par (s:ss) = map (indent 2) $
- if par
- then ('(':s) : ss ++ [")"]
- else s:ss
- ifPar (Tr (N ([],_,_,_,_), [])) = False
- ifPar _ = True
--}
-
--- auxiliaries
-
-prMetaSubst :: MetaSubst -> String
-prMetaSubst = concat . prMSubst
-
-prConstrs :: Constraints -> [String]
-prConstrs = map (\ (v,w) -> prCurly (prt v ++ "<>" ++ prt w))
-
-prMSubst :: MetaSubst -> [String]
-prMSubst = map (\ (m,e) -> prCurly ("?" ++ show m ++ "=" ++ prt e))
-
-prBinds bi = if null bi
- then []
- else "\\" ++ concat (intersperse "," (map prValDecl bi)) +++ "-> "
- where
- prValDecl (x,t) = prParenth (prt_ x +++ ":" +++ prt_ t)
-{-
-instance Print Atom where
- prt (AtC f) = prQIdent f
- prt (AtM i) = prt i
- prt (AtV i) = prt i
- prt (AtL s) = prQuotedString s
- prt (AtI i) = show i
- prt (AtF i) = show i
- prt_ (AtC (_,f)) = prt f
- prt_ a = prt a
--}
-prEnv :: Env -> String
----- prEnv [] = prCurly "" ---- for debugging
-prEnv e = concatMap (\ (x,t) -> prCurly (prt x ++ ":=" ++ prt t)) e
-
-
-instance Print Val where
- prt (VGen i x) = prt x ++ "{-" ++ show i ++ "-}" ---- latter part for debugging
- prt (VApp u v) = prt u +++ prv1 v
- prt (VCn mc) = prQIdent_ mc
- prt (VClos env e) = case e of
- Meta _ -> prt_ e ++ prEnv env
- _ -> prt_ e ---- ++ prEnv env ---- for debugging
- prt (VRecType xs) = prCurly (concat (intersperse "," [prt l ++ "=" ++ prt v | (l,v) <- xs]))
- prt VType = "Type"
-
-prv1 v = case v of
- VApp _ _ -> prParenth $ prt v
- VClos _ _ -> prParenth $ prt v
- _ -> prt v
-
-
-prQIdent :: QIdent -> String
-prQIdent (m,f) = prt m ++ "." ++ prt f
-
-prQIdent_ :: QIdent -> String
-prQIdent_ (_,f) = prt f
-
--- | print terms without qualifications
-prExp :: Term -> String
-prExp e = case e of
- App f a -> pr1 f +++ pr2 a
- Abs x b -> "\\" ++ prt x +++ "->" +++ prExp b
- Prod x a b -> "(\\" ++ prt x +++ ":" +++ prExp a ++ ")" +++ "->" +++ prExp b
- Q _ c -> prt c
- QC _ c -> prt c
- _ -> prt e
- where
- pr1 e = case e of
- Abs _ _ -> prParenth $ prExp e
- Prod _ _ _ -> prParenth $ prExp e
- _ -> prExp e
- pr2 e = case e of
- App _ _ -> prParenth $ prExp e
- _ -> pr1 e
-
--- | option @-strip@ strips qualifications
-prTermOpt :: Options -> Term -> String
-prTermOpt opts = if PrinterStrip `elem` flag optPrinter opts then prt else prExp
-
--- | to get rid of brackets in the editor
-prRefinement :: Term -> String
-prRefinement t = case t of
- Q m c -> prQIdent (m,c)
- QC m c -> prQIdent (m,c)
- _ -> prt t
-
-prOperSignature :: (QIdent,Type) -> String
-prOperSignature (f, t) = prQIdent f +++ ":" +++ prt t
-
---- printing cc command output AR 26/5/2008
-
-prTermTabular :: Term -> [(String,String)]
-prTermTabular = pr where
- pr t = case t of
- R rs ->
- [(prt_ lab +++ "." +++ path, str) | (lab,(_,val)) <- rs, (path,str) <- pr val]
- T _ cs ->
- [(prt_ lab +++"=>" +++ path, str) | (lab, val) <- cs, (path,str) <- pr val]
- V _ cs ->
- [("#" ++ show i +++"=>" +++ path, str) | (i,val) <- zip [0..] cs, (path,str) <- pr val]
- _ -> [([],ps t)]
- ps t = case t of
- K s -> s
- C s u -> ps s +++ ps u
- FV ts -> unwords (intersperse "/" (map ps ts))
- _ -> prt_ t
diff --git a/src/GF/Grammar/Unify.hs b/src/GF/Grammar/Unify.hs
index f367dc891..b48301186 100644
--- a/src/GF/Grammar/Unify.hs
+++ b/src/GF/Grammar/Unify.hs
@@ -17,7 +17,7 @@
module GF.Grammar.Unify (unifyVal) where
-import GF.Grammar.Abstract
+import GF.Grammar
import GF.Data.Operations
import Text.PrettyPrint
diff --git a/src/GF/Infra/Modules.hs b/src/GF/Infra/Modules.hs
index 0b951dd14..11e6d0a1f 100644
--- a/src/GF/Infra/Modules.hs
+++ b/src/GF/Infra/Modules.hs
@@ -33,7 +33,7 @@ module GF.Infra.Modules (
IdentM(..),
abstractOfConcrete, abstractModOfConcrete,
lookupModule, lookupModuleType, lookupInfo,
- lookupPosition, showPosition, ppPosition,
+ lookupPosition, ppPosition,
isModAbs, isModRes, isModCnc, isModTrans,
sameMType, isCompilableModule, isCompleteModule,
allAbstracts, greatestAbstract, allResources,
@@ -268,12 +268,6 @@ lookupInfo mo i = lookupTree show i (jments mo)
lookupPosition :: (Show i, Ord i) => ModInfo i a -> i -> Err (String,(Int,Int))
lookupPosition mo i = lookupTree show i (positions mo)
-showPosition :: (Show i, Ord i) => ModInfo i a -> i -> String
-showPosition mo i = case lookupPosition mo i of
- Ok (f,(b,e)) | b == e -> "in" +++ f ++ ", line" +++ show b
- Ok (f,(b,e)) -> "in" +++ f ++ ", lines" +++ show b ++ "-" ++ show e
- _ -> ""
-
ppPosition :: (Show i, Ord i) => ModInfo i a -> i -> Doc
ppPosition mo i = case lookupPosition mo i of
Ok (f,(b,e)) | b == e -> text "in" <+> text f <> text ", line" <+> int b
diff --git a/src/GF/Source/AbsGF.hs b/src/GF/Source/AbsGF.hs
deleted file mode 100644
index 37c0e5c52..000000000
--- a/src/GF/Source/AbsGF.hs
+++ /dev/null
@@ -1,323 +0,0 @@
-module GF.Source.AbsGF where
-
--- Haskell module generated by the BNF converter
-
-import qualified Data.ByteString.Char8 as BS
-newtype LString = LString BS.ByteString deriving (Eq,Ord,Show)
-newtype PIdent = PIdent ((Int,Int),BS.ByteString) deriving (Eq,Ord,Show)
-data Grammar =
- Gr [ModDef]
- deriving (Eq,Ord,Show)
-
-data ModDef =
- MMain PIdent PIdent [ConcSpec]
- | MModule ComplMod ModType ModBody
- deriving (Eq,Ord,Show)
-
-data ConcSpec =
- ConcSpec PIdent ConcExp
- deriving (Eq,Ord,Show)
-
-data ConcExp =
- ConcExp PIdent [Transfer]
- deriving (Eq,Ord,Show)
-
-data Transfer =
- TransferIn Open
- | TransferOut Open
- deriving (Eq,Ord,Show)
-
-data ModHeader =
- MModule2 ComplMod ModType ModHeaderBody
- deriving (Eq,Ord,Show)
-
-data ModHeaderBody =
- MBody2 Extend Opens
- | MNoBody2 [Included]
- | MWith2 Included [Open]
- | MWithBody2 Included [Open] Opens
- | MWithE2 [Included] Included [Open]
- | MWithEBody2 [Included] Included [Open] Opens
- | MReuse2 PIdent
- | MUnion2 [Included]
- deriving (Eq,Ord,Show)
-
-data ModType =
- MTAbstract PIdent
- | MTResource PIdent
- | MTInterface PIdent
- | MTConcrete PIdent PIdent
- | MTInstance PIdent PIdent
- | MTTransfer PIdent Open Open
- deriving (Eq,Ord,Show)
-
-data ModBody =
- MBody Extend Opens [TopDef]
- | MNoBody [Included]
- | MWith Included [Open]
- | MWithBody Included [Open] Opens [TopDef]
- | MWithE [Included] Included [Open]
- | MWithEBody [Included] Included [Open] Opens [TopDef]
- | MReuse PIdent
- | MUnion [Included]
- deriving (Eq,Ord,Show)
-
-data Extend =
- Ext [Included]
- | NoExt
- deriving (Eq,Ord,Show)
-
-data Opens =
- NoOpens
- | OpenIn [Open]
- deriving (Eq,Ord,Show)
-
-data Open =
- OName PIdent
- | OQualQO QualOpen PIdent
- | OQual QualOpen PIdent PIdent
- deriving (Eq,Ord,Show)
-
-data ComplMod =
- CMCompl
- | CMIncompl
- deriving (Eq,Ord,Show)
-
-data QualOpen =
- QOCompl
- | QOIncompl
- | QOInterface
- deriving (Eq,Ord,Show)
-
-data Included =
- IAll PIdent
- | ISome PIdent [PIdent]
- | IMinus PIdent [PIdent]
- deriving (Eq,Ord,Show)
-
-data Def =
- DDecl [Name] Exp
- | DDef [Name] Exp
- | DPatt Name [Patt] Exp
- | DFull [Name] Exp Exp
- deriving (Eq,Ord,Show)
-
-data TopDef =
- DefCat [CatDef]
- | DefFun [FunDef]
- | DefFunData [FunDef]
- | DefDef [Def]
- | DefData [DataDef]
- | DefTrans [Def]
- | DefPar [ParDef]
- | DefOper [Def]
- | DefLincat [PrintDef]
- | DefLindef [Def]
- | DefLin [Def]
- | DefPrintCat [PrintDef]
- | DefPrintFun [PrintDef]
- | DefFlag [FlagDef]
- | DefPrintOld [PrintDef]
- | DefLintype [Def]
- | DefPattern [Def]
- | DefPackage PIdent [TopDef]
- | DefVars [Def]
- | DefTokenizer PIdent
- deriving (Eq,Ord,Show)
-
-data CatDef =
- SimpleCatDef PIdent [DDecl]
- | ListCatDef PIdent [DDecl]
- | ListSizeCatDef PIdent [DDecl] Integer
- deriving (Eq,Ord,Show)
-
-data FunDef =
- FunDef [PIdent] Exp
- deriving (Eq,Ord,Show)
-
-data DataDef =
- DataDef PIdent [DataConstr]
- deriving (Eq,Ord,Show)
-
-data DataConstr =
- DataId PIdent
- | DataQId PIdent PIdent
- deriving (Eq,Ord,Show)
-
-data ParDef =
- ParDefDir PIdent [ParConstr]
- | ParDefIndir PIdent PIdent
- | ParDefAbs PIdent
- deriving (Eq,Ord,Show)
-
-data ParConstr =
- ParConstr PIdent [DDecl]
- deriving (Eq,Ord,Show)
-
-data PrintDef =
- PrintDef [Name] Exp
- deriving (Eq,Ord,Show)
-
-data FlagDef =
- FlagDef PIdent PIdent
- deriving (Eq,Ord,Show)
-
-data Name =
- IdentName PIdent
- | ListName PIdent
- deriving (Eq,Ord,Show)
-
-data LocDef =
- LDDecl [PIdent] Exp
- | LDDef [PIdent] Exp
- | LDFull [PIdent] Exp Exp
- deriving (Eq,Ord,Show)
-
-data Exp =
- EIdent PIdent
- | EConstr PIdent
- | ECons PIdent
- | ESort Sort
- | EString String
- | EInt Integer
- | EFloat Double
- | EMeta
- | EEmpty
- | EData
- | EList PIdent Exps
- | EStrings String
- | ERecord [LocDef]
- | ETuple [TupleComp]
- | EIndir PIdent
- | ETyped Exp Exp
- | EProj Exp Label
- | EQConstr PIdent PIdent
- | EQCons PIdent PIdent
- | EApp Exp Exp
- | ETable [Case]
- | ETTable Exp [Case]
- | EVTable Exp [Exp]
- | ECase Exp [Case]
- | EVariants [Exp]
- | EPre Exp [Altern]
- | EStrs [Exp]
- | EConAt PIdent Exp
- | EPatt Patt
- | EPattType Exp
- | ESelect Exp Exp
- | ETupTyp Exp Exp
- | EExtend Exp Exp
- | EGlue Exp Exp
- | EConcat Exp Exp
- | EVariant Exp Exp
- | EAbstr [Bind] Exp
- | ECTable [Bind] Exp
- | EProd Decl Exp
- | ETType Exp Exp
- | ELet [LocDef] Exp
- | ELetb [LocDef] Exp
- | EWhere Exp [LocDef]
- | EEqs [Equation]
- | EExample Exp String
- | ELString LString
- | ELin PIdent
- deriving (Eq,Ord,Show)
-
-data Exps =
- NilExp
- | ConsExp Exp Exps
- deriving (Eq,Ord,Show)
-
-data Patt =
- PChar
- | PChars String
- | PMacro PIdent
- | PM PIdent PIdent
- | PW
- | PV PIdent
- | PCon PIdent
- | PQ PIdent PIdent
- | PInt Integer
- | PFloat Double
- | PStr String
- | PR [PattAss]
- | PTup [PattTupleComp]
- | PC PIdent [Patt]
- | PQC PIdent PIdent [Patt]
- | PDisj Patt Patt
- | PSeq Patt Patt
- | PRep Patt
- | PAs PIdent Patt
- | PNeg Patt
- deriving (Eq,Ord,Show)
-
-data PattAss =
- PA [PIdent] Patt
- deriving (Eq,Ord,Show)
-
-data Label =
- LIdent PIdent
- | LVar Integer
- deriving (Eq,Ord,Show)
-
-data Sort =
- Sort_Type
- | Sort_PType
- | Sort_Tok
- | Sort_Str
- | Sort_Strs
- deriving (Eq,Ord,Show)
-
-data Bind =
- BIdent PIdent
- | BWild
- deriving (Eq,Ord,Show)
-
-data Decl =
- DDec [Bind] Exp
- | DExp Exp
- deriving (Eq,Ord,Show)
-
-data TupleComp =
- TComp Exp
- deriving (Eq,Ord,Show)
-
-data PattTupleComp =
- PTComp Patt
- deriving (Eq,Ord,Show)
-
-data Case =
- Case Patt Exp
- deriving (Eq,Ord,Show)
-
-data Equation =
- Equ [Patt] Exp
- deriving (Eq,Ord,Show)
-
-data Altern =
- Alt Exp Exp
- deriving (Eq,Ord,Show)
-
-data DDecl =
- DDDec [Bind] Exp
- | DDExp Exp
- deriving (Eq,Ord,Show)
-
-data OldGrammar =
- OldGr Include [TopDef]
- deriving (Eq,Ord,Show)
-
-data Include =
- NoIncl
- | Incl [FileName]
- deriving (Eq,Ord,Show)
-
-data FileName =
- FString String
- | FIdent PIdent
- | FSlash FileName
- | FDot FileName
- | FMinus FileName
- | FAddId PIdent FileName
- deriving (Eq,Ord,Show)
-
diff --git a/src/GF/Source/GF.cf b/src/GF/Source/GF.cf
deleted file mode 100644
index 2fe25e4d5..000000000
--- a/src/GF/Source/GF.cf
+++ /dev/null
@@ -1,372 +0,0 @@
--- AR 2/5/2003, 14-16 o'clock, Torino
-
--- 17/6/2007: marked with suffix --% those lines that are obsolete and
--- should not be included in documentation
-
-entrypoints Grammar, ModDef,
- OldGrammar, --%
- ModHeader,
- Exp ; -- let's see if more are needed
-
-comment "--" ;
-comment "{-" "-}" ;
-
--- the top-level grammar
-
-Gr. Grammar ::= [ModDef] ;
-
--- semicolon after module is permitted but not obligatory
-
-terminator ModDef "" ;
-_. ModDef ::= ModDef ";" ;
-
--- The $main$ multilingual grammar structure --%
-
-MMain. ModDef ::= "grammar" PIdent "=" "{" "abstract" "=" PIdent ";" [ConcSpec] "}" ;--%
-
-ConcSpec. ConcSpec ::= PIdent "=" ConcExp ;--%
-separator ConcSpec ";" ;--%
-
-ConcExp. ConcExp ::= PIdent [Transfer] ;--%
-
-separator Transfer "" ;--%
-TransferIn. Transfer ::= "(" "transfer" "in" Open ")" ; --%
-TransferOut. Transfer ::= "(" "transfer" "out" Open ")" ; --%
-
--- the module header
-
-MModule2. ModHeader ::= ComplMod ModType "=" ModHeaderBody ;
-
-MBody2. ModHeaderBody ::= Extend Opens ;
-MNoBody2. ModHeaderBody ::= [Included] ;
-MWith2. ModHeaderBody ::= Included "with" [Open] ;
-MWithBody2. ModHeaderBody ::= Included "with" [Open] "**" Opens ;
-MWithE2. ModHeaderBody ::= [Included] "**" Included "with" [Open] ;
-MWithEBody2. ModHeaderBody ::= [Included] "**" Included "with" [Open] "**" Opens ;
-
-MReuse2. ModHeaderBody ::= "reuse" PIdent ; --%
-MUnion2. ModHeaderBody ::= "union" [Included] ;--%
-
--- the individual modules
-
-MModule. ModDef ::= ComplMod ModType "=" ModBody ;
-
-MTAbstract. ModType ::= "abstract" PIdent ;
-MTResource. ModType ::= "resource" PIdent ;
-MTInterface. ModType ::= "interface" PIdent ;
-MTConcrete. ModType ::= "concrete" PIdent "of" PIdent ;
-MTInstance. ModType ::= "instance" PIdent "of" PIdent ;
-MTTransfer. ModType ::= "transfer" PIdent ":" Open "->" Open ;
-
-
-MBody. ModBody ::= Extend Opens "{" [TopDef] "}" ;
-MNoBody. ModBody ::= [Included] ;
-MWith. ModBody ::= Included "with" [Open] ;
-MWithBody. ModBody ::= Included "with" [Open] "**" Opens "{" [TopDef] "}" ;
-MWithE. ModBody ::= [Included] "**" Included "with" [Open] ;
-MWithEBody. ModBody ::= [Included] "**" Included "with" [Open] "**" Opens "{" [TopDef] "}" ;
-
-MReuse. ModBody ::= "reuse" PIdent ; --%
-MUnion. ModBody ::= "union" [Included] ;--%
-
-separator TopDef "" ;
-
-Ext. Extend ::= [Included] "**" ;
-NoExt. Extend ::= ;
-
-separator Open "," ;
-NoOpens. Opens ::= ;
-OpenIn. Opens ::= "open" [Open] "in" ;
-
-OName. Open ::= PIdent ;
-OQualQO. Open ::= "(" QualOpen PIdent ")" ;
-OQual. Open ::= "(" QualOpen PIdent "=" PIdent ")" ;
-
-CMCompl. ComplMod ::= ;
-CMIncompl. ComplMod ::= "incomplete" ;
-
-QOCompl. QualOpen ::= ;
-QOIncompl. QualOpen ::= "incomplete" ;--%
-QOInterface. QualOpen ::= "interface" ;--%
-
-separator Included "," ;
-
-IAll. Included ::= PIdent ;
-ISome. Included ::= PIdent "[" [PIdent] "]" ;
-IMinus. Included ::= PIdent "-" "[" [PIdent] "]" ;
-
--- definitions after the $oper$ keywords
-
-DDecl. Def ::= [Name] ":" Exp ;
-DDef. Def ::= [Name] "=" Exp ;
-DPatt. Def ::= Name [Patt] "=" Exp ; -- non-empty pattern list
-DFull. Def ::= [Name] ":" Exp "=" Exp ;
-
--- top-level definitions
-
-DefCat. TopDef ::= "cat" [CatDef] ;
-DefFun. TopDef ::= "fun" [FunDef] ;
-DefFunData.TopDef ::= "data" [FunDef] ;
-DefDef. TopDef ::= "def" [Def] ;
-DefData. TopDef ::= "data" [DataDef] ;
-
-DefTrans. TopDef ::= "transfer" [Def] ;--%
-
-DefPar. TopDef ::= "param" [ParDef] ;
-DefOper. TopDef ::= "oper" [Def] ;
-
-DefLincat. TopDef ::= "lincat" [PrintDef] ;
-DefLindef. TopDef ::= "lindef" [Def] ;
-DefLin. TopDef ::= "lin" [Def] ;
-
-DefPrintCat. TopDef ::= "printname" "cat" [PrintDef] ;
-DefPrintFun. TopDef ::= "printname" "fun" [PrintDef] ;
-DefFlag. TopDef ::= "flags" [FlagDef] ;
-
-SimpleCatDef. CatDef ::= PIdent [DDecl] ;
-ListCatDef. CatDef ::= "[" PIdent [DDecl] "]" ;
-ListSizeCatDef. CatDef ::= "[" PIdent [DDecl] "]" "{" Integer "}" ;
-
-FunDef. FunDef ::= [PIdent] ":" Exp ;
-
-DataDef. DataDef ::= PIdent "=" [DataConstr] ;
-DataId. DataConstr ::= PIdent ;
-DataQId. DataConstr ::= PIdent "." PIdent ;
-separator DataConstr "|" ;
-
-
-ParDefDir. ParDef ::= PIdent "=" [ParConstr] ;
-ParDefIndir. ParDef ::= PIdent "=" "(" "in" PIdent ")" ;
-ParDefAbs. ParDef ::= PIdent ;
-
-ParConstr. ParConstr ::= PIdent [DDecl] ;
-
-PrintDef. PrintDef ::= [Name] "=" Exp ;
-
-FlagDef. FlagDef ::= PIdent "=" PIdent ;
-
-terminator nonempty Def ";" ;
-terminator nonempty CatDef ";" ;
-terminator nonempty FunDef ";" ;
-terminator nonempty DataDef ";" ;
-terminator nonempty ParDef ";" ;
-
-terminator nonempty PrintDef ";" ;
-terminator nonempty FlagDef ";" ;
-
-separator ParConstr "|" ;
-
-separator nonempty PIdent "," ;
-
--- names of categories and functions in definition LHS
-
-IdentName. Name ::= PIdent ;
-ListName. Name ::= "[" PIdent "]" ;
-
-separator nonempty Name "," ;
-
--- definitions in records and $let$ expressions
-
-LDDecl. LocDef ::= [PIdent] ":" Exp ;
-LDDef. LocDef ::= [PIdent] "=" Exp ;
-LDFull. LocDef ::= [PIdent] ":" Exp "=" Exp ;
-
-separator LocDef ";" ;
-
--- terms and types
-
-EIdent. Exp6 ::= PIdent ;
-EConstr. Exp6 ::= "{" PIdent "}" ;--%
-ECons. Exp6 ::= "%" PIdent "%" ;--%
-ESort. Exp6 ::= Sort ;
-EString. Exp6 ::= String ;
-EInt. Exp6 ::= Integer ;
-EFloat. Exp6 ::= Double ;
-EMeta. Exp6 ::= "?" ;
-EEmpty. Exp6 ::= "[" "]" ;
-EData. Exp6 ::= "data" ;
-EList. Exp6 ::= "[" PIdent Exps "]" ;
-EStrings. Exp6 ::= "[" String "]" ;
-ERecord. Exp6 ::= "{" [LocDef] "}" ; -- !
-ETuple. Exp6 ::= "<" [TupleComp] ">" ; --- needed for separator ","
-EIndir. Exp6 ::= "(" "in" PIdent ")" ; -- indirection, used in judgements --%
-ETyped. Exp6 ::= "<" Exp ":" Exp ">" ; -- typing, used for annotations
-
-EProj. Exp5 ::= Exp5 "." Label ;
-EQConstr. Exp5 ::= "{" PIdent "." PIdent "}" ; -- qualified constructor --%
-EQCons. Exp5 ::= "%" PIdent "." PIdent ; -- qualified constant --%
-
-EApp. Exp4 ::= Exp4 Exp5 ;
-ETable. Exp4 ::= "table" "{" [Case] "}" ;
-ETTable. Exp4 ::= "table" Exp6 "{" [Case] "}" ;
-EVTable. Exp4 ::= "table" Exp6 "[" [Exp] "]" ;
-ECase. Exp4 ::= "case" Exp "of" "{" [Case] "}" ;
-EVariants. Exp4 ::= "variants" "{" [Exp] "}" ;
---- EPreCase. Exp4 ::= "pre" "{" [Case] "}" ;
-EPre. Exp4 ::= "pre" "{" Exp ";" [Altern] "}" ;
-EStrs. Exp4 ::= "strs" "{" [Exp] "}" ;
-EConAt. Exp4 ::= PIdent "@" Exp6 ; --%
-
-EPatt. Exp4 ::= "#" Patt2 ;
-EPattType. Exp4 ::= "pattern" Exp5 ;
-
-ESelect. Exp3 ::= Exp3 "!" Exp4 ;
-ETupTyp. Exp3 ::= Exp3 "*" Exp4 ;
-EExtend. Exp3 ::= Exp3 "**" Exp4 ;
-
-EGlue. Exp2 ::= Exp3 "+" Exp2 ;
-
-EConcat. Exp1 ::= Exp2 "++" Exp1 ;
-
-EVariant. Exp ::= Exp1 "|" Exp ;
-EAbstr. Exp ::= "\\" [Bind] "->" Exp ;
-ECTable. Exp ::= "\\""\\" [Bind] "=>" Exp ;
-EProd. Exp ::= Decl "->" Exp ;
-ETType. Exp ::= Exp3 "=>" Exp ; -- these are thus right associative
-ELet. Exp ::= "let" "{" [LocDef] "}" "in" Exp ;
-ELetb. Exp ::= "let" [LocDef] "in" Exp ;
-EWhere. Exp ::= Exp3 "where" "{" [LocDef] "}" ;
-EEqs. Exp ::= "fn" "{" [Equation] "}" ; --%
-
-EExample. Exp ::= "in" Exp5 String ;
-
-coercions Exp 6 ;
-
-separator Exp ";" ; -- in variants
-
--- list of arguments to category
-NilExp. Exps ::= ;
-ConsExp. Exps ::= Exp6 Exps ; -- Exp6 to force parantheses
-
--- patterns
-
-PChar. Patt2 ::= "?" ;
-PChars. Patt2 ::= "[" String "]" ;
-PMacro. Patt2 ::= "#" PIdent ;
-PM. Patt2 ::= "#" PIdent "." PIdent ;
-PW. Patt2 ::= "_" ;
-PV. Patt2 ::= PIdent ;
-PCon. Patt2 ::= "{" PIdent "}" ; --%
-PQ. Patt2 ::= PIdent "." PIdent ;
-PInt. Patt2 ::= Integer ;
-PFloat. Patt2 ::= Double ;
-PStr. Patt2 ::= String ;
-PR. Patt2 ::= "{" [PattAss] "}" ;
-PTup. Patt2 ::= "<" [PattTupleComp] ">" ;
-PC. Patt1 ::= PIdent [Patt] ;
-PQC. Patt1 ::= PIdent "." PIdent [Patt] ;
-PDisj. Patt ::= Patt "|" Patt1 ;
-PSeq. Patt ::= Patt "+" Patt1 ;
-PRep. Patt1 ::= Patt2 "*" ;
-PAs. Patt1 ::= PIdent "@" Patt2 ;
-PNeg. Patt1 ::= "-" Patt2 ;
-
-coercions Patt 2 ;
-
-PA. PattAss ::= [PIdent] "=" Patt ;
-
--- labels
-
-LIdent. Label ::= PIdent ;
-LVar. Label ::= "$" Integer ;
-
--- basic types
-
-rules Sort ::=
- "Type"
- | "PType"
- | "Tok" --%
- | "Str"
- | "Strs" ;
-
-separator PattAss ";" ;
-
--- this is explicit to force higher precedence level on rhs
-(:[]). [Patt] ::= Patt2 ;
-(:). [Patt] ::= Patt2 [Patt] ;
-
-
--- binds in lambdas and lin rules
-
-BIdent. Bind ::= PIdent ;
-BWild. Bind ::= "_" ;
-
-separator Bind "," ;
-
-
--- declarations in function types
-
-DDec. Decl ::= "(" [Bind] ":" Exp ")" ;
-DExp. Decl ::= Exp4 ; -- can thus be an application
-
--- tuple component (term or pattern)
-
-TComp. TupleComp ::= Exp ;
-PTComp. PattTupleComp ::= Patt ;
-
-separator TupleComp "," ;
-separator PattTupleComp "," ;
-
--- case branches
-
-Case. Case ::= Patt "=>" Exp ;
-
-separator nonempty Case ";" ;
-
--- cases in abstract syntax --%
-
-Equ. Equation ::= [Patt] "->" Exp ; --%
-
-separator Equation ";" ; --%
-
--- prefix alternatives
-
-Alt. Altern ::= Exp "/" Exp ;
-
-separator Altern ";" ;
-
--- in a context, higher precedence is required than in function types
-
-DDDec. DDecl ::= "(" [Bind] ":" Exp ")" ;
-DDExp. DDecl ::= Exp6 ; -- can thus *not* be an application
-
-separator DDecl "" ;
-
-
--------------------------------------- --%
-
--- for backward compatibility --%
-
-OldGr. OldGrammar ::= Include [TopDef] ; --%
-
-NoIncl. Include ::= ; --%
-Incl. Include ::= "include" [FileName] ; --%
-
-FString. FileName ::= String ; --%
-
-terminator nonempty FileName ";" ; --%
-
-FIdent. FileName ::= PIdent ; --%
-FSlash. FileName ::= "/" FileName ; --%
-FDot. FileName ::= "." FileName ; --%
-FMinus. FileName ::= "-" FileName ; --%
-FAddId. FileName ::= PIdent FileName ; --%
-
-token LString '\'' (char - '\'')* '\'' ; --%
-ELString. Exp6 ::= LString ; --%
-ELin. Exp4 ::= "Lin" PIdent ; --%
-
-DefPrintOld. TopDef ::= "printname" [PrintDef] ; --%
-DefLintype. TopDef ::= "lintype" [Def] ; --%
-DefPattern. TopDef ::= "pattern" [Def] ; --%
-
--- deprecated packages are attempted to be interpreted --%
-DefPackage. TopDef ::= "package" PIdent "=" "{" [TopDef] "}" ";" ; --%
-
--- these two are just ignored after parsing --%
-DefVars. TopDef ::= "var" [Def] ; --%
-DefTokenizer. TopDef ::= "tokenizer" PIdent ";" ; --%
-
--- identifiers
-
-position token PIdent ('_' | letter) (letter | digit | '_' | '\'')* ;
diff --git a/src/GF/Source/GrammarToSource.hs b/src/GF/Source/GrammarToSource.hs
deleted file mode 100644
index a3754336e..000000000
--- a/src/GF/Source/GrammarToSource.hs
+++ /dev/null
@@ -1,233 +0,0 @@
-----------------------------------------------------------------------
--- |
--- Module : GrammarToSource
--- Maintainer : AR
--- Stability : (stable)
--- Portability : (portable)
---
--- > CVS $Date: 2005/10/04 11:05:07 $
--- > CVS $Author: aarne $
--- > CVS $Revision: 1.23 $
---
--- From internal source syntax to BNFC-generated (used for printing).
------------------------------------------------------------------------------
-
-module GF.Source.GrammarToSource ( trGrammar,
- trModule,
- trAnyDef,
- trLabel,
- trt, tri, trp
- ) where
-
-import GF.Data.Operations
-import GF.Grammar.Grammar
-import GF.Grammar.Predef
-import GF.Infra.Modules
-import GF.Infra.Option
-import qualified GF.Source.AbsGF as P
-import GF.Infra.Ident
-import qualified Data.ByteString.Char8 as BS
-
--- | AR 13\/5\/2003
---
--- translate internal to parsable and printable source
-trGrammar :: SourceGrammar -> P.Grammar
-trGrammar (MGrammar ms) = P.Gr (map trModule ms) -- no includes
-
-trModule :: (Ident,SourceModInfo) -> P.ModDef
-trModule (i,m) = P.MModule compl typ body
- where
- compl = case mstatus m of
- MSIncomplete -> P.CMIncompl
- _ -> P.CMCompl
- i' = tri i
- typ = case mtype m of
- MTResource -> P.MTResource i'
- MTAbstract -> P.MTAbstract i'
- MTConcrete a -> P.MTConcrete i' (tri a)
- MTTransfer a b -> P.MTTransfer i' (trOpen a) (trOpen b)
- MTInstance a -> P.MTInstance i' (tri a)
- MTInterface -> P.MTInterface i'
- body = P.MBody
- (trExtends (extend m))
- (mkOpens (map trOpen (opens m)))
- (mkTopDefs (concatMap trAnyDef (tree2list (jments m)) ++ trFlags (flags m)))
-
-trExtends :: [(Ident,MInclude Ident)] -> P.Extend
-trExtends [] = P.NoExt
-trExtends es = (P.Ext $ map tre es) where
- tre (i,c) = case c of
- MIAll -> P.IAll (tri i)
- MIOnly is -> P.ISome (tri i) (map tri is)
- MIExcept is -> P.IMinus (tri i) (map tri is)
-
----- this has to be completed with other mtys
-forName (MTConcrete a) = tri a
-
-trOpen :: OpenSpec Ident -> P.Open
-trOpen o = case o of
- OSimple i -> P.OName (tri i)
- OQualif i j -> P.OQual P.QOCompl (tri i) (tri j)
-
-mkOpens ds = if null ds then P.NoOpens else P.OpenIn ds
-mkTopDefs ds = ds
-
-trAnyDef :: (Ident,Info) -> [P.TopDef]
-trAnyDef (i,info) = let i' = tri i in case info of
- AbsCat (Just co) pd -> [P.DefCat [P.SimpleCatDef i' (map trDecl co)]]
- AbsFun (Just ty) _ Nothing -> [P.DefFunData [P.FunDef [i'] (trt ty)]]
- AbsFun (Just ty) _ (Just eqs) -> [P.DefFun [P.FunDef [i'] (trt ty)]] ++
- [P.DefDef [P.DPatt (mkName i') (map trp patts) (trt res)] | (patts,res) <- eqs]
-
- ResOper pty ptr -> [P.DefOper [trDef i' pty ptr]]
- ResParam pp -> [P.DefPar [case pp of
- Just (ps,_) -> P.ParDefDir i' [P.ParConstr (tri c) (map trDecl co) | (c,co) <- ps]
- Nothing -> P.ParDefAbs i']]
-
- ResOverload os tysts ->
- [P.DefOper [P.DDef [mkName i'] (
- foldl P.EApp
- (P.EIdent $ tri $ cOverload)
- (map (P.EIdent . tri) os ++
- [P.ERecord [P.LDFull [i'] (trt ty) (trt fu) | (ty,fu) <- tysts]]))]]
-
- CncCat (Just ty) Nothing _ ->
- [P.DefLincat [P.PrintDef [mkName i'] (trt ty)]]
- CncCat pty ptr ppr ->
- [P.DefLindef [trDef i' pty ptr]] ++
- [P.DefPrintCat [P.PrintDef [mkName i'] (trt pr)] | Just pr <- [ppr]]
- CncFun _ ptr ppr ->
- [P.DefLin [trDef i' Nothing ptr]] ++
- [P.DefPrintFun [P.PrintDef [mkName i'] (trt pr)] | Just pr <- [ppr]]
- _ -> []
-
-
-trDef :: P.PIdent -> Maybe Type -> Maybe Term -> P.Def
-trDef i pty ptr = case (pty,ptr) of
- (Nothing, Nothing) -> P.DDef [mkName i] (P.EMeta) ---
- (_, Nothing) -> P.DDecl [mkName i] (maybe P.EMeta trt pty)
- (Nothing, _ ) -> P.DDef [mkName i] (maybe P.EMeta trt ptr)
- (_, _ ) -> P.DFull [mkName i] (maybe P.EMeta trt pty) (maybe P.EMeta trt ptr)
-
-trFlags :: Options -> [P.TopDef]
-trFlags = map trFlag . optionsGFO
-
-trFlag :: (String,String) -> P.TopDef
-trFlag (f,x) = P.DefFlag [P.FlagDef (tri $ identC (BS.pack f)) (tri $ identC (BS.pack x))]
-
-trt :: Term -> P.Exp
-trt trm = case trm of
- Vr s -> P.EIdent $ tri s
- Cn s -> P.ECons $ tri s
- Con s -> P.EConstr $ tri s
- Sort s -> P.ESort $! if s == cType then P.Sort_Type else
- if s == cPType then P.Sort_PType else
- if s == cTok then P.Sort_Tok else
- if s == cStr then P.Sort_Str else
- if s == cStrs then P.Sort_Strs else
- error $ "not yet sort " +++ show trm
- App c a -> P.EApp (trt c) (trt a)
- Abs x b -> P.EAbstr [trb x] (trt b)
- Meta m -> P.EMeta
- Prod x a b | isWildIdent x -> P.EProd (P.DExp (trt a)) (trt b)
- Prod x a b -> P.EProd (P.DDec [trb x] (trt a)) (trt b)
-
- Example t s -> P.EExample (trt t) s
- R [] -> P.ETuple [] --- to get correct parsing when read back
- R r -> P.ERecord $ map trAssign r
- RecType r -> P.ERecord $ map trLabelling r
- ExtR x y -> P.EExtend (trt x) (trt y)
- P t l -> P.EProj (trt t) (trLabel l)
- PI t l _ -> P.EProj (trt t) (trLabel l)
- Q t l -> P.EQCons (tri t) (tri l)
- QC t l -> P.EQConstr (tri t) (tri l)
- TSh (TComp ty) cc -> P.ETTable (trt ty) (map trCases cc)
- TSh (TTyped ty) cc -> P.ETTable (trt ty) (map trCases cc)
- TSh (TWild ty) cc -> P.ETTable (trt ty) (map trCases cc)
- T (TTyped ty) cc -> P.ETTable (trt ty) (map trCase cc)
- T (TComp ty) cc -> P.ETTable (trt ty) (map trCase cc)
- T (TWild ty) cc -> P.ETTable (trt ty) (map trCase cc)
- T _ cc -> P.ETable (map trCase cc)
- V ty cc -> P.EVTable (trt ty) (map trt cc)
-
- Table x v -> P.ETType (trt x) (trt v)
- S f x -> P.ESelect (trt f) (trt x)
----- Alias c a t -> "{-" +++ prt c +++ "=" +++ "-}" +++ prt t
--- Alias c a t -> prt (Let (c,(Just a,t)) (Vr c)) -- thus Alias is only internal
-
- Let (x,(ma,b)) t ->
- P.ELet [maybe (P.LDDef x' b') (\ty -> P.LDFull x' (trt ty) b') ma] (trt t)
- where
- b' = trt b
- x' = [tri x]
-
- Empty -> P.EEmpty
- K [] -> P.EEmpty
- K a -> P.EString a
- C a b -> P.EConcat (trt a) (trt b)
-
- EInt i -> P.EInt i
- EFloat i -> P.EFloat i
-
- EPatt p -> P.EPatt (trp p)
- EPattType t -> P.EPattType (trt t)
-
- Glue a b -> P.EGlue (trt a) (trt b)
- Alts (t, tt) -> P.EPre (trt t) [P.Alt (trt v) (trt c) | (v,c) <- tt]
- FV ts -> P.EVariants $ map trt ts
- Strs tt -> P.EStrs $ map trt tt
- Val te _ _ -> trt te ----
- _ -> error $ "not yet" +++ show trm ----
-
-trp :: Patt -> P.Patt
-trp p = case p of
- PW -> P.PW
- PV s -> P.PV $ tri s
- PC c [] -> P.PCon $ tri c
- PC c a -> P.PC (tri c) (map trp a)
- PP p c [] -> P.PQ (tri p) (tri c)
- PP p c a -> P.PQC (tri p) (tri c) (map trp a)
- PR r -> P.PR [P.PA [tri $ label2ident l] (trp p) | (l,p) <- r]
- PString s -> P.PStr s
- PInt i -> P.PInt i
- PFloat i -> P.PFloat i
- PT t p -> trp p ---- prParenth (prt p +++ ":" +++ prt t)
-
- PAs x p -> P.PAs (tri x) (trp p)
-
- PAlt p q -> P.PDisj (trp p) (trp q)
- PSeq p q -> P.PSeq (trp p) (trp q)
- PRep p -> P.PRep (trp p)
- PNeg p -> P.PNeg (trp p)
- PChar -> P.PChar
- PChars s -> P.PChars s
- PM m c -> P.PM (tri m) (tri c)
-
- PVal p _ _ -> trp p ----
-
-trAssign (lab, (mty, t)) = maybe (P.LDDef x t') (\ty -> P.LDFull x (trt ty) t') mty
- where
- t' = trt t
- x = [tri $ label2ident lab]
-
-trLabelling (lab,ty) = P.LDDecl [tri $ label2ident lab] (trt ty)
-
-trCase (patt, trm) = P.Case (trp patt) (trt trm)
-trCases (patts,trm) = P.Case (foldl1 P.PDisj (map trp patts)) (trt trm)
-
-trDecl (x,ty) = P.DDDec [trb x] (trt ty)
-
-tri :: Ident -> P.PIdent
-tri = ppIdent . ident2bs
-
-ppIdent i = P.PIdent ((0,0),i)
-
-trb i = if isWildIdent i then P.BWild else P.BIdent (tri i)
-
-trLabel :: Label -> P.Label
-trLabel i = case i of
- LIdent s -> P.LIdent $ ppIdent s
- LVar i -> P.LVar $ toInteger i
-
-mkName :: P.PIdent -> P.Name
-mkName = P.IdentName
diff --git a/src/GF/Source/Makefile b/src/GF/Source/Makefile
deleted file mode 100644
index 082efa5ef..000000000
--- a/src/GF/Source/Makefile
+++ /dev/null
@@ -1,7 +0,0 @@
-all:
- cd ../.. && bnfc -p GF.Source -bytestrings GF/Source/GF.cf
- rm ErrM.hs
- perl -i -pe 's/%name pModHeader ModHeader/%partial pModHeader ModHeader/' ParGF.y
- perl -i -pe 's/GF.Source.ErrM/GF.Data.ErrM/' *.hs *.x *.y
- happy -gca ParGF.y
- alex -g LexGF.x
diff --git a/src/GF/Source/PrintGF.hs b/src/GF/Source/PrintGF.hs
deleted file mode 100644
index 3a04d89ba..000000000
--- a/src/GF/Source/PrintGF.hs
+++ /dev/null
@@ -1,551 +0,0 @@
-{-# OPTIONS -fno-warn-incomplete-patterns #-}
-module GF.Source.PrintGF where
-
--- pretty-printer generated by the BNF converter
-
-import GF.Source.AbsGF
-import Data.Char
-import qualified Data.ByteString.Char8 as BS
-
--- the top-level printing method
-printTree :: Print a => a -> String
-printTree = render . prt 0
-
-type Doc = [ShowS] -> [ShowS]
-
-doc :: ShowS -> Doc
-doc = (:)
-
-render :: Doc -> String
-render d = rend 0 (map ($ "") $ d []) "" where
- rend i ss = case ss of
- "[" :ts -> showChar '[' . rend i ts
- "(" :ts -> showChar '(' . rend i ts
- "{" :ts -> showChar '{' . new (i+1) . rend (i+1) ts
- "}" : ";":ts -> new (i-1) . space "}" . showChar ';' . new (i-1) . rend (i-1) ts
- "}" :ts -> new (i-1) . showChar '}' . new (i-1) . rend (i-1) ts
- ";" :ts -> showChar ';' . new i . rend i ts
- t : "," :ts -> showString t . space "," . rend i ts
- t : ")" :ts -> showString t . showChar ')' . rend i ts
- t : "]" :ts -> showString t . showChar ']' . rend i ts
- t :ts -> space t . rend i ts
- _ -> id
- new i = showChar '\n' . replicateS (2*i) (showChar ' ') . dropWhile isSpace
- space t = showString t . (\s -> if null s then "" else (' ':s))
-
-parenth :: Doc -> Doc
-parenth ss = doc (showChar '(') . ss . doc (showChar ')')
-
-concatS :: [ShowS] -> ShowS
-concatS = foldr (.) id
-
-concatD :: [Doc] -> Doc
-concatD = foldr (.) id
-
-replicateS :: Int -> ShowS -> ShowS
-replicateS n f = concatS (replicate n f)
-
--- the printer class does the job
-class Print a where
- prt :: Int -> a -> Doc
- prtList :: [a] -> Doc
- prtList = concatD . map (prt 0)
-
-instance Print a => Print [a] where
- prt _ = prtList
-
-instance Print Char where
- prt _ s = doc (showChar '\'' . mkEsc '\'' s . showChar '\'')
- prtList s = doc (showChar '"' . concatS (map (mkEsc '"') s) . showChar '"')
-
-mkEsc :: Char -> Char -> ShowS
-mkEsc q s = case s of
- _ | s == q -> showChar '\\' . showChar s
- '\\'-> showString "\\\\"
- '\n' -> showString "\\n"
- '\t' -> showString "\\t"
- _ -> showChar s
-
-prPrec :: Int -> Int -> Doc -> Doc
-prPrec i j = if j<i then parenth else id
-
-
-instance Print Integer where
- prt _ x = doc (shows x)
-
-
-instance Print Double where
- prt _ x = doc (shows x)
-
-
-
-instance Print LString where
- prt _ (LString i) = doc (showString (BS.unpack i))
-
-
-instance Print PIdent where
- prt _ (PIdent (_,i)) = doc (showString (BS.unpack i))
- prtList es = case es of
- [x] -> (concatD [prt 0 x])
- x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
-
-
-
-instance Print Grammar where
- prt i e = case e of
- Gr moddefs -> prPrec i 0 (concatD [prt 0 moddefs])
-
-
-instance Print ModDef where
- prt i e = case e of
- MMain pident0 pident concspecs -> prPrec i 0 (concatD [doc (showString "grammar") , prt 0 pident0 , doc (showString "=") , doc (showString "{") , doc (showString "abstract") , doc (showString "=") , prt 0 pident , doc (showString ";") , prt 0 concspecs , doc (showString "}")])
- MModule complmod modtype modbody -> prPrec i 0 (concatD [prt 0 complmod , prt 0 modtype , doc (showString "=") , prt 0 modbody])
-
- prtList es = case es of
- [] -> (concatD [])
- x:xs -> (concatD [prt 0 x , prt 0 xs])
-
-instance Print ConcSpec where
- prt i e = case e of
- ConcSpec pident concexp -> prPrec i 0 (concatD [prt 0 pident , doc (showString "=") , prt 0 concexp])
-
- prtList es = case es of
- [] -> (concatD [])
- [x] -> (concatD [prt 0 x])
- x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
-
-instance Print ConcExp where
- prt i e = case e of
- ConcExp pident transfers -> prPrec i 0 (concatD [prt 0 pident , prt 0 transfers])
-
-
-instance Print Transfer where
- prt i e = case e of
- TransferIn open -> prPrec i 0 (concatD [doc (showString "(") , doc (showString "transfer") , doc (showString "in") , prt 0 open , doc (showString ")")])
- TransferOut open -> prPrec i 0 (concatD [doc (showString "(") , doc (showString "transfer") , doc (showString "out") , prt 0 open , doc (showString ")")])
-
- prtList es = case es of
- [] -> (concatD [])
- x:xs -> (concatD [prt 0 x , prt 0 xs])
-
-instance Print ModHeader where
- prt i e = case e of
- MModule2 complmod modtype modheaderbody -> prPrec i 0 (concatD [prt 0 complmod , prt 0 modtype , doc (showString "=") , prt 0 modheaderbody])
-
-
-instance Print ModHeaderBody where
- prt i e = case e of
- MBody2 extend opens -> prPrec i 0 (concatD [prt 0 extend , prt 0 opens])
- MNoBody2 includeds -> prPrec i 0 (concatD [prt 0 includeds])
- MWith2 included opens -> prPrec i 0 (concatD [prt 0 included , doc (showString "with") , prt 0 opens])
- MWithBody2 included opens0 opens -> prPrec i 0 (concatD [prt 0 included , doc (showString "with") , prt 0 opens0 , doc (showString "**") , prt 0 opens])
- MWithE2 includeds included opens -> prPrec i 0 (concatD [prt 0 includeds , doc (showString "**") , prt 0 included , doc (showString "with") , prt 0 opens])
- MWithEBody2 includeds included opens0 opens -> prPrec i 0 (concatD [prt 0 includeds , doc (showString "**") , prt 0 included , doc (showString "with") , prt 0 opens0 , doc (showString "**") , prt 0 opens])
- MReuse2 pident -> prPrec i 0 (concatD [doc (showString "reuse") , prt 0 pident])
- MUnion2 includeds -> prPrec i 0 (concatD [doc (showString "union") , prt 0 includeds])
-
-
-instance Print ModType where
- prt i e = case e of
- MTAbstract pident -> prPrec i 0 (concatD [doc (showString "abstract") , prt 0 pident])
- MTResource pident -> prPrec i 0 (concatD [doc (showString "resource") , prt 0 pident])
- MTInterface pident -> prPrec i 0 (concatD [doc (showString "interface") , prt 0 pident])
- MTConcrete pident0 pident -> prPrec i 0 (concatD [doc (showString "concrete") , prt 0 pident0 , doc (showString "of") , prt 0 pident])
- MTInstance pident0 pident -> prPrec i 0 (concatD [doc (showString "instance") , prt 0 pident0 , doc (showString "of") , prt 0 pident])
- MTTransfer pident open0 open -> prPrec i 0 (concatD [doc (showString "transfer") , prt 0 pident , doc (showString ":") , prt 0 open0 , doc (showString "->") , prt 0 open])
-
-
-instance Print ModBody where
- prt i e = case e of
- MBody extend opens topdefs -> prPrec i 0 (concatD [prt 0 extend , prt 0 opens , doc (showString "{") , prt 0 topdefs , doc (showString "}")])
- MNoBody includeds -> prPrec i 0 (concatD [prt 0 includeds])
- MWith included opens -> prPrec i 0 (concatD [prt 0 included , doc (showString "with") , prt 0 opens])
- MWithBody included opens0 opens topdefs -> prPrec i 0 (concatD [prt 0 included , doc (showString "with") , prt 0 opens0 , doc (showString "**") , prt 0 opens , doc (showString "{") , prt 0 topdefs , doc (showString "}")])
- MWithE includeds included opens -> prPrec i 0 (concatD [prt 0 includeds , doc (showString "**") , prt 0 included , doc (showString "with") , prt 0 opens])
- MWithEBody includeds included opens0 opens topdefs -> prPrec i 0 (concatD [prt 0 includeds , doc (showString "**") , prt 0 included , doc (showString "with") , prt 0 opens0 , doc (showString "**") , prt 0 opens , doc (showString "{") , prt 0 topdefs , doc (showString "}")])
- MReuse pident -> prPrec i 0 (concatD [doc (showString "reuse") , prt 0 pident])
- MUnion includeds -> prPrec i 0 (concatD [doc (showString "union") , prt 0 includeds])
-
-
-instance Print Extend where
- prt i e = case e of
- Ext includeds -> prPrec i 0 (concatD [prt 0 includeds , doc (showString "**")])
- NoExt -> prPrec i 0 (concatD [])
-
-
-instance Print Opens where
- prt i e = case e of
- NoOpens -> prPrec i 0 (concatD [])
- OpenIn opens -> prPrec i 0 (concatD [doc (showString "open") , prt 0 opens , doc (showString "in")])
-
-
-instance Print Open where
- prt i e = case e of
- OName pident -> prPrec i 0 (concatD [prt 0 pident])
- OQualQO qualopen pident -> prPrec i 0 (concatD [doc (showString "(") , prt 0 qualopen , prt 0 pident , doc (showString ")")])
- OQual qualopen pident0 pident -> prPrec i 0 (concatD [doc (showString "(") , prt 0 qualopen , prt 0 pident0 , doc (showString "=") , prt 0 pident , doc (showString ")")])
-
- prtList es = case es of
- [] -> (concatD [])
- [x] -> (concatD [prt 0 x])
- x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
-
-instance Print ComplMod where
- prt i e = case e of
- CMCompl -> prPrec i 0 (concatD [])
- CMIncompl -> prPrec i 0 (concatD [doc (showString "incomplete")])
-
-
-instance Print QualOpen where
- prt i e = case e of
- QOCompl -> prPrec i 0 (concatD [])
- QOIncompl -> prPrec i 0 (concatD [doc (showString "incomplete")])
- QOInterface -> prPrec i 0 (concatD [doc (showString "interface")])
-
-
-instance Print Included where
- prt i e = case e of
- IAll pident -> prPrec i 0 (concatD [prt 0 pident])
- ISome pident pidents -> prPrec i 0 (concatD [prt 0 pident , doc (showString "[") , prt 0 pidents , doc (showString "]")])
- IMinus pident pidents -> prPrec i 0 (concatD [prt 0 pident , doc (showString "-") , doc (showString "[") , prt 0 pidents , doc (showString "]")])
-
- prtList es = case es of
- [] -> (concatD [])
- [x] -> (concatD [prt 0 x])
- x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
-
-instance Print Def where
- prt i e = case e of
- DDecl names exp -> prPrec i 0 (concatD [prt 0 names , doc (showString ":") , prt 0 exp])
- DDef names exp -> prPrec i 0 (concatD [prt 0 names , doc (showString "=") , prt 0 exp])
- DPatt name patts exp -> prPrec i 0 (concatD [prt 0 name , prt 0 patts , doc (showString "=") , prt 0 exp])
- DFull names exp0 exp -> prPrec i 0 (concatD [prt 0 names , doc (showString ":") , prt 0 exp0 , doc (showString "=") , prt 0 exp])
-
- prtList es = case es of
- [x] -> (concatD [prt 0 x , doc (showString ";")])
- x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
-
-instance Print TopDef where
- prt i e = case e of
- DefCat catdefs -> prPrec i 0 (concatD [doc (showString "cat") , prt 0 catdefs])
- DefFun fundefs -> prPrec i 0 (concatD [doc (showString "fun") , prt 0 fundefs])
- DefFunData fundefs -> prPrec i 0 (concatD [doc (showString "data") , prt 0 fundefs])
- DefDef defs -> prPrec i 0 (concatD [doc (showString "def") , prt 0 defs])
- DefData datadefs -> prPrec i 0 (concatD [doc (showString "data") , prt 0 datadefs])
- DefTrans defs -> prPrec i 0 (concatD [doc (showString "transfer") , prt 0 defs])
- DefPar pardefs -> prPrec i 0 (concatD [doc (showString "param") , prt 0 pardefs])
- DefOper defs -> prPrec i 0 (concatD [doc (showString "oper") , prt 0 defs])
- DefLincat printdefs -> prPrec i 0 (concatD [doc (showString "lincat") , prt 0 printdefs])
- DefLindef defs -> prPrec i 0 (concatD [doc (showString "lindef") , prt 0 defs])
- DefLin defs -> prPrec i 0 (concatD [doc (showString "lin") , prt 0 defs])
- DefPrintCat printdefs -> prPrec i 0 (concatD [doc (showString "printname") , doc (showString "cat") , prt 0 printdefs])
- DefPrintFun printdefs -> prPrec i 0 (concatD [doc (showString "printname") , doc (showString "fun") , prt 0 printdefs])
- DefFlag flagdefs -> prPrec i 0 (concatD [doc (showString "flags") , prt 0 flagdefs])
- DefPrintOld printdefs -> prPrec i 0 (concatD [doc (showString "printname") , prt 0 printdefs])
- DefLintype defs -> prPrec i 0 (concatD [doc (showString "lintype") , prt 0 defs])
- DefPattern defs -> prPrec i 0 (concatD [doc (showString "pattern") , prt 0 defs])
- DefPackage pident topdefs -> prPrec i 0 (concatD [doc (showString "package") , prt 0 pident , doc (showString "=") , doc (showString "{") , prt 0 topdefs , doc (showString "}") , doc (showString ";")])
- DefVars defs -> prPrec i 0 (concatD [doc (showString "var") , prt 0 defs])
- DefTokenizer pident -> prPrec i 0 (concatD [doc (showString "tokenizer") , prt 0 pident , doc (showString ";")])
-
- prtList es = case es of
- [] -> (concatD [])
- x:xs -> (concatD [prt 0 x , prt 0 xs])
-
-instance Print CatDef where
- prt i e = case e of
- SimpleCatDef pident ddecls -> prPrec i 0 (concatD [prt 0 pident , prt 0 ddecls])
- ListCatDef pident ddecls -> prPrec i 0 (concatD [doc (showString "[") , prt 0 pident , prt 0 ddecls , doc (showString "]")])
- ListSizeCatDef pident ddecls n -> prPrec i 0 (concatD [doc (showString "[") , prt 0 pident , prt 0 ddecls , doc (showString "]") , doc (showString "{") , prt 0 n , doc (showString "}")])
-
- prtList es = case es of
- [x] -> (concatD [prt 0 x , doc (showString ";")])
- x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
-
-instance Print FunDef where
- prt i e = case e of
- FunDef pidents exp -> prPrec i 0 (concatD [prt 0 pidents , doc (showString ":") , prt 0 exp])
-
- prtList es = case es of
- [x] -> (concatD [prt 0 x , doc (showString ";")])
- x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
-
-instance Print DataDef where
- prt i e = case e of
- DataDef pident dataconstrs -> prPrec i 0 (concatD [prt 0 pident , doc (showString "=") , prt 0 dataconstrs])
-
- prtList es = case es of
- [x] -> (concatD [prt 0 x , doc (showString ";")])
- x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
-
-instance Print DataConstr where
- prt i e = case e of
- DataId pident -> prPrec i 0 (concatD [prt 0 pident])
- DataQId pident0 pident -> prPrec i 0 (concatD [prt 0 pident0 , doc (showString ".") , prt 0 pident])
-
- prtList es = case es of
- [] -> (concatD [])
- [x] -> (concatD [prt 0 x])
- x:xs -> (concatD [prt 0 x , doc (showString "|") , prt 0 xs])
-
-instance Print ParDef where
- prt i e = case e of
- ParDefDir pident parconstrs -> prPrec i 0 (concatD [prt 0 pident , doc (showString "=") , prt 0 parconstrs])
- ParDefIndir pident0 pident -> prPrec i 0 (concatD [prt 0 pident0 , doc (showString "=") , doc (showString "(") , doc (showString "in") , prt 0 pident , doc (showString ")")])
- ParDefAbs pident -> prPrec i 0 (concatD [prt 0 pident])
-
- prtList es = case es of
- [x] -> (concatD [prt 0 x , doc (showString ";")])
- x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
-
-instance Print ParConstr where
- prt i e = case e of
- ParConstr pident ddecls -> prPrec i 0 (concatD [prt 0 pident , prt 0 ddecls])
-
- prtList es = case es of
- [] -> (concatD [])
- [x] -> (concatD [prt 0 x])
- x:xs -> (concatD [prt 0 x , doc (showString "|") , prt 0 xs])
-
-instance Print PrintDef where
- prt i e = case e of
- PrintDef names exp -> prPrec i 0 (concatD [prt 0 names , doc (showString "=") , prt 0 exp])
-
- prtList es = case es of
- [x] -> (concatD [prt 0 x , doc (showString ";")])
- x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
-
-instance Print FlagDef where
- prt i e = case e of
- FlagDef pident0 pident -> prPrec i 0 (concatD [prt 0 pident0 , doc (showString "=") , prt 0 pident])
-
- prtList es = case es of
- [x] -> (concatD [prt 0 x , doc (showString ";")])
- x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
-
-instance Print Name where
- prt i e = case e of
- IdentName pident -> prPrec i 0 (concatD [prt 0 pident])
- ListName pident -> prPrec i 0 (concatD [doc (showString "[") , prt 0 pident , doc (showString "]")])
-
- prtList es = case es of
- [x] -> (concatD [prt 0 x])
- x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
-
-instance Print LocDef where
- prt i e = case e of
- LDDecl pidents exp -> prPrec i 0 (concatD [prt 0 pidents , doc (showString ":") , prt 0 exp])
- LDDef pidents exp -> prPrec i 0 (concatD [prt 0 pidents , doc (showString "=") , prt 0 exp])
- LDFull pidents exp0 exp -> prPrec i 0 (concatD [prt 0 pidents , doc (showString ":") , prt 0 exp0 , doc (showString "=") , prt 0 exp])
-
- prtList es = case es of
- [] -> (concatD [])
- [x] -> (concatD [prt 0 x])
- x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
-
-instance Print Exp where
- prt i e = case e of
- EIdent pident -> prPrec i 6 (concatD [prt 0 pident])
- EConstr pident -> prPrec i 6 (concatD [doc (showString "{") , prt 0 pident , doc (showString "}")])
- ECons pident -> prPrec i 6 (concatD [doc (showString "%") , prt 0 pident , doc (showString "%")])
- ESort sort -> prPrec i 6 (concatD [prt 0 sort])
- EString str -> prPrec i 6 (concatD [prt 0 str])
- EInt n -> prPrec i 6 (concatD [prt 0 n])
- EFloat d -> prPrec i 6 (concatD [prt 0 d])
- EMeta -> prPrec i 6 (concatD [doc (showString "?")])
- EEmpty -> prPrec i 6 (concatD [doc (showString "[") , doc (showString "]")])
- EData -> prPrec i 6 (concatD [doc (showString "data")])
- EList pident exps -> prPrec i 6 (concatD [doc (showString "[") , prt 0 pident , prt 0 exps , doc (showString "]")])
- EStrings str -> prPrec i 6 (concatD [doc (showString "[") , prt 0 str , doc (showString "]")])
- ERecord locdefs -> prPrec i 6 (concatD [doc (showString "{") , prt 0 locdefs , doc (showString "}")])
- ETuple tuplecomps -> prPrec i 6 (concatD [doc (showString "<") , prt 0 tuplecomps , doc (showString ">")])
- EIndir pident -> prPrec i 6 (concatD [doc (showString "(") , doc (showString "in") , prt 0 pident , doc (showString ")")])
- ETyped exp0 exp -> prPrec i 6 (concatD [doc (showString "<") , prt 0 exp0 , doc (showString ":") , prt 0 exp , doc (showString ">")])
- EProj exp label -> prPrec i 5 (concatD [prt 5 exp , doc (showString ".") , prt 0 label])
- EQConstr pident0 pident -> prPrec i 5 (concatD [doc (showString "{") , prt 0 pident0 , doc (showString ".") , prt 0 pident , doc (showString "}")])
- EQCons pident0 pident -> prPrec i 5 (concatD [doc (showString "%") , prt 0 pident0 , doc (showString ".") , prt 0 pident])
- EApp exp0 exp -> prPrec i 4 (concatD [prt 4 exp0 , prt 5 exp])
- ETable cases -> prPrec i 4 (concatD [doc (showString "table") , doc (showString "{") , prt 0 cases , doc (showString "}")])
- ETTable exp cases -> prPrec i 4 (concatD [doc (showString "table") , prt 6 exp , doc (showString "{") , prt 0 cases , doc (showString "}")])
- EVTable exp exps -> prPrec i 4 (concatD [doc (showString "table") , prt 6 exp , doc (showString "[") , prt 0 exps , doc (showString "]")])
- ECase exp cases -> prPrec i 4 (concatD [doc (showString "case") , prt 0 exp , doc (showString "of") , doc (showString "{") , prt 0 cases , doc (showString "}")])
- EVariants exps -> prPrec i 4 (concatD [doc (showString "variants") , doc (showString "{") , prt 0 exps , doc (showString "}")])
- EPre exp alterns -> prPrec i 4 (concatD [doc (showString "pre") , doc (showString "{") , prt 0 exp , doc (showString ";") , prt 0 alterns , doc (showString "}")])
- EStrs exps -> prPrec i 4 (concatD [doc (showString "strs") , doc (showString "{") , prt 0 exps , doc (showString "}")])
- EConAt pident exp -> prPrec i 4 (concatD [prt 0 pident , doc (showString "@") , prt 6 exp])
- EPatt patt -> prPrec i 4 (concatD [doc (showString "#") , prt 2 patt])
- EPattType exp -> prPrec i 4 (concatD [doc (showString "pattern") , prt 5 exp])
- ESelect exp0 exp -> prPrec i 3 (concatD [prt 3 exp0 , doc (showString "!") , prt 4 exp])
- ETupTyp exp0 exp -> prPrec i 3 (concatD [prt 3 exp0 , doc (showString "*") , prt 4 exp])
- EExtend exp0 exp -> prPrec i 3 (concatD [prt 3 exp0 , doc (showString "**") , prt 4 exp])
- EGlue exp0 exp -> prPrec i 2 (concatD [prt 3 exp0 , doc (showString "+") , prt 2 exp])
- EConcat exp0 exp -> prPrec i 1 (concatD [prt 2 exp0 , doc (showString "++") , prt 1 exp])
- EVariant exp0 exp -> prPrec i 0 (concatD [prt 1 exp0 , doc (showString "|") , prt 0 exp])
- EAbstr binds exp -> prPrec i 0 (concatD [doc (showString "\\") , prt 0 binds , doc (showString "->") , prt 0 exp])
- ECTable binds exp -> prPrec i 0 (concatD [doc (showString "\\") , doc (showString "\\") , prt 0 binds , doc (showString "=>") , prt 0 exp])
- EProd decl exp -> prPrec i 0 (concatD [prt 0 decl , doc (showString "->") , prt 0 exp])
- ETType exp0 exp -> prPrec i 0 (concatD [prt 3 exp0 , doc (showString "=>") , prt 0 exp])
- ELet locdefs exp -> prPrec i 0 (concatD [doc (showString "let") , doc (showString "{") , prt 0 locdefs , doc (showString "}") , doc (showString "in") , prt 0 exp])
- ELetb locdefs exp -> prPrec i 0 (concatD [doc (showString "let") , prt 0 locdefs , doc (showString "in") , prt 0 exp])
- EWhere exp locdefs -> prPrec i 0 (concatD [prt 3 exp , doc (showString "where") , doc (showString "{") , prt 0 locdefs , doc (showString "}")])
- EEqs equations -> prPrec i 0 (concatD [doc (showString "fn") , doc (showString "{") , prt 0 equations , doc (showString "}")])
- EExample exp str -> prPrec i 0 (concatD [doc (showString "in") , prt 5 exp , prt 0 str])
- ELString lstring -> prPrec i 6 (concatD [prt 0 lstring])
- ELin pident -> prPrec i 4 (concatD [doc (showString "Lin") , prt 0 pident])
-
- prtList es = case es of
- [] -> (concatD [])
- [x] -> (concatD [prt 0 x])
- x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
-
-instance Print Exps where
- prt i e = case e of
- NilExp -> prPrec i 0 (concatD [])
- ConsExp exp exps -> prPrec i 0 (concatD [prt 6 exp , prt 0 exps])
-
-
-instance Print Patt where
- prt i e = case e of
- PChar -> prPrec i 2 (concatD [doc (showString "?")])
- PChars str -> prPrec i 2 (concatD [doc (showString "[") , prt 0 str , doc (showString "]")])
- PMacro pident -> prPrec i 2 (concatD [doc (showString "#") , prt 0 pident])
- PM pident0 pident -> prPrec i 2 (concatD [doc (showString "#") , prt 0 pident0 , doc (showString ".") , prt 0 pident])
- PW -> prPrec i 2 (concatD [doc (showString "_")])
- PV pident -> prPrec i 2 (concatD [prt 0 pident])
- PCon pident -> prPrec i 2 (concatD [doc (showString "{") , prt 0 pident , doc (showString "}")])
- PQ pident0 pident -> prPrec i 2 (concatD [prt 0 pident0 , doc (showString ".") , prt 0 pident])
- PInt n -> prPrec i 2 (concatD [prt 0 n])
- PFloat d -> prPrec i 2 (concatD [prt 0 d])
- PStr str -> prPrec i 2 (concatD [prt 0 str])
- PR pattasss -> prPrec i 2 (concatD [doc (showString "{") , prt 0 pattasss , doc (showString "}")])
- PTup patttuplecomps -> prPrec i 2 (concatD [doc (showString "<") , prt 0 patttuplecomps , doc (showString ">")])
- PC pident patts -> prPrec i 1 (concatD [prt 0 pident , prt 0 patts])
- PQC pident0 pident patts -> prPrec i 1 (concatD [prt 0 pident0 , doc (showString ".") , prt 0 pident , prt 0 patts])
- PDisj patt0 patt -> prPrec i 0 (concatD [prt 0 patt0 , doc (showString "|") , prt 1 patt])
- PSeq patt0 patt -> prPrec i 0 (concatD [prt 0 patt0 , doc (showString "+") , prt 1 patt])
- PRep patt -> prPrec i 1 (concatD [prt 2 patt , doc (showString "*")])
- PAs pident patt -> prPrec i 1 (concatD [prt 0 pident , doc (showString "@") , prt 2 patt])
- PNeg patt -> prPrec i 1 (concatD [doc (showString "-") , prt 2 patt])
-
- prtList es = case es of
- [x] -> (concatD [prt 2 x])
- x:xs -> (concatD [prt 2 x , prt 0 xs])
-
-instance Print PattAss where
- prt i e = case e of
- PA pidents patt -> prPrec i 0 (concatD [prt 0 pidents , doc (showString "=") , prt 0 patt])
-
- prtList es = case es of
- [] -> (concatD [])
- [x] -> (concatD [prt 0 x])
- x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
-
-instance Print Label where
- prt i e = case e of
- LIdent pident -> prPrec i 0 (concatD [prt 0 pident])
- LVar n -> prPrec i 0 (concatD [doc (showString "$") , prt 0 n])
-
-
-instance Print Sort where
- prt i e = case e of
- Sort_Type -> prPrec i 0 (concatD [doc (showString "Type")])
- Sort_PType -> prPrec i 0 (concatD [doc (showString "PType")])
- Sort_Tok -> prPrec i 0 (concatD [doc (showString "Tok")])
- Sort_Str -> prPrec i 0 (concatD [doc (showString "Str")])
- Sort_Strs -> prPrec i 0 (concatD [doc (showString "Strs")])
-
-
-instance Print Bind where
- prt i e = case e of
- BIdent pident -> prPrec i 0 (concatD [prt 0 pident])
- BWild -> prPrec i 0 (concatD [doc (showString "_")])
-
- prtList es = case es of
- [] -> (concatD [])
- [x] -> (concatD [prt 0 x])
- x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
-
-instance Print Decl where
- prt i e = case e of
- DDec binds exp -> prPrec i 0 (concatD [doc (showString "(") , prt 0 binds , doc (showString ":") , prt 0 exp , doc (showString ")")])
- DExp exp -> prPrec i 0 (concatD [prt 4 exp])
-
-
-instance Print TupleComp where
- prt i e = case e of
- TComp exp -> prPrec i 0 (concatD [prt 0 exp])
-
- prtList es = case es of
- [] -> (concatD [])
- [x] -> (concatD [prt 0 x])
- x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
-
-instance Print PattTupleComp where
- prt i e = case e of
- PTComp patt -> prPrec i 0 (concatD [prt 0 patt])
-
- prtList es = case es of
- [] -> (concatD [])
- [x] -> (concatD [prt 0 x])
- x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
-
-instance Print Case where
- prt i e = case e of
- Case patt exp -> prPrec i 0 (concatD [prt 0 patt , doc (showString "=>") , prt 0 exp])
-
- prtList es = case es of
- [x] -> (concatD [prt 0 x])
- x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
-
-instance Print Equation where
- prt i e = case e of
- Equ patts exp -> prPrec i 0 (concatD [prt 0 patts , doc (showString "->") , prt 0 exp])
-
- prtList es = case es of
- [] -> (concatD [])
- [x] -> (concatD [prt 0 x])
- x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
-
-instance Print Altern where
- prt i e = case e of
- Alt exp0 exp -> prPrec i 0 (concatD [prt 0 exp0 , doc (showString "/") , prt 0 exp])
-
- prtList es = case es of
- [] -> (concatD [])
- [x] -> (concatD [prt 0 x])
- x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
-
-instance Print DDecl where
- prt i e = case e of
- DDDec binds exp -> prPrec i 0 (concatD [doc (showString "(") , prt 0 binds , doc (showString ":") , prt 0 exp , doc (showString ")")])
- DDExp exp -> prPrec i 0 (concatD [prt 6 exp])
-
- prtList es = case es of
- [] -> (concatD [])
- x:xs -> (concatD [prt 0 x , prt 0 xs])
-
-instance Print OldGrammar where
- prt i e = case e of
- OldGr include topdefs -> prPrec i 0 (concatD [prt 0 include , prt 0 topdefs])
-
-
-instance Print Include where
- prt i e = case e of
- NoIncl -> prPrec i 0 (concatD [])
- Incl filenames -> prPrec i 0 (concatD [doc (showString "include") , prt 0 filenames])
-
-
-instance Print FileName where
- prt i e = case e of
- FString str -> prPrec i 0 (concatD [prt 0 str])
- FIdent pident -> prPrec i 0 (concatD [prt 0 pident])
- FSlash filename -> prPrec i 0 (concatD [doc (showString "/") , prt 0 filename])
- FDot filename -> prPrec i 0 (concatD [doc (showString ".") , prt 0 filename])
- FMinus filename -> prPrec i 0 (concatD [doc (showString "-") , prt 0 filename])
- FAddId pident filename -> prPrec i 0 (concatD [prt 0 pident , prt 0 filename])
-
- prtList es = case es of
- [x] -> (concatD [prt 0 x , doc (showString ";")])
- x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
-
-
diff --git a/src/GF/Source/SourceToGrammar.hs b/src/GF/Source/SourceToGrammar.hs
deleted file mode 100644
index 21d670768..000000000
--- a/src/GF/Source/SourceToGrammar.hs
+++ /dev/null
@@ -1,733 +0,0 @@
-----------------------------------------------------------------------
--- |
--- Module : SourceToGrammar
--- Maintainer : AR
--- Stability : (stable)
--- Portability : (portable)
---
--- > CVS $Date: 2005/10/04 11:05:07 $
--- > CVS $Author: aarne $
--- > CVS $Revision: 1.28 $
---
--- based on the skeleton Haskell module generated by the BNF converter
------------------------------------------------------------------------------
-
-module GF.Source.SourceToGrammar ( transGrammar,
- transInclude,
- transModDef,
- transOldGrammar,
- transExp,
- newReservedWords
- ) where
-
-import qualified GF.Grammar.Grammar as G
-import qualified GF.Grammar.PrGrammar as GP
-import qualified GF.Infra.Modules as GM
-import qualified GF.Grammar.Macros as M
-import qualified GF.Compile.Update as U
-import qualified GF.Infra.Option as GO
-import qualified GF.Compile.ModDeps as GD
-import GF.Grammar.Predef
-import GF.Infra.Ident
-import GF.Source.AbsGF
-import GF.Source.PrintGF
-import GF.Data.Operations
-import GF.Infra.Option
-
-import Control.Monad
-import Data.Char
-import Data.List (genericReplicate)
-import qualified Data.ByteString.Char8 as BS
-
--- based on the skeleton Haskell module generated by the BNF converter
-
-type Result = Err String
-
-failure :: Show a => a -> Err b
-failure x = Bad $ "Undefined case: " ++ show x
-
-getIdentPos :: PIdent -> Err (Ident,Int)
-getIdentPos x = case x of
- PIdent ((line,_),c) -> return (IC c,line)
-
-transIdent :: PIdent -> Err Ident
-transIdent = liftM fst . getIdentPos
-
-transName :: Name -> Err Ident
-transName n = case n of
- IdentName i -> transIdent i
- ListName i -> liftM mkListId (transIdent i)
-
-transNamePos :: Name -> Err (Ident,Int)
-transNamePos n = case n of
- IdentName i -> getIdentPos i
- ListName i -> liftM (\ (c,p) -> (mkListId c,p)) (getIdentPos i)
-
-transGrammar :: Grammar -> Err G.SourceGrammar
-transGrammar x = case x of
- Gr moddefs -> do
- moddefs' <- mapM transModDef moddefs
- GD.mkSourceGrammar moddefs'
-
-transModDef :: ModDef -> Err G.SourceModule
-transModDef x = case x of
-
- MModule compl mtyp body -> do
-
- let mstat' = transComplMod compl
-
- (trDef, mtyp', id') <- case mtyp of
- MTAbstract id -> do
- id' <- transIdent id
- return (transAbsDef, GM.MTAbstract, id')
- MTResource id -> mkModRes id GM.MTResource body
- MTConcrete id open -> do
- id' <- transIdent id
- open' <- transIdent open
- return (transCncDef, GM.MTConcrete open', id')
- MTTransfer id a b -> do
- id' <- transIdent id
- a' <- transOpen a
- b' <- transOpen a
- return (transAbsDef, GM.MTTransfer a' b', id')
- MTInterface id -> mkModRes id GM.MTInterface body
- MTInstance id open -> do
- open' <- transIdent open
- mkModRes id (GM.MTInstance open') body
-
- mkBody (mstat', trDef, mtyp', id') body
- where
- poss = emptyBinTree ----
-
- mkBody xx@(mstat', trDef, mtyp', id') bod = case bod of
- MNoBody incls -> do
- mkBody xx $ MBody (Ext incls) NoOpens []
- MBody extends opens defs -> do
- extends' <- transExtend extends
- opens' <- transOpens opens
- defs0 <- mapM trDef $ getTopDefs defs
- poss0 <- return [(i,p) | Left ds <- defs0, (i,p,_) <- ds]
- defs' <- U.buildAnyTree id' [(i,d) | Left ds <- defs0, (i,_,d) <- ds]
- flags' <- return $ concatOptions [o | Right o <- defs0]
- let poss1 = buildPosTree id' poss0
- return (id', GM.ModInfo mtyp' mstat' flags' extends' Nothing opens' [] defs' poss1)
-
- MWith m insts -> mkBody xx $ MWithEBody [] m insts NoOpens []
- MWithBody m insts opens defs -> mkBody xx $ MWithEBody [] m insts opens defs
- MWithE extends m insts -> mkBody xx $ MWithEBody extends m insts NoOpens []
- MWithEBody extends m insts opens defs -> do
- extends' <- mapM transIncludedExt extends
- m' <- transIncludedExt m
- insts' <- mapM transInst insts
- opens' <- transOpens opens
- defs0 <- mapM trDef $ getTopDefs defs
- poss0 <- return [(i,p) | Left ds <- defs0, (i,p,_) <- ds]
- defs' <- U.buildAnyTree id' [(i,d) | Left ds <- defs0, (i,_,d) <- ds]
- flags' <- return $ concatOptions [o | Right o <- defs0]
- let poss1 = buildPosTree id' poss0
- return (id', GM.ModInfo mtyp' mstat' flags' extends' (Just (fst m',snd m',insts')) opens' [] defs' poss1)
-
- mkModRes id mtyp body = do
- id' <- transIdent id
- return (transResDef, mtyp, id')
-
-
-transComplMod :: ComplMod -> GM.ModuleStatus
-transComplMod x = case x of
- CMCompl -> GM.MSComplete
- CMIncompl -> GM.MSIncomplete
-
-getTopDefs :: [TopDef] -> [TopDef]
-getTopDefs x = x
-
-transConcExp :: ConcExp ->
- Err (Ident, Maybe (GM.OpenSpec Ident),Maybe (GM.OpenSpec Ident))
-transConcExp x = case x of
- ConcExp id transfers -> do
- id' <- transIdent id
- trs <- mapM transTransfer transfers
- tin <- case [o | Left o <- trs] of
- [o] -> return $ Just o
- [] -> return $ Nothing
- _ -> Bad "ambiguous transfer in"
- tout <- case [o | Right o <- trs] of
- [o] -> return $ Just o
- [] -> return $ Nothing
- _ -> Bad "ambiguous transfer out"
- return (id',tin,tout)
-
-transTransfer :: Transfer ->
- Err (Either (GM.OpenSpec Ident)(GM.OpenSpec Ident))
-transTransfer x = case x of
- TransferIn open -> liftM Left $ transOpen open
- TransferOut open -> liftM Right $ transOpen open
-
-transExtend :: Extend -> Err [(Ident,GM.MInclude Ident)]
-transExtend x = case x of
- Ext ids -> mapM transIncludedExt ids
- NoExt -> return []
-
-transOpens :: Opens -> Err [GM.OpenSpec Ident]
-transOpens x = case x of
- NoOpens -> return []
- OpenIn opens -> mapM transOpen opens
-
-transOpen :: Open -> Err (GM.OpenSpec Ident)
-transOpen x = case x of
- OName id -> liftM GM.OSimple (transIdent id)
- OQualQO q id -> liftM GM.OSimple (transIdent id)
- OQual q id m -> liftM2 GM.OQualif (transIdent id) (transIdent m)
-
-transInst :: Open -> Err (Ident,Ident)
-transInst x = case x of
- OQual q id m -> liftM2 (,) (transIdent id) (transIdent m)
- _ -> Bad "qualified open expected"
-
-transIncluded :: Included -> Err (Ident,[Ident])
-transIncluded x = case x of
- IAll i -> liftM (flip (curry id) []) $ transIdent i
- ISome i ids -> liftM2 (curry id) (transIdent i) (mapM transIdent ids)
- IMinus i ids -> liftM2 (curry id) (transIdent i) (mapM transIdent ids) ----
-
-transIncludedExt :: Included -> Err (Ident, GM.MInclude Ident)
-transIncludedExt x = case x of
- IAll i -> liftM2 (,) (transIdent i) (return GM.MIAll)
- ISome i ids -> liftM2 (,) (transIdent i) (liftM GM.MIOnly $ mapM transIdent ids)
- IMinus i ids -> liftM2 (,) (transIdent i) (liftM GM.MIExcept $ mapM transIdent ids)
-
---- where no position is saved
-nopos :: Int
-nopos = -1
-
-buildPosTree :: Ident -> [(Ident,Int)] -> BinTree Ident (String,(Int,Int))
-buildPosTree m = buildTree . mkPoss . filter ((>0) . snd) where
- mkPoss cs = case cs of
- (i,p):rest@((_,q):_) -> (i,(name,(p,max p (q-1)))) : mkPoss rest
- (i,p):[] -> (i,(name,(p,p+100))) : [] --- don't know last line
- _ -> []
- name = showIdent m ++ ".gf" ----
-
-transAbsDef :: TopDef -> Err (Either [(Ident, Int, G.Info)] GO.Options)
-transAbsDef x = case x of
- DefCat catdefs -> liftM (Left . concat) $ mapM transCatDef catdefs
- DefFun fundefs -> do
- fundefs' <- mapM transFunDef fundefs
- returnl [(fun, nopos, G.AbsFun (Just typ) Nothing) | (funs,typ) <- fundefs', fun <- funs]
- DefFunData fundefs -> do
- fundefs' <- mapM transFunDef fundefs
- returnl $
- [(cat, nopos, G.AbsCat Nothing (Just [G.Cn fun])) | (funs,typ) <- fundefs',
- fun <- funs,
- Ok (_,cat) <- [M.valCat typ]
- ] ++
- [(fun, nopos, G.AbsFun (Just typ) (Just G.EData)) | (funs,typ) <- fundefs', fun <- funs]
- DefDef defs -> do
- defs' <- liftM concat $ mapM getDefsGen defs
- returnl [(c, nopos, G.AbsFun Nothing pe) | ((c,p),(_,pe)) <- defs']
- DefData ds -> do
- ds' <- mapM transDataDef ds
- returnl $
- [(c, nopos, G.AbsCat Nothing (Just ps)) | (c,ps) <- ds'] ++
- [(f, nopos, G.AbsFun Nothing (Just G.EData)) | (_,fs) <- ds', tf <- fs, f <- funs tf]
- DefFlag defs -> liftM (Right . concatOptions) $ mapM transFlagDef defs
- _ -> Bad $ "illegal definition in abstract module:" ++++ printTree x
- where
- -- to get data constructors as terms
- funs t = case t of
- G.Cn f -> [f]
- G.Q _ f -> [f]
- G.QC _ f -> [f]
- _ -> []
-
-returnl :: a -> Err (Either a b)
-returnl = return . Left
-
-transFlagDef :: FlagDef -> Err GO.Options
-transFlagDef x = case x of
- FlagDef f x -> parseModuleOptions ["--" ++ prPIdent f ++ "=" ++ prPIdent x]
- where
- prPIdent (PIdent (_,c)) = BS.unpack c
-
-
--- | Cat definitions can also return some fun defs
--- if it is a list category definition
-transCatDef :: CatDef -> Err [(Ident, Int, G.Info)]
-transCatDef x = case x of
- SimpleCatDef id ddecls -> do
- (id',pos) <- getIdentPos id
- liftM (:[]) $ cat id' pos ddecls
- ListCatDef id ddecls -> listCat id ddecls 0
- ListSizeCatDef id ddecls size -> listCat id ddecls size
- where
- cat i pos ddecls = do
- -- i <- transIdent id
- cont <- liftM concat $ mapM transDDecl ddecls
- return (i, pos, G.AbsCat (Just cont) Nothing)
- listCat id ddecls size = do
- (id',pos) <- getIdentPos id
- let
- li = mkListId id'
- baseId = mkBaseId id'
- consId = mkConsId id'
- catd0@(c,p,G.AbsCat (Just cont0) _) <- cat li pos ddecls
- let
- catd = (c,pos,G.AbsCat (Just cont0) (Just [G.Cn baseId,G.Cn consId]))
- cont = [(mkId x i,ty) | (i,(x,ty)) <- zip [0..] cont0]
- xs = map (G.Vr . fst) cont
- cd = M.mkDecl (M.mkApp (G.Vr id') xs)
- lc = M.mkApp (G.Vr li) xs
- niltyp = M.mkProdSimple (cont ++ genericReplicate size cd) lc
- nilfund = (baseId, nopos, G.AbsFun (Just niltyp) (Just G.EData))
- constyp = M.mkProdSimple (cont ++ [cd, M.mkDecl lc]) lc
- consfund = (consId, nopos, G.AbsFun (Just constyp) (Just G.EData))
- return [catd,nilfund,consfund]
- mkId x i = if isWildIdent x then (varX i) else x
-
-transFunDef :: FunDef -> Err ([Ident], G.Type)
-transFunDef x = case x of
- FunDef ids typ -> liftM2 (,) (mapM transIdent ids) (transExp typ)
-
-transDataDef :: DataDef -> Err (Ident,[G.Term])
-transDataDef x = case x of
- DataDef id ds -> liftM2 (,) (transIdent id) (mapM transData ds)
- where
- transData d = case d of
- DataId id -> liftM G.Cn $ transIdent id
- DataQId id0 id -> liftM2 G.QC (transIdent id0) (transIdent id)
-
-transResDef :: TopDef -> Err (Either [(Ident, Int, G.Info)] GO.Options)
-transResDef x = case x of
- DefPar pardefs -> do
- pardefs' <- mapM transParDef pardefs
- returnl $ [(p, nopos, G.ResParam (if null pars
- then Nothing -- abstract param type
- else (Just (pars,Nothing))))
- | (p,pars) <- pardefs']
- ++ [(f, nopos, G.ResValue (Just (M.mkProdSimple co (G.Cn p),Nothing))) |
- (p,pars) <- pardefs', (f,co) <- pars]
-
- DefOper defs -> do
- defs' <- liftM concat $ mapM getDefs defs
- returnl $
- concatMap mkOverload [(f, p, G.ResOper pt pe) | ((f,p),(pt,pe)) <- defs']
-
- DefLintype defs -> do
- defs' <- liftM concat $ mapM getDefs defs
- returnl [(f, p, G.ResOper pt pe) | ((f,p),(pt,pe)) <- defs']
-
- DefFlag defs -> liftM (Right . concatOptions) $ mapM transFlagDef defs
- _ -> Bad $ "illegal definition form in resource" +++ printTree x
- where
- mkOverload op@(c,p,j) = case j of
- G.ResOper _ (Just df) -> case M.appForm df of
- (keyw, ts@(_:_)) | isOverloading keyw -> case last ts of
- G.R fs ->
- [(c,p,G.ResOverload [m | G.Vr m <- ts] [(ty,fu) | (_,(Just ty,fu)) <- fs])]
- _ -> [op]
- _ -> [op]
-
- -- to enable separare type signature --- not type-checked
- G.ResOper (Just df) _ -> case M.appForm df of
- (keyw, ts@(_:_)) | isOverloading keyw -> case last ts of
- G.RecType _ -> []
- _ -> [op]
- _ -> [op]
- _ -> [(c,p,j)]
- isOverloading keyw =
- GP.prt keyw == "overload" -- overload is a "soft keyword"
- isRec t = case t of
- G.R _ -> True
- _ -> False
-
-transParDef :: ParDef -> Err (Ident, [G.Param])
-transParDef x = case x of
- ParDefDir id params -> liftM2 (,) (transIdent id) (mapM transParConstr params)
- ParDefAbs id -> liftM2 (,) (transIdent id) (return [])
- _ -> Bad $ "illegal definition in resource:" ++++ printTree x
-
-transCncDef :: TopDef -> Err (Either [(Ident, Int, G.Info)] GO.Options)
-transCncDef x = case x of
- DefLincat defs -> do
- defs' <- liftM concat $ mapM transPrintDef defs
- returnl [(f, nopos, G.CncCat (Just t) Nothing Nothing) | (f,t) <- defs']
- DefLindef defs -> do
- defs' <- liftM concat $ mapM getDefs defs
- returnl [(f, p, G.CncCat pt pe Nothing) | ((f,p),(pt,pe)) <- defs']
- DefLin defs -> do
- defs' <- liftM concat $ mapM getDefs defs
- returnl [(f, p, G.CncFun Nothing pe Nothing) | ((f,p),(_,pe)) <- defs']
- DefPrintCat defs -> do
- defs' <- liftM concat $ mapM transPrintDef defs
- returnl [(f, nopos, G.CncCat Nothing Nothing (Just e)) | (f,e) <- defs']
- DefPrintFun defs -> do
- defs' <- liftM concat $ mapM transPrintDef defs
- returnl [(f, nopos, G.CncFun Nothing Nothing (Just e)) | (f,e) <- defs']
- DefPrintOld defs -> do --- a guess, for backward compatibility
- defs' <- liftM concat $ mapM transPrintDef defs
- returnl [(f, nopos, G.CncFun Nothing Nothing (Just e)) | (f,e) <- defs']
- DefFlag defs -> liftM (Right . concatOptions) $ mapM transFlagDef defs
- DefPattern defs -> do
- defs' <- liftM concat $ mapM getDefs defs
- let defs2 = [(f, termInPattern t) | (f,(_,Just t)) <- defs']
- returnl [(f, p, G.CncFun Nothing (Just t) Nothing) | ((f,p),t) <- defs2]
-
- _ -> errIn ("illegal definition in concrete syntax:") $ transResDef x
-
-transPrintDef :: PrintDef -> Err [(Ident,G.Term)]
-transPrintDef x = case x of
- PrintDef ids exp -> do
- (ids,e) <- liftM2 (,) (mapM transName ids) (transExp exp)
- return $ [(i,e) | i <- ids]
-
-getDefsGen :: Def -> Err [((Ident, Int),(Maybe G.Type, Maybe G.Term))]
-getDefsGen d = case d of
- DDecl ids t -> do
- ids' <- mapM transNamePos ids
- t' <- transExp t
- return [(i,(Just t', Nothing)) | i <- ids']
- DDef ids e -> do
- ids' <- mapM transNamePos ids
- e' <- transExp e
- return [(i,(Nothing, Just e')) | i <- ids']
- DFull ids t e -> do
- ids' <- mapM transNamePos ids
- t' <- transExp t
- e' <- transExp e
- return [(i,(Just t', Just e')) | i <- ids']
- DPatt id patts e -> do
- id' <- transNamePos id
- ps' <- mapM transPatt patts
- e' <- transExp e
- return [(id',(Nothing, Just (G.Eqs [(ps',e')])))]
-
--- | sometimes you need this special case, e.g. in linearization rules
-getDefs :: Def -> Err [((Ident,Int), (Maybe G.Type, Maybe G.Term))]
-getDefs d = case d of
- DPatt id patts e -> do
- id' <- transNamePos id
- xs <- mapM tryMakeVar patts
- e' <- transExp e
- return [(id',(Nothing, Just (M.mkAbs xs e')))]
- _ -> getDefsGen d
-
--- | accepts a pattern that is either a variable or a wild card
-tryMakeVar :: Patt -> Err Ident
-tryMakeVar p = do
- p' <- transPatt p
- case p' of
- G.PV i -> return i
- G.PW -> return identW
- _ -> Bad $ "not a legal pattern in lambda binding" +++ GP.prt p'
-
-transExp :: Exp -> Err G.Term
-transExp x = case x of
- EIdent id -> liftM G.Vr $ transIdent id
- EConstr id -> liftM G.Con $ transIdent id
- ECons id -> liftM G.Cn $ transIdent id
- EQConstr m c -> liftM2 G.QC (transIdent m) (transIdent c)
- EQCons m c -> liftM2 G.Q (transIdent m) (transIdent c)
- EString str -> return $ G.K str
- ESort sort -> return $ G.Sort $ transSort sort
- EInt n -> return $ G.EInt n
- EFloat n -> return $ G.EFloat n
- EMeta -> return $ G.Meta $ M.int2meta 0
- EEmpty -> return G.Empty
- -- [ C x_1 ... x_n ] becomes (ListC x_1 ... x_n)
- EList i es -> do
- i' <- transIdent i
- es' <- mapM transExp (exps2list es)
- return $ foldl G.App (G.Vr (mkListId i')) es'
- EStrings [] -> return G.Empty
- EStrings str -> return $ foldr1 G.C $ map G.K $ words str
- ERecord defs -> erecord2term defs
- ETupTyp _ _ -> do
- let tups t = case t of
- ETupTyp x y -> tups x ++ [y] -- right-associative parsing
- _ -> [t]
- es <- mapM transExp $ tups x
- return $ G.RecType $ M.tuple2recordType es
- ETuple tuplecomps -> do
- es <- mapM transExp [e | TComp e <- tuplecomps]
- return $ G.R $ M.tuple2record es
- EProj exp id -> liftM2 G.P (transExp exp) (trLabel id)
- EApp exp0 exp -> liftM2 G.App (transExp exp0) (transExp exp)
- ETable cases -> liftM (G.T G.TRaw) (transCases cases)
- ETTable exp cases ->
- liftM2 (\t c -> G.T (G.TTyped t) c) (transExp exp) (transCases cases)
- EVTable exp cases ->
- liftM2 (\t c -> G.V t c) (transExp exp) (mapM transExp cases)
- ECase exp cases -> do
- exp' <- transExp exp
- cases' <- transCases cases
- let annot = case exp' of
- G.Typed _ t -> G.TTyped t
- _ -> G.TRaw
- return $ G.S (G.T annot cases') exp'
- ECTable binds exp -> liftM2 M.mkCTable (mapM transBind binds) (transExp exp)
-
- EVariants exps -> liftM G.FV $ mapM transExp exps
- EVariant exp0 exp -> do let fvList (G.FV xs) = xs
- fvList t = [t]
- exp0' <- transExp exp0
- exp' <- transExp exp
- return $ G.FV $ fvList exp0' ++ fvList exp'
- EPre exp alts -> liftM2 (curry G.Alts) (transExp exp) (mapM transAltern alts)
- EStrs exps -> liftM G.Strs $ mapM transExp exps
- ESelect exp0 exp -> liftM2 G.S (transExp exp0) (transExp exp)
- EExtend exp0 exp -> liftM2 G.ExtR (transExp exp0) (transExp exp)
- EAbstr binds exp -> liftM2 M.mkAbs (mapM transBind binds) (transExp exp)
- ETyped exp0 exp -> liftM2 G.Typed (transExp exp0) (transExp exp)
- EExample exp str -> liftM2 G.Example (transExp exp) (return str)
-
- EProd decl exp -> liftM2 M.mkProdSimple (transDecl decl) (transExp exp)
- ETType exp0 exp -> liftM2 G.Table (transExp exp0) (transExp exp)
- EConcat exp0 exp -> liftM2 G.C (transExp exp0) (transExp exp)
- EGlue exp0 exp -> liftM2 G.Glue (transExp exp0) (transExp exp)
- ELet defs exp -> do
- exp' <- transExp exp
- defs0 <- mapM locdef2fields defs
- defs' <- mapM tryLoc $ concat defs0
- return $ M.mkLet defs' exp'
- where
- tryLoc (c,(mty,Just e)) = return (c,(mty,e))
- tryLoc (c,_) = Bad $ "local definition of" +++ GP.prt c +++ "without value"
- ELetb defs exp -> transExp $ ELet defs exp
- EWhere exp defs -> transExp $ ELet defs exp
-
- EPattType typ -> liftM G.EPattType (transExp typ)
- EPatt patt -> liftM G.EPatt (transPatt patt)
-
- ELString (LString str) -> return $ G.K (BS.unpack str) -- use the grammar encoding here
-
- EEqs eqs -> liftM G.Eqs $ mapM transEquation eqs
-
- _ -> Bad $ "translation not yet defined for" +++ printTree x ----
-
-exps2list :: Exps -> [Exp]
-exps2list NilExp = []
-exps2list (ConsExp e es) = e : exps2list es
-
---- this is complicated: should we change Exp or G.Term ?
-
-erecord2term :: [LocDef] -> Err G.Term
-erecord2term ds = do
- ds' <- mapM locdef2fields ds
- mkR $ concat ds'
- where
- mkR fs = do
- fs' <- transF fs
- return $ case fs' of
- Left ts -> G.RecType ts
- Right ds -> G.R ds
- transF [] = return $ Left [] --- empty record always interpreted as record type
- transF fs@(f:_) = case f of
- (lab,(Just ty,Nothing)) -> mapM tryRT fs >>= return . Left
- _ -> mapM tryR fs >>= return . Right
- tryRT f = case f of
- (lab,(Just ty,Nothing)) -> return (G.ident2label lab,ty)
- _ -> Bad $ "illegal record type field" +++ GP.prt (fst f) --- manifest fields ?!
- tryR f = case f of
- (lab,(mty, Just t)) -> return (G.ident2label lab,(mty,t))
- _ -> Bad $ "illegal record field" +++ GP.prt (fst f)
-
-
-locdef2fields :: LocDef -> Err [(Ident, (Maybe G.Type, Maybe G.Type))]
-locdef2fields d = case d of
- LDDecl ids t -> do
- labs <- mapM transIdent ids
- t' <- transExp t
- return [(lab,(Just t',Nothing)) | lab <- labs]
- LDDef ids e -> do
- labs <- mapM transIdent ids
- e' <- transExp e
- return [(lab,(Nothing, Just e')) | lab <- labs]
- LDFull ids t e -> do
- labs <- mapM transIdent ids
- t' <- transExp t
- e' <- transExp e
- return [(lab,(Just t', Just e')) | lab <- labs]
-
-trLabel :: Label -> Err G.Label
-trLabel x = case x of
- LIdent (PIdent (_, s)) -> return $ G.LIdent s
- LVar x -> return $ G.LVar $ fromInteger x
-
-transSort :: Sort -> Ident
-transSort Sort_Type = cType
-transSort Sort_PType = cPType
-transSort Sort_Tok = cTok
-transSort Sort_Str = cStr
-transSort Sort_Strs = cStrs
-
-
-{-
---- no more used 7/1/2006 AR
-transPatts :: Patt -> Err [G.Patt]
-transPatts p = case p of
- PDisj p1 p2 -> liftM2 (++) (transPatts p1) (transPatts p2)
- PC id patts -> liftM (map (G.PC id) . combinations) $ mapM transPatts patts
- PQC q id patts -> liftM (map (G.PP q id) . combinations) (mapM transPatts patts)
-
- PR pattasss -> do
- let (lss,ps) = unzip [(ls,p) | PA ls p <- pattasss]
- ls = map LIdent $ concat lss
- ps0 <- mapM transPatts ps
- let ps' = combinations ps0
- lss' <- mapM trLabel ls
- let rss = map (zip lss') ps'
- return $ map G.PR rss
- PTup pcs -> do
- ps0 <- mapM transPatts [e | PTComp e <- pcs]
- let ps' = combinations ps0
- return $ map (G.PR . M.tuple2recordPatt) ps'
- _ -> liftM singleton $ transPatt p
--}
-
-transPatt :: Patt -> Err G.Patt
-transPatt x = case x of
- PW -> return G.PW
- PV id -> liftM G.PV $ transIdent id
- PC id patts -> liftM2 G.PC (transIdent id) (mapM transPatt patts)
- PCon id -> liftM2 G.PC (transIdent id) (return [])
- PInt n -> return $ G.PInt n
- PFloat n -> return $ G.PFloat n
- PStr str -> return $ G.PString str
- PR pattasss -> do
- let (lss,ps) = unzip [(ls,p) | PA ls p <- pattasss]
- ls = map LIdent $ concat lss
- liftM G.PR $ liftM2 zip (mapM trLabel ls) (mapM transPatt ps)
- PTup pcs ->
- liftM (G.PR . M.tuple2recordPatt) (mapM transPatt [e | PTComp e <- pcs])
- PQ id0 id -> liftM3 G.PP (transIdent id0) (transIdent id) (return [])
- PQC id0 id patts ->
- liftM3 G.PP (transIdent id0) (transIdent id) (mapM transPatt patts)
- PDisj p1 p2 -> liftM2 G.PAlt (transPatt p1) (transPatt p2)
- PSeq p1 p2 -> liftM2 G.PSeq (transPatt p1) (transPatt p2)
- PRep p -> liftM G.PRep (transPatt p)
- PNeg p -> liftM G.PNeg (transPatt p)
- PAs x p -> liftM2 G.PAs (transIdent x) (transPatt p)
- PChar -> return G.PChar
- PChars s -> return $ G.PChars s
- PMacro c -> liftM G.PMacro $ transIdent c
- PM m c -> liftM2 G.PM (transIdent m) (transIdent c)
-
-transBind :: Bind -> Err Ident
-transBind x = case x of
- BIdent id -> transIdent id
- BWild -> return identW
-
-transDecl :: Decl -> Err [G.Decl]
-transDecl x = case x of
- DDec binds exp -> do
- xs <- mapM transBind binds
- exp' <- transExp exp
- return [(x,exp') | x <- xs]
- DExp exp -> liftM (return . M.mkDecl) $ transExp exp
-
-transCases :: [Case] -> Err [G.Case]
-transCases = mapM transCase
-
-transCase :: Case -> Err G.Case
-transCase (Case p exp) = do
- patt <- transPatt p
- exp' <- transExp exp
- return (patt,exp')
-
-transEquation :: Equation -> Err G.Equation
-transEquation x = case x of
- Equ apatts exp -> liftM2 (,) (mapM transPatt apatts) (transExp exp)
-
-transAltern :: Altern -> Err (G.Term, G.Term)
-transAltern x = case x of
- Alt exp0 exp -> liftM2 (,) (transExp exp0) (transExp exp)
-
-transParConstr :: ParConstr -> Err G.Param
-transParConstr x = case x of
- ParConstr id ddecls -> do
- id' <- transIdent id
- ddecls' <- mapM transDDecl ddecls
- return (id',concat ddecls')
-
-transDDecl :: DDecl -> Err [G.Decl]
-transDDecl x = case x of
- DDDec binds exp -> transDecl $ DDec binds exp
- DDExp exp -> transDecl $ DExp exp
-
--- | to deal with the old format, sort judgements in two modules, forming
--- their names from a given string, e.g. file name or overriding user-given string
-transOldGrammar :: Options -> FilePath -> OldGrammar -> Err G.SourceGrammar
-transOldGrammar opts name0 x = case x of
- OldGr includes topdefs -> do --- includes must be collected separately
- let moddefs = sortTopDefs topdefs
- transGrammar $ Gr moddefs
- where
- sortTopDefs ds = [mkAbs a, mkCnc ops (c ++ r)]
- where
- ops = map fst ps
- (a,r,c,ps) = foldr srt ([],[],[],[]) ds
- srt d (a,r,c,ps) = case d of
- DefCat catdefs -> (d:a,r,c,ps)
- DefFun fundefs -> (d:a,r,c,ps)
- DefFunData fundefs -> (d:a,r,c,ps)
- DefDef defs -> (d:a,r,c,ps)
- DefData pardefs -> (d:a,r,c,ps)
- DefPar pardefs -> (a,d:r,c,ps)
- DefOper defs -> (a,d:r,c,ps)
- DefLintype defs -> (a,d:r,c,ps)
- DefLincat defs -> (a,r,d:c,ps)
- DefLindef defs -> (a,r,d:c,ps)
- DefLin defs -> (a,r,d:c,ps)
- DefPattern defs -> (a,r,d:c,ps)
- DefFlag defs -> (a,r,d:c,ps) --- a guess
- DefPrintCat printdefs -> (a,r,d:c,ps)
- DefPrintFun printdefs -> (a,r,d:c,ps)
- DefPrintOld printdefs -> (a,r,d:c,ps)
- -- DefPackage m ds -> (a,r,c,(m,ds):ps) -- OBSOLETE
- _ -> (a,r,c,ps)
- mkAbs a = MModule q (MTAbstract absName) (MBody ne (OpenIn []) (topDefs a))
- mkCnc ps r = MModule q (MTConcrete cncName absName) (MBody ne (OpenIn []) (topDefs r))
- topDefs t = t
- ne = NoExt
- q = CMCompl
-
- name = maybe name0 (++ ".gf") $ flag optName opts
- absName = identPI $ maybe topic id $ flag optAbsName opts
- resName = identPI $ maybe ("Res" ++ lang) id $ flag optResName opts
- cncName = identPI $ maybe lang id $ flag optCncName opts
-
- identPI s = PIdent ((0,0),BS.pack s)
-
- (beg,rest) = span (/='.') name
- (topic,lang) = case rest of -- to avoid overwriting old files
- ".gf" -> ("Abs" ++ beg,"Cnc" ++ beg)
- ".cf" -> ("Abs" ++ beg,"Cnc" ++ beg)
- ".ebnf" -> ("Abs" ++ beg,"Cnc" ++ beg)
- [] -> ("Abs" ++ beg,"Cnc" ++ beg)
- _:s -> (beg, takeWhile (/='.') s)
-
-transInclude :: Include -> Err [FilePath]
-transInclude x = Bad "Old GF with includes no more supported in GF 3.0"
-
-newReservedWords :: [String]
-newReservedWords =
- words $ "abstract concrete interface incomplete " ++
- "instance out open resource reuse transfer union with where"
-
-termInPattern :: G.Term -> G.Term
-termInPattern t = M.mkAbs xx $ G.R [(s, (Nothing, toP body))] where
- toP t = case t of
- G.Vr x -> G.P t s
- _ -> M.composSafeOp toP t
- s = G.LIdent (BS.pack "s")
- (xx,body) = abss [] t
- abss xs t = case t of
- G.Abs x b -> abss (x:xs) b
- _ -> (reverse xs,t)
-
-mkListId,mkConsId,mkBaseId :: Ident -> Ident
-mkListId = prefixId (BS.pack "List")
-mkConsId = prefixId (BS.pack "Cons")
-mkBaseId = prefixId (BS.pack "Base")
-
-prefixId :: BS.ByteString -> Ident -> Ident
-prefixId pref id = identC (BS.append pref (ident2bs id))
diff --git a/src/GFC.hs b/src/GFC.hs
index 778792878..8037d4f1a 100644
--- a/src/GFC.hs
+++ b/src/GFC.hs
@@ -7,7 +7,7 @@ import PGF.Data
import GF.Compile
import GF.Compile.Export
-import GF.Source.CF ---- should this be on a deeper level? AR 15/10/2008
+import GF.Grammar.CF ---- should this be on a deeper level? AR 15/10/2008
import GF.Infra.UseIO
import GF.Infra.Option
generated by cgit v1.2.3 (git 2.39.1) at 2026-05-20 10:49:21 +0000