lamb/interp.hs

87 lines
2.2 KiB
Haskell
Raw Normal View History

2013-10-18 01:58:41 +00:00
import Control.Monad.State (State, runState, evalState, get, put)
import qualified Data.Map as M
data AST = Add AST AST
| Def String AST
| Var String
2013-10-18 03:46:34 +00:00
| Call String [AST]
2013-10-18 01:58:41 +00:00
| StrConst String
| IntConst Int
deriving (Show, Eq)
2013-10-18 03:46:34 +00:00
data Pattern = VarP String
deriving (Show, Eq)
2013-10-18 01:58:41 +00:00
data Value = IntV Int
| StrV String
2013-10-18 03:46:34 +00:00
| FnV [ ([Pattern], [AST]) ] -- pattern->body bindings
2013-10-18 01:58:41 +00:00
deriving (Show, Eq)
type Env = M.Map String Value -- an environment
type InterpState = State Env -- interpreter state (pass along the global environment)
(IntV l) +$ (IntV r) = IntV (l + r)
(StrV l) +$ (StrV r) = StrV (l ++ r)
l +$ r = error $ "cannot + " ++ show l ++ " and " ++ show r
2013-10-18 03:46:34 +00:00
initialState = M.fromList [("id", FnV [([VarP "x"], [Var "x"])])]
2013-10-18 01:58:41 +00:00
eval :: AST -> InterpState Value
eval (IntConst i) = return $ IntV i
eval (StrConst s) = return $ StrV s
eval (Var var) = get >>= \m ->
case M.lookup var m of
Just v -> return v
Nothing -> error $ "unbound variable " ++ var
eval (Def name v') = do
v <- eval v'
m <- get
put $ M.insert name v m
return v
eval (Add l r) = do
l <- eval l
r <- eval r
return $ l +$ r
2013-10-18 03:46:34 +00:00
eval (Call name args) = get >>= \m ->
case M.lookup name m of
Just fn@(FnV _) ->
do
xargs <- mapM eval args
apply fn xargs
Nothing -> error $ "call: name " ++ name ++ " doesn't exist or is not a function"
patternBindings :: Pattern -> Value -> Maybe Env
patternBindings (VarP n) v = Just $ M.fromList [(n, v)]
-- applies a function
apply :: Value -> [Value] -> InterpState Value
apply (FnV pats) args =
apply' pats args
where
apply' (([pat], body):xs) (arg:argxs) = -- todo: more than one argument
case patternBindings pat arg of
Just env' -> -- satisfies
do
env <- get
put $ M.union env env'
foldr1 (>>) $ map eval body
Nothing -> error "doesn't satisfy"
2013-10-18 01:58:41 +00:00
evalProgram :: [AST] -> Value -- fold the state from each node and return the result
2013-10-18 03:46:34 +00:00
evalProgram nodes = evalState (foldr1 (>>) $ map eval nodes) initialState
2013-10-18 01:58:41 +00:00
main = do
print $ evalProgram prg
print $ evalProgram prg2
2013-10-18 03:46:34 +00:00
print $ evalProgram prg3
2013-10-18 01:58:41 +00:00
where
prg = [Def "x" (IntConst 5),
Def "y" (IntConst 3),
Add (Var "x") (Var "y")]
2013-10-18 03:46:34 +00:00
prg2 = [Add (StrConst "hi ") (StrConst "there")]
prg3 = [Call "id" [IntConst 20]]