import AST
import RWST
-//Instruction is an instruction, with possible arguments and a possible comment
-//Or is a label
TRUE :== -1
FALSE :== 0
:: Instr = Instr String [Arg] String
:: Arg = L Label | Lit Int | Raw String
:: SSMProgram :== [Instr]
:: GenError = Error String
-:: GenMap :== 'Map'.Map String LoadPlace
-//completely change to either Stack, Heap, Register?
-:: LoadPlace = LDA Int | LDC Int | LDH Int | LDL Int
- | LDR Int | LDS Int
- | FUNC Label
-:: Gen a :== RWST Label SSMProgram (GenMap, [Label]) (Either GenError) a
+:: Addressbook :== 'Map'.Map String Address
+:: Address = LAB String Int | ADDR Int
+:: Gen a :== RWST () SSMProgram (Addressbook, [Label]) (Either GenError) a
labelStream :: [Label]
labelStream = ["lbl_" +++ toString i\\i<-[1..]]
+defaultAddressBook :: Addressbook
+defaultAddressBook = extend "1printint" (LAB "1printint" 1)
+ $ extend "1printchar" (LAB "1printchar" 1)
+ $ extend "1readchar" (LAB "1readchar" 0)
+ $ extend "1readint" (LAB "1readint" 0)
+ $ extend "isEmpty" (LAB "isempty" 1)
+ 'Map'.newMap
+
gen :: AST -> Either String String
-gen (AST fds) = case evalRWST prog "" ('Map'.newMap, labelStream) of
+gen (AST fds) = case evalRWST prog () (defaultAddressBook, labelStream) of
Left (Error e) = Left e
Right (_, p) = Right $ toString p
where
- prog = tell [Instr "bra" [L "main"] ""] >>| mapM_ g fds
-//gen _ = prog
-// where
-// expr = (Op2Expr zero (Op1Expr zero UnMinus (IntExpr zero 4)) BiPlus (IntExpr zero 7))
-// expr2 = (FunExpr zero "test" [IntExpr zero 4] [])
-// stmt = (IfStmt (BoolExpr zero True) [] [])
-// prog = case evalRWST (g stmt) 0 ('Map'.newMap, labelStream) of
-// Left (Error e) = abort e
-// Right (_, prog) = toString prog
-//gen _ = toString [Lab "Test"
-// ,Instr "ldc" [Lit 1] "Eerste instructie"
-// ,Instr "ldc" [Lit 2] "Tweede instructie"]
-
-//Current issues:
-//All VarDecls are added as function, how to deal with assignments?
-// (And when we deal with assignments, how to deal with assignments to higher order functions?)
-//Dealing with arguments
-//Dealing with types that do not fit on the Stack
-// Probably completely change LoadPlace to a Type and a position relative to *something*
-// And where the type determines if this position is a pointer to the heap or an
-// unboxed value
+ prog = tell [
+ Instr "bsr" [L "main"] "",
+ Instr "halt" [] ""
+ ] >>| tell programContext
+ >>| mapM_ g fds
+
+programContext :: SSMProgram
+programContext = [Lab "1printint"
+ ,Instr "link" [Lit 0] ""
+ ,Instr "ldl" [Lit -2] "load first argument"
+ ,Instr "trap" [Lit 0] "print int"
+ ,Instr "unlink" [] ""
+ ,Instr "ret" [] ""
+ ,Lab "1printchar"
+ ,Instr "link" [Lit 0] ""
+ ,Instr "ldl" [Lit -2] "load first argument"
+ ,Instr "trap" [Lit 1] "print char"
+ ,Instr "unlink" [] ""
+ ,Instr "ret" [] ""
+ ,Lab "1readint"
+ ,Instr "link" [Lit 0] ""
+ ,Instr "trap" [Lit 10] "read int"
+ ,Instr "str" [Raw "RR"] ""
+ ,Instr "unlink" [] ""
+ ,Instr "ret" [] ""
+ ,Lab "1readchar"
+ ,Instr "link" [Lit 0] ""
+ ,Instr "trap" [Lit 11] "read char"
+ ,Instr "str" [Raw "RR"] ""
+ ,Instr "unlink" [] ""
+ ,Instr "ret" [] ""
+ ,Lab "isempty"
+ ,Instr "link" [Lit 0] ""
+ ,Instr "ldl" [Lit -2] "load prt to list"
+ ,Instr "lda" [Lit 0] "derefrence ptr"
+ ,Instr "ldc" [Lit 0] ""
+ ,Instr "eq" [] "test for null pointer"
+ ,Instr "str" [Raw "RR"] ""
+ ,Instr "unlink" [] ""
+ ,Instr "ret" [] ""
+ ]
//helper functions for the gen monad
-genMap :: Gen GenMap
-genMap = gets fst
+getAdressbook :: Gen Addressbook
+getAdressbook = gets fst
-changeGenMap :: (GenMap -> GenMap) -> Gen GenMap
-changeGenMap f = modify (appFst f) >>| genMap
+updateAdressbook :: (Addressbook -> Addressbook) -> Gen Addressbook
+updateAdressbook f = modify (appFst f) >>| getAdressbook
-extend :: String LoadPlace GenMap -> GenMap
+extend :: String Address Addressbook -> Addressbook
extend k pl g = 'Map'.put k pl g
fresh :: Gen Label
class g a :: a -> Gen ()
+instance g Op1 where
+ g UnNegation = tell [Instr "not" [] ""]
+ g UnMinus = tell [Instr "neg" [] ""]
+
+instance g Op2 where
+ g o = tell [Instr s [] ""]
+ where
+ s = case o of
+ BiPlus = "add"
+ BiMinus = "sub"
+ BiTimes = "mul"
+ BiDivide = "div"
+ BiMod = "mod"
+ BiEquals = "eq"
+ BiLesser = "lt"
+ BiGreater = "gt"
+ BiLesserEq = "le"
+ BiGreaterEq = "ge"
+ BiUnEqual = "ne"
+ BiAnd = "and"
+ BiOr = "or"
+ BiCons = abort "Shit, Cons, how to deal with this?"
+
+instance g FieldSelector where
+ g FieldFst = tell [Instr "lda" [Lit 0] "fst"]
+ g FieldSnd = tell [Instr "lda" [Lit 1] "snd"]
+ g FieldHd = tell [Instr "lda" [Lit -1] "hd"]
+ g FieldTl = tell [Instr "lda" [Lit 0] "tl"]
+
instance g Expr where
- g (VarExpr _ (VarDef k fs)) = load k >>= \instr-> tell [instr] //note: pure is pure for list, i.e. []
- g (IntExpr _ i) = loadP (LDC i) >>= \instr-> tell [instr]
- g (CharExpr _ c) = abort "How to deal with chars?"
- g (BoolExpr _ True) = loadP (LDC TRUE) >>= \instr-> tell [instr]
- g (BoolExpr _ False) = loadP (LDC FALSE) >>= \instr-> tell [instr]
- g (Op2Expr _ e1 op e2) = g e1 >>| g e2 >>| tell [Instr (op2ins op) [] ""]
- g (Op1Expr _ UnNegation e) = g e >>| tell [Instr "not" [] ""]
- g (Op1Expr _ UnMinus e) = g e >>| tell [Instr "neg" [] ""]
- g (EmptyListExpr _) = abort "Shit, empty list expr"
- g (TupleExpr p (e1,e2)) = abort "How to deal with tuples?"
- g (FunExpr _ k es fs) =
- mapM g es >>| //put all arguments on the stack (todo: fix argument handling!)
- jump "bsr" k >>= \instr->
- tell [instr] >>| //actually branch to function
- tell [Instr "ldr" [Raw "RR"] ""] //push return value on stack, todo: check for VOID
+ g (IntExpr _ i) = tell [Instr "ldc" [Lit i] ""]
+ g (CharExpr _ c) = tell [Instr "ldc" [Lit (toInt c)] ""]
+ g (BoolExpr _ b) = tell [Instr "ldc" [Lit (if b TRUE FALSE)] ""]
+ g (EmptyListExpr _) = tell [Instr "ldc" [Lit 0] ""]
+ >>| tell [Instr "sth" [] ""]
+ g (Op1Expr _ o e) = g e >>| g o
+ g (Op2Expr _ e1 BiCons e2) = g e2 >>| g e1
+ >>| tell [Instr "sth" [] ""]
+ >>| tell [Instr "ajs" [Lit -1] ""]
+ >>| tell [Instr "sth" [] ""]
+ g (Op2Expr _ e1 op e2) = g e1 >>| g e2 >>| g op
+ g (TupleExpr _ (e1,e2)) = g e1
+ >>| tell [Instr "sth" [] ""]
+ >>| g e2
+ >>| tell [Instr "sth" [] ""]
+ >>| tell [Instr "ajs" [Lit -1] ""]
+ g (VarExpr _ (VarDef k fs)) = getAdressbook >>= \ab->case 'Map'.get k ab of
+ Just (ADDR t) = tell [Instr "ldl" [Lit t] ""] >>| mapM_ g fs >>| pure ()
+ _ = liftT (Left $ Error "Higher order functions not implemented")
+ g (FunExpr _ k es fs) = getAdressbook >>= \ab->case 'Map'.get k ab of
+ Just (LAB l arity) = if (arity <> (length es))
+ (liftT $ Left $ Error "Higher order functions not implemented")
+ ( mapM_ g es
+ >>| jump "bsr" k
+ >>| mapM_ (const $ tell [Instr "ajs" [Lit -1] ""]) es //clean up args
+ >>| tell [Instr "ldr" [Raw "RR"] ""])
+ _ = liftT (Left $ Error "Funcall to variable?")
+
+jump :: String String -> Gen ()
+jump instr k = getAdressbook >>= \ab->case 'Map'.get k ab of
+ Nothing = liftT (Left $ Error $ concat ["PANIC: ", k, " not found as function"])
+ Just (LAB t _) = tell [Instr instr [L t] (k +++"()")]
+ Just (ADDR t) = liftT (Left $ Error $ "PANIC: jump should go to label")
instance g Stmt where
g (IfStmt cond th el) =
tell [Instr "bra" [L startLabel] "branch start while"] >>|
tell [Lab endLabel]
g (AssStmt (VarDef k fs) e) =
- g e >>|
- abort "Shit, an assignment, figure out something with storing vars or something"
- //vars will be on stack in locals (possible pointers to heap)
- g (FunStmt _ _) = abort "CodeGen, FunStmt unused" //not used
- g (ReturnStmt Nothing) = tell [Instr "ret" [] ""] //NOTE! Assumes only return address on stack, safe?
- g (ReturnStmt (Just e)) =
- g e >>|
- tell [Instr "str" [Raw "RR"] ""] >>|
- g (ReturnStmt Nothing)
-
-instance g VarDecl where
- g (VarDecl _ Nothing _ _) = liftT (Left $ Error "PANIC: untyped vardecl")
- g (VarDecl _ (Just t) k e) =
- (\l->k+++"_"+++l) <$> fresh >>= \lbl->
- changeGenMap (extend k (FUNC lbl)) >>|
- tell [Lab lbl] >>|
- g e >>|
- tell [Instr "str" [Raw "RR"] ""] >>|
- tell [Instr "ret" [] ""]
+ g e >>| getAdressbook >>= \ab->case 'Map'.get k ab of
+ Nothing = liftT (Left $ Error $ concat ["PANIC: ", k, " not found as var"])
+ Just (LAB t _) = liftT (Left $ Error $ "PANIC: cannot assign to function")
+ Just (ADDR t) = tell [Instr "stl" [Lit t] ""]
+ g (FunStmt k es fs) = mapM_ g es
+ >>| jump "bsr" k
+ >>| mapM_ (const $ tell [Instr "ajs" [Lit -1] ""]) es //clean up args
+ >>| mapM_ g fs
+ >>| pure ()
+ g (ReturnStmt Nothing) = tell [Instr "unlink" [] ""]
+ >>| tell [Instr "ret" [] ""]
+ g (ReturnStmt (Just e)) = g e
+ >>| tell [Instr "str" [Raw "RR"] ""]
+ >>| g (ReturnStmt Nothing)
+foldVarDecl :: Int VarDecl -> Gen Int
+foldVarDecl x (VarDecl _ _ k e) = g e
+ >>| annote x k
+ >>| updateAdressbook (extend k (ADDR x)) >>| pure (x + 1)
+
+addVars :: [String] -> (Addressbook -> Addressbook)
+addVars [] = id
+addVars [x:xs] = \ab->extend x (ADDR (-2 - (length xs))) (addVars xs ab)
instance g FunDecl where
- g (FunDecl _ k _ _ vds stms) =
+ g (FunDecl _ k args _ vds stms) =
//varDecls can call the enclosing function, so first reserve a label for it
- (\l-> if (k=="main") "main" (l+++"_"+++k)) <$> fresh >>= \lbl->
- changeGenMap (extend k (FUNC lbl)) >>|
- //then generate functions for the VarDecls
- genMap >>= \oldMap ->
- mapM_ g vds >>|
- //then the main function
- tell [Lab lbl] >>|
+ updateAdressbook (extend k (LAB k (length args))) >>|
+ getAdressbook >>= \oldMap ->
+ updateAdressbook (addVars args) >>|
+ tell [Lab k] >>|
+ tell [Instr "link" [Lit 0] ""] >>|
+ //add the vars
+ foldM foldVarDecl 1 vds >>|
+ //and the statements
mapM_ g stms >>|
- changeGenMap (const oldMap) >>| pure ()
-
-op2ins :: Op2 -> String
-op2ins op = case op of
- BiPlus = "add"
- BiMinus = "sub"
- BiTimes = "mul"
- BiDivide = "div"
- BiMod = "mod"
- BiEquals = "eq"
- BiLesser = "lt"
- BiGreater = "gt"
- BiLesserEq = "le"
- BiGreaterEq = "ge"
- BiUnEqual = "ne"
- BiAnd = "and"
- BiOr = "or"
- BiCons = abort "Shit, Cons, how to deal with this?"
-
-load :: String -> Gen Instr
-load k = genMap >>= \g-> case 'Map'.member k g of
- False = liftT (Left $ Error $ concat ["PANIC: ", k, " not found in variable mapping"])
- True = loadP $ 'Map'.find k g
-
-loadP :: LoadPlace -> Gen Instr
-loadP pl = dec pl >>= \(instr, arg)-> pure $ Instr instr [arg] ""
-where
- dec (LDA i) = pure ("lda", Lit i)
- dec (LDC i) = pure ("ldc", Lit i)
- dec (LDH i) = pure ("ldh", Lit i)
- dec (LDL i) = pure ("ldl", Lit i)
- dec (LDR i) = pure ("ldr", Lit i)
- dec (LDS i) = pure ("lds", Lit i)
- dec _ = liftT (Left $ Error "PANIC: trying to load non adres")
-
-//Instruction (String), key of function to jump to
-jump :: String String -> Gen Instr
-jump instr k = genMap >>= \g-> case 'Map'.member k g of
- False = liftT (Left $ Error $ concat ["PANIC: ", k, " not found as function"])
- True = dec ('Map'.find k g) >>= \lbl-> pure $ Instr instr [lbl] (k +++"()")
-where
- dec (FUNC l) = pure (L l)
- dec _ = liftT (Left $ Error "PANIC: trying to jump to non label")
+ updateAdressbook (const oldMap) >>| pure ()
+
+annote :: Int String -> Gen ()
+annote pos key =
+ tell [Instr "annote" [Raw "MP", Lit pos, Lit pos, Raw "green", Raw key] ""]
class print a :: a -> [String]