mirror of
https://github.com/GrammaticalFramework/gf-core.git
synced 2026-04-09 04:59:31 -06:00
281 lines
9.6 KiB
Haskell
281 lines
9.6 KiB
Haskell
----------------------------------------------------------------------
|
|
-- |
|
|
-- Module : Optimize
|
|
-- Maintainer : AR
|
|
-- Stability : (stable)
|
|
-- Portability : (portable)
|
|
--
|
|
-- > CVS $Date: 2005/09/16 13:56:13 $
|
|
-- > CVS $Author: aarne $
|
|
-- > CVS $Revision: 1.18 $
|
|
--
|
|
-- Top-level partial evaluation for GF source modules.
|
|
-----------------------------------------------------------------------------
|
|
|
|
module GF.Compile.Optimize (optimizeModule) where
|
|
|
|
import GF.Grammar.Grammar
|
|
import GF.Infra.Ident
|
|
import GF.Infra.Modules
|
|
import GF.Grammar.PrGrammar
|
|
import GF.Grammar.Macros
|
|
import GF.Grammar.Lookup
|
|
import GF.Grammar.Refresh
|
|
import GF.Grammar.Compute
|
|
import GF.Compile.BackOpt
|
|
import GF.Compile.CheckGrammar
|
|
import GF.Compile.Update
|
|
|
|
import GF.Data.Operations
|
|
import GF.Infra.CheckM
|
|
import GF.Infra.Option
|
|
|
|
import Control.Monad
|
|
import Data.List
|
|
|
|
-- | partial evaluation of concrete syntax. AR 6\/2001 -- 16\/5\/2003 -- 5\/2\/2005.
|
|
-- only do this for resource: concrete is optimized in gfc form
|
|
optimizeModule :: Options -> [(Ident,SourceModInfo)] -> (Ident,SourceModInfo) ->
|
|
Err (Ident,SourceModInfo)
|
|
optimizeModule opts ms mo@(_,mi) = case mi of
|
|
ModMod m0@(Module mt st fs me ops js) | st == MSComplete && isModRes m0 -> do
|
|
mo1 <- evalModule oopts ms mo
|
|
return $ case optim of
|
|
"parametrize" -> shareModule paramOpt mo1 -- parametrization and sharing
|
|
"values" -> shareModule valOpt mo1 -- tables as courses-of-values
|
|
"share" -> shareModule shareOpt mo1 -- sharing of branches
|
|
"all" -> shareModule allOpt mo1 -- first parametrize then values
|
|
"none" -> mo1 -- no optimization
|
|
_ -> mo1 -- none; default for src
|
|
_ -> evalModule oopts ms mo
|
|
where
|
|
oopts = addOptions opts (iOpts (flagsModule mo))
|
|
optim = maybe "none" id $ getOptVal oopts useOptimizer
|
|
|
|
evalModule :: Options -> [(Ident,SourceModInfo)] -> (Ident,SourceModInfo) ->
|
|
Err (Ident,SourceModInfo)
|
|
evalModule oopts ms mo@(name,mod) = case mod of
|
|
|
|
ModMod m0@(Module mt st fs me ops js) | st == MSComplete -> case mt of
|
|
_ | isModRes m0 -> do
|
|
let deps = allOperDependencies name js
|
|
ids <- topoSortOpers deps
|
|
MGrammar (mod' : _) <- foldM evalOp gr ids
|
|
return $ mod'
|
|
MTConcrete a -> do
|
|
js' <- mapMTree (evalCncInfo oopts gr0 name a) js
|
|
return $ (name, ModMod (Module mt st fs me ops js'))
|
|
|
|
_ -> return $ (name,mod)
|
|
_ -> return $ (name,mod)
|
|
where
|
|
gr0 = MGrammar $ ms
|
|
gr = MGrammar $ (name,mod) : ms
|
|
|
|
evalOp g@(MGrammar ((_, ModMod m) : _)) i = do
|
|
info <- lookupTree prt i $ jments m
|
|
info' <- evalResInfo oopts gr (i,info)
|
|
return $ updateRes g name i info'
|
|
|
|
-- | only operations need be compiled in a resource, and this is local to each
|
|
-- definition since the module is traversed in topological order
|
|
evalResInfo :: Options -> SourceGrammar -> (Ident,Info) -> Err Info
|
|
evalResInfo oopts gr (c,info) = case info of
|
|
|
|
ResOper pty pde -> eIn "operation" $ do
|
|
pde' <- case pde of
|
|
Yes de | optres -> liftM yes $ comp de
|
|
_ -> return pde
|
|
return $ ResOper pty pde'
|
|
|
|
_ -> return info
|
|
where
|
|
comp = if optres then computeConcrete gr else computeConcreteRec gr
|
|
eIn cat = errIn ("Error optimizing" +++ cat +++ prt c +++ ":")
|
|
optim = maybe "none" id $ getOptVal oopts useOptimizer
|
|
optres = case optim of
|
|
"noexpand" -> False
|
|
_ -> True
|
|
|
|
|
|
evalCncInfo ::
|
|
Options -> SourceGrammar -> Ident -> Ident -> (Ident,Info) -> Err (Ident,Info)
|
|
evalCncInfo opts gr cnc abs (c,info) = errIn ("optimizing" +++ prt c) $ case info of
|
|
|
|
CncCat ptyp pde ppr -> do
|
|
|
|
pde' <- case (ptyp,pde) of
|
|
(Yes typ, Yes de) ->
|
|
liftM yes $ pEval ([(strVar, typeStr)], typ) de
|
|
(Yes typ, Nope) ->
|
|
liftM yes $ mkLinDefault gr typ >>= partEval noOptions gr ([(strVar, typeStr)],typ)
|
|
(May b, Nope) ->
|
|
return $ May b
|
|
_ -> return pde -- indirection
|
|
|
|
ppr' <- liftM yes $ evalPrintname gr c ppr (yes $ K $ prt c)
|
|
|
|
return (c, CncCat ptyp pde' ppr')
|
|
|
|
CncFun (mt@(Just (_,ty@(cont,val)))) pde ppr ->
|
|
eIn ("linearization in type" +++ prt (mkProd (cont,val,[])) ++++ "of function") $ do
|
|
pde' <- case pde of
|
|
Yes de -> do
|
|
liftM yes $ pEval ty de
|
|
_ -> return pde
|
|
ppr' <- liftM yes $ evalPrintname gr c ppr pde'
|
|
return $ (c, CncFun mt pde' ppr') -- only cat in type actually needed
|
|
|
|
_ -> return (c,info)
|
|
where
|
|
pEval = partEval opts gr
|
|
eIn cat = errIn ("Error optimizing" +++ cat +++ prt c +++ ":")
|
|
|
|
-- | the main function for compiling linearizations
|
|
partEval :: Options -> SourceGrammar -> (Context,Type) -> Term -> Err Term
|
|
partEval opts gr (context, val) trm = errIn ("parteval" +++ prt_ trm) $ do
|
|
let vars = map fst context
|
|
args = map Vr vars
|
|
subst = [(v, Vr v) | v <- vars]
|
|
trm1 = mkApp trm args
|
|
trm3 <- if globalTable
|
|
then etaExpand trm1 >>= comp subst >>= outCase subst
|
|
else etaExpand trm1 >>= comp subst
|
|
return $ mkAbs vars trm3
|
|
|
|
where
|
|
|
|
globalTable = oElem showAll opts --- i -all
|
|
|
|
comp g t = {- refreshTerm t >>= -} computeTerm gr g t
|
|
|
|
etaExpand t = recordExpand val t --- >>= caseEx -- done by comp
|
|
|
|
outCase subst t = do
|
|
pts <- getParams context
|
|
let (args,ptyps) = unzip $ filter (flip occur t . fst) pts
|
|
if null args
|
|
then return t
|
|
else do
|
|
let argtyp = RecType $ tuple2recordType ptyps
|
|
let pvars = map (Vr . zIdent . prt) args -- gets eliminated
|
|
patt <- term2patt $ R $ tuple2record $ pvars
|
|
let t' = replace (zip args pvars) t
|
|
t1 <- comp subst $ T (TTyped argtyp) [(patt, t')]
|
|
return $ S t1 $ R $ tuple2record args
|
|
|
|
--- notice: this assumes that all lin types follow the "old JFP style"
|
|
getParams = liftM concat . mapM getParam
|
|
getParam (argv,RecType rs) = return
|
|
[(P (Vr argv) lab, ptyp) | (lab,ptyp) <- rs, not (isLinLabel lab)]
|
|
---getParam (_,ty) | ty==typeStr = return [] --- in lindef
|
|
getParam (av,ty) =
|
|
Bad ("record type expected not" +++ prt ty +++ "for" +++ prt av)
|
|
--- all lin types are rec types
|
|
|
|
replace :: [(Term,Term)] -> Term -> Term
|
|
replace reps trm = case trm of
|
|
-- this is the important case
|
|
P _ _ -> maybe trm id $ lookup trm reps
|
|
_ -> composSafeOp (replace reps) trm
|
|
|
|
occur t trm = case trm of
|
|
|
|
-- this is the important case
|
|
P _ _ -> t == trm
|
|
S x y -> occur t y || occur t x
|
|
App f x -> occur t x || occur t f
|
|
Abs _ f -> occur t f
|
|
R rs -> any (occur t) (map (snd . snd) rs)
|
|
T _ cs -> any (occur t) (map snd cs)
|
|
C x y -> occur t x || occur t y
|
|
Glue x y -> occur t x || occur t y
|
|
ExtR x y -> occur t x || occur t y
|
|
FV ts -> any (occur t) ts
|
|
V _ ts -> any (occur t) ts
|
|
Let (_,(_,x)) y -> occur t x || occur t y
|
|
_ -> False
|
|
|
|
|
|
-- here we must be careful not to reduce
|
|
-- variants {{s = "Auto" ; g = N} ; {s = "Wagen" ; g = M}}
|
|
-- {s = variants {"Auto" ; "Wagen"} ; g = variants {N ; M}} ;
|
|
|
|
recordExpand :: Type -> Term -> Err Term
|
|
recordExpand typ trm = case unComputed typ of
|
|
RecType tys -> case trm of
|
|
FV rs -> return $ FV [R [assign lab (P r lab) | (lab,_) <- tys] | r <- rs]
|
|
_ -> return $ R [assign lab (P trm lab) | (lab,_) <- tys]
|
|
_ -> return trm
|
|
|
|
|
|
-- | auxiliaries for compiling the resource
|
|
allOperDependencies :: Ident -> BinTree Ident Info -> [(Ident,[Ident])]
|
|
allOperDependencies m b =
|
|
[(f, nub (opty pty ++ opty pt)) | (f, ResOper pty pt) <- tree2list b]
|
|
where
|
|
opersIn t = case t of
|
|
Q n c | n == m -> [c]
|
|
_ -> collectOp opersIn t
|
|
opty (Yes ty) = opersIn ty
|
|
opty _ = []
|
|
|
|
topoSortOpers :: [(Ident,[Ident])] -> Err [Ident]
|
|
topoSortOpers st = do
|
|
let eops = topoTest st
|
|
either return (\ops -> Bad ("circular operations" +++ unwords (map prt (head ops)))) eops
|
|
|
|
mkLinDefault :: SourceGrammar -> Type -> Err Term
|
|
mkLinDefault gr typ = do
|
|
case unComputed typ of
|
|
RecType lts -> mapPairsM mkDefField lts >>= (return . Abs strVar . R . mkAssign)
|
|
_ -> prtBad "linearization type must be a record type, not" typ
|
|
where
|
|
mkDefField typ = case unComputed typ of
|
|
Table p t -> do
|
|
t' <- mkDefField t
|
|
let T _ cs = mkWildCases t'
|
|
return $ T (TWild p) cs
|
|
Sort "Str" -> return $ Vr strVar
|
|
QC q p -> lookupFirstTag gr q p
|
|
RecType r -> do
|
|
let (ls,ts) = unzip r
|
|
ts' <- mapM mkDefField ts
|
|
return $ R $ [assign l t | (l,t) <- zip ls ts']
|
|
_ | isTypeInts typ -> return $ EInt 0 -- exists in all as first val
|
|
_ -> prtBad "linearization type field cannot be" typ
|
|
|
|
-- | Form the printname: if given, compute. If not, use the computed
|
|
-- lin for functions, cat name for cats (dispatch made in evalCncDef above).
|
|
--- We cannot use linearization at this stage, since we do not know the
|
|
--- defaults we would need for question marks - and we're not yet in canon.
|
|
evalPrintname :: SourceGrammar -> Ident -> MPr -> Perh Term -> Err Term
|
|
evalPrintname gr c ppr lin =
|
|
case ppr of
|
|
Yes pr -> comp pr
|
|
_ -> case lin of
|
|
Yes t -> return $ K $ clean $ prt $ oneBranch t ---- stringFromTerm
|
|
_ -> return $ K $ prt c ----
|
|
where
|
|
comp = computeConcrete gr
|
|
|
|
oneBranch t = case t of
|
|
Abs _ b -> oneBranch b
|
|
R (r:_) -> oneBranch $ snd $ snd r
|
|
T _ (c:_) -> oneBranch $ snd c
|
|
V _ (c:_) -> oneBranch c
|
|
FV (t:_) -> oneBranch t
|
|
C x y -> C (oneBranch x) (oneBranch y)
|
|
S x _ -> oneBranch x
|
|
P x _ -> oneBranch x
|
|
Alts (d,_) -> oneBranch d
|
|
_ -> t
|
|
|
|
--- very unclean cleaner
|
|
clean s = case s of
|
|
'+':'+':' ':cs -> clean cs
|
|
'"':cs -> clean cs
|
|
c:cs -> c: clean cs
|
|
_ -> s
|
|
|