1module Generate.JavaScript (generate) where
3import Control.Applicative ((<$>),(<*>))
4import Control.Arrow (first,(***))
5import Control.Monad.State
6import qualified Data.List as List
7import qualified Data.Map as Map
8import qualified Data.Set as Set
9import Language.ECMAScript3.PrettyPrint
10import Language.ECMAScript3.Syntax
12import Generate.JavaScript.Helpers as Help
13import qualified Generate.Cases as Case
14import qualified Generate.JavaScript.Ports as Port
15import qualified Generate.JavaScript.Variable as Var
19import AST.Expression.General
20import qualified AST.Expression.Canonical as Canonical
21import qualified AST.Module as Module
22import qualified AST.Helpers as Help
24import qualified AST.Pattern as P
25import qualified AST.Variable as Var
28internalImports :: Module.Name -> [VarDecl ()]
30 [ varDecl "_N" (obj ["Elm","Native"])
31 , include "_U" "Utils"
33 , include "_P" "Ports"
34 , varDecl Help.localModuleName (string (Module.nameToString name))
37 include :: String -> String -> VarDecl ()
39 varDecl alias (Help.make ["_N", modul])
42_Utils :: String -> Expression ()
47_List :: String -> Expression ()
52literal :: Literal -> Expression ()
55 Chr c -> _Utils "chr" <| string [c]
57 IntNum n -> IntLit () n
58 FloatNum n -> NumLit () n
59 Boolean b -> BoolLit () b
62expression :: Canonical.Expr -> State Int (Expression ())
63expression (A region expr) =
65 Var var -> return $ Var.canonical var
67 Literal lit -> return $ literal lit
70 do lo' <- expression lo
72 return $ _List "range" `call` [lo',hi']
76 return $ DotRef () e' (var x)
80 return $ _Utils "remove" `call` [string x, e']
85 return $ _Utils "insert" `call` [string x, v', e']
89 fs' <- forM fs $ \(f,v) -> do
91 return $ ArrayLit () [string f, v']
92 return $ _Utils "replace" `call` [ArrayLit () fs', e']
95 do fields' <- forM fields $ \(f,e) -> do
96 (,) f <$> expression e
97 let fieldMap = List.foldl' combine Map.empty fields'
98 return $ ObjectLit () $ (prop "_", hidden fieldMap) : visible fieldMap
100 combine r (k,v) = Map.insertWith (++) k [v] r
101 hidden fs = ObjectLit () . map (prop *** ArrayLit ()) .
102 Map.toList . Map.filter (not . null) $ Map.map tail fs
103 visible fs = map (first prop) . Map.toList $ Map.map head fs
105 Binop op e1 e2 -> binop region op e1 e2
107 Lambda p e@(A ann _) ->
108 do (args, body) <- foldM depattern ([], innerBody) (reverse patterns)
109 body' <- expression body
110 return $ case length args < 2 || length args > 9 of
111 True -> foldr (==>) body' (map (:[]) args)
112 False -> ref ("F" ++ show (length args)) <| (args ==> body')
114 depattern (args, body) pattern =
116 P.Var x -> return (args ++ [ Var.varName x ], body)
117 _ -> do arg <- Case.newVar
118 return ( args ++ [arg]
119 , A ann (Case (A ann (localVar arg)) [(pattern, body)]))
121 (patterns, innerBody) = collect [p] e
123 collect patterns lexpr@(A _ expr) =
125 Lambda p e -> collect (p:patterns) e
126 _ -> (patterns, lexpr)
129 do func' <- expression func
130 args' <- mapM expression args
131 return $ case args' of
132 [arg] -> func' <| arg
133 _ | length args' <= 9 -> ref aN `call` (func':args')
134 | otherwise -> foldl1 (<|) (func':args')
136 aN = "A" ++ show (length args)
137 (func, args) = getArgs e1 [e2]
140 (A _ (App f arg)) -> getArgs f (arg : args)
144 do let (defs',e') = flattenLets defs e
145 stmts <- concat <$> mapM definition defs'
147 return $ function [] (stmts ++ [ ret exp ]) `call` []
150 do branches' <- forM branches $ \(b,e) -> (,) <$> expression b <*> expression e
151 return $ case last branches of
152 (A _ (Var (Var.Canonical (Var.Module ["Basics"]) "otherwise")), _) ->
154 (A _ (Literal (Boolean True)), _) -> safeIfs branches'
155 _ -> ifs branches' (throw "badIf" region)
157 safeIfs branches = ifs (init branches) (snd (last branches))
158 ifs branches finally = foldr iff finally branches
159 iff (if', then') else' = CondExpr () if' then' else'
162 do (tempVar,initialMatch) <- Case.toMatch cases
163 (revisedMatch, stmt) <-
165 A _ (Var (Var.Canonical Var.Local x)) ->
166 return (Case.matchSubst [(tempVar, Var.varName x)] initialMatch, [])
168 do e' <- expression e
169 return (initialMatch, [VarDeclStmt () [varDecl tempVar e']])
170 match' <- match region revisedMatch
171 return (function [] (stmt ++ match') `call` [])
174 do es' <- mapM expression es
175 return $ _List "fromArray" <| ArrayLit () es'
178 do es' <- mapM expression es
179 return $ ObjectLit () (ctor : fields es')
181 ctor = (prop "ctor", string name)
182 fields = zipWith (\n e -> (prop ("_" ++ show n), e)) [0..]
184 GLShader _uid src _tipe ->
185 return $ ObjectLit () [(PropString () "src", literal (Str src))]
188 return $ obj ["_P","portIn"] `call`
189 [ string name, Port.incoming tipe ]
191 PortOut name tipe value ->
192 do value' <- expression value
193 return $ obj ["_P","portOut"] `call`
194 [ string name, Port.outgoing tipe, value' ]
197definition :: Canonical.Def -> State Int [Statement ()]
198definition (Canonical.Definition pattern expr@(A region _) _) = do
199 expr' <- expression expr
200 let assign x = varDecl x expr'
204 let op = LBracket () (ref "_op") (string x) in
205 return [ ExprStmt () $ AssignExpr () OpAssign op expr' ]
207 return [ VarDeclStmt () [ assign (Var.varName x) ] ]
210 let setField f = varDecl f (obj ["$",f]) in
211 return [ VarDeclStmt () (assign "$" : map setField fields) ]
213 P.Data (Var.Canonical _ name) patterns | vars /= Nothing ->
214 return [ VarDeclStmt () (setup (zipWith decl (maybe [] id vars) [0..])) ]
216 vars = getVars patterns
219 P.Var x : rest -> (Var.varName x :) `fmap` getVars rest
223 decl x n = varDecl x (obj ["$","_" ++ show n])
225 | Help.isTuple name = assign "$" : vars
226 | otherwise = assign "_raw" : safeAssign : vars
228 safeAssign = varDecl "$" (CondExpr () if' (ref "_raw") exception)
229 if' = InfixExpr () OpStrictEq (obj ["_raw","ctor"]) (string name)
230 exception = Help.throw "badCase" region
233 do defs' <- concat <$> mapM toDef vars
234 return (VarDeclStmt () [assign "_"] : defs')
236 vars = P.boundVarList pattern
237 mkVar = A region . localVar
239 let expr = A region $ Case (mkVar "_") [(pattern, mkVar y)]
241 definition $ Canonical.Definition (P.Var y) expr Nothing
244match :: Region -> Case.Match -> State Int [Statement ()]
247 Case.Match name clauses mtch' ->
248 do (isChars, clauses') <- unzip <$> mapM (clause region name) clauses
249 mtch'' <- match region mtch'
250 return (SwitchStmt () (format isChars (access name)) clauses' : mtch'')
252 isLiteral p = case p of
253 Case.Clause (Right _) _ _ -> True
257 | any isLiteral clauses = obj [name]
258 | otherwise = obj (Help.splitDots name ++ ["ctor"])
261 | or isChars = InfixExpr () OpAdd e (string "")
265 return [ ExprStmt () (Help.throw "badCase" region) ]
267 Case.Break -> return [BreakStmt () Nothing]
270 do e' <- expression e
273 Case.Seq ms -> concat <$> mapM (match region) (dropEnd [] ms)
278 Case.Other _ -> acc ++ [m]
279 _ -> dropEnd (acc ++ [m]) ms
282clause :: Region -> String -> Case.Clause -> State Int (Bool, CaseClause ())
283clause region variable (Case.Clause value vars mtch) =
284 (,) isChar . CaseClause () pattern <$> match region (Case.matchSubst (zip vars vars') mtch)
286 vars' = map (\n -> variable ++ "._" ++ show n) [0..]
289 Right (Chr c) -> (True, string [c])
293 Right (Boolean b) -> BoolLit () b
294 Right lit -> literal lit
295 Left (Var.Canonical _ name) ->
299flattenLets :: [Canonical.Def] -> Canonical.Expr -> ([Canonical.Def], Canonical.Expr)
300flattenLets defs lexpr@(A _ expr) =
302 Let ds body -> flattenLets (defs ++ ds) body
306generate :: CanonicalModule -> String
308 show . prettyPrint $ setup "Elm" (names ++ ["make"]) ++
309 [ assign ("Elm" : names ++ ["make"]) (function [localRuntime] programStmts) ]
312 names = Module.names modul
314 thisModule :: Expression ()
315 thisModule = obj (localRuntime : names ++ ["values"])
317 programStmts :: [Statement ()]
320 [ [ ExprStmt () (string "use strict") ]
321 , setup localRuntime (names ++ ["values"])
322 , [ IfSingleStmt () thisModule (ret thisModule) ]
323 , [ VarDeclStmt () localVars ]
329 localVars :: [VarDecl ()]
330 localVars = varDecl "_op" (ObjectLit () []) :
331 internalImports (Module.names modul) ++
334 explicitImports :: [VarDecl ()]
336 map jsImport . Set.toList . Set.fromList . map fst $ Module.imports modul
338 jsImport :: Module.Name -> VarDecl ()
340 varDecl (Var.moduleName name) $
341 obj ("Elm" : name ++ ["make"]) <| ref localRuntime
343 body :: [Statement ()]
344 body = concat $ evalState defs 0
346 defs = mapM definition . fst . flattenLets [] $ Module.program (Module.body modul)
348 setup namespace path = map create paths
350 create name = assign name (InfixExpr () OpLOr (obj name) (ObjectLit () []))
351 paths = drop 2 . init . List.inits $ namespace : path
353 jsExports = assign (localRuntime : names ++ ["values"]) (ObjectLit () exs)
355 exs = map entry $ "_op" : concatMap extract (exports modul)
356 entry x = (prop x, ref x)
363 | otherwise -> [Var.varName x]
365 Var.Union _ (Var.Listing ctors _) ->
366 map Var.varName ctors
370 [x] -> VarDeclStmt () [ varDecl x expr ]
373 AssignExpr () OpAssign (LDot () (obj (init path)) (last path)) expr
381 -> State Int (Expression ())
382binop region func@(Var.Canonical home op) e1 e2 =
384 (Var.Module ["Basics"], ">>") ->
385 do es <- mapM expression (collectLeftAssoc [e2] e1)
386 return $ ["$"] ==> List.foldl' (\e f -> f <| e) (ref "$") es
388 (Var.Module ["Basics"], "<<") ->
389 do es <- mapM expression (e1 : collectRightAssoc [] e2)
390 return $ ["$"] ==> foldr (<|) (ref "$") es
392 (Var.Module ["Basics"], "<|") ->
393 do e2' <- expression e2
394 es <- mapM expression (collectRightAssoc [] e1)
395 return $ foldr (<|) e2' es
397 (Var.BuiltIn, "::") ->
398 expression (A region (Data "::" [e1,e2]))
400 (Var.Module ["Basics"], _) ->
401 do e1' <- expression e1
403 case Map.lookup op basicOps of
408 return (ref "A2" `call` [ Var.canonical func, e1', e2' ])
411 do e1' <- expression e1
413 return (ref "A2" `call` [ Var.canonical func, e1', e2' ])
416 collectRightAssoc es e =
418 A _ (Binop (Var.Canonical (Var.Module ["Basics"]) "<<") e1 e2) ->
419 collectRightAssoc (es ++ [e1]) e2
422 collectLeftAssoc es e =
424 A _ (Binop (Var.Canonical (Var.Module ["Basics"]) ">>") e1 e2) ->
425 collectLeftAssoc (e2 : es) e1
429 Map.fromList (infixOps ++ specialOps)
432 let infixOp str op = (str, InfixExpr () op) in
437 , infixOp "&&" OpLAnd
442 [ (,) "^" $ \a b -> obj ["Math","pow"] `call` [a,b]
443 , (,) "|>" $ flip (<|)
444 , (,) "==" $ \a b -> _Utils "eq" `call` [a,b]
445 , (,) "/=" $ \a b -> PrefixExpr () PrefixLNot (_Utils "eq" `call` [a,b])
446 , (,) "<" $ cmp OpLT 0
447 , (,) ">" $ cmp OpGT 0
448 , (,) "<=" $ cmp OpLT 1
449 , (,) ">=" $ cmp OpGT (-1)
450 , (,) "//" $ \a b -> InfixExpr () OpBOr (InfixExpr () OpDiv a b) (IntLit () 0)
454 InfixExpr () op (_Utils "cmp" `call` [a,b]) (IntLit () n)
keysesc to close
- j k
- move down, up
- enter
- open
- esc
- back, or up a level
- 1 2 3 4
- readme, files, commits, refs
- /
- filter
- y
- copy the clone command
- c
- compare the chosen commit with another (or shift-click both)
- ?
- show or hide this list