author | wenzelm |
Sun, 13 Mar 2011 14:51:38 +0100 | |
changeset 41940 | a3b68a7a0e15 |
parent 41939 | eb9fb5a4d27f |
child 43326 | 47cf4bc789aa |
permissions | -rw-r--r-- |
37745
6315b6426200
checking generated code for various target languages
haftmann
parents:
37669
diff
changeset
|
1 |
(* Title: Tools/Code/code_scala.ML |
6315b6426200
checking generated code for various target languages
haftmann
parents:
37669
diff
changeset
|
2 |
Author: Florian Haftmann, TU Muenchen |
34294 | 3 |
|
4 |
Serializer for Scala. |
|
5 |
*) |
|
6 |
||
7 |
signature CODE_SCALA = |
|
8 |
sig |
|
37745
6315b6426200
checking generated code for various target languages
haftmann
parents:
37669
diff
changeset
|
9 |
val target: string |
34294 | 10 |
val setup: theory -> theory |
11 |
end; |
|
12 |
||
13 |
structure Code_Scala : CODE_SCALA = |
|
14 |
struct |
|
15 |
||
16 |
val target = "Scala"; |
|
17 |
||
18 |
open Basic_Code_Thingol; |
|
19 |
open Code_Printer; |
|
20 |
||
21 |
infixr 5 @@; |
|
22 |
infixr 5 @|; |
|
23 |
||
24 |
||
25 |
(** Scala serializer **) |
|
26 |
||
38923 | 27 |
fun print_scala_stmt labelled_name tyco_syntax const_syntax reserved |
38780
910cedb62327
stub for (later) correct deresolving of class method names
haftmann
parents:
38779
diff
changeset
|
28 |
args_num is_singleton_constr (deresolve, deresolve_full) = |
34294 | 29 |
let |
37639 | 30 |
fun lookup_tyvar tyvars = lookup_var tyvars o first_upper; |
31 |
fun intro_tyvars vs = intro_vars (map (first_upper o fst) vs); |
|
32 |
fun print_tyco_expr tyvars fxy (tyco, tys) = applify "[" "]" |
|
33 |
(print_typ tyvars NOBR) fxy ((str o deresolve) tyco) tys |
|
38923 | 34 |
and print_typ tyvars fxy (tyco `%% tys) = (case tyco_syntax tyco |
37639 | 35 |
of NONE => print_tyco_expr tyvars fxy (tyco, tys) |
34294 | 36 |
| SOME (i, print) => print (print_typ tyvars) fxy tys) |
37243
6e2ac5358d6e
capitalized type variables; added yield as keyword
haftmann
parents:
37224
diff
changeset
|
37 |
| print_typ tyvars fxy (ITyVar v) = (str o lookup_tyvar tyvars) v; |
37639 | 38 |
fun print_dicttyp tyvars (class, ty) = print_tyco_expr tyvars NOBR (class, [ty]); |
39 |
fun print_tupled_typ tyvars ([], ty) = |
|
40 |
print_typ tyvars NOBR ty |
|
41 |
| print_tupled_typ tyvars ([ty1], ty2) = |
|
42 |
concat [print_typ tyvars BR ty1, str "=>", print_typ tyvars NOBR ty2] |
|
43 |
| print_tupled_typ tyvars (tys, ty) = |
|
44 |
concat [enum "," "(" ")" (map (print_typ tyvars NOBR) tys), |
|
45 |
str "=>", print_typ tyvars NOBR ty]; |
|
46 |
fun constraint p1 p2 = Pretty.block [p1, str ":", Pretty.brk 1, p2]; |
|
34294 | 47 |
fun print_var vars NONE = str "_" |
48 |
| print_var vars (SOME v) = (str o lookup_var vars) v |
|
35228 | 49 |
fun print_term tyvars is_pat some_thm vars fxy (IConst c) = |
50 |
print_app tyvars is_pat some_thm vars fxy (c, []) |
|
51 |
| print_term tyvars is_pat some_thm vars fxy (t as (t1 `$ t2)) = |
|
34294 | 52 |
(case Code_Thingol.unfold_const_app t |
35228 | 53 |
of SOME app => print_app tyvars is_pat some_thm vars fxy app |
37639 | 54 |
| _ => applify "(" ")" (print_term tyvars is_pat some_thm vars NOBR) fxy |
55 |
(print_term tyvars is_pat some_thm vars BR t1) [t2]) |
|
35228 | 56 |
| print_term tyvars is_pat some_thm vars fxy (IVar v) = |
34294 | 57 |
print_var vars v |
35228 | 58 |
| print_term tyvars is_pat some_thm vars fxy ((v, ty) `|=> t) = |
34294 | 59 |
let |
60 |
val vars' = intro_vars (the_list v) vars; |
|
61 |
in |
|
62 |
concat [ |
|
37639 | 63 |
enclose "(" ")" [constraint (print_var vars' v) (print_typ tyvars NOBR ty)], |
34294 | 64 |
str "=>", |
35228 | 65 |
print_term tyvars false some_thm vars' NOBR t |
34294 | 66 |
] |
41939 | 67 |
end |
35228 | 68 |
| print_term tyvars is_pat some_thm vars fxy (ICase (cases as (_, t0))) = |
34294 | 69 |
(case Code_Thingol.unfold_const_app t0 |
38923 | 70 |
of SOME (c_ts as ((c, _), _)) => if is_none (const_syntax c) |
35228 | 71 |
then print_case tyvars some_thm vars fxy cases |
72 |
else print_app tyvars is_pat some_thm vars fxy c_ts |
|
73 |
| NONE => print_case tyvars some_thm vars fxy cases) |
|
37464 | 74 |
and print_app tyvars is_pat some_thm vars fxy |
75 |
(app as ((c, ((arg_typs, _), function_typs)), ts)) = |
|
34294 | 76 |
let |
77 |
val k = length ts; |
|
37450 | 78 |
val arg_typs' = if is_pat orelse |
38923 | 79 |
(is_none (const_syntax c) andalso is_singleton_constr c) then [] else arg_typs; |
80 |
val (l, print') = case const_syntax c |
|
38059 | 81 |
of NONE => (args_num c, fn fxy => fn ts => applify "(" ")" |
37639 | 82 |
(print_term tyvars is_pat some_thm vars NOBR) fxy |
83 |
(applify "[" "]" (print_typ tyvars NOBR) |
|
84 |
NOBR ((str o deresolve) c) arg_typs') ts) |
|
38059 | 85 |
| SOME (Plain_const_syntax (k, s)) => (k, fn fxy => fn ts => applify "(" ")" |
37881 | 86 |
(print_term tyvars is_pat some_thm vars NOBR) fxy |
87 |
(applify "[" "]" (print_typ tyvars NOBR) |
|
88 |
NOBR (str s) arg_typs') ts) |
|
89 |
| SOME (Complex_const_syntax (k, print)) => |
|
38059 | 90 |
(k, fn fxy => fn ts => print (print_term tyvars is_pat some_thm) some_thm vars fxy |
37881 | 91 |
(ts ~~ take k function_typs)) |
38059 | 92 |
in if k = l then print' fxy ts |
34294 | 93 |
else if k < l then |
35228 | 94 |
print_term tyvars is_pat some_thm vars fxy (Code_Thingol.eta_expand l app) |
34294 | 95 |
else let |
96 |
val (ts1, ts23) = chop l ts; |
|
97 |
in |
|
38059 | 98 |
Pretty.block (print' BR ts1 :: map (fn t => Pretty.block |
35228 | 99 |
[str ".apply(", print_term tyvars is_pat some_thm vars NOBR t, str ")"]) ts23) |
34294 | 100 |
end end |
37464 | 101 |
and print_bind tyvars some_thm fxy p = |
102 |
gen_print_bind (print_term tyvars true) some_thm fxy p |
|
35228 | 103 |
and print_case tyvars some_thm vars fxy (cases as ((_, [_]), _)) = |
34294 | 104 |
let |
41781
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
105 |
val (bind :: binds, body) = Code_Thingol.unfold_let (ICase cases); |
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
106 |
fun print_match_val ((pat, ty), t) vars = |
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
107 |
vars |
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
108 |
|> print_bind tyvars some_thm BR pat |
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
109 |
|>> (fn p => (false, concat [str "val", constraint p (print_typ tyvars NOBR ty), |
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
110 |
str "=", print_term tyvars false some_thm vars NOBR t])); |
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
111 |
fun print_match_seq t vars = |
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
112 |
((true, print_term tyvars false some_thm vars NOBR t), vars); |
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
113 |
fun print_match is_first ((IVar NONE, ty), t) = |
41784 | 114 |
if Code_Thingol.is_IAbs t andalso is_first |
41781
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
115 |
then print_match_val ((IVar NONE, ty), t) |
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
116 |
else print_match_seq t |
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
117 |
| print_match _ ((pat, ty), t) = |
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
118 |
print_match_val ((pat, ty), t); |
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
119 |
val (seps_ps, vars') = |
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
120 |
vars |> print_match true bind ||>> fold_map (print_match false) binds |>> uncurry cons; |
38059 | 121 |
val all_seps_ps = seps_ps @ [(true, print_term tyvars false some_thm vars' NOBR body)]; |
122 |
fun insert_seps [(_, p)] = [p] |
|
123 |
| insert_seps ((_, p) :: (seps_ps as (sep, _) :: _)) = |
|
124 |
(if sep then Pretty.block [p, str ";"] else p) :: insert_seps seps_ps |
|
41781
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
125 |
in brackify_block fxy (str "{") (insert_seps all_seps_ps) (str "}") end |
35228 | 126 |
| print_case tyvars some_thm vars fxy (((t, ty), clauses as _ :: _), _) = |
34294 | 127 |
let |
128 |
fun print_select (pat, body) = |
|
129 |
let |
|
37464 | 130 |
val (p_pat, vars') = print_bind tyvars some_thm NOBR pat vars; |
131 |
val p_body = print_term tyvars false some_thm vars' NOBR body |
|
132 |
in concat [str "case", p_pat, str "=>", p_body] end; |
|
34294 | 133 |
in brackify_block fxy |
35228 | 134 |
(concat [print_term tyvars false some_thm vars NOBR t, str "match", str "{"]) |
34294 | 135 |
(map print_select clauses) |
41939 | 136 |
(str "}") |
34294 | 137 |
end |
35228 | 138 |
| print_case tyvars some_thm vars fxy ((_, []), _) = |
34294 | 139 |
(brackify fxy o Pretty.breaks o map str) ["error(\"empty case\")"]; |
37639 | 140 |
fun print_context tyvars vs name = applify "[" "]" |
141 |
(fn (v, sort) => (Pretty.block o map str) |
|
41781
32a7726d2136
more idiomatic printing of let cascades and type variable constraints
haftmann
parents:
41687
diff
changeset
|
142 |
(lookup_tyvar tyvars v :: maps (fn sort => [" : ", deresolve sort]) sort)) |
38809
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
143 |
NOBR ((str o deresolve) name) vs; |
37639 | 144 |
fun print_defhead tyvars vars name vs params tys ty = |
145 |
Pretty.block [str "def ", constraint (applify "(" ")" (fn (param, ty) => |
|
146 |
constraint ((str o lookup_var vars) param) (print_typ tyvars NOBR ty)) |
|
147 |
NOBR (print_context tyvars vs name) (params ~~ tys)) (print_typ tyvars NOBR ty), |
|
148 |
str " ="]; |
|
149 |
fun print_def name (vs, ty) [] = |
|
150 |
let |
|
151 |
val (tys, ty') = Code_Thingol.unfold_fun ty; |
|
152 |
val params = Name.invents (snd reserved) "a" (length tys); |
|
153 |
val tyvars = intro_tyvars vs reserved; |
|
154 |
val vars = intro_vars params reserved; |
|
155 |
in |
|
156 |
concat [print_defhead tyvars vars name vs params tys ty', |
|
157 |
str ("error(\"" ^ name ^ "\")")] |
|
158 |
end |
|
159 |
| print_def name (vs, ty) eqs = |
|
160 |
let |
|
161 |
val tycos = fold (fn ((ts, t), _) => |
|
162 |
fold Code_Thingol.add_tyconames (t :: ts)) eqs []; |
|
163 |
val tyvars = reserved |
|
164 |
|> intro_base_names |
|
38923 | 165 |
(is_none o tyco_syntax) deresolve tycos |
37639 | 166 |
|> intro_tyvars vs; |
167 |
val simple = case eqs |
|
168 |
of [((ts, _), _)] => forall Code_Thingol.is_IVar ts |
|
169 |
| _ => false; |
|
170 |
val consts = fold Code_Thingol.add_constnames |
|
171 |
(map (snd o fst) eqs) []; |
|
172 |
val vars1 = reserved |
|
173 |
|> intro_base_names |
|
38923 | 174 |
(is_none o const_syntax) deresolve consts |
37639 | 175 |
val params = if simple |
176 |
then (map (fn IVar (SOME x) => x) o fst o fst o hd) eqs |
|
177 |
else aux_params vars1 (map (fst o fst) eqs); |
|
178 |
val vars2 = intro_vars params vars1; |
|
179 |
val (tys', ty') = Code_Thingol.unfold_fun_n (length params) ty; |
|
38922 | 180 |
fun tuplify [p] = p |
181 |
| tuplify ps = enum "," "(" ")" ps; |
|
37639 | 182 |
fun print_rhs vars' ((_, t), (some_thm, _)) = |
183 |
print_term tyvars false some_thm vars' NOBR t; |
|
184 |
fun print_clause (eq as ((ts, _), (some_thm, _))) = |
|
34294 | 185 |
let |
37639 | 186 |
val vars' = intro_vars ((fold o Code_Thingol.fold_varnames) |
187 |
(insert (op =)) ts []) vars1; |
|
188 |
in |
|
189 |
concat [str "case", |
|
38922 | 190 |
tuplify (map (print_term tyvars true some_thm vars' NOBR) ts), |
37639 | 191 |
str "=>", print_rhs vars' eq] |
192 |
end; |
|
193 |
val head = print_defhead tyvars vars2 name vs params tys' ty'; |
|
194 |
in if simple then |
|
195 |
concat [head, print_rhs vars2 (hd eqs)] |
|
196 |
else |
|
197 |
Pretty.block_enclose |
|
38922 | 198 |
(concat [head, tuplify (map (str o lookup_var vars2) params), |
37639 | 199 |
str "match", str "{"], str "}") |
200 |
(map print_clause eqs) |
|
201 |
end; |
|
39023 | 202 |
val print_method = str o Library.enclose "`" "`" o deresolve_full; |
37639 | 203 |
fun print_stmt (name, Code_Thingol.Fun (_, (((vs, ty), raw_eqs), _))) = |
204 |
print_def name (vs, ty) (filter (snd o snd) raw_eqs) |
|
34294 | 205 |
| print_stmt (name, Code_Thingol.Datatype (_, (vs, cos))) = |
206 |
let |
|
37639 | 207 |
val tyvars = intro_tyvars vs reserved; |
37450 | 208 |
fun print_co ((co, _), []) = |
38809
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
209 |
concat [str "final", str "case", str "object", (str o deresolve) co, |
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
210 |
str "extends", applify "[" "]" I NOBR ((str o deresolve) name) |
34294 | 211 |
(replicate (length vs) (str "Nothing"))] |
37450 | 212 |
| print_co ((co, vs_args), tys) = |
37639 | 213 |
concat [applify "(" ")" |
214 |
(fn (v, arg) => constraint (str v) (print_typ tyvars NOBR arg)) NOBR |
|
215 |
(applify "[" "]" (str o lookup_tyvar tyvars) NOBR ((concat o map str) |
|
38809
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
216 |
["final", "case", "class", deresolve co]) vs_args) |
37639 | 217 |
(Name.names (snd reserved) "a" tys), |
218 |
str "extends", |
|
219 |
applify "[" "]" (str o lookup_tyvar tyvars o fst) NOBR |
|
38809
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
220 |
((str o deresolve) name) vs |
37639 | 221 |
]; |
34294 | 222 |
in |
37639 | 223 |
Pretty.chunks (applify "[" "]" (str o prefix "+" o lookup_tyvar tyvars o fst) |
38809
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
224 |
NOBR ((concat o map str) ["abstract", "sealed", "class", deresolve name]) vs |
37639 | 225 |
:: map print_co cos) |
34294 | 226 |
end |
37447
ad3e04f289b6
transitive superclasses were also only a misunderstanding
haftmann
parents:
37446
diff
changeset
|
227 |
| print_stmt (name, Code_Thingol.Class (_, (v, (super_classes, classparams)))) = |
34294 | 228 |
let |
37639 | 229 |
val tyvars = intro_tyvars [(v, [name])] reserved; |
230 |
fun add_typarg s = Pretty.block |
|
231 |
[str s, str "[", (str o lookup_tyvar tyvars) v, str "]"]; |
|
37384
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37337
diff
changeset
|
232 |
fun print_super_classes [] = NONE |
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37337
diff
changeset
|
233 |
| print_super_classes classes = SOME (concat (str "extends" |
37639 | 234 |
:: separate (str "with") (map (add_typarg o deresolve o fst) classes))); |
34294 | 235 |
fun print_classparam_val (classparam, ty) = |
37639 | 236 |
concat [str "val", constraint (print_method classparam) |
237 |
((print_tupled_typ tyvars o Code_Thingol.unfold_fun) ty)]; |
|
34294 | 238 |
fun print_classparam_def (classparam, ty) = |
239 |
let |
|
240 |
val (tys, ty) = Code_Thingol.unfold_fun ty; |
|
37639 | 241 |
val [implicit_name] = Name.invents (snd reserved) (lookup_tyvar tyvars v) 1; |
242 |
val proto_vars = intro_vars [implicit_name] reserved; |
|
243 |
val auxs = Name.invents (snd proto_vars) "a" (length tys); |
|
244 |
val vars = intro_vars auxs proto_vars; |
|
34294 | 245 |
in |
37639 | 246 |
concat [str "def", constraint (Pretty.block [applify "(" ")" |
247 |
(fn (aux, ty) => constraint ((str o lookup_var vars) aux) |
|
38809
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
248 |
(print_typ tyvars NOBR ty)) NOBR (add_typarg (deresolve classparam)) |
37639 | 249 |
(auxs ~~ tys), str "(implicit ", str implicit_name, str ": ", |
250 |
add_typarg (deresolve name), str ")"]) (print_typ tyvars NOBR ty), str "=", |
|
251 |
applify "(" ")" (str o lookup_var vars) NOBR |
|
252 |
(Pretty.block [str implicit_name, str ".", print_method classparam]) auxs] |
|
34294 | 253 |
end; |
254 |
in |
|
255 |
Pretty.chunks ( |
|
256 |
(Pretty.block_enclose |
|
38809
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
257 |
(concat ([str "trait", (add_typarg o deresolve) name] |
37384
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37337
diff
changeset
|
258 |
@ the_list (print_super_classes super_classes) @ [str "{"]), str "}") |
34294 | 259 |
(map print_classparam_val classparams)) |
260 |
:: map print_classparam_def classparams |
|
261 |
) |
|
262 |
end |
|
263 |
| print_stmt (name, Code_Thingol.Classinst ((class, (tyco, vs)), |
|
37450 | 264 |
(super_instances, (classparam_instances, further_classparam_instances)))) = |
34294 | 265 |
let |
37639 | 266 |
val tyvars = intro_tyvars vs reserved; |
267 |
val classtyp = (class, tyco `%% map (ITyVar o fst) vs); |
|
37450 | 268 |
fun print_classparam_instance ((classparam, const as (_, (_, tys))), (thm, _)) = |
269 |
let |
|
37639 | 270 |
val aux_tys = Name.names (snd reserved) "a" tys; |
271 |
val auxs = map fst aux_tys; |
|
37450 | 272 |
val vars = intro_vars auxs reserved; |
37639 | 273 |
val aux_abstr = if null auxs then [] else [enum "," "(" ")" |
274 |
(map (fn (aux, ty) => constraint ((str o lookup_var vars) aux) |
|
275 |
(print_typ tyvars NOBR ty)) aux_tys), str "=>"]; |
|
41939 | 276 |
in |
37639 | 277 |
concat ([str "val", print_method classparam, str "="] |
278 |
@ aux_abstr @| print_app tyvars false (SOME thm) vars NOBR |
|
279 |
(const, map (IVar o SOME) auxs)) |
|
37450 | 280 |
end; |
37639 | 281 |
in |
282 |
Pretty.block_enclose (concat [str "implicit def", |
|
283 |
constraint (print_context tyvars vs name) (print_dicttyp tyvars classtyp), |
|
284 |
str "=", str "new", print_dicttyp tyvars classtyp, str "{"], str "}") |
|
285 |
(map print_classparam_instance (classparam_instances @ further_classparam_instances)) |
|
286 |
end; |
|
34294 | 287 |
in print_stmt end; |
288 |
||
38779 | 289 |
fun scala_program_of_program labelled_name reserved module_alias program = |
34294 | 290 |
let |
38809
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
291 |
fun namify_module name_fragment ((nsp_class, nsp_object), nsp_common) = |
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
292 |
let |
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
293 |
val declare = Name.declare name_fragment; |
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
294 |
in (name_fragment, ((declare nsp_class, declare nsp_object), declare nsp_common)) end; |
38769
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
295 |
fun namify_class base ((nsp_class, nsp_object), nsp_common) = |
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
296 |
let |
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
297 |
val (base', nsp_class') = yield_singleton Name.variants base nsp_class |
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
298 |
in (base', ((nsp_class', nsp_object), Name.declare base' nsp_common)) end; |
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
299 |
fun namify_object base ((nsp_class, nsp_object), nsp_common) = |
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
300 |
let |
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
301 |
val (base', nsp_object') = yield_singleton Name.variants base nsp_object |
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
302 |
in (base', ((nsp_class, nsp_object'), Name.declare base' nsp_common)) end; |
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
303 |
fun namify_common upper base ((nsp_class, nsp_object), nsp_common) = |
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
304 |
let |
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
305 |
val (base', nsp_common') = |
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
306 |
yield_singleton Name.variants (if upper then first_upper base else base) nsp_common |
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
307 |
in |
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
308 |
(base', |
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
309 |
((Name.declare base' nsp_class, Name.declare base' nsp_object), nsp_common')) |
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
310 |
end; |
38809
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
311 |
fun namify_stmt (Code_Thingol.Fun _) = namify_object |
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
312 |
| namify_stmt (Code_Thingol.Datatype _) = namify_class |
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
313 |
| namify_stmt (Code_Thingol.Datatypecons _) = namify_common true |
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
314 |
| namify_stmt (Code_Thingol.Class _) = namify_class |
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
315 |
| namify_stmt (Code_Thingol.Classrel _) = namify_object |
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
316 |
| namify_stmt (Code_Thingol.Classparam _) = namify_object |
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
317 |
| namify_stmt (Code_Thingol.Classinst _) = namify_common false; |
38970
53d1ee3d98b8
factored out generic part of Scala serializer into code_namespace.ML
haftmann
parents:
38966
diff
changeset
|
318 |
fun memorize_implicits name = |
38769
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
319 |
let |
38970
53d1ee3d98b8
factored out generic part of Scala serializer into code_namespace.ML
haftmann
parents:
38966
diff
changeset
|
320 |
fun is_classinst stmt = case stmt |
53d1ee3d98b8
factored out generic part of Scala serializer into code_namespace.ML
haftmann
parents:
38966
diff
changeset
|
321 |
of Code_Thingol.Classinst _ => true |
53d1ee3d98b8
factored out generic part of Scala serializer into code_namespace.ML
haftmann
parents:
38966
diff
changeset
|
322 |
| _ => false; |
53d1ee3d98b8
factored out generic part of Scala serializer into code_namespace.ML
haftmann
parents:
38966
diff
changeset
|
323 |
val implicits = filter (is_classinst o Graph.get_node program) |
53d1ee3d98b8
factored out generic part of Scala serializer into code_namespace.ML
haftmann
parents:
38966
diff
changeset
|
324 |
(Graph.imm_succs program name); |
53d1ee3d98b8
factored out generic part of Scala serializer into code_namespace.ML
haftmann
parents:
38966
diff
changeset
|
325 |
in union (op =) implicits end; |
39059
3a11a667af75
restored and added surpression of case combinators
haftmann
parents:
39058
diff
changeset
|
326 |
fun modify_stmt (_, Code_Thingol.Fun (_, (_, SOME _))) = NONE |
3a11a667af75
restored and added surpression of case combinators
haftmann
parents:
39058
diff
changeset
|
327 |
| modify_stmt (_, Code_Thingol.Datatypecons _) = NONE |
39024
30d5dd2f30b6
simultaneous modification of statements: statement names
haftmann
parents:
39023
diff
changeset
|
328 |
| modify_stmt (_, Code_Thingol.Classrel _) = NONE |
30d5dd2f30b6
simultaneous modification of statements: statement names
haftmann
parents:
39023
diff
changeset
|
329 |
| modify_stmt (_, Code_Thingol.Classparam _) = NONE |
30d5dd2f30b6
simultaneous modification of statements: statement names
haftmann
parents:
39023
diff
changeset
|
330 |
| modify_stmt (_, stmt) = SOME stmt; |
38970
53d1ee3d98b8
factored out generic part of Scala serializer into code_namespace.ML
haftmann
parents:
38966
diff
changeset
|
331 |
in |
41939 | 332 |
Code_Namespace.hierarchical_program labelled_name |
333 |
{ module_alias = module_alias, reserved = reserved, |
|
334 |
empty_nsp = ((reserved, reserved), reserved), namify_module = namify_module, |
|
335 |
namify_stmt = namify_stmt, cyclic_modules = true, empty_data = [], |
|
336 |
memorize_data = memorize_implicits, modify_stmts = map modify_stmt } program |
|
38970
53d1ee3d98b8
factored out generic part of Scala serializer into code_namespace.ML
haftmann
parents:
38966
diff
changeset
|
337 |
end; |
34294 | 338 |
|
38928 | 339 |
fun serialize_scala { labelled_name, reserved_syms, includes, |
41343 | 340 |
module_alias, class_syntax, tyco_syntax, const_syntax } program = |
34294 | 341 |
let |
38769
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
342 |
|
38809
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
343 |
(* build program *) |
39147 | 344 |
val { deresolver, hierarchical_program = scala_program } = |
39030
2bb34f36db80
include names need not be considered as reserved any longer
haftmann
parents:
39024
diff
changeset
|
345 |
scala_program_of_program labelled_name (Name.make_context reserved_syms) module_alias program; |
38769
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
346 |
|
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
347 |
(* print statements *) |
37639 | 348 |
fun lookup_constr tyco constr = case Graph.get_node program tyco |
349 |
of Code_Thingol.Datatype (_, (_, constrs)) => |
|
350 |
the (AList.lookup (op = o apsnd fst) constrs constr); |
|
351 |
fun classparams_of_class class = case Graph.get_node program class |
|
352 |
of Code_Thingol.Class (_, (_, (_, classparams))) => classparams; |
|
34294 | 353 |
fun args_num c = case Graph.get_node program c |
37464 | 354 |
of Code_Thingol.Fun (_, (((_, ty), []), _)) => |
355 |
(length o fst o Code_Thingol.unfold_fun) ty |
|
37437 | 356 |
| Code_Thingol.Fun (_, ((_, ((ts, _), _) :: _), _)) => length ts |
37639 | 357 |
| Code_Thingol.Datatypecons (_, tyco) => length (lookup_constr tyco c) |
34294 | 358 |
| Code_Thingol.Classparam (_, class) => |
37639 | 359 |
(length o fst o Code_Thingol.unfold_fun o the o AList.lookup (op =) |
360 |
(classparams_of_class class)) c; |
|
361 |
fun is_singleton_constr c = case Graph.get_node program c |
|
362 |
of Code_Thingol.Datatypecons (_, tyco) => null (lookup_constr tyco c) |
|
34294 | 363 |
| _ => false; |
39147 | 364 |
fun print_stmt prefix_fragments = print_scala_stmt labelled_name |
365 |
tyco_syntax const_syntax (make_vars reserved_syms) args_num |
|
366 |
is_singleton_constr (deresolver prefix_fragments, deresolver []); |
|
38769
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
367 |
|
39147 | 368 |
(* print modules *) |
38809
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
369 |
fun print_implicit prefix_fragments implicit = |
38782 | 370 |
let |
38809
7dc73a208722
proper namespace administration for hierarchical modules
haftmann
parents:
38782
diff
changeset
|
371 |
val s = deresolver prefix_fragments implicit; |
38782 | 372 |
in if length (Long_Name.explode s) = 1 then NONE else SOME (str s) end; |
39147 | 373 |
fun print_module prefix_fragments base implicits ps = Pretty.chunks2 |
374 |
([str ("object " ^ base ^ " {")] |
|
375 |
@ (case map_filter (print_implicit prefix_fragments) implicits |
|
376 |
of [] => [] | implicit_ps => (single o Pretty.block) |
|
377 |
(str "import /*implicits*/" :: Pretty.brk 1 :: commas implicit_ps)) |
|
378 |
@ ps @ [str ("} /* object " ^ base ^ " */")]); |
|
38769
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
379 |
|
317e64c886d2
preliminary implementation of hierarchical module name space
haftmann
parents:
38059
diff
changeset
|
380 |
(* serialization *) |
39147 | 381 |
val p = Pretty.chunks2 (map snd includes |
382 |
@ Code_Namespace.print_hierarchical { |
|
383 |
print_module = print_module, print_stmt = print_stmt, |
|
384 |
lift_markup = I } scala_program); |
|
39056 | 385 |
fun write width NONE = writeln o format [] width |
386 |
| write width (SOME p) = File.write p o format [] width; |
|
34294 | 387 |
in |
39102 | 388 |
Code_Target.serialization write (rpair (try (deresolver [])) ooo format) p |
34294 | 389 |
end; |
390 |
||
38966 | 391 |
val serializer : Code_Target.serializer = |
392 |
Code_Target.parse_args (Scan.succeed ()) #> K serialize_scala; |
|
393 |
||
34294 | 394 |
val literals = let |
37224 | 395 |
fun char_scala c = if c = "'" then "\\'" |
396 |
else if c = "\"" then "\\\"" |
|
397 |
else if c = "\\" then "\\\\" |
|
398 |
else let val k = ord c |
|
399 |
in if k < 32 orelse k > 126 then "\\" ^ radixstring (8, "0", k) else c end |
|
34944
970e1466028d
code literals: distinguish numeral classes by different entries
haftmann
parents:
34900
diff
changeset
|
400 |
fun numeral_scala k = if k < 0 |
37958
9728342bcd56
another refinement chapter in the neverending numeral story
haftmann
parents:
37932
diff
changeset
|
401 |
then if k > ~ 2147483647 then "- " ^ string_of_int (~ k) |
34944
970e1466028d
code literals: distinguish numeral classes by different entries
haftmann
parents:
34900
diff
changeset
|
402 |
else quote ("- " ^ string_of_int (~ k)) |
970e1466028d
code literals: distinguish numeral classes by different entries
haftmann
parents:
34900
diff
changeset
|
403 |
else if k <= 2147483647 then string_of_int k |
970e1466028d
code literals: distinguish numeral classes by different entries
haftmann
parents:
34900
diff
changeset
|
404 |
else quote (string_of_int k) |
34294 | 405 |
in Literals { |
406 |
literal_char = Library.enclose "'" "'" o char_scala, |
|
407 |
literal_string = quote o translate_string char_scala, |
|
34944
970e1466028d
code literals: distinguish numeral classes by different entries
haftmann
parents:
34900
diff
changeset
|
408 |
literal_numeral = fn k => "BigInt(" ^ numeral_scala k ^ ")", |
38968
e55deaa22fff
do not print object frame around Scala includes -- this is in the responsibility of the user
haftmann
parents:
38966
diff
changeset
|
409 |
literal_positive_numeral = fn k => "Nat(" ^ numeral_scala k ^ ")", |
e55deaa22fff
do not print object frame around Scala includes -- this is in the responsibility of the user
haftmann
parents:
38966
diff
changeset
|
410 |
literal_alternative_numeral = fn k => "Natural(" ^ numeral_scala k ^ ")", |
37958
9728342bcd56
another refinement chapter in the neverending numeral story
haftmann
parents:
37932
diff
changeset
|
411 |
literal_naive_numeral = fn k => "BigInt(" ^ numeral_scala k ^ ")", |
34888 | 412 |
literal_list = fn [] => str "Nil" | ps => Pretty.block [str "List", enum "," "(" ")" ps], |
34294 | 413 |
infix_cons = (6, "::") |
414 |
} end; |
|
415 |
||
416 |
||
417 |
(** Isar setup **) |
|
418 |
||
419 |
val setup = |
|
37821 | 420 |
Code_Target.add_target |
38966 | 421 |
(target, { serializer = serializer, literals = literals, |
41939 | 422 |
check = { env_var = "SCALA_HOME", |
423 |
make_destination = fn p => Path.append p (Path.explode "ROOT.scala"), |
|
41940 | 424 |
make_command = fn _ => |
425 |
"env JAVA_OPTS='-Xms128m -Xmx512m -Xss2m' \"$SCALA_HOME/bin/scalac\" ROOT.scala" } }) |
|
38923 | 426 |
#> Code_Target.add_tyco_syntax target "fun" |
37464 | 427 |
(SOME (2, fn print_typ => fn fxy => fn [ty1, ty2] => |
428 |
brackify_infix (1, R) fxy ( |
|
429 |
print_typ BR ty1 (*product type vs. tupled arguments!*), |
|
430 |
str "=>", |
|
431 |
print_typ (INFX (1, R)) ty2 |
|
432 |
))) |
|
34294 | 433 |
#> fold (Code_Target.add_reserved target) [ |
434 |
"abstract", "case", "catch", "class", "def", "do", "else", "extends", "false", |
|
435 |
"final", "finally", "for", "forSome", "if", "implicit", "import", "lazy", |
|
436 |
"match", "new", "null", "object", "override", "package", "private", "protected", |
|
437 |
"requires", "return", "sealed", "super", "this", "throw", "trait", "try", |
|
37243
6e2ac5358d6e
capitalized type variables; added yield as keyword
haftmann
parents:
37224
diff
changeset
|
438 |
"true", "type", "val", "var", "while", "with", "yield" |
34294 | 439 |
] |
440 |
#> fold (Code_Target.add_reserved target) [ |
|
39781 | 441 |
"apply", "error", "scala", "BigInt", "Nil", "List" |
34294 | 442 |
]; |
443 |
||
444 |
end; (*struct*) |