From d1a491653cd62b88442811d83178bebce3f142a7 Mon Sep 17 00:00:00 2001 From: aarne Date: Thu, 26 Jun 2008 21:05:50 +0000 Subject: [PATCH] removed Transfer interpreter --- src/Transfer/CompilerAPI.hs | 75 -- src/Transfer/Core/Abs.hs | 267 ---- src/Transfer/Core/Core.cf | 93 -- src/Transfer/Core/Doc.tex | 215 --- src/Transfer/Core/Lex.hs | 343 ----- src/Transfer/Core/Lex.x | 140 -- src/Transfer/Core/Par.hs | 1149 ---------------- src/Transfer/Core/Par.y | 203 --- src/Transfer/Core/Print.hs | 155 --- src/Transfer/Core/Skel.hs | 119 -- src/Transfer/Core/Test.hs | 58 - src/Transfer/ErrM.hs | 16 - src/Transfer/Interpreter.hs | 240 ---- src/Transfer/InterpreterAPI.hs | 39 - src/Transfer/PathUtil.hs | 110 -- src/Transfer/Syntax/Abs.hs | 485 ------- src/Transfer/Syntax/Doc.tex | 333 ----- src/Transfer/Syntax/Layout.hs | 227 ---- src/Transfer/Syntax/Lex.hs | 337 ----- src/Transfer/Syntax/Lex.x | 134 -- src/Transfer/Syntax/Par.hs | 1822 -------------------------- src/Transfer/Syntax/Par.y | 340 ----- src/Transfer/Syntax/Print.hs | 206 --- src/Transfer/Syntax/ResolveLayout.hs | 29 - src/Transfer/Syntax/Skel.hs | 200 --- src/Transfer/Syntax/Syntax.cf | 147 --- src/Transfer/Syntax/Test.hs | 58 - src/Transfer/SyntaxToCore.hs | 766 ----------- 28 files changed, 8306 deletions(-) delete mode 100644 src/Transfer/CompilerAPI.hs delete mode 100644 src/Transfer/Core/Abs.hs delete mode 100644 src/Transfer/Core/Core.cf delete mode 100644 src/Transfer/Core/Doc.tex delete mode 100644 src/Transfer/Core/Lex.hs delete mode 100644 src/Transfer/Core/Lex.x delete mode 100644 src/Transfer/Core/Par.hs delete mode 100644 src/Transfer/Core/Par.y delete mode 100644 src/Transfer/Core/Print.hs delete mode 100644 src/Transfer/Core/Skel.hs delete mode 100644 src/Transfer/Core/Test.hs delete mode 100644 src/Transfer/ErrM.hs delete mode 100644 src/Transfer/Interpreter.hs delete mode 100644 src/Transfer/InterpreterAPI.hs delete mode 100644 src/Transfer/PathUtil.hs delete mode 100644 src/Transfer/Syntax/Abs.hs delete mode 100644 src/Transfer/Syntax/Doc.tex delete mode 100644 src/Transfer/Syntax/Layout.hs delete mode 100644 src/Transfer/Syntax/Lex.hs delete mode 100644 src/Transfer/Syntax/Lex.x delete mode 100644 src/Transfer/Syntax/Par.hs delete mode 100644 src/Transfer/Syntax/Par.y delete mode 100644 src/Transfer/Syntax/Print.hs delete mode 100644 src/Transfer/Syntax/ResolveLayout.hs delete mode 100644 src/Transfer/Syntax/Skel.hs delete mode 100644 src/Transfer/Syntax/Syntax.cf delete mode 100644 src/Transfer/Syntax/Test.hs delete mode 100644 src/Transfer/SyntaxToCore.hs diff --git a/src/Transfer/CompilerAPI.hs b/src/Transfer/CompilerAPI.hs deleted file mode 100644 index 38cb58dd0..000000000 --- a/src/Transfer/CompilerAPI.hs +++ /dev/null @@ -1,75 +0,0 @@ -module Transfer.CompilerAPI where - -import Transfer.Syntax.Lex -import Transfer.Syntax.Par -import Transfer.Syntax.Print -import Transfer.Syntax.Abs -import Transfer.Syntax.Layout - -import Transfer.ErrM -import Transfer.SyntaxToCore - -import Transfer.PathUtil - -import Data.List -import System.Directory - - --- | Compile a source module file to a a code file. -compileFile :: [FilePath] -- ^ directories to look for imported modules in - -> FilePath -- ^ source module file - -> IO FilePath -- ^ path to the core file that was written -compileFile path f = do - ds <- loadModule path f - s <- compile ds - writeFile coreFile s - return coreFile - where coreFile = replaceFilenameSuffix f "trc" - --- | Compile a self-contained list of declarations to a core program. -compile :: Monad m => [Decl] -> m String -compile m = return (printTree $ declsToCore m) - --- | Load a source module file and all its dependencies. -loadModule :: [FilePath] -- ^ directories to look for imported modules in - -> FilePath -- ^ source module file - -> IO [Decl] -loadModule = loadModule_ [] - where - loadModule_ ms path f = - do - s <- readFile f - Module is ds <- case pModule (myLLexer s) of - Bad e -> fail $ "Parse error in " ++ f ++ ": " ++ e - Ok m -> return m - let load = [ i | Import (Ident i) <- is ] \\ ms - let path' = directoryOf f : path - files <- mapM (findFile path' . (++".tra")) load - dss <- mapM (loadModule_ (load++ms) path) files - return $ concat (dss++[ds]) - -myLLexer :: String -> [Token] -myLLexer = resolveLayout True . myLexer - --- | Find a file in one of the given directories. --- Fails if the file was not found. -findFile :: [FilePath] -- ^ directories to look in - -> FilePath -- ^ file name to find - -> IO FilePath -findFile path f = - do - mf <- findFileM path f - case mf of - Nothing -> fail $ f ++ " not found in path: " ++ show path - Just f' -> return f' - --- | Find a file in one of the given directories. -findFileM :: [FilePath] -- ^ directories to look in - -> FilePath -- ^ file name to find - -> IO (Maybe FilePath) -findFileM [] _ = return Nothing -findFileM (p:ps) f = - do - let f' = p ++ "/" ++ f - e <- doesFileExist f' - if e then return (Just f') else findFileM ps f diff --git a/src/Transfer/Core/Abs.hs b/src/Transfer/Core/Abs.hs deleted file mode 100644 index 8306d5b46..000000000 --- a/src/Transfer/Core/Abs.hs +++ /dev/null @@ -1,267 +0,0 @@ -{-# OPTIONS_GHC -fglasgow-exts #-} -module Transfer.Core.Abs (Tree(..), Module, Decl, ConsDecl, Pattern, FieldPattern, PatternVariable, Exp, LetDef, Case, FieldType, FieldValue, TMeta, CIdent, composOp, composOpM, composOpM_, composOpMPlus, composOpMonoid, composOpFold, compos, johnMajorEq) where - -import Control.Monad (ap,MonadPlus,msum,mplus,mzero) -import Control.Monad.Identity -import Data.Monoid - --- Haskell module generated by the BNF converter - -data Module_ -type Module = Tree Module_ -data Decl_ -type Decl = Tree Decl_ -data ConsDecl_ -type ConsDecl = Tree ConsDecl_ -data Pattern_ -type Pattern = Tree Pattern_ -data FieldPattern_ -type FieldPattern = Tree FieldPattern_ -data PatternVariable_ -type PatternVariable = Tree PatternVariable_ -data Exp_ -type Exp = Tree Exp_ -data LetDef_ -type LetDef = Tree LetDef_ -data Case_ -type Case = Tree Case_ -data FieldType_ -type FieldType = Tree FieldType_ -data FieldValue_ -type FieldValue = Tree FieldValue_ -data TMeta_ -type TMeta = Tree TMeta_ -data CIdent_ -type CIdent = Tree CIdent_ - -data Tree :: * -> * where - Module :: [Decl] -> Tree Module_ - DataDecl :: CIdent -> Exp -> [ConsDecl] -> Tree Decl_ - TypeDecl :: CIdent -> Exp -> Tree Decl_ - ValueDecl :: CIdent -> Exp -> Tree Decl_ - ConsDecl :: CIdent -> Exp -> Tree ConsDecl_ - PCons :: CIdent -> [Pattern] -> Tree Pattern_ - PVar :: PatternVariable -> Tree Pattern_ - PRec :: [FieldPattern] -> Tree Pattern_ - PStr :: String -> Tree Pattern_ - PInt :: Integer -> Tree Pattern_ - FieldPattern :: CIdent -> Pattern -> Tree FieldPattern_ - PVVar :: CIdent -> Tree PatternVariable_ - PVWild :: Tree PatternVariable_ - ELet :: [LetDef] -> Exp -> Tree Exp_ - ECase :: Exp -> [Case] -> Tree Exp_ - EAbs :: PatternVariable -> Exp -> Tree Exp_ - EPi :: PatternVariable -> Exp -> Exp -> Tree Exp_ - EApp :: Exp -> Exp -> Tree Exp_ - EProj :: Exp -> CIdent -> Tree Exp_ - ERecType :: [FieldType] -> Tree Exp_ - ERec :: [FieldValue] -> Tree Exp_ - EVar :: CIdent -> Tree Exp_ - EType :: Tree Exp_ - EStr :: String -> Tree Exp_ - EInteger :: Integer -> Tree Exp_ - EDouble :: Double -> Tree Exp_ - EMeta :: TMeta -> Tree Exp_ - LetDef :: CIdent -> Exp -> Tree LetDef_ - Case :: Pattern -> Exp -> Exp -> Tree Case_ - FieldType :: CIdent -> Exp -> Tree FieldType_ - FieldValue :: CIdent -> Exp -> Tree FieldValue_ - TMeta :: String -> Tree TMeta_ - CIdent :: String -> Tree CIdent_ - -composOp :: (forall a. Tree a -> Tree a) -> Tree c -> Tree c -composOp f = runIdentity . composOpM (Identity . f) - -composOpM :: Monad m => (forall a. Tree a -> m (Tree a)) -> Tree c -> m (Tree c) -composOpM = compos return ap - -composOpM_ :: Monad m => (forall a. Tree a -> m ()) -> Tree c -> m () -composOpM_ = composOpFold (return ()) (>>) - -composOpMPlus :: MonadPlus m => (forall a. Tree a -> m b) -> Tree c -> m b -composOpMPlus = composOpFold mzero mplus - -composOpMonoid :: Monoid m => (forall a. Tree a -> m) -> Tree c -> m -composOpMonoid = composOpFold mempty mappend - -newtype C b a = C { unC :: b } -composOpFold :: b -> (b -> b -> b) -> (forall a. Tree a -> b) -> Tree c -> b -composOpFold z c f = unC . compos (\_ -> C z) (\(C x) (C y) -> C (c x y)) (C . f) - -compos :: (forall a. a -> m a) - -> (forall a b. m (a -> b) -> m a -> m b) - -> (forall a. Tree a -> m (Tree a)) -> Tree c -> m (Tree c) -compos r a f t = case t of - Module decls -> r Module `a` foldr (a . a (r (:)) . f) (r []) decls - DataDecl cident exp consdecls -> r DataDecl `a` f cident `a` f exp `a` foldr (a . a (r (:)) . f) (r []) consdecls - TypeDecl cident exp -> r TypeDecl `a` f cident `a` f exp - ValueDecl cident exp -> r ValueDecl `a` f cident `a` f exp - ConsDecl cident exp -> r ConsDecl `a` f cident `a` f exp - PCons cident patterns -> r PCons `a` f cident `a` foldr (a . a (r (:)) . f) (r []) patterns - PVar patternvariable -> r PVar `a` f patternvariable - PRec fieldpatterns -> r PRec `a` foldr (a . a (r (:)) . f) (r []) fieldpatterns - FieldPattern cident pattern -> r FieldPattern `a` f cident `a` f pattern - PVVar cident -> r PVVar `a` f cident - ELet letdefs exp -> r ELet `a` foldr (a . a (r (:)) . f) (r []) letdefs `a` f exp - ECase exp cases -> r ECase `a` f exp `a` foldr (a . a (r (:)) . f) (r []) cases - EAbs patternvariable exp -> r EAbs `a` f patternvariable `a` f exp - EPi patternvariable exp0 exp1 -> r EPi `a` f patternvariable `a` f exp0 `a` f exp1 - EApp exp0 exp1 -> r EApp `a` f exp0 `a` f exp1 - EProj exp cident -> r EProj `a` f exp `a` f cident - ERecType fieldtypes -> r ERecType `a` foldr (a . a (r (:)) . f) (r []) fieldtypes - ERec fieldvalues -> r ERec `a` foldr (a . a (r (:)) . f) (r []) fieldvalues - EVar cident -> r EVar `a` f cident - EMeta tmeta -> r EMeta `a` f tmeta - LetDef cident exp -> r LetDef `a` f cident `a` f exp - Case pattern exp0 exp1 -> r Case `a` f pattern `a` f exp0 `a` f exp1 - FieldType cident exp -> r FieldType `a` f cident `a` f exp - FieldValue cident exp -> r FieldValue `a` f cident `a` f exp - _ -> r t - -instance Show (Tree c) where - showsPrec n t = case t of - Module decls -> opar n . showString "Module" . showChar ' ' . showsPrec 1 decls . cpar n - DataDecl cident exp consdecls -> opar n . showString "DataDecl" . showChar ' ' . showsPrec 1 cident . showChar ' ' . showsPrec 1 exp . showChar ' ' . showsPrec 1 consdecls . cpar n - TypeDecl cident exp -> opar n . showString "TypeDecl" . showChar ' ' . showsPrec 1 cident . showChar ' ' . showsPrec 1 exp . cpar n - ValueDecl cident exp -> opar n . showString "ValueDecl" . showChar ' ' . showsPrec 1 cident . showChar ' ' . showsPrec 1 exp . cpar n - ConsDecl cident exp -> opar n . showString "ConsDecl" . showChar ' ' . showsPrec 1 cident . showChar ' ' . showsPrec 1 exp . cpar n - PCons cident patterns -> opar n . showString "PCons" . showChar ' ' . showsPrec 1 cident . showChar ' ' . showsPrec 1 patterns . cpar n - PVar patternvariable -> opar n . showString "PVar" . showChar ' ' . showsPrec 1 patternvariable . cpar n - PRec fieldpatterns -> opar n . showString "PRec" . showChar ' ' . showsPrec 1 fieldpatterns . cpar n - PStr str -> opar n . showString "PStr" . showChar ' ' . showsPrec 1 str . cpar n - PInt n -> opar n . showString "PInt" . showChar ' ' . showsPrec 1 n . cpar n - FieldPattern cident pattern -> opar n . showString "FieldPattern" . showChar ' ' . showsPrec 1 cident . showChar ' ' . showsPrec 1 pattern . cpar n - PVVar cident -> opar n . showString "PVVar" . showChar ' ' . showsPrec 1 cident . cpar n - PVWild -> showString "PVWild" - ELet letdefs exp -> opar n . showString "ELet" . showChar ' ' . showsPrec 1 letdefs . showChar ' ' . showsPrec 1 exp . cpar n - ECase exp cases -> opar n . showString "ECase" . showChar ' ' . showsPrec 1 exp . showChar ' ' . showsPrec 1 cases . cpar n - EAbs patternvariable exp -> opar n . showString "EAbs" . showChar ' ' . showsPrec 1 patternvariable . showChar ' ' . showsPrec 1 exp . cpar n - EPi patternvariable exp0 exp1 -> opar n . showString "EPi" . showChar ' ' . showsPrec 1 patternvariable . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - EApp exp0 exp1 -> opar n . showString "EApp" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - EProj exp cident -> opar n . showString "EProj" . showChar ' ' . showsPrec 1 exp . showChar ' ' . showsPrec 1 cident . cpar n - ERecType fieldtypes -> opar n . showString "ERecType" . showChar ' ' . showsPrec 1 fieldtypes . cpar n - ERec fieldvalues -> opar n . showString "ERec" . showChar ' ' . showsPrec 1 fieldvalues . cpar n - EVar cident -> opar n . showString "EVar" . showChar ' ' . showsPrec 1 cident . cpar n - EType -> showString "EType" - EStr str -> opar n . showString "EStr" . showChar ' ' . showsPrec 1 str . cpar n - EInteger n -> opar n . showString "EInteger" . showChar ' ' . showsPrec 1 n . cpar n - EDouble d -> opar n . showString "EDouble" . showChar ' ' . showsPrec 1 d . cpar n - EMeta tmeta -> opar n . showString "EMeta" . showChar ' ' . showsPrec 1 tmeta . cpar n - LetDef cident exp -> opar n . showString "LetDef" . showChar ' ' . showsPrec 1 cident . showChar ' ' . showsPrec 1 exp . cpar n - Case pattern exp0 exp1 -> opar n . showString "Case" . showChar ' ' . showsPrec 1 pattern . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - FieldType cident exp -> opar n . showString "FieldType" . showChar ' ' . showsPrec 1 cident . showChar ' ' . showsPrec 1 exp . cpar n - FieldValue cident exp -> opar n . showString "FieldValue" . showChar ' ' . showsPrec 1 cident . showChar ' ' . showsPrec 1 exp . cpar n - TMeta str -> opar n . showString "TMeta" . showChar ' ' . showsPrec 1 str . cpar n - CIdent str -> opar n . showString "CIdent" . showChar ' ' . showsPrec 1 str . cpar n - where opar n = if n > 0 then showChar '(' else id - cpar n = if n > 0 then showChar ')' else id - -instance Eq (Tree c) where (==) = johnMajorEq - -johnMajorEq :: Tree a -> Tree b -> Bool -johnMajorEq (Module decls) (Module decls_) = decls == decls_ -johnMajorEq (DataDecl cident exp consdecls) (DataDecl cident_ exp_ consdecls_) = cident == cident_ && exp == exp_ && consdecls == consdecls_ -johnMajorEq (TypeDecl cident exp) (TypeDecl cident_ exp_) = cident == cident_ && exp == exp_ -johnMajorEq (ValueDecl cident exp) (ValueDecl cident_ exp_) = cident == cident_ && exp == exp_ -johnMajorEq (ConsDecl cident exp) (ConsDecl cident_ exp_) = cident == cident_ && exp == exp_ -johnMajorEq (PCons cident patterns) (PCons cident_ patterns_) = cident == cident_ && patterns == patterns_ -johnMajorEq (PVar patternvariable) (PVar patternvariable_) = patternvariable == patternvariable_ -johnMajorEq (PRec fieldpatterns) (PRec fieldpatterns_) = fieldpatterns == fieldpatterns_ -johnMajorEq (PStr str) (PStr str_) = str == str_ -johnMajorEq (PInt n) (PInt n_) = n == n_ -johnMajorEq (FieldPattern cident pattern) (FieldPattern cident_ pattern_) = cident == cident_ && pattern == pattern_ -johnMajorEq (PVVar cident) (PVVar cident_) = cident == cident_ -johnMajorEq PVWild PVWild = True -johnMajorEq (ELet letdefs exp) (ELet letdefs_ exp_) = letdefs == letdefs_ && exp == exp_ -johnMajorEq (ECase exp cases) (ECase exp_ cases_) = exp == exp_ && cases == cases_ -johnMajorEq (EAbs patternvariable exp) (EAbs patternvariable_ exp_) = patternvariable == patternvariable_ && exp == exp_ -johnMajorEq (EPi patternvariable exp0 exp1) (EPi patternvariable_ exp0_ exp1_) = patternvariable == patternvariable_ && exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (EApp exp0 exp1) (EApp exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (EProj exp cident) (EProj exp_ cident_) = exp == exp_ && cident == cident_ -johnMajorEq (ERecType fieldtypes) (ERecType fieldtypes_) = fieldtypes == fieldtypes_ -johnMajorEq (ERec fieldvalues) (ERec fieldvalues_) = fieldvalues == fieldvalues_ -johnMajorEq (EVar cident) (EVar cident_) = cident == cident_ -johnMajorEq EType EType = True -johnMajorEq (EStr str) (EStr str_) = str == str_ -johnMajorEq (EInteger n) (EInteger n_) = n == n_ -johnMajorEq (EDouble d) (EDouble d_) = d == d_ -johnMajorEq (EMeta tmeta) (EMeta tmeta_) = tmeta == tmeta_ -johnMajorEq (LetDef cident exp) (LetDef cident_ exp_) = cident == cident_ && exp == exp_ -johnMajorEq (Case pattern exp0 exp1) (Case pattern_ exp0_ exp1_) = pattern == pattern_ && exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (FieldType cident exp) (FieldType cident_ exp_) = cident == cident_ && exp == exp_ -johnMajorEq (FieldValue cident exp) (FieldValue cident_ exp_) = cident == cident_ && exp == exp_ -johnMajorEq (TMeta str) (TMeta str_) = str == str_ -johnMajorEq (CIdent str) (CIdent str_) = str == str_ -johnMajorEq _ _ = False - -instance Ord (Tree c) where - compare x y = compare (index x) (index y) `mappend` compareSame x y -index :: Tree c -> Int -index (Module _) = 0 -index (DataDecl _ _ _) = 1 -index (TypeDecl _ _) = 2 -index (ValueDecl _ _) = 3 -index (ConsDecl _ _) = 4 -index (PCons _ _) = 5 -index (PVar _) = 6 -index (PRec _) = 7 -index (PStr _) = 8 -index (PInt _) = 9 -index (FieldPattern _ _) = 10 -index (PVVar _) = 11 -index (PVWild ) = 12 -index (ELet _ _) = 13 -index (ECase _ _) = 14 -index (EAbs _ _) = 15 -index (EPi _ _ _) = 16 -index (EApp _ _) = 17 -index (EProj _ _) = 18 -index (ERecType _) = 19 -index (ERec _) = 20 -index (EVar _) = 21 -index (EType ) = 22 -index (EStr _) = 23 -index (EInteger _) = 24 -index (EDouble _) = 25 -index (EMeta _) = 26 -index (LetDef _ _) = 27 -index (Case _ _ _) = 28 -index (FieldType _ _) = 29 -index (FieldValue _ _) = 30 -index (TMeta _) = 31 -index (CIdent _) = 32 -compareSame :: Tree c -> Tree c -> Ordering -compareSame (Module decls) (Module decls_) = compare decls decls_ -compareSame (DataDecl cident exp consdecls) (DataDecl cident_ exp_ consdecls_) = mappend (compare cident cident_) (mappend (compare exp exp_) (compare consdecls consdecls_)) -compareSame (TypeDecl cident exp) (TypeDecl cident_ exp_) = mappend (compare cident cident_) (compare exp exp_) -compareSame (ValueDecl cident exp) (ValueDecl cident_ exp_) = mappend (compare cident cident_) (compare exp exp_) -compareSame (ConsDecl cident exp) (ConsDecl cident_ exp_) = mappend (compare cident cident_) (compare exp exp_) -compareSame (PCons cident patterns) (PCons cident_ patterns_) = mappend (compare cident cident_) (compare patterns patterns_) -compareSame (PVar patternvariable) (PVar patternvariable_) = compare patternvariable patternvariable_ -compareSame (PRec fieldpatterns) (PRec fieldpatterns_) = compare fieldpatterns fieldpatterns_ -compareSame (PStr str) (PStr str_) = compare str str_ -compareSame (PInt n) (PInt n_) = compare n n_ -compareSame (FieldPattern cident pattern) (FieldPattern cident_ pattern_) = mappend (compare cident cident_) (compare pattern pattern_) -compareSame (PVVar cident) (PVVar cident_) = compare cident cident_ -compareSame PVWild PVWild = EQ -compareSame (ELet letdefs exp) (ELet letdefs_ exp_) = mappend (compare letdefs letdefs_) (compare exp exp_) -compareSame (ECase exp cases) (ECase exp_ cases_) = mappend (compare exp exp_) (compare cases cases_) -compareSame (EAbs patternvariable exp) (EAbs patternvariable_ exp_) = mappend (compare patternvariable patternvariable_) (compare exp exp_) -compareSame (EPi patternvariable exp0 exp1) (EPi patternvariable_ exp0_ exp1_) = mappend (compare patternvariable patternvariable_) (mappend (compare exp0 exp0_) (compare exp1 exp1_)) -compareSame (EApp exp0 exp1) (EApp exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (EProj exp cident) (EProj exp_ cident_) = mappend (compare exp exp_) (compare cident cident_) -compareSame (ERecType fieldtypes) (ERecType fieldtypes_) = compare fieldtypes fieldtypes_ -compareSame (ERec fieldvalues) (ERec fieldvalues_) = compare fieldvalues fieldvalues_ -compareSame (EVar cident) (EVar cident_) = compare cident cident_ -compareSame EType EType = EQ -compareSame (EStr str) (EStr str_) = compare str str_ -compareSame (EInteger n) (EInteger n_) = compare n n_ -compareSame (EDouble d) (EDouble d_) = compare d d_ -compareSame (EMeta tmeta) (EMeta tmeta_) = compare tmeta tmeta_ -compareSame (LetDef cident exp) (LetDef cident_ exp_) = mappend (compare cident cident_) (compare exp exp_) -compareSame (Case pattern exp0 exp1) (Case pattern_ exp0_ exp1_) = mappend (compare pattern pattern_) (mappend (compare exp0 exp0_) (compare exp1 exp1_)) -compareSame (FieldType cident exp) (FieldType cident_ exp_) = mappend (compare cident cident_) (compare exp exp_) -compareSame (FieldValue cident exp) (FieldValue cident_ exp_) = mappend (compare cident cident_) (compare exp exp_) -compareSame (TMeta str) (TMeta str_) = compare str str_ -compareSame (CIdent str) (CIdent str_) = compare str str_ -compareSame x y = error "BNFC error:" compareSame diff --git a/src/Transfer/Core/Core.cf b/src/Transfer/Core/Core.cf deleted file mode 100644 index cd4c20569..000000000 --- a/src/Transfer/Core/Core.cf +++ /dev/null @@ -1,93 +0,0 @@ --- This is a subset of the front-end language - -entrypoints Module, Exp ; - -comment "--" ; -comment "{-" "-}" ; - -Module. Module ::= [Decl] ; -separator Decl ";" ; - -DataDecl. Decl ::= "data" CIdent ":" Exp "where" "{" [ConsDecl] "}" ; -TypeDecl. Decl ::= CIdent ":" Exp ; -ValueDecl. Decl ::= CIdent "=" Exp ; - -ConsDecl. ConsDecl ::= CIdent ":" Exp ; -separator ConsDecl ";" ; - -separator Pattern ""; - --- Constructor patterns. -PCons. Pattern ::= "(" CIdent [Pattern] ")" ; - --- Variable patterns. Note that in the core language, --- constructor patterns must have parantheses. -PVar. Pattern ::= PatternVariable ; --- Record patterns. -PRec. Pattern ::= "rec" "{" [FieldPattern] "}"; --- String literal patterns. -PStr. Pattern ::= String ; --- Integer literal patterns. -PInt. Pattern ::= Integer ; - -FieldPattern. FieldPattern ::= CIdent "=" Pattern ; -separator FieldPattern ";" ; - --- Variable patterns -PVVar. PatternVariable ::= CIdent ; --- Wild card patterns -PVWild. PatternVariable ::= "_" ; - --- Let expressions. -ELet. Exp ::= "let" "{" [LetDef] "}" "in" Exp ; -LetDef. LetDef ::= CIdent "=" Exp ; -separator LetDef ";" ; - --- Case expressions. -ECase. Exp ::= "case" Exp "of" "{" [Case] "}" ; -Case. Case ::= Pattern "|" Exp "->" Exp ; -separator Case ";" ; - --- Lambda abstractions. -EAbs. Exp1 ::= "\\" PatternVariable "->" Exp ; --- Function types. -EPi. Exp1 ::= "(" PatternVariable ":" Exp ")" "->" Exp ; - --- Function application. -EApp. Exp3 ::= Exp3 Exp4 ; - --- Record field projection. -EProj. Exp4 ::= Exp4 "." CIdent ; - --- Record types. -ERecType. Exp5 ::= "sig" "{" [FieldType] "}" ; -FieldType. FieldType ::= CIdent ":" Exp ; -separator FieldType ";" ; - --- Record expressions. -ERec. Exp5 ::= "rec" "{" [FieldValue] "}" ; -FieldValue.FieldValue ::= CIdent "=" Exp ; -separator FieldValue ";" ; - - --- Functions, constructors and local variables. -EVar. Exp5 ::= CIdent ; --- The constant Type. -EType. Exp5 ::= "Type" ; --- String literal expressions. -EStr. Exp5 ::= String ; --- Integer literal expressions. -EInteger. Exp5 ::= Integer ; --- Double literal expressions. -EDouble. Exp5 ::= Double ; --- Meta variables -EMeta. Exp5 ::= TMeta ; - -token TMeta ('?' digit+) ; - -coercions Exp 5 ; - - --- Identifiers in core can start with underscore to allow --- generating unique identifiers easily. -token CIdent ((letter | '_') (letter | digit | '_' | '\'')*) ; diff --git a/src/Transfer/Core/Doc.tex b/src/Transfer/Core/Doc.tex deleted file mode 100644 index 4ba6f93ed..000000000 --- a/src/Transfer/Core/Doc.tex +++ /dev/null @@ -1,215 +0,0 @@ -\batchmode -%This Latex file is machine-generated by the BNF-converter - -\documentclass[a4paper,11pt]{article} -\author{BNF-converter} -\title{The Language Core} -\setlength{\parindent}{0mm} -\setlength{\parskip}{1mm} -\begin{document} - -\maketitle - -\newcommand{\emptyP}{\mbox{$\epsilon$}} -\newcommand{\terminal}[1]{\mbox{{\texttt {#1}}}} -\newcommand{\nonterminal}[1]{\mbox{$\langle \mbox{{\sl #1 }} \! \rangle$}} -\newcommand{\arrow}{\mbox{::=}} -\newcommand{\delimit}{\mbox{$|$}} -\newcommand{\reserved}[1]{\mbox{{\texttt {#1}}}} -\newcommand{\literal}[1]{\mbox{{\texttt {#1}}}} -\newcommand{\symb}[1]{\mbox{{\texttt {#1}}}} - -This document was automatically generated by the {\em BNF-Converter}. It was generated together with the lexer, the parser, and the abstract syntax module, which guarantees that the document matches with the implementation of the language (provided no hand-hacking has taken place). - -\section*{The lexical structure of Core} - -\subsection*{Literals} -String literals \nonterminal{String}\ have the form -\terminal{"}$x$\terminal{"}, where $x$ is any sequence of any characters -except \terminal{"}\ unless preceded by \verb6\6. - - -Integer literals \nonterminal{Int}\ are nonempty sequences of digits. - - -Double-precision float literals \nonterminal{Double}\ have the structure -indicated by the regular expression $\nonterminal{digit}+ \mbox{{\it `.'}} \nonterminal{digit}+ (\mbox{{\it `e'}} \mbox{{\it `-'}}? \nonterminal{digit}+)?$ i.e.\ -two sequences of digits separated by a decimal point, optionally -followed by an unsigned or negative exponent. - - - - - -TMeta literals are recognized by the regular expression -\(\mbox{`?'} {\nonterminal{digit}}+\) - -CIdent literals are recognized by the regular expression -\(({\nonterminal{letter}} \mid \mbox{`\_'}) ({\nonterminal{letter}} \mid {\nonterminal{digit}} \mid \mbox{`\_'} \mid \mbox{`''})*\) - - -\subsection*{Reserved words and symbols} -The set of reserved words is the set of terminals appearing in the grammar. Those reserved words that consist of non-letter characters are called symbols, and they are treated in a different way from those that are similar to identifiers. The lexer follows rules familiar from languages like Haskell, C, and Java, including longest match and spacing conventions. - -The reserved words used in Core are the following: \\ - -\begin{tabular}{lll} -{\reserved{Type}} &{\reserved{case}} &{\reserved{data}} \\ -{\reserved{in}} &{\reserved{let}} &{\reserved{of}} \\ -{\reserved{rec}} &{\reserved{sig}} &{\reserved{where}} \\ -\end{tabular}\\ - -The symbols used in Core are the following: \\ - -\begin{tabular}{lll} -{\symb{;}} &{\symb{:}} &{\symb{\{}} \\ -{\symb{\}}} &{\symb{{$=$}}} &{\symb{(}} \\ -{\symb{)}} &{\symb{\_}} &{\symb{{$|$}}} \\ -{\symb{{$-$}{$>$}}} &{\symb{$\backslash$}} &{\symb{.}} \\ -\end{tabular}\\ - -\subsection*{Comments} -Single-line comments begin with {\symb{{$-$}{$-$}}}. \\Multiple-line comments are enclosed with {\symb{\{{$-$}}} and {\symb{{$-$}\}}}. - -\section*{The syntactic structure of Core} -Non-terminals are enclosed between $\langle$ and $\rangle$. -The symbols {\arrow} (production), {\delimit} (union) -and {\emptyP} (empty rule) belong to the BNF notation. -All other symbols are terminals.\\ - -\begin{tabular}{lll} -{\nonterminal{Module}} & {\arrow} &{\nonterminal{ListDecl}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListDecl}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{Decl}} \\ - & {\delimit} &{\nonterminal{Decl}} {\terminal{;}} {\nonterminal{ListDecl}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Decl}} & {\arrow} &{\terminal{data}} {\nonterminal{CIdent}} {\terminal{:}} {\nonterminal{Exp}} {\terminal{where}} {\terminal{\{}} {\nonterminal{ListConsDecl}} {\terminal{\}}} \\ - & {\delimit} &{\nonterminal{CIdent}} {\terminal{:}} {\nonterminal{Exp}} \\ - & {\delimit} &{\nonterminal{CIdent}} {\terminal{{$=$}}} {\nonterminal{Exp}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ConsDecl}} & {\arrow} &{\nonterminal{CIdent}} {\terminal{:}} {\nonterminal{Exp}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListConsDecl}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{ConsDecl}} \\ - & {\delimit} &{\nonterminal{ConsDecl}} {\terminal{;}} {\nonterminal{ListConsDecl}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListPattern}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{Pattern}} {\nonterminal{ListPattern}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Pattern}} & {\arrow} &{\terminal{(}} {\nonterminal{CIdent}} {\nonterminal{ListPattern}} {\terminal{)}} \\ - & {\delimit} &{\nonterminal{PatternVariable}} \\ - & {\delimit} &{\terminal{rec}} {\terminal{\{}} {\nonterminal{ListFieldPattern}} {\terminal{\}}} \\ - & {\delimit} &{\nonterminal{String}} \\ - & {\delimit} &{\nonterminal{Integer}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{FieldPattern}} & {\arrow} &{\nonterminal{CIdent}} {\terminal{{$=$}}} {\nonterminal{Pattern}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListFieldPattern}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{FieldPattern}} \\ - & {\delimit} &{\nonterminal{FieldPattern}} {\terminal{;}} {\nonterminal{ListFieldPattern}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{PatternVariable}} & {\arrow} &{\nonterminal{CIdent}} \\ - & {\delimit} &{\terminal{\_}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp}} & {\arrow} &{\terminal{let}} {\terminal{\{}} {\nonterminal{ListLetDef}} {\terminal{\}}} {\terminal{in}} {\nonterminal{Exp}} \\ - & {\delimit} &{\terminal{case}} {\nonterminal{Exp}} {\terminal{of}} {\terminal{\{}} {\nonterminal{ListCase}} {\terminal{\}}} \\ - & {\delimit} &{\nonterminal{Exp1}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{LetDef}} & {\arrow} &{\nonterminal{CIdent}} {\terminal{{$=$}}} {\nonterminal{Exp}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListLetDef}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{LetDef}} \\ - & {\delimit} &{\nonterminal{LetDef}} {\terminal{;}} {\nonterminal{ListLetDef}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Case}} & {\arrow} &{\nonterminal{Pattern}} {\terminal{{$|$}}} {\nonterminal{Exp}} {\terminal{{$-$}{$>$}}} {\nonterminal{Exp}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListCase}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{Case}} \\ - & {\delimit} &{\nonterminal{Case}} {\terminal{;}} {\nonterminal{ListCase}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp1}} & {\arrow} &{\terminal{$\backslash$}} {\nonterminal{PatternVariable}} {\terminal{{$-$}{$>$}}} {\nonterminal{Exp}} \\ - & {\delimit} &{\terminal{(}} {\nonterminal{PatternVariable}} {\terminal{:}} {\nonterminal{Exp}} {\terminal{)}} {\terminal{{$-$}{$>$}}} {\nonterminal{Exp}} \\ - & {\delimit} &{\nonterminal{Exp2}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp3}} & {\arrow} &{\nonterminal{Exp3}} {\nonterminal{Exp4}} \\ - & {\delimit} &{\nonterminal{Exp4}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp4}} & {\arrow} &{\nonterminal{Exp4}} {\terminal{.}} {\nonterminal{CIdent}} \\ - & {\delimit} &{\nonterminal{Exp5}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp5}} & {\arrow} &{\terminal{sig}} {\terminal{\{}} {\nonterminal{ListFieldType}} {\terminal{\}}} \\ - & {\delimit} &{\terminal{rec}} {\terminal{\{}} {\nonterminal{ListFieldValue}} {\terminal{\}}} \\ - & {\delimit} &{\nonterminal{CIdent}} \\ - & {\delimit} &{\terminal{Type}} \\ - & {\delimit} &{\nonterminal{String}} \\ - & {\delimit} &{\nonterminal{Integer}} \\ - & {\delimit} &{\nonterminal{Double}} \\ - & {\delimit} &{\nonterminal{TMeta}} \\ - & {\delimit} &{\terminal{(}} {\nonterminal{Exp}} {\terminal{)}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{FieldType}} & {\arrow} &{\nonterminal{CIdent}} {\terminal{:}} {\nonterminal{Exp}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListFieldType}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{FieldType}} \\ - & {\delimit} &{\nonterminal{FieldType}} {\terminal{;}} {\nonterminal{ListFieldType}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{FieldValue}} & {\arrow} &{\nonterminal{CIdent}} {\terminal{{$=$}}} {\nonterminal{Exp}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListFieldValue}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{FieldValue}} \\ - & {\delimit} &{\nonterminal{FieldValue}} {\terminal{;}} {\nonterminal{ListFieldValue}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp2}} & {\arrow} &{\nonterminal{Exp3}} \\ -\end{tabular}\\ - - - -\end{document} - diff --git a/src/Transfer/Core/Lex.hs b/src/Transfer/Core/Lex.hs deleted file mode 100644 index be1198508..000000000 --- a/src/Transfer/Core/Lex.hs +++ /dev/null @@ -1,343 +0,0 @@ -{-# OPTIONS -fglasgow-exts -cpp #-} -{-# LINE 3 "Transfer/Core/Lex.x" #-} -{-# OPTIONS -fno-warn-incomplete-patterns #-} -module Transfer.Core.Lex where - - - -#if __GLASGOW_HASKELL__ >= 603 -#include "ghcconfig.h" -#else -#include "config.h" -#endif -#if __GLASGOW_HASKELL__ >= 503 -import Data.Array -import Data.Char (ord) -import Data.Array.Base (unsafeAt) -#else -import Array -import Char (ord) -#endif -#if __GLASGOW_HASKELL__ >= 503 -import GHC.Exts -#else -import GlaExts -#endif -alex_base :: AlexAddr -alex_base = AlexA# "\x01\x00\x00\x00\x15\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x18\x00\x00\x00\x19\x00\x00\x00\x1a\x00\x00\x00\x00\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\x1b\x00\x00\x00\x1c\x00\x00\x00\x1d\x00\x00\x00\x42\x00\x00\x00\x00\x00\x00\x00\x9c\x00\x00\x00\x33\x00\x00\x00\xe7\x00\x00\x00\x6c\x01\x00\x00\x3c\x02\x00\x00\x00\x00\x00\x00\x17\x01\x00\x00\xd5\x00\x00\x00\xf4\x00\x00\x00\xb7\x01\x00\x00\x1a\x01\x00\x00\xc1\x01\x00\x00\xcb\x01\x00\x00\xd8\x01\x00\x00"# - -alex_table :: AlexAddr -alex_table = AlexA# "\x00\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\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\x0d\x00\xff\xff\x15\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x0e\x00\x0e\x00\xff\xff\xff\xff\xff\xff\x05\x00\x0e\x00\xff\xff\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x0e\x00\x0e\x00\xff\xff\x0e\x00\xff\xff\x11\x00\xff\xff\x04\x00\xff\xff\xff\xff\x03\x00\x03\x00\x09\x00\x09\x00\x09\x00\x0b\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0e\x00\x00\x00\x00\x00\x00\x00\x00\x00\xff\xff\x0e\x00\xff\xff\xff\xff\x0f\x00\xff\xff\x0d\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0c\x00\x0e\x00\x0e\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\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\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\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x06\x00\x07\x00\x12\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x00\x00\x00\x00\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x15\x00\xff\xff\x00\x00\x00\x00\x12\x00\x15\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\xff\xff\x1a\x00\x00\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x00\x00\x00\x00\x00\x00\x15\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x15\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x15\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x16\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x00\x00\x00\x00\x00\x00\x00\x00\x12\x00\x00\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x1b\x00\x00\x00\x00\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x19\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1c\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\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x00\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x13\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x00\x00\x00\x00\x00\x00\x00\x00\x13\x00\x00\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x00\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x00\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00\x13\x00"# - -alex_check :: AlexAddr -alex_check = AlexA# "\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x2d\x00\x0a\x00\x0a\x00\x2d\x00\x2d\x00\x2d\x00\x2d\x00\x2d\x00\x2d\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x3e\x00\xff\xff\xff\xff\xff\xff\xff\xff\x5b\x00\x5c\x00\x5d\x00\x5e\x00\x5f\x00\x60\x00\x20\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\x2d\x00\x2d\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x7b\x00\x7c\x00\x7d\x00\x7e\x00\x7f\x00\x80\x00\x81\x00\x82\x00\x83\x00\x84\x00\x85\x00\x86\x00\x87\x00\x88\x00\x89\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\x9a\x00\x9b\x00\x9c\x00\x9d\x00\x9e\x00\x9f\x00\xa0\x00\xa1\x00\xa2\x00\xa3\x00\xa4\x00\xa5\x00\xa6\x00\xa7\x00\xa8\x00\xa9\x00\xaa\x00\xab\x00\xac\x00\xad\x00\xae\x00\xaf\x00\xb0\x00\xb1\x00\xb2\x00\xb3\x00\xb4\x00\xb5\x00\xb6\x00\xb7\x00\xb8\x00\xb9\x00\xba\x00\xbb\x00\xbc\x00\xbd\x00\xbe\x00\xbf\x00\x7d\x00\x7d\x00\x27\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xd7\x00\xff\xff\xff\xff\xff\xff\xff\xff\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4c\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\x53\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x22\x00\xf7\x00\xff\xff\xff\xff\x5f\x00\x27\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x0a\x00\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\x5c\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x22\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x6e\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x74\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xc0\x00\xc1\x00\xc2\x00\xc3\x00\xc4\x00\xc5\x00\xc6\x00\xc7\x00\xc8\x00\xc9\x00\xca\x00\xcb\x00\xcc\x00\xcd\x00\xce\x00\xcf\x00\xd0\x00\xd1\x00\xd2\x00\xd3\x00\xd4\x00\xd5\x00\xd6\x00\x5c\x00\xd8\x00\xd9\x00\xda\x00\xdb\x00\xdc\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xf5\x00\xf6\x00\x27\x00\xf8\x00\xf9\x00\xfa\x00\xfb\x00\xfc\x00\xfd\x00\xfe\x00\xff\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4c\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\x53\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\xff\xff\xff\xff\xff\xff\xff\xff\x5f\x00\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x2d\x00\xff\xff\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x65\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\xc0\x00\xc1\x00\xc2\x00\xc3\x00\xc4\x00\xc5\x00\xc6\x00\xc7\x00\xc8\x00\xc9\x00\xca\x00\xcb\x00\xcc\x00\xcd\x00\xce\x00\xcf\x00\xd0\x00\xd1\x00\xd2\x00\xd3\x00\xd4\x00\xd5\x00\xd6\x00\xff\xff\xd8\x00\xd9\x00\xda\x00\xdb\x00\xdc\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xf5\x00\xf6\x00\x27\x00\xf8\x00\xf9\x00\xfa\x00\xfb\x00\xfc\x00\xfd\x00\xfe\x00\xff\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4c\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\x53\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\xff\xff\xff\xff\xff\xff\xff\xff\x5f\x00\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\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\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\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\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\xc0\x00\xc1\x00\xc2\x00\xc3\x00\xc4\x00\xc5\x00\xc6\x00\xc7\x00\xc8\x00\xc9\x00\xca\x00\xcb\x00\xcc\x00\xcd\x00\xce\x00\xcf\x00\xd0\x00\xd1\x00\xd2\x00\xd3\x00\xd4\x00\xd5\x00\xd6\x00\xff\xff\xd8\x00\xd9\x00\xda\x00\xdb\x00\xdc\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xf5\x00\xf6\x00\xff\xff\xf8\x00\xf9\x00\xfa\x00\xfb\x00\xfc\x00\xfd\x00\xfe\x00\xff\x00"# - -alex_deflt :: AlexAddr -alex_deflt = AlexA# "\x13\x00\xff\xff\x02\x00\x02\x00\xff\xff\xff\xff\x0a\x00\xff\xff\x0a\x00\x0a\x00\x0a\x00\x0a\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x15\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"# - -alex_accept = listArray (0::Int,28) [[],[],[(AlexAccSkip)],[(AlexAccSkip)],[],[],[(AlexAccSkip)],[(AlexAccSkip)],[],[],[],[],[(AlexAcc (alex_action_3))],[(AlexAccSkip)],[(AlexAcc (alex_action_3))],[(AlexAcc (alex_action_3))],[(AlexAcc (alex_action_4))],[],[(AlexAcc (alex_action_5))],[(AlexAcc (alex_action_5))],[(AlexAcc (alex_action_7))],[],[],[(AlexAcc (alex_action_8))],[(AlexAcc (alex_action_9))],[(AlexAcc (alex_action_9))],[],[],[]] -{-# LINE 36 "Transfer/Core/Lex.x" #-} - -tok f p s = f p s - -share :: String -> String -share = id - -data Tok = - TS !String -- reserved words and symbols - | TL !String -- string literals - | TI !String -- integer literals - | TV !String -- identifiers - | TD !String -- double precision float literals - | TC !String -- character literals - | T_TMeta !String - | T_CIdent !String - - deriving (Eq,Show,Ord) - -data Token = - PT Posn Tok - | Err Posn - deriving (Eq,Show,Ord) - -tokenPos (PT (Pn _ l _) _ :_) = "line " ++ show l -tokenPos (Err (Pn _ l _) :_) = "line " ++ show l -tokenPos _ = "end of file" - -posLineCol (Pn _ l c) = (l,c) -mkPosToken t@(PT p _) = (posLineCol p, prToken t) - -prToken t = case t of - PT _ (TS s) -> s - PT _ (TI s) -> s - PT _ (TV s) -> s - PT _ (TD s) -> s - PT _ (TC s) -> s - PT _ (T_TMeta s) -> s - PT _ (T_CIdent s) -> s - - _ -> show t - -data BTree = N | B String Tok BTree BTree deriving (Show) - -eitherResIdent :: (String -> Tok) -> String -> Tok -eitherResIdent tv s = treeFind resWords - where - treeFind N = tv s - treeFind (B a t left right) | s < a = treeFind left - | s > a = treeFind right - | s == a = t - -resWords = b "let" (b "data" (b "case" (b "Type" N N) N) (b "in" N N)) (b "sig" (b "rec" (b "of" N N) N) (b "where" N N)) - where b s = B s (TS s) - -unescapeInitTail :: String -> String -unescapeInitTail = unesc . tail where - unesc s = case s of - '\\':c:cs | elem c ['\"', '\\', '\''] -> c : unesc cs - '\\':'n':cs -> '\n' : unesc cs - '\\':'t':cs -> '\t' : unesc cs - '"':[] -> [] - c:cs -> c : unesc cs - _ -> [] - -------------------------------------------------------------------- --- Alex wrapper code. --- A modified "posn" wrapper. -------------------------------------------------------------------- - -data Posn = Pn !Int !Int !Int - deriving (Eq, Show,Ord) - -alexStartPos :: Posn -alexStartPos = Pn 0 1 1 - -alexMove :: Posn -> Char -> Posn -alexMove (Pn a l c) '\t' = Pn (a+1) l (((c+7) `div` 8)*8+1) -alexMove (Pn a l c) '\n' = Pn (a+1) (l+1) 1 -alexMove (Pn a l c) _ = Pn (a+1) l (c+1) - -type AlexInput = (Posn, -- current position, - Char, -- previous char - String) -- current input string - -tokens :: String -> [Token] -tokens str = go (alexStartPos, '\n', str) - where - go :: (Posn, Char, String) -> [Token] - go inp@(pos, _, str) = - case alexScan inp 0 of - AlexEOF -> [] - AlexError (pos, _, _) -> fail $ show pos ++ ": lexical error" - AlexSkip inp' len -> go inp' - AlexToken inp' len act -> act pos (take len str) : (go inp') - -alexGetChar :: AlexInput -> Maybe (Char,AlexInput) -alexGetChar (p, c, []) = Nothing -alexGetChar (p, _, (c:s)) = - let p' = alexMove p c - in p' `seq` Just (c, (p', c, s)) - -alexInputPrevChar :: AlexInput -> Char -alexInputPrevChar (p, c, s) = c - -alex_action_3 = tok (\p s -> PT p (TS $ share s)) -alex_action_4 = tok (\p s -> PT p (eitherResIdent (T_TMeta . share) s)) -alex_action_5 = tok (\p s -> PT p (eitherResIdent (T_CIdent . share) s)) -alex_action_6 = tok (\p s -> PT p (eitherResIdent (TV . share) s)) -alex_action_7 = tok (\p s -> PT p (TL $ share $ unescapeInitTail s)) -alex_action_8 = tok (\p s -> PT p (TI $ share s)) -alex_action_9 = tok (\p s -> PT p (TD $ share s)) -{-# LINE 1 "GenericTemplate.hs" #-} -{-# LINE 1 "" #-} -{-# LINE 1 "" #-} -{-# LINE 1 "GenericTemplate.hs" #-} --- ----------------------------------------------------------------------------- --- ALEX TEMPLATE --- --- This code is in the PUBLIC DOMAIN; you may copy it freely and use --- it for any purpose whatsoever. - --- ----------------------------------------------------------------------------- --- INTERNALS and main scanner engine - -{-# LINE 35 "GenericTemplate.hs" #-} - -{-# LINE 45 "GenericTemplate.hs" #-} - - -data AlexAddr = AlexA# Addr# - -#if __GLASGOW_HASKELL__ < 503 -uncheckedShiftL# = shiftL# -#endif - -{-# INLINE alexIndexInt16OffAddr #-} -alexIndexInt16OffAddr (AlexA# arr) off = -#ifdef WORDS_BIGENDIAN - narrow16Int# i - where - i = word2Int# ((high `uncheckedShiftL#` 8#) `or#` low) - high = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#))) - low = int2Word# (ord# (indexCharOffAddr# arr off')) - off' = off *# 2# -#else - indexInt16OffAddr# arr off -#endif - - - - - -{-# INLINE alexIndexInt32OffAddr #-} -alexIndexInt32OffAddr (AlexA# arr) off = -#ifdef WORDS_BIGENDIAN - narrow32Int# i - where - i = word2Int# ((b3 `uncheckedShiftL#` 24#) `or#` - (b2 `uncheckedShiftL#` 16#) `or#` - (b1 `uncheckedShiftL#` 8#) `or#` b0) - b3 = int2Word# (ord# (indexCharOffAddr# arr (off' +# 3#))) - b2 = int2Word# (ord# (indexCharOffAddr# arr (off' +# 2#))) - b1 = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#))) - b0 = int2Word# (ord# (indexCharOffAddr# arr off')) - off' = off *# 4# -#else - indexInt32OffAddr# arr off -#endif - - - - - -#if __GLASGOW_HASKELL__ < 503 -quickIndex arr i = arr ! i -#else --- GHC >= 503, unsafeAt is available from Data.Array.Base. -quickIndex = unsafeAt -#endif - - - - --- ----------------------------------------------------------------------------- --- Main lexing routines - -data AlexReturn a - = AlexEOF - | AlexError !AlexInput - | AlexSkip !AlexInput !Int - | AlexToken !AlexInput !Int a - --- alexScan :: AlexInput -> StartCode -> Maybe (AlexInput,Int,act) -alexScan input (I# (sc)) - = alexScanUser undefined input (I# (sc)) - -alexScanUser user input (I# (sc)) - = case alex_scan_tkn user input 0# input sc AlexNone of - (AlexNone, input') -> - case alexGetChar input of - Nothing -> - - - - AlexEOF - Just _ -> - - - - AlexError input' - - (AlexLastSkip input len, _) -> - - - - AlexSkip input len - - (AlexLastAcc k input len, _) -> - - - - AlexToken input len k - - --- Push the input through the DFA, remembering the most recent accepting --- state it encountered. - -alex_scan_tkn user orig_input len input s last_acc = - input `seq` -- strict in the input - case s of - -1# -> (last_acc, input) - _ -> alex_scan_tkn' user orig_input len input s last_acc - -alex_scan_tkn' user orig_input len input s last_acc = - let - new_acc = check_accs (alex_accept `quickIndex` (I# (s))) - in - new_acc `seq` - case alexGetChar input of - Nothing -> (new_acc, input) - Just (c, new_input) -> - - - - let - base = alexIndexInt32OffAddr alex_base s - (I# (ord_c)) = ord c - offset = (base +# ord_c) - check = alexIndexInt16OffAddr alex_check offset - - new_s = if (offset >=# 0#) && (check ==# ord_c) - then alexIndexInt16OffAddr alex_table offset - else alexIndexInt16OffAddr alex_deflt s - in - alex_scan_tkn user orig_input (len +# 1#) new_input new_s new_acc - - where - check_accs [] = last_acc - check_accs (AlexAcc a : _) = AlexLastAcc a input (I# (len)) - check_accs (AlexAccSkip : _) = AlexLastSkip input (I# (len)) - check_accs (AlexAccPred a pred : rest) - | pred user orig_input (I# (len)) input - = AlexLastAcc a input (I# (len)) - check_accs (AlexAccSkipPred pred : rest) - | pred user orig_input (I# (len)) input - = AlexLastSkip input (I# (len)) - check_accs (_ : rest) = check_accs rest - -data AlexLastAcc a - = AlexNone - | AlexLastAcc a !AlexInput !Int - | AlexLastSkip !AlexInput !Int - -data AlexAcc a user - = AlexAcc a - | AlexAccSkip - | AlexAccPred a (AlexAccPred user) - | AlexAccSkipPred (AlexAccPred user) - -type AlexAccPred user = user -> AlexInput -> Int -> AlexInput -> Bool - --- ----------------------------------------------------------------------------- --- Predicates on a rule - -alexAndPred p1 p2 user in1 len in2 - = p1 user in1 len in2 && p2 user in1 len in2 - ---alexPrevCharIsPred :: Char -> AlexAccPred _ -alexPrevCharIs c _ input _ _ = c == alexInputPrevChar input - ---alexPrevCharIsOneOfPred :: Array Char Bool -> AlexAccPred _ -alexPrevCharIsOneOf arr _ input _ _ = arr ! alexInputPrevChar input - ---alexRightContext :: Int -> AlexAccPred _ -alexRightContext (I# (sc)) user _ _ input = - case alex_scan_tkn user input 0# input sc AlexNone of - (AlexNone, _) -> False - _ -> True - -- TODO: there's no need to find the longest - -- match when checking the right context, just - -- the first match will do. - --- used by wrappers -iUnbox (I# (i)) = i diff --git a/src/Transfer/Core/Lex.x b/src/Transfer/Core/Lex.x deleted file mode 100644 index 480f366ae..000000000 --- a/src/Transfer/Core/Lex.x +++ /dev/null @@ -1,140 +0,0 @@ --- -*- haskell -*- --- This Alex file was machine-generated by the BNF converter -{ -{-# OPTIONS -fno-warn-incomplete-patterns #-} -module Transfer.Core.Lex where - - -} - - -$l = [a-zA-Z\192 - \255] # [\215 \247] -- isolatin1 letter FIXME -$c = [A-Z\192-\221] # [\215] -- capital isolatin1 letter FIXME -$s = [a-z\222-\255] # [\247] -- small isolatin1 letter FIXME -$d = [0-9] -- digit -$i = [$l $d _ '] -- identifier character -$u = [\0-\255] -- universal: any character - -@rsyms = -- symbols and non-identifier-like reserved words - \; | \: | \{ | \} | \= | \( | \) | \_ | \| | \- \> | \\ | \. - -:- -"--" [.]* ; -- Toss single line comments -"{-" ([$u # \-] | \- [$u # \}])* ("-")+ "}" ; - -$white+ ; -@rsyms { tok (\p s -> PT p (TS $ share s)) } -\? $d + { tok (\p s -> PT p (eitherResIdent (T_TMeta . share) s)) } -($l | \_)($l | $d | \_ | \')* { tok (\p s -> PT p (eitherResIdent (T_CIdent . share) s)) } - -$l $i* { tok (\p s -> PT p (eitherResIdent (TV . share) s)) } -\" ([$u # [\" \\ \n]] | (\\ (\" | \\ | \' | n | t)))* \"{ tok (\p s -> PT p (TL $ share $ unescapeInitTail s)) } - -$d+ { tok (\p s -> PT p (TI $ share s)) } -$d+ \. $d+ (e (\-)? $d+)? { tok (\p s -> PT p (TD $ share s)) } - -{ - -tok f p s = f p s - -share :: String -> String -share = id - -data Tok = - TS !String -- reserved words and symbols - | TL !String -- string literals - | TI !String -- integer literals - | TV !String -- identifiers - | TD !String -- double precision float literals - | TC !String -- character literals - | T_TMeta !String - | T_CIdent !String - - deriving (Eq,Show,Ord) - -data Token = - PT Posn Tok - | Err Posn - deriving (Eq,Show,Ord) - -tokenPos (PT (Pn _ l _) _ :_) = "line " ++ show l -tokenPos (Err (Pn _ l _) :_) = "line " ++ show l -tokenPos _ = "end of file" - -posLineCol (Pn _ l c) = (l,c) -mkPosToken t@(PT p _) = (posLineCol p, prToken t) - -prToken t = case t of - PT _ (TS s) -> s - PT _ (TI s) -> s - PT _ (TV s) -> s - PT _ (TD s) -> s - PT _ (TC s) -> s - PT _ (T_TMeta s) -> s - PT _ (T_CIdent s) -> s - - _ -> show t - -data BTree = N | B String Tok BTree BTree deriving (Show) - -eitherResIdent :: (String -> Tok) -> String -> Tok -eitherResIdent tv s = treeFind resWords - where - treeFind N = tv s - treeFind (B a t left right) | s < a = treeFind left - | s > a = treeFind right - | s == a = t - -resWords = b "let" (b "data" (b "case" (b "Type" N N) N) (b "in" N N)) (b "sig" (b "rec" (b "of" N N) N) (b "where" N N)) - where b s = B s (TS s) - -unescapeInitTail :: String -> String -unescapeInitTail = unesc . tail where - unesc s = case s of - '\\':c:cs | elem c ['\"', '\\', '\''] -> c : unesc cs - '\\':'n':cs -> '\n' : unesc cs - '\\':'t':cs -> '\t' : unesc cs - '"':[] -> [] - c:cs -> c : unesc cs - _ -> [] - -------------------------------------------------------------------- --- Alex wrapper code. --- A modified "posn" wrapper. -------------------------------------------------------------------- - -data Posn = Pn !Int !Int !Int - deriving (Eq, Show,Ord) - -alexStartPos :: Posn -alexStartPos = Pn 0 1 1 - -alexMove :: Posn -> Char -> Posn -alexMove (Pn a l c) '\t' = Pn (a+1) l (((c+7) `div` 8)*8+1) -alexMove (Pn a l c) '\n' = Pn (a+1) (l+1) 1 -alexMove (Pn a l c) _ = Pn (a+1) l (c+1) - -type AlexInput = (Posn, -- current position, - Char, -- previous char - String) -- current input string - -tokens :: String -> [Token] -tokens str = go (alexStartPos, '\n', str) - where - go :: (Posn, Char, String) -> [Token] - go inp@(pos, _, str) = - case alexScan inp 0 of - AlexEOF -> [] - AlexError (pos, _, _) -> fail $ show pos ++ ": lexical error" - AlexSkip inp' len -> go inp' - AlexToken inp' len act -> act pos (take len str) : (go inp') - -alexGetChar :: AlexInput -> Maybe (Char,AlexInput) -alexGetChar (p, c, []) = Nothing -alexGetChar (p, _, (c:s)) = - let p' = alexMove p c - in p' `seq` Just (c, (p', c, s)) - -alexInputPrevChar :: AlexInput -> Char -alexInputPrevChar (p, c, s) = c -} diff --git a/src/Transfer/Core/Par.hs b/src/Transfer/Core/Par.hs deleted file mode 100644 index fec63662a..000000000 --- a/src/Transfer/Core/Par.hs +++ /dev/null @@ -1,1149 +0,0 @@ -{-# OPTIONS -fglasgow-exts -cpp #-} -{-# OPTIONS -fno-warn-incomplete-patterns -fno-warn-overlapping-patterns #-} -module Transfer.Core.Par where -import Transfer.Core.Abs -import Transfer.Core.Lex -import Transfer.ErrM -import Array -#if __GLASGOW_HASKELL__ >= 503 -import GHC.Exts -#else -import GlaExts -#endif - --- parser produced by Happy Version 1.15 - -newtype HappyAbsSyn = HappyAbsSyn (() -> ()) -happyIn5 :: (String) -> (HappyAbsSyn ) -happyIn5 x = unsafeCoerce# x -{-# INLINE happyIn5 #-} -happyOut5 :: (HappyAbsSyn ) -> (String) -happyOut5 x = unsafeCoerce# x -{-# INLINE happyOut5 #-} -happyIn6 :: (Integer) -> (HappyAbsSyn ) -happyIn6 x = unsafeCoerce# x -{-# INLINE happyIn6 #-} -happyOut6 :: (HappyAbsSyn ) -> (Integer) -happyOut6 x = unsafeCoerce# x -{-# INLINE happyOut6 #-} -happyIn7 :: (Double) -> (HappyAbsSyn ) -happyIn7 x = unsafeCoerce# x -{-# INLINE happyIn7 #-} -happyOut7 :: (HappyAbsSyn ) -> (Double) -happyOut7 x = unsafeCoerce# x -{-# INLINE happyOut7 #-} -happyIn8 :: (TMeta) -> (HappyAbsSyn ) -happyIn8 x = unsafeCoerce# x -{-# INLINE happyIn8 #-} -happyOut8 :: (HappyAbsSyn ) -> (TMeta) -happyOut8 x = unsafeCoerce# x -{-# INLINE happyOut8 #-} -happyIn9 :: (CIdent) -> (HappyAbsSyn ) -happyIn9 x = unsafeCoerce# x -{-# INLINE happyIn9 #-} -happyOut9 :: (HappyAbsSyn ) -> (CIdent) -happyOut9 x = unsafeCoerce# x -{-# INLINE happyOut9 #-} -happyIn10 :: (Module) -> (HappyAbsSyn ) -happyIn10 x = unsafeCoerce# x -{-# INLINE happyIn10 #-} -happyOut10 :: (HappyAbsSyn ) -> (Module) -happyOut10 x = unsafeCoerce# x -{-# INLINE happyOut10 #-} -happyIn11 :: ([Decl]) -> (HappyAbsSyn ) -happyIn11 x = unsafeCoerce# x -{-# INLINE happyIn11 #-} -happyOut11 :: (HappyAbsSyn ) -> ([Decl]) -happyOut11 x = unsafeCoerce# x -{-# INLINE happyOut11 #-} -happyIn12 :: (Decl) -> (HappyAbsSyn ) -happyIn12 x = unsafeCoerce# x -{-# INLINE happyIn12 #-} -happyOut12 :: (HappyAbsSyn ) -> (Decl) -happyOut12 x = unsafeCoerce# x -{-# INLINE happyOut12 #-} -happyIn13 :: (ConsDecl) -> (HappyAbsSyn ) -happyIn13 x = unsafeCoerce# x -{-# INLINE happyIn13 #-} -happyOut13 :: (HappyAbsSyn ) -> (ConsDecl) -happyOut13 x = unsafeCoerce# x -{-# INLINE happyOut13 #-} -happyIn14 :: ([ConsDecl]) -> (HappyAbsSyn ) -happyIn14 x = unsafeCoerce# x -{-# INLINE happyIn14 #-} -happyOut14 :: (HappyAbsSyn ) -> ([ConsDecl]) -happyOut14 x = unsafeCoerce# x -{-# INLINE happyOut14 #-} -happyIn15 :: ([Pattern]) -> (HappyAbsSyn ) -happyIn15 x = unsafeCoerce# x -{-# INLINE happyIn15 #-} -happyOut15 :: (HappyAbsSyn ) -> ([Pattern]) -happyOut15 x = unsafeCoerce# x -{-# INLINE happyOut15 #-} -happyIn16 :: (Pattern) -> (HappyAbsSyn ) -happyIn16 x = unsafeCoerce# x -{-# INLINE happyIn16 #-} -happyOut16 :: (HappyAbsSyn ) -> (Pattern) -happyOut16 x = unsafeCoerce# x -{-# INLINE happyOut16 #-} -happyIn17 :: (FieldPattern) -> (HappyAbsSyn ) -happyIn17 x = unsafeCoerce# x -{-# INLINE happyIn17 #-} -happyOut17 :: (HappyAbsSyn ) -> (FieldPattern) -happyOut17 x = unsafeCoerce# x -{-# INLINE happyOut17 #-} -happyIn18 :: ([FieldPattern]) -> (HappyAbsSyn ) -happyIn18 x = unsafeCoerce# x -{-# INLINE happyIn18 #-} -happyOut18 :: (HappyAbsSyn ) -> ([FieldPattern]) -happyOut18 x = unsafeCoerce# x -{-# INLINE happyOut18 #-} -happyIn19 :: (PatternVariable) -> (HappyAbsSyn ) -happyIn19 x = unsafeCoerce# x -{-# INLINE happyIn19 #-} -happyOut19 :: (HappyAbsSyn ) -> (PatternVariable) -happyOut19 x = unsafeCoerce# x -{-# INLINE happyOut19 #-} -happyIn20 :: (Exp) -> (HappyAbsSyn ) -happyIn20 x = unsafeCoerce# x -{-# INLINE happyIn20 #-} -happyOut20 :: (HappyAbsSyn ) -> (Exp) -happyOut20 x = unsafeCoerce# x -{-# INLINE happyOut20 #-} -happyIn21 :: (LetDef) -> (HappyAbsSyn ) -happyIn21 x = unsafeCoerce# x -{-# INLINE happyIn21 #-} -happyOut21 :: (HappyAbsSyn ) -> (LetDef) -happyOut21 x = unsafeCoerce# x -{-# INLINE happyOut21 #-} -happyIn22 :: ([LetDef]) -> (HappyAbsSyn ) -happyIn22 x = unsafeCoerce# x -{-# INLINE happyIn22 #-} -happyOut22 :: (HappyAbsSyn ) -> ([LetDef]) -happyOut22 x = unsafeCoerce# x -{-# INLINE happyOut22 #-} -happyIn23 :: (Case) -> (HappyAbsSyn ) -happyIn23 x = unsafeCoerce# x -{-# INLINE happyIn23 #-} -happyOut23 :: (HappyAbsSyn ) -> (Case) -happyOut23 x = unsafeCoerce# x -{-# INLINE happyOut23 #-} -happyIn24 :: ([Case]) -> (HappyAbsSyn ) -happyIn24 x = unsafeCoerce# x -{-# INLINE happyIn24 #-} -happyOut24 :: (HappyAbsSyn ) -> ([Case]) -happyOut24 x = unsafeCoerce# x -{-# INLINE happyOut24 #-} -happyIn25 :: (Exp) -> (HappyAbsSyn ) -happyIn25 x = unsafeCoerce# x -{-# INLINE happyIn25 #-} -happyOut25 :: (HappyAbsSyn ) -> (Exp) -happyOut25 x = unsafeCoerce# x -{-# INLINE happyOut25 #-} -happyIn26 :: (Exp) -> (HappyAbsSyn ) -happyIn26 x = unsafeCoerce# x -{-# INLINE happyIn26 #-} -happyOut26 :: (HappyAbsSyn ) -> (Exp) -happyOut26 x = unsafeCoerce# x -{-# INLINE happyOut26 #-} -happyIn27 :: (Exp) -> (HappyAbsSyn ) -happyIn27 x = unsafeCoerce# x -{-# INLINE happyIn27 #-} -happyOut27 :: (HappyAbsSyn ) -> (Exp) -happyOut27 x = unsafeCoerce# x -{-# INLINE happyOut27 #-} -happyIn28 :: (Exp) -> (HappyAbsSyn ) -happyIn28 x = unsafeCoerce# x -{-# INLINE happyIn28 #-} -happyOut28 :: (HappyAbsSyn ) -> (Exp) -happyOut28 x = unsafeCoerce# x -{-# INLINE happyOut28 #-} -happyIn29 :: (FieldType) -> (HappyAbsSyn ) -happyIn29 x = unsafeCoerce# x -{-# INLINE happyIn29 #-} -happyOut29 :: (HappyAbsSyn ) -> (FieldType) -happyOut29 x = unsafeCoerce# x -{-# INLINE happyOut29 #-} -happyIn30 :: ([FieldType]) -> (HappyAbsSyn ) -happyIn30 x = unsafeCoerce# x -{-# INLINE happyIn30 #-} -happyOut30 :: (HappyAbsSyn ) -> ([FieldType]) -happyOut30 x = unsafeCoerce# x -{-# INLINE happyOut30 #-} -happyIn31 :: (FieldValue) -> (HappyAbsSyn ) -happyIn31 x = unsafeCoerce# x -{-# INLINE happyIn31 #-} -happyOut31 :: (HappyAbsSyn ) -> (FieldValue) -happyOut31 x = unsafeCoerce# x -{-# INLINE happyOut31 #-} -happyIn32 :: ([FieldValue]) -> (HappyAbsSyn ) -happyIn32 x = unsafeCoerce# x -{-# INLINE happyIn32 #-} -happyOut32 :: (HappyAbsSyn ) -> ([FieldValue]) -happyOut32 x = unsafeCoerce# x -{-# INLINE happyOut32 #-} -happyIn33 :: (Exp) -> (HappyAbsSyn ) -happyIn33 x = unsafeCoerce# x -{-# INLINE happyIn33 #-} -happyOut33 :: (HappyAbsSyn ) -> (Exp) -happyOut33 x = unsafeCoerce# x -{-# INLINE happyOut33 #-} -happyInTok :: Token -> (HappyAbsSyn ) -happyInTok x = unsafeCoerce# x -{-# INLINE happyInTok #-} -happyOutTok :: (HappyAbsSyn ) -> Token -happyOutTok x = unsafeCoerce# x -{-# INLINE happyOutTok #-} - -happyActOffsets :: HappyAddr -happyActOffsets = HappyA# "\x15\x00\x5f\x01\xcd\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd0\x00\x00\x00\x7c\x01\xde\x00\x00\x00\x00\x00\x4a\x01\x09\x00\x00\x00\x5f\x01\xdf\x00\xd7\x00\xd6\x00\x00\x00\x00\x00\x00\x00\x00\x00\x35\x00\xbc\x00\x00\x00\xd1\x00\xc7\x00\xcf\x00\x15\x00\x5f\x01\x5f\x01\xc6\x00\xc6\x00\xc6\x00\xbe\x00\x00\x00\xc5\x00\x00\x00\x74\x01\xcb\x00\xc0\x00\xac\x00\xb9\x00\x5f\x01\x00\x00\x00\x00\x5f\x01\x5f\x01\xc1\x00\xb8\x00\xbb\x00\xb7\x00\xb5\x00\xb3\x00\xaf\x00\xb0\x00\xa9\x00\x9d\x00\x00\x00\x00\x00\x00\x00\x5f\x01\x94\x00\x00\x00\x86\x00\x5f\x01\x00\x00\x86\x00\x5f\x01\x8f\x00\x84\x00\x5f\x01\x96\x01\x00\x00\x90\x00\x8b\x00\x00\x00\x00\x00\x8d\x00\x00\x00\x8c\x00\x8a\x00\x7a\x00\x89\x00\x00\x00\x00\x00\x5f\x01\x00\x00\x00\x00\x00\x00\x00\x00\x81\x00\x69\x00\x00\x00\x69\x00\x00\x00\x00\x00\x96\x01\x5f\x01\x5f\x01\x00\x00\x71\x00\x00\x00\x91\x01\x75\x00\x78\x00\x74\x00\x6d\x00\x65\x00\x5c\x00\x00\x00\x43\x00\x5f\x01\x00\x00\x43\x00\x96\x01\x00\x00\x00\x00\x5f\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"# - -happyGotoOffsets :: HappyAddr -happyGotoOffsets = HappyA# "\x4e\x00\x31\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x38\x01\x00\x00\x00\x00\x00\x00\x01\x00\x04\x00\x00\x00\x14\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x45\x00\x00\x00\x6a\x00\x0b\x01\xee\x00\x28\x00\x44\x00\x57\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x31\x00\x00\x00\xe5\x00\x00\x00\x00\x00\xc8\x00\xbf\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\xa2\x00\x00\x00\x00\x00\x02\x00\x99\x00\x00\x00\x1e\x00\x7c\x00\x00\x00\x03\x00\x73\x00\xb4\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x00\x00\x00\x00\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa3\x00\x00\x00\x3e\x00\xff\xff\x00\x00\xae\x01\x4d\x00\x30\x00\x00\x00\x00\x00\x00\x00\xba\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x7d\x00\x27\x00\x00\x00\x21\x00\x3e\x01\x00\x00\x00\x00\x0a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"# - -happyDefActions :: HappyAddr -happyDefActions = HappyA# "\xf7\xff\x00\x00\x00\x00\xfd\xff\xca\xff\xc9\xff\xc8\xff\xc7\xff\xcc\xff\x00\x00\xde\xff\xbd\xff\xd1\xff\xcf\xff\xd3\xff\x00\x00\x00\x00\xcb\xff\x00\x00\x00\x00\x00\x00\x00\x00\xfc\xff\xfb\xff\xfa\xff\xf9\xff\x00\x00\x00\x00\xf8\xff\xf6\xff\x00\x00\x00\x00\xf7\xff\x00\x00\x00\x00\xc4\xff\xc0\xff\xdc\xff\x00\x00\xe2\xff\x00\x00\xe1\xff\xe2\xff\x00\x00\x00\x00\x00\x00\xd2\xff\x00\x00\xd0\xff\xc6\xff\x00\x00\x00\x00\x00\x00\x00\x00\xdb\xff\x00\x00\x00\x00\xbf\xff\x00\x00\x00\x00\xc3\xff\x00\x00\xf2\xff\xf3\xff\xf5\xff\x00\x00\x00\x00\xce\xff\xc4\xff\x00\x00\xcd\xff\xc0\xff\x00\x00\x00\x00\xdc\xff\x00\x00\xd8\xff\xd5\xff\x00\x00\x00\x00\xe8\xff\xe7\xff\x00\x00\xea\xff\xd7\xff\x00\x00\x00\x00\x00\x00\xdd\xff\xda\xff\x00\x00\xc1\xff\xbe\xff\xc5\xff\xc2\xff\x00\x00\xf0\xff\xe0\xff\xe5\xff\xed\xff\xdf\xff\xd8\xff\x00\x00\x00\x00\xd4\xff\x00\x00\xd6\xff\x00\x00\x00\x00\xe4\xff\x00\x00\x00\x00\xef\xff\x00\x00\xf4\xff\xf0\xff\x00\x00\xe9\xff\xe5\xff\x00\x00\xec\xff\xeb\xff\x00\x00\xd9\xff\xe6\xff\xe3\xff\xf1\xff\xee\xff"# - -happyCheck :: HappyAddr -happyCheck = HappyA# "\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x04\x00\x04\x00\x04\x00\x0a\x00\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x0e\x00\x0f\x00\x08\x00\x0e\x00\x10\x00\x11\x00\x14\x00\x15\x00\x16\x00\x17\x00\x0f\x00\x18\x00\x19\x00\x04\x00\x1c\x00\x14\x00\x15\x00\x16\x00\x17\x00\x04\x00\x1a\x00\x0f\x00\x04\x00\x1c\x00\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x04\x00\x0c\x00\x0d\x00\x1a\x00\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x04\x00\x0f\x00\x02\x00\x1a\x00\x1b\x00\x05\x00\x14\x00\x15\x00\x16\x00\x17\x00\x0f\x00\x18\x00\x19\x00\x04\x00\x1c\x00\x14\x00\x15\x00\x16\x00\x17\x00\x04\x00\x04\x00\x0c\x00\x0d\x00\x1c\x00\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x04\x00\x0f\x00\x1a\x00\x1a\x00\x1b\x00\x04\x00\x14\x00\x15\x00\x16\x00\x17\x00\x0f\x00\x01\x00\x10\x00\x11\x00\x1c\x00\x14\x00\x15\x00\x16\x00\x17\x00\x04\x00\x02\x00\x06\x00\x07\x00\x1c\x00\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x04\x00\x01\x00\x05\x00\x0a\x00\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x04\x00\x0f\x00\x1a\x00\x03\x00\x08\x00\x09\x00\x14\x00\x15\x00\x16\x00\x17\x00\x0f\x00\x03\x00\x01\x00\x04\x00\x1c\x00\x14\x00\x15\x00\x16\x00\x17\x00\x1a\x00\x0a\x00\x09\x00\x07\x00\x1c\x00\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x1a\x00\x10\x00\x1a\x00\x04\x00\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x04\x00\x0f\x00\x15\x00\x01\x00\x08\x00\x09\x00\x14\x00\x15\x00\x16\x00\x17\x00\x0f\x00\x02\x00\x04\x00\x01\x00\x1c\x00\x14\x00\x15\x00\x16\x00\x17\x00\x05\x00\x04\x00\x01\x00\x05\x00\x1c\x00\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x03\x00\x0c\x00\x1a\x00\x07\x00\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x02\x00\x0f\x00\x0a\x00\x12\x00\x02\x00\x01\x00\x14\x00\x15\x00\x16\x00\x17\x00\x0f\x00\x1c\x00\x03\x00\x03\x00\x1c\x00\x14\x00\x15\x00\x16\x00\x17\x00\x1a\x00\x1a\x00\x03\x00\x16\x00\x1c\x00\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x0c\x00\xff\xff\x1c\x00\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\xff\xff\x0f\x00\xff\xff\xff\xff\xff\xff\xff\xff\x14\x00\x15\x00\x16\x00\x17\x00\x0f\x00\xff\xff\xff\xff\xff\xff\x1c\x00\x14\x00\x15\x00\x16\x00\x17\x00\xff\xff\xff\xff\xff\xff\xff\xff\x1c\x00\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\xff\xff\xff\xff\xff\xff\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\xff\xff\x0f\x00\xff\xff\xff\xff\xff\xff\xff\xff\x14\x00\x15\x00\x16\x00\x17\x00\x0f\x00\xff\xff\xff\xff\xff\xff\x1c\x00\x14\x00\x15\x00\x16\x00\x17\x00\xff\xff\xff\xff\xff\xff\xff\xff\x1c\x00\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\xff\xff\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\xff\xff\x00\x00\x01\x00\x0f\x00\xff\xff\x04\x00\xff\xff\xff\xff\x14\x00\x15\x00\x16\x00\x17\x00\x0b\x00\xff\xff\xff\xff\x0e\x00\x1c\x00\x16\x00\x17\x00\x06\x00\xff\xff\x08\x00\xff\xff\xff\xff\x0b\x00\xff\xff\x0d\x00\x0e\x00\xff\xff\xff\xff\x11\x00\xff\xff\x13\x00\x14\x00\xff\xff\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x06\x00\xff\xff\xff\xff\xff\xff\xff\xff\x0b\x00\xff\xff\x0d\x00\x0e\x00\xff\xff\xff\xff\x11\x00\xff\xff\x13\x00\x14\x00\xff\xff\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x06\x00\x07\x00\xff\xff\xff\xff\xff\xff\xff\xff\x0c\x00\x0d\x00\x06\x00\xff\xff\xff\xff\xff\xff\xff\xff\x13\x00\x14\x00\x0d\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x13\x00\x14\x00\xff\xff\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x06\x00\x07\x00\x08\x00\xff\xff\xff\xff\x06\x00\xff\xff\x08\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x13\x00\xff\xff\xff\xff\x16\x00\x17\x00\x13\x00\xff\xff\x1a\x00\x16\x00\x17\x00\x00\x00\x01\x00\x1a\x00\xff\xff\x04\x00\xff\xff\x00\x00\x01\x00\xff\xff\xff\xff\x04\x00\x0b\x00\x00\x00\x01\x00\x0e\x00\xff\xff\x04\x00\x0b\x00\x12\x00\x13\x00\x0e\x00\xff\xff\xff\xff\x0b\x00\x12\x00\x13\x00\x0e\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"# - -happyTable :: HappyAddr -happyTable = HappyA# "\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x2a\x00\x3b\x00\x35\x00\x27\x00\x6b\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x2b\x00\x2c\x00\x2a\x00\x28\x00\x36\x00\x59\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x7b\x00\x3c\x00\x5e\x00\x63\x00\x0e\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x38\x00\x1a\x00\x1f\x00\x6c\x00\x0e\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x3b\x00\x6d\x00\x7d\x00\x1a\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x30\x00\x7e\x00\x22\x00\x39\x00\x5c\x00\x23\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x68\x00\x3c\x00\x3d\x00\x6c\x00\x0e\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x38\x00\x1f\x00\x6d\x00\x6e\x00\x0e\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x35\x00\x69\x00\x1a\x00\x39\x00\x3a\x00\x73\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x61\x00\x74\x00\x36\x00\x37\x00\x0e\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x1a\x00\x75\x00\x40\x00\x1d\x00\x0e\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x76\x00\x77\x00\x78\x00\x7b\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x6f\x00\x58\x00\x1a\x00\x61\x00\x70\x00\x7f\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x5b\x00\x63\x00\x66\x00\x65\x00\x0e\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x1a\x00\x68\x00\x67\x00\x50\x00\x0e\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x1a\x00\x5b\x00\x1a\x00\x44\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x6f\x00\x5d\x00\x60\x00\x45\x00\x70\x00\x71\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x42\x00\x46\x00\x47\x00\x48\x00\x0e\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x49\x00\x4a\x00\x4b\x00\x4c\x00\x0e\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x4d\x00\x2e\x00\x1a\x00\x32\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x33\x00\x4d\x00\x34\x00\x35\x00\x42\x00\x21\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x4e\x00\xff\xff\x24\x00\x25\x00\x0e\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x1a\x00\x1a\x00\x26\x00\x04\x00\x0e\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x2e\x00\x00\x00\xff\xff\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x00\x00\x2c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x3e\x00\x00\x00\x00\x00\x00\x00\x0e\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0e\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x00\x00\x3f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x26\x00\x00\x00\x00\x00\x00\x00\x0e\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0e\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x00\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x00\x00\x50\x00\x51\x00\x09\x00\x00\x00\x27\x00\x00\x00\x00\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x7c\x00\x00\x00\x00\x00\x53\x00\x0e\x00\x2e\x00\x0d\x00\x10\x00\x00\x00\x2a\x00\x00\x00\x00\x00\x11\x00\x00\x00\x12\x00\x13\x00\x00\x00\x00\x00\x14\x00\x00\x00\x15\x00\x16\x00\x00\x00\x04\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x11\x00\x00\x00\x12\x00\x13\x00\x00\x00\x00\x00\x14\x00\x00\x00\x15\x00\x16\x00\x00\x00\x04\x00\x17\x00\x18\x00\x19\x00\x1a\x00\xcc\xff\xcc\xff\x00\x00\x00\x00\x00\x00\x00\x00\xcc\xff\xcc\xff\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\xcc\xff\xcc\xff\x12\x00\xcc\xff\xcc\xff\xcc\xff\xcc\xff\xcc\xff\x15\x00\x16\x00\x00\x00\x04\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x57\x00\x7a\x00\x2a\x00\x00\x00\x00\x00\x57\x00\x00\x00\x2a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x58\x00\x00\x00\x00\x00\x04\x00\x17\x00\x58\x00\x00\x00\x1a\x00\x04\x00\x17\x00\x50\x00\x51\x00\x1a\x00\x00\x00\x27\x00\x00\x00\x50\x00\x51\x00\x00\x00\x00\x00\x27\x00\x52\x00\x50\x00\x51\x00\x53\x00\x00\x00\x27\x00\x52\x00\x54\x00\x6a\x00\x53\x00\x00\x00\x00\x00\x78\x00\x54\x00\x55\x00\x53\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 (2, 66) [ - (2 , happyReduce_2), - (3 , happyReduce_3), - (4 , happyReduce_4), - (5 , happyReduce_5), - (6 , happyReduce_6), - (7 , happyReduce_7), - (8 , happyReduce_8), - (9 , happyReduce_9), - (10 , happyReduce_10), - (11 , happyReduce_11), - (12 , happyReduce_12), - (13 , happyReduce_13), - (14 , happyReduce_14), - (15 , happyReduce_15), - (16 , happyReduce_16), - (17 , happyReduce_17), - (18 , happyReduce_18), - (19 , happyReduce_19), - (20 , happyReduce_20), - (21 , happyReduce_21), - (22 , happyReduce_22), - (23 , happyReduce_23), - (24 , happyReduce_24), - (25 , happyReduce_25), - (26 , happyReduce_26), - (27 , happyReduce_27), - (28 , happyReduce_28), - (29 , happyReduce_29), - (30 , happyReduce_30), - (31 , happyReduce_31), - (32 , happyReduce_32), - (33 , happyReduce_33), - (34 , happyReduce_34), - (35 , happyReduce_35), - (36 , happyReduce_36), - (37 , happyReduce_37), - (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) - ] - -happy_n_terms = 29 :: Int -happy_n_nonterms = 29 :: Int - -happyReduce_2 = happySpecReduce_1 0# happyReduction_2 -happyReduction_2 happy_x_1 - = case happyOutTok happy_x_1 of { (PT _ (TL happy_var_1)) -> - happyIn5 - (happy_var_1 - )} - -happyReduce_3 = happySpecReduce_1 1# happyReduction_3 -happyReduction_3 happy_x_1 - = case happyOutTok happy_x_1 of { (PT _ (TI happy_var_1)) -> - happyIn6 - ((read happy_var_1) :: Integer - )} - -happyReduce_4 = happySpecReduce_1 2# happyReduction_4 -happyReduction_4 happy_x_1 - = case happyOutTok happy_x_1 of { (PT _ (TD happy_var_1)) -> - happyIn7 - ((read happy_var_1) :: Double - )} - -happyReduce_5 = happySpecReduce_1 3# happyReduction_5 -happyReduction_5 happy_x_1 - = case happyOutTok happy_x_1 of { (PT _ (T_TMeta happy_var_1)) -> - happyIn8 - (TMeta (happy_var_1) - )} - -happyReduce_6 = happySpecReduce_1 4# happyReduction_6 -happyReduction_6 happy_x_1 - = case happyOutTok happy_x_1 of { (PT _ (T_CIdent happy_var_1)) -> - happyIn9 - (CIdent (happy_var_1) - )} - -happyReduce_7 = happySpecReduce_1 5# happyReduction_7 -happyReduction_7 happy_x_1 - = case happyOut11 happy_x_1 of { happy_var_1 -> - happyIn10 - (Module happy_var_1 - )} - -happyReduce_8 = happySpecReduce_0 6# happyReduction_8 -happyReduction_8 = happyIn11 - ([] - ) - -happyReduce_9 = happySpecReduce_1 6# happyReduction_9 -happyReduction_9 happy_x_1 - = case happyOut12 happy_x_1 of { happy_var_1 -> - happyIn11 - ((:[]) happy_var_1 - )} - -happyReduce_10 = happySpecReduce_3 6# happyReduction_10 -happyReduction_10 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut12 happy_x_1 of { happy_var_1 -> - case happyOut11 happy_x_3 of { happy_var_3 -> - happyIn11 - ((:) happy_var_1 happy_var_3 - )}} - -happyReduce_11 = happyReduce 8# 7# happyReduction_11 -happyReduction_11 (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 happyOut9 happy_x_2 of { happy_var_2 -> - case happyOut20 happy_x_4 of { happy_var_4 -> - case happyOut14 happy_x_7 of { happy_var_7 -> - happyIn12 - (DataDecl happy_var_2 happy_var_4 happy_var_7 - ) `HappyStk` happyRest}}} - -happyReduce_12 = happySpecReduce_3 7# happyReduction_12 -happyReduction_12 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut9 happy_x_1 of { happy_var_1 -> - case happyOut20 happy_x_3 of { happy_var_3 -> - happyIn12 - (TypeDecl happy_var_1 happy_var_3 - )}} - -happyReduce_13 = happySpecReduce_3 7# happyReduction_13 -happyReduction_13 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut9 happy_x_1 of { happy_var_1 -> - case happyOut20 happy_x_3 of { happy_var_3 -> - happyIn12 - (ValueDecl happy_var_1 happy_var_3 - )}} - -happyReduce_14 = happySpecReduce_3 8# happyReduction_14 -happyReduction_14 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut9 happy_x_1 of { happy_var_1 -> - case happyOut20 happy_x_3 of { happy_var_3 -> - happyIn13 - (ConsDecl happy_var_1 happy_var_3 - )}} - -happyReduce_15 = happySpecReduce_0 9# happyReduction_15 -happyReduction_15 = happyIn14 - ([] - ) - -happyReduce_16 = happySpecReduce_1 9# happyReduction_16 -happyReduction_16 happy_x_1 - = case happyOut13 happy_x_1 of { happy_var_1 -> - happyIn14 - ((:[]) happy_var_1 - )} - -happyReduce_17 = happySpecReduce_3 9# happyReduction_17 -happyReduction_17 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut13 happy_x_1 of { happy_var_1 -> - case happyOut14 happy_x_3 of { happy_var_3 -> - happyIn14 - ((:) happy_var_1 happy_var_3 - )}} - -happyReduce_18 = happySpecReduce_0 10# happyReduction_18 -happyReduction_18 = happyIn15 - ([] - ) - -happyReduce_19 = happySpecReduce_2 10# happyReduction_19 -happyReduction_19 happy_x_2 - happy_x_1 - = case happyOut15 happy_x_1 of { happy_var_1 -> - case happyOut16 happy_x_2 of { happy_var_2 -> - happyIn15 - (flip (:) happy_var_1 happy_var_2 - )}} - -happyReduce_20 = happyReduce 4# 11# happyReduction_20 -happyReduction_20 (happy_x_4 `HappyStk` - happy_x_3 `HappyStk` - happy_x_2 `HappyStk` - happy_x_1 `HappyStk` - happyRest) - = case happyOut9 happy_x_2 of { happy_var_2 -> - case happyOut15 happy_x_3 of { happy_var_3 -> - happyIn16 - (PCons happy_var_2 (reverse happy_var_3) - ) `HappyStk` happyRest}} - -happyReduce_21 = happySpecReduce_1 11# happyReduction_21 -happyReduction_21 happy_x_1 - = case happyOut19 happy_x_1 of { happy_var_1 -> - happyIn16 - (PVar happy_var_1 - )} - -happyReduce_22 = happyReduce 4# 11# happyReduction_22 -happyReduction_22 (happy_x_4 `HappyStk` - happy_x_3 `HappyStk` - happy_x_2 `HappyStk` - happy_x_1 `HappyStk` - happyRest) - = case happyOut18 happy_x_3 of { happy_var_3 -> - happyIn16 - (PRec happy_var_3 - ) `HappyStk` happyRest} - -happyReduce_23 = happySpecReduce_1 11# happyReduction_23 -happyReduction_23 happy_x_1 - = case happyOut5 happy_x_1 of { happy_var_1 -> - happyIn16 - (PStr happy_var_1 - )} - -happyReduce_24 = happySpecReduce_1 11# happyReduction_24 -happyReduction_24 happy_x_1 - = case happyOut6 happy_x_1 of { happy_var_1 -> - happyIn16 - (PInt happy_var_1 - )} - -happyReduce_25 = happySpecReduce_3 12# happyReduction_25 -happyReduction_25 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut9 happy_x_1 of { happy_var_1 -> - case happyOut16 happy_x_3 of { happy_var_3 -> - happyIn17 - (FieldPattern happy_var_1 happy_var_3 - )}} - -happyReduce_26 = happySpecReduce_0 13# happyReduction_26 -happyReduction_26 = happyIn18 - ([] - ) - -happyReduce_27 = happySpecReduce_1 13# happyReduction_27 -happyReduction_27 happy_x_1 - = case happyOut17 happy_x_1 of { happy_var_1 -> - happyIn18 - ((:[]) happy_var_1 - )} - -happyReduce_28 = happySpecReduce_3 13# happyReduction_28 -happyReduction_28 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut17 happy_x_1 of { happy_var_1 -> - case happyOut18 happy_x_3 of { happy_var_3 -> - happyIn18 - ((:) happy_var_1 happy_var_3 - )}} - -happyReduce_29 = happySpecReduce_1 14# happyReduction_29 -happyReduction_29 happy_x_1 - = case happyOut9 happy_x_1 of { happy_var_1 -> - happyIn19 - (PVVar happy_var_1 - )} - -happyReduce_30 = happySpecReduce_1 14# happyReduction_30 -happyReduction_30 happy_x_1 - = happyIn19 - (PVWild - ) - -happyReduce_31 = happyReduce 6# 15# 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 happyOut22 happy_x_3 of { happy_var_3 -> - case happyOut20 happy_x_6 of { happy_var_6 -> - happyIn20 - (ELet happy_var_3 happy_var_6 - ) `HappyStk` happyRest}} - -happyReduce_32 = happyReduce 6# 15# happyReduction_32 -happyReduction_32 (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 happyOut20 happy_x_2 of { happy_var_2 -> - case happyOut24 happy_x_5 of { happy_var_5 -> - happyIn20 - (ECase happy_var_2 happy_var_5 - ) `HappyStk` happyRest}} - -happyReduce_33 = happySpecReduce_1 15# happyReduction_33 -happyReduction_33 happy_x_1 - = case happyOut25 happy_x_1 of { happy_var_1 -> - happyIn20 - (happy_var_1 - )} - -happyReduce_34 = happySpecReduce_3 16# happyReduction_34 -happyReduction_34 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut9 happy_x_1 of { happy_var_1 -> - case happyOut20 happy_x_3 of { happy_var_3 -> - happyIn21 - (LetDef happy_var_1 happy_var_3 - )}} - -happyReduce_35 = happySpecReduce_0 17# happyReduction_35 -happyReduction_35 = happyIn22 - ([] - ) - -happyReduce_36 = happySpecReduce_1 17# happyReduction_36 -happyReduction_36 happy_x_1 - = case happyOut21 happy_x_1 of { happy_var_1 -> - happyIn22 - ((:[]) happy_var_1 - )} - -happyReduce_37 = happySpecReduce_3 17# happyReduction_37 -happyReduction_37 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut21 happy_x_1 of { happy_var_1 -> - case happyOut22 happy_x_3 of { happy_var_3 -> - happyIn22 - ((:) happy_var_1 happy_var_3 - )}} - -happyReduce_38 = happyReduce 5# 18# happyReduction_38 -happyReduction_38 (happy_x_5 `HappyStk` - happy_x_4 `HappyStk` - happy_x_3 `HappyStk` - happy_x_2 `HappyStk` - happy_x_1 `HappyStk` - happyRest) - = case happyOut16 happy_x_1 of { happy_var_1 -> - case happyOut20 happy_x_3 of { happy_var_3 -> - case happyOut20 happy_x_5 of { happy_var_5 -> - happyIn23 - (Case happy_var_1 happy_var_3 happy_var_5 - ) `HappyStk` happyRest}}} - -happyReduce_39 = happySpecReduce_0 19# happyReduction_39 -happyReduction_39 = happyIn24 - ([] - ) - -happyReduce_40 = happySpecReduce_1 19# happyReduction_40 -happyReduction_40 happy_x_1 - = case happyOut23 happy_x_1 of { happy_var_1 -> - happyIn24 - ((:[]) happy_var_1 - )} - -happyReduce_41 = happySpecReduce_3 19# happyReduction_41 -happyReduction_41 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut23 happy_x_1 of { happy_var_1 -> - case happyOut24 happy_x_3 of { happy_var_3 -> - happyIn24 - ((:) happy_var_1 happy_var_3 - )}} - -happyReduce_42 = happyReduce 4# 20# happyReduction_42 -happyReduction_42 (happy_x_4 `HappyStk` - happy_x_3 `HappyStk` - happy_x_2 `HappyStk` - happy_x_1 `HappyStk` - happyRest) - = case happyOut19 happy_x_2 of { happy_var_2 -> - case happyOut20 happy_x_4 of { happy_var_4 -> - happyIn25 - (EAbs happy_var_2 happy_var_4 - ) `HappyStk` happyRest}} - -happyReduce_43 = happyReduce 7# 20# happyReduction_43 -happyReduction_43 (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_2 of { happy_var_2 -> - case happyOut20 happy_x_4 of { happy_var_4 -> - case happyOut20 happy_x_7 of { happy_var_7 -> - happyIn25 - (EPi happy_var_2 happy_var_4 happy_var_7 - ) `HappyStk` happyRest}}} - -happyReduce_44 = happySpecReduce_1 20# happyReduction_44 -happyReduction_44 happy_x_1 - = case happyOut33 happy_x_1 of { happy_var_1 -> - happyIn25 - (happy_var_1 - )} - -happyReduce_45 = happySpecReduce_2 21# happyReduction_45 -happyReduction_45 happy_x_2 - happy_x_1 - = case happyOut26 happy_x_1 of { happy_var_1 -> - case happyOut27 happy_x_2 of { happy_var_2 -> - happyIn26 - (EApp happy_var_1 happy_var_2 - )}} - -happyReduce_46 = happySpecReduce_1 21# happyReduction_46 -happyReduction_46 happy_x_1 - = case happyOut27 happy_x_1 of { happy_var_1 -> - happyIn26 - (happy_var_1 - )} - -happyReduce_47 = happySpecReduce_3 22# happyReduction_47 -happyReduction_47 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut27 happy_x_1 of { happy_var_1 -> - case happyOut9 happy_x_3 of { happy_var_3 -> - happyIn27 - (EProj happy_var_1 happy_var_3 - )}} - -happyReduce_48 = happySpecReduce_1 22# happyReduction_48 -happyReduction_48 happy_x_1 - = case happyOut28 happy_x_1 of { happy_var_1 -> - happyIn27 - (happy_var_1 - )} - -happyReduce_49 = happyReduce 4# 23# happyReduction_49 -happyReduction_49 (happy_x_4 `HappyStk` - happy_x_3 `HappyStk` - happy_x_2 `HappyStk` - happy_x_1 `HappyStk` - happyRest) - = case happyOut30 happy_x_3 of { happy_var_3 -> - happyIn28 - (ERecType happy_var_3 - ) `HappyStk` happyRest} - -happyReduce_50 = happyReduce 4# 23# happyReduction_50 -happyReduction_50 (happy_x_4 `HappyStk` - happy_x_3 `HappyStk` - happy_x_2 `HappyStk` - happy_x_1 `HappyStk` - happyRest) - = case happyOut32 happy_x_3 of { happy_var_3 -> - happyIn28 - (ERec happy_var_3 - ) `HappyStk` happyRest} - -happyReduce_51 = happySpecReduce_1 23# happyReduction_51 -happyReduction_51 happy_x_1 - = case happyOut9 happy_x_1 of { happy_var_1 -> - happyIn28 - (EVar happy_var_1 - )} - -happyReduce_52 = happySpecReduce_1 23# happyReduction_52 -happyReduction_52 happy_x_1 - = happyIn28 - (EType - ) - -happyReduce_53 = happySpecReduce_1 23# happyReduction_53 -happyReduction_53 happy_x_1 - = case happyOut5 happy_x_1 of { happy_var_1 -> - happyIn28 - (EStr happy_var_1 - )} - -happyReduce_54 = happySpecReduce_1 23# happyReduction_54 -happyReduction_54 happy_x_1 - = case happyOut6 happy_x_1 of { happy_var_1 -> - happyIn28 - (EInteger happy_var_1 - )} - -happyReduce_55 = happySpecReduce_1 23# happyReduction_55 -happyReduction_55 happy_x_1 - = case happyOut7 happy_x_1 of { happy_var_1 -> - happyIn28 - (EDouble happy_var_1 - )} - -happyReduce_56 = happySpecReduce_1 23# happyReduction_56 -happyReduction_56 happy_x_1 - = case happyOut8 happy_x_1 of { happy_var_1 -> - happyIn28 - (EMeta happy_var_1 - )} - -happyReduce_57 = happySpecReduce_3 23# happyReduction_57 -happyReduction_57 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut20 happy_x_2 of { happy_var_2 -> - happyIn28 - (happy_var_2 - )} - -happyReduce_58 = happySpecReduce_3 24# happyReduction_58 -happyReduction_58 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut9 happy_x_1 of { happy_var_1 -> - case happyOut20 happy_x_3 of { happy_var_3 -> - happyIn29 - (FieldType happy_var_1 happy_var_3 - )}} - -happyReduce_59 = happySpecReduce_0 25# happyReduction_59 -happyReduction_59 = happyIn30 - ([] - ) - -happyReduce_60 = happySpecReduce_1 25# happyReduction_60 -happyReduction_60 happy_x_1 - = case happyOut29 happy_x_1 of { happy_var_1 -> - happyIn30 - ((:[]) happy_var_1 - )} - -happyReduce_61 = happySpecReduce_3 25# happyReduction_61 -happyReduction_61 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut29 happy_x_1 of { happy_var_1 -> - case happyOut30 happy_x_3 of { happy_var_3 -> - happyIn30 - ((:) happy_var_1 happy_var_3 - )}} - -happyReduce_62 = happySpecReduce_3 26# happyReduction_62 -happyReduction_62 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut9 happy_x_1 of { happy_var_1 -> - case happyOut20 happy_x_3 of { happy_var_3 -> - happyIn31 - (FieldValue happy_var_1 happy_var_3 - )}} - -happyReduce_63 = happySpecReduce_0 27# happyReduction_63 -happyReduction_63 = happyIn32 - ([] - ) - -happyReduce_64 = happySpecReduce_1 27# happyReduction_64 -happyReduction_64 happy_x_1 - = case happyOut31 happy_x_1 of { happy_var_1 -> - happyIn32 - ((:[]) happy_var_1 - )} - -happyReduce_65 = happySpecReduce_3 27# happyReduction_65 -happyReduction_65 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut31 happy_x_1 of { happy_var_1 -> - case happyOut32 happy_x_3 of { happy_var_3 -> - happyIn32 - ((:) happy_var_1 happy_var_3 - )}} - -happyReduce_66 = happySpecReduce_1 28# happyReduction_66 -happyReduction_66 happy_x_1 - = case happyOut26 happy_x_1 of { happy_var_1 -> - happyIn33 - (happy_var_1 - )} - -happyNewToken action sts stk [] = - happyDoAction 28# (error "reading EOF!") action sts stk [] - -happyNewToken action sts stk (tk:tks) = - let cont i = happyDoAction i tk action sts stk tks in - case tk of { - PT _ (TS ";") -> cont 1#; - PT _ (TS ":") -> cont 2#; - PT _ (TS "{") -> cont 3#; - PT _ (TS "}") -> cont 4#; - PT _ (TS "=") -> cont 5#; - PT _ (TS "(") -> cont 6#; - PT _ (TS ")") -> cont 7#; - PT _ (TS "_") -> cont 8#; - PT _ (TS "|") -> cont 9#; - PT _ (TS "->") -> cont 10#; - PT _ (TS "\\") -> cont 11#; - PT _ (TS ".") -> cont 12#; - PT _ (TS "Type") -> cont 13#; - PT _ (TS "case") -> cont 14#; - PT _ (TS "data") -> cont 15#; - PT _ (TS "in") -> cont 16#; - PT _ (TS "let") -> cont 17#; - PT _ (TS "of") -> cont 18#; - PT _ (TS "rec") -> cont 19#; - PT _ (TS "sig") -> cont 20#; - PT _ (TS "where") -> cont 21#; - PT _ (TL happy_dollar_dollar) -> cont 22#; - PT _ (TI happy_dollar_dollar) -> cont 23#; - PT _ (TD happy_dollar_dollar) -> cont 24#; - PT _ (T_TMeta happy_dollar_dollar) -> cont 25#; - PT _ (T_CIdent happy_dollar_dollar) -> cont 26#; - _ -> cont 27#; - _ -> happyError' (tk:tks) - } - -happyError_ tk tks = happyError' (tk:tks) - -happyThen :: () => Err a -> (a -> Err b) -> Err b -happyThen = (thenM) -happyReturn :: () => a -> Err a -happyReturn = (returnM) -happyThen1 m k tks = (thenM) m (\a -> k a tks) -happyReturn1 :: () => a -> b -> Err a -happyReturn1 = \a tks -> (returnM) a -happyError' :: () => [Token] -> Err a -happyError' = happyError - -pModule tks = happySomeParser where - happySomeParser = happyThen (happyParse 0# tks) (\x -> happyReturn (happyOut10 x)) - -pExp tks = happySomeParser where - happySomeParser = happyThen (happyParse 1# tks) (\x -> happyReturn (happyOut20 x)) - -happySeq = happyDontSeq - -returnM :: a -> Err a -returnM = return - -thenM :: Err a -> (a -> Err b) -> Err b -thenM = (>>=) - -happyError :: [Token] -> Err a -happyError ts = - Bad $ "syntax error at " ++ tokenPos ts ++ if null ts then [] else (" before " ++ unwords (map prToken (take 4 ts))) - -myLexer = tokens -{-# LINE 1 "GenericTemplate.hs" #-} -{-# LINE 1 "" #-} -{-# LINE 1 "" #-} -{-# LINE 1 "GenericTemplate.hs" #-} --- $Id$ - -{-# 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) (\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 - -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/Transfer/Core/Par.y b/src/Transfer/Core/Par.y deleted file mode 100644 index ceeaa313f..000000000 --- a/src/Transfer/Core/Par.y +++ /dev/null @@ -1,203 +0,0 @@ --- This Happy file was machine-generated by the BNF converter -{ -{-# OPTIONS -fno-warn-incomplete-patterns -fno-warn-overlapping-patterns #-} -module Transfer.Core.Par where -import Transfer.Core.Abs -import Transfer.Core.Lex -import Transfer.ErrM -} - -%name pModule Module -%name pExp Exp - --- no lexer declaration -%monad { Err } { thenM } { returnM } -%tokentype { Token } - -%token - ';' { PT _ (TS ";") } - ':' { PT _ (TS ":") } - '{' { PT _ (TS "{") } - '}' { PT _ (TS "}") } - '=' { PT _ (TS "=") } - '(' { PT _ (TS "(") } - ')' { PT _ (TS ")") } - '_' { PT _ (TS "_") } - '|' { PT _ (TS "|") } - '->' { PT _ (TS "->") } - '\\' { PT _ (TS "\\") } - '.' { PT _ (TS ".") } - 'Type' { PT _ (TS "Type") } - 'case' { PT _ (TS "case") } - 'data' { PT _ (TS "data") } - 'in' { PT _ (TS "in") } - 'let' { PT _ (TS "let") } - 'of' { PT _ (TS "of") } - 'rec' { PT _ (TS "rec") } - 'sig' { PT _ (TS "sig") } - 'where' { PT _ (TS "where") } - -L_quoted { PT _ (TL $$) } -L_integ { PT _ (TI $$) } -L_doubl { PT _ (TD $$) } -L_TMeta { PT _ (T_TMeta $$) } -L_CIdent { PT _ (T_CIdent $$) } -L_err { _ } - - -%% - -String :: { String } : L_quoted { $1 } -Integer :: { Integer } : L_integ { (read $1) :: Integer } -Double :: { Double } : L_doubl { (read $1) :: Double } -TMeta :: { TMeta} : L_TMeta { TMeta ($1)} -CIdent :: { CIdent} : L_CIdent { CIdent ($1)} - -Module :: { Module } -Module : ListDecl { Module $1 } - - -ListDecl :: { [Decl] } -ListDecl : {- empty -} { [] } - | Decl { (:[]) $1 } - | Decl ';' ListDecl { (:) $1 $3 } - - -Decl :: { Decl } -Decl : 'data' CIdent ':' Exp 'where' '{' ListConsDecl '}' { DataDecl $2 $4 $7 } - | CIdent ':' Exp { TypeDecl $1 $3 } - | CIdent '=' Exp { ValueDecl $1 $3 } - - -ConsDecl :: { ConsDecl } -ConsDecl : CIdent ':' Exp { ConsDecl $1 $3 } - - -ListConsDecl :: { [ConsDecl] } -ListConsDecl : {- empty -} { [] } - | ConsDecl { (:[]) $1 } - | ConsDecl ';' ListConsDecl { (:) $1 $3 } - - -ListPattern :: { [Pattern] } -ListPattern : {- empty -} { [] } - | ListPattern Pattern { flip (:) $1 $2 } - - -Pattern :: { Pattern } -Pattern : '(' CIdent ListPattern ')' { PCons $2 (reverse $3) } - | PatternVariable { PVar $1 } - | 'rec' '{' ListFieldPattern '}' { PRec $3 } - | String { PStr $1 } - | Integer { PInt $1 } - - -FieldPattern :: { FieldPattern } -FieldPattern : CIdent '=' Pattern { FieldPattern $1 $3 } - - -ListFieldPattern :: { [FieldPattern] } -ListFieldPattern : {- empty -} { [] } - | FieldPattern { (:[]) $1 } - | FieldPattern ';' ListFieldPattern { (:) $1 $3 } - - -PatternVariable :: { PatternVariable } -PatternVariable : CIdent { PVVar $1 } - | '_' { PVWild } - - -Exp :: { Exp } -Exp : 'let' '{' ListLetDef '}' 'in' Exp { ELet $3 $6 } - | 'case' Exp 'of' '{' ListCase '}' { ECase $2 $5 } - | Exp1 { $1 } - - -LetDef :: { LetDef } -LetDef : CIdent '=' Exp { LetDef $1 $3 } - - -ListLetDef :: { [LetDef] } -ListLetDef : {- empty -} { [] } - | LetDef { (:[]) $1 } - | LetDef ';' ListLetDef { (:) $1 $3 } - - -Case :: { Case } -Case : Pattern '|' Exp '->' Exp { Case $1 $3 $5 } - - -ListCase :: { [Case] } -ListCase : {- empty -} { [] } - | Case { (:[]) $1 } - | Case ';' ListCase { (:) $1 $3 } - - -Exp1 :: { Exp } -Exp1 : '\\' PatternVariable '->' Exp { EAbs $2 $4 } - | '(' PatternVariable ':' Exp ')' '->' Exp { EPi $2 $4 $7 } - | Exp2 { $1 } - - -Exp3 :: { Exp } -Exp3 : Exp3 Exp4 { EApp $1 $2 } - | Exp4 { $1 } - - -Exp4 :: { Exp } -Exp4 : Exp4 '.' CIdent { EProj $1 $3 } - | Exp5 { $1 } - - -Exp5 :: { Exp } -Exp5 : 'sig' '{' ListFieldType '}' { ERecType $3 } - | 'rec' '{' ListFieldValue '}' { ERec $3 } - | CIdent { EVar $1 } - | 'Type' { EType } - | String { EStr $1 } - | Integer { EInteger $1 } - | Double { EDouble $1 } - | TMeta { EMeta $1 } - | '(' Exp ')' { $2 } - - -FieldType :: { FieldType } -FieldType : CIdent ':' Exp { FieldType $1 $3 } - - -ListFieldType :: { [FieldType] } -ListFieldType : {- empty -} { [] } - | FieldType { (:[]) $1 } - | FieldType ';' ListFieldType { (:) $1 $3 } - - -FieldValue :: { FieldValue } -FieldValue : CIdent '=' Exp { FieldValue $1 $3 } - - -ListFieldValue :: { [FieldValue] } -ListFieldValue : {- empty -} { [] } - | FieldValue { (:[]) $1 } - | FieldValue ';' ListFieldValue { (:) $1 $3 } - - -Exp2 :: { Exp } -Exp2 : Exp3 { $1 } - - - -{ - -returnM :: a -> Err a -returnM = return - -thenM :: Err a -> (a -> Err b) -> Err b -thenM = (>>=) - -happyError :: [Token] -> Err a -happyError ts = - Bad $ "syntax error at " ++ tokenPos ts ++ if null ts then [] else (" before " ++ unwords (map prToken (take 4 ts))) - -myLexer = tokens -} - diff --git a/src/Transfer/Core/Print.hs b/src/Transfer/Core/Print.hs deleted file mode 100644 index 50929716a..000000000 --- a/src/Transfer/Core/Print.hs +++ /dev/null @@ -1,155 +0,0 @@ -{-# OPTIONS_GHC -fglasgow-exts #-} -module Transfer.Core.Print where - --- pretty-printer generated by the BNF converter - -import Transfer.Core.Abs -import Data.Char -import Data.List (intersperse) - --- 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 - -unwordsD :: [Doc] -> Doc -unwordsD = concatD . intersperse (doc (showChar ' ')) - -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 - -instance Print Char where - prt _ s = doc (showChar '\'' . mkEsc '\'' s . showChar '\'') - -instance Print String where - prt _ 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 prPrec _i 0 (concatD [prt 0 decls]) - DataDecl cident exp consdecls -> prPrec _i 0 (concatD [doc (showString "data") , prt 0 cident , doc (showString ":") , prt 0 exp , doc (showString "where") , doc (showString "{") , prt 0 consdecls , doc (showString "}")]) - TypeDecl cident exp -> prPrec _i 0 (concatD [prt 0 cident , doc (showString ":") , prt 0 exp]) - ValueDecl cident exp -> prPrec _i 0 (concatD [prt 0 cident , doc (showString "=") , prt 0 exp]) - ConsDecl cident exp -> prPrec _i 0 (concatD [prt 0 cident , doc (showString ":") , prt 0 exp]) - PCons cident patterns -> prPrec _i 0 (concatD [doc (showString "(") , prt 0 cident , prt 0 patterns , doc (showString ")")]) - PVar patternvariable -> prPrec _i 0 (concatD [prt 0 patternvariable]) - PRec fieldpatterns -> prPrec _i 0 (concatD [doc (showString "rec") , doc (showString "{") , prt 0 fieldpatterns , doc (showString "}")]) - PStr str -> prPrec _i 0 (concatD [prt 0 str]) - PInt n -> prPrec _i 0 (concatD [prt 0 n]) - FieldPattern cident pattern -> prPrec _i 0 (concatD [prt 0 cident , doc (showString "=") , prt 0 pattern]) - PVVar cident -> prPrec _i 0 (concatD [prt 0 cident]) - PVWild -> prPrec _i 0 (concatD [doc (showString "_")]) - ELet letdefs exp -> prPrec _i 0 (concatD [doc (showString "let") , doc (showString "{") , prt 0 letdefs , doc (showString "}") , doc (showString "in") , prt 0 exp]) - ECase exp cases -> prPrec _i 0 (concatD [doc (showString "case") , prt 0 exp , doc (showString "of") , doc (showString "{") , prt 0 cases , doc (showString "}")]) - EAbs patternvariable exp -> prPrec _i 1 (concatD [doc (showString "\\") , prt 0 patternvariable , doc (showString "->") , prt 0 exp]) - EPi patternvariable exp0 exp1 -> prPrec _i 1 (concatD [doc (showString "(") , prt 0 patternvariable , doc (showString ":") , prt 0 exp0 , doc (showString ")") , doc (showString "->") , prt 0 exp1]) - EApp exp0 exp1 -> prPrec _i 3 (concatD [prt 3 exp0 , prt 4 exp1]) - EProj exp cident -> prPrec _i 4 (concatD [prt 4 exp , doc (showString ".") , prt 0 cident]) - ERecType fieldtypes -> prPrec _i 5 (concatD [doc (showString "sig") , doc (showString "{") , prt 0 fieldtypes , doc (showString "}")]) - ERec fieldvalues -> prPrec _i 5 (concatD [doc (showString "rec") , doc (showString "{") , prt 0 fieldvalues , doc (showString "}")]) - EVar cident -> prPrec _i 5 (concatD [prt 0 cident]) - EType -> prPrec _i 5 (concatD [doc (showString "Type")]) - EStr str -> prPrec _i 5 (concatD [prt 0 str]) - EInteger n -> prPrec _i 5 (concatD [prt 0 n]) - EDouble d -> prPrec _i 5 (concatD [prt 0 d]) - EMeta tmeta -> prPrec _i 5 (concatD [prt 0 tmeta]) - LetDef cident exp -> prPrec _i 0 (concatD [prt 0 cident , doc (showString "=") , prt 0 exp]) - Case pattern exp0 exp1 -> prPrec _i 0 (concatD [prt 0 pattern , doc (showString "|") , prt 0 exp0 , doc (showString "->") , prt 0 exp1]) - FieldType cident exp -> prPrec _i 0 (concatD [prt 0 cident , doc (showString ":") , prt 0 exp]) - FieldValue cident exp -> prPrec _i 0 (concatD [prt 0 cident , doc (showString "=") , prt 0 exp]) - TMeta str -> prPrec _i 0 (doc (showString str)) - CIdent str -> prPrec _i 0 (doc (showString str)) - -instance Print [Decl] where - prt _ es = case es of - [] -> (concatD []) - [x] -> (concatD [prt 0 x]) - x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) -instance Print [ConsDecl] where - prt _ es = case es of - [] -> (concatD []) - [x] -> (concatD [prt 0 x]) - x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) -instance Print [Pattern] where - prt _ es = case es of - [] -> (concatD []) - x:xs -> (concatD [prt 0 x , prt 0 xs]) -instance Print [FieldPattern] where - prt _ es = case es of - [] -> (concatD []) - [x] -> (concatD [prt 0 x]) - x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) -instance Print [LetDef] where - prt _ 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 _ es = case es of - [] -> (concatD []) - [x] -> (concatD [prt 0 x]) - x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) -instance Print [FieldType] where - prt _ es = case es of - [] -> (concatD []) - [x] -> (concatD [prt 0 x]) - x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) -instance Print [FieldValue] where - prt _ es = case es of - [] -> (concatD []) - [x] -> (concatD [prt 0 x]) - x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) diff --git a/src/Transfer/Core/Skel.hs b/src/Transfer/Core/Skel.hs deleted file mode 100644 index 005ae92b1..000000000 --- a/src/Transfer/Core/Skel.hs +++ /dev/null @@ -1,119 +0,0 @@ -module Transfer.Core.Skel where - --- Haskell module generated by the BNF converter - -import Transfer.Core.Abs -import Transfer.ErrM -type Result = Err String - -failure :: Show a => a -> Result -failure x = Bad $ "Undefined case: " ++ show x - -transTree :: Tree c -> Result -transTree t = case t of - Module decls -> failure t - DataDecl cident exp consdecls -> failure t - TypeDecl cident exp -> failure t - ValueDecl cident exp -> failure t - ConsDecl cident exp -> failure t - PCons cident patterns -> failure t - PVar patternvariable -> failure t - PRec fieldpatterns -> failure t - PStr str -> failure t - PInt n -> failure t - FieldPattern cident pattern -> failure t - PVVar cident -> failure t - PVWild -> failure t - ELet letdefs exp -> failure t - ECase exp cases -> failure t - EAbs patternvariable exp -> failure t - EPi patternvariable exp0 exp1 -> failure t - EApp exp0 exp1 -> failure t - EProj exp cident -> failure t - ERecType fieldtypes -> failure t - ERec fieldvalues -> failure t - EVar cident -> failure t - EType -> failure t - EStr str -> failure t - EInteger n -> failure t - EDouble d -> failure t - EMeta tmeta -> failure t - LetDef cident exp -> failure t - Case pattern exp0 exp1 -> failure t - FieldType cident exp -> failure t - FieldValue cident exp -> failure t - TMeta str -> failure t - CIdent str -> failure t - -transModule :: Module -> Result -transModule t = case t of - Module decls -> failure t - -transDecl :: Decl -> Result -transDecl t = case t of - DataDecl cident exp consdecls -> failure t - TypeDecl cident exp -> failure t - ValueDecl cident exp -> failure t - -transConsDecl :: ConsDecl -> Result -transConsDecl t = case t of - ConsDecl cident exp -> failure t - -transPattern :: Pattern -> Result -transPattern t = case t of - PCons cident patterns -> failure t - PVar patternvariable -> failure t - PRec fieldpatterns -> failure t - PStr str -> failure t - PInt n -> failure t - -transFieldPattern :: FieldPattern -> Result -transFieldPattern t = case t of - FieldPattern cident pattern -> failure t - -transPatternVariable :: PatternVariable -> Result -transPatternVariable t = case t of - PVVar cident -> failure t - PVWild -> failure t - -transExp :: Exp -> Result -transExp t = case t of - ELet letdefs exp -> failure t - ECase exp cases -> failure t - EAbs patternvariable exp -> failure t - EPi patternvariable exp0 exp1 -> failure t - EApp exp0 exp1 -> failure t - EProj exp cident -> failure t - ERecType fieldtypes -> failure t - ERec fieldvalues -> failure t - EVar cident -> failure t - EType -> failure t - EStr str -> failure t - EInteger n -> failure t - EDouble d -> failure t - EMeta tmeta -> failure t - -transLetDef :: LetDef -> Result -transLetDef t = case t of - LetDef cident exp -> failure t - -transCase :: Case -> Result -transCase t = case t of - Case pattern exp0 exp1 -> failure t - -transFieldType :: FieldType -> Result -transFieldType t = case t of - FieldType cident exp -> failure t - -transFieldValue :: FieldValue -> Result -transFieldValue t = case t of - FieldValue cident exp -> failure t - -transTMeta :: TMeta -> Result -transTMeta t = case t of - TMeta str -> failure t - -transCIdent :: CIdent -> Result -transCIdent t = case t of - CIdent str -> failure t - diff --git a/src/Transfer/Core/Test.hs b/src/Transfer/Core/Test.hs deleted file mode 100644 index 570beed51..000000000 --- a/src/Transfer/Core/Test.hs +++ /dev/null @@ -1,58 +0,0 @@ --- automatically generated by BNF Converter -module Main where - - -import IO ( stdin, hGetContents ) -import System ( getArgs, getProgName ) - -import Transfer.Core.Lex -import Transfer.Core.Par -import Transfer.Core.Skel -import Transfer.Core.Print -import Transfer.Core.Abs - - - - -import Transfer.ErrM - -type ParseFun a = [Token] -> Err a - -myLLexer = myLexer - -type Verbosity = Int - -putStrV :: Verbosity -> String -> IO () -putStrV v s = if v > 1 then putStrLn s else return () - -runFile :: (Print a, Show a) => Verbosity -> ParseFun a -> FilePath -> IO () -runFile v p f = putStrLn f >> readFile f >>= run v p - -run :: (Print a, Show a) => Verbosity -> ParseFun a -> String -> IO () -run v p s = let ts = myLLexer s in case p ts of - Bad s -> do putStrLn "\nParse Failed...\n" - putStrV v "Tokens:" - putStrV v $ show ts - putStrLn s - Ok tree -> do putStrLn "\nParse Successful!" - showTree v tree - - - -showTree :: (Show a, Print a) => Int -> a -> IO () -showTree v tree - = do - putStrV v $ "\n[Abstract Syntax]\n\n" ++ show tree - putStrV v $ "\n[Linearized tree]\n\n" ++ printTree tree - -main :: IO () -main = do args <- getArgs - case args of - [] -> hGetContents stdin >>= run 2 pModule - "-s":fs -> mapM_ (runFile 0 pModule) fs - fs -> mapM_ (runFile 2 pModule) fs - - - - - diff --git a/src/Transfer/ErrM.hs b/src/Transfer/ErrM.hs deleted file mode 100644 index 1f3c566fd..000000000 --- a/src/Transfer/ErrM.hs +++ /dev/null @@ -1,16 +0,0 @@ --- BNF Converter: Error Monad --- Copyright (C) 2004 Author: Aarne Ranta - --- This file comes with NO WARRANTY and may be used FOR ANY PURPOSE. -module Transfer.ErrM where - --- the Error monad: like Maybe type with error msgs - -data Err a = Ok a | Bad String - deriving (Read, Show, Eq) - -instance Monad Err where - return = Ok - fail = Bad - Ok a >>= f = f a - Bad s >>= f = Bad s diff --git a/src/Transfer/Interpreter.hs b/src/Transfer/Interpreter.hs deleted file mode 100644 index 926b7bd3a..000000000 --- a/src/Transfer/Interpreter.hs +++ /dev/null @@ -1,240 +0,0 @@ -module Transfer.Interpreter where - -import Transfer.Core.Abs -import Transfer.Core.Print - -import Control.Monad -import Data.List -import Data.Maybe - -import Debug.Trace - -data Value = VStr String - | VInt Integer - | VDbl Double - | VType - | VRec [(CIdent,Value)] - | VClos Env Exp - | VCons CIdent [Value] - | VPrim (Value -> Value) - | VMeta Integer - deriving (Show) - -instance Show (a -> b) where - show _ = "<>" - --- --- * Environment --- - -newtype Env = Env [(CIdent,Value)] - deriving Show - -mkEnv :: [(CIdent,Value)] -> Env -mkEnv = Env - -addToEnv :: [(CIdent,Value)] -> Env -> Env -addToEnv bs (Env e) = Env (bs ++ e) - -lookupEnv :: Env -> CIdent -> Value -lookupEnv (Env e) id = - case lookup id e of - Just x -> x - Nothing -> error $ "Variable " ++ printTree id ++ " not in environment." - ++ " Environment contains: " ++ show (map (printTree . fst) e) - -prEnv :: Env -> String -prEnv (Env e) = unlines [ printTree id ++ ": " ++ printValue v | (id,v) <- e ] - -seqEnv :: Env -> Env -seqEnv (Env e) = Env $! deepSeqList [ fst p `seq` p | p <- e ] - --- | The built-in types and functions. -builtin :: Env -builtin = - mkEnv [(CIdent "Integer",VType), - (CIdent "Double",VType), - (CIdent "String",VType), - mkIntUn "neg" negate toInt, - mkIntBin "add" (+) toInt, - mkIntBin "sub" (-) toInt, - mkIntBin "mul" (*) toInt, - mkIntBin "div" div toInt, - mkIntBin "mod" mod toInt, - mkIntBin "eq" (==) toBool, - mkIntBin "cmp" compare toOrd, - mkIntUn "show" show toStr, - mkDblUn "neg" negate toDbl, - mkDblBin "add" (+) toDbl, - mkDblBin "sub" (-) toDbl, - mkDblBin "mul" (*) toDbl, - mkDblBin "div" (/) toDbl, - mkDblBin "mod" (\_ _ -> 0.0) toDbl, - mkDblBin "eq" (==) toBool, - mkDblBin "cmp" compare toOrd, - mkDblUn "show" show toStr, - mkStrBin "add" (++) toStr, - mkStrBin "eq" (==) toBool, - mkStrBin "cmp" compare toOrd, - mkStrUn "show" show toStr - ] - where - toInt i = VInt i - toDbl i = VDbl i - toBool b = VCons (CIdent (show b)) [] - toOrd o = VCons (CIdent (show o)) [] - toStr s = VStr s - mkUn t a x f g = let c = CIdent ("prim_" ++ x ++ "_" ++ t) - in (c, VPrim (\n -> a f g n)) - mkBin t a x f g = let c = CIdent ("prim_" ++ x ++ "_" ++ t) - in (c, VPrim (\n -> VPrim (\m -> a f g n m ))) - mkIntUn = mkUn "Integer" $ \ f g x -> - case x of - VInt n -> g (f n) - _ -> error $ printValue x ++ " is not an integer" - mkIntBin = mkBin "Integer" $ \ f g x y -> - case (x,y) of - (VInt n,VInt m) -> g (f n m) - _ -> error $ printValue x ++ " and " ++ printValue y - ++ " are not both integers" - mkDblUn = mkUn "Double" $ \ f g x -> - case x of - VDbl n -> g (f n) - _ -> error $ printValue x ++ " is not a double" - mkDblBin = mkBin "Double" $ \ f g x y -> - case (x,y) of - (VDbl n,VDbl m) -> g (f n m) - _ -> error $ printValue x ++ " and " ++ printValue y - ++ " are not both doubles" - mkStrUn = mkUn "String" $ \ f g x -> - case x of - VStr n -> g (f n) - _ -> error $ printValue x ++ " is not a string" - mkStrBin = mkBin "String" $ \ f g x y -> - case (x,y) of - (VStr n,VStr m) -> g (f n m) - _ -> error $ printValue x ++ " and " ++ printValue y - ++ " are not both strings" - -addModuleEnv :: Env -> Module -> Env -addModuleEnv env (Module ds) = - let bs = [ (c,VCons c []) | DataDecl _ _ cs <- ds, ConsDecl c _ <- cs ] - ++ [ (t,VCons t []) | DataDecl t _ _ <- ds ] - ++ [ (x,eval env' e) | ValueDecl x e <- ds] - env' = addToEnv bs env - in env' - --- --- * Evaluation. --- - -eval :: Env -> Exp -> Value -eval env x = case x of - ELet defs exp2 -> - let env' = [ (id, v) | LetDef id e <- defs, - let v = eval env' e] - `addToEnv` env - in eval (seqEnv env') exp2 - ECase exp cases -> - let v = eval env exp - r = case firstMatch env v cases of - Nothing -> error $ "No pattern matched " ++ printValue v - Just (e,env') -> eval env' e - in v `seq` r - EAbs _ _ -> VClos env x - EPi _ _ _ -> VClos env x - EApp exp1 exp2 -> - let v1 = eval env exp1 - v2 = eval env exp2 - in case v1 of - VClos env' (EAbs id e) -> eval (bind id v2 `addToEnv` env') e - VPrim f -> f $! v2 - VCons c vs -> (VCons $! c) $! ((++) $! vs) $! [v2] - _ -> error $ "Bad application (" ++ printValue v1 - ++ ") (" ++ printValue v2 ++ ")" - EProj exp id -> let v = eval env exp - in case v of - VRec fs -> recLookup id fs - _ -> error $ printValue v ++ " is not a record, " - ++ "cannot get field " ++ printTree id - - ERecType fts -> VRec $! deepSeqList $! [v `seq` (f,v) | FieldType f e <- fts, - let v = eval env e] - ERec fvs -> VRec $! deepSeqList $! [v `seq` (f,v) | FieldValue f e <- fvs, - let v = eval env e] - EVar id -> lookupEnv env id - EType -> VType - EStr str -> VStr str - EInteger n -> VInt n - EDouble n -> VDbl n - EMeta (TMeta t) -> VMeta (read $ drop 1 t) - -firstMatch :: Env -> Value -> [Case] -> Maybe (Exp,Env) -firstMatch _ _ [] = Nothing -firstMatch env v (Case p g e:cs) = - case match p v of - Nothing -> firstMatch env v cs - Just bs -> let env' = bs `addToEnv` env - in case eval env' g of - VCons (CIdent "True") [] -> Just (e,env') - VCons (CIdent "False") [] -> firstMatch env v cs - x -> error $ "Error in guard: " ++ printValue x - ++ " is not a Bool" - -bind :: PatternVariable -> Value -> [(CIdent,Value)] -bind (PVVar x) v = [(x,v)] -bind PVWild _ = [] - -match :: Pattern -> Value -> Maybe [(CIdent,Value)] -match (PCons c' ps) (VCons c vs) - | c == c' = if length vs == length ps - then concatM $ zipWith match ps vs - else error $ "Wrong number of arguments to " ++ printTree c -match (PVar x) v = Just (bind x v) -match (PRec fps) (VRec fs) = concatM [ match p (recLookup f fs) | FieldPattern f p <- fps ] -match (PInt i) (VInt i') | i == i' = Just [] -match (PStr s) (VStr s') | s == s' = Just [] -match (PInt i) (VInt i') | i == i' = Just [] -match _ _ = Nothing - - -recLookup :: CIdent -> [(CIdent,Value)] -> Value -recLookup l fs = - case lookup l fs of - Just x -> x - Nothing -> error $ printValue (VRec fs) ++ " has no field " ++ printTree l - --- --- * Utilities --- - -concatM :: Monad m => [m [a]] -> m [a] -concatM = liftM concat . sequence - --- | Force a list and its values. -deepSeqList :: [a] -> [a] -deepSeqList = foldr (\x xs -> x `seq` xs `seq` (x:xs)) [] - --- --- * Convert values to expressions --- - -valueToExp :: Value -> Exp -valueToExp v = - case v of - VStr s -> EStr s - VInt i -> EInteger i - VDbl i -> EDouble i - VType -> EType - VRec fs -> ERec [ FieldValue f (valueToExp v) | (f,v) <- fs] - VClos env e -> e - VCons c vs -> foldl EApp (EVar c) (map valueToExp vs) - VPrim _ -> EVar (CIdent "<>") -- FIXME: what to return here? - VMeta n -> EMeta $ TMeta $ "?" ++ show n - --- --- * Pretty printing of values --- - -printValue :: Value -> String -printValue v = printTree (valueToExp v) diff --git a/src/Transfer/InterpreterAPI.hs b/src/Transfer/InterpreterAPI.hs deleted file mode 100644 index 2fe04e8f3..000000000 --- a/src/Transfer/InterpreterAPI.hs +++ /dev/null @@ -1,39 +0,0 @@ -module Transfer.InterpreterAPI (Env, builtin, - load, loadFile, - evaluateString, evaluateExp - ) where - -import Transfer.Core.Abs -import Transfer.Core.Lex -import Transfer.Core.Par -import Transfer.Core.Print -import Transfer.Interpreter -import Transfer.ErrM - --- | Read a transfer module in core format from a string. -load :: Monad m => - String -- ^ Input source name, for error messages. - -> String -- ^ Module contents. - -> m Env -load n s = case pModule (myLexer s) of - Bad e -> fail $ "Parse error in " ++ n ++ ": " ++ e - Ok m -> return $ addModuleEnv builtin m - --- | Read a transfer module in core format from a file. --- Fails in the IO monad if there is a problem loading the file. -loadFile :: FilePath -> IO Env -loadFile f = readFile f >>= load f - --- | Read a transfer expression from a string and evaluate it. --- Returns the result as a string. -evaluateString :: Monad m => Env -> String -> m String -evaluateString env s = - case pExp (myLexer s) of - Bad e -> fail $ "Parse error: " ++ e - Ok e -> do - let v = eval env e - return $ printValue v - --- | Evaluate an expression in the given environment. -evaluateExp :: Env -> Exp -> Exp -evaluateExp env exp = valueToExp $ eval env exp diff --git a/src/Transfer/PathUtil.hs b/src/Transfer/PathUtil.hs deleted file mode 100644 index b344563c6..000000000 --- a/src/Transfer/PathUtil.hs +++ /dev/null @@ -1,110 +0,0 @@ -{-# OPTIONS_GHC -cpp #-} - ------------------------------------------------------------------------------ --- File name and directory utilities. Stolen from --- ghc-6.4.1/ghc/compiler/main/DriverUtil.hs --- --- (c) The University of Glasgow 2000 --- ------------------------------------------------------------------------------ - -module Transfer.PathUtil ( - Suffix, splitFilename, getFileSuffix, - splitFilename3, remove_suffix, split_longest_prefix, - replaceFilenameSuffix, directoryOf, filenameOf, - replaceFilenameDirectory, replaceFilename, remove_spaces, escapeSpaces, - ) where - -import Data.Char (isSpace) - -type Suffix = String - -splitFilename :: String -> (String,Suffix) -splitFilename f = split_longest_prefix f (=='.') - -getFileSuffix :: String -> Suffix -getFileSuffix f = drop_longest_prefix f (=='.') - --- "foo/bar/xyzzy.ext" -> ("foo/bar", "xyzzy.ext") -splitFilenameDir :: String -> (String,String) -splitFilenameDir str - = let (dir, rest) = split_longest_prefix str isPathSeparator - real_dir | null dir = "." - | otherwise = dir - in (real_dir, rest) - --- "foo/bar/xyzzy.ext" -> ("foo/bar", "xyzzy", ".ext") -splitFilename3 :: String -> (String,String,Suffix) -splitFilename3 str - = let (dir, rest) = split_longest_prefix str isPathSeparator - (name, ext) = splitFilename rest - real_dir | null dir = "." - | otherwise = dir - in (real_dir, name, ext) - -remove_suffix :: Char -> String -> Suffix -remove_suffix c s - | null pre = s - | otherwise = reverse pre - where (suf,pre) = break (==c) (reverse s) - -drop_longest_prefix :: String -> (Char -> Bool) -> String -drop_longest_prefix s pred = reverse suf - where (suf,_pre) = break pred (reverse s) - -take_longest_prefix :: String -> (Char -> Bool) -> String -take_longest_prefix s pred = reverse pre - where (_suf,pre) = break pred (reverse s) - --- split a string at the last character where 'pred' is True, --- returning a pair of strings. The first component holds the string --- up (but not including) the last character for which 'pred' returned --- True, the second whatever comes after (but also not including the --- last character). --- --- If 'pred' returns False for all characters in the string, the original --- string is returned in the second component (and the first one is just --- empty). -split_longest_prefix :: String -> (Char -> Bool) -> (String,String) -split_longest_prefix s pred - = case pre of - [] -> ([], reverse suf) - (_:pre) -> (reverse pre, reverse suf) - where (suf,pre) = break pred (reverse s) - -replaceFilenameSuffix :: FilePath -> Suffix -> FilePath -replaceFilenameSuffix s suf = remove_suffix '.' s ++ suf - --- directoryOf strips the filename off the input string, returning --- the directory. -directoryOf :: FilePath -> String -directoryOf = fst . splitFilenameDir - --- filenameOf strips the directory off the input string, returning --- the filename. -filenameOf :: FilePath -> String -filenameOf = snd . splitFilenameDir - -replaceFilenameDirectory :: FilePath -> String -> FilePath -replaceFilenameDirectory s dir - = dir ++ '/':drop_longest_prefix s isPathSeparator - -replaceFilename :: FilePath -> String -> FilePath -replaceFilename f n - = case directoryOf f of - "" -> n - d -> d ++ '/' : n - -remove_spaces :: String -> String -remove_spaces = reverse . dropWhile isSpace . reverse . dropWhile isSpace - -escapeSpaces :: String -> String -escapeSpaces = foldr (\c s -> if isSpace c then '\\':c:s else c:s) "" - -isPathSeparator :: Char -> Bool -isPathSeparator ch = -#ifdef mingw32_TARGET_OS - ch == '/' || ch == '\\' -#else - ch == '/' -#endif diff --git a/src/Transfer/Syntax/Abs.hs b/src/Transfer/Syntax/Abs.hs deleted file mode 100644 index 0ccf9ab12..000000000 --- a/src/Transfer/Syntax/Abs.hs +++ /dev/null @@ -1,485 +0,0 @@ -{-# OPTIONS_GHC -fglasgow-exts #-} -module Transfer.Syntax.Abs (Tree(..), Module, Import, Decl, ConsDecl, Guard, Pattern, CommaPattern, FieldPattern, Exp, VarOrWild, LetDef, Case, Bind, FieldType, FieldValue, Ident, composOp, composOpM, composOpM_, composOpMPlus, composOpMonoid, composOpFold, compos, johnMajorEq) where - -import Control.Monad (ap,MonadPlus,msum,mplus,mzero) -import Control.Monad.Identity -import Data.Monoid - --- Haskell module generated by the BNF converter - -data Module_ -type Module = Tree Module_ -data Import_ -type Import = Tree Import_ -data Decl_ -type Decl = Tree Decl_ -data ConsDecl_ -type ConsDecl = Tree ConsDecl_ -data Guard_ -type Guard = Tree Guard_ -data Pattern_ -type Pattern = Tree Pattern_ -data CommaPattern_ -type CommaPattern = Tree CommaPattern_ -data FieldPattern_ -type FieldPattern = Tree FieldPattern_ -data Exp_ -type Exp = Tree Exp_ -data VarOrWild_ -type VarOrWild = Tree VarOrWild_ -data LetDef_ -type LetDef = Tree LetDef_ -data Case_ -type Case = Tree Case_ -data Bind_ -type Bind = Tree Bind_ -data FieldType_ -type FieldType = Tree FieldType_ -data FieldValue_ -type FieldValue = Tree FieldValue_ -data Ident_ -type Ident = Tree Ident_ - -data Tree :: * -> * where - Module :: [Import] -> [Decl] -> Tree Module_ - Import :: Ident -> Tree Import_ - DataDecl :: Ident -> Exp -> [ConsDecl] -> Tree Decl_ - TypeDecl :: Ident -> Exp -> Tree Decl_ - ValueDecl :: Ident -> [Pattern] -> Guard -> Exp -> Tree Decl_ - DeriveDecl :: Ident -> Ident -> Tree Decl_ - ConsDecl :: Ident -> Exp -> Tree ConsDecl_ - GuardExp :: Exp -> Tree Guard_ - GuardNo :: Tree Guard_ - POr :: Pattern -> Pattern -> Tree Pattern_ - PListCons :: Pattern -> Pattern -> Tree Pattern_ - PConsTop :: Ident -> Pattern -> [Pattern] -> Tree Pattern_ - PCons :: Ident -> [Pattern] -> Tree Pattern_ - PRec :: [FieldPattern] -> Tree Pattern_ - PEmptyList :: Tree Pattern_ - PList :: [CommaPattern] -> Tree Pattern_ - PTuple :: CommaPattern -> [CommaPattern] -> Tree Pattern_ - PStr :: String -> Tree Pattern_ - PInt :: Integer -> Tree Pattern_ - PVar :: Ident -> Tree Pattern_ - PWild :: Tree Pattern_ - CommaPattern :: Pattern -> Tree CommaPattern_ - FieldPattern :: Ident -> Pattern -> Tree FieldPattern_ - EPi :: VarOrWild -> Exp -> Exp -> Tree Exp_ - EPiNoVar :: Exp -> Exp -> Tree Exp_ - EAbs :: VarOrWild -> Exp -> Tree Exp_ - ELet :: [LetDef] -> Exp -> Tree Exp_ - ECase :: Exp -> [Case] -> Tree Exp_ - EIf :: Exp -> Exp -> Exp -> Tree Exp_ - EDo :: [Bind] -> Exp -> Tree Exp_ - EBind :: Exp -> Exp -> Tree Exp_ - EBindC :: Exp -> Exp -> Tree Exp_ - EOr :: Exp -> Exp -> Tree Exp_ - EAnd :: Exp -> Exp -> Tree Exp_ - EEq :: Exp -> Exp -> Tree Exp_ - ENe :: Exp -> Exp -> Tree Exp_ - ELt :: Exp -> Exp -> Tree Exp_ - ELe :: Exp -> Exp -> Tree Exp_ - EGt :: Exp -> Exp -> Tree Exp_ - EGe :: Exp -> Exp -> Tree Exp_ - EListCons :: Exp -> Exp -> Tree Exp_ - EAdd :: Exp -> Exp -> Tree Exp_ - ESub :: Exp -> Exp -> Tree Exp_ - EMul :: Exp -> Exp -> Tree Exp_ - EDiv :: Exp -> Exp -> Tree Exp_ - EMod :: Exp -> Exp -> Tree Exp_ - ENeg :: Exp -> Tree Exp_ - EApp :: Exp -> Exp -> Tree Exp_ - EProj :: Exp -> Ident -> Tree Exp_ - ERecType :: [FieldType] -> Tree Exp_ - ERec :: [FieldValue] -> Tree Exp_ - EEmptyList :: Tree Exp_ - EList :: [Exp] -> Tree Exp_ - ETuple :: Exp -> [Exp] -> Tree Exp_ - EVar :: Ident -> Tree Exp_ - EType :: Tree Exp_ - EStr :: String -> Tree Exp_ - EInteger :: Integer -> Tree Exp_ - EDouble :: Double -> Tree Exp_ - EMeta :: Tree Exp_ - VVar :: Ident -> Tree VarOrWild_ - VWild :: Tree VarOrWild_ - LetDef :: Ident -> Exp -> Tree LetDef_ - Case :: Pattern -> Guard -> Exp -> Tree Case_ - BindVar :: VarOrWild -> Exp -> Tree Bind_ - BindNoVar :: Exp -> Tree Bind_ - FieldType :: Ident -> Exp -> Tree FieldType_ - FieldValue :: Ident -> Exp -> Tree FieldValue_ - Ident :: String -> Tree Ident_ - -composOp :: (forall a. Tree a -> Tree a) -> Tree c -> Tree c -composOp f = runIdentity . composOpM (Identity . f) - -composOpM :: Monad m => (forall a. Tree a -> m (Tree a)) -> Tree c -> m (Tree c) -composOpM = compos return ap - -composOpM_ :: Monad m => (forall a. Tree a -> m ()) -> Tree c -> m () -composOpM_ = composOpFold (return ()) (>>) - -composOpMPlus :: MonadPlus m => (forall a. Tree a -> m b) -> Tree c -> m b -composOpMPlus = composOpFold mzero mplus - -composOpMonoid :: Monoid m => (forall a. Tree a -> m) -> Tree c -> m -composOpMonoid = composOpFold mempty mappend - -newtype C b a = C { unC :: b } -composOpFold :: b -> (b -> b -> b) -> (forall a. Tree a -> b) -> Tree c -> b -composOpFold z c f = unC . compos (\_ -> C z) (\(C x) (C y) -> C (c x y)) (C . f) - -compos :: (forall a. a -> m a) - -> (forall a b. m (a -> b) -> m a -> m b) - -> (forall a. Tree a -> m (Tree a)) -> Tree c -> m (Tree c) -compos r a f t = case t of - Module imports decls -> r Module `a` foldr (a . a (r (:)) . f) (r []) imports `a` foldr (a . a (r (:)) . f) (r []) decls - Import i -> r Import `a` f i - DataDecl i exp consdecls -> r DataDecl `a` f i `a` f exp `a` foldr (a . a (r (:)) . f) (r []) consdecls - TypeDecl i exp -> r TypeDecl `a` f i `a` f exp - ValueDecl i patterns guard exp -> r ValueDecl `a` f i `a` foldr (a . a (r (:)) . f) (r []) patterns `a` f guard `a` f exp - DeriveDecl i0 i1 -> r DeriveDecl `a` f i0 `a` f i1 - ConsDecl i exp -> r ConsDecl `a` f i `a` f exp - GuardExp exp -> r GuardExp `a` f exp - POr pattern0 pattern1 -> r POr `a` f pattern0 `a` f pattern1 - PListCons pattern0 pattern1 -> r PListCons `a` f pattern0 `a` f pattern1 - PConsTop i pattern patterns -> r PConsTop `a` f i `a` f pattern `a` foldr (a . a (r (:)) . f) (r []) patterns - PCons i patterns -> r PCons `a` f i `a` foldr (a . a (r (:)) . f) (r []) patterns - PRec fieldpatterns -> r PRec `a` foldr (a . a (r (:)) . f) (r []) fieldpatterns - PList commapatterns -> r PList `a` foldr (a . a (r (:)) . f) (r []) commapatterns - PTuple commapattern commapatterns -> r PTuple `a` f commapattern `a` foldr (a . a (r (:)) . f) (r []) commapatterns - PVar i -> r PVar `a` f i - CommaPattern pattern -> r CommaPattern `a` f pattern - FieldPattern i pattern -> r FieldPattern `a` f i `a` f pattern - EPi varorwild exp0 exp1 -> r EPi `a` f varorwild `a` f exp0 `a` f exp1 - EPiNoVar exp0 exp1 -> r EPiNoVar `a` f exp0 `a` f exp1 - EAbs varorwild exp -> r EAbs `a` f varorwild `a` f exp - ELet letdefs exp -> r ELet `a` foldr (a . a (r (:)) . f) (r []) letdefs `a` f exp - ECase exp cases -> r ECase `a` f exp `a` foldr (a . a (r (:)) . f) (r []) cases - EIf exp0 exp1 exp2 -> r EIf `a` f exp0 `a` f exp1 `a` f exp2 - EDo binds exp -> r EDo `a` foldr (a . a (r (:)) . f) (r []) binds `a` f exp - EBind exp0 exp1 -> r EBind `a` f exp0 `a` f exp1 - EBindC exp0 exp1 -> r EBindC `a` f exp0 `a` f exp1 - EOr exp0 exp1 -> r EOr `a` f exp0 `a` f exp1 - EAnd exp0 exp1 -> r EAnd `a` f exp0 `a` f exp1 - EEq exp0 exp1 -> r EEq `a` f exp0 `a` f exp1 - ENe exp0 exp1 -> r ENe `a` f exp0 `a` f exp1 - ELt exp0 exp1 -> r ELt `a` f exp0 `a` f exp1 - ELe exp0 exp1 -> r ELe `a` f exp0 `a` f exp1 - EGt exp0 exp1 -> r EGt `a` f exp0 `a` f exp1 - EGe exp0 exp1 -> r EGe `a` f exp0 `a` f exp1 - EListCons exp0 exp1 -> r EListCons `a` f exp0 `a` f exp1 - EAdd exp0 exp1 -> r EAdd `a` f exp0 `a` f exp1 - ESub exp0 exp1 -> r ESub `a` f exp0 `a` f exp1 - EMul exp0 exp1 -> r EMul `a` f exp0 `a` f exp1 - EDiv exp0 exp1 -> r EDiv `a` f exp0 `a` f exp1 - EMod exp0 exp1 -> r EMod `a` f exp0 `a` f exp1 - ENeg exp -> r ENeg `a` f exp - EApp exp0 exp1 -> r EApp `a` f exp0 `a` f exp1 - EProj exp i -> r EProj `a` f exp `a` f i - ERecType fieldtypes -> r ERecType `a` foldr (a . a (r (:)) . f) (r []) fieldtypes - ERec fieldvalues -> r ERec `a` foldr (a . a (r (:)) . f) (r []) fieldvalues - EList exps -> r EList `a` foldr (a . a (r (:)) . f) (r []) exps - ETuple exp exps -> r ETuple `a` f exp `a` foldr (a . a (r (:)) . f) (r []) exps - EVar i -> r EVar `a` f i - VVar i -> r VVar `a` f i - LetDef i exp -> r LetDef `a` f i `a` f exp - Case pattern guard exp -> r Case `a` f pattern `a` f guard `a` f exp - BindVar varorwild exp -> r BindVar `a` f varorwild `a` f exp - BindNoVar exp -> r BindNoVar `a` f exp - FieldType i exp -> r FieldType `a` f i `a` f exp - FieldValue i exp -> r FieldValue `a` f i `a` f exp - _ -> r t - -instance Show (Tree c) where - showsPrec n t = case t of - Module imports decls -> opar n . showString "Module" . showChar ' ' . showsPrec 1 imports . showChar ' ' . showsPrec 1 decls . cpar n - Import i -> opar n . showString "Import" . showChar ' ' . showsPrec 1 i . cpar n - DataDecl i exp consdecls -> opar n . showString "DataDecl" . showChar ' ' . showsPrec 1 i . showChar ' ' . showsPrec 1 exp . showChar ' ' . showsPrec 1 consdecls . cpar n - TypeDecl i exp -> opar n . showString "TypeDecl" . showChar ' ' . showsPrec 1 i . showChar ' ' . showsPrec 1 exp . cpar n - ValueDecl i patterns guard exp -> opar n . showString "ValueDecl" . showChar ' ' . showsPrec 1 i . showChar ' ' . showsPrec 1 patterns . showChar ' ' . showsPrec 1 guard . showChar ' ' . showsPrec 1 exp . cpar n - DeriveDecl i0 i1 -> opar n . showString "DeriveDecl" . showChar ' ' . showsPrec 1 i0 . showChar ' ' . showsPrec 1 i1 . cpar n - ConsDecl i exp -> opar n . showString "ConsDecl" . showChar ' ' . showsPrec 1 i . showChar ' ' . showsPrec 1 exp . cpar n - GuardExp exp -> opar n . showString "GuardExp" . showChar ' ' . showsPrec 1 exp . cpar n - GuardNo -> showString "GuardNo" - POr pattern0 pattern1 -> opar n . showString "POr" . showChar ' ' . showsPrec 1 pattern0 . showChar ' ' . showsPrec 1 pattern1 . cpar n - PListCons pattern0 pattern1 -> opar n . showString "PListCons" . showChar ' ' . showsPrec 1 pattern0 . showChar ' ' . showsPrec 1 pattern1 . cpar n - PConsTop i pattern patterns -> opar n . showString "PConsTop" . showChar ' ' . showsPrec 1 i . showChar ' ' . showsPrec 1 pattern . showChar ' ' . showsPrec 1 patterns . cpar n - PCons i patterns -> opar n . showString "PCons" . showChar ' ' . showsPrec 1 i . showChar ' ' . showsPrec 1 patterns . cpar n - PRec fieldpatterns -> opar n . showString "PRec" . showChar ' ' . showsPrec 1 fieldpatterns . cpar n - PEmptyList -> showString "PEmptyList" - PList commapatterns -> opar n . showString "PList" . showChar ' ' . showsPrec 1 commapatterns . cpar n - PTuple commapattern commapatterns -> opar n . showString "PTuple" . showChar ' ' . showsPrec 1 commapattern . showChar ' ' . showsPrec 1 commapatterns . cpar n - PStr str -> opar n . showString "PStr" . showChar ' ' . showsPrec 1 str . cpar n - PInt n -> opar n . showString "PInt" . showChar ' ' . showsPrec 1 n . cpar n - PVar i -> opar n . showString "PVar" . showChar ' ' . showsPrec 1 i . cpar n - PWild -> showString "PWild" - CommaPattern pattern -> opar n . showString "CommaPattern" . showChar ' ' . showsPrec 1 pattern . cpar n - FieldPattern i pattern -> opar n . showString "FieldPattern" . showChar ' ' . showsPrec 1 i . showChar ' ' . showsPrec 1 pattern . cpar n - EPi varorwild exp0 exp1 -> opar n . showString "EPi" . showChar ' ' . showsPrec 1 varorwild . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - EPiNoVar exp0 exp1 -> opar n . showString "EPiNoVar" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - EAbs varorwild exp -> opar n . showString "EAbs" . showChar ' ' . showsPrec 1 varorwild . showChar ' ' . showsPrec 1 exp . cpar n - ELet letdefs exp -> opar n . showString "ELet" . showChar ' ' . showsPrec 1 letdefs . showChar ' ' . showsPrec 1 exp . cpar n - ECase exp cases -> opar n . showString "ECase" . showChar ' ' . showsPrec 1 exp . showChar ' ' . showsPrec 1 cases . cpar n - EIf exp0 exp1 exp2 -> opar n . showString "EIf" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . showChar ' ' . showsPrec 1 exp2 . cpar n - EDo binds exp -> opar n . showString "EDo" . showChar ' ' . showsPrec 1 binds . showChar ' ' . showsPrec 1 exp . cpar n - EBind exp0 exp1 -> opar n . showString "EBind" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - EBindC exp0 exp1 -> opar n . showString "EBindC" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - EOr exp0 exp1 -> opar n . showString "EOr" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - EAnd exp0 exp1 -> opar n . showString "EAnd" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - EEq exp0 exp1 -> opar n . showString "EEq" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - ENe exp0 exp1 -> opar n . showString "ENe" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - ELt exp0 exp1 -> opar n . showString "ELt" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - ELe exp0 exp1 -> opar n . showString "ELe" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - EGt exp0 exp1 -> opar n . showString "EGt" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - EGe exp0 exp1 -> opar n . showString "EGe" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - EListCons exp0 exp1 -> opar n . showString "EListCons" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - EAdd exp0 exp1 -> opar n . showString "EAdd" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - ESub exp0 exp1 -> opar n . showString "ESub" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - EMul exp0 exp1 -> opar n . showString "EMul" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - EDiv exp0 exp1 -> opar n . showString "EDiv" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - EMod exp0 exp1 -> opar n . showString "EMod" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - ENeg exp -> opar n . showString "ENeg" . showChar ' ' . showsPrec 1 exp . cpar n - EApp exp0 exp1 -> opar n . showString "EApp" . showChar ' ' . showsPrec 1 exp0 . showChar ' ' . showsPrec 1 exp1 . cpar n - EProj exp i -> opar n . showString "EProj" . showChar ' ' . showsPrec 1 exp . showChar ' ' . showsPrec 1 i . cpar n - ERecType fieldtypes -> opar n . showString "ERecType" . showChar ' ' . showsPrec 1 fieldtypes . cpar n - ERec fieldvalues -> opar n . showString "ERec" . showChar ' ' . showsPrec 1 fieldvalues . cpar n - EEmptyList -> showString "EEmptyList" - EList exps -> opar n . showString "EList" . showChar ' ' . showsPrec 1 exps . cpar n - ETuple exp exps -> opar n . showString "ETuple" . showChar ' ' . showsPrec 1 exp . showChar ' ' . showsPrec 1 exps . cpar n - EVar i -> opar n . showString "EVar" . showChar ' ' . showsPrec 1 i . cpar n - EType -> showString "EType" - EStr str -> opar n . showString "EStr" . showChar ' ' . showsPrec 1 str . cpar n - EInteger n -> opar n . showString "EInteger" . showChar ' ' . showsPrec 1 n . cpar n - EDouble d -> opar n . showString "EDouble" . showChar ' ' . showsPrec 1 d . cpar n - EMeta -> showString "EMeta" - VVar i -> opar n . showString "VVar" . showChar ' ' . showsPrec 1 i . cpar n - VWild -> showString "VWild" - LetDef i exp -> opar n . showString "LetDef" . showChar ' ' . showsPrec 1 i . showChar ' ' . showsPrec 1 exp . cpar n - Case pattern guard exp -> opar n . showString "Case" . showChar ' ' . showsPrec 1 pattern . showChar ' ' . showsPrec 1 guard . showChar ' ' . showsPrec 1 exp . cpar n - BindVar varorwild exp -> opar n . showString "BindVar" . showChar ' ' . showsPrec 1 varorwild . showChar ' ' . showsPrec 1 exp . cpar n - BindNoVar exp -> opar n . showString "BindNoVar" . showChar ' ' . showsPrec 1 exp . cpar n - FieldType i exp -> opar n . showString "FieldType" . showChar ' ' . showsPrec 1 i . showChar ' ' . showsPrec 1 exp . cpar n - FieldValue i exp -> opar n . showString "FieldValue" . showChar ' ' . showsPrec 1 i . showChar ' ' . showsPrec 1 exp . cpar n - Ident str -> opar n . showString "Ident" . showChar ' ' . showsPrec 1 str . cpar n - where opar n = if n > 0 then showChar '(' else id - cpar n = if n > 0 then showChar ')' else id - -instance Eq (Tree c) where (==) = johnMajorEq - -johnMajorEq :: Tree a -> Tree b -> Bool -johnMajorEq (Module imports decls) (Module imports_ decls_) = imports == imports_ && decls == decls_ -johnMajorEq (Import i) (Import i_) = i == i_ -johnMajorEq (DataDecl i exp consdecls) (DataDecl i_ exp_ consdecls_) = i == i_ && exp == exp_ && consdecls == consdecls_ -johnMajorEq (TypeDecl i exp) (TypeDecl i_ exp_) = i == i_ && exp == exp_ -johnMajorEq (ValueDecl i patterns guard exp) (ValueDecl i_ patterns_ guard_ exp_) = i == i_ && patterns == patterns_ && guard == guard_ && exp == exp_ -johnMajorEq (DeriveDecl i0 i1) (DeriveDecl i0_ i1_) = i0 == i0_ && i1 == i1_ -johnMajorEq (ConsDecl i exp) (ConsDecl i_ exp_) = i == i_ && exp == exp_ -johnMajorEq (GuardExp exp) (GuardExp exp_) = exp == exp_ -johnMajorEq GuardNo GuardNo = True -johnMajorEq (POr pattern0 pattern1) (POr pattern0_ pattern1_) = pattern0 == pattern0_ && pattern1 == pattern1_ -johnMajorEq (PListCons pattern0 pattern1) (PListCons pattern0_ pattern1_) = pattern0 == pattern0_ && pattern1 == pattern1_ -johnMajorEq (PConsTop i pattern patterns) (PConsTop i_ pattern_ patterns_) = i == i_ && pattern == pattern_ && patterns == patterns_ -johnMajorEq (PCons i patterns) (PCons i_ patterns_) = i == i_ && patterns == patterns_ -johnMajorEq (PRec fieldpatterns) (PRec fieldpatterns_) = fieldpatterns == fieldpatterns_ -johnMajorEq PEmptyList PEmptyList = True -johnMajorEq (PList commapatterns) (PList commapatterns_) = commapatterns == commapatterns_ -johnMajorEq (PTuple commapattern commapatterns) (PTuple commapattern_ commapatterns_) = commapattern == commapattern_ && commapatterns == commapatterns_ -johnMajorEq (PStr str) (PStr str_) = str == str_ -johnMajorEq (PInt n) (PInt n_) = n == n_ -johnMajorEq (PVar i) (PVar i_) = i == i_ -johnMajorEq PWild PWild = True -johnMajorEq (CommaPattern pattern) (CommaPattern pattern_) = pattern == pattern_ -johnMajorEq (FieldPattern i pattern) (FieldPattern i_ pattern_) = i == i_ && pattern == pattern_ -johnMajorEq (EPi varorwild exp0 exp1) (EPi varorwild_ exp0_ exp1_) = varorwild == varorwild_ && exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (EPiNoVar exp0 exp1) (EPiNoVar exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (EAbs varorwild exp) (EAbs varorwild_ exp_) = varorwild == varorwild_ && exp == exp_ -johnMajorEq (ELet letdefs exp) (ELet letdefs_ exp_) = letdefs == letdefs_ && exp == exp_ -johnMajorEq (ECase exp cases) (ECase exp_ cases_) = exp == exp_ && cases == cases_ -johnMajorEq (EIf exp0 exp1 exp2) (EIf exp0_ exp1_ exp2_) = exp0 == exp0_ && exp1 == exp1_ && exp2 == exp2_ -johnMajorEq (EDo binds exp) (EDo binds_ exp_) = binds == binds_ && exp == exp_ -johnMajorEq (EBind exp0 exp1) (EBind exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (EBindC exp0 exp1) (EBindC exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (EOr exp0 exp1) (EOr exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (EAnd exp0 exp1) (EAnd exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (EEq exp0 exp1) (EEq exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (ENe exp0 exp1) (ENe exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (ELt exp0 exp1) (ELt exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (ELe exp0 exp1) (ELe exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (EGt exp0 exp1) (EGt exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (EGe exp0 exp1) (EGe exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (EListCons exp0 exp1) (EListCons exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (EAdd exp0 exp1) (EAdd exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (ESub exp0 exp1) (ESub exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (EMul exp0 exp1) (EMul exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (EDiv exp0 exp1) (EDiv exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (EMod exp0 exp1) (EMod exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (ENeg exp) (ENeg exp_) = exp == exp_ -johnMajorEq (EApp exp0 exp1) (EApp exp0_ exp1_) = exp0 == exp0_ && exp1 == exp1_ -johnMajorEq (EProj exp i) (EProj exp_ i_) = exp == exp_ && i == i_ -johnMajorEq (ERecType fieldtypes) (ERecType fieldtypes_) = fieldtypes == fieldtypes_ -johnMajorEq (ERec fieldvalues) (ERec fieldvalues_) = fieldvalues == fieldvalues_ -johnMajorEq EEmptyList EEmptyList = True -johnMajorEq (EList exps) (EList exps_) = exps == exps_ -johnMajorEq (ETuple exp exps) (ETuple exp_ exps_) = exp == exp_ && exps == exps_ -johnMajorEq (EVar i) (EVar i_) = i == i_ -johnMajorEq EType EType = True -johnMajorEq (EStr str) (EStr str_) = str == str_ -johnMajorEq (EInteger n) (EInteger n_) = n == n_ -johnMajorEq (EDouble d) (EDouble d_) = d == d_ -johnMajorEq EMeta EMeta = True -johnMajorEq (VVar i) (VVar i_) = i == i_ -johnMajorEq VWild VWild = True -johnMajorEq (LetDef i exp) (LetDef i_ exp_) = i == i_ && exp == exp_ -johnMajorEq (Case pattern guard exp) (Case pattern_ guard_ exp_) = pattern == pattern_ && guard == guard_ && exp == exp_ -johnMajorEq (BindVar varorwild exp) (BindVar varorwild_ exp_) = varorwild == varorwild_ && exp == exp_ -johnMajorEq (BindNoVar exp) (BindNoVar exp_) = exp == exp_ -johnMajorEq (FieldType i exp) (FieldType i_ exp_) = i == i_ && exp == exp_ -johnMajorEq (FieldValue i exp) (FieldValue i_ exp_) = i == i_ && exp == exp_ -johnMajorEq (Ident str) (Ident str_) = str == str_ -johnMajorEq _ _ = False - -instance Ord (Tree c) where - compare x y = compare (index x) (index y) `mappend` compareSame x y -index :: Tree c -> Int -index (Module _ _) = 0 -index (Import _) = 1 -index (DataDecl _ _ _) = 2 -index (TypeDecl _ _) = 3 -index (ValueDecl _ _ _ _) = 4 -index (DeriveDecl _ _) = 5 -index (ConsDecl _ _) = 6 -index (GuardExp _) = 7 -index (GuardNo ) = 8 -index (POr _ _) = 9 -index (PListCons _ _) = 10 -index (PConsTop _ _ _) = 11 -index (PCons _ _) = 12 -index (PRec _) = 13 -index (PEmptyList ) = 14 -index (PList _) = 15 -index (PTuple _ _) = 16 -index (PStr _) = 17 -index (PInt _) = 18 -index (PVar _) = 19 -index (PWild ) = 20 -index (CommaPattern _) = 21 -index (FieldPattern _ _) = 22 -index (EPi _ _ _) = 23 -index (EPiNoVar _ _) = 24 -index (EAbs _ _) = 25 -index (ELet _ _) = 26 -index (ECase _ _) = 27 -index (EIf _ _ _) = 28 -index (EDo _ _) = 29 -index (EBind _ _) = 30 -index (EBindC _ _) = 31 -index (EOr _ _) = 32 -index (EAnd _ _) = 33 -index (EEq _ _) = 34 -index (ENe _ _) = 35 -index (ELt _ _) = 36 -index (ELe _ _) = 37 -index (EGt _ _) = 38 -index (EGe _ _) = 39 -index (EListCons _ _) = 40 -index (EAdd _ _) = 41 -index (ESub _ _) = 42 -index (EMul _ _) = 43 -index (EDiv _ _) = 44 -index (EMod _ _) = 45 -index (ENeg _) = 46 -index (EApp _ _) = 47 -index (EProj _ _) = 48 -index (ERecType _) = 49 -index (ERec _) = 50 -index (EEmptyList ) = 51 -index (EList _) = 52 -index (ETuple _ _) = 53 -index (EVar _) = 54 -index (EType ) = 55 -index (EStr _) = 56 -index (EInteger _) = 57 -index (EDouble _) = 58 -index (EMeta ) = 59 -index (VVar _) = 60 -index (VWild ) = 61 -index (LetDef _ _) = 62 -index (Case _ _ _) = 63 -index (BindVar _ _) = 64 -index (BindNoVar _) = 65 -index (FieldType _ _) = 66 -index (FieldValue _ _) = 67 -index (Ident _) = 68 -compareSame :: Tree c -> Tree c -> Ordering -compareSame (Module imports decls) (Module imports_ decls_) = mappend (compare imports imports_) (compare decls decls_) -compareSame (Import i) (Import i_) = compare i i_ -compareSame (DataDecl i exp consdecls) (DataDecl i_ exp_ consdecls_) = mappend (compare i i_) (mappend (compare exp exp_) (compare consdecls consdecls_)) -compareSame (TypeDecl i exp) (TypeDecl i_ exp_) = mappend (compare i i_) (compare exp exp_) -compareSame (ValueDecl i patterns guard exp) (ValueDecl i_ patterns_ guard_ exp_) = mappend (compare i i_) (mappend (compare patterns patterns_) (mappend (compare guard guard_) (compare exp exp_))) -compareSame (DeriveDecl i0 i1) (DeriveDecl i0_ i1_) = mappend (compare i0 i0_) (compare i1 i1_) -compareSame (ConsDecl i exp) (ConsDecl i_ exp_) = mappend (compare i i_) (compare exp exp_) -compareSame (GuardExp exp) (GuardExp exp_) = compare exp exp_ -compareSame GuardNo GuardNo = EQ -compareSame (POr pattern0 pattern1) (POr pattern0_ pattern1_) = mappend (compare pattern0 pattern0_) (compare pattern1 pattern1_) -compareSame (PListCons pattern0 pattern1) (PListCons pattern0_ pattern1_) = mappend (compare pattern0 pattern0_) (compare pattern1 pattern1_) -compareSame (PConsTop i pattern patterns) (PConsTop i_ pattern_ patterns_) = mappend (compare i i_) (mappend (compare pattern pattern_) (compare patterns patterns_)) -compareSame (PCons i patterns) (PCons i_ patterns_) = mappend (compare i i_) (compare patterns patterns_) -compareSame (PRec fieldpatterns) (PRec fieldpatterns_) = compare fieldpatterns fieldpatterns_ -compareSame PEmptyList PEmptyList = EQ -compareSame (PList commapatterns) (PList commapatterns_) = compare commapatterns commapatterns_ -compareSame (PTuple commapattern commapatterns) (PTuple commapattern_ commapatterns_) = mappend (compare commapattern commapattern_) (compare commapatterns commapatterns_) -compareSame (PStr str) (PStr str_) = compare str str_ -compareSame (PInt n) (PInt n_) = compare n n_ -compareSame (PVar i) (PVar i_) = compare i i_ -compareSame PWild PWild = EQ -compareSame (CommaPattern pattern) (CommaPattern pattern_) = compare pattern pattern_ -compareSame (FieldPattern i pattern) (FieldPattern i_ pattern_) = mappend (compare i i_) (compare pattern pattern_) -compareSame (EPi varorwild exp0 exp1) (EPi varorwild_ exp0_ exp1_) = mappend (compare varorwild varorwild_) (mappend (compare exp0 exp0_) (compare exp1 exp1_)) -compareSame (EPiNoVar exp0 exp1) (EPiNoVar exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (EAbs varorwild exp) (EAbs varorwild_ exp_) = mappend (compare varorwild varorwild_) (compare exp exp_) -compareSame (ELet letdefs exp) (ELet letdefs_ exp_) = mappend (compare letdefs letdefs_) (compare exp exp_) -compareSame (ECase exp cases) (ECase exp_ cases_) = mappend (compare exp exp_) (compare cases cases_) -compareSame (EIf exp0 exp1 exp2) (EIf exp0_ exp1_ exp2_) = mappend (compare exp0 exp0_) (mappend (compare exp1 exp1_) (compare exp2 exp2_)) -compareSame (EDo binds exp) (EDo binds_ exp_) = mappend (compare binds binds_) (compare exp exp_) -compareSame (EBind exp0 exp1) (EBind exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (EBindC exp0 exp1) (EBindC exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (EOr exp0 exp1) (EOr exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (EAnd exp0 exp1) (EAnd exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (EEq exp0 exp1) (EEq exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (ENe exp0 exp1) (ENe exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (ELt exp0 exp1) (ELt exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (ELe exp0 exp1) (ELe exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (EGt exp0 exp1) (EGt exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (EGe exp0 exp1) (EGe exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (EListCons exp0 exp1) (EListCons exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (EAdd exp0 exp1) (EAdd exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (ESub exp0 exp1) (ESub exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (EMul exp0 exp1) (EMul exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (EDiv exp0 exp1) (EDiv exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (EMod exp0 exp1) (EMod exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (ENeg exp) (ENeg exp_) = compare exp exp_ -compareSame (EApp exp0 exp1) (EApp exp0_ exp1_) = mappend (compare exp0 exp0_) (compare exp1 exp1_) -compareSame (EProj exp i) (EProj exp_ i_) = mappend (compare exp exp_) (compare i i_) -compareSame (ERecType fieldtypes) (ERecType fieldtypes_) = compare fieldtypes fieldtypes_ -compareSame (ERec fieldvalues) (ERec fieldvalues_) = compare fieldvalues fieldvalues_ -compareSame EEmptyList EEmptyList = EQ -compareSame (EList exps) (EList exps_) = compare exps exps_ -compareSame (ETuple exp exps) (ETuple exp_ exps_) = mappend (compare exp exp_) (compare exps exps_) -compareSame (EVar i) (EVar i_) = compare i i_ -compareSame EType EType = EQ -compareSame (EStr str) (EStr str_) = compare str str_ -compareSame (EInteger n) (EInteger n_) = compare n n_ -compareSame (EDouble d) (EDouble d_) = compare d d_ -compareSame EMeta EMeta = EQ -compareSame (VVar i) (VVar i_) = compare i i_ -compareSame VWild VWild = EQ -compareSame (LetDef i exp) (LetDef i_ exp_) = mappend (compare i i_) (compare exp exp_) -compareSame (Case pattern guard exp) (Case pattern_ guard_ exp_) = mappend (compare pattern pattern_) (mappend (compare guard guard_) (compare exp exp_)) -compareSame (BindVar varorwild exp) (BindVar varorwild_ exp_) = mappend (compare varorwild varorwild_) (compare exp exp_) -compareSame (BindNoVar exp) (BindNoVar exp_) = compare exp exp_ -compareSame (FieldType i exp) (FieldType i_ exp_) = mappend (compare i i_) (compare exp exp_) -compareSame (FieldValue i exp) (FieldValue i_ exp_) = mappend (compare i i_) (compare exp exp_) -compareSame (Ident str) (Ident str_) = compare str str_ -compareSame x y = error "BNFC error:" compareSame diff --git a/src/Transfer/Syntax/Doc.tex b/src/Transfer/Syntax/Doc.tex deleted file mode 100644 index 603940459..000000000 --- a/src/Transfer/Syntax/Doc.tex +++ /dev/null @@ -1,333 +0,0 @@ -\batchmode -%This Latex file is machine-generated by the BNF-converter - -\documentclass[a4paper,11pt]{article} -\author{BNF-converter} -\title{The Language Syntax} -\setlength{\parindent}{0mm} -\setlength{\parskip}{1mm} -\begin{document} - -\maketitle - -\newcommand{\emptyP}{\mbox{$\epsilon$}} -\newcommand{\terminal}[1]{\mbox{{\texttt {#1}}}} -\newcommand{\nonterminal}[1]{\mbox{$\langle \mbox{{\sl #1 }} \! \rangle$}} -\newcommand{\arrow}{\mbox{::=}} -\newcommand{\delimit}{\mbox{$|$}} -\newcommand{\reserved}[1]{\mbox{{\texttt {#1}}}} -\newcommand{\literal}[1]{\mbox{{\texttt {#1}}}} -\newcommand{\symb}[1]{\mbox{{\texttt {#1}}}} - -This document was automatically generated by the {\em BNF-Converter}. It was generated together with the lexer, the parser, and the abstract syntax module, which guarantees that the document matches with the implementation of the language (provided no hand-hacking has taken place). - -\section*{The lexical structure of Syntax} -\subsection*{Identifiers} -Identifiers \nonterminal{Ident} are unquoted strings beginning with a letter, -followed by any combination of letters, digits, and the characters {\tt \_ '}, -reserved words excluded. - - -\subsection*{Literals} -String literals \nonterminal{String}\ have the form -\terminal{"}$x$\terminal{"}, where $x$ is any sequence of any characters -except \terminal{"}\ unless preceded by \verb6\6. - - -Integer literals \nonterminal{Int}\ are nonempty sequences of digits. - - -Double-precision float literals \nonterminal{Double}\ have the structure -indicated by the regular expression $\nonterminal{digit}+ \mbox{{\it `.'}} \nonterminal{digit}+ (\mbox{{\it `e'}} \mbox{{\it `-'}}? \nonterminal{digit}+)?$ i.e.\ -two sequences of digits separated by a decimal point, optionally -followed by an unsigned or negative exponent. - - - - -\subsection*{Reserved words and symbols} -The set of reserved words is the set of terminals appearing in the grammar. Those reserved words that consist of non-letter characters are called symbols, and they are treated in a different way from those that are similar to identifiers. The lexer follows rules familiar from languages like Haskell, C, and Java, including longest match and spacing conventions. - -The reserved words used in Syntax are the following: \\ - -\begin{tabular}{lll} -{\reserved{Type}} &{\reserved{case}} &{\reserved{data}} \\ -{\reserved{derive}} &{\reserved{do}} &{\reserved{else}} \\ -{\reserved{if}} &{\reserved{import}} &{\reserved{in}} \\ -{\reserved{let}} &{\reserved{of}} &{\reserved{rec}} \\ -{\reserved{sig}} &{\reserved{then}} &{\reserved{where}} \\ -\end{tabular}\\ - -The symbols used in Syntax are the following: \\ - -\begin{tabular}{lll} -{\symb{;}} &{\symb{:}} &{\symb{\{}} \\ -{\symb{\}}} &{\symb{{$=$}}} &{\symb{{$|$}}} \\ -{\symb{{$|$}{$|$}}} &{\symb{::}} &{\symb{(}} \\ -{\symb{)}} &{\symb{[}} &{\symb{]}} \\ -{\symb{,}} &{\symb{\_}} &{\symb{{$-$}{$>$}}} \\ -{\symb{$\backslash$}} &{\symb{{$<$}{$-$}}} &{\symb{{$>$}{$>$}{$=$}}} \\ -{\symb{{$>$}{$>$}}} &{\symb{\&\&}} &{\symb{{$=$}{$=$}}} \\ -{\symb{/{$=$}}} &{\symb{{$<$}}} &{\symb{{$<$}{$=$}}} \\ -{\symb{{$>$}}} &{\symb{{$>$}{$=$}}} &{\symb{{$+$}}} \\ -{\symb{{$-$}}} &{\symb{*}} &{\symb{/}} \\ -{\symb{\%}} &{\symb{.}} &{\symb{?}} \\ -\end{tabular}\\ - -\subsection*{Comments} -Single-line comments begin with {\symb{{$-$}{$-$}}}. \\Multiple-line comments are enclosed with {\symb{\{{$-$}}} and {\symb{{$-$}\}}}. - -\section*{The syntactic structure of Syntax} -Non-terminals are enclosed between $\langle$ and $\rangle$. -The symbols {\arrow} (production), {\delimit} (union) -and {\emptyP} (empty rule) belong to the BNF notation. -All other symbols are terminals.\\ - -\begin{tabular}{lll} -{\nonterminal{Module}} & {\arrow} &{\nonterminal{ListImport}} {\nonterminal{ListDecl}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Import}} & {\arrow} &{\terminal{import}} {\nonterminal{Ident}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListImport}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{Import}} {\terminal{;}} {\nonterminal{ListImport}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Decl}} & {\arrow} &{\terminal{data}} {\nonterminal{Ident}} {\terminal{:}} {\nonterminal{Exp}} {\terminal{where}} {\terminal{\{}} {\nonterminal{ListConsDecl}} {\terminal{\}}} \\ - & {\delimit} &{\nonterminal{Ident}} {\terminal{:}} {\nonterminal{Exp}} \\ - & {\delimit} &{\nonterminal{Ident}} {\nonterminal{ListPattern}} {\nonterminal{Guard}} {\terminal{{$=$}}} {\nonterminal{Exp}} \\ - & {\delimit} &{\terminal{derive}} {\nonterminal{Ident}} {\nonterminal{Ident}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListDecl}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{Decl}} {\terminal{;}} {\nonterminal{ListDecl}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ConsDecl}} & {\arrow} &{\nonterminal{Ident}} {\terminal{:}} {\nonterminal{Exp}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListConsDecl}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{ConsDecl}} \\ - & {\delimit} &{\nonterminal{ConsDecl}} {\terminal{;}} {\nonterminal{ListConsDecl}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Guard}} & {\arrow} &{\terminal{{$|$}}} {\nonterminal{Exp1}} \\ - & {\delimit} &{\emptyP} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Pattern}} & {\arrow} &{\nonterminal{Pattern1}} {\terminal{{$|$}{$|$}}} {\nonterminal{Pattern}} \\ - & {\delimit} &{\nonterminal{Pattern1}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Pattern1}} & {\arrow} &{\nonterminal{Pattern2}} {\terminal{::}} {\nonterminal{Pattern1}} \\ - & {\delimit} &{\nonterminal{Pattern2}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Pattern2}} & {\arrow} &{\nonterminal{Ident}} {\nonterminal{Pattern3}} {\nonterminal{ListPattern}} \\ - & {\delimit} &{\nonterminal{Pattern3}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Pattern3}} & {\arrow} &{\terminal{rec}} {\terminal{\{}} {\nonterminal{ListFieldPattern}} {\terminal{\}}} \\ - & {\delimit} &{\terminal{[}} {\terminal{]}} \\ - & {\delimit} &{\terminal{[}} {\nonterminal{ListCommaPattern}} {\terminal{]}} \\ - & {\delimit} &{\terminal{(}} {\nonterminal{CommaPattern}} {\terminal{,}} {\nonterminal{ListCommaPattern}} {\terminal{)}} \\ - & {\delimit} &{\nonterminal{String}} \\ - & {\delimit} &{\nonterminal{Integer}} \\ - & {\delimit} &{\nonterminal{Ident}} \\ - & {\delimit} &{\terminal{\_}} \\ - & {\delimit} &{\terminal{(}} {\nonterminal{Pattern}} {\terminal{)}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{CommaPattern}} & {\arrow} &{\nonterminal{Pattern}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListCommaPattern}} & {\arrow} &{\nonterminal{CommaPattern}} \\ - & {\delimit} &{\nonterminal{CommaPattern}} {\terminal{,}} {\nonterminal{ListCommaPattern}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListPattern}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{Pattern3}} {\nonterminal{ListPattern}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{FieldPattern}} & {\arrow} &{\nonterminal{Ident}} {\terminal{{$=$}}} {\nonterminal{Pattern}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListFieldPattern}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{FieldPattern}} \\ - & {\delimit} &{\nonterminal{FieldPattern}} {\terminal{;}} {\nonterminal{ListFieldPattern}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp}} & {\arrow} &{\terminal{(}} {\nonterminal{VarOrWild}} {\terminal{:}} {\nonterminal{Exp}} {\terminal{)}} {\terminal{{$-$}{$>$}}} {\nonterminal{Exp}} \\ - & {\delimit} &{\nonterminal{Exp1}} {\terminal{{$-$}{$>$}}} {\nonterminal{Exp}} \\ - & {\delimit} &{\nonterminal{Exp1}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{VarOrWild}} & {\arrow} &{\nonterminal{Ident}} \\ - & {\delimit} &{\terminal{\_}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp1}} & {\arrow} &{\terminal{$\backslash$}} {\nonterminal{VarOrWild}} {\terminal{{$-$}{$>$}}} {\nonterminal{Exp1}} \\ - & {\delimit} &{\terminal{let}} {\terminal{\{}} {\nonterminal{ListLetDef}} {\terminal{\}}} {\terminal{in}} {\nonterminal{Exp1}} \\ - & {\delimit} &{\terminal{case}} {\nonterminal{Exp}} {\terminal{of}} {\terminal{\{}} {\nonterminal{ListCase}} {\terminal{\}}} \\ - & {\delimit} &{\terminal{if}} {\nonterminal{Exp}} {\terminal{then}} {\nonterminal{Exp}} {\terminal{else}} {\nonterminal{Exp1}} \\ - & {\delimit} &{\terminal{do}} {\terminal{\{}} {\nonterminal{ListBind}} {\nonterminal{Exp}} {\terminal{\}}} \\ - & {\delimit} &{\nonterminal{Exp2}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{LetDef}} & {\arrow} &{\nonterminal{Ident}} {\terminal{{$=$}}} {\nonterminal{Exp}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListLetDef}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{LetDef}} \\ - & {\delimit} &{\nonterminal{LetDef}} {\terminal{;}} {\nonterminal{ListLetDef}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Case}} & {\arrow} &{\nonterminal{Pattern}} {\nonterminal{Guard}} {\terminal{{$-$}{$>$}}} {\nonterminal{Exp}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListCase}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{Case}} \\ - & {\delimit} &{\nonterminal{Case}} {\terminal{;}} {\nonterminal{ListCase}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Bind}} & {\arrow} &{\nonterminal{VarOrWild}} {\terminal{{$<$}{$-$}}} {\nonterminal{Exp}} \\ - & {\delimit} &{\nonterminal{Exp}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListBind}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{Bind}} {\terminal{;}} {\nonterminal{ListBind}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp3}} & {\arrow} &{\nonterminal{Exp3}} {\terminal{{$>$}{$>$}{$=$}}} {\nonterminal{Exp4}} \\ - & {\delimit} &{\nonterminal{Exp3}} {\terminal{{$>$}{$>$}}} {\nonterminal{Exp4}} \\ - & {\delimit} &{\nonterminal{Exp4}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp4}} & {\arrow} &{\nonterminal{Exp5}} {\terminal{{$|$}{$|$}}} {\nonterminal{Exp4}} \\ - & {\delimit} &{\nonterminal{Exp5}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp5}} & {\arrow} &{\nonterminal{Exp6}} {\terminal{\&\&}} {\nonterminal{Exp5}} \\ - & {\delimit} &{\nonterminal{Exp6}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp6}} & {\arrow} &{\nonterminal{Exp7}} {\terminal{{$=$}{$=$}}} {\nonterminal{Exp7}} \\ - & {\delimit} &{\nonterminal{Exp7}} {\terminal{/{$=$}}} {\nonterminal{Exp7}} \\ - & {\delimit} &{\nonterminal{Exp7}} {\terminal{{$<$}}} {\nonterminal{Exp7}} \\ - & {\delimit} &{\nonterminal{Exp7}} {\terminal{{$<$}{$=$}}} {\nonterminal{Exp7}} \\ - & {\delimit} &{\nonterminal{Exp7}} {\terminal{{$>$}}} {\nonterminal{Exp7}} \\ - & {\delimit} &{\nonterminal{Exp7}} {\terminal{{$>$}{$=$}}} {\nonterminal{Exp7}} \\ - & {\delimit} &{\nonterminal{Exp7}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp7}} & {\arrow} &{\nonterminal{Exp8}} {\terminal{::}} {\nonterminal{Exp7}} \\ - & {\delimit} &{\nonterminal{Exp8}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp8}} & {\arrow} &{\nonterminal{Exp8}} {\terminal{{$+$}}} {\nonterminal{Exp9}} \\ - & {\delimit} &{\nonterminal{Exp8}} {\terminal{{$-$}}} {\nonterminal{Exp9}} \\ - & {\delimit} &{\nonterminal{Exp9}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp9}} & {\arrow} &{\nonterminal{Exp9}} {\terminal{*}} {\nonterminal{Exp10}} \\ - & {\delimit} &{\nonterminal{Exp9}} {\terminal{/}} {\nonterminal{Exp10}} \\ - & {\delimit} &{\nonterminal{Exp9}} {\terminal{\%}} {\nonterminal{Exp10}} \\ - & {\delimit} &{\nonterminal{Exp10}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp10}} & {\arrow} &{\terminal{{$-$}}} {\nonterminal{Exp10}} \\ - & {\delimit} &{\nonterminal{Exp11}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp11}} & {\arrow} &{\nonterminal{Exp11}} {\nonterminal{Exp12}} \\ - & {\delimit} &{\nonterminal{Exp12}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp12}} & {\arrow} &{\nonterminal{Exp12}} {\terminal{.}} {\nonterminal{Ident}} \\ - & {\delimit} &{\nonterminal{Exp13}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp13}} & {\arrow} &{\terminal{sig}} {\terminal{\{}} {\nonterminal{ListFieldType}} {\terminal{\}}} \\ - & {\delimit} &{\terminal{rec}} {\terminal{\{}} {\nonterminal{ListFieldValue}} {\terminal{\}}} \\ - & {\delimit} &{\terminal{[}} {\terminal{]}} \\ - & {\delimit} &{\terminal{[}} {\nonterminal{ListExp}} {\terminal{]}} \\ - & {\delimit} &{\terminal{(}} {\nonterminal{Exp}} {\terminal{,}} {\nonterminal{ListExp}} {\terminal{)}} \\ - & {\delimit} &{\nonterminal{Ident}} \\ - & {\delimit} &{\terminal{Type}} \\ - & {\delimit} &{\nonterminal{String}} \\ - & {\delimit} &{\nonterminal{Integer}} \\ - & {\delimit} &{\nonterminal{Double}} \\ - & {\delimit} &{\terminal{?}} \\ - & {\delimit} &{\terminal{(}} {\nonterminal{Exp}} {\terminal{)}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{FieldType}} & {\arrow} &{\nonterminal{Ident}} {\terminal{:}} {\nonterminal{Exp}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListFieldType}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{FieldType}} \\ - & {\delimit} &{\nonterminal{FieldType}} {\terminal{;}} {\nonterminal{ListFieldType}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{FieldValue}} & {\arrow} &{\nonterminal{Ident}} {\terminal{{$=$}}} {\nonterminal{Exp}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListFieldValue}} & {\arrow} &{\emptyP} \\ - & {\delimit} &{\nonterminal{FieldValue}} \\ - & {\delimit} &{\nonterminal{FieldValue}} {\terminal{;}} {\nonterminal{ListFieldValue}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{Exp2}} & {\arrow} &{\nonterminal{Exp3}} \\ -\end{tabular}\\ - -\begin{tabular}{lll} -{\nonterminal{ListExp}} & {\arrow} &{\nonterminal{Exp}} \\ - & {\delimit} &{\nonterminal{Exp}} {\terminal{,}} {\nonterminal{ListExp}} \\ -\end{tabular}\\ - - - -\end{document} - diff --git a/src/Transfer/Syntax/Layout.hs b/src/Transfer/Syntax/Layout.hs deleted file mode 100644 index de5c99870..000000000 --- a/src/Transfer/Syntax/Layout.hs +++ /dev/null @@ -1,227 +0,0 @@ -module Transfer.Syntax.Layout where - -import Transfer.Syntax.Lex - - -import Data.Maybe (isNothing, fromJust) - --- Generated by the BNF Converter - --- local parameters - -topLayout = True -layoutWords = ["let","where","of","rec","sig","do"] -layoutStopWords = ["in"] - --- layout separators - -layoutOpen = "{" -layoutClose = "}" -layoutSep = ";" - --- | Replace layout syntax with explicit layout tokens. -resolveLayout :: Bool -- ^ Whether to use top-level layout. - -> [Token] -> [Token] -resolveLayout tp = res Nothing [if tl then Implicit 1 else Explicit] - where - -- Do top-level layout if the function parameter and the grammar say so. - tl = tp && topLayout - - res :: Maybe Token -- ^ The previous token, if any. - -> [Block] -- ^ A stack of layout blocks. - -> [Token] -> [Token] - - -- The stack should never be empty. - res _ [] ts = error $ "Layout error: stack empty. Tokens: " ++ show ts - - res _ st (t0:ts) - -- We found an open brace in the input, - -- put an explicit layout block on the stack. - -- This is done even if there was no layout word, - -- to keep opening and closing braces. - | isLayoutOpen t0 = moveAlong (Explicit:st) [t0] ts - - res _ st (t0:ts) - -- Start a new layout block if the first token is a layout word - | isLayout t0 = - case ts of - -- Explicit layout, just move on. The case above - -- will push an explicit layout block. - t1:_ | isLayoutOpen t1 -> moveAlong st [t0] ts - -- at end of file, the start column doesn't matter - _ -> let col = if null ts then column t0 else column (head ts) - -- insert an open brace after the layout word - b:ts' = addToken (nextPos t0) layoutOpen ts - -- save the start column - st' = Implicit col:st - in moveAlong st' [t0,b] ts' - - -- If we encounter a closing brace, exit the first explicit layout block. - | isLayoutClose t0 = - let st' = drop 1 (dropWhile isImplicit st) - in if null st' - then error $ "Layout error: Found " ++ layoutClose ++ " at (" - ++ show (line t0) ++ "," ++ show (column t0) - ++ ") without an explicit layout block." - else moveAlong st' [t0] ts - - -- We are in an implicit layout block - res pt st@(Implicit n:ns) (t0:ts) - - -- End of implicit block by a layout stop word - | isStop t0 = - -- Exit the current block and all implicit blocks - -- more indented than the current token - let (ebs,ns') = span (`moreIndent` column t0) ns - moreIndent (Implicit x) y = x > y - moreIndent Explicit _ = False - -- the number of blocks exited - b = 1 + length ebs - bs = replicate b layoutClose - -- Insert closing braces after the previous token. - (ts1,ts2) = splitAt (1+b) $ addTokens (afterPrev pt) bs (t0:ts) - in moveAlong ns' ts1 ts2 - - -- End of an implicit layout block - | newLine && column t0 < n = - -- Insert a closing brace after the previous token. - let b:t0':ts' = addToken (afterPrev pt) layoutClose (t0:ts) - -- Repeat, with the current block removed from the stack - in moveAlong ns [b] (t0':ts') - - -- Encounted a new line in an implicit layout block. - | newLine && column t0 == n = - -- Insert a semicolon after the previous token. - -- unless we are the beginning of the file, - -- or the previous token is a semicolon or open brace. - if isNothing pt || isTokenIn [layoutSep,layoutOpen] (fromJust pt) - then moveAlong st [t0] ts - else let b:t0':ts' = addToken (afterPrev pt) layoutSep (t0:ts) - in moveAlong st [b,t0'] ts' - where newLine = case pt of - Nothing -> True - Just t -> line t /= line t0 - - -- Nothing to see here, move along. - res _ st (t:ts) = moveAlong st [t] ts - - -- At EOF: skip explicit blocks. - res (Just t) (Explicit:bs) [] | null bs = [] - | otherwise = res (Just t) bs [] - - -- If we are using top-level layout, insert a semicolon after - -- the last token, if there isn't one already - res (Just t) [Implicit n] [] - | isTokenIn [layoutSep] t = [] - | otherwise = addToken (nextPos t) layoutSep [] - - -- At EOF in an implicit, non-top-level block: close the block - res (Just t) (Implicit n:bs) [] = - let c = addToken (nextPos t) layoutClose [] - in moveAlong bs c [] - - -- This should only happen if the input is empty. - res Nothing st [] = [] - - -- | Move on to the next token. - moveAlong :: [Block] -- ^ The layout stack. - -> [Token] -- ^ Any tokens just processed. - -> [Token] -- ^ the rest of the tokens. - -> [Token] - moveAlong st [] ts = error $ "Layout error: moveAlong got [] as old tokens" - moveAlong st ot ts = ot ++ res (Just $ last ot) st ts - -data Block = Implicit Int -- ^ An implicit layout block with its start column. - | Explicit - deriving Show - -type Position = Posn - --- | Check if s block is implicit. -isImplicit :: Block -> Bool -isImplicit (Implicit _) = True -isImplicit _ = False - --- | Insert a number of tokens at the begninning of a list of tokens. -addTokens :: Position -- ^ Position of the first new token. - -> [String] -- ^ Token symbols. - -> [Token] -- ^ The rest of the tokens. These will have their - -- positions updated to make room for the new tokens . - -> [Token] -addTokens p ss ts = foldr (addToken p) ts ss - --- | Insert a new symbol token at the begninning of a list of tokens. -addToken :: Position -- ^ Position of the new token. - -> String -- ^ Symbol in the new token. - -> [Token] -- ^ The rest of the tokens. These will have their - -- positions updated to make room for the new token. - -> [Token] -addToken p s ts = sToken p s : map (incrGlobal p (length s)) ts - --- | Get the position immediately to the right of the given token. --- If no token is given, gets the first position in the file. -afterPrev :: Maybe Token -> Position -afterPrev = maybe (Pn 0 1 1) nextPos - --- | Get the position immediately to the right of the given token. -nextPos :: Token -> Position -nextPos t = Pn (g + s) l (c + s + 1) - where Pn g l c = position t - s = tokenLength t - --- | Add to the global and column positions of a token. --- The column position is only changed if the token is on --- the same line as the given position. -incrGlobal :: Position -- ^ If the token is on the same line - -- as this position, update the column position. - -> Int -- ^ Number of characters to add to the position. - -> Token -> Token -incrGlobal (Pn _ l0 _) i (PT (Pn g l c) t) = - if l /= l0 then PT (Pn (g + i) l c) t - else PT (Pn (g + i) l (c + i)) t -incrGlobal _ _ p = error $ "cannot add token at " ++ show p - --- | Create a symbol token. -sToken :: Position -> String -> Token -sToken p s = PT p (TS s) -- reserved word or symbol - --- | Get the position of a token. -position :: Token -> Position -position t = case t of - PT p _ -> p - Err p -> p - --- | Get the line number of a token. -line :: Token -> Int -line t = case position t of Pn _ l _ -> l - --- | Get the column number of a token. -column :: Token -> Int -column t = case position t of Pn _ _ c -> c - --- | Check if a token is one of the given symbols. -isTokenIn :: [String] -> Token -> Bool -isTokenIn ts t = case t of - PT _ (TS r) | elem r ts -> True - _ -> False - --- | Check if a word is a layout start token. -isLayout :: Token -> Bool -isLayout = isTokenIn layoutWords - --- | Check if a token is a layout stop token. -isStop :: Token -> Bool -isStop = isTokenIn layoutStopWords - --- | Check if a token is the layout open token. -isLayoutOpen :: Token -> Bool -isLayoutOpen = isTokenIn [layoutOpen] - --- | Check if a token is the layout close token. -isLayoutClose :: Token -> Bool -isLayoutClose = isTokenIn [layoutClose] - --- | Get the number of characters in the token. -tokenLength :: Token -> Int -tokenLength t = length $ prToken t - diff --git a/src/Transfer/Syntax/Lex.hs b/src/Transfer/Syntax/Lex.hs deleted file mode 100644 index 83c9e1a12..000000000 --- a/src/Transfer/Syntax/Lex.hs +++ /dev/null @@ -1,337 +0,0 @@ -{-# OPTIONS -fglasgow-exts -cpp #-} -{-# LINE 3 "Transfer/Syntax/Lex.x" #-} -{-# OPTIONS -fno-warn-incomplete-patterns #-} -module Transfer.Syntax.Lex where - - - -#if __GLASGOW_HASKELL__ >= 603 -#include "ghcconfig.h" -#else -#include "config.h" -#endif -#if __GLASGOW_HASKELL__ >= 503 -import Data.Array -import Data.Char (ord) -import Data.Array.Base (unsafeAt) -#else -import Array -import Char (ord) -#endif -#if __GLASGOW_HASKELL__ >= 503 -import GHC.Exts -#else -import GlaExts -#endif -alex_base :: AlexAddr -alex_base = AlexA# "\x01\x00\x00\x00\x15\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x18\x00\x00\x00\x19\x00\x00\x00\x1a\x00\x00\x00\x00\x00\x00\x00\x44\x00\x00\x00\x45\x00\x00\x00\x1b\x00\x00\x00\x1c\x00\x00\x00\x1d\x00\x00\x00\x42\x00\x00\x00\x00\x00\x00\x00\xd4\xff\xff\xff\x17\x00\x00\x00\x26\x00\x00\x00\x1e\x00\x00\x00\x27\x00\x00\x00\x29\x00\x00\x00\x2a\x00\x00\x00\x2c\x00\x00\x00\x9c\x00\x00\x00\x00\x00\x00\x00\x17\x01\x00\x00\xd5\x00\x00\x00\xf2\x00\x00\x00\x6c\x01\x00\x00\x1a\x01\x00\x00\x76\x01\x00\x00\x80\x01\x00\x00\x8d\x01\x00\x00"# - -alex_table :: AlexAddr -alex_table = AlexA# "\x00\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\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\x0d\x00\xff\xff\x19\x00\xff\xff\xff\xff\x0e\x00\x16\x00\xff\xff\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x05\x00\x0e\x00\x15\x00\x1b\x00\x1b\x00\x1b\x00\x1b\x00\x1b\x00\x1b\x00\x1b\x00\x1b\x00\x1b\x00\x1b\x00\x10\x00\x0e\x00\x11\x00\x14\x00\x13\x00\x0e\x00\xff\xff\x04\x00\xff\xff\xff\xff\x03\x00\x03\x00\x09\x00\x09\x00\x09\x00\x0b\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x00\x00\x00\x00\x00\x00\x0e\x00\x00\x00\x00\x00\x00\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\xff\xff\x0e\x00\xff\xff\x0d\x00\x0e\x00\x0e\x00\x12\x00\x0e\x00\x0e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0c\x00\x0f\x00\x0e\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\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\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\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x06\x00\x07\x00\x17\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x00\x00\x00\x00\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x19\x00\xff\xff\x00\x00\x00\x00\x17\x00\x19\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1e\x00\xff\xff\x1b\x00\x1b\x00\x1b\x00\x1b\x00\x1b\x00\x1b\x00\x1b\x00\x1b\x00\x1b\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x1a\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x00\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x17\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1c\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1f\x00\x00\x00\x00\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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"# - -alex_check :: AlexAddr -alex_check = AlexA# "\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x2d\x00\x0a\x00\x0a\x00\x2d\x00\x2d\x00\x2d\x00\x2d\x00\x2d\x00\x2d\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x7c\x00\x3a\x00\x26\x00\x2d\x00\xff\xff\xff\xff\xff\xff\x3e\x00\xff\xff\xff\xff\xff\xff\x3d\x00\x5b\x00\x5c\x00\x5d\x00\x5e\x00\x5f\x00\x60\x00\x20\x00\x3d\x00\x3d\x00\x3e\x00\x3d\x00\x3d\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x2d\x00\x2d\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x7b\x00\x7c\x00\x7d\x00\x7e\x00\x7f\x00\x80\x00\x81\x00\x82\x00\x83\x00\x84\x00\x85\x00\x86\x00\x87\x00\x88\x00\x89\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\x9a\x00\x9b\x00\x9c\x00\x9d\x00\x9e\x00\x9f\x00\xa0\x00\xa1\x00\xa2\x00\xa3\x00\xa4\x00\xa5\x00\xa6\x00\xa7\x00\xa8\x00\xa9\x00\xaa\x00\xab\x00\xac\x00\xad\x00\xae\x00\xaf\x00\xb0\x00\xb1\x00\xb2\x00\xb3\x00\xb4\x00\xb5\x00\xb6\x00\xb7\x00\xb8\x00\xb9\x00\xba\x00\xbb\x00\xbc\x00\xbd\x00\xbe\x00\xbf\x00\x7d\x00\x7d\x00\x27\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xd7\x00\xff\xff\xff\xff\xff\xff\xff\xff\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4c\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\x53\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x22\x00\xf7\x00\xff\xff\xff\xff\x5f\x00\x27\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x2e\x00\x0a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x5c\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x22\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x6e\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x74\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xc0\x00\xc1\x00\xc2\x00\xc3\x00\xc4\x00\xc5\x00\xc6\x00\xc7\x00\xc8\x00\xc9\x00\xca\x00\xcb\x00\xcc\x00\xcd\x00\xce\x00\xcf\x00\xd0\x00\xd1\x00\xd2\x00\xd3\x00\xd4\x00\xd5\x00\xd6\x00\x5c\x00\xd8\x00\xd9\x00\xda\x00\xdb\x00\xdc\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xf5\x00\xf6\x00\xff\xff\xf8\x00\xf9\x00\xfa\x00\xfb\x00\xfc\x00\xfd\x00\xfe\x00\xff\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x2d\x00\xff\xff\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x65\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\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\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\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\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\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\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\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\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\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\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"# - -alex_deflt :: AlexAddr -alex_deflt = AlexA# "\x17\x00\xff\xff\x02\x00\x02\x00\xff\xff\xff\xff\x0a\x00\xff\xff\x0a\x00\x0a\x00\x0a\x00\x0a\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x19\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"# - -alex_accept = listArray (0::Int,32) [[],[],[(AlexAccSkip)],[(AlexAccSkip)],[],[(AlexAcc (alex_action_3))],[(AlexAccSkip)],[(AlexAccSkip)],[],[],[],[],[(AlexAcc (alex_action_3))],[(AlexAccSkip)],[(AlexAcc (alex_action_3))],[(AlexAcc (alex_action_3))],[(AlexAcc (alex_action_3))],[(AlexAcc (alex_action_3))],[(AlexAcc (alex_action_3))],[(AlexAcc (alex_action_3))],[(AlexAcc (alex_action_3))],[(AlexAcc (alex_action_3))],[],[(AlexAcc (alex_action_4))],[(AlexAcc (alex_action_5))],[],[],[(AlexAcc (alex_action_6))],[(AlexAcc (alex_action_7))],[(AlexAcc (alex_action_7))],[],[],[]] -{-# LINE 34 "Transfer/Syntax/Lex.x" #-} - -tok f p s = f p s - -share :: String -> String -share = id - -data Tok = - TS !String -- reserved words and symbols - | TL !String -- string literals - | TI !String -- integer literals - | TV !String -- identifiers - | TD !String -- double precision float literals - | TC !String -- character literals - - deriving (Eq,Show,Ord) - -data Token = - PT Posn Tok - | Err Posn - deriving (Eq,Show,Ord) - -tokenPos (PT (Pn _ l _) _ :_) = "line " ++ show l -tokenPos (Err (Pn _ l _) :_) = "line " ++ show l -tokenPos _ = "end of file" - -posLineCol (Pn _ l c) = (l,c) -mkPosToken t@(PT p _) = (posLineCol p, prToken t) - -prToken t = case t of - PT _ (TS s) -> s - PT _ (TI s) -> s - PT _ (TV s) -> s - PT _ (TD s) -> s - PT _ (TC s) -> s - - _ -> show t - -data BTree = N | B String Tok BTree BTree deriving (Show) - -eitherResIdent :: (String -> Tok) -> String -> Tok -eitherResIdent tv s = treeFind resWords - where - treeFind N = tv s - treeFind (B a t left right) | s < a = treeFind left - | s > a = treeFind right - | s == a = t - -resWords = b "import" (b "derive" (b "case" (b "Type" N N) (b "data" N N)) (b "else" (b "do" N N) (b "if" N N))) (b "rec" (b "let" (b "in" N N) (b "of" N N)) (b "then" (b "sig" N N) (b "where" N N))) - where b s = B s (TS s) - -unescapeInitTail :: String -> String -unescapeInitTail = unesc . tail where - unesc s = case s of - '\\':c:cs | elem c ['\"', '\\', '\''] -> c : unesc cs - '\\':'n':cs -> '\n' : unesc cs - '\\':'t':cs -> '\t' : unesc cs - '"':[] -> [] - c:cs -> c : unesc cs - _ -> [] - -------------------------------------------------------------------- --- Alex wrapper code. --- A modified "posn" wrapper. -------------------------------------------------------------------- - -data Posn = Pn !Int !Int !Int - deriving (Eq, Show,Ord) - -alexStartPos :: Posn -alexStartPos = Pn 0 1 1 - -alexMove :: Posn -> Char -> Posn -alexMove (Pn a l c) '\t' = Pn (a+1) l (((c+7) `div` 8)*8+1) -alexMove (Pn a l c) '\n' = Pn (a+1) (l+1) 1 -alexMove (Pn a l c) _ = Pn (a+1) l (c+1) - -type AlexInput = (Posn, -- current position, - Char, -- previous char - String) -- current input string - -tokens :: String -> [Token] -tokens str = go (alexStartPos, '\n', str) - where - go :: (Posn, Char, String) -> [Token] - go inp@(pos, _, str) = - case alexScan inp 0 of - AlexEOF -> [] - AlexError (pos, _, _) -> fail $ show pos ++ ": lexical error" - AlexSkip inp' len -> go inp' - AlexToken inp' len act -> act pos (take len str) : (go inp') - -alexGetChar :: AlexInput -> Maybe (Char,AlexInput) -alexGetChar (p, c, []) = Nothing -alexGetChar (p, _, (c:s)) = - let p' = alexMove p c - in p' `seq` Just (c, (p', c, s)) - -alexInputPrevChar :: AlexInput -> Char -alexInputPrevChar (p, c, s) = c - -alex_action_3 = tok (\p s -> PT p (TS $ share s)) -alex_action_4 = tok (\p s -> PT p (eitherResIdent (TV . share) s)) -alex_action_5 = tok (\p s -> PT p (TL $ share $ unescapeInitTail s)) -alex_action_6 = tok (\p s -> PT p (TI $ share s)) -alex_action_7 = tok (\p s -> PT p (TD $ share s)) -{-# LINE 1 "GenericTemplate.hs" #-} -{-# LINE 1 "" #-} -{-# LINE 1 "" #-} -{-# LINE 1 "GenericTemplate.hs" #-} --- ----------------------------------------------------------------------------- --- ALEX TEMPLATE --- --- This code is in the PUBLIC DOMAIN; you may copy it freely and use --- it for any purpose whatsoever. - --- ----------------------------------------------------------------------------- --- INTERNALS and main scanner engine - -{-# LINE 35 "GenericTemplate.hs" #-} - -{-# LINE 45 "GenericTemplate.hs" #-} - - -data AlexAddr = AlexA# Addr# - -#if __GLASGOW_HASKELL__ < 503 -uncheckedShiftL# = shiftL# -#endif - -{-# INLINE alexIndexInt16OffAddr #-} -alexIndexInt16OffAddr (AlexA# arr) off = -#ifdef WORDS_BIGENDIAN - narrow16Int# i - where - i = word2Int# ((high `uncheckedShiftL#` 8#) `or#` low) - high = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#))) - low = int2Word# (ord# (indexCharOffAddr# arr off')) - off' = off *# 2# -#else - indexInt16OffAddr# arr off -#endif - - - - - -{-# INLINE alexIndexInt32OffAddr #-} -alexIndexInt32OffAddr (AlexA# arr) off = -#ifdef WORDS_BIGENDIAN - narrow32Int# i - where - i = word2Int# ((b3 `uncheckedShiftL#` 24#) `or#` - (b2 `uncheckedShiftL#` 16#) `or#` - (b1 `uncheckedShiftL#` 8#) `or#` b0) - b3 = int2Word# (ord# (indexCharOffAddr# arr (off' +# 3#))) - b2 = int2Word# (ord# (indexCharOffAddr# arr (off' +# 2#))) - b1 = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#))) - b0 = int2Word# (ord# (indexCharOffAddr# arr off')) - off' = off *# 4# -#else - indexInt32OffAddr# arr off -#endif - - - - - -#if __GLASGOW_HASKELL__ < 503 -quickIndex arr i = arr ! i -#else --- GHC >= 503, unsafeAt is available from Data.Array.Base. -quickIndex = unsafeAt -#endif - - - - --- ----------------------------------------------------------------------------- --- Main lexing routines - -data AlexReturn a - = AlexEOF - | AlexError !AlexInput - | AlexSkip !AlexInput !Int - | AlexToken !AlexInput !Int a - --- alexScan :: AlexInput -> StartCode -> Maybe (AlexInput,Int,act) -alexScan input (I# (sc)) - = alexScanUser undefined input (I# (sc)) - -alexScanUser user input (I# (sc)) - = case alex_scan_tkn user input 0# input sc AlexNone of - (AlexNone, input') -> - case alexGetChar input of - Nothing -> - - - - AlexEOF - Just _ -> - - - - AlexError input' - - (AlexLastSkip input len, _) -> - - - - AlexSkip input len - - (AlexLastAcc k input len, _) -> - - - - AlexToken input len k - - --- Push the input through the DFA, remembering the most recent accepting --- state it encountered. - -alex_scan_tkn user orig_input len input s last_acc = - input `seq` -- strict in the input - case s of - -1# -> (last_acc, input) - _ -> alex_scan_tkn' user orig_input len input s last_acc - -alex_scan_tkn' user orig_input len input s last_acc = - let - new_acc = check_accs (alex_accept `quickIndex` (I# (s))) - in - new_acc `seq` - case alexGetChar input of - Nothing -> (new_acc, input) - Just (c, new_input) -> - - - - let - base = alexIndexInt32OffAddr alex_base s - (I# (ord_c)) = ord c - offset = (base +# ord_c) - check = alexIndexInt16OffAddr alex_check offset - - new_s = if (offset >=# 0#) && (check ==# ord_c) - then alexIndexInt16OffAddr alex_table offset - else alexIndexInt16OffAddr alex_deflt s - in - alex_scan_tkn user orig_input (len +# 1#) new_input new_s new_acc - - where - check_accs [] = last_acc - check_accs (AlexAcc a : _) = AlexLastAcc a input (I# (len)) - check_accs (AlexAccSkip : _) = AlexLastSkip input (I# (len)) - check_accs (AlexAccPred a pred : rest) - | pred user orig_input (I# (len)) input - = AlexLastAcc a input (I# (len)) - check_accs (AlexAccSkipPred pred : rest) - | pred user orig_input (I# (len)) input - = AlexLastSkip input (I# (len)) - check_accs (_ : rest) = check_accs rest - -data AlexLastAcc a - = AlexNone - | AlexLastAcc a !AlexInput !Int - | AlexLastSkip !AlexInput !Int - -data AlexAcc a user - = AlexAcc a - | AlexAccSkip - | AlexAccPred a (AlexAccPred user) - | AlexAccSkipPred (AlexAccPred user) - -type AlexAccPred user = user -> AlexInput -> Int -> AlexInput -> Bool - --- ----------------------------------------------------------------------------- --- Predicates on a rule - -alexAndPred p1 p2 user in1 len in2 - = p1 user in1 len in2 && p2 user in1 len in2 - ---alexPrevCharIsPred :: Char -> AlexAccPred _ -alexPrevCharIs c _ input _ _ = c == alexInputPrevChar input - ---alexPrevCharIsOneOfPred :: Array Char Bool -> AlexAccPred _ -alexPrevCharIsOneOf arr _ input _ _ = arr ! alexInputPrevChar input - ---alexRightContext :: Int -> AlexAccPred _ -alexRightContext (I# (sc)) user _ _ input = - case alex_scan_tkn user input 0# input sc AlexNone of - (AlexNone, _) -> False - _ -> True - -- TODO: there's no need to find the longest - -- match when checking the right context, just - -- the first match will do. - --- used by wrappers -iUnbox (I# (i)) = i diff --git a/src/Transfer/Syntax/Lex.x b/src/Transfer/Syntax/Lex.x deleted file mode 100644 index 107b67345..000000000 --- a/src/Transfer/Syntax/Lex.x +++ /dev/null @@ -1,134 +0,0 @@ --- -*- haskell -*- --- This Alex file was machine-generated by the BNF converter -{ -{-# OPTIONS -fno-warn-incomplete-patterns #-} -module Transfer.Syntax.Lex where - - -} - - -$l = [a-zA-Z\192 - \255] # [\215 \247] -- isolatin1 letter FIXME -$c = [A-Z\192-\221] # [\215] -- capital isolatin1 letter FIXME -$s = [a-z\222-\255] # [\247] -- small isolatin1 letter FIXME -$d = [0-9] -- digit -$i = [$l $d _ '] -- identifier character -$u = [\0-\255] -- universal: any character - -@rsyms = -- symbols and non-identifier-like reserved words - \; | \: | \{ | \} | \= | \| | \| \| | \: \: | \( | \) | \[ | \] | \, | \_ | \- \> | \\ | \< \- | \> \> \= | \> \> | \& \& | \= \= | \/ \= | \< | \< \= | \> | \> \= | \+ | \- | \* | \/ | \% | \. | \? - -:- -"--" [.]* ; -- Toss single line comments -"{-" ([$u # \-] | \- [$u # \}])* ("-")+ "}" ; - -$white+ ; -@rsyms { tok (\p s -> PT p (TS $ share s)) } - -$l $i* { tok (\p s -> PT p (eitherResIdent (TV . share) s)) } -\" ([$u # [\" \\ \n]] | (\\ (\" | \\ | \' | n | t)))* \"{ tok (\p s -> PT p (TL $ share $ unescapeInitTail s)) } - -$d+ { tok (\p s -> PT p (TI $ share s)) } -$d+ \. $d+ (e (\-)? $d+)? { tok (\p s -> PT p (TD $ share s)) } - -{ - -tok f p s = f p s - -share :: String -> String -share = id - -data Tok = - TS !String -- reserved words and symbols - | TL !String -- string literals - | TI !String -- integer literals - | TV !String -- identifiers - | TD !String -- double precision float literals - | TC !String -- character literals - - deriving (Eq,Show,Ord) - -data Token = - PT Posn Tok - | Err Posn - deriving (Eq,Show,Ord) - -tokenPos (PT (Pn _ l _) _ :_) = "line " ++ show l -tokenPos (Err (Pn _ l _) :_) = "line " ++ show l -tokenPos _ = "end of file" - -posLineCol (Pn _ l c) = (l,c) -mkPosToken t@(PT p _) = (posLineCol p, prToken t) - -prToken t = case t of - PT _ (TS s) -> s - PT _ (TI s) -> s - PT _ (TV s) -> s - PT _ (TD s) -> s - PT _ (TC s) -> s - - _ -> show t - -data BTree = N | B String Tok BTree BTree deriving (Show) - -eitherResIdent :: (String -> Tok) -> String -> Tok -eitherResIdent tv s = treeFind resWords - where - treeFind N = tv s - treeFind (B a t left right) | s < a = treeFind left - | s > a = treeFind right - | s == a = t - -resWords = b "import" (b "derive" (b "case" (b "Type" N N) (b "data" N N)) (b "else" (b "do" N N) (b "if" N N))) (b "rec" (b "let" (b "in" N N) (b "of" N N)) (b "then" (b "sig" N N) (b "where" N N))) - where b s = B s (TS s) - -unescapeInitTail :: String -> String -unescapeInitTail = unesc . tail where - unesc s = case s of - '\\':c:cs | elem c ['\"', '\\', '\''] -> c : unesc cs - '\\':'n':cs -> '\n' : unesc cs - '\\':'t':cs -> '\t' : unesc cs - '"':[] -> [] - c:cs -> c : unesc cs - _ -> [] - -------------------------------------------------------------------- --- Alex wrapper code. --- A modified "posn" wrapper. -------------------------------------------------------------------- - -data Posn = Pn !Int !Int !Int - deriving (Eq, Show,Ord) - -alexStartPos :: Posn -alexStartPos = Pn 0 1 1 - -alexMove :: Posn -> Char -> Posn -alexMove (Pn a l c) '\t' = Pn (a+1) l (((c+7) `div` 8)*8+1) -alexMove (Pn a l c) '\n' = Pn (a+1) (l+1) 1 -alexMove (Pn a l c) _ = Pn (a+1) l (c+1) - -type AlexInput = (Posn, -- current position, - Char, -- previous char - String) -- current input string - -tokens :: String -> [Token] -tokens str = go (alexStartPos, '\n', str) - where - go :: (Posn, Char, String) -> [Token] - go inp@(pos, _, str) = - case alexScan inp 0 of - AlexEOF -> [] - AlexError (pos, _, _) -> fail $ show pos ++ ": lexical error" - AlexSkip inp' len -> go inp' - AlexToken inp' len act -> act pos (take len str) : (go inp') - -alexGetChar :: AlexInput -> Maybe (Char,AlexInput) -alexGetChar (p, c, []) = Nothing -alexGetChar (p, _, (c:s)) = - let p' = alexMove p c - in p' `seq` Just (c, (p', c, s)) - -alexInputPrevChar :: AlexInput -> Char -alexInputPrevChar (p, c, s) = c -} diff --git a/src/Transfer/Syntax/Par.hs b/src/Transfer/Syntax/Par.hs deleted file mode 100644 index bd83f0a87..000000000 --- a/src/Transfer/Syntax/Par.hs +++ /dev/null @@ -1,1822 +0,0 @@ -{-# OPTIONS -fglasgow-exts -cpp #-} -{-# OPTIONS -fno-warn-incomplete-patterns -fno-warn-overlapping-patterns #-} -module Transfer.Syntax.Par where -import Transfer.Syntax.Abs -import Transfer.Syntax.Lex -import Transfer.ErrM -import Array -#if __GLASGOW_HASKELL__ >= 503 -import GHC.Exts -#else -import GlaExts -#endif - --- parser produced by Happy Version 1.15 - -newtype HappyAbsSyn = HappyAbsSyn (() -> ()) -happyIn5 :: (Ident) -> (HappyAbsSyn ) -happyIn5 x = unsafeCoerce# x -{-# INLINE happyIn5 #-} -happyOut5 :: (HappyAbsSyn ) -> (Ident) -happyOut5 x = unsafeCoerce# x -{-# INLINE happyOut5 #-} -happyIn6 :: (String) -> (HappyAbsSyn ) -happyIn6 x = unsafeCoerce# x -{-# INLINE happyIn6 #-} -happyOut6 :: (HappyAbsSyn ) -> (String) -happyOut6 x = unsafeCoerce# x -{-# INLINE happyOut6 #-} -happyIn7 :: (Integer) -> (HappyAbsSyn ) -happyIn7 x = unsafeCoerce# x -{-# INLINE happyIn7 #-} -happyOut7 :: (HappyAbsSyn ) -> (Integer) -happyOut7 x = unsafeCoerce# x -{-# INLINE happyOut7 #-} -happyIn8 :: (Double) -> (HappyAbsSyn ) -happyIn8 x = unsafeCoerce# x -{-# INLINE happyIn8 #-} -happyOut8 :: (HappyAbsSyn ) -> (Double) -happyOut8 x = unsafeCoerce# x -{-# INLINE happyOut8 #-} -happyIn9 :: (Module) -> (HappyAbsSyn ) -happyIn9 x = unsafeCoerce# x -{-# INLINE happyIn9 #-} -happyOut9 :: (HappyAbsSyn ) -> (Module) -happyOut9 x = unsafeCoerce# x -{-# INLINE happyOut9 #-} -happyIn10 :: (Import) -> (HappyAbsSyn ) -happyIn10 x = unsafeCoerce# x -{-# INLINE happyIn10 #-} -happyOut10 :: (HappyAbsSyn ) -> (Import) -happyOut10 x = unsafeCoerce# x -{-# INLINE happyOut10 #-} -happyIn11 :: ([Import]) -> (HappyAbsSyn ) -happyIn11 x = unsafeCoerce# x -{-# INLINE happyIn11 #-} -happyOut11 :: (HappyAbsSyn ) -> ([Import]) -happyOut11 x = unsafeCoerce# x -{-# INLINE happyOut11 #-} -happyIn12 :: (Decl) -> (HappyAbsSyn ) -happyIn12 x = unsafeCoerce# x -{-# INLINE happyIn12 #-} -happyOut12 :: (HappyAbsSyn ) -> (Decl) -happyOut12 x = unsafeCoerce# x -{-# INLINE happyOut12 #-} -happyIn13 :: ([Decl]) -> (HappyAbsSyn ) -happyIn13 x = unsafeCoerce# x -{-# INLINE happyIn13 #-} -happyOut13 :: (HappyAbsSyn ) -> ([Decl]) -happyOut13 x = unsafeCoerce# x -{-# INLINE happyOut13 #-} -happyIn14 :: (ConsDecl) -> (HappyAbsSyn ) -happyIn14 x = unsafeCoerce# x -{-# INLINE happyIn14 #-} -happyOut14 :: (HappyAbsSyn ) -> (ConsDecl) -happyOut14 x = unsafeCoerce# x -{-# INLINE happyOut14 #-} -happyIn15 :: ([ConsDecl]) -> (HappyAbsSyn ) -happyIn15 x = unsafeCoerce# x -{-# INLINE happyIn15 #-} -happyOut15 :: (HappyAbsSyn ) -> ([ConsDecl]) -happyOut15 x = unsafeCoerce# x -{-# INLINE happyOut15 #-} -happyIn16 :: (Guard) -> (HappyAbsSyn ) -happyIn16 x = unsafeCoerce# x -{-# INLINE happyIn16 #-} -happyOut16 :: (HappyAbsSyn ) -> (Guard) -happyOut16 x = unsafeCoerce# x -{-# INLINE happyOut16 #-} -happyIn17 :: (Pattern) -> (HappyAbsSyn ) -happyIn17 x = unsafeCoerce# x -{-# INLINE happyIn17 #-} -happyOut17 :: (HappyAbsSyn ) -> (Pattern) -happyOut17 x = unsafeCoerce# x -{-# INLINE happyOut17 #-} -happyIn18 :: (Pattern) -> (HappyAbsSyn ) -happyIn18 x = unsafeCoerce# x -{-# INLINE happyIn18 #-} -happyOut18 :: (HappyAbsSyn ) -> (Pattern) -happyOut18 x = unsafeCoerce# x -{-# INLINE happyOut18 #-} -happyIn19 :: (Pattern) -> (HappyAbsSyn ) -happyIn19 x = unsafeCoerce# x -{-# INLINE happyIn19 #-} -happyOut19 :: (HappyAbsSyn ) -> (Pattern) -happyOut19 x = unsafeCoerce# x -{-# INLINE happyOut19 #-} -happyIn20 :: (Pattern) -> (HappyAbsSyn ) -happyIn20 x = unsafeCoerce# x -{-# INLINE happyIn20 #-} -happyOut20 :: (HappyAbsSyn ) -> (Pattern) -happyOut20 x = unsafeCoerce# x -{-# INLINE happyOut20 #-} -happyIn21 :: (CommaPattern) -> (HappyAbsSyn ) -happyIn21 x = unsafeCoerce# x -{-# INLINE happyIn21 #-} -happyOut21 :: (HappyAbsSyn ) -> (CommaPattern) -happyOut21 x = unsafeCoerce# x -{-# INLINE happyOut21 #-} -happyIn22 :: ([CommaPattern]) -> (HappyAbsSyn ) -happyIn22 x = unsafeCoerce# x -{-# INLINE happyIn22 #-} -happyOut22 :: (HappyAbsSyn ) -> ([CommaPattern]) -happyOut22 x = unsafeCoerce# x -{-# INLINE happyOut22 #-} -happyIn23 :: ([Pattern]) -> (HappyAbsSyn ) -happyIn23 x = unsafeCoerce# x -{-# INLINE happyIn23 #-} -happyOut23 :: (HappyAbsSyn ) -> ([Pattern]) -happyOut23 x = unsafeCoerce# x -{-# INLINE happyOut23 #-} -happyIn24 :: (FieldPattern) -> (HappyAbsSyn ) -happyIn24 x = unsafeCoerce# x -{-# INLINE happyIn24 #-} -happyOut24 :: (HappyAbsSyn ) -> (FieldPattern) -happyOut24 x = unsafeCoerce# x -{-# INLINE happyOut24 #-} -happyIn25 :: ([FieldPattern]) -> (HappyAbsSyn ) -happyIn25 x = unsafeCoerce# x -{-# INLINE happyIn25 #-} -happyOut25 :: (HappyAbsSyn ) -> ([FieldPattern]) -happyOut25 x = unsafeCoerce# x -{-# INLINE happyOut25 #-} -happyIn26 :: (Exp) -> (HappyAbsSyn ) -happyIn26 x = unsafeCoerce# x -{-# INLINE happyIn26 #-} -happyOut26 :: (HappyAbsSyn ) -> (Exp) -happyOut26 x = unsafeCoerce# x -{-# INLINE happyOut26 #-} -happyIn27 :: (VarOrWild) -> (HappyAbsSyn ) -happyIn27 x = unsafeCoerce# x -{-# INLINE happyIn27 #-} -happyOut27 :: (HappyAbsSyn ) -> (VarOrWild) -happyOut27 x = unsafeCoerce# x -{-# INLINE happyOut27 #-} -happyIn28 :: (Exp) -> (HappyAbsSyn ) -happyIn28 x = unsafeCoerce# x -{-# INLINE happyIn28 #-} -happyOut28 :: (HappyAbsSyn ) -> (Exp) -happyOut28 x = unsafeCoerce# x -{-# INLINE happyOut28 #-} -happyIn29 :: (LetDef) -> (HappyAbsSyn ) -happyIn29 x = unsafeCoerce# x -{-# INLINE happyIn29 #-} -happyOut29 :: (HappyAbsSyn ) -> (LetDef) -happyOut29 x = unsafeCoerce# x -{-# INLINE happyOut29 #-} -happyIn30 :: ([LetDef]) -> (HappyAbsSyn ) -happyIn30 x = unsafeCoerce# x -{-# INLINE happyIn30 #-} -happyOut30 :: (HappyAbsSyn ) -> ([LetDef]) -happyOut30 x = unsafeCoerce# x -{-# INLINE happyOut30 #-} -happyIn31 :: (Case) -> (HappyAbsSyn ) -happyIn31 x = unsafeCoerce# x -{-# INLINE happyIn31 #-} -happyOut31 :: (HappyAbsSyn ) -> (Case) -happyOut31 x = unsafeCoerce# x -{-# INLINE happyOut31 #-} -happyIn32 :: ([Case]) -> (HappyAbsSyn ) -happyIn32 x = unsafeCoerce# x -{-# INLINE happyIn32 #-} -happyOut32 :: (HappyAbsSyn ) -> ([Case]) -happyOut32 x = unsafeCoerce# x -{-# INLINE happyOut32 #-} -happyIn33 :: (Bind) -> (HappyAbsSyn ) -happyIn33 x = unsafeCoerce# x -{-# INLINE happyIn33 #-} -happyOut33 :: (HappyAbsSyn ) -> (Bind) -happyOut33 x = unsafeCoerce# x -{-# INLINE happyOut33 #-} -happyIn34 :: ([Bind]) -> (HappyAbsSyn ) -happyIn34 x = unsafeCoerce# x -{-# INLINE happyIn34 #-} -happyOut34 :: (HappyAbsSyn ) -> ([Bind]) -happyOut34 x = unsafeCoerce# x -{-# INLINE happyOut34 #-} -happyIn35 :: (Exp) -> (HappyAbsSyn ) -happyIn35 x = unsafeCoerce# x -{-# INLINE happyIn35 #-} -happyOut35 :: (HappyAbsSyn ) -> (Exp) -happyOut35 x = unsafeCoerce# x -{-# INLINE happyOut35 #-} -happyIn36 :: (Exp) -> (HappyAbsSyn ) -happyIn36 x = unsafeCoerce# x -{-# INLINE happyIn36 #-} -happyOut36 :: (HappyAbsSyn ) -> (Exp) -happyOut36 x = unsafeCoerce# x -{-# INLINE happyOut36 #-} -happyIn37 :: (Exp) -> (HappyAbsSyn ) -happyIn37 x = unsafeCoerce# x -{-# INLINE happyIn37 #-} -happyOut37 :: (HappyAbsSyn ) -> (Exp) -happyOut37 x = unsafeCoerce# x -{-# INLINE happyOut37 #-} -happyIn38 :: (Exp) -> (HappyAbsSyn ) -happyIn38 x = unsafeCoerce# x -{-# INLINE happyIn38 #-} -happyOut38 :: (HappyAbsSyn ) -> (Exp) -happyOut38 x = unsafeCoerce# x -{-# INLINE happyOut38 #-} -happyIn39 :: (Exp) -> (HappyAbsSyn ) -happyIn39 x = unsafeCoerce# x -{-# INLINE happyIn39 #-} -happyOut39 :: (HappyAbsSyn ) -> (Exp) -happyOut39 x = unsafeCoerce# x -{-# INLINE happyOut39 #-} -happyIn40 :: (Exp) -> (HappyAbsSyn ) -happyIn40 x = unsafeCoerce# x -{-# INLINE happyIn40 #-} -happyOut40 :: (HappyAbsSyn ) -> (Exp) -happyOut40 x = unsafeCoerce# x -{-# INLINE happyOut40 #-} -happyIn41 :: (Exp) -> (HappyAbsSyn ) -happyIn41 x = unsafeCoerce# x -{-# INLINE happyIn41 #-} -happyOut41 :: (HappyAbsSyn ) -> (Exp) -happyOut41 x = unsafeCoerce# x -{-# INLINE happyOut41 #-} -happyIn42 :: (Exp) -> (HappyAbsSyn ) -happyIn42 x = unsafeCoerce# x -{-# INLINE happyIn42 #-} -happyOut42 :: (HappyAbsSyn ) -> (Exp) -happyOut42 x = unsafeCoerce# x -{-# INLINE happyOut42 #-} -happyIn43 :: (Exp) -> (HappyAbsSyn ) -happyIn43 x = unsafeCoerce# x -{-# INLINE happyIn43 #-} -happyOut43 :: (HappyAbsSyn ) -> (Exp) -happyOut43 x = unsafeCoerce# x -{-# INLINE happyOut43 #-} -happyIn44 :: (Exp) -> (HappyAbsSyn ) -happyIn44 x = unsafeCoerce# x -{-# INLINE happyIn44 #-} -happyOut44 :: (HappyAbsSyn ) -> (Exp) -happyOut44 x = unsafeCoerce# x -{-# INLINE happyOut44 #-} -happyIn45 :: (Exp) -> (HappyAbsSyn ) -happyIn45 x = unsafeCoerce# x -{-# INLINE happyIn45 #-} -happyOut45 :: (HappyAbsSyn ) -> (Exp) -happyOut45 x = unsafeCoerce# x -{-# INLINE happyOut45 #-} -happyIn46 :: (FieldType) -> (HappyAbsSyn ) -happyIn46 x = unsafeCoerce# x -{-# INLINE happyIn46 #-} -happyOut46 :: (HappyAbsSyn ) -> (FieldType) -happyOut46 x = unsafeCoerce# x -{-# INLINE happyOut46 #-} -happyIn47 :: ([FieldType]) -> (HappyAbsSyn ) -happyIn47 x = unsafeCoerce# x -{-# INLINE happyIn47 #-} -happyOut47 :: (HappyAbsSyn ) -> ([FieldType]) -happyOut47 x = unsafeCoerce# x -{-# INLINE happyOut47 #-} -happyIn48 :: (FieldValue) -> (HappyAbsSyn ) -happyIn48 x = unsafeCoerce# x -{-# INLINE happyIn48 #-} -happyOut48 :: (HappyAbsSyn ) -> (FieldValue) -happyOut48 x = unsafeCoerce# x -{-# INLINE happyOut48 #-} -happyIn49 :: ([FieldValue]) -> (HappyAbsSyn ) -happyIn49 x = unsafeCoerce# x -{-# INLINE happyIn49 #-} -happyOut49 :: (HappyAbsSyn ) -> ([FieldValue]) -happyOut49 x = unsafeCoerce# x -{-# INLINE happyOut49 #-} -happyIn50 :: (Exp) -> (HappyAbsSyn ) -happyIn50 x = unsafeCoerce# x -{-# INLINE happyIn50 #-} -happyOut50 :: (HappyAbsSyn ) -> (Exp) -happyOut50 x = unsafeCoerce# x -{-# INLINE happyOut50 #-} -happyIn51 :: ([Exp]) -> (HappyAbsSyn ) -happyIn51 x = unsafeCoerce# x -{-# INLINE happyIn51 #-} -happyOut51 :: (HappyAbsSyn ) -> ([Exp]) -happyOut51 x = unsafeCoerce# x -{-# INLINE happyOut51 #-} -happyInTok :: Token -> (HappyAbsSyn ) -happyInTok x = unsafeCoerce# x -{-# INLINE happyInTok #-} -happyOutTok :: (HappyAbsSyn ) -> Token -happyOutTok x = unsafeCoerce# x -{-# INLINE happyOutTok #-} - -happyActOffsets :: HappyAddr -happyActOffsets = HappyA# "\x00\x00\x48\x03\x90\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x84\x01\xa8\x01\x34\x00\x00\x00\xaf\x01\xa1\x01\x6c\x00\x9f\x00\xb6\x00\x00\x00\x64\x03\x7d\x01\x00\x00\x00\x00\xd4\x02\xb8\x02\xf9\xff\x50\x03\x00\x00\x00\x00\x48\x03\xb1\x01\x48\x03\xa5\x01\xa0\x01\x9e\x01\x00\x00\x00\x00\x00\x00\x68\x01\x73\x01\x9a\x01\x7d\x00\x5e\x01\x5e\x01\x5e\x01\x5e\x01\x5b\x01\x00\x00\x5c\x01\x00\x00\x48\x03\x00\x00\x75\x01\x00\x00\x78\x01\x77\x01\x00\x00\x03\x00\x41\x00\x80\x01\x45\x01\x51\x01\x50\x03\x50\x03\x50\x03\x50\x03\x50\x03\x50\x03\x50\x03\x50\x03\x50\x03\x50\x03\x50\x03\x50\x03\x50\x03\x50\x03\x50\x03\x50\x03\x48\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb6\x00\xb6\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x48\x03\x00\x00\x48\x03\x00\x00\x48\x03\x34\x03\x6c\x01\xa4\x02\x18\x03\x67\x01\x6a\x01\x66\x01\x58\x01\x57\x01\x65\x01\x54\x01\x52\x01\x4e\x01\x00\x00\x4f\x01\x3e\x01\x1f\x01\x1f\x01\x00\x00\x1f\x01\x3b\x01\x00\x00\x8c\x02\x18\x03\x00\x00\x13\x01\x18\x03\x00\x00\x13\x01\x18\x03\x10\x01\x08\x01\x18\x03\x04\x01\x34\x01\x26\x01\x20\x01\x85\x03\x00\x00\x00\x00\x1c\x01\x1a\x01\x11\x01\x00\x00\x85\x03\x00\x00\x00\x00\x19\x01\x17\x01\x0a\x01\x00\x00\x0c\x01\x07\x01\x85\x03\x7e\x03\x00\x00\x05\x01\x00\x00\x18\x03\x00\x00\x04\x03\x00\x00\x00\x00\x04\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x01\x00\x00\x04\x03\xe8\x02\x00\x00\xd6\x00\x00\x00\xe8\x02\x00\x00\x00\x00\x00\x00\xd4\x00\x00\x00\xec\x00\xe6\x00\x00\x00\xea\x00\xe2\x00\x00\x00\x85\x03\x85\x03\x85\x03\xde\x00\x00\x00\xe8\x02\x00\x00\x85\x03\xe8\x02\x00\x00\x00\x00\x00\x00\x85\x03\x00\x00\x00\x00\x85\x03\xe9\x00\xdf\x00\xe8\x00\x00\x00\xd8\x00\xa8\x00\x00\x00\xa8\x00\x85\x03\x00\x00\xcc\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc5\x00\xbb\x00\xa5\x00\x00\x00\x8c\x00\xe8\x02\x00\x00\x00\x00\x00\x00"# - -happyGotoOffsets :: HappyAddr -happyGotoOffsets = HappyA# "\xbc\x00\x21\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6b\x04\x00\x00\x00\x00\x00\x00\x78\x00\x35\x00\x17\x00\x67\x04\x00\x00\x00\x00\x08\x02\x00\x00\xef\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0d\x00\x00\x00\x0a\x00\x95\x00\x60\x00\x19\x00\x67\x00\x00\x00\x6f\x00\x00\x00\x00\x00\xd6\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x8b\x00\x00\x00\x63\x04\x5f\x04\x5b\x04\x29\x04\x57\x04\x52\x04\x22\x04\x1b\x04\x14\x04\x0d\x04\xe4\x03\xdd\x03\xd6\x03\xcd\x03\xa4\x03\x9a\x03\xbd\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\x00\x00\x00\x00\x00\x00\x00\x00\xa4\x01\x00\x00\x1b\x00\x00\x00\x01\x00\x81\x02\x00\x00\x4f\x00\x8b\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5a\x00\x00\x00\x61\x00\x4d\x00\x00\x00\x0e\x00\x00\x00\x00\x00\xe5\x04\x72\x01\x00\x00\x5e\x00\x59\x01\x00\x00\x08\x00\x40\x01\x00\x00\x13\x00\x27\x01\x00\x00\x00\x00\x00\x00\x00\x00\x98\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x9b\x02\x00\x00\x00\x00\x26\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xcc\x04\xba\x04\x00\x00\x00\x00\x00\x00\x0e\x01\x00\x00\x69\x02\x00\x00\x00\x00\x51\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x39\x02\xf5\x00\x00\x00\x00\x00\x00\x00\xdc\x00\x00\x00\x00\x00\x00\x00\x90\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x94\x04\x9f\x03\xd5\x04\x00\x00\xf7\xff\xc3\x00\x00\x00\x0b\x00\xaa\x00\x00\x00\x00\x00\x00\x00\xb4\x04\x00\x00\x00\x00\x9c\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5f\x00\x00\x00\x6a\x00\xd1\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x06\x00\x91\x00\x00\x00\x00\x00\x00\x00"# - -happyDefActions :: HappyAddr -happyDefActions = HappyA# "\xf7\xff\x00\x00\x00\x00\xfd\xff\x98\xff\x96\xff\x95\xff\x94\xff\x00\x00\xcf\xff\x89\xff\xb8\xff\xb6\xff\xb4\xff\xad\xff\xab\xff\xa8\xff\xa4\xff\xa2\xff\xa0\xff\x9e\xff\xc7\xff\x00\x00\x00\x00\x00\x00\x00\x00\x93\xff\x97\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfc\xff\xfb\xff\xfa\xff\x00\x00\xf1\xff\x00\x00\xf9\xff\x00\x00\x90\xff\x8c\xff\xc5\xff\x00\x00\xbc\xff\x00\x00\xa3\xff\x00\x00\xce\xff\x00\x00\xcd\xff\x88\xff\x00\x00\x9b\xff\x98\xff\x00\x00\x00\x00\x00\x00\xa1\xff\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\xd0\xff\xb9\xff\xba\xff\xb7\xff\xb5\xff\xae\xff\xaf\xff\xb0\xff\xb1\xff\xb2\xff\xb3\xff\xa9\xff\xaa\xff\xac\xff\xa5\xff\xa6\xff\xa7\xff\x9f\xff\x00\x00\x92\xff\x00\x00\x9a\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc4\xff\x00\x00\x00\x00\x8b\xff\x00\x00\x00\x00\x8f\xff\x00\x00\xf8\xff\xd7\xff\x00\x00\x00\x00\x00\x00\xf6\xff\x00\x00\x00\x00\xf0\xff\xea\xff\x00\x00\x9d\xff\x90\xff\x00\x00\x9c\xff\x8c\xff\x00\x00\x00\x00\xc5\xff\x00\x00\x00\x00\xbd\xff\x00\x00\x00\x00\xc1\xff\xcc\xff\x87\xff\x00\x00\x00\x00\x00\x00\x99\xff\xdd\xff\xdf\xff\xde\xff\xea\xff\xe8\xff\xe6\xff\xe4\xff\xc0\xff\x00\x00\x00\x00\x00\x00\xdc\xff\x00\x00\xbb\xff\x00\x00\xc8\xff\x00\x00\xc6\xff\xc3\xff\x00\x00\x8d\xff\x8a\xff\x91\xff\x8e\xff\xf4\xff\xdd\xff\x00\x00\xd6\xff\x00\x00\x00\x00\xf2\xff\x00\x00\xeb\xff\x00\x00\xcb\xff\xc9\xff\xbe\xff\xd4\xff\xda\xff\xd9\xff\x00\x00\xe2\xff\xda\xff\x00\x00\xca\xff\xc1\xff\x00\x00\x00\x00\x00\x00\xd7\xff\x00\x00\xd1\xff\xe5\xff\x00\x00\xe9\xff\xe7\xff\xbf\xff\x00\x00\xdb\xff\xe1\xff\x00\x00\x00\x00\xd3\xff\x00\x00\xf3\xff\x00\x00\xee\xff\xe3\xff\xd4\xff\x00\x00\xd8\xff\x00\x00\xc2\xff\xe0\xff\xd5\xff\xd2\xff\x00\x00\xed\xff\x00\x00\xf5\xff\xee\xff\x00\x00\xef\xff\xec\xff"# - -happyCheck :: HappyAddr -happyCheck = HappyA# "\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\x02\x00\x00\x00\x0e\x00\x00\x00\x12\x00\x00\x00\x00\x00\x01\x00\x02\x00\x00\x00\x09\x00\x0a\x00\x07\x00\x05\x00\x00\x00\x11\x00\x08\x00\x15\x00\x00\x00\x17\x00\x00\x00\x0f\x00\x00\x00\x01\x00\x02\x00\x03\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x31\x00\x18\x00\x19\x00\x16\x00\x2d\x00\x2e\x00\x15\x00\x0b\x00\x17\x00\x2b\x00\x2c\x00\x00\x00\x01\x00\x02\x00\x03\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x2b\x00\x2c\x00\x12\x00\x13\x00\x2d\x00\x2e\x00\x15\x00\x0a\x00\x17\x00\x00\x00\x0d\x00\x00\x00\x01\x00\x02\x00\x03\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2d\x00\x2e\x00\x15\x00\x16\x00\x17\x00\x00\x00\x09\x00\x0a\x00\x00\x00\x1c\x00\x12\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x00\x00\x01\x00\x02\x00\x03\x00\x2d\x00\x13\x00\x14\x00\x18\x00\x19\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x29\x00\x2a\x00\x29\x00\x2a\x00\x00\x00\x1d\x00\x15\x00\x16\x00\x17\x00\x00\x00\x00\x00\x01\x00\x02\x00\x03\x00\x00\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x24\x00\x25\x00\x13\x00\x14\x00\x2d\x00\x15\x00\x08\x00\x17\x00\x04\x00\x00\x00\x01\x00\x02\x00\x03\x00\x31\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x1b\x00\x1c\x00\x01\x00\x31\x00\x2d\x00\x15\x00\x04\x00\x17\x00\x06\x00\x00\x00\x01\x00\x02\x00\x03\x00\x02\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x1d\x00\x1e\x00\x1f\x00\x0a\x00\x2d\x00\x15\x00\x31\x00\x17\x00\x03\x00\x00\x00\x01\x00\x02\x00\x03\x00\x01\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x04\x00\x0f\x00\x05\x00\x0d\x00\x2d\x00\x15\x00\x0c\x00\x17\x00\x0a\x00\x00\x00\x01\x00\x02\x00\x03\x00\x0d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x31\x00\x30\x00\x05\x00\x03\x00\x2d\x00\x15\x00\x04\x00\x17\x00\x01\x00\x00\x00\x01\x00\x02\x00\x03\x00\x08\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x07\x00\x06\x00\x0f\x00\x01\x00\x2d\x00\x15\x00\x0a\x00\x17\x00\x0a\x00\x00\x00\x01\x00\x02\x00\x03\x00\x27\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x11\x00\x04\x00\x31\x00\x2a\x00\x2d\x00\x15\x00\x02\x00\x17\x00\x01\x00\x00\x00\x01\x00\x02\x00\x03\x00\x31\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x31\x00\x02\x00\x04\x00\x01\x00\x2d\x00\x15\x00\x02\x00\x17\x00\x01\x00\x00\x00\x01\x00\x02\x00\x03\x00\x05\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x04\x00\x04\x00\x01\x00\x05\x00\x2d\x00\x15\x00\x03\x00\x17\x00\x20\x00\x00\x00\x01\x00\x02\x00\x03\x00\x31\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x02\x00\x0c\x00\x0f\x00\x0d\x00\x2d\x00\x15\x00\x2c\x00\x17\x00\x2f\x00\x00\x00\x01\x00\x02\x00\x03\x00\x31\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x01\x00\x29\x00\x20\x00\x36\x00\x2d\x00\x15\x00\x03\x00\x17\x00\x03\x00\x00\x00\x01\x00\x02\x00\x03\x00\x03\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x03\x00\x14\x00\x07\x00\x0f\x00\x2d\x00\x15\x00\x36\x00\x17\x00\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\x31\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\xff\xff\xff\xff\xff\xff\xff\xff\x2d\x00\x15\x00\xff\xff\x17\x00\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\xff\xff\xff\xff\xff\xff\xff\xff\x2d\x00\x15\x00\xff\xff\x17\x00\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\xff\xff\xff\xff\xff\xff\xff\xff\x2d\x00\x15\x00\xff\xff\x17\x00\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\xff\xff\xff\xff\xff\xff\xff\xff\x2d\x00\x15\x00\xff\xff\x17\x00\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\xff\xff\xff\xff\xff\xff\xff\xff\x2d\x00\x15\x00\xff\xff\x17\x00\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\xff\xff\xff\xff\xff\xff\xff\xff\x2d\x00\xff\xff\x17\x00\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\xff\xff\xff\xff\xff\xff\xff\xff\x2d\x00\xff\xff\x17\x00\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\xff\xff\xff\xff\xff\xff\xff\xff\x2d\x00\xff\xff\x17\x00\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x06\x00\xff\xff\xff\xff\x09\x00\x2d\x00\x0b\x00\x17\x00\xff\xff\x0e\x00\x00\x00\x01\x00\x02\x00\xff\xff\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x0f\x00\xff\xff\xff\xff\x09\x00\x2d\x00\x0b\x00\xff\xff\xff\xff\x0e\x00\xff\xff\x10\x00\xff\xff\xff\xff\xff\xff\xff\xff\x2d\x00\xff\xff\xff\xff\xff\xff\x31\x00\x32\x00\x33\x00\x1c\x00\x09\x00\xff\xff\x0b\x00\x0c\x00\x21\x00\x22\x00\x23\x00\x10\x00\xff\xff\x26\x00\xff\xff\x28\x00\xff\xff\xff\xff\x2b\x00\xff\xff\x2d\x00\x2e\x00\xff\xff\x1c\x00\x31\x00\x32\x00\x33\x00\x34\x00\x21\x00\x22\x00\x23\x00\xff\xff\x09\x00\x26\x00\x0b\x00\x28\x00\xff\xff\x0e\x00\x2b\x00\x10\x00\x2d\x00\x2e\x00\xff\xff\xff\xff\x31\x00\x32\x00\x33\x00\x34\x00\xff\xff\xff\xff\xff\xff\x1c\x00\x09\x00\xff\xff\x0b\x00\xff\xff\x21\x00\x22\x00\x23\x00\x10\x00\xff\xff\x26\x00\xff\xff\x28\x00\xff\xff\xff\xff\x2b\x00\xff\xff\x2d\x00\x2e\x00\xff\xff\x1c\x00\x31\x00\x32\x00\x33\x00\x34\x00\x21\x00\x22\x00\x23\x00\xff\xff\x09\x00\x26\x00\x0b\x00\x28\x00\xff\xff\xff\xff\x2b\x00\x10\x00\x2d\x00\x2e\x00\xff\xff\xff\xff\x31\x00\x32\x00\x33\x00\x34\x00\xff\xff\xff\xff\xff\xff\x1c\x00\x09\x00\xff\xff\x0b\x00\xff\xff\x21\x00\x22\x00\x23\x00\x10\x00\xff\xff\x26\x00\xff\xff\x28\x00\xff\xff\xff\xff\x2b\x00\xff\xff\x2d\x00\x2e\x00\xff\xff\x1c\x00\x31\x00\x32\x00\x33\x00\x34\x00\x21\x00\x22\x00\x23\x00\xff\xff\x09\x00\x26\x00\x0b\x00\x28\x00\xff\xff\xff\xff\x2b\x00\x10\x00\x2d\x00\x2e\x00\xff\xff\xff\xff\x31\x00\x32\x00\x33\x00\x34\x00\xff\xff\xff\xff\xff\xff\x1c\x00\x09\x00\xff\xff\x0b\x00\xff\xff\x21\x00\x22\x00\x23\x00\x10\x00\x09\x00\x26\x00\x0b\x00\x28\x00\xff\xff\xff\xff\x2b\x00\xff\xff\x2d\x00\x2e\x00\xff\xff\x1c\x00\x31\x00\x32\x00\x33\x00\x34\x00\x21\x00\x22\x00\x23\x00\x1c\x00\x09\x00\x26\x00\x0b\x00\x28\x00\x21\x00\x22\x00\x2b\x00\xff\xff\x2d\x00\x2e\x00\xff\xff\xff\xff\x31\x00\x32\x00\x33\x00\x34\x00\x2d\x00\x2e\x00\xff\xff\xff\xff\x31\x00\x32\x00\x33\x00\x34\x00\x21\x00\x22\x00\x09\x00\xff\xff\x0b\x00\x0c\x00\xff\xff\x0e\x00\xff\xff\x09\x00\xff\xff\x0b\x00\x2d\x00\x2e\x00\x0e\x00\xff\xff\x31\x00\x32\x00\x33\x00\x34\x00\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\x00\x00\x01\x00\x02\x00\xff\xff\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\x2d\x00\x0d\x00\x0e\x00\x0f\x00\x31\x00\x32\x00\x33\x00\x2d\x00\xff\xff\xff\xff\xff\xff\x31\x00\x32\x00\x33\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\xff\xff\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\x00\x00\x01\x00\x02\x00\x03\x00\x00\x00\x01\x00\x02\x00\x03\x00\x00\x00\x01\x00\x02\x00\x03\x00\x00\x00\x01\x00\x02\x00\x03\x00\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x25\x00\x26\x00\x27\x00\x28\x00\x25\x00\x26\x00\x27\x00\x28\x00\x25\x00\x26\x00\x27\x00\x28\x00\x25\x00\x26\x00\x27\x00\x28\x00\xff\xff\xff\xff\x27\x00\x28\x00\x00\x00\x01\x00\x02\x00\xff\xff\x00\x00\x01\x00\x02\x00\xff\xff\x00\x00\x01\x00\x02\x00\xff\xff\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x1a\x00\x1b\x00\xff\xff\xff\xff\x1a\x00\x1b\x00\x00\x00\x01\x00\x02\x00\xff\xff\xff\xff\xff\xff\x00\x00\x01\x00\x02\x00\xff\xff\xff\xff\xff\xff\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x00\x00\x01\x00\x02\x00\xff\xff\xff\xff\x00\x00\x01\x00\x02\x00\xff\xff\x00\x00\x01\x00\x02\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x00\x00\x01\x00\x02\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x0b\x00\xff\xff\xff\xff\xff\xff\x0f\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\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\xff\xff\xff\xff\xff\xff"# - -happyTable :: HappyAddr -happyTable = HappyA# "\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\xce\xff\xdd\x00\x35\x00\x6c\x00\xc5\x00\x73\x00\xaa\x00\x92\x00\x93\x00\xaf\x00\xde\x00\xe4\x00\x74\x00\x27\x00\x69\x00\xce\xff\x28\x00\x35\x00\x32\x00\x09\x00\x6c\x00\xac\x00\x04\x00\x05\x00\x06\x00\x07\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x04\x00\x6a\x00\xa3\x00\x33\x00\x15\x00\x8c\x00\x35\x00\xc1\x00\x09\x00\x6d\x00\xa6\x00\x04\x00\x05\x00\x06\x00\x07\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x6d\x00\x6e\x00\x4c\x00\x4d\x00\x15\x00\x8d\x00\x35\x00\x62\x00\x09\x00\x78\x00\x63\x00\x38\x00\x05\x00\x06\x00\x07\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x6f\x00\xdd\x00\x6f\x00\x79\x00\x15\x00\x36\x00\x87\x00\x88\x00\x09\x00\x69\x00\xde\x00\xdf\x00\xce\x00\x89\x00\x7b\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x38\x00\x05\x00\x06\x00\x07\x00\x15\x00\xcf\x00\xdc\x00\x6a\x00\x6b\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x49\x00\x70\x00\xa8\x00\x70\x00\x71\x00\x5f\x00\x67\x00\x39\x00\x3a\x00\x09\x00\xce\x00\x04\x00\x05\x00\x06\x00\x07\x00\x72\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x76\x00\x77\x00\xcf\x00\xd0\x00\x15\x00\xe3\x00\x41\x00\x09\x00\xe1\x00\x04\x00\x05\x00\x06\x00\x07\x00\x04\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x42\x00\x43\x00\xe2\x00\x04\x00\x15\x00\xd9\x00\x25\x00\x09\x00\x26\x00\x04\x00\x05\x00\x06\x00\x07\x00\xe3\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x3e\x00\x3f\x00\x40\x00\xdb\x00\x15\x00\xc4\x00\x04\x00\x09\x00\xd4\x00\x04\x00\x05\x00\x06\x00\x07\x00\xd6\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\xd5\x00\xc7\x00\xd7\x00\xcb\x00\x15\x00\xd1\x00\xcd\x00\x09\x00\xcc\x00\x04\x00\x05\x00\x06\x00\x07\x00\xce\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x04\x00\xd3\x00\xb3\x00\xb7\x00\x15\x00\xb0\x00\xbe\x00\x09\x00\xbf\x00\x04\x00\x05\x00\x06\x00\x07\x00\xc0\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\xc1\x00\xae\x00\xc4\x00\x9f\x00\x15\x00\xb5\x00\x90\x00\x09\x00\x91\x00\x04\x00\x05\x00\x06\x00\x07\x00\xa2\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\xa0\x00\xa1\x00\x04\x00\xa5\x00\x15\x00\xa2\x00\xaf\x00\x09\x00\x7b\x00\x04\x00\x05\x00\x06\x00\x07\x00\x04\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x04\x00\x7d\x00\x7e\x00\x7f\x00\x15\x00\xa5\x00\x80\x00\x09\x00\x82\x00\x04\x00\x05\x00\x06\x00\x07\x00\x83\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x81\x00\x84\x00\x85\x00\x86\x00\x15\x00\xa7\x00\x8b\x00\x09\x00\x3c\x00\x04\x00\x05\x00\x06\x00\x07\x00\x04\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x61\x00\x64\x00\x66\x00\x65\x00\x15\x00\xa9\x00\x67\x00\x09\x00\x69\x00\x04\x00\x05\x00\x06\x00\x07\x00\x04\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x78\x00\x2a\x00\x3c\x00\xff\xff\x15\x00\x86\x00\x2b\x00\x09\x00\x2c\x00\x04\x00\x05\x00\x06\x00\x07\x00\x2d\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x2f\x00\x4a\x00\x4b\x00\x4e\x00\x15\x00\x8e\x00\xff\xff\x09\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x04\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x15\x00\x4e\x00\x00\x00\x09\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x15\x00\x39\x00\x00\x00\x09\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x15\x00\x2d\x00\x00\x00\x09\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x15\x00\x2f\x00\x00\x00\x09\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x15\x00\x08\x00\x00\x00\x09\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x00\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x15\x00\x00\x00\xb1\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x00\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x15\x00\x00\x00\xb3\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x00\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x15\x00\x00\x00\xb4\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x00\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\xae\x00\x00\x00\x00\x00\x9b\x00\x15\x00\x9c\x00\x8b\x00\x00\x00\x9d\x00\xaa\x00\x92\x00\x93\x00\x00\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\xc2\x00\x00\x00\x00\x00\x17\x00\x15\x00\x18\x00\x00\x00\x00\x00\x35\x00\x00\x00\x19\x00\x00\x00\x00\x00\x00\x00\x00\x00\x9e\x00\x00\x00\x00\x00\x00\x00\x04\x00\x23\x00\x24\x00\x1a\x00\x17\x00\x00\x00\x18\x00\x38\x00\x1b\x00\x1c\x00\x1d\x00\x19\x00\x00\x00\x1e\x00\x00\x00\x1f\x00\x00\x00\x00\x00\x20\x00\x00\x00\x21\x00\x22\x00\x00\x00\x1a\x00\x04\x00\x23\x00\x24\x00\x25\x00\x1b\x00\x1c\x00\x1d\x00\x00\x00\x17\x00\x1e\x00\x18\x00\x1f\x00\x00\x00\x35\x00\x20\x00\x19\x00\x21\x00\x22\x00\x00\x00\x00\x00\x04\x00\x23\x00\x24\x00\x25\x00\x00\x00\x00\x00\x00\x00\x1a\x00\x17\x00\x00\x00\x18\x00\x00\x00\x1b\x00\x1c\x00\x1d\x00\x19\x00\x00\x00\x1e\x00\x00\x00\x1f\x00\x00\x00\x00\x00\x20\x00\x00\x00\x21\x00\x22\x00\x00\x00\x1a\x00\x04\x00\x23\x00\x24\x00\x25\x00\x1b\x00\x1c\x00\x1d\x00\x00\x00\x32\x00\x1e\x00\x18\x00\x1f\x00\x00\x00\x00\x00\x20\x00\x19\x00\x21\x00\x22\x00\x00\x00\x00\x00\x04\x00\x23\x00\x24\x00\x25\x00\x00\x00\x00\x00\x00\x00\x1a\x00\x17\x00\x00\x00\x18\x00\x00\x00\x1b\x00\x1c\x00\x1d\x00\x19\x00\x00\x00\x1e\x00\x00\x00\x1f\x00\x00\x00\x00\x00\x20\x00\x00\x00\x21\x00\x22\x00\x00\x00\x1a\x00\x04\x00\x23\x00\x24\x00\x25\x00\x1b\x00\x1c\x00\x1d\x00\x00\x00\x32\x00\x1e\x00\x18\x00\x1f\x00\x00\x00\x00\x00\x20\x00\x19\x00\x21\x00\x22\x00\x00\x00\x00\x00\x04\x00\x23\x00\x24\x00\x25\x00\x00\x00\x00\x00\x00\x00\x1a\x00\x17\x00\x00\x00\x18\x00\x00\x00\x1b\x00\x1c\x00\x1d\x00\x19\x00\x32\x00\x1e\x00\x18\x00\x1f\x00\x00\x00\x00\x00\x20\x00\x00\x00\x21\x00\x22\x00\x00\x00\x1a\x00\x04\x00\x23\x00\x24\x00\x25\x00\x1b\x00\x1c\x00\x1d\x00\x1a\x00\x32\x00\x1e\x00\x18\x00\x1f\x00\x1b\x00\x1c\x00\x20\x00\x00\x00\x21\x00\x22\x00\x00\x00\x00\x00\x04\x00\x23\x00\x24\x00\x25\x00\x21\x00\x22\x00\x00\x00\x00\x00\x04\x00\x23\x00\x24\x00\x25\x00\x1b\x00\x1c\x00\x9b\x00\x00\x00\x9c\x00\xbb\x00\x00\x00\x9d\x00\x00\x00\x9b\x00\x00\x00\x9c\x00\x21\x00\x22\x00\x9d\x00\x00\x00\x04\x00\x23\x00\x24\x00\x25\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x91\x00\x92\x00\x93\x00\x00\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x00\x00\x00\x00\x9e\x00\xc8\x00\x96\x00\x97\x00\x04\x00\x23\x00\x24\x00\x9e\x00\x00\x00\x00\x00\x00\x00\x04\x00\x23\x00\x24\x00\x4f\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x50\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x00\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x00\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x51\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x52\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x53\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x54\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x00\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x00\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x00\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x00\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x00\x00\x55\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x56\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x57\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x58\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x5b\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x04\x00\x05\x00\x06\x00\x07\x00\x04\x00\x05\x00\x06\x00\x07\x00\x04\x00\x05\x00\x06\x00\x07\x00\x04\x00\x05\x00\x06\x00\x07\x00\x04\x00\x05\x00\x06\x00\x07\x00\x04\x00\x05\x00\x06\x00\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x59\x00\x11\x00\x12\x00\x13\x00\x14\x00\x5a\x00\x11\x00\x12\x00\x13\x00\x14\x00\x5c\x00\x12\x00\x13\x00\x14\x00\x5d\x00\x12\x00\x13\x00\x14\x00\x5e\x00\x12\x00\x13\x00\x14\x00\x30\x00\x12\x00\x13\x00\x14\x00\x00\x00\x00\x00\x3c\x00\x14\x00\x91\x00\x92\x00\x93\x00\x00\x00\x91\x00\x92\x00\x93\x00\x00\x00\x91\x00\x92\x00\x93\x00\x00\x00\x94\x00\x95\x00\x96\x00\x97\x00\x94\x00\x95\x00\x96\x00\x97\x00\xb7\x00\x95\x00\x96\x00\x97\x00\xb8\x00\xd7\x00\x98\x00\xc9\x00\x00\x00\x00\x00\x98\x00\x99\x00\x91\x00\x92\x00\x93\x00\x00\x00\x00\x00\x00\x00\x91\x00\x92\x00\x93\x00\x00\x00\x00\x00\x00\x00\xb7\x00\x95\x00\x96\x00\x97\x00\xb8\x00\xd8\x00\xb7\x00\x95\x00\x96\x00\x97\x00\xb8\x00\xb9\x00\x91\x00\x92\x00\x93\x00\x00\x00\x00\x00\x91\x00\x92\x00\x93\x00\x00\x00\x91\x00\x92\x00\x93\x00\xbb\x00\x95\x00\x96\x00\x97\x00\xbc\x00\xdb\x00\x95\x00\x96\x00\x97\x00\xc7\x00\x95\x00\x96\x00\x97\x00\xaa\x00\x92\x00\x93\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xab\x00\x00\x00\x00\x00\x00\x00\xac\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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 (2, 120) [ - (2 , happyReduce_2), - (3 , happyReduce_3), - (4 , happyReduce_4), - (5 , happyReduce_5), - (6 , happyReduce_6), - (7 , happyReduce_7), - (8 , happyReduce_8), - (9 , happyReduce_9), - (10 , happyReduce_10), - (11 , happyReduce_11), - (12 , happyReduce_12), - (13 , happyReduce_13), - (14 , happyReduce_14), - (15 , happyReduce_15), - (16 , happyReduce_16), - (17 , happyReduce_17), - (18 , happyReduce_18), - (19 , happyReduce_19), - (20 , happyReduce_20), - (21 , happyReduce_21), - (22 , happyReduce_22), - (23 , happyReduce_23), - (24 , happyReduce_24), - (25 , happyReduce_25), - (26 , happyReduce_26), - (27 , happyReduce_27), - (28 , happyReduce_28), - (29 , happyReduce_29), - (30 , happyReduce_30), - (31 , happyReduce_31), - (32 , happyReduce_32), - (33 , happyReduce_33), - (34 , happyReduce_34), - (35 , happyReduce_35), - (36 , happyReduce_36), - (37 , happyReduce_37), - (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) - ] - -happy_n_terms = 55 :: Int -happy_n_nonterms = 47 :: Int - -happyReduce_2 = happySpecReduce_1 0# happyReduction_2 -happyReduction_2 happy_x_1 - = case happyOutTok happy_x_1 of { (PT _ (TV happy_var_1)) -> - happyIn5 - (Ident happy_var_1 - )} - -happyReduce_3 = happySpecReduce_1 1# happyReduction_3 -happyReduction_3 happy_x_1 - = case happyOutTok happy_x_1 of { (PT _ (TL happy_var_1)) -> - happyIn6 - (happy_var_1 - )} - -happyReduce_4 = happySpecReduce_1 2# happyReduction_4 -happyReduction_4 happy_x_1 - = case happyOutTok happy_x_1 of { (PT _ (TI happy_var_1)) -> - happyIn7 - ((read happy_var_1) :: Integer - )} - -happyReduce_5 = happySpecReduce_1 3# happyReduction_5 -happyReduction_5 happy_x_1 - = case happyOutTok happy_x_1 of { (PT _ (TD happy_var_1)) -> - happyIn8 - ((read happy_var_1) :: Double - )} - -happyReduce_6 = happySpecReduce_2 4# happyReduction_6 -happyReduction_6 happy_x_2 - happy_x_1 - = case happyOut11 happy_x_1 of { happy_var_1 -> - case happyOut13 happy_x_2 of { happy_var_2 -> - happyIn9 - (Module (reverse happy_var_1) (reverse happy_var_2) - )}} - -happyReduce_7 = happySpecReduce_2 5# happyReduction_7 -happyReduction_7 happy_x_2 - happy_x_1 - = case happyOut5 happy_x_2 of { happy_var_2 -> - happyIn10 - (Import happy_var_2 - )} - -happyReduce_8 = happySpecReduce_0 6# happyReduction_8 -happyReduction_8 = happyIn11 - ([] - ) - -happyReduce_9 = happySpecReduce_3 6# happyReduction_9 -happyReduction_9 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut11 happy_x_1 of { happy_var_1 -> - case happyOut10 happy_x_2 of { happy_var_2 -> - happyIn11 - (flip (:) happy_var_1 happy_var_2 - )}} - -happyReduce_10 = happyReduce 8# 7# happyReduction_10 -happyReduction_10 (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 happyOut5 happy_x_2 of { happy_var_2 -> - case happyOut26 happy_x_4 of { happy_var_4 -> - case happyOut15 happy_x_7 of { happy_var_7 -> - happyIn12 - (DataDecl happy_var_2 happy_var_4 happy_var_7 - ) `HappyStk` happyRest}}} - -happyReduce_11 = happySpecReduce_3 7# happyReduction_11 -happyReduction_11 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut5 happy_x_1 of { happy_var_1 -> - case happyOut26 happy_x_3 of { happy_var_3 -> - happyIn12 - (TypeDecl happy_var_1 happy_var_3 - )}} - -happyReduce_12 = happyReduce 5# 7# happyReduction_12 -happyReduction_12 (happy_x_5 `HappyStk` - happy_x_4 `HappyStk` - happy_x_3 `HappyStk` - happy_x_2 `HappyStk` - happy_x_1 `HappyStk` - happyRest) - = case happyOut5 happy_x_1 of { happy_var_1 -> - case happyOut23 happy_x_2 of { happy_var_2 -> - case happyOut16 happy_x_3 of { happy_var_3 -> - case happyOut26 happy_x_5 of { happy_var_5 -> - happyIn12 - (ValueDecl happy_var_1 (reverse happy_var_2) happy_var_3 happy_var_5 - ) `HappyStk` happyRest}}}} - -happyReduce_13 = happySpecReduce_3 7# happyReduction_13 -happyReduction_13 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut5 happy_x_2 of { happy_var_2 -> - case happyOut5 happy_x_3 of { happy_var_3 -> - happyIn12 - (DeriveDecl happy_var_2 happy_var_3 - )}} - -happyReduce_14 = happySpecReduce_0 8# happyReduction_14 -happyReduction_14 = happyIn13 - ([] - ) - -happyReduce_15 = happySpecReduce_3 8# happyReduction_15 -happyReduction_15 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut13 happy_x_1 of { happy_var_1 -> - case happyOut12 happy_x_2 of { happy_var_2 -> - happyIn13 - (flip (:) happy_var_1 happy_var_2 - )}} - -happyReduce_16 = happySpecReduce_3 9# happyReduction_16 -happyReduction_16 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut5 happy_x_1 of { happy_var_1 -> - case happyOut26 happy_x_3 of { happy_var_3 -> - happyIn14 - (ConsDecl happy_var_1 happy_var_3 - )}} - -happyReduce_17 = happySpecReduce_0 10# happyReduction_17 -happyReduction_17 = happyIn15 - ([] - ) - -happyReduce_18 = happySpecReduce_1 10# happyReduction_18 -happyReduction_18 happy_x_1 - = case happyOut14 happy_x_1 of { happy_var_1 -> - happyIn15 - ((:[]) happy_var_1 - )} - -happyReduce_19 = happySpecReduce_3 10# happyReduction_19 -happyReduction_19 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut14 happy_x_1 of { happy_var_1 -> - case happyOut15 happy_x_3 of { happy_var_3 -> - happyIn15 - ((:) happy_var_1 happy_var_3 - )}} - -happyReduce_20 = happySpecReduce_2 11# happyReduction_20 -happyReduction_20 happy_x_2 - happy_x_1 - = case happyOut28 happy_x_2 of { happy_var_2 -> - happyIn16 - (GuardExp happy_var_2 - )} - -happyReduce_21 = happySpecReduce_0 11# happyReduction_21 -happyReduction_21 = happyIn16 - (GuardNo - ) - -happyReduce_22 = happySpecReduce_3 12# happyReduction_22 -happyReduction_22 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 - (POr happy_var_1 happy_var_3 - )}} - -happyReduce_23 = happySpecReduce_1 12# happyReduction_23 -happyReduction_23 happy_x_1 - = case happyOut18 happy_x_1 of { happy_var_1 -> - happyIn17 - (happy_var_1 - )} - -happyReduce_24 = happySpecReduce_3 13# happyReduction_24 -happyReduction_24 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut19 happy_x_1 of { happy_var_1 -> - case happyOut18 happy_x_3 of { happy_var_3 -> - happyIn18 - (PListCons happy_var_1 happy_var_3 - )}} - -happyReduce_25 = happySpecReduce_1 13# happyReduction_25 -happyReduction_25 happy_x_1 - = case happyOut19 happy_x_1 of { happy_var_1 -> - happyIn18 - (happy_var_1 - )} - -happyReduce_26 = happySpecReduce_3 14# happyReduction_26 -happyReduction_26 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut5 happy_x_1 of { happy_var_1 -> - case happyOut20 happy_x_2 of { happy_var_2 -> - case happyOut23 happy_x_3 of { happy_var_3 -> - happyIn19 - (PConsTop happy_var_1 happy_var_2 (reverse happy_var_3) - )}}} - -happyReduce_27 = happySpecReduce_1 14# happyReduction_27 -happyReduction_27 happy_x_1 - = case happyOut20 happy_x_1 of { happy_var_1 -> - happyIn19 - (happy_var_1 - )} - -happyReduce_28 = happyReduce 4# 15# happyReduction_28 -happyReduction_28 (happy_x_4 `HappyStk` - happy_x_3 `HappyStk` - happy_x_2 `HappyStk` - happy_x_1 `HappyStk` - happyRest) - = case happyOut25 happy_x_3 of { happy_var_3 -> - happyIn20 - (PRec happy_var_3 - ) `HappyStk` happyRest} - -happyReduce_29 = happySpecReduce_2 15# happyReduction_29 -happyReduction_29 happy_x_2 - happy_x_1 - = happyIn20 - (PEmptyList - ) - -happyReduce_30 = happySpecReduce_3 15# happyReduction_30 -happyReduction_30 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut22 happy_x_2 of { happy_var_2 -> - happyIn20 - (PList happy_var_2 - )} - -happyReduce_31 = happyReduce 5# 15# happyReduction_31 -happyReduction_31 (happy_x_5 `HappyStk` - happy_x_4 `HappyStk` - happy_x_3 `HappyStk` - happy_x_2 `HappyStk` - happy_x_1 `HappyStk` - happyRest) - = case happyOut21 happy_x_2 of { happy_var_2 -> - case happyOut22 happy_x_4 of { happy_var_4 -> - happyIn20 - (PTuple happy_var_2 happy_var_4 - ) `HappyStk` happyRest}} - -happyReduce_32 = happySpecReduce_1 15# happyReduction_32 -happyReduction_32 happy_x_1 - = case happyOut6 happy_x_1 of { happy_var_1 -> - happyIn20 - (PStr happy_var_1 - )} - -happyReduce_33 = happySpecReduce_1 15# happyReduction_33 -happyReduction_33 happy_x_1 - = case happyOut7 happy_x_1 of { happy_var_1 -> - happyIn20 - (PInt happy_var_1 - )} - -happyReduce_34 = happySpecReduce_1 15# happyReduction_34 -happyReduction_34 happy_x_1 - = case happyOut5 happy_x_1 of { happy_var_1 -> - happyIn20 - (PVar happy_var_1 - )} - -happyReduce_35 = happySpecReduce_1 15# happyReduction_35 -happyReduction_35 happy_x_1 - = happyIn20 - (PWild - ) - -happyReduce_36 = happySpecReduce_3 15# happyReduction_36 -happyReduction_36 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut17 happy_x_2 of { happy_var_2 -> - happyIn20 - (happy_var_2 - )} - -happyReduce_37 = happySpecReduce_1 16# happyReduction_37 -happyReduction_37 happy_x_1 - = case happyOut17 happy_x_1 of { happy_var_1 -> - happyIn21 - (CommaPattern happy_var_1 - )} - -happyReduce_38 = happySpecReduce_1 17# happyReduction_38 -happyReduction_38 happy_x_1 - = case happyOut21 happy_x_1 of { happy_var_1 -> - happyIn22 - ((:[]) happy_var_1 - )} - -happyReduce_39 = happySpecReduce_3 17# happyReduction_39 -happyReduction_39 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut21 happy_x_1 of { happy_var_1 -> - case happyOut22 happy_x_3 of { happy_var_3 -> - happyIn22 - ((:) happy_var_1 happy_var_3 - )}} - -happyReduce_40 = happySpecReduce_0 18# happyReduction_40 -happyReduction_40 = happyIn23 - ([] - ) - -happyReduce_41 = happySpecReduce_2 18# happyReduction_41 -happyReduction_41 happy_x_2 - happy_x_1 - = case happyOut23 happy_x_1 of { happy_var_1 -> - case happyOut20 happy_x_2 of { happy_var_2 -> - happyIn23 - (flip (:) happy_var_1 happy_var_2 - )}} - -happyReduce_42 = happySpecReduce_3 19# happyReduction_42 -happyReduction_42 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut5 happy_x_1 of { happy_var_1 -> - case happyOut17 happy_x_3 of { happy_var_3 -> - happyIn24 - (FieldPattern happy_var_1 happy_var_3 - )}} - -happyReduce_43 = happySpecReduce_0 20# happyReduction_43 -happyReduction_43 = happyIn25 - ([] - ) - -happyReduce_44 = happySpecReduce_1 20# happyReduction_44 -happyReduction_44 happy_x_1 - = case happyOut24 happy_x_1 of { happy_var_1 -> - happyIn25 - ((:[]) happy_var_1 - )} - -happyReduce_45 = happySpecReduce_3 20# happyReduction_45 -happyReduction_45 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut24 happy_x_1 of { happy_var_1 -> - case happyOut25 happy_x_3 of { happy_var_3 -> - happyIn25 - ((:) happy_var_1 happy_var_3 - )}} - -happyReduce_46 = happyReduce 7# 21# happyReduction_46 -happyReduction_46 (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 happyOut27 happy_x_2 of { happy_var_2 -> - case happyOut26 happy_x_4 of { happy_var_4 -> - case happyOut26 happy_x_7 of { happy_var_7 -> - happyIn26 - (EPi happy_var_2 happy_var_4 happy_var_7 - ) `HappyStk` happyRest}}} - -happyReduce_47 = happySpecReduce_3 21# happyReduction_47 -happyReduction_47 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut28 happy_x_1 of { happy_var_1 -> - case happyOut26 happy_x_3 of { happy_var_3 -> - happyIn26 - (EPiNoVar happy_var_1 happy_var_3 - )}} - -happyReduce_48 = happySpecReduce_1 21# happyReduction_48 -happyReduction_48 happy_x_1 - = case happyOut28 happy_x_1 of { happy_var_1 -> - happyIn26 - (happy_var_1 - )} - -happyReduce_49 = happySpecReduce_1 22# happyReduction_49 -happyReduction_49 happy_x_1 - = case happyOut5 happy_x_1 of { happy_var_1 -> - happyIn27 - (VVar happy_var_1 - )} - -happyReduce_50 = happySpecReduce_1 22# happyReduction_50 -happyReduction_50 happy_x_1 - = happyIn27 - (VWild - ) - -happyReduce_51 = happyReduce 4# 23# happyReduction_51 -happyReduction_51 (happy_x_4 `HappyStk` - happy_x_3 `HappyStk` - happy_x_2 `HappyStk` - happy_x_1 `HappyStk` - happyRest) - = case happyOut27 happy_x_2 of { happy_var_2 -> - case happyOut28 happy_x_4 of { happy_var_4 -> - happyIn28 - (EAbs happy_var_2 happy_var_4 - ) `HappyStk` happyRest}} - -happyReduce_52 = happyReduce 6# 23# happyReduction_52 -happyReduction_52 (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 happyOut30 happy_x_3 of { happy_var_3 -> - case happyOut28 happy_x_6 of { happy_var_6 -> - happyIn28 - (ELet happy_var_3 happy_var_6 - ) `HappyStk` happyRest}} - -happyReduce_53 = happyReduce 6# 23# happyReduction_53 -happyReduction_53 (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 happyOut26 happy_x_2 of { happy_var_2 -> - case happyOut32 happy_x_5 of { happy_var_5 -> - happyIn28 - (ECase happy_var_2 happy_var_5 - ) `HappyStk` happyRest}} - -happyReduce_54 = happyReduce 6# 23# happyReduction_54 -happyReduction_54 (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 happyOut26 happy_x_2 of { happy_var_2 -> - case happyOut26 happy_x_4 of { happy_var_4 -> - case happyOut28 happy_x_6 of { happy_var_6 -> - happyIn28 - (EIf happy_var_2 happy_var_4 happy_var_6 - ) `HappyStk` happyRest}}} - -happyReduce_55 = happyReduce 5# 23# happyReduction_55 -happyReduction_55 (happy_x_5 `HappyStk` - happy_x_4 `HappyStk` - happy_x_3 `HappyStk` - happy_x_2 `HappyStk` - happy_x_1 `HappyStk` - happyRest) - = case happyOut34 happy_x_3 of { happy_var_3 -> - case happyOut26 happy_x_4 of { happy_var_4 -> - happyIn28 - (EDo (reverse happy_var_3) happy_var_4 - ) `HappyStk` happyRest}} - -happyReduce_56 = happySpecReduce_1 23# happyReduction_56 -happyReduction_56 happy_x_1 - = case happyOut50 happy_x_1 of { happy_var_1 -> - happyIn28 - (happy_var_1 - )} - -happyReduce_57 = happySpecReduce_3 24# happyReduction_57 -happyReduction_57 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut5 happy_x_1 of { happy_var_1 -> - case happyOut26 happy_x_3 of { happy_var_3 -> - happyIn29 - (LetDef happy_var_1 happy_var_3 - )}} - -happyReduce_58 = happySpecReduce_0 25# happyReduction_58 -happyReduction_58 = happyIn30 - ([] - ) - -happyReduce_59 = happySpecReduce_1 25# happyReduction_59 -happyReduction_59 happy_x_1 - = case happyOut29 happy_x_1 of { happy_var_1 -> - happyIn30 - ((:[]) happy_var_1 - )} - -happyReduce_60 = happySpecReduce_3 25# happyReduction_60 -happyReduction_60 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut29 happy_x_1 of { happy_var_1 -> - case happyOut30 happy_x_3 of { happy_var_3 -> - happyIn30 - ((:) happy_var_1 happy_var_3 - )}} - -happyReduce_61 = happyReduce 4# 26# happyReduction_61 -happyReduction_61 (happy_x_4 `HappyStk` - happy_x_3 `HappyStk` - happy_x_2 `HappyStk` - happy_x_1 `HappyStk` - happyRest) - = case happyOut17 happy_x_1 of { happy_var_1 -> - case happyOut16 happy_x_2 of { happy_var_2 -> - case happyOut26 happy_x_4 of { happy_var_4 -> - happyIn31 - (Case happy_var_1 happy_var_2 happy_var_4 - ) `HappyStk` happyRest}}} - -happyReduce_62 = happySpecReduce_0 27# happyReduction_62 -happyReduction_62 = happyIn32 - ([] - ) - -happyReduce_63 = happySpecReduce_1 27# happyReduction_63 -happyReduction_63 happy_x_1 - = case happyOut31 happy_x_1 of { happy_var_1 -> - happyIn32 - ((:[]) happy_var_1 - )} - -happyReduce_64 = happySpecReduce_3 27# happyReduction_64 -happyReduction_64 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut31 happy_x_1 of { happy_var_1 -> - case happyOut32 happy_x_3 of { happy_var_3 -> - happyIn32 - ((:) happy_var_1 happy_var_3 - )}} - -happyReduce_65 = happySpecReduce_3 28# happyReduction_65 -happyReduction_65 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut27 happy_x_1 of { happy_var_1 -> - case happyOut26 happy_x_3 of { happy_var_3 -> - happyIn33 - (BindVar happy_var_1 happy_var_3 - )}} - -happyReduce_66 = happySpecReduce_1 28# happyReduction_66 -happyReduction_66 happy_x_1 - = case happyOut26 happy_x_1 of { happy_var_1 -> - happyIn33 - (BindNoVar happy_var_1 - )} - -happyReduce_67 = happySpecReduce_0 29# happyReduction_67 -happyReduction_67 = happyIn34 - ([] - ) - -happyReduce_68 = happySpecReduce_3 29# happyReduction_68 -happyReduction_68 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut34 happy_x_1 of { happy_var_1 -> - case happyOut33 happy_x_2 of { happy_var_2 -> - happyIn34 - (flip (:) happy_var_1 happy_var_2 - )}} - -happyReduce_69 = happySpecReduce_3 30# happyReduction_69 -happyReduction_69 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut35 happy_x_1 of { happy_var_1 -> - case happyOut36 happy_x_3 of { happy_var_3 -> - happyIn35 - (EBind happy_var_1 happy_var_3 - )}} - -happyReduce_70 = happySpecReduce_3 30# happyReduction_70 -happyReduction_70 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut35 happy_x_1 of { happy_var_1 -> - case happyOut36 happy_x_3 of { happy_var_3 -> - happyIn35 - (EBindC happy_var_1 happy_var_3 - )}} - -happyReduce_71 = happySpecReduce_1 30# happyReduction_71 -happyReduction_71 happy_x_1 - = case happyOut36 happy_x_1 of { happy_var_1 -> - happyIn35 - (happy_var_1 - )} - -happyReduce_72 = happySpecReduce_3 31# happyReduction_72 -happyReduction_72 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut37 happy_x_1 of { happy_var_1 -> - case happyOut36 happy_x_3 of { happy_var_3 -> - happyIn36 - (EOr happy_var_1 happy_var_3 - )}} - -happyReduce_73 = happySpecReduce_1 31# happyReduction_73 -happyReduction_73 happy_x_1 - = case happyOut37 happy_x_1 of { happy_var_1 -> - happyIn36 - (happy_var_1 - )} - -happyReduce_74 = happySpecReduce_3 32# happyReduction_74 -happyReduction_74 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut38 happy_x_1 of { happy_var_1 -> - case happyOut37 happy_x_3 of { happy_var_3 -> - happyIn37 - (EAnd happy_var_1 happy_var_3 - )}} - -happyReduce_75 = happySpecReduce_1 32# happyReduction_75 -happyReduction_75 happy_x_1 - = case happyOut38 happy_x_1 of { happy_var_1 -> - happyIn37 - (happy_var_1 - )} - -happyReduce_76 = happySpecReduce_3 33# happyReduction_76 -happyReduction_76 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut39 happy_x_1 of { happy_var_1 -> - case happyOut39 happy_x_3 of { happy_var_3 -> - happyIn38 - (EEq happy_var_1 happy_var_3 - )}} - -happyReduce_77 = happySpecReduce_3 33# happyReduction_77 -happyReduction_77 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut39 happy_x_1 of { happy_var_1 -> - case happyOut39 happy_x_3 of { happy_var_3 -> - happyIn38 - (ENe happy_var_1 happy_var_3 - )}} - -happyReduce_78 = happySpecReduce_3 33# happyReduction_78 -happyReduction_78 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut39 happy_x_1 of { happy_var_1 -> - case happyOut39 happy_x_3 of { happy_var_3 -> - happyIn38 - (ELt happy_var_1 happy_var_3 - )}} - -happyReduce_79 = happySpecReduce_3 33# happyReduction_79 -happyReduction_79 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut39 happy_x_1 of { happy_var_1 -> - case happyOut39 happy_x_3 of { happy_var_3 -> - happyIn38 - (ELe happy_var_1 happy_var_3 - )}} - -happyReduce_80 = happySpecReduce_3 33# happyReduction_80 -happyReduction_80 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut39 happy_x_1 of { happy_var_1 -> - case happyOut39 happy_x_3 of { happy_var_3 -> - happyIn38 - (EGt happy_var_1 happy_var_3 - )}} - -happyReduce_81 = happySpecReduce_3 33# happyReduction_81 -happyReduction_81 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut39 happy_x_1 of { happy_var_1 -> - case happyOut39 happy_x_3 of { happy_var_3 -> - happyIn38 - (EGe happy_var_1 happy_var_3 - )}} - -happyReduce_82 = happySpecReduce_1 33# happyReduction_82 -happyReduction_82 happy_x_1 - = case happyOut39 happy_x_1 of { happy_var_1 -> - happyIn38 - (happy_var_1 - )} - -happyReduce_83 = happySpecReduce_3 34# happyReduction_83 -happyReduction_83 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut40 happy_x_1 of { happy_var_1 -> - case happyOut39 happy_x_3 of { happy_var_3 -> - happyIn39 - (EListCons happy_var_1 happy_var_3 - )}} - -happyReduce_84 = happySpecReduce_1 34# happyReduction_84 -happyReduction_84 happy_x_1 - = case happyOut40 happy_x_1 of { happy_var_1 -> - happyIn39 - (happy_var_1 - )} - -happyReduce_85 = happySpecReduce_3 35# happyReduction_85 -happyReduction_85 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut40 happy_x_1 of { happy_var_1 -> - case happyOut41 happy_x_3 of { happy_var_3 -> - happyIn40 - (EAdd happy_var_1 happy_var_3 - )}} - -happyReduce_86 = happySpecReduce_3 35# happyReduction_86 -happyReduction_86 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut40 happy_x_1 of { happy_var_1 -> - case happyOut41 happy_x_3 of { happy_var_3 -> - happyIn40 - (ESub happy_var_1 happy_var_3 - )}} - -happyReduce_87 = happySpecReduce_1 35# happyReduction_87 -happyReduction_87 happy_x_1 - = case happyOut41 happy_x_1 of { happy_var_1 -> - happyIn40 - (happy_var_1 - )} - -happyReduce_88 = happySpecReduce_3 36# happyReduction_88 -happyReduction_88 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut41 happy_x_1 of { happy_var_1 -> - case happyOut42 happy_x_3 of { happy_var_3 -> - happyIn41 - (EMul happy_var_1 happy_var_3 - )}} - -happyReduce_89 = happySpecReduce_3 36# happyReduction_89 -happyReduction_89 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut41 happy_x_1 of { happy_var_1 -> - case happyOut42 happy_x_3 of { happy_var_3 -> - happyIn41 - (EDiv happy_var_1 happy_var_3 - )}} - -happyReduce_90 = happySpecReduce_3 36# happyReduction_90 -happyReduction_90 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut41 happy_x_1 of { happy_var_1 -> - case happyOut42 happy_x_3 of { happy_var_3 -> - happyIn41 - (EMod happy_var_1 happy_var_3 - )}} - -happyReduce_91 = happySpecReduce_1 36# happyReduction_91 -happyReduction_91 happy_x_1 - = case happyOut42 happy_x_1 of { happy_var_1 -> - happyIn41 - (happy_var_1 - )} - -happyReduce_92 = happySpecReduce_2 37# happyReduction_92 -happyReduction_92 happy_x_2 - happy_x_1 - = case happyOut42 happy_x_2 of { happy_var_2 -> - happyIn42 - (ENeg happy_var_2 - )} - -happyReduce_93 = happySpecReduce_1 37# happyReduction_93 -happyReduction_93 happy_x_1 - = case happyOut43 happy_x_1 of { happy_var_1 -> - happyIn42 - (happy_var_1 - )} - -happyReduce_94 = happySpecReduce_2 38# happyReduction_94 -happyReduction_94 happy_x_2 - happy_x_1 - = case happyOut43 happy_x_1 of { happy_var_1 -> - case happyOut44 happy_x_2 of { happy_var_2 -> - happyIn43 - (EApp happy_var_1 happy_var_2 - )}} - -happyReduce_95 = happySpecReduce_1 38# happyReduction_95 -happyReduction_95 happy_x_1 - = case happyOut44 happy_x_1 of { happy_var_1 -> - happyIn43 - (happy_var_1 - )} - -happyReduce_96 = happySpecReduce_3 39# happyReduction_96 -happyReduction_96 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut44 happy_x_1 of { happy_var_1 -> - case happyOut5 happy_x_3 of { happy_var_3 -> - happyIn44 - (EProj happy_var_1 happy_var_3 - )}} - -happyReduce_97 = happySpecReduce_1 39# happyReduction_97 -happyReduction_97 happy_x_1 - = case happyOut45 happy_x_1 of { happy_var_1 -> - happyIn44 - (happy_var_1 - )} - -happyReduce_98 = happyReduce 4# 40# happyReduction_98 -happyReduction_98 (happy_x_4 `HappyStk` - happy_x_3 `HappyStk` - happy_x_2 `HappyStk` - happy_x_1 `HappyStk` - happyRest) - = case happyOut47 happy_x_3 of { happy_var_3 -> - happyIn45 - (ERecType happy_var_3 - ) `HappyStk` happyRest} - -happyReduce_99 = happyReduce 4# 40# happyReduction_99 -happyReduction_99 (happy_x_4 `HappyStk` - happy_x_3 `HappyStk` - happy_x_2 `HappyStk` - happy_x_1 `HappyStk` - happyRest) - = case happyOut49 happy_x_3 of { happy_var_3 -> - happyIn45 - (ERec happy_var_3 - ) `HappyStk` happyRest} - -happyReduce_100 = happySpecReduce_2 40# happyReduction_100 -happyReduction_100 happy_x_2 - happy_x_1 - = happyIn45 - (EEmptyList - ) - -happyReduce_101 = happySpecReduce_3 40# happyReduction_101 -happyReduction_101 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut51 happy_x_2 of { happy_var_2 -> - happyIn45 - (EList happy_var_2 - )} - -happyReduce_102 = happyReduce 5# 40# happyReduction_102 -happyReduction_102 (happy_x_5 `HappyStk` - happy_x_4 `HappyStk` - happy_x_3 `HappyStk` - happy_x_2 `HappyStk` - happy_x_1 `HappyStk` - happyRest) - = case happyOut26 happy_x_2 of { happy_var_2 -> - case happyOut51 happy_x_4 of { happy_var_4 -> - happyIn45 - (ETuple happy_var_2 happy_var_4 - ) `HappyStk` happyRest}} - -happyReduce_103 = happySpecReduce_1 40# happyReduction_103 -happyReduction_103 happy_x_1 - = case happyOut5 happy_x_1 of { happy_var_1 -> - happyIn45 - (EVar happy_var_1 - )} - -happyReduce_104 = happySpecReduce_1 40# happyReduction_104 -happyReduction_104 happy_x_1 - = happyIn45 - (EType - ) - -happyReduce_105 = happySpecReduce_1 40# happyReduction_105 -happyReduction_105 happy_x_1 - = case happyOut6 happy_x_1 of { happy_var_1 -> - happyIn45 - (EStr happy_var_1 - )} - -happyReduce_106 = happySpecReduce_1 40# happyReduction_106 -happyReduction_106 happy_x_1 - = case happyOut7 happy_x_1 of { happy_var_1 -> - happyIn45 - (EInteger happy_var_1 - )} - -happyReduce_107 = happySpecReduce_1 40# happyReduction_107 -happyReduction_107 happy_x_1 - = case happyOut8 happy_x_1 of { happy_var_1 -> - happyIn45 - (EDouble happy_var_1 - )} - -happyReduce_108 = happySpecReduce_1 40# happyReduction_108 -happyReduction_108 happy_x_1 - = happyIn45 - (EMeta - ) - -happyReduce_109 = happySpecReduce_3 40# happyReduction_109 -happyReduction_109 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut26 happy_x_2 of { happy_var_2 -> - happyIn45 - (happy_var_2 - )} - -happyReduce_110 = happySpecReduce_3 41# happyReduction_110 -happyReduction_110 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut5 happy_x_1 of { happy_var_1 -> - case happyOut26 happy_x_3 of { happy_var_3 -> - happyIn46 - (FieldType happy_var_1 happy_var_3 - )}} - -happyReduce_111 = happySpecReduce_0 42# happyReduction_111 -happyReduction_111 = happyIn47 - ([] - ) - -happyReduce_112 = happySpecReduce_1 42# happyReduction_112 -happyReduction_112 happy_x_1 - = case happyOut46 happy_x_1 of { happy_var_1 -> - happyIn47 - ((:[]) happy_var_1 - )} - -happyReduce_113 = happySpecReduce_3 42# happyReduction_113 -happyReduction_113 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_114 = happySpecReduce_3 43# happyReduction_114 -happyReduction_114 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut5 happy_x_1 of { happy_var_1 -> - case happyOut26 happy_x_3 of { happy_var_3 -> - happyIn48 - (FieldValue happy_var_1 happy_var_3 - )}} - -happyReduce_115 = happySpecReduce_0 44# happyReduction_115 -happyReduction_115 = happyIn49 - ([] - ) - -happyReduce_116 = happySpecReduce_1 44# happyReduction_116 -happyReduction_116 happy_x_1 - = case happyOut48 happy_x_1 of { happy_var_1 -> - happyIn49 - ((:[]) happy_var_1 - )} - -happyReduce_117 = happySpecReduce_3 44# happyReduction_117 -happyReduction_117 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut48 happy_x_1 of { happy_var_1 -> - case happyOut49 happy_x_3 of { happy_var_3 -> - happyIn49 - ((:) happy_var_1 happy_var_3 - )}} - -happyReduce_118 = happySpecReduce_1 45# happyReduction_118 -happyReduction_118 happy_x_1 - = case happyOut35 happy_x_1 of { happy_var_1 -> - happyIn50 - (happy_var_1 - )} - -happyReduce_119 = happySpecReduce_1 46# happyReduction_119 -happyReduction_119 happy_x_1 - = case happyOut26 happy_x_1 of { happy_var_1 -> - happyIn51 - ((:[]) happy_var_1 - )} - -happyReduce_120 = happySpecReduce_3 46# happyReduction_120 -happyReduction_120 happy_x_3 - happy_x_2 - happy_x_1 - = case happyOut26 happy_x_1 of { happy_var_1 -> - case happyOut51 happy_x_3 of { happy_var_3 -> - happyIn51 - ((:) happy_var_1 happy_var_3 - )}} - -happyNewToken action sts stk [] = - happyDoAction 54# (error "reading EOF!") action sts stk [] - -happyNewToken action sts stk (tk:tks) = - let cont i = happyDoAction i tk action sts stk tks in - case tk of { - PT _ (TS ";") -> cont 1#; - PT _ (TS ":") -> cont 2#; - PT _ (TS "{") -> cont 3#; - PT _ (TS "}") -> cont 4#; - PT _ (TS "=") -> cont 5#; - PT _ (TS "|") -> cont 6#; - PT _ (TS "||") -> cont 7#; - PT _ (TS "::") -> cont 8#; - PT _ (TS "(") -> cont 9#; - PT _ (TS ")") -> cont 10#; - PT _ (TS "[") -> cont 11#; - PT _ (TS "]") -> cont 12#; - PT _ (TS ",") -> cont 13#; - PT _ (TS "_") -> cont 14#; - PT _ (TS "->") -> cont 15#; - PT _ (TS "\\") -> cont 16#; - PT _ (TS "<-") -> cont 17#; - PT _ (TS ">>=") -> cont 18#; - PT _ (TS ">>") -> cont 19#; - PT _ (TS "&&") -> cont 20#; - PT _ (TS "==") -> cont 21#; - PT _ (TS "/=") -> cont 22#; - PT _ (TS "<") -> cont 23#; - PT _ (TS "<=") -> cont 24#; - PT _ (TS ">") -> cont 25#; - PT _ (TS ">=") -> cont 26#; - PT _ (TS "+") -> cont 27#; - PT _ (TS "-") -> cont 28#; - PT _ (TS "*") -> cont 29#; - PT _ (TS "/") -> cont 30#; - PT _ (TS "%") -> cont 31#; - PT _ (TS ".") -> cont 32#; - PT _ (TS "?") -> cont 33#; - PT _ (TS "Type") -> cont 34#; - PT _ (TS "case") -> cont 35#; - PT _ (TS "data") -> cont 36#; - PT _ (TS "derive") -> cont 37#; - PT _ (TS "do") -> cont 38#; - PT _ (TS "else") -> cont 39#; - PT _ (TS "if") -> cont 40#; - PT _ (TS "import") -> cont 41#; - PT _ (TS "in") -> cont 42#; - PT _ (TS "let") -> cont 43#; - PT _ (TS "of") -> cont 44#; - PT _ (TS "rec") -> cont 45#; - PT _ (TS "sig") -> cont 46#; - PT _ (TS "then") -> cont 47#; - PT _ (TS "where") -> cont 48#; - PT _ (TV happy_dollar_dollar) -> cont 49#; - PT _ (TL happy_dollar_dollar) -> cont 50#; - PT _ (TI happy_dollar_dollar) -> cont 51#; - PT _ (TD happy_dollar_dollar) -> cont 52#; - _ -> cont 53#; - _ -> happyError' (tk:tks) - } - -happyError_ tk tks = happyError' (tk:tks) - -happyThen :: () => Err a -> (a -> Err b) -> Err b -happyThen = (thenM) -happyReturn :: () => a -> Err a -happyReturn = (returnM) -happyThen1 m k tks = (thenM) m (\a -> k a tks) -happyReturn1 :: () => a -> b -> Err a -happyReturn1 = \a tks -> (returnM) a -happyError' :: () => [Token] -> Err a -happyError' = happyError - -pModule tks = happySomeParser where - happySomeParser = happyThen (happyParse 0# tks) (\x -> happyReturn (happyOut9 x)) - -pExp tks = happySomeParser where - happySomeParser = happyThen (happyParse 1# tks) (\x -> happyReturn (happyOut26 x)) - -happySeq = happyDontSeq - -returnM :: a -> Err a -returnM = return - -thenM :: Err a -> (a -> Err b) -> Err b -thenM = (>>=) - -happyError :: [Token] -> Err a -happyError ts = - Bad $ "syntax error at " ++ tokenPos ts ++ if null ts then [] else (" before " ++ unwords (map prToken (take 4 ts))) - -myLexer = tokens -{-# LINE 1 "GenericTemplate.hs" #-} -{-# LINE 1 "" #-} -{-# LINE 1 "" #-} -{-# LINE 1 "GenericTemplate.hs" #-} --- $Id$ - -{-# 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) (\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 - -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/Transfer/Syntax/Par.y b/src/Transfer/Syntax/Par.y deleted file mode 100644 index 13c7800a8..000000000 --- a/src/Transfer/Syntax/Par.y +++ /dev/null @@ -1,340 +0,0 @@ --- This Happy file was machine-generated by the BNF converter -{ -{-# OPTIONS -fno-warn-incomplete-patterns -fno-warn-overlapping-patterns #-} -module Transfer.Syntax.Par where -import Transfer.Syntax.Abs -import Transfer.Syntax.Lex -import Transfer.ErrM -} - -%name pModule Module -%name pExp Exp - --- no lexer declaration -%monad { Err } { thenM } { returnM } -%tokentype { Token } - -%token - ';' { PT _ (TS ";") } - ':' { PT _ (TS ":") } - '{' { PT _ (TS "{") } - '}' { PT _ (TS "}") } - '=' { PT _ (TS "=") } - '|' { PT _ (TS "|") } - '||' { PT _ (TS "||") } - '::' { PT _ (TS "::") } - '(' { PT _ (TS "(") } - ')' { PT _ (TS ")") } - '[' { PT _ (TS "[") } - ']' { PT _ (TS "]") } - ',' { PT _ (TS ",") } - '_' { PT _ (TS "_") } - '->' { PT _ (TS "->") } - '\\' { PT _ (TS "\\") } - '<-' { PT _ (TS "<-") } - '>>=' { PT _ (TS ">>=") } - '>>' { PT _ (TS ">>") } - '&&' { PT _ (TS "&&") } - '==' { PT _ (TS "==") } - '/=' { PT _ (TS "/=") } - '<' { PT _ (TS "<") } - '<=' { PT _ (TS "<=") } - '>' { PT _ (TS ">") } - '>=' { PT _ (TS ">=") } - '+' { PT _ (TS "+") } - '-' { PT _ (TS "-") } - '*' { PT _ (TS "*") } - '/' { PT _ (TS "/") } - '%' { PT _ (TS "%") } - '.' { PT _ (TS ".") } - '?' { PT _ (TS "?") } - 'Type' { PT _ (TS "Type") } - 'case' { PT _ (TS "case") } - 'data' { PT _ (TS "data") } - 'derive' { PT _ (TS "derive") } - 'do' { PT _ (TS "do") } - 'else' { PT _ (TS "else") } - 'if' { PT _ (TS "if") } - 'import' { PT _ (TS "import") } - 'in' { PT _ (TS "in") } - 'let' { PT _ (TS "let") } - 'of' { PT _ (TS "of") } - 'rec' { PT _ (TS "rec") } - 'sig' { PT _ (TS "sig") } - 'then' { PT _ (TS "then") } - 'where' { PT _ (TS "where") } - -L_ident { PT _ (TV $$) } -L_quoted { PT _ (TL $$) } -L_integ { PT _ (TI $$) } -L_doubl { PT _ (TD $$) } -L_err { _ } - - -%% - -Ident :: { Ident } : L_ident { Ident $1 } -String :: { String } : L_quoted { $1 } -Integer :: { Integer } : L_integ { (read $1) :: Integer } -Double :: { Double } : L_doubl { (read $1) :: Double } - -Module :: { Module } -Module : ListImport ListDecl { Module (reverse $1) (reverse $2) } - - -Import :: { Import } -Import : 'import' Ident { Import $2 } - - -ListImport :: { [Import] } -ListImport : {- empty -} { [] } - | ListImport Import ';' { flip (:) $1 $2 } - - -Decl :: { Decl } -Decl : 'data' Ident ':' Exp 'where' '{' ListConsDecl '}' { DataDecl $2 $4 $7 } - | Ident ':' Exp { TypeDecl $1 $3 } - | Ident ListPattern Guard '=' Exp { ValueDecl $1 (reverse $2) $3 $5 } - | 'derive' Ident Ident { DeriveDecl $2 $3 } - - -ListDecl :: { [Decl] } -ListDecl : {- empty -} { [] } - | ListDecl Decl ';' { flip (:) $1 $2 } - - -ConsDecl :: { ConsDecl } -ConsDecl : Ident ':' Exp { ConsDecl $1 $3 } - - -ListConsDecl :: { [ConsDecl] } -ListConsDecl : {- empty -} { [] } - | ConsDecl { (:[]) $1 } - | ConsDecl ';' ListConsDecl { (:) $1 $3 } - - -Guard :: { Guard } -Guard : '|' Exp1 { GuardExp $2 } - | {- empty -} { GuardNo } - - -Pattern :: { Pattern } -Pattern : Pattern1 '||' Pattern { POr $1 $3 } - | Pattern1 { $1 } - - -Pattern1 :: { Pattern } -Pattern1 : Pattern2 '::' Pattern1 { PListCons $1 $3 } - | Pattern2 { $1 } - - -Pattern2 :: { Pattern } -Pattern2 : Ident Pattern3 ListPattern { PConsTop $1 $2 (reverse $3) } - | Pattern3 { $1 } - - -Pattern3 :: { Pattern } -Pattern3 : 'rec' '{' ListFieldPattern '}' { PRec $3 } - | '[' ']' { PEmptyList } - | '[' ListCommaPattern ']' { PList $2 } - | '(' CommaPattern ',' ListCommaPattern ')' { PTuple $2 $4 } - | String { PStr $1 } - | Integer { PInt $1 } - | Ident { PVar $1 } - | '_' { PWild } - | '(' Pattern ')' { $2 } - - -CommaPattern :: { CommaPattern } -CommaPattern : Pattern { CommaPattern $1 } - - -ListCommaPattern :: { [CommaPattern] } -ListCommaPattern : CommaPattern { (:[]) $1 } - | CommaPattern ',' ListCommaPattern { (:) $1 $3 } - - -ListPattern :: { [Pattern] } -ListPattern : {- empty -} { [] } - | ListPattern Pattern3 { flip (:) $1 $2 } - - -FieldPattern :: { FieldPattern } -FieldPattern : Ident '=' Pattern { FieldPattern $1 $3 } - - -ListFieldPattern :: { [FieldPattern] } -ListFieldPattern : {- empty -} { [] } - | FieldPattern { (:[]) $1 } - | FieldPattern ';' ListFieldPattern { (:) $1 $3 } - - -Exp :: { Exp } -Exp : '(' VarOrWild ':' Exp ')' '->' Exp { EPi $2 $4 $7 } - | Exp1 '->' Exp { EPiNoVar $1 $3 } - | Exp1 { $1 } - - -VarOrWild :: { VarOrWild } -VarOrWild : Ident { VVar $1 } - | '_' { VWild } - - -Exp1 :: { Exp } -Exp1 : '\\' VarOrWild '->' Exp1 { EAbs $2 $4 } - | 'let' '{' ListLetDef '}' 'in' Exp1 { ELet $3 $6 } - | 'case' Exp 'of' '{' ListCase '}' { ECase $2 $5 } - | 'if' Exp 'then' Exp 'else' Exp1 { EIf $2 $4 $6 } - | 'do' '{' ListBind Exp '}' { EDo (reverse $3) $4 } - | Exp2 { $1 } - - -LetDef :: { LetDef } -LetDef : Ident '=' Exp { LetDef $1 $3 } - - -ListLetDef :: { [LetDef] } -ListLetDef : {- empty -} { [] } - | LetDef { (:[]) $1 } - | LetDef ';' ListLetDef { (:) $1 $3 } - - -Case :: { Case } -Case : Pattern Guard '->' Exp { Case $1 $2 $4 } - - -ListCase :: { [Case] } -ListCase : {- empty -} { [] } - | Case { (:[]) $1 } - | Case ';' ListCase { (:) $1 $3 } - - -Bind :: { Bind } -Bind : VarOrWild '<-' Exp { BindVar $1 $3 } - | Exp { BindNoVar $1 } - - -ListBind :: { [Bind] } -ListBind : {- empty -} { [] } - | ListBind Bind ';' { flip (:) $1 $2 } - - -Exp3 :: { Exp } -Exp3 : Exp3 '>>=' Exp4 { EBind $1 $3 } - | Exp3 '>>' Exp4 { EBindC $1 $3 } - | Exp4 { $1 } - - -Exp4 :: { Exp } -Exp4 : Exp5 '||' Exp4 { EOr $1 $3 } - | Exp5 { $1 } - - -Exp5 :: { Exp } -Exp5 : Exp6 '&&' Exp5 { EAnd $1 $3 } - | Exp6 { $1 } - - -Exp6 :: { Exp } -Exp6 : Exp7 '==' Exp7 { EEq $1 $3 } - | Exp7 '/=' Exp7 { ENe $1 $3 } - | Exp7 '<' Exp7 { ELt $1 $3 } - | Exp7 '<=' Exp7 { ELe $1 $3 } - | Exp7 '>' Exp7 { EGt $1 $3 } - | Exp7 '>=' Exp7 { EGe $1 $3 } - | Exp7 { $1 } - - -Exp7 :: { Exp } -Exp7 : Exp8 '::' Exp7 { EListCons $1 $3 } - | Exp8 { $1 } - - -Exp8 :: { Exp } -Exp8 : Exp8 '+' Exp9 { EAdd $1 $3 } - | Exp8 '-' Exp9 { ESub $1 $3 } - | Exp9 { $1 } - - -Exp9 :: { Exp } -Exp9 : Exp9 '*' Exp10 { EMul $1 $3 } - | Exp9 '/' Exp10 { EDiv $1 $3 } - | Exp9 '%' Exp10 { EMod $1 $3 } - | Exp10 { $1 } - - -Exp10 :: { Exp } -Exp10 : '-' Exp10 { ENeg $2 } - | Exp11 { $1 } - - -Exp11 :: { Exp } -Exp11 : Exp11 Exp12 { EApp $1 $2 } - | Exp12 { $1 } - - -Exp12 :: { Exp } -Exp12 : Exp12 '.' Ident { EProj $1 $3 } - | Exp13 { $1 } - - -Exp13 :: { Exp } -Exp13 : 'sig' '{' ListFieldType '}' { ERecType $3 } - | 'rec' '{' ListFieldValue '}' { ERec $3 } - | '[' ']' { EEmptyList } - | '[' ListExp ']' { EList $2 } - | '(' Exp ',' ListExp ')' { ETuple $2 $4 } - | Ident { EVar $1 } - | 'Type' { EType } - | String { EStr $1 } - | Integer { EInteger $1 } - | Double { EDouble $1 } - | '?' { EMeta } - | '(' Exp ')' { $2 } - - -FieldType :: { FieldType } -FieldType : Ident ':' Exp { FieldType $1 $3 } - - -ListFieldType :: { [FieldType] } -ListFieldType : {- empty -} { [] } - | FieldType { (:[]) $1 } - | FieldType ';' ListFieldType { (:) $1 $3 } - - -FieldValue :: { FieldValue } -FieldValue : Ident '=' Exp { FieldValue $1 $3 } - - -ListFieldValue :: { [FieldValue] } -ListFieldValue : {- empty -} { [] } - | FieldValue { (:[]) $1 } - | FieldValue ';' ListFieldValue { (:) $1 $3 } - - -Exp2 :: { Exp } -Exp2 : Exp3 { $1 } - - -ListExp :: { [Exp] } -ListExp : Exp { (:[]) $1 } - | Exp ',' ListExp { (:) $1 $3 } - - - -{ - -returnM :: a -> Err a -returnM = return - -thenM :: Err a -> (a -> Err b) -> Err b -thenM = (>>=) - -happyError :: [Token] -> Err a -happyError ts = - Bad $ "syntax error at " ++ tokenPos ts ++ if null ts then [] else (" before " ++ unwords (map prToken (take 4 ts))) - -myLexer = tokens -} - diff --git a/src/Transfer/Syntax/Print.hs b/src/Transfer/Syntax/Print.hs deleted file mode 100644 index 50164477d..000000000 --- a/src/Transfer/Syntax/Print.hs +++ /dev/null @@ -1,206 +0,0 @@ -{-# OPTIONS_GHC -fglasgow-exts #-} -module Transfer.Syntax.Print where - --- pretty-printer generated by the BNF converter - -import Transfer.Syntax.Abs -import Data.Char -import Data.List (intersperse) - --- 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 - -unwordsD :: [Doc] -> Doc -unwordsD = concatD . intersperse (doc (showChar ' ')) - -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 - -instance Print Char where - prt _ s = doc (showChar '\'' . mkEsc '\'' s . showChar '\'') - -instance Print String where - prt _ 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 prPrec _i 0 (concatD [prt 0 imports , prt 0 decls]) - Import i -> prPrec _i 0 (concatD [doc (showString "import") , prt 0 i]) - DataDecl i exp consdecls -> prPrec _i 0 (concatD [doc (showString "data") , prt 0 i , doc (showString ":") , prt 0 exp , doc (showString "where") , doc (showString "{") , prt 0 consdecls , doc (showString "}")]) - TypeDecl i exp -> prPrec _i 0 (concatD [prt 0 i , doc (showString ":") , prt 0 exp]) - ValueDecl i patterns guard exp -> prPrec _i 0 (concatD [prt 0 i , prt 0 patterns , prt 0 guard , doc (showString "=") , prt 0 exp]) - DeriveDecl i0 i1 -> prPrec _i 0 (concatD [doc (showString "derive") , prt 0 i0 , prt 0 i1]) - ConsDecl i exp -> prPrec _i 0 (concatD [prt 0 i , doc (showString ":") , prt 0 exp]) - GuardExp exp -> prPrec _i 0 (concatD [doc (showString "|") , prt 1 exp]) - GuardNo -> prPrec _i 0 (concatD []) - POr pattern0 pattern1 -> prPrec _i 0 (concatD [prt 1 pattern0 , doc (showString "||") , prt 0 pattern1]) - PListCons pattern0 pattern1 -> prPrec _i 1 (concatD [prt 2 pattern0 , doc (showString "::") , prt 1 pattern1]) - PConsTop i pattern patterns -> prPrec _i 2 (concatD [prt 0 i , prt 3 pattern , prt 0 patterns]) - PCons i patterns -> prPrec _i 3 (concatD [doc (showString "(") , prt 0 i , prt 0 patterns , doc (showString ")")]) - PRec fieldpatterns -> prPrec _i 3 (concatD [doc (showString "rec") , doc (showString "{") , prt 0 fieldpatterns , doc (showString "}")]) - PEmptyList -> prPrec _i 3 (concatD [doc (showString "[") , doc (showString "]")]) - PList commapatterns -> prPrec _i 3 (concatD [doc (showString "[") , prt 0 commapatterns , doc (showString "]")]) - PTuple commapattern commapatterns -> prPrec _i 3 (concatD [doc (showString "(") , prt 0 commapattern , doc (showString ",") , prt 0 commapatterns , doc (showString ")")]) - PStr str -> prPrec _i 3 (concatD [prt 0 str]) - PInt n -> prPrec _i 3 (concatD [prt 0 n]) - PVar i -> prPrec _i 3 (concatD [prt 0 i]) - PWild -> prPrec _i 3 (concatD [doc (showString "_")]) - CommaPattern pattern -> prPrec _i 0 (concatD [prt 0 pattern]) - FieldPattern i pattern -> prPrec _i 0 (concatD [prt 0 i , doc (showString "=") , prt 0 pattern]) - EPi varorwild exp0 exp1 -> prPrec _i 0 (concatD [doc (showString "(") , prt 0 varorwild , doc (showString ":") , prt 0 exp0 , doc (showString ")") , doc (showString "->") , prt 0 exp1]) - EPiNoVar exp0 exp1 -> prPrec _i 0 (concatD [prt 1 exp0 , doc (showString "->") , prt 0 exp1]) - EAbs varorwild exp -> prPrec _i 1 (concatD [doc (showString "\\") , prt 0 varorwild , doc (showString "->") , prt 1 exp]) - ELet letdefs exp -> prPrec _i 1 (concatD [doc (showString "let") , doc (showString "{") , prt 0 letdefs , doc (showString "}") , doc (showString "in") , prt 1 exp]) - ECase exp cases -> prPrec _i 1 (concatD [doc (showString "case") , prt 0 exp , doc (showString "of") , doc (showString "{") , prt 0 cases , doc (showString "}")]) - EIf exp0 exp1 exp2 -> prPrec _i 1 (concatD [doc (showString "if") , prt 0 exp0 , doc (showString "then") , prt 0 exp1 , doc (showString "else") , prt 1 exp2]) - EDo binds exp -> prPrec _i 1 (concatD [doc (showString "do") , doc (showString "{") , prt 0 binds , prt 0 exp , doc (showString "}")]) - EBind exp0 exp1 -> prPrec _i 3 (concatD [prt 3 exp0 , doc (showString ">>=") , prt 4 exp1]) - EBindC exp0 exp1 -> prPrec _i 3 (concatD [prt 3 exp0 , doc (showString ">>") , prt 4 exp1]) - EOr exp0 exp1 -> prPrec _i 4 (concatD [prt 5 exp0 , doc (showString "||") , prt 4 exp1]) - EAnd exp0 exp1 -> prPrec _i 5 (concatD [prt 6 exp0 , doc (showString "&&") , prt 5 exp1]) - EEq exp0 exp1 -> prPrec _i 6 (concatD [prt 7 exp0 , doc (showString "==") , prt 7 exp1]) - ENe exp0 exp1 -> prPrec _i 6 (concatD [prt 7 exp0 , doc (showString "/=") , prt 7 exp1]) - ELt exp0 exp1 -> prPrec _i 6 (concatD [prt 7 exp0 , doc (showString "<") , prt 7 exp1]) - ELe exp0 exp1 -> prPrec _i 6 (concatD [prt 7 exp0 , doc (showString "<=") , prt 7 exp1]) - EGt exp0 exp1 -> prPrec _i 6 (concatD [prt 7 exp0 , doc (showString ">") , prt 7 exp1]) - EGe exp0 exp1 -> prPrec _i 6 (concatD [prt 7 exp0 , doc (showString ">=") , prt 7 exp1]) - EListCons exp0 exp1 -> prPrec _i 7 (concatD [prt 8 exp0 , doc (showString "::") , prt 7 exp1]) - EAdd exp0 exp1 -> prPrec _i 8 (concatD [prt 8 exp0 , doc (showString "+") , prt 9 exp1]) - ESub exp0 exp1 -> prPrec _i 8 (concatD [prt 8 exp0 , doc (showString "-") , prt 9 exp1]) - EMul exp0 exp1 -> prPrec _i 9 (concatD [prt 9 exp0 , doc (showString "*") , prt 10 exp1]) - EDiv exp0 exp1 -> prPrec _i 9 (concatD [prt 9 exp0 , doc (showString "/") , prt 10 exp1]) - EMod exp0 exp1 -> prPrec _i 9 (concatD [prt 9 exp0 , doc (showString "%") , prt 10 exp1]) - ENeg exp -> prPrec _i 10 (concatD [doc (showString "-") , prt 10 exp]) - EApp exp0 exp1 -> prPrec _i 11 (concatD [prt 11 exp0 , prt 12 exp1]) - EProj exp i -> prPrec _i 12 (concatD [prt 12 exp , doc (showString ".") , prt 0 i]) - ERecType fieldtypes -> prPrec _i 13 (concatD [doc (showString "sig") , doc (showString "{") , prt 0 fieldtypes , doc (showString "}")]) - ERec fieldvalues -> prPrec _i 13 (concatD [doc (showString "rec") , doc (showString "{") , prt 0 fieldvalues , doc (showString "}")]) - EEmptyList -> prPrec _i 13 (concatD [doc (showString "[") , doc (showString "]")]) - EList exps -> prPrec _i 13 (concatD [doc (showString "[") , prt 0 exps , doc (showString "]")]) - ETuple exp exps -> prPrec _i 13 (concatD [doc (showString "(") , prt 0 exp , doc (showString ",") , prt 0 exps , doc (showString ")")]) - EVar i -> prPrec _i 13 (concatD [prt 0 i]) - EType -> prPrec _i 13 (concatD [doc (showString "Type")]) - EStr str -> prPrec _i 13 (concatD [prt 0 str]) - EInteger n -> prPrec _i 13 (concatD [prt 0 n]) - EDouble d -> prPrec _i 13 (concatD [prt 0 d]) - EMeta -> prPrec _i 13 (concatD [doc (showString "?")]) - VVar i -> prPrec _i 0 (concatD [prt 0 i]) - VWild -> prPrec _i 0 (concatD [doc (showString "_")]) - LetDef i exp -> prPrec _i 0 (concatD [prt 0 i , doc (showString "=") , prt 0 exp]) - Case pattern guard exp -> prPrec _i 0 (concatD [prt 0 pattern , prt 0 guard , doc (showString "->") , prt 0 exp]) - BindVar varorwild exp -> prPrec _i 0 (concatD [prt 0 varorwild , doc (showString "<-") , prt 0 exp]) - BindNoVar exp -> prPrec _i 0 (concatD [prt 0 exp]) - FieldType i exp -> prPrec _i 0 (concatD [prt 0 i , doc (showString ":") , prt 0 exp]) - FieldValue i exp -> prPrec _i 0 (concatD [prt 0 i , doc (showString "=") , prt 0 exp]) - Ident str -> prPrec _i 0 (doc (showString str)) - -instance Print [Import] where - prt _ es = case es of - [] -> (concatD []) - x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) -instance Print [Decl] where - prt _ es = case es of - [] -> (concatD []) - x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) -instance Print [ConsDecl] where - prt _ es = case es of - [] -> (concatD []) - [x] -> (concatD [prt 0 x]) - x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) -instance Print [CommaPattern] where - prt _ es = case es of - [x] -> (concatD [prt 0 x]) - x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs]) -instance Print [Pattern] where - prt _ es = case es of - [] -> (concatD []) - x:xs -> (concatD [prt 3 x , prt 0 xs]) -instance Print [FieldPattern] where - prt _ es = case es of - [] -> (concatD []) - [x] -> (concatD [prt 0 x]) - x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) -instance Print [LetDef] where - prt _ 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 _ es = case es of - [] -> (concatD []) - [x] -> (concatD [prt 0 x]) - x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) -instance Print [Bind] where - prt _ es = case es of - [] -> (concatD []) - x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) -instance Print [FieldType] where - prt _ es = case es of - [] -> (concatD []) - [x] -> (concatD [prt 0 x]) - x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) -instance Print [FieldValue] where - prt _ 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 _ es = case es of - [x] -> (concatD [prt 0 x]) - x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs]) diff --git a/src/Transfer/Syntax/ResolveLayout.hs b/src/Transfer/Syntax/ResolveLayout.hs deleted file mode 100644 index 9d7ab607a..000000000 --- a/src/Transfer/Syntax/ResolveLayout.hs +++ /dev/null @@ -1,29 +0,0 @@ -module Main where - -import System.Environment (getArgs) - -import Transfer.Syntax.Lex -import Transfer.Syntax.Layout - -prTokens :: [Token] -> String -prTokens = prTokens_ 1 1 - where - prTokens_ _ _ [] = "" - prTokens_ l c (t@(PT (Pn _ l' c') _):ts) = - replicate (l'-l) '\n' - ++ replicate (if l' == l then c'-c else c'-1) ' ' - ++ s ++ prTokens_ l' (c'+length s) ts - where s = prToken t --- prTokens_ l c (Err p:ts) = - -layout :: String -> String -layout s = prTokens ts' --- ++ "\n" ++ show ts' - where ts = tokens s - ts' = resolveLayout True ts - -main :: IO () -main = do args <- getArgs - case args of - [] -> getContents >>= putStrLn . layout - fs -> mapM_ (\f -> readFile f >>= putStrLn . layout) fs diff --git a/src/Transfer/Syntax/Skel.hs b/src/Transfer/Syntax/Skel.hs deleted file mode 100644 index b2376478b..000000000 --- a/src/Transfer/Syntax/Skel.hs +++ /dev/null @@ -1,200 +0,0 @@ -module Transfer.Syntax.Skel where - --- Haskell module generated by the BNF converter - -import Transfer.Syntax.Abs -import Transfer.ErrM -type Result = Err String - -failure :: Show a => a -> Result -failure x = Bad $ "Undefined case: " ++ show x - -transTree :: Tree c -> Result -transTree t = case t of - Module imports decls -> failure t - Import i -> failure t - DataDecl i exp consdecls -> failure t - TypeDecl i exp -> failure t - ValueDecl i patterns guard exp -> failure t - DeriveDecl i0 i1 -> failure t - ConsDecl i exp -> failure t - GuardExp exp -> failure t - GuardNo -> failure t - POr pattern0 pattern1 -> failure t - PListCons pattern0 pattern1 -> failure t - PConsTop i pattern patterns -> failure t - PCons i patterns -> failure t - PRec fieldpatterns -> failure t - PEmptyList -> failure t - PList commapatterns -> failure t - PTuple commapattern commapatterns -> failure t - PStr str -> failure t - PInt n -> failure t - PVar i -> failure t - PWild -> failure t - CommaPattern pattern -> failure t - FieldPattern i pattern -> failure t - EPi varorwild exp0 exp1 -> failure t - EPiNoVar exp0 exp1 -> failure t - EAbs varorwild exp -> failure t - ELet letdefs exp -> failure t - ECase exp cases -> failure t - EIf exp0 exp1 exp2 -> failure t - EDo binds exp -> failure t - EBind exp0 exp1 -> failure t - EBindC exp0 exp1 -> failure t - EOr exp0 exp1 -> failure t - EAnd exp0 exp1 -> failure t - EEq exp0 exp1 -> failure t - ENe exp0 exp1 -> failure t - ELt exp0 exp1 -> failure t - ELe exp0 exp1 -> failure t - EGt exp0 exp1 -> failure t - EGe exp0 exp1 -> failure t - EListCons exp0 exp1 -> failure t - EAdd exp0 exp1 -> failure t - ESub exp0 exp1 -> failure t - EMul exp0 exp1 -> failure t - EDiv exp0 exp1 -> failure t - EMod exp0 exp1 -> failure t - ENeg exp -> failure t - EApp exp0 exp1 -> failure t - EProj exp i -> failure t - ERecType fieldtypes -> failure t - ERec fieldvalues -> failure t - EEmptyList -> failure t - EList exps -> failure t - ETuple exp exps -> failure t - EVar i -> failure t - EType -> failure t - EStr str -> failure t - EInteger n -> failure t - EDouble d -> failure t - EMeta -> failure t - VVar i -> failure t - VWild -> failure t - LetDef i exp -> failure t - Case pattern guard exp -> failure t - BindVar varorwild exp -> failure t - BindNoVar exp -> failure t - FieldType i exp -> failure t - FieldValue i exp -> failure t - Ident str -> failure t - -transModule :: Module -> Result -transModule t = case t of - Module imports decls -> failure t - -transImport :: Import -> Result -transImport t = case t of - Import i -> failure t - -transDecl :: Decl -> Result -transDecl t = case t of - DataDecl i exp consdecls -> failure t - TypeDecl i exp -> failure t - ValueDecl i patterns guard exp -> failure t - DeriveDecl i0 i1 -> failure t - -transConsDecl :: ConsDecl -> Result -transConsDecl t = case t of - ConsDecl i exp -> failure t - -transGuard :: Guard -> Result -transGuard t = case t of - GuardExp exp -> failure t - GuardNo -> failure t - -transPattern :: Pattern -> Result -transPattern t = case t of - POr pattern0 pattern1 -> failure t - PListCons pattern0 pattern1 -> failure t - PConsTop i pattern patterns -> failure t - PCons i patterns -> failure t - PRec fieldpatterns -> failure t - PEmptyList -> failure t - PList commapatterns -> failure t - PTuple commapattern commapatterns -> failure t - PStr str -> failure t - PInt n -> failure t - PVar i -> failure t - PWild -> failure t - -transCommaPattern :: CommaPattern -> Result -transCommaPattern t = case t of - CommaPattern pattern -> failure t - -transFieldPattern :: FieldPattern -> Result -transFieldPattern t = case t of - FieldPattern i pattern -> failure t - -transExp :: Exp -> Result -transExp t = case t of - EPi varorwild exp0 exp1 -> failure t - EPiNoVar exp0 exp1 -> failure t - EAbs varorwild exp -> failure t - ELet letdefs exp -> failure t - ECase exp cases -> failure t - EIf exp0 exp1 exp2 -> failure t - EDo binds exp -> failure t - EBind exp0 exp1 -> failure t - EBindC exp0 exp1 -> failure t - EOr exp0 exp1 -> failure t - EAnd exp0 exp1 -> failure t - EEq exp0 exp1 -> failure t - ENe exp0 exp1 -> failure t - ELt exp0 exp1 -> failure t - ELe exp0 exp1 -> failure t - EGt exp0 exp1 -> failure t - EGe exp0 exp1 -> failure t - EListCons exp0 exp1 -> failure t - EAdd exp0 exp1 -> failure t - ESub exp0 exp1 -> failure t - EMul exp0 exp1 -> failure t - EDiv exp0 exp1 -> failure t - EMod exp0 exp1 -> failure t - ENeg exp -> failure t - EApp exp0 exp1 -> failure t - EProj exp i -> failure t - ERecType fieldtypes -> failure t - ERec fieldvalues -> failure t - EEmptyList -> failure t - EList exps -> failure t - ETuple exp exps -> failure t - EVar i -> failure t - EType -> failure t - EStr str -> failure t - EInteger n -> failure t - EDouble d -> failure t - EMeta -> failure t - -transVarOrWild :: VarOrWild -> Result -transVarOrWild t = case t of - VVar i -> failure t - VWild -> failure t - -transLetDef :: LetDef -> Result -transLetDef t = case t of - LetDef i exp -> failure t - -transCase :: Case -> Result -transCase t = case t of - Case pattern guard exp -> failure t - -transBind :: Bind -> Result -transBind t = case t of - BindVar varorwild exp -> failure t - BindNoVar exp -> failure t - -transFieldType :: FieldType -> Result -transFieldType t = case t of - FieldType i exp -> failure t - -transFieldValue :: FieldValue -> Result -transFieldValue t = case t of - FieldValue i exp -> failure t - -transIdent :: Ident -> Result -transIdent t = case t of - Ident str -> failure t - diff --git a/src/Transfer/Syntax/Syntax.cf b/src/Transfer/Syntax/Syntax.cf deleted file mode 100644 index 7429e34f9..000000000 --- a/src/Transfer/Syntax/Syntax.cf +++ /dev/null @@ -1,147 +0,0 @@ -entrypoints Module, Exp ; - -layout "let", "where", "of","rec", "sig", "do" ; -layout stop "in" ; -layout toplevel ; - -comment "--" ; -comment "{-" "-}" ; - -Module. Module ::= [Import] [Decl] ; - -Import. Import ::= "import" Ident ; --- FIXME: this is terminator to ensure that the pretty printer --- produces a semicolon after the last import. This could cause --- problems in a program which only does imports and uses layout syntax. -terminator Import ";" ; - -DataDecl. Decl ::= "data" Ident ":" Exp "where" "{" [ConsDecl] "}" ; -TypeDecl. Decl ::= Ident ":" Exp ; -ValueDecl. Decl ::= Ident [Pattern] Guard "=" Exp ; -DeriveDecl. Decl ::= "derive" Ident Ident ; -terminator Decl ";" ; - -ConsDecl. ConsDecl ::= Ident ":" Exp ; -separator ConsDecl ";" ; - -GuardExp. Guard ::= "|" Exp1 ; -GuardNo. Guard ::= ; - --- Disjunctive patterns. -POr. Pattern ::= Pattern1 "||" Pattern ; - --- List constructor patterns -PListCons. Pattern1 ::= Pattern2 "::" Pattern1 ; - --- Hack: constructor applied to at least one pattern --- this is to separate it from variable patterns -PConsTop. Pattern2 ::= Ident Pattern3 [Pattern] ; - --- Real constructor pattern -internal PCons. Pattern3 ::= "(" Ident [Pattern] ")" ; - --- Record patterns -PRec. Pattern3 ::= "rec" "{" [FieldPattern] "}"; - --- List patterns -PEmptyList. Pattern3 ::= "[" "]" ; -PList. Pattern3 ::= "[" [CommaPattern] "]" ; - --- Tuple patterns -PTuple. Pattern3 ::= "(" CommaPattern "," [CommaPattern] ")" ; - --- hack to allow a different [Pattern] from the one defined --- for constructor patterns -CommaPattern. CommaPattern ::= Pattern ; -separator nonempty CommaPattern "," ; - --- String literal patterns -PStr. Pattern3 ::= String ; --- Integer literal patterns -PInt. Pattern3 ::= Integer ; --- Variable patterns -PVar. Pattern3 ::= Ident ; --- Wild card patterns -PWild. Pattern3 ::= "_" ; - -coercions Pattern 3 ; - -[]. [Pattern] ::= ; -(:). [Pattern] ::= Pattern3 [Pattern] ; - -FieldPattern. FieldPattern ::= Ident "=" Pattern ; -separator FieldPattern ";" ; - --- Function types have precedence < 1 to keep the --- "->" from conflicting with the "->" after guards -EPi. Exp ::= "(" VarOrWild ":" Exp ")" "->" Exp ; -EPiNoVar. Exp ::= Exp1 "->" Exp ; -VVar. VarOrWild ::= Ident ; -VWild. VarOrWild ::= "_" ; - -EAbs. Exp1 ::= "\\" VarOrWild "->" Exp1 ; -ELet. Exp1 ::= "let" "{" [LetDef] "}" "in" Exp1 ; -LetDef. LetDef ::= Ident "=" Exp ; -separator LetDef ";" ; -ECase. Exp1 ::= "case" Exp "of" "{" [Case] "}" ; -Case. Case ::= Pattern Guard "->" Exp ; -separator Case ";" ; -EIf. Exp1 ::= "if" Exp "then" Exp "else" Exp1 ; -EDo. Exp1 ::= "do" "{" [Bind] Exp "}" ; -BindVar. Bind ::= VarOrWild "<-" Exp ; -BindNoVar. Bind ::= Exp ; -terminator Bind ";" ; - -EBind. Exp3 ::= Exp3 ">>=" Exp4 ; -EBindC. Exp3 ::= Exp3 ">>" Exp4 ; - -EOr. Exp4 ::= Exp5 "||" Exp4 ; - -EAnd. Exp5 ::= Exp6 "&&" Exp5 ; - -EEq. Exp6 ::= Exp7 "==" Exp7 ; -ENe. Exp6 ::= Exp7 "/=" Exp7 ; -ELt. Exp6 ::= Exp7 "<" Exp7 ; -ELe. Exp6 ::= Exp7 "<=" Exp7 ; -EGt. Exp6 ::= Exp7 ">" Exp7 ; -EGe. Exp6 ::= Exp7 ">=" Exp7 ; - -EListCons. Exp7 ::= Exp8 "::" Exp7 ; - -EAdd. Exp8 ::= Exp8 "+" Exp9 ; -ESub. Exp8 ::= Exp8 "-" Exp9 ; - -EMul. Exp9 ::= Exp9 "*" Exp10 ; -EDiv. Exp9 ::= Exp9 "/" Exp10 ; -EMod. Exp9 ::= Exp9 "%" Exp10 ; - -ENeg. Exp10 ::= "-" Exp10 ; - -EApp. Exp11 ::= Exp11 Exp12 ; - -EProj. Exp12 ::= Exp12 "." Ident ; - -ERecType. Exp13 ::= "sig" "{" [FieldType] "}" ; -FieldType. FieldType ::= Ident ":" Exp ; -separator FieldType ";" ; - -ERec. Exp13 ::= "rec" "{" [FieldValue] "}" ; -FieldValue.FieldValue ::= Ident "=" Exp ; -separator FieldValue ";" ; - -EEmptyList.Exp13 ::= "[" "]" ; -EList. Exp13 ::= "[" [Exp] "]" ; - --- n-tuple, where n>=2 -ETuple. Exp13 ::= "(" Exp "," [Exp] ")" ; - -EVar. Exp13 ::= Ident ; -EType. Exp13 ::= "Type" ; -EStr. Exp13 ::= String ; -EInteger. Exp13 ::= Integer ; -EDouble. Exp13 ::= Double ; -EMeta. Exp13 ::= "?" ; - -coercions Exp 13 ; - -separator nonempty Exp "," ; diff --git a/src/Transfer/Syntax/Test.hs b/src/Transfer/Syntax/Test.hs deleted file mode 100644 index 3f5fab7ad..000000000 --- a/src/Transfer/Syntax/Test.hs +++ /dev/null @@ -1,58 +0,0 @@ --- automatically generated by BNF Converter -module Main where - - -import IO ( stdin, hGetContents ) -import System ( getArgs, getProgName ) - -import Transfer.Syntax.Lex -import Transfer.Syntax.Par -import Transfer.Syntax.Skel -import Transfer.Syntax.Print -import Transfer.Syntax.Abs -import Transfer.Syntax.Layout - - - -import Transfer.ErrM - -type ParseFun a = [Token] -> Err a - -myLLexer = resolveLayout True . myLexer - -type Verbosity = Int - -putStrV :: Verbosity -> String -> IO () -putStrV v s = if v > 1 then putStrLn s else return () - -runFile :: (Print a, Show a) => Verbosity -> ParseFun a -> FilePath -> IO () -runFile v p f = putStrLn f >> readFile f >>= run v p - -run :: (Print a, Show a) => Verbosity -> ParseFun a -> String -> IO () -run v p s = let ts = myLLexer s in case p ts of - Bad s -> do putStrLn "\nParse Failed...\n" - putStrV v "Tokens:" - putStrV v $ show ts - putStrLn s - Ok tree -> do putStrLn "\nParse Successful!" - showTree v tree - - - -showTree :: (Show a, Print a) => Int -> a -> IO () -showTree v tree - = do - putStrV v $ "\n[Abstract Syntax]\n\n" ++ show tree - putStrV v $ "\n[Linearized tree]\n\n" ++ printTree tree - -main :: IO () -main = do args <- getArgs - case args of - [] -> hGetContents stdin >>= run 2 pModule - "-s":fs -> mapM_ (runFile 0 pModule) fs - fs -> mapM_ (runFile 2 pModule) fs - - - - - diff --git a/src/Transfer/SyntaxToCore.hs b/src/Transfer/SyntaxToCore.hs deleted file mode 100644 index 32796eb50..000000000 --- a/src/Transfer/SyntaxToCore.hs +++ /dev/null @@ -1,766 +0,0 @@ --- | Translate to the core language -module Transfer.SyntaxToCore where - -import Transfer.Syntax.Abs -import Transfer.Syntax.Print - -import Control.Monad.State -import Data.List -import Data.Maybe -import qualified Data.Set as Set -import Data.Set (Set) -import qualified Data.Map as Map -import Data.Map (Map) -import Data.Monoid - -import Debug.Trace - -type C a = State CState a - -data CState = CState { - nextVar :: Integer, - nextMeta :: Integer - } - - - -declsToCore :: [Decl] -> [Decl] -declsToCore m = evalState (declsToCore_ m) newState - -declsToCore_ :: [Decl] -> C [Decl] -declsToCore_ = deriveDecls - >>> desugar - >>> compilePattDecls - >>> numberMetas - >>> replaceCons - >>> expandOrPatts - >>> optimize - -optimize :: [Decl] -> C [Decl] -optimize = uniqueVars - >>> removeUselessMatch - >>> betaReduce - -newState :: CState -newState = CState { - nextVar = 0, - nextMeta = 0 - } - - --- --- * Make all variable names unique --- - -uniqueVars :: [Decl] -> C [Decl] -uniqueVars = mapM (f Map.empty) - where - f :: Map Ident Ident -> Tree a -> C (Tree a) - f ss t = case t of - ELet ds _ -> - do - let vs = Set.toList (letDefBinds ds) - vs' <- freshIdents (length vs) - let ss' = addToSubstEnv (zip vs vs') ss - composOpM (f ss') t - LetDef i e -> - case Map.lookup i ss of - Nothing -> fail $ "let var " ++ printTree i ++ " not renamed" - Just i' -> liftM (LetDef i') (f ss e) - Case p _ _ -> - do - let vs = Set.toList (binds p) - vs' <- freshIdents (length vs) - let ss' = addToSubstEnv (zip vs vs') ss - composOpM (f ss') t - EAbs (VVar i) e -> - do - i' <- freshIdent - let ss' = addToSubstEnv [(i,i')] ss - liftM (EAbs (VVar i')) (f ss' e) - EPi (VVar i) e1 e2 -> - do - i' <- freshIdent - let ss' = addToSubstEnv [(i,i')] ss - liftM2 (EPi (VVar i')) (f ss e1) (f ss' e2) - EVar i -> return $ case Map.lookup i ss of - Nothing -> t -- constructor - Just i' -> EVar i' - PVar i -> return $ case Map.lookup i ss of - Nothing -> t -- constructor - Just i' -> PVar i' - _ -> composOpM (f ss) t - where addToSubstEnv bs m = foldr (\ (k,v) -> Map.insert k v) m bs - --- --- * Number meta variables --- - -numberMetas :: [Decl] -> C [Decl] -numberMetas = mapM f - where - f :: Tree a -> C (Tree a) - f t = case t of - EMeta -> do - st <- get - put (st { nextMeta = nextMeta st + 1}) - return $ EVar $ Ident $ "?" ++ show (nextMeta st) -- FIXME: hack - _ -> composOpM f t - - --- --- * Pattern equations --- - -compilePattDecls :: [Decl] -> C [Decl] -compilePattDecls [] = return [] -compilePattDecls (d@(ValueDecl x _ _ _):ds) = - do - let (xs,rest) = span (isValueDecl x) ds - d <- mergeDecls (d:xs) - rs <- compilePattDecls rest - return (d:rs) -compilePattDecls (d:ds) = liftM (d:) (compilePattDecls ds) - --- | Checks if a declaration is a value declaration --- of the given identifier. -isValueDecl :: Ident -> Decl -> Bool -isValueDecl x (ValueDecl y _ _ _) = x == y -isValueDecl _ _ = False - --- | Take a non-empty list of pattern equations with guards --- for the same function, and produce a single declaration. -mergeDecls :: [Decl] -> C Decl -mergeDecls ds@(ValueDecl x p _ _:_) - = do let cs = [ (ps,g,rhs) | ValueDecl _ ps g rhs <- ds ] - (pss,_,_) = unzip3 cs - n = length p - when (not (all ((== n) . length) pss)) - $ fail $ "Pattern count mismatch for " ++ printTree x - vs <- freshIdents n - let cases = map (\ (ps,g,rhs) -> Case (mkPTuple ps) g rhs) cs - c = ECase (mkETuple (map EVar vs)) cases - f = foldr (EAbs . VVar) c vs - return $ ValueDecl x [] GuardNo f - --- --- * Derived function definitions --- - -deriveDecls :: [Decl] -> C [Decl] -deriveDecls ds = liftM concat (mapM der ds) - where - ts = dataTypes ds - der (DeriveDecl (Ident f) t) = - case lookup f derivators of - Just d -> d t k cs - _ -> fail $ "Don't know how to derive " ++ f - where (k,cs) = getDataType ts t - der d = return [d] - -type Derivator = Ident -> Exp -> [(Ident,Exp)] -> C [Decl] - -derivators :: [(String, Derivator)] -derivators = [ - ("Compos", deriveCompos), - ("Show", deriveShow), - ("Eq", deriveEq), - ("Ord", deriveOrd) - ] - --- --- * Deriving instances of Compos --- - -deriveCompos :: Derivator -deriveCompos t@(Ident ts) k cs = - do - co <- deriveComposOp t k cs - cf <- deriveComposFold t k cs - let [c] = argumentTypes k -- FIXME: what if there is not exactly one argument to t? - d = Ident ("compos_"++ts) - dt = apply (var "Compos") [c, EVar t] - r = ERec [FieldValue (Ident "composOp") co, - FieldValue (Ident "composFold") cf] - return [TypeDecl d dt, ValueDecl d [] GuardNo r] - -deriveComposOp :: Ident -> Exp -> [(Ident,Exp)] -> C Exp -deriveComposOp t k cs = - do - f <- freshIdent - x <- freshIdent - let e = EVar - pv = VVar - infixr 3 \-> - (\->) = EAbs - mkCase ci ct = - do - vars <- freshIdents (arity ct) - -- FIXME: the type argument to f is wrong if the constructor - -- has a dependent type - -- FIXME: make a special case for lists? - let rec v at = case at of - EApp (EVar t') c | t' == t -> apply (e f) [c, e v] - _ -> e v - calls = zipWith rec vars (argumentTypes ct) - return $ Case (PCons ci (map PVar vars)) gtrue (apply (e ci) calls) - cases <- mapM (uncurry mkCase) cs - let cases' = cases ++ [Case PWild gtrue (e x)] - fb <- abstract (arity k) $ const $ pv f \-> pv x \-> ECase (e x) cases' - return fb - -deriveComposFold :: Ident -> Exp -> [(Ident,Exp)] -> C Exp -deriveComposFold t k cs = - do - f <- freshIdent - x <- freshIdent - b <- freshIdent - r <- freshIdent - let e = EVar - pv = VVar - infixr 3 \-> - (\->) = EAbs - mkCase ci ct = - do - vars <- freshIdents (arity ct) - -- FIXME: the type argument to f is wrong if the constructor - -- has a dependent type - -- FIXME: make a special case for lists? - let rec v at = case at of - EApp (EVar t') c | t' == t -> apply (e f) [c, e v] - _ -> e v - calls = zipWith rec vars (argumentTypes ct) - z = EProj (e r) (Ident "mzero") - p = EProj (e r) (Ident "mplus") - joinCalls [] = z - joinCalls cs = foldr1 (\x y -> apply p [x,y]) cs - return $ Case (PCons ci (map PVar vars)) gtrue (joinCalls calls) - cases <- mapM (uncurry mkCase) cs - let cases' = cases ++ [Case PWild gtrue (e x)] - fb <- abstract (arity k) $ const $ pv f \-> pv x \-> ECase (e x) cases' - return $ VWild \-> pv r \-> fb - --- --- * Deriving instances of Show --- - -deriveShow :: Derivator -deriveShow t k cs = fail $ "derive Show not implemented" - --- --- * Deriving instances of Eq --- - --- FIXME: how do we require Eq instances for all --- constructor arguments? - -deriveEq :: Derivator -deriveEq t@(Ident tn) k cs = - do - dt <- abstractType ats (EApp (var "Eq") . apply (EVar t)) - f <- mkEq - r <- abstract (arity k) (\_ -> ERec [FieldValue (Ident "eq") f]) - return [TypeDecl d dt, ValueDecl d [] GuardNo r] - where - ats = argumentTypes k - d = Ident ("eq_"++tn) - mkEq = do - x <- freshIdent - y <- freshIdent - cases <- mapM (uncurry mkEqCase) cs - let fc = Case PWild gtrue false - abstract 2 (\es -> ECase (mkETuple es) (cases++[fc])) - mkEqCase c ct = - do - let n = arity ct - ts = argumentTypes ct - vs1 <- freshIdents n - vs2 <- freshIdents n - let pr = mkPTuple [PCons c (map PVar vs1), PCons c (map PVar vs2)] - eqs = concat $ zipWith3 child_eq ts vs1 vs2 - rhs [] = true - rhs xs = foldr1 EAnd xs - return $ Case pr gtrue (rhs eqs) - -- FIXME: hack: this returns a list to skip testing type arguments. - child_eq EType _ _ = [] - child_eq t x y = [apply (var "eq") [t,eq_dict t, EVar x, EVar y]] - -- FIXME: this is a hack to at least support Tree types - eq_dict (EApp (EVar t') _) - | t' == t = apply (EVar d) (replicate (arity k) EMeta) - eq_dict (EVar (Ident x)) - | x `elem` ["String","Integer","Double"] = var ("eq_"++x) - eq_dict _ = EMeta - --- --- * Deriving instances of Ord --- - -deriveOrd :: Derivator -deriveOrd t k cs = fail $ "derive Ord not implemented" - --- --- * Constructor patterns and applications. --- - -type DataConsInfo = Map Ident Int - -consArities :: [Decl] -> DataConsInfo -consArities ds = Map.fromList [ (c, arity t) | DataDecl _ _ cs <- ds, - ConsDecl c t <- cs ] - --- | Get the arity of a function type. -arity :: Exp -> Int -arity = length . argumentTypes - --- | Get the argument type of a function type. Note that --- the returned types may contains free variables --- which should be bound to the values of earlier arguments. -argumentTypes :: Exp -> [Exp] -argumentTypes e = case e of - EPi _ t e' -> t : argumentTypes e' - EPiNoVar t e' -> t : argumentTypes e' - _ -> [] - --- | Fix up constructor patterns and applications. -replaceCons :: [Decl] -> C [Decl] -replaceCons ds = mapM (f cs) ds - where - cs = consArities ds - f :: DataConsInfo -> Tree a -> C (Tree a) - f cs x = case x of - -- get rid of the PConsTop hack - PConsTop id p1 ps -> f cs (PCons id (p1:ps)) - -- replace patterns C where C is a constructor with (C) - PVar id | isCons id -> return $ PCons id [] - -- don't eta-expand overshadowed constructors - EAbs (VVar id) e | isCons id -> - liftM (EAbs (VVar id)) (f (Map.delete id cs) e) - EPi (VVar id) t e | isCons id -> - liftM2 (EPi (VVar id)) (f cs t) (f (Map.delete id cs) e) - -- eta-expand constructors. betaReduce will remove any beta - -- redexes produced here. - EVar id | isCons id -> do - let Just n = Map.lookup id cs - abstract n (apply x) - _ -> composOpM (f cs) x - where isCons = (`Map.member` cs) - --- --- * Do simple beta reductions. --- - -betaReduce :: [Decl] -> C [Decl] -betaReduce = return . map f - where - f :: Tree a -> Tree a - f t = case t of - EApp e1 e2 -> - case (f e1, f e2) of - (EAbs (VVar x) b, e) | countFreeOccur x b == 1 -> f (subst x e b) - (e1',e2') -> EApp e1' e2' - _ -> composOp f t - --- --- * Remove useless pattern matching and variable binding. --- - -removeUselessMatch :: [Decl] -> C [Decl] -removeUselessMatch = return . map f - where - f :: Tree a -> Tree a - f x = case x of - EAbs (VVar x) b -> - case f b of - -- replace \x -> case x of { y | True -> e } with \y -> e, - -- if x is not free in e - ECase (EVar x') [Case (PVar y) g e] - | x' == x && isTrueGuard g && not (x `isFreeIn` e) - -> f (EAbs (VVar y) e) - -- replace unused variable in lambda with wild card - e | not (x `isFreeIn` e) -> f (EAbs VWild e) - e -> EAbs (VVar x) e - -- replace unused variable in pi with wild card - EPi (VVar x) t e -> - let e' = f e - v = if not (x `isFreeIn` e') then VWild else VVar x - in EPi v (f t) e' - -- replace unused variables in case patterns with wild cards - Case p (GuardExp g) e -> - let g' = f g - e' = f e - used = freeVars g' `Set.union` freeVars e' - p' = f (removeUnusedVarPatts used p) - in Case p' (GuardExp g') e' - -- for value declarations without patterns, compilePattDecls - -- generates pattern matching on the empty record, remove these - ECase (ERec []) [Case (PRec []) g e] | isTrueGuard g -> f e - -- if the pattern matching is on a single field of a record expression - -- with only one field, there is no need to wrap it in a record - ECase (ERec [FieldValue x e]) cs | all (isSingleFieldPattern x) (casePatterns cs) - -> f (ECase e [ Case p g r | Case (PRec [FieldPattern _ p]) g r <- cs ]) - -- for all fields in record matching where all patterns for the field just - -- bind variables, substitute in the field value (if it is a variable) - -- in the guards and right hand sides. - ECase (ERec fs) cs | all isPRec (casePatterns cs) -> - let h (FieldValue f v@(EVar _):fs) xs - | all (onlyBindsFieldToVariable f) (casePatterns xs) - = h fs (map (inlineField f v) xs) - h (f:fs) xs = let (fs',xs') = h fs xs in (f:fs',xs') - h [] xs = ([],xs) - inlineField f v (Case (PRec fps) (GuardExp g) e) = - let p' = PRec [fp | fp@(FieldPattern f' _) <- fps, f' /= f] - ss = zip (fieldPatternVars f fps) (repeat v) - in Case p' (GuardExp (substs ss g)) (substs ss e) - (fs',cs') = h fs cs - x' = ECase (ERec fs') cs' - in if length fs' < length fs then f x' else composOp f x' - -- Remove wild card patterns in record patterns - PRec fps -> PRec (map f (fps \\ wildcards)) - where wildcards = [fp | fp@(FieldPattern _ PWild) <- fps] - _ -> composOp f x - -isTrueGuard :: Guard -> Bool -isTrueGuard (GuardExp (EVar (Ident "True"))) = True -isTrueGuard GuardNo = True -isTrueGuard _ = False - -removeUnusedVarPatts :: Set Ident -> Tree a -> Tree a -removeUnusedVarPatts keep x = case x of - PVar id | not (id `Set.member` keep) -> PWild - _ -> composOp (removeUnusedVarPatts keep) x - -isSingleFieldPattern :: Ident -> Pattern -> Bool -isSingleFieldPattern x p = case p of - PRec [FieldPattern y _] -> x == y - _ -> False - -casePatterns :: [Case] -> [Pattern] -casePatterns cs = [p | Case p _ _ <- cs] - -isPRec :: Pattern -> Bool -isPRec (PRec _) = True -isPRec _ = False - --- | Checks if given pattern is a record pattern, and matches the field --- with just a variable, with a wild card, or not at all. -onlyBindsFieldToVariable :: Ident -> Pattern -> Bool -onlyBindsFieldToVariable f (PRec fps) = - all isVar [p | FieldPattern f' p <- fps, f == f'] - where isVar (PVar _) = True - isVar PWild = True - isVar _ = False -onlyBindsFieldToVariable _ _ = False - -fieldPatternVars :: Ident -> [FieldPattern] -> [Ident] -fieldPatternVars f fps = [p | FieldPattern f' (PVar p) <- fps, f == f'] - --- --- * Expand disjunctive patterns. --- - -expandOrPatts :: [Decl] -> C [Decl] -expandOrPatts = return . map f - where - f :: Tree a -> Tree a - f x = case x of - ECase e cs -> ECase (f e) (concatMap (expandCase . f) cs) - _ -> composOp f x - -expandCase :: Case -> [Case] -expandCase (Case p g e) = [ Case p' g e | p' <- expandPatt p ] - -expandPatt :: Pattern -> [Pattern] -expandPatt p = case p of - POr p1 p2 -> expandPatt p1 ++ expandPatt p2 - PCons i ps -> map (PCons i) $ expandPatts ps - PRec fps -> let (fs,ps) = unzip $ fromPRec fps - fpss = map (zip fs) (expandPatts ps) - in map (PRec . toPRec) fpss - _ -> [p] - -expandPatts :: [Pattern] -> [[Pattern]] -expandPatts [] = [[]] -expandPatts (p:ps) = [ p':ps' | p' <- expandPatt p, ps' <- expandPatts ps] - --- --- * Remove simple syntactic sugar. --- - -desugar :: [Decl] -> C [Decl] -desugar = return . map f - where - f :: Tree a -> Tree a - f x = case x of - PListCons p1 p2 -> pListCons <| p1 <| p2 - PEmptyList -> pList [] - PList xs -> pList [f p | CommaPattern p <- xs] - PTuple x xs -> mkPTuple [f p | CommaPattern p <- (x:xs)] - GuardNo -> gtrue - EIf exp0 exp1 exp2 -> ifBool <| exp0 <| exp1 <| exp2 - EDo bs e -> mkDo (map f bs) (f e) - BindNoVar exp0 -> BindVar VWild <| exp0 - EPiNoVar exp0 exp1 -> EPi VWild <| exp0 <| exp1 - EBind exp0 exp1 -> appBind <| exp0 <| exp1 - EBindC exp0 exp1 -> appBindC <| exp0 <| exp1 - EOr exp0 exp1 -> orBool <| exp0 <| exp1 - EAnd exp0 exp1 -> andBool <| exp0 <| exp1 - EEq exp0 exp1 -> overlBin "eq" <| exp0 <| exp1 - ENe exp0 exp1 -> overlBin "ne" <| exp0 <| exp1 - ELt exp0 exp1 -> overlBin "lt" <| exp0 <| exp1 - ELe exp0 exp1 -> overlBin "le" <| exp0 <| exp1 - EGt exp0 exp1 -> overlBin "gt" <| exp0 <| exp1 - EGe exp0 exp1 -> overlBin "ge" <| exp0 <| exp1 - EListCons exp0 exp1 -> appCons <| exp0 <| exp1 - EAdd exp0 exp1 -> overlBin "plus" <| exp0 <| exp1 - ESub exp0 exp1 -> overlBin "minus" <| exp0 <| exp1 - EMul exp0 exp1 -> overlBin "times" <| exp0 <| exp1 - EDiv exp0 exp1 -> overlBin "div" <| exp0 <| exp1 - EMod exp0 exp1 -> overlBin "mod" <| exp0 <| exp1 - ENeg exp0 -> overlUn "neg" <| exp0 - EEmptyList -> mkList [] - EList exps -> mkList (map f exps) - ETuple exp1 exps -> mkETuple (map f (exp1:exps)) - _ -> composOp f x - where g <| x = g (f x) - --- --- * List patterns --- - -pListCons :: Pattern -> Pattern -> Pattern -pListCons p1 p2 = PCons (Ident "Cons") [PWild,p1,p2] - -pList :: [Pattern] -> Pattern -pList = foldr pListCons (PCons (Ident "Nil") [PWild]) - --- --- * Use an overloaded function. --- - -overlUn :: String -> Exp -> Exp -overlUn f e1 = apply (EVar (Ident f)) [EMeta,EVar (Ident "num_Integer"),e1] -- FIXME: hack, should be ? - -overlBin :: String -> Exp -> Exp -> Exp -overlBin f e1 e2 = apply (EVar (Ident f)) [EMeta,EVar (Ident "num_Integer"),e1,e2] -- FIXME: hack, should be ? - --- --- * Monad --- - -mkDo :: [Bind] -> Exp -> Exp -mkDo bs e = foldr (\ (BindVar v r) x -> appBind r (EAbs v x)) e bs - -appBind :: Exp -> Exp -> Exp -appBind e1 e2 = apply (EVar (Ident "bind")) [EMeta,EMeta,EMeta,EMeta,e1,e2] - -appBindC :: Exp -> Exp -> Exp -appBindC e1 e2 = appBind e1 (EAbs VWild e2) - --- --- * List --- - -mkList :: [Exp] -> Exp -mkList = foldr appCons (EApp (EVar (Ident "Nil")) EMeta) - -appCons :: Exp -> Exp -> Exp -appCons e1 e2 = apply (EVar (Ident "Cons")) [EMeta,e1,e2] - - --- --- * Booleans --- - -andBool :: Exp -> Exp -> Exp -andBool e1 e2 = ifBool e1 e2 false - -orBool :: Exp -> Exp -> Exp -orBool e1 e2 = ifBool e1 true e2 - -ifBool :: Exp -> Exp -> Exp -> Exp -ifBool c t e = ECase c [Case (PCons (Ident "True") []) gtrue t, - Case (PCons (Ident "False") []) gtrue e] - - --- --- * Substitution --- - -subst :: Ident -> Exp -> Exp -> Exp -subst x e = substs [(x,e)] - - - --- | Simultaneuous substitution -substs :: [(Ident, Exp)] -> Exp -> Exp -substs ss = f (Map.fromList ss) - where - f :: Map Ident Exp -> Tree a -> Tree a - f ss t | Map.null ss = t - f ss t = case t of - EVar i -> Map.findWithDefault t i ss - _ -> composOp (f ss) t - - -{- --- not needed now that variable names are unique --- FIXE: this function does not properly rename bound variables -substs :: [(Ident, Exp)] -> Exp -> Exp -substs ss = f (Map.fromList ss) - where - f :: Map Ident Exp -> Tree a -> Tree a - f ss t | Map.null ss = t - f ss t = case t of - ELet ds e3 -> - ELet [LetDef id (f ss' e2) | LetDef id e2 <- ds] (f ss' e3) - where ss' = ss `mapMinusSet` letDefBinds ds - Case p g e -> Case p (f ss' g) (f ss' e) where ss' = ss `mapMinusSet` binds p - EAbs (VVar id) e -> EAbs (VVar id) (f ss' e) where ss' = Map.delete id ss - EPi (VVar id) e1 e2 -> - EPi (VVar id) (f ss e1) (f ss' e2) where ss' = Map.delete id ss - EVar i -> Map.findWithDefault t i ss - _ -> composOp (f ss) t --} - --- --- * Abstract syntax utilities --- - -var :: String -> Exp -var s = EVar (Ident s) - -true :: Exp -true = var "True" - -false :: Exp -false = var "False" - -gtrue :: Guard -gtrue = GuardExp true - - -mkETuple :: [Exp] -> Exp -mkETuple = ERec . zipWith (\i -> FieldValue (Ident ("p"++show i))) [1..] - -mkPTuple :: [Pattern] -> Pattern -mkPTuple = PRec . zipWith (\i -> FieldPattern (Ident ("p"++show i))) [1..] - --- | Apply an expression to a list of arguments. -apply :: Exp -> [Exp] -> Exp -apply = foldl EApp - --- | Abstract a value over some arguments. -abstract :: Int -- ^ number of arguments - -> ([Exp] -> Exp) -> C Exp -abstract n f = - do - vs <- freshIdents n - return $ foldr EAbs (f (map EVar vs)) (map VVar vs) - --- | Abstract a type over some arguments. -abstractType :: [Exp] -- ^ argument types - -> ([Exp] -> Exp) -- ^ function from variable expressions - -- to the expression to return - -> C Exp -abstractType ts f = - do - vs <- freshIdents (length ts) - let pi (v,t) e = EPi (VVar v) t e - return $ foldr pi (f (map EVar vs)) (zip vs ts) - --- | Get an identifier which cannot occur in user-written --- code, and which has not been generated before. -freshIdent :: C Ident -freshIdent = do - st <- get - put (st { nextVar = nextVar st + 1 }) - return (Ident ("x_"++show (nextVar st))) - -freshIdents :: Int -> C [Ident] -freshIdents n = replicateM n freshIdent - --- | Get the variables bound by a set of let definitions. -letDefBinds :: [LetDef] -> Set Ident -letDefBinds defs = Set.fromList [ id | LetDef id _ <- defs] - -letDefRhss :: [LetDef] -> [Exp] -letDefRhss defs = [ exp | LetDef _ exp <- defs ] - --- | Get the free variables in an expression. -freeVars :: Exp -> Set Ident -freeVars = f - where - f :: Tree a -> Set Ident - f t = case t of - ELet defs exp -> - Set.unions (f exp:map f (letDefRhss defs)) Set.\\ letDefBinds defs - ECase exp cases -> f exp `Set.union` - Set.unions [(f g `Set.union` f e) Set.\\ binds p - | Case p g e <- cases] - EAbs (VVar id) exp -> Set.delete id (f exp) - EPi (VVar id) exp1 exp2 -> f exp1 `Set.union` Set.delete id (f exp2) - EVar i -> Set.singleton i - _ -> composOpMonoid f t - -isFreeIn :: Ident -> Exp -> Bool -isFreeIn x e = countFreeOccur x e > 0 - --- | Count the number of times a variable occurs free in an expression. -countFreeOccur :: Ident -> Exp -> Int -countFreeOccur x = f - where - f :: Tree a -> Int - f t = case t of - ELet defs _ | x `Set.member` letDefBinds defs -> 0 - Case p _ _ | x `Set.member` binds p -> 0 - EAbs (VVar id) _ | id == x -> 0 - EPi (VVar id) exp1 _ | id == x -> f exp1 - EVar id | id == x -> 1 - _ -> composOpFold 0 (+) f t - --- | Get the variables bound by a pattern. -binds :: Pattern -> Set Ident -binds = f - where - f :: Tree a -> Set Ident - f p = case p of - -- replaceCons removes non-variable PVars - PVar id -> Set.singleton id - _ -> composOpMonoid f p - - -fromPRec :: [FieldPattern] -> [(Ident,Pattern)] -fromPRec fps = [ (l,p) | FieldPattern l p <- fps ] - -toPRec :: [(Ident,Pattern)] -> [FieldPattern] -toPRec = map (uncurry FieldPattern) - --- --- * Data types --- - -type DataTypes = Map Ident (Exp,[(Ident,Exp)]) - --- | Get a map of data type names to the type of the type constructor --- and all data constructors with their types. -dataTypes :: [Decl] -> Map Ident (Exp,[(Ident,Exp)]) -dataTypes ds = Map.fromList [ (i,(t,[(c,ct) | ConsDecl c ct <- cs])) | DataDecl i t cs <- ds] - -getDataType :: DataTypes -> Ident -> (Exp,[(Ident,Exp)]) -getDataType ts i = - case Map.lookup i ts of - Just t -> t - Nothing -> error $ "Data type " ++ printTree i ++ " not found." - ++ " Known types: " ++ show (Map.keysSet ts) - --- --- * Utilities --- - -infixl 1 >>> - -(>>>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c -f >>> g = (g =<<) . f - -mapMinusSet :: Ord k => Map k a -> Set k -> Map k a -mapMinusSet m s = m Map.\\ (Map.fromList [(x,()) | x <- Set.toList s])