streamlined the binary operators

[proglang.git] / Typecheck.hs

diff --git a/Typecheck.hs b/Typecheck.hs
index 922264061337362de5dab48dcbdb8163b9bee8d4..6e845ba2cb56b9625570676c65e6354da53eb4ba 100644 (file)
--- a/Typecheck.hs
+++ b/Typecheck.hs
@@ -1,4 +1,4 @@
-module Typecheck where 
+module Typecheck (typeCheckExp, typeCheckStm, typeCheckVar) where 
 
 import Abssyntax
 import Control.Monad.State
@@ -8,15 +8,21 @@ import Prelude hiding (lookup)
 
 type Types = Map Ident Type
 
+inList :: Eq a => a -> [a] -> Bool
+inList _ [] = False
+inList a (x:xs) = if a == x then True else inList a xs
+
 typeCheckExp :: (MonadState Types m) => Exp -> m Type
-typeCheckExp (BExp e o e') = do
-       TInt <- typeCheckExp e
-       TInt <- typeCheckExp e'
-       return TBool
-typeCheckExp (OpExp e o e') = do
-       TInt <- typeCheckExp e
-       TInt <- typeCheckExp e'
-       return TInt
+typeCheckExp (BiOpExp e o e') = do
+       t1 <- typeCheckExp e
+       t2 <- typeCheckExp e'
+       if not(t1 == t2) then fail "" 
+               else case inList o [Eq,NEq] of
+                       True -> return TBool
+                       False -> if not(t1 == TInt) then fail "" 
+                               else case inList o [Plus,Minus,Times,Div] of
+                                       True -> return TInt
+                                       False -> return TBool
 typeCheckExp (EVar i) = typeCheckVar i
 typeCheckExp (EAss i e) = do
        a <- typeCheckVar i