marked alternatives for compiling tables

1 files changed, 4 insertions, 3 deletions

diff --git a/src/GF/Grammar/Compute.hs b/src/GF/Grammar/Compute.hs
index 0a2de0af7..5970d96ef 100644
--- a/src/GF/Grammar/Compute.hs
+++ b/src/GF/Grammar/Compute.hs
@@ -281,7 +281,8 @@ computeTermOpt rec gr = comp where
      T i@(TComp ty) cs -> do
        -- if there are no variables, don't even go inside
        cs' <- if (null g) then return cs else mapPairsM (comp g) cs
-       return $ {- V ty (map snd cs') --- -} T i cs'
+----       return $ V ty (map snd cs')
+       return $ T i cs'
      --- this means some extra work; should implement TSh directly
      TSh i cs -> comp g $ T i [(p,v) | (ps,v) <- cs, p <- ps]
 
@@ -296,8 +297,8 @@ computeTermOpt rec gr = comp where
            ts   <- mapM (\ (c,g') -> comp (g' ++ g) c) sts
            ps   <- mapM term2patt vs
            let ps' = ps --- PT ptyp (head ps) : tail ps
-           return $ ---- V ptyp ts -- to save space, just course of values
-                    T (TComp ptyp) (zip ps' ts)
+----           return $ V ptyp ts -- to save space, just course of values
+           return $ T (TComp ptyp) (zip ps' ts)
          _ -> do
            cs' <- mapM (compBranch g) cs
            return $ T i cs'  -- happens with variable types