diff options
| author | aarne <aarne@cs.chalmers.se> | 2008-05-21 09:26:44 +0000 |
|---|---|---|
| committer | aarne <aarne@cs.chalmers.se> | 2008-05-21 09:26:44 +0000 |
| commit | 055c0d0d5a5bb0dc75904fe53df7f2e4f5732a8f (patch) | |
| tree | 0e63fb68c69c8f6ad0f78893c63420f0a3600e1c /src-2.9/GF/Compile/RemoveLiT.hs | |
| parent | 915a1de71783ab8446b1af9e72c7ba7dfbc12d3f (diff) | |
GF/src is now for 2.9, and the new sources are in src-3.0 - keep it this way until the release of GF 3
Diffstat (limited to 'src-2.9/GF/Compile/RemoveLiT.hs')
| -rw-r--r-- | src-2.9/GF/Compile/RemoveLiT.hs | 63 |
1 files changed, 0 insertions, 63 deletions
diff --git a/src-2.9/GF/Compile/RemoveLiT.hs b/src-2.9/GF/Compile/RemoveLiT.hs deleted file mode 100644 index 28aae9b84..000000000 --- a/src-2.9/GF/Compile/RemoveLiT.hs +++ /dev/null @@ -1,63 +0,0 @@ ----------------------------------------------------------------------- --- | --- Module : RemoveLiT --- Maintainer : AR --- Stability : (stable) --- Portability : (portable) --- --- > CVS $Date: 2005/04/21 16:21:45 $ --- > CVS $Author: bringert $ --- > CVS $Revision: 1.6 $ --- --- remove obsolete (Lin C) expressions before doing anything else. AR 21/6/2003 --- --- What the program does is replace the occurrences of Lin C with the actual --- definition T given in lincat C = T ; with {s : Str} if no lincat is found. --- The procedure is uncertain, if T contains another Lin. ------------------------------------------------------------------------------ - -module GF.Compile.RemoveLiT (removeLiT) where - -import GF.Grammar.Grammar -import GF.Infra.Ident -import GF.Infra.Modules -import GF.Grammar.Macros -import GF.Grammar.Lookup - -import GF.Data.Operations - -import Control.Monad - -removeLiT :: SourceGrammar -> Err SourceGrammar -removeLiT gr = liftM MGrammar $ mapM (remlModule gr) (modules gr) - -remlModule :: SourceGrammar -> (Ident,SourceModInfo) -> Err (Ident,SourceModInfo) -remlModule gr mi@(name,mod) = case mod of - ModMod (Module mt st fs me ops js) -> do - js1 <- mapMTree (remlResInfo gr) js - let mod2 = ModMod $ Module mt st fs me ops js1 - return $ (name,mod2) - _ -> return mi - -remlResInfo :: SourceGrammar -> (Ident,Info) -> Err (Ident,Info) -remlResInfo gr mi@(i,info) = case info of - ResOper pty ptr -> liftM ((,) i) $ liftM2 ResOper (ren pty) (ren ptr) - CncCat pty ptr ppr -> liftM ((,) i) $ liftM3 CncCat (ren pty) (ren ptr) (ren ppr) - CncFun mt ptr ppr -> liftM ((,) i) $ liftM2 (CncFun mt) (ren ptr) (ren ppr) - _ -> return mi - where - ren = remlPerh gr - -remlPerh gr pt = case pt of - Yes t -> liftM Yes $ remlTerm gr t - _ -> return pt - -remlTerm :: SourceGrammar -> Term -> Err Term -remlTerm gr trm = case trm of - LiT c -> look c >>= remlTerm gr - _ -> composOp (remlTerm gr) trm - where - look c = err (const $ return defLinType) return $ lookupLincat gr m c - m = case [cnc | (cnc,ModMod m) <- modules gr, isModCnc m] of - cnc:_ -> cnc -- actually there is always exactly one - _ -> zIdent "CNC" |
