fixing number of interrogatives in English Structural

src-3.0/GF/Compile/CheckGrammar.hs

@@ -336,9 +336,7 @@ computeLType gr t = do
  where
   comp ty = case ty of
     _ | Just _ <- isTypeInts ty -> return ty ---- shouldn't be needed
-      | ty == typeInt           -> return ty ---- shouldn't be needed
-      | ty == typeFloat         -> return ty ---- shouldn't be needed
-      | ty == typeError         -> return ty ---- shouldn't be needed
+      | isPredefConstant ty     -> return ty ---- shouldn't be needed
 
     Q m ident -> checkIn ("module" +++ prt m) $ do
       ty' <- checkErr (lookupResDef gr m ident) 
@@ -409,14 +407,6 @@ inferLType gr trm = case trm of
      ,
      checkErr (lookupResDef gr m ident) >>= infer
      ,
-{-
-     do
-       over <- getOverload gr Nothing trm
-       case over of
-         Just trty -> return trty
-         _ -> prtFail "not overloaded" trm
-     ,
--}
      prtFail "cannot infer type of constant" trm
      ]
 

src-3.0/GF/Grammar/PrGrammar.hs

@@ -245,7 +245,7 @@ prRefinement t = case t of
 prOperSignature :: (QIdent,Type) -> String
 prOperSignature (f, t) = prQIdent f +++ ":" +++ prt t
 
--- to look up a constant etc in a search tree
+-- to look up a constant etc in a search tree --- why here? AR 29/5/2008
 
 lookupIdent :: Ident -> BinTree Ident b -> Err b
 lookupIdent c t = case lookupTree prt c t of