author | haftmann |
Mon, 23 Oct 2006 11:17:24 +0200 | |
changeset 21094 | 7e18c11e6267 |
parent 21093 | 7ad7a12c0712 |
child 21122 | b1fdd08e0ea3 |
permissions | -rw-r--r-- |
18169
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
1 |
(* Title: Pure/Tools/codegen_serializer.ML |
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
2 |
ID: $Id$ |
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
3 |
Author: Florian Haftmann, TU Muenchen |
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
4 |
|
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
5 |
Serializer from intermediate language ("Thin-gol") to |
20699 | 6 |
target languages (like SML or Haskell). |
18169
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
7 |
*) |
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
8 |
|
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
9 |
signature CODEGEN_SERIALIZER = |
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
10 |
sig |
20456 | 11 |
include BASIC_CODEGEN_THINGOL; |
20931 | 12 |
|
20699 | 13 |
val add_pretty_list: string -> string -> string -> (Pretty.T list -> Pretty.T) |
14 |
-> ((string -> string) * (string -> string)) option -> int * string |
|
15 |
-> theory -> theory; |
|
16 |
val add_pretty_ml_string: string -> string -> string -> string |
|
17 |
-> (string -> string) -> (string -> string) -> string -> theory -> theory; |
|
18 |
val add_undefined: string -> string -> string -> theory -> theory; |
|
20896 | 19 |
|
20 |
type serializer; |
|
21 |
val add_serializer : string * serializer -> theory -> theory; |
|
21015 | 22 |
val get_serializer: theory -> string -> Args.T list |
20931 | 23 |
-> string list option -> CodegenThingol.code -> unit; |
21082 | 24 |
val assert_serializer: theory -> string -> string; |
20931 | 25 |
|
26 |
val const_has_serialization: theory -> string list -> string -> bool; |
|
27 |
val tyco_has_serialization: theory -> string list -> string -> bool; |
|
28 |
||
29 |
val eval_verbose: bool ref; |
|
30 |
val eval_term: theory -> |
|
31 |
(string * 'a option ref) * CodegenThingol.iterm -> CodegenThingol.code |
|
32 |
-> 'a; |
|
21067 | 33 |
val sml_code_width: int ref; |
18169
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
34 |
end; |
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
35 |
|
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
36 |
structure CodegenSerializer: CODEGEN_SERIALIZER = |
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
37 |
struct |
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
38 |
|
19167
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19150
diff
changeset
|
39 |
open BasicCodegenThingol; |
20845 | 40 |
val tracing = CodegenThingol.tracing; |
18850 | 41 |
|
20896 | 42 |
(** syntax **) |
43 |
||
44 |
(* basics *) |
|
18702 | 45 |
|
18216 | 46 |
datatype lrx = L | R | X; |
47 |
||
18516 | 48 |
datatype fixity = |
18216 | 49 |
BR |
50 |
| NOBR |
|
51 |
| INFX of (int * lrx); |
|
52 |
||
20699 | 53 |
type 'a pretty_syntax = int * (fixity -> (fixity -> 'a -> Pretty.T) |
18865 | 54 |
-> 'a list -> Pretty.T); |
18516 | 55 |
|
18216 | 56 |
fun eval_lrx L L = false |
57 |
| eval_lrx R R = false |
|
58 |
| eval_lrx _ _ = true; |
|
59 |
||
18704
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
60 |
fun eval_fxy NOBR _ = false |
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
61 |
| eval_fxy _ BR = true |
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
62 |
| eval_fxy _ NOBR = false |
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
63 |
| eval_fxy (INFX (pr, lr)) (INFX (pr_ctxt, lr_ctxt)) = |
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
64 |
pr < pr_ctxt |
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
65 |
orelse pr = pr_ctxt |
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
66 |
andalso eval_lrx lr lr_ctxt |
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
67 |
| eval_fxy _ (INFX _) = false; |
18216 | 68 |
|
18704
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
69 |
fun gen_brackify _ [p] = p |
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
70 |
| gen_brackify true (ps as _::_) = Pretty.enclose "(" ")" ps |
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
71 |
| gen_brackify false (ps as _::_) = Pretty.block ps; |
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
72 |
|
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
73 |
fun brackify fxy_ctxt ps = |
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
74 |
gen_brackify (eval_fxy BR fxy_ctxt) (Pretty.breaks ps); |
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
75 |
|
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
76 |
fun brackify_infix infx fxy_ctxt ps = |
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
77 |
gen_brackify (eval_fxy (INFX infx) fxy_ctxt) (Pretty.breaks ps); |
18216 | 78 |
|
20976 | 79 |
fun mk_app mk_app' from_expr const_syntax fxy (app as ((c, (_, ty)), ts)) = |
20191 | 80 |
case const_syntax c |
20976 | 81 |
of NONE => brackify fxy (mk_app' app) |
20699 | 82 |
| SOME (i, pr) => |
83 |
let |
|
84 |
val k = if i < 0 then (length o fst o CodegenThingol.unfold_fun) ty else i |
|
20976 | 85 |
in if k <= length ts |
86 |
then case chop i ts of (ts1, ts2) => |
|
87 |
brackify fxy (pr fxy from_expr ts1 :: map (from_expr BR) ts2) |
|
88 |
else from_expr fxy (CodegenThingol.eta_expand app k) |
|
20699 | 89 |
end; |
90 |
||
20896 | 91 |
val first_upper = implode o nth_map 0 Symbol.to_ascii_upper o explode; |
20699 | 92 |
|
93 |
||
20896 | 94 |
(* user-defined syntax *) |
20699 | 95 |
|
20896 | 96 |
val str = setmp print_mode [] Pretty.str; |
20699 | 97 |
|
98 |
val (atomK, infixK, infixlK, infixrK) = |
|
99 |
("target_atom", "infix", "infixl", "infixr"); |
|
100 |
val _ = OuterSyntax.add_keywords [atomK, infixK, infixlK, infixrK]; |
|
101 |
||
102 |
datatype 'a mixfix = |
|
103 |
Arg of fixity |
|
20931 | 104 |
| Pretty of Pretty.T; |
18865 | 105 |
|
18704
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
106 |
fun fillin_mixfix fxy_this ms fxy_ctxt pr args = |
18702 | 107 |
let |
108 |
fun fillin [] [] = |
|
19008 | 109 |
[] |
18702 | 110 |
| fillin (Arg fxy :: ms) (a :: args) = |
111 |
pr fxy a :: fillin ms args |
|
112 |
| fillin (Pretty p :: ms) args = |
|
113 |
p :: fillin ms args |
|
19008 | 114 |
| fillin [] _ = |
20389 | 115 |
error ("Inconsistent mixfix: too many arguments") |
19008 | 116 |
| fillin _ [] = |
20389 | 117 |
error ("Inconsistent mixfix: too less arguments"); |
18704
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
118 |
in gen_brackify (eval_fxy fxy_this fxy_ctxt) (fillin ms args) end; |
18702 | 119 |
|
120 |
fun parse_infix (fixity as INFX (i, x)) s = |
|
121 |
let |
|
122 |
val l = case x of L => fixity |
|
123 |
| _ => INFX (i, X); |
|
124 |
val r = case x of R => fixity |
|
125 |
| _ => INFX (i, X); |
|
126 |
in |
|
20931 | 127 |
[Arg l, (Pretty o Pretty.brk) 1, (Pretty o str) s, (Pretty o Pretty.brk) 1, Arg r] |
18702 | 128 |
end; |
129 |
||
20931 | 130 |
fun parse_mixfix s = |
18335 | 131 |
let |
20931 | 132 |
val sym_any = Scan.one Symbol.not_eof; |
18702 | 133 |
val parse = Scan.repeat ( |
20931 | 134 |
($$ "_" -- $$ "_" >> K (Arg NOBR)) |
135 |
|| ($$ "_" >> K (Arg BR)) |
|
136 |
|| ($$ "/" |-- Scan.repeat ($$ " ") >> (Pretty o Pretty.brk o length)) |
|
18702 | 137 |
|| (Scan.repeat1 |
20931 | 138 |
( $$ "'" |-- sym_any |
139 |
|| Scan.unless ($$ "_" || $$ "/") |
|
18702 | 140 |
sym_any) >> (Pretty o str o implode))); |
20931 | 141 |
in case Scan.finite Symbol.stopper parse (Symbol.explode s) |
142 |
of (p, []) => p |
|
21067 | 143 |
| _ => Scan.fail_with (fn _ => "Malformed mixfix annotation: " ^ quote s) () |
18702 | 144 |
end; |
145 |
||
21015 | 146 |
fun parse_syntax tokens = |
18335 | 147 |
let |
18702 | 148 |
fun is_arg (Arg _) = true |
149 |
| is_arg _ = false; |
|
20931 | 150 |
fun parse_nonatomic s = |
151 |
case parse_mixfix s |
|
152 |
of [Pretty _] => |
|
21067 | 153 |
Scan.fail_with (fn _ => "Mixfix contains just one pretty element; either declare as " |
154 |
^ quote atomK ^ " or consider adding a break") () |
|
20439 | 155 |
| x => x; |
21015 | 156 |
fun mk fixity mfx = |
20931 | 157 |
let |
158 |
val i = (length o List.filter is_arg) mfx; |
|
159 |
in (i, fillin_mixfix fixity mfx) end; |
|
20456 | 160 |
val parse = ( |
20439 | 161 |
OuterParse.$$$ infixK |-- OuterParse.nat |
162 |
>> (fn i => (parse_infix (INFX (i, X)), INFX (i, X))) |
|
163 |
|| OuterParse.$$$ infixlK |-- OuterParse.nat |
|
164 |
>> (fn i => (parse_infix (INFX (i, L)), INFX (i, L))) |
|
165 |
|| OuterParse.$$$ infixrK |-- OuterParse.nat |
|
166 |
>> (fn i => (parse_infix (INFX (i, R)), INFX (i, R))) |
|
20931 | 167 |
|| OuterParse.$$$ atomK |-- pair (parse_mixfix, NOBR) |
20439 | 168 |
|| pair (parse_nonatomic, BR) |
20456 | 169 |
) -- OuterParse.string >> (fn ((p, fxy), s) => (p s, fxy)); |
18702 | 170 |
in |
21015 | 171 |
(parse >> (fn (mfx, fixity) => mk fixity mfx)) tokens |
18702 | 172 |
end; |
173 |
||
21082 | 174 |
fun parse_args f args = |
175 |
case f args |
|
176 |
of (x, []) => x |
|
177 |
| (_, _) => error "bad serializer arguments"; |
|
178 |
||
18702 | 179 |
|
20896 | 180 |
(* list and string serializer *) |
20401 | 181 |
|
182 |
fun implode_list c_nil c_cons e = |
|
18704
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
183 |
let |
19202 | 184 |
fun dest_cons (IConst (c, _) `$ e1 `$ e2) = |
20401 | 185 |
if c = c_cons |
18704
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
186 |
then SOME (e1, e2) |
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
187 |
else NONE |
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
188 |
| dest_cons _ = NONE; |
20401 | 189 |
val (es, e') = CodegenThingol.unfoldr dest_cons e; |
190 |
in case e' |
|
191 |
of IConst (c, _) => if c = c_nil then SOME es else NONE |
|
192 |
| _ => NONE |
|
193 |
end; |
|
194 |
||
195 |
fun implode_string mk_char mk_string es = |
|
196 |
if forall (fn IChar _ => true | _ => false) es |
|
21015 | 197 |
then (SOME o str o mk_string o implode o map (fn IChar c => mk_char c)) es |
20401 | 198 |
else NONE; |
199 |
||
200 |
fun pretty_ml_string c_nil c_cons mk_char mk_string target_implode = |
|
201 |
let |
|
202 |
fun pretty fxy pr [e] = |
|
203 |
case implode_list c_nil c_cons e |
|
204 |
of SOME es => (case implode_string mk_char mk_string es |
|
205 |
of SOME p => p |
|
206 |
| NONE => Pretty.block [str target_implode, Pretty.brk 1, pr BR e]) |
|
207 |
| NONE => Pretty.block [str target_implode, Pretty.brk 1, pr BR e] |
|
20699 | 208 |
in (1, pretty) end; |
20401 | 209 |
|
210 |
fun pretty_list c_nil c_cons mk_list mk_char_string (target_fxy, target_cons) = |
|
211 |
let |
|
212 |
fun default fxy pr e1 e2 = |
|
213 |
brackify_infix (target_fxy, R) fxy [ |
|
214 |
pr (INFX (target_fxy, X)) e1, |
|
18704
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
215 |
str target_cons, |
20401 | 216 |
pr (INFX (target_fxy, R)) e2 |
18704
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
217 |
]; |
20401 | 218 |
fun pretty fxy pr [e1, e2] = |
219 |
case Option.map (cons e1) (implode_list c_nil c_cons e2) |
|
220 |
of SOME es => |
|
221 |
(case mk_char_string |
|
222 |
of SOME (mk_char, mk_string) => |
|
223 |
(case implode_string mk_char mk_string es |
|
224 |
of SOME p => p |
|
225 |
| NONE => mk_list (map (pr NOBR) es)) |
|
226 |
| NONE => mk_list (map (pr NOBR) es)) |
|
227 |
| NONE => default fxy pr e1 e2; |
|
20699 | 228 |
in (2, pretty) end; |
18704
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
229 |
|
2c86ced392a8
substantial improvement in serialization handling
haftmann
parents:
18702
diff
changeset
|
230 |
|
21082 | 231 |
(* misc *) |
20896 | 232 |
|
233 |
fun constructive_fun (name, (eqs, ty)) = |
|
18216 | 234 |
let |
20699 | 235 |
val is_cons = CodegenNames.has_nsp CodegenNames.nsp_dtco; |
20896 | 236 |
fun is_pat (IConst (c, _)) = is_cons c |
237 |
| is_pat (IVar _) = true |
|
238 |
| is_pat (t1 `$ t2) = |
|
239 |
is_pat t1 andalso is_pat t2 |
|
240 |
| is_pat (INum _) = true |
|
241 |
| is_pat (IChar _) = true |
|
242 |
| is_pat _ = false; |
|
243 |
fun check_eq (eq as (lhs, rhs)) = |
|
244 |
if forall is_pat lhs |
|
245 |
then SOME eq |
|
246 |
else (warning ("In function " ^ quote name ^ ", throwing away one " |
|
247 |
^ "non-executable function clause"); NONE) |
|
248 |
in case map_filter check_eq eqs |
|
249 |
of [] => error ("In function " ^ quote name ^ ", no " |
|
250 |
^ "executable function clauses found") |
|
251 |
| eqs => (name, (eqs, ty)) |
|
252 |
end; |
|
253 |
||
21082 | 254 |
fun dest_name name = |
255 |
let |
|
256 |
val (names, name_base) = (split_last o NameSpace.unpack) name; |
|
257 |
val (names_mod, name_shallow) = split_last names; |
|
258 |
in (names_mod, (name_shallow, name_base)) end; |
|
259 |
||
20896 | 260 |
|
21015 | 261 |
|
20896 | 262 |
(** SML serializer **) |
263 |
||
264 |
datatype ml_def = |
|
265 |
MLFuns of (string * ((iterm list * iterm) list * typscheme)) list |
|
266 |
| MLDatas of (string * ((vname * sort) list * (string * itype list) list)) list |
|
267 |
| MLClass of string * (class list * (vname * (string * itype) list)) |
|
268 |
| MLClassinst of string * ((class * (string * (vname * sort) list)) |
|
269 |
* ((class * (string * inst list list)) list |
|
270 |
* (string * iterm) list)); |
|
271 |
||
272 |
fun pr_sml_def tyco_syntax const_syntax keyword_vars deresolv ml_def = |
|
273 |
let |
|
274 |
val is_cons = CodegenNames.has_nsp CodegenNames.nsp_dtco; |
|
275 |
fun dictvar v = |
|
20699 | 276 |
first_upper v ^ "_"; |
20896 | 277 |
val label = translate_string (fn "." => "__" | c => c) |
278 |
o NameSpace.pack o op @ o apsnd single o apfst (fst o split_last) o split_last o NameSpace.unpack; |
|
279 |
fun pr_tyvar (v, []) = |
|
19953
2f54a51f1801
class package refinements, slight code generation refinements
haftmann
parents:
19936
diff
changeset
|
280 |
str "()" |
20896 | 281 |
| pr_tyvar (v, sort) = |
19953
2f54a51f1801
class package refinements, slight code generation refinements
haftmann
parents:
19936
diff
changeset
|
282 |
let |
20896 | 283 |
fun pr_class class = |
284 |
str ("'" ^ v ^ " " ^ deresolv class); |
|
19953
2f54a51f1801
class package refinements, slight code generation refinements
haftmann
parents:
19936
diff
changeset
|
285 |
in |
2f54a51f1801
class package refinements, slight code generation refinements
haftmann
parents:
19936
diff
changeset
|
286 |
Pretty.block [ |
2f54a51f1801
class package refinements, slight code generation refinements
haftmann
parents:
19936
diff
changeset
|
287 |
str "(", |
20896 | 288 |
(str o dictvar) v, |
19953
2f54a51f1801
class package refinements, slight code generation refinements
haftmann
parents:
19936
diff
changeset
|
289 |
str ":", |
2f54a51f1801
class package refinements, slight code generation refinements
haftmann
parents:
19936
diff
changeset
|
290 |
case sort |
20896 | 291 |
of [class] => pr_class class |
292 |
| _ => Pretty.enum " *" "" "" (map pr_class sort), |
|
293 |
str ")" |
|
19953
2f54a51f1801
class package refinements, slight code generation refinements
haftmann
parents:
19936
diff
changeset
|
294 |
] |
2f54a51f1801
class package refinements, slight code generation refinements
haftmann
parents:
19936
diff
changeset
|
295 |
end; |
20896 | 296 |
fun pr_insts fxy iys = |
18885 | 297 |
let |
20896 | 298 |
fun pr_proj s = str ("#" ^ s); |
299 |
fun pr_lookup [] p = |
|
20401 | 300 |
p |
20896 | 301 |
| pr_lookup [p'] p = |
302 |
brackify BR [p', p] |
|
303 |
| pr_lookup (ps as _ :: _) p = |
|
304 |
brackify BR [Pretty.enum " o" "(" ")" ps, p]; |
|
305 |
fun pr_inst fxy (Instance (inst, iss)) = |
|
18885 | 306 |
brackify fxy ( |
20896 | 307 |
(str o deresolv) inst |
308 |
:: map (pr_insts BR) iss |
|
18885 | 309 |
) |
20896 | 310 |
| pr_inst fxy (Context (classes, (v, i))) = |
311 |
pr_lookup (map (pr_proj o label) classes |
|
312 |
@ (if i = ~1 then [] else [(pr_proj o string_of_int) (i+1)]) |
|
313 |
) ((str o dictvar) v); |
|
314 |
in case iys |
|
19253 | 315 |
of [] => str "()" |
20896 | 316 |
| [iy] => pr_inst fxy iy |
317 |
| _ :: _ => (Pretty.list "(" ")" o map (pr_inst NOBR)) iys |
|
18885 | 318 |
end; |
20896 | 319 |
fun pr_tycoexpr fxy (tyco, tys) = |
18963 | 320 |
let |
20896 | 321 |
val tyco' = (str o deresolv) tyco |
322 |
in case map (pr_typ BR) tys |
|
18963 | 323 |
of [] => tyco' |
324 |
| [p] => Pretty.block [p, Pretty.brk 1, tyco'] |
|
325 |
| (ps as _::_) => Pretty.block [Pretty.list "(" ")" ps, Pretty.brk 1, tyco'] |
|
326 |
end |
|
20896 | 327 |
and pr_typ fxy (tyco `%% tys) = |
18702 | 328 |
(case tyco_syntax tyco |
20896 | 329 |
of NONE => pr_tycoexpr fxy (tyco, tys) |
20699 | 330 |
| SOME (i, pr) => |
331 |
if not (i = length tys) |
|
20389 | 332 |
then error ("Number of argument mismatch in customary serialization: " |
18865 | 333 |
^ (string_of_int o length) tys ^ " given, " |
20699 | 334 |
^ string_of_int i ^ " expected") |
20896 | 335 |
else pr fxy pr_typ tys) |
336 |
| pr_typ fxy (t1 `-> t2) = |
|
337 |
(gen_brackify (case fxy of BR => false | _ => eval_fxy (INFX (1, R)) fxy) |
|
338 |
o Pretty.breaks) [ |
|
339 |
pr_typ (INFX (1, X)) t1, |
|
18702 | 340 |
str "->", |
20896 | 341 |
pr_typ (INFX (1, R)) t2 |
18702 | 342 |
] |
20896 | 343 |
| pr_typ fxy (ITyVar v) = |
18885 | 344 |
str ("'" ^ v); |
20896 | 345 |
fun pr_term vars fxy (IConst c) = |
346 |
pr_app vars fxy (c, []) |
|
347 |
| pr_term vars fxy (IVar v) = |
|
21082 | 348 |
str (CodegenThingol.lookup_var vars v) |
20896 | 349 |
| pr_term vars fxy (t as t1 `$ t2) = |
350 |
(case CodegenThingol.unfold_const_app t |
|
351 |
of SOME c_ts => pr_app vars fxy c_ts |
|
18865 | 352 |
| NONE => |
20976 | 353 |
brackify fxy [pr_term vars NOBR t1, pr_term vars BR t2]) |
20896 | 354 |
| pr_term vars fxy (t as _ `|-> _) = |
20105 | 355 |
let |
21015 | 356 |
val (ps, t') = CodegenThingol.unfold_abs t; |
357 |
fun pr ((v, NONE), _) vars = |
|
358 |
let |
|
21082 | 359 |
val vars' = CodegenThingol.intro_vars [v] vars; |
21015 | 360 |
in |
21082 | 361 |
((Pretty.block o Pretty.breaks) [str "fn", str (CodegenThingol.lookup_var vars' v), str "=>"], vars') |
21015 | 362 |
end |
363 |
| pr ((v, SOME p), _) vars = |
|
364 |
let |
|
21093 | 365 |
val vars' = CodegenThingol.intro_vars [v] vars; |
366 |
val vs = CodegenThingol.fold_varnames (insert (op =)) p []; |
|
367 |
val vars'' = CodegenThingol.intro_vars vs vars'; |
|
21015 | 368 |
in |
21082 | 369 |
((Pretty.block o Pretty.breaks) [str "fn", str (CodegenThingol.lookup_var vars' v), str "as", |
21093 | 370 |
pr_term vars'' NOBR p, str "=>"], vars'') |
21015 | 371 |
end; |
372 |
val (ps', vars') = fold_map pr ps vars; |
|
373 |
in brackify BR (ps' @ [pr_term vars' NOBR t']) end |
|
374 |
| pr_term vars fxy (INum n) = |
|
20896 | 375 |
brackify BR [(str o IntInf.toString) n, str ":", str "IntInf.int"] |
21015 | 376 |
| pr_term vars _ (IChar c) = |
19607
07eeb832f28d
introduced characters for code generator; some improved code lemmas for some list functions
haftmann
parents:
19597
diff
changeset
|
377 |
(str o prefix "#" o quote) |
20203 | 378 |
(let val i = ord c |
20191 | 379 |
in if i < 32 |
20105 | 380 |
then prefix "\\" (string_of_int i) |
19607
07eeb832f28d
introduced characters for code generator; some improved code lemmas for some list functions
haftmann
parents:
19597
diff
changeset
|
381 |
else c |
07eeb832f28d
introduced characters for code generator; some improved code lemmas for some list functions
haftmann
parents:
19597
diff
changeset
|
382 |
end) |
21015 | 383 |
| pr_term vars fxy (t as ICase (_, [_])) = |
18216 | 384 |
let |
20976 | 385 |
val (ts, t') = CodegenThingol.unfold_let t; |
386 |
fun mk ((p, _), t'') vars = |
|
20699 | 387 |
let |
20896 | 388 |
val vs = CodegenThingol.fold_varnames (insert (op =)) p []; |
21082 | 389 |
val vars' = CodegenThingol.intro_vars vs vars; |
20699 | 390 |
in |
391 |
(Pretty.block [ |
|
392 |
(Pretty.block o Pretty.breaks) [ |
|
393 |
str "val", |
|
20896 | 394 |
pr_term vars' NOBR p, |
20699 | 395 |
str "=", |
20976 | 396 |
pr_term vars NOBR t'' |
20699 | 397 |
], |
398 |
str ";" |
|
20896 | 399 |
], vars') |
20699 | 400 |
end |
20896 | 401 |
val (binds, vars') = fold_map mk ts vars; |
402 |
in |
|
403 |
Pretty.chunks [ |
|
404 |
[str ("let"), Pretty.fbrk, binds |> Pretty.chunks] |> Pretty.block, |
|
20976 | 405 |
[str ("in"), Pretty.fbrk, pr_term vars' NOBR t'] |> Pretty.block, |
20896 | 406 |
str ("end") |
407 |
] end |
|
21015 | 408 |
| pr_term vars fxy (ICase ((td, ty), b::bs)) = |
18216 | 409 |
let |
20896 | 410 |
fun pr definer (p, t) = |
20699 | 411 |
let |
20896 | 412 |
val vs = CodegenThingol.fold_varnames (insert (op =)) p []; |
21082 | 413 |
val vars' = CodegenThingol.intro_vars vs vars; |
20699 | 414 |
in |
415 |
(Pretty.block o Pretty.breaks) [ |
|
416 |
str definer, |
|
20896 | 417 |
pr_term vars' NOBR p, |
20699 | 418 |
str "=>", |
20896 | 419 |
pr_term vars' NOBR t |
20699 | 420 |
] |
20896 | 421 |
end; |
422 |
in |
|
423 |
(Pretty.enclose "(" ")" o single o brackify fxy) ( |
|
424 |
str "case" |
|
425 |
:: pr_term vars NOBR td |
|
426 |
:: pr "of" b |
|
427 |
:: map (pr "|") bs |
|
428 |
) |
|
429 |
end |
|
20976 | 430 |
and pr_app' vars (app as ((c, (iss, ty)), ts)) = |
431 |
if is_cons c then let |
|
432 |
val k = (length o fst o CodegenThingol.unfold_fun) ty |
|
433 |
in if k < 2 then |
|
434 |
(str o deresolv) c :: map (pr_term vars BR) ts |
|
435 |
else if k = length ts then |
|
436 |
[(str o deresolv) c, Pretty.enum "," "(" ")" (map (pr_term vars NOBR) ts)] |
|
437 |
else [pr_term vars BR (CodegenThingol.eta_expand app k)] end else |
|
438 |
(str o deresolv) c :: map (pr_term vars BR) ts |
|
20896 | 439 |
and pr_app vars fxy (app as ((c, (iss, ty)), ts)) = |
440 |
case if is_cons c then [] else (map (pr_insts BR) o filter_out null) iss |
|
18885 | 441 |
of [] => |
20896 | 442 |
mk_app (pr_app' vars) (pr_term vars) const_syntax fxy app |
443 |
| ps => |
|
20456 | 444 |
if (is_none o const_syntax) c then |
20896 | 445 |
brackify fxy ((str o deresolv) c :: (ps @ map (pr_term vars BR) ts)) |
446 |
else |
|
447 |
error ("Cannot apply user defined serialization for function expecting dictionaries: " ^ quote c) |
|
448 |
fun eta_expand_poly_fun (funn as (_, (_::_, _))) = |
|
449 |
funn |
|
450 |
| eta_expand_poly_fun (funn as (_, ([_], ([], _)))) = |
|
451 |
funn |
|
452 |
| eta_expand_poly_fun (funn as (_, ([(_::_, _)], _))) = |
|
453 |
funn |
|
454 |
| eta_expand_poly_fun (funn as (_, ([(_, _ `|-> _)], _))) = |
|
455 |
funn |
|
456 |
| eta_expand_poly_fun (funn as (name, ([([], t)], tysm as (vs, ty)))) = |
|
457 |
if (null o fst o CodegenThingol.unfold_fun) ty |
|
458 |
orelse (not o null o filter_out (null o snd)) vs |
|
459 |
then funn |
|
460 |
else (name, ([([IVar "x"], t `$ IVar "x")], tysm)); |
|
461 |
fun pr_def (MLFuns raw_funns) = |
|
462 |
let |
|
463 |
val funns as (funn :: funns') = map (eta_expand_poly_fun o constructive_fun) raw_funns; |
|
464 |
val definer = |
|
465 |
let |
|
466 |
fun mk [] [] = "val" |
|
467 |
| mk (_::_) _ = "fun" |
|
468 |
| mk [] vs = if (null o filter_out (null o snd)) vs then "val" else "fun"; |
|
469 |
fun chk (_, ((ts, _) :: _, (vs, _))) NONE = SOME (mk ts vs) |
|
470 |
| chk (_, ((ts, _) :: _, (vs, _))) (SOME defi) = |
|
471 |
if defi = mk ts vs then SOME defi |
|
472 |
else error ("Mixing simultaneous vals and funs not implemented"); |
|
473 |
in the (fold chk funns NONE) end; |
|
474 |
fun pr_funn definer (name, (eqs as eq::eqs', (raw_vs, ty))) = |
|
475 |
let |
|
476 |
val vs = filter_out (null o snd) raw_vs; |
|
477 |
val shift = if null eqs' then I else |
|
478 |
map (Pretty.block o single o Pretty.block o single); |
|
479 |
fun pr_eq definer (ts, t) = |
|
480 |
let |
|
481 |
val consts = map_filter |
|
482 |
(fn c => if (is_some o const_syntax) c |
|
483 |
then NONE else (SOME o NameSpace.base o deresolv) c) |
|
484 |
((fold o CodegenThingol.fold_constnames) (insert (op =)) (t :: ts) []); |
|
485 |
val vars = keyword_vars |
|
21082 | 486 |
|> CodegenThingol.intro_vars consts |
487 |
|> CodegenThingol.intro_vars ((fold o CodegenThingol.fold_unbound_varnames) (insert (op =)) (t :: ts) []); |
|
20896 | 488 |
in |
489 |
(Pretty.block o Pretty.breaks) ( |
|
490 |
[str definer, (str o deresolv) name] |
|
491 |
@ (if null ts andalso null vs |
|
492 |
andalso not (ty = ITyVar "_")(*for evaluation*) |
|
493 |
then [str ":", pr_typ NOBR ty] |
|
494 |
else |
|
495 |
map pr_tyvar vs |
|
496 |
@ map (pr_term vars BR) ts) |
|
497 |
@ [str "=", pr_term vars NOBR t] |
|
498 |
) |
|
499 |
end |
|
500 |
in |
|
501 |
(Pretty.block o Pretty.fbreaks o shift) ( |
|
502 |
pr_eq definer eq |
|
503 |
:: map (pr_eq "|") eqs' |
|
504 |
) |
|
505 |
end; |
|
506 |
val (ps, p) = split_last (pr_funn definer funn :: map (pr_funn "and") funns'); |
|
507 |
in Pretty.chunks (ps @ [Pretty.block ([p, str ";"])]) end |
|
508 |
| pr_def (MLDatas (datas as (data :: datas'))) = |
|
509 |
let |
|
510 |
fun pr_co (co, []) = |
|
511 |
str (deresolv co) |
|
512 |
| pr_co (co, tys) = |
|
513 |
(Pretty.block o Pretty.breaks) [ |
|
514 |
str (deresolv co), |
|
515 |
str "of", |
|
516 |
Pretty.enum " *" "" "" (map (pr_typ (INFX (2, L))) tys) |
|
517 |
]; |
|
518 |
fun pr_data definer (tyco, (vs, cos)) = |
|
519 |
(Pretty.block o Pretty.breaks) ( |
|
520 |
str definer |
|
521 |
:: pr_tycoexpr NOBR (tyco, map (ITyVar o fst) vs) |
|
522 |
:: str "=" |
|
523 |
:: separate (str "|") (map pr_co cos) |
|
524 |
); |
|
525 |
val (ps, p) = split_last (pr_data "datatype" data :: map (pr_data "and") datas'); |
|
526 |
in Pretty.chunks (ps @ [Pretty.block ([p, str ";"])]) end |
|
527 |
| pr_def (MLClass (class, (superclasses, (v, classops)))) = |
|
528 |
let |
|
529 |
val w = dictvar v; |
|
530 |
fun pr_superclass class = |
|
531 |
(Pretty.block o Pretty.breaks o map str) [ |
|
532 |
label class, ":", "'" ^ v, deresolv class |
|
533 |
]; |
|
534 |
fun pr_classop (classop, ty) = |
|
535 |
(Pretty.block o Pretty.breaks) [ |
|
536 |
(str o suffix "_" o NameSpace.base) classop, str ":", pr_typ NOBR ty |
|
537 |
]; |
|
538 |
fun pr_classop_fun (classop, _) = |
|
539 |
(Pretty.block o Pretty.breaks) [ |
|
540 |
str "fun", |
|
541 |
(str o deresolv) classop, |
|
542 |
Pretty.enclose "(" ")" [str (w ^ ":'" ^ v ^ " " ^ deresolv class)], |
|
543 |
str "=", |
|
544 |
str ("#" ^ (suffix "_" o NameSpace.base) classop), |
|
545 |
str (w ^ ";") |
|
546 |
]; |
|
547 |
in |
|
548 |
Pretty.chunks ( |
|
549 |
(Pretty.block o Pretty.breaks) [ |
|
550 |
str ("type '" ^ v), |
|
551 |
(str o deresolv) class, |
|
552 |
str "=", |
|
553 |
Pretty.enum "," "{" "};" ( |
|
554 |
map pr_superclass superclasses @ map pr_classop classops |
|
555 |
) |
|
556 |
] |
|
557 |
:: map pr_classop_fun classops |
|
558 |
) |
|
559 |
end |
|
560 |
| pr_def (MLClassinst (inst, ((class, (tyco, arity)), (superarities, classop_defs)))) = |
|
561 |
let |
|
562 |
fun pr_superclass (superclass, superinst_iss) = |
|
563 |
(Pretty.block o Pretty.breaks) [ |
|
564 |
(str o label) superclass, |
|
565 |
str "=", |
|
566 |
pr_insts NOBR [Instance superinst_iss] |
|
567 |
]; |
|
568 |
fun pr_classop_def (classop, t) = |
|
569 |
let |
|
570 |
val consts = map_filter |
|
571 |
(fn c => if (is_some o const_syntax) c |
|
572 |
then NONE else (SOME o NameSpace.base o deresolv) c) |
|
573 |
(CodegenThingol.fold_constnames (insert (op =)) t []); |
|
574 |
val vars = keyword_vars |
|
21082 | 575 |
|> CodegenThingol.intro_vars consts; |
20896 | 576 |
in |
577 |
(Pretty.block o Pretty.breaks) [ |
|
578 |
(str o suffix "_" o NameSpace.base) classop, |
|
579 |
str "=", |
|
580 |
pr_term vars NOBR t |
|
581 |
] |
|
582 |
end; |
|
583 |
in |
|
584 |
(Pretty.block o Pretty.breaks) ([ |
|
585 |
str (if null arity then "val" else "fun"), |
|
586 |
(str o deresolv) inst ] @ |
|
587 |
map pr_tyvar arity @ [ |
|
588 |
str "=", |
|
589 |
Pretty.enum "," "{" "}" (map pr_superclass superarities @ map pr_classop_def classop_defs), |
|
590 |
str ":", |
|
591 |
pr_tycoexpr NOBR (class, [tyco `%% map (ITyVar o fst) arity]) |
|
592 |
]) |
|
593 |
end; |
|
594 |
in pr_def ml_def end; |
|
19042
630b8dd0b31a
exported some interfaces useful for other code generator approaches
haftmann
parents:
19038
diff
changeset
|
595 |
|
20896 | 596 |
|
597 |
||
598 |
(** Haskell serializer **) |
|
599 |
||
21082 | 600 |
fun pr_haskell class_syntax tyco_syntax const_syntax keyword_vars deresolv_here deresolv deriving_show def = |
19042
630b8dd0b31a
exported some interfaces useful for other code generator approaches
haftmann
parents:
19038
diff
changeset
|
601 |
let |
20699 | 602 |
val is_cons = CodegenNames.has_nsp CodegenNames.nsp_dtco; |
20896 | 603 |
fun class_name class = case class_syntax class |
604 |
of NONE => deresolv class |
|
605 |
| SOME (class, _) => class; |
|
606 |
fun classop_name class classop = case class_syntax class |
|
607 |
of NONE => NameSpace.base classop |
|
608 |
| SOME (_, classop_syntax) => case classop_syntax classop |
|
609 |
of NONE => NameSpace.base classop |
|
610 |
| SOME classop => classop |
|
611 |
fun pr_typparms tyvars vs = |
|
612 |
case maps (fn (v, sort) => map (pair v) sort) vs |
|
613 |
of [] => str "" |
|
614 |
| xs => Pretty.block [ |
|
615 |
Pretty.enum "," "(" ")" ( |
|
616 |
map (fn (v, class) => str |
|
21082 | 617 |
(class_name class ^ " " ^ CodegenThingol.lookup_var tyvars v)) xs |
20896 | 618 |
), |
619 |
str " => " |
|
620 |
]; |
|
621 |
fun pr_tycoexpr tyvars fxy (tyco, tys) = |
|
622 |
brackify fxy (str tyco :: map (pr_typ tyvars BR) tys) |
|
623 |
and pr_typ tyvars fxy (tycoexpr as tyco `%% tys) = |
|
624 |
(case tyco_syntax tyco |
|
625 |
of NONE => |
|
626 |
pr_tycoexpr tyvars fxy (deresolv tyco, tys) |
|
627 |
| SOME (i, pr) => |
|
628 |
if not (i = length tys) |
|
629 |
then error ("Number of argument mismatch in customary serialization: " |
|
630 |
^ (string_of_int o length) tys ^ " given, " |
|
631 |
^ string_of_int i ^ " expected") |
|
632 |
else pr fxy (pr_typ tyvars) tys) |
|
633 |
| pr_typ tyvars fxy (t1 `-> t2) = |
|
634 |
brackify_infix (1, R) fxy [ |
|
635 |
pr_typ tyvars (INFX (1, X)) t1, |
|
636 |
str "->", |
|
637 |
pr_typ tyvars (INFX (1, R)) t2 |
|
638 |
] |
|
639 |
| pr_typ tyvars fxy (ITyVar v) = |
|
21082 | 640 |
(str o CodegenThingol.lookup_var tyvars) v; |
20896 | 641 |
fun pr_typscheme_expr tyvars (vs, tycoexpr) = |
642 |
Pretty.block [pr_typparms tyvars vs, pr_tycoexpr tyvars NOBR tycoexpr]; |
|
643 |
fun pr_typscheme tyvars (vs, ty) = |
|
644 |
Pretty.block [pr_typparms tyvars vs, pr_typ tyvars NOBR ty]; |
|
645 |
fun pr_term vars fxy (IConst c) = |
|
646 |
pr_app vars fxy (c, []) |
|
647 |
| pr_term vars fxy (t as (t1 `$ t2)) = |
|
648 |
(case CodegenThingol.unfold_const_app t |
|
649 |
of SOME app => pr_app vars fxy app |
|
650 |
| _ => |
|
651 |
brackify fxy [ |
|
652 |
pr_term vars NOBR t1, |
|
653 |
pr_term vars BR t2 |
|
654 |
]) |
|
655 |
| pr_term vars fxy (IVar v) = |
|
21082 | 656 |
(str o CodegenThingol.lookup_var vars) v |
20896 | 657 |
| pr_term vars fxy (t as _ `|-> _) = |
19607
07eeb832f28d
introduced characters for code generator; some improved code lemmas for some list functions
haftmann
parents:
19597
diff
changeset
|
658 |
let |
21015 | 659 |
val (ps, t') = CodegenThingol.unfold_abs t; |
660 |
fun pr ((v, SOME p), _) vars = |
|
661 |
let |
|
21093 | 662 |
val vars' = CodegenThingol.intro_vars [v] vars; |
663 |
val vs = CodegenThingol.fold_varnames (insert (op =)) p []; |
|
664 |
val vars'' = CodegenThingol.intro_vars vs vars'; |
|
665 |
in |
|
666 |
((Pretty.block o Pretty.breaks) [str (CodegenThingol.lookup_var vars' v), |
|
667 |
str "@", pr_term vars'' BR p], vars'') |
|
668 |
end |
|
21015 | 669 |
| pr ((v, NONE), _) vars = |
670 |
let |
|
21082 | 671 |
val vars' = CodegenThingol.intro_vars [v] vars; |
672 |
in (str (CodegenThingol.lookup_var vars' v), vars') end; |
|
21015 | 673 |
val (ps', vars') = fold_map pr ps vars; |
20896 | 674 |
in |
675 |
brackify BR ( |
|
676 |
str "\\" |
|
21015 | 677 |
:: ps' @ [ |
20896 | 678 |
str "->", |
679 |
pr_term vars' NOBR t' |
|
680 |
]) |
|
681 |
end |
|
21015 | 682 |
| pr_term vars fxy (INum n) = |
20896 | 683 |
if n > 0 then |
684 |
(str o IntInf.toString) n |
|
685 |
else |
|
686 |
brackify BR [(str o Library.prefix "-" o IntInf.toString o IntInf.~) n] |
|
21015 | 687 |
| pr_term vars fxy (IChar c) = |
20896 | 688 |
(str o enclose "'" "'") |
689 |
(let val i = (Char.ord o the o Char.fromString) c |
|
690 |
in if i < 32 |
|
691 |
then Library.prefix "\\" (string_of_int i) |
|
692 |
else c |
|
693 |
end) |
|
21015 | 694 |
| pr_term vars fxy (t as ICase (_, [_])) = |
18216 | 695 |
let |
20896 | 696 |
val (ts, t) = CodegenThingol.unfold_let t; |
697 |
fun pr ((p, _), t) vars = |
|
698 |
let |
|
699 |
val vs = CodegenThingol.fold_varnames (insert (op =)) p []; |
|
21082 | 700 |
val vars' = CodegenThingol.intro_vars vs vars; |
20896 | 701 |
in |
702 |
((Pretty.block o Pretty.breaks) [ |
|
703 |
pr_term vars' BR p, |
|
704 |
str "=", |
|
705 |
pr_term vars NOBR t |
|
706 |
], vars') |
|
707 |
end; |
|
708 |
val (binds, vars') = fold_map pr ts vars; |
|
709 |
in Pretty.chunks [ |
|
710 |
[str ("let"), Pretty.fbrk, binds |> Pretty.chunks] |> Pretty.block, |
|
711 |
[str ("in "), pr_term vars' NOBR t] |> Pretty.block |
|
712 |
] end |
|
21015 | 713 |
| pr_term vars fxy (ICase ((td, _), bs)) = |
20896 | 714 |
let |
715 |
fun pr (p, t) = |
|
716 |
let |
|
717 |
val vs = CodegenThingol.fold_varnames (insert (op =)) p []; |
|
21082 | 718 |
val vars' = CodegenThingol.intro_vars vs vars; |
20896 | 719 |
in |
720 |
(Pretty.block o Pretty.breaks) [ |
|
721 |
pr_term vars' NOBR p, |
|
722 |
str "->", |
|
723 |
pr_term vars' NOBR t |
|
724 |
] |
|
725 |
end |
|
726 |
in |
|
727 |
(Pretty.enclose "(" ")" o Pretty.breaks) [ |
|
728 |
str "case", |
|
729 |
pr_term vars NOBR td, |
|
730 |
str "of", |
|
731 |
(Pretty.chunks o map pr) bs |
|
732 |
] |
|
733 |
end |
|
20976 | 734 |
and pr_app' vars ((c, _), ts) = |
20896 | 735 |
(str o deresolv) c :: map (pr_term vars BR) ts |
736 |
and pr_app vars fxy = |
|
737 |
mk_app (pr_app' vars) (pr_term vars) const_syntax fxy; |
|
738 |
fun pr_def (name, CodegenThingol.Fun (funn as (eqs, (vs, ty)))) = |
|
739 |
let |
|
21082 | 740 |
val tyvars = CodegenThingol.intro_vars (map fst vs) keyword_vars; |
20896 | 741 |
fun pr_eq (ts, t) = |
20699 | 742 |
let |
743 |
val consts = map_filter |
|
744 |
(fn c => if (is_some o const_syntax) c |
|
20896 | 745 |
then NONE else (SOME o NameSpace.base o deresolv) c) |
746 |
((fold o CodegenThingol.fold_constnames) (insert (op =)) (t :: ts) []); |
|
747 |
val vars = keyword_vars |
|
21082 | 748 |
|> CodegenThingol.intro_vars consts |
749 |
|> CodegenThingol.intro_vars ((fold o CodegenThingol.fold_unbound_varnames) (insert (op =)) (t :: ts) []); |
|
20699 | 750 |
in |
751 |
(Pretty.block o Pretty.breaks) ( |
|
20896 | 752 |
(str o deresolv_here) name |
753 |
:: map (pr_term vars BR) ts |
|
754 |
@ [str "=", pr_term vars NOBR t] |
|
20699 | 755 |
) |
20896 | 756 |
end; |
757 |
in |
|
758 |
Pretty.chunks ( |
|
759 |
Pretty.block [ |
|
760 |
(str o suffix " ::" o deresolv_here) name, |
|
761 |
Pretty.brk 1, |
|
762 |
pr_typscheme tyvars (vs, ty) |
|
763 |
] |
|
764 |
:: (map pr_eq o fst o snd o constructive_fun) (name, funn) |
|
765 |
) |
|
21082 | 766 |
end |
20896 | 767 |
| pr_def (name, CodegenThingol.Datatype (vs, [(co, [ty])])) = |
768 |
let |
|
21082 | 769 |
val tyvars = CodegenThingol.intro_vars (map fst vs) keyword_vars; |
18216 | 770 |
in |
21082 | 771 |
(Pretty.block o Pretty.breaks) ([ |
20896 | 772 |
str "newtype", |
773 |
pr_typscheme_expr tyvars (vs, (deresolv_here name, map (ITyVar o fst) vs)), |
|
774 |
str "=", |
|
775 |
(str o deresolv_here) co, |
|
776 |
pr_typ tyvars BR ty |
|
21093 | 777 |
] @ (if deriving_show name then [str "deriving (Read, Show)"] else [])) |
21082 | 778 |
end |
20896 | 779 |
| pr_def (name, CodegenThingol.Datatype (vs, co :: cos)) = |
780 |
let |
|
21082 | 781 |
val tyvars = CodegenThingol.intro_vars (map fst vs) keyword_vars; |
20896 | 782 |
fun pr_co (co, tys) = |
783 |
(Pretty.block o Pretty.breaks) ( |
|
784 |
(str o deresolv_here) co |
|
785 |
:: map (pr_typ tyvars BR) tys |
|
786 |
) |
|
787 |
in |
|
21082 | 788 |
(Pretty.block o Pretty.breaks) (( |
20896 | 789 |
str "data" |
790 |
:: pr_typscheme_expr tyvars (vs, (deresolv_here name, map (ITyVar o fst) vs)) |
|
791 |
:: str "=" |
|
792 |
:: pr_co co |
|
793 |
:: map ((fn p => Pretty.block [str "| ", p]) o pr_co) cos |
|
21093 | 794 |
) @ (if deriving_show name then [str "deriving (Read, Show)"] else [])) |
21082 | 795 |
end |
20896 | 796 |
| pr_def (name, CodegenThingol.Class (superclasss, (v, classops))) = |
797 |
let |
|
21082 | 798 |
val tyvars = CodegenThingol.intro_vars [v] keyword_vars; |
20896 | 799 |
fun pr_classop (classop, ty) = |
19136 | 800 |
Pretty.block [ |
20896 | 801 |
str (deresolv_here classop ^ " ::"), |
19136 | 802 |
Pretty.brk 1, |
20896 | 803 |
pr_typ tyvars NOBR ty |
19136 | 804 |
] |
20896 | 805 |
in |
806 |
Pretty.block [ |
|
807 |
str "class ", |
|
808 |
pr_typparms tyvars [(v, superclasss)], |
|
21082 | 809 |
str (deresolv_here name ^ " " ^ CodegenThingol.lookup_var tyvars v), |
20896 | 810 |
str " where", |
811 |
Pretty.fbrk, |
|
812 |
Pretty.chunks (map pr_classop classops) |
|
813 |
] |
|
21082 | 814 |
end |
20896 | 815 |
| pr_def (_, CodegenThingol.Classinst ((class, (tyco, vs)), (_, classop_defs))) = |
816 |
let |
|
21082 | 817 |
val tyvars = CodegenThingol.intro_vars (map fst vs) keyword_vars; |
20896 | 818 |
in |
819 |
Pretty.block [ |
|
820 |
str "instance ", |
|
821 |
pr_typparms tyvars vs, |
|
822 |
str (class_name class ^ " "), |
|
823 |
pr_typ tyvars BR (tyco `%% map (ITyVar o fst) vs), |
|
824 |
str " where", |
|
825 |
Pretty.fbrk, |
|
826 |
Pretty.chunks (map (fn (classop, t) => |
|
827 |
let |
|
828 |
val consts = map_filter |
|
829 |
(fn c => if (is_some o const_syntax) c |
|
830 |
then NONE else (SOME o NameSpace.base o deresolv) c) |
|
831 |
(CodegenThingol.fold_constnames (insert (op =)) t []); |
|
832 |
val vars = keyword_vars |
|
21082 | 833 |
|> CodegenThingol.intro_vars consts; |
20896 | 834 |
in |
835 |
(Pretty.block o Pretty.breaks) [ |
|
836 |
(str o classop_name class) classop, |
|
837 |
str "=", |
|
838 |
pr_term vars NOBR t |
|
839 |
] |
|
840 |
end |
|
841 |
) classop_defs) |
|
842 |
] |
|
21082 | 843 |
end; |
20940 | 844 |
in pr_def def end; |
20896 | 845 |
|
21015 | 846 |
val reserved_haskell = [ |
847 |
"hiding", "deriving", "where", "case", "of", "infix", "infixl", "infixr", |
|
848 |
"import", "default", "forall", "let", "in", "class", "qualified", "data", |
|
849 |
"newtype", "instance", "if", "then", "else", "type", "as", "do", "module" |
|
850 |
]; |
|
851 |
||
21082 | 852 |
fun seri_haskell module_prefix destination string_classes reserved_user module_alias module_prolog |
21015 | 853 |
class_syntax tyco_syntax const_syntax code = |
854 |
let |
|
21082 | 855 |
val _ = Option.map File.assert destination; |
856 |
val empty_names = Name.make_context (reserved_haskell @ reserved_user); |
|
857 |
fun prefix_modlname modlname = case module_prefix |
|
858 |
of NONE => modlname |
|
859 |
| SOME module_prefix => NameSpace.append module_prefix modlname; |
|
860 |
fun add_def (name, (def, deps)) = |
|
861 |
let |
|
862 |
val (modl, (shallow, base)) = dest_name name; |
|
863 |
val base' = if member (op =) |
|
864 |
[CodegenNames.nsp_class, CodegenNames.nsp_tyco, CodegenNames.nsp_dtco] shallow |
|
865 |
then first_upper base else base; |
|
866 |
fun mk name = (the_single o fst) (Name.variants [name] empty_names); |
|
21093 | 867 |
fun mk' name names = names |> Name.variants [name] |>> the_single; |
21082 | 868 |
val modlname = NameSpace.pack modl; |
869 |
val modlname' = case module_alias modlname |
|
870 |
of SOME modlname' => prefix_modlname modlname' |
|
871 |
| NONE => NameSpace.pack (map_filter I (module_prefix :: map (SOME o mk) modl)); |
|
872 |
val deps' = remove (op =) modlname (map (NameSpace.qualifier o NameSpace.qualifier) deps); |
|
21093 | 873 |
fun add_name base (names as (names_fun, names_typ)) = |
874 |
case def |
|
875 |
of CodegenThingol.Bot => (base, names) |
|
876 |
| CodegenThingol.Fun _ => let val (base', names_fun') = mk' base names_fun in (base', (names_fun', names_typ)) end |
|
877 |
| CodegenThingol.Datatype _ => let val (base', names_typ') = mk' base names_typ in (base', (names_fun, names_typ')) end |
|
878 |
| CodegenThingol.Datatypecons _ => let val (base', names_fun') = mk' base names_fun in (base', (names_fun', names_typ)) end |
|
879 |
| CodegenThingol.Class _ => let val (base', names_typ') = mk' base names_typ in (base', (names_fun, names_typ')) end |
|
880 |
| CodegenThingol.Classop _ => let val (base', names_fun') = mk' base names_fun in (base', (names_fun', names_typ)) end |
|
881 |
| CodegenThingol.Classinst _ => (base, names); |
|
21082 | 882 |
fun add_def base' = |
883 |
case def |
|
21093 | 884 |
of CodegenThingol.Bot => I |
885 |
| CodegenThingol.Datatypecons _ => I |
|
21082 | 886 |
cons (name, ((NameSpace.append modlname' base', base'), NONE)) |
887 |
| CodegenThingol.Classop _ => |
|
888 |
cons (name, ((NameSpace.append modlname' base', base'), NONE)) |
|
889 |
| _ => cons (name, ((NameSpace.append modlname' base', base'), SOME def)); |
|
890 |
in |
|
21093 | 891 |
Symtab.map_default (modlname, (modlname', ([], ([], (empty_names, empty_names))))) |
21082 | 892 |
((apsnd o apfst) (fold (insert (op =)) deps')) |
21093 | 893 |
#> `(fn code => add_name base' ((snd o snd o snd o the o Symtab.lookup code) modlname)) |
21082 | 894 |
#-> (fn (base', names) => |
895 |
Symtab.map_entry modlname ((apsnd o apsnd) (fn (defs, _) => |
|
896 |
(add_def base' defs, names)))) |
|
897 |
end; |
|
898 |
val code' = |
|
899 |
fold add_def (AList.make (fn name => (Graph.get_node code name, Graph.imm_succs code name)) |
|
900 |
(Graph.strong_conn code |> flat)) Symtab.empty; |
|
901 |
val init_vars = CodegenThingol.make_vars (reserved_haskell @ reserved_user); |
|
902 |
fun deresolv name = |
|
903 |
(fst o fst o the o AList.lookup (op =) ((fst o snd o snd o the |
|
904 |
o Symtab.lookup code') ((NameSpace.qualifier o NameSpace.qualifier) name))) name; |
|
905 |
fun deresolv_here name = |
|
906 |
(snd o fst o the o AList.lookup (op =) ((fst o snd o snd o the |
|
907 |
o Symtab.lookup code') ((NameSpace.qualifier o NameSpace.qualifier) name))) name; |
|
908 |
val deresolv_module = fst o the o Symtab.lookup code'; |
|
909 |
fun deriving_show tyco = |
|
910 |
let |
|
911 |
fun deriv tycos tyco = member (op =) tycos tyco orelse |
|
21094 | 912 |
case the_default CodegenThingol.Bot (try (Graph.get_node code) tyco) |
21082 | 913 |
of CodegenThingol.Bot => true |
914 |
| CodegenThingol.Datatype (_, cs) => forall (deriv' (tyco :: tycos)) |
|
915 |
(maps snd cs) |
|
916 |
and deriv' tycos (tyco `%% tys) = deriv tycos tyco |
|
917 |
andalso forall (deriv' tycos) tys |
|
918 |
| deriv' _ (_ `-> _) = false |
|
919 |
| deriv' _ (ITyVar _) = true |
|
920 |
in deriv [] tyco end; |
|
921 |
val seri_def = pr_haskell class_syntax tyco_syntax const_syntax init_vars |
|
922 |
deresolv_here deresolv (if string_classes then deriving_show else K false); |
|
923 |
fun write_module (SOME destination) modlname p = |
|
924 |
let |
|
925 |
val filename = case modlname |
|
926 |
of "" => Path.unpack "Main.hs" |
|
927 |
| _ => (Path.ext "hs" o Path.unpack o implode o separate "/" o NameSpace.unpack) modlname; |
|
928 |
val pathname = Path.append destination filename; |
|
929 |
val _ = File.mkdir (Path.dir pathname); |
|
930 |
in File.write pathname (Pretty.setmp_margin 999999 Pretty.output p ^ "\n") end |
|
931 |
| write_module NONE _ p = |
|
932 |
writeln (Pretty.setmp_margin 999999 Pretty.output p ^ "\n"); |
|
933 |
fun seri_module (modlname, (modlname', (imports, (defs, _)))) = |
|
934 |
Pretty.chunks ( |
|
935 |
str ("module " ^ modlname' ^ " where") |
|
936 |
:: map str (distinct (op =) (map (prefix "import qualified " o deresolv_module) imports)) @ ( |
|
937 |
(case module_prolog modlname |
|
938 |
of SOME prolog => [str "", prolog, str ""] |
|
939 |
| NONE => [str ""]) |
|
940 |
@ separate (str "") (map_filter |
|
941 |
(fn (name, (_, SOME def)) => SOME (seri_def (name, def)) |
|
942 |
| (_, (_, NONE)) => NONE) defs)) |
|
943 |
) |> write_module destination modlname'; |
|
944 |
in Symtab.fold (fn modl => fn () => seri_module modl) code' () end; |
|
21015 | 945 |
|
21082 | 946 |
val isar_seri_haskell = |
947 |
parse_args (Scan.option (Args.$$$ "root" -- Args.colon |-- Args.name) |
|
948 |
-- Scan.optional (Args.$$$ "string_classes" >> K true) false |
|
949 |
-- (Args.$$$ "-" >> K NONE || Args.name >> SOME) |
|
950 |
>> (fn ((module_prefix, string_classes), destination) => |
|
951 |
seri_haskell module_prefix (Option.map Path.unpack destination) string_classes)); |
|
21015 | 952 |
|
953 |
||
954 |
(** diagnosis serializer **) |
|
955 |
||
956 |
fun seri_diagnosis _ _ _ _ _ code = |
|
957 |
let |
|
21082 | 958 |
val init_vars = CodegenThingol.make_vars reserved_haskell; |
959 |
val pr = pr_haskell (K NONE) (K NONE) (K NONE) init_vars I I (K false); |
|
21015 | 960 |
in |
961 |
[] |
|
21093 | 962 |
|> Graph.fold (fn (name, (def, _)) => case try pr (name, def) of SOME p => cons p | NONE => I) code |
21015 | 963 |
|> separate (Pretty.str "") |
964 |
|> Pretty.chunks |
|
965 |
|> Pretty.writeln |
|
966 |
end; |
|
967 |
||
968 |
||
20896 | 969 |
|
21082 | 970 |
(** ML abstract serializer -- FIXME to be refactored **) |
20896 | 971 |
|
972 |
structure NameMangler = NameManglerFun ( |
|
973 |
type ctxt = (string * string -> string) * (string -> string option); |
|
974 |
type src = string * string; |
|
975 |
val ord = prod_ord string_ord string_ord; |
|
976 |
fun mk (postprocess, validate) ((shallow, name), 0) = |
|
977 |
let |
|
978 |
val name' = postprocess (shallow, name); |
|
979 |
in case validate name' |
|
980 |
of NONE => name' |
|
981 |
| _ => mk (postprocess, validate) ((shallow, name), 1) |
|
982 |
end |
|
983 |
| mk (postprocess, validate) (("", name), i) = |
|
984 |
postprocess ("", name ^ replicate_string i "'") |
|
985 |
|> perhaps validate |
|
986 |
| mk (postprocess, validate) ((shallow, name), 1) = |
|
987 |
postprocess (shallow, shallow ^ "_" ^ name) |
|
988 |
|> perhaps validate |
|
989 |
| mk (postprocess, validate) ((shallow, name), i) = |
|
990 |
postprocess (shallow, name ^ replicate_string i "'") |
|
991 |
|> perhaps validate; |
|
992 |
fun is_valid _ _ = true; |
|
993 |
fun maybe_unique _ _ = NONE; |
|
994 |
fun re_mangle _ dst = error ("No such definition name: " ^ quote dst); |
|
995 |
); |
|
996 |
||
997 |
(*FIXME refactor this properly*) |
|
998 |
fun code_serialize seri_defs seri_module validate postprocess nsp_conn name_root |
|
999 |
(code : CodegenThingol.code) = |
|
1000 |
let |
|
1001 |
datatype node = Def of CodegenThingol.def | Module of node Graph.T; |
|
1002 |
fun dest_modl (Module m) = m; |
|
1003 |
fun dest_name name = |
|
1004 |
let |
|
1005 |
val (names, name_base) = (split_last o NameSpace.unpack) name; |
|
1006 |
val (names_mod, name_shallow) = split_last names; |
|
1007 |
in (names_mod, NameSpace.pack [name_shallow, name_base]) end; |
|
1008 |
fun mk_deresolver module nsp_conn postprocess validate = |
|
1009 |
let |
|
1010 |
datatype tabnode = N of string * tabnode Symtab.table option; |
|
1011 |
fun mk module manglers tab = |
|
1012 |
let |
|
1013 |
fun mk_name name = |
|
1014 |
case NameSpace.unpack name |
|
1015 |
of [n] => ("", n) |
|
1016 |
| [s, n] => (s, n); |
|
1017 |
fun in_conn (shallow, conn) = |
|
1018 |
member (op = : string * string -> bool) conn shallow; |
|
1019 |
fun add_name name = |
|
1020 |
let |
|
1021 |
val n as (shallow, _) = mk_name name; |
|
1022 |
in |
|
1023 |
AList.map_entry_yield in_conn shallow ( |
|
1024 |
NameMangler.declare (postprocess, validate) n |
|
1025 |
#-> (fn n' => pair (name, n')) |
|
1026 |
) #> apfst the |
|
1027 |
end; |
|
1028 |
val (renamings, manglers') = |
|
1029 |
fold_map add_name (Graph.keys module) manglers; |
|
1030 |
fun extend_tab (n, n') = |
|
1031 |
if (length o NameSpace.unpack) n = 1 |
|
1032 |
then |
|
1033 |
Symtab.update_new |
|
1034 |
(n, N (n', SOME (mk ((dest_modl o Graph.get_node module) n) manglers' Symtab.empty))) |
|
1035 |
else |
|
1036 |
Symtab.update_new (n, N (n', NONE)); |
|
1037 |
in fold extend_tab renamings tab end; |
|
1038 |
fun get_path_name [] tab = |
|
1039 |
([], SOME tab) |
|
1040 |
| get_path_name [p] tab = |
|
1041 |
let |
|
1042 |
val SOME (N (p', tab')) = Symtab.lookup tab p |
|
1043 |
in ([p'], tab') end |
|
1044 |
| get_path_name [p1, p2] tab = |
|
1045 |
(case Symtab.lookup tab p1 |
|
1046 |
of SOME (N (p', SOME tab')) => |
|
1047 |
let |
|
1048 |
val (ps', tab'') = get_path_name [p2] tab' |
|
1049 |
in (p' :: ps', tab'') end |
|
1050 |
| NONE => |
|
1051 |
let |
|
1052 |
val SOME (N (p', NONE)) = Symtab.lookup tab (NameSpace.pack [p1, p2]) |
|
1053 |
in ([p'], NONE) end) |
|
1054 |
| get_path_name (p::ps) tab = |
|
1055 |
let |
|
1056 |
val SOME (N (p', SOME tab')) = Symtab.lookup tab p |
|
1057 |
val (ps', tab'') = get_path_name ps tab' |
|
1058 |
in (p' :: ps', tab'') end; |
|
1059 |
fun deresolv tab prefix name = |
|
1060 |
let |
|
1061 |
val (common, (_, rem)) = chop_prefix (op =) (prefix, NameSpace.unpack name); |
|
1062 |
val (_, SOME tab') = get_path_name common tab; |
|
1063 |
val (name', _) = get_path_name rem tab'; |
|
1064 |
in NameSpace.pack name' end handle BIND => (error ("Missing name: " ^ quote name ^ ", in " ^ quote (NameSpace.pack prefix))); |
|
1065 |
in deresolv (mk module (AList.make (K NameMangler.empty) nsp_conn) Symtab.empty) end; |
|
1066 |
fun add_def ((names_mod, name_id), def) = |
|
1067 |
let |
|
1068 |
fun add [] = |
|
1069 |
Graph.new_node (name_id, Def def) |
|
1070 |
| add (m::ms) = |
|
1071 |
Graph.default_node (m, Module Graph.empty) |
|
1072 |
#> Graph.map_node m (Module o add ms o dest_modl) |
|
1073 |
in add names_mod end; |
|
1074 |
fun add_dep (name1, name2) = |
|
1075 |
if name1 = name2 then I |
|
1076 |
else |
|
1077 |
let |
|
1078 |
val m1 = dest_name name1 |> apsnd single |> (op @); |
|
1079 |
val m2 = dest_name name2 |> apsnd single |> (op @); |
|
1080 |
val (ms, (r1, r2)) = chop_prefix (op =) (m1, m2); |
|
1081 |
val (ms, (s1::r1, s2::r2)) = chop_prefix (op =) (m1, m2); |
|
1082 |
val add_edge = |
|
1083 |
if null r1 andalso null r2 |
|
1084 |
then Graph.add_edge |
|
1085 |
else fn edge => fn gr => (Graph.add_edge_acyclic edge gr |
|
1086 |
handle Graph.CYCLES _ => |
|
1087 |
error ("Module dependency " |
|
1088 |
^ quote name1 ^ " -> " ^ quote name2 ^ " would result in module dependency cycle")) |
|
1089 |
fun add [] node = |
|
1090 |
node |
|
1091 |
|> add_edge (s1, s2) |
|
1092 |
| add (m::ms) node = |
|
1093 |
node |
|
1094 |
|> Graph.map_node m (Module o add ms o dest_modl); |
|
1095 |
in add ms end; |
|
1096 |
val root_module = |
|
1097 |
Graph.empty |
|
1098 |
|> Graph.fold (fn (name, (def, _)) => add_def (dest_name name, def)) code |
|
1099 |
|> Graph.fold (fn (name, (_, (_, deps))) => |
|
1100 |
fold (curry add_dep name) deps) code; |
|
1101 |
val names = map fst (Graph.dest root_module); |
|
1102 |
val resolver = mk_deresolver root_module nsp_conn postprocess validate; |
|
1103 |
fun sresolver s = (resolver o NameSpace.unpack) s |
|
1104 |
fun mk_name prfx name = |
|
1105 |
let |
|
1106 |
val name_qual = NameSpace.pack (prfx @ [name]) |
|
1107 |
in (name_qual, resolver prfx name_qual) end; |
|
1108 |
fun mk_contents prfx module = |
|
1109 |
map_filter (seri prfx) |
|
1110 |
((map (AList.make (Graph.get_node module)) o rev o Graph.strong_conn) module) |
|
1111 |
and seri prfx [(name, Module modl)] = |
|
21082 | 1112 |
seri_module (resolver []) (mk_name prfx name, mk_contents (prfx @ [name]) modl) |
20896 | 1113 |
| seri prfx ds = |
1114 |
seri_defs sresolver (NameSpace.pack prfx) |
|
1115 |
(map (fn (name, Def def) => (fst (mk_name prfx name), def)) ds) |
|
1116 |
in |
|
21082 | 1117 |
seri_module (resolver []) |
20896 | 1118 |
(("", name_root), (mk_contents [] root_module)) |
1119 |
end; |
|
1120 |
||
21015 | 1121 |
fun abstract_serializer nspgrp name_root (from_defs, from_module, validator, postproc) |
1122 |
postprocess |
|
1123 |
reserved_user module_alias module_prolog class_syntax tyco_syntax const_syntax |
|
1124 |
code = |
|
20896 | 1125 |
let |
21082 | 1126 |
fun from_module' resolv ((name_qual, name), defs) = |
1127 |
from_module resolv ((name_qual, name), defs) |
|
20896 | 1128 |
|> postprocess (resolv name_qual); |
1129 |
in |
|
21015 | 1130 |
code_serialize (from_defs (class_syntax, tyco_syntax, const_syntax)) |
1131 |
from_module' validator postproc nspgrp name_root code |
|
20896 | 1132 |
|> K () |
1133 |
end; |
|
1134 |
||
1135 |
fun abstract_validator keywords name = |
|
1136 |
let |
|
1137 |
fun replace_invalid c = (*FIXME*) |
|
1138 |
if Symbol.is_ascii_letter c orelse Symbol.is_ascii_digit c orelse c = "'" |
|
1139 |
andalso not (NameSpace.separator = c) |
|
1140 |
then c |
|
1141 |
else "_" |
|
1142 |
fun suffix_it name= |
|
1143 |
name |
|
1144 |
|> member (op =) keywords ? suffix "'" |
|
1145 |
|> (fn name' => if name = name' then name else suffix_it name') |
|
1146 |
in |
|
1147 |
name |
|
1148 |
|> translate_string replace_invalid |
|
1149 |
|> suffix_it |
|
1150 |
|> (fn name' => if name = name' then NONE else SOME name') |
|
1151 |
end; |
|
1152 |
||
21082 | 1153 |
fun write_file path p = (File.write path (Pretty.output p ^ "\n"); p); |
20896 | 1154 |
|
21067 | 1155 |
val sml_code_width = ref 80; |
1156 |
||
20896 | 1157 |
fun parse_single_file serializer = |
1158 |
parse_args (Args.name |
|
1159 |
>> (fn path => serializer |
|
21082 | 1160 |
(fn "" => Pretty.setmp_margin (!sml_code_width) (write_file (Path.unpack path)) #> K NONE |
20896 | 1161 |
| _ => SOME))); |
1162 |
||
1163 |
fun parse_internal serializer = |
|
1164 |
parse_args (Args.name |
|
1165 |
>> (fn "-" => serializer |
|
20926 | 1166 |
(fn "" => (fn p => (use_text Output.ml_output false (Pretty.output p); NONE)) |
20896 | 1167 |
| _ => SOME) |
1168 |
| _ => Scan.fail ())); |
|
1169 |
||
1170 |
fun parse_stdout serializer = |
|
1171 |
parse_args (Args.name |
|
1172 |
>> (fn "_" => serializer |
|
1173 |
(fn "" => (fn p => (Pretty.writeln p; NONE)) |
|
1174 |
| _ => SOME) |
|
1175 |
| _ => Scan.fail ())); |
|
1176 |
||
1177 |
val nsp_module = CodegenNames.nsp_module; |
|
1178 |
val nsp_class = CodegenNames.nsp_class; |
|
1179 |
val nsp_tyco = CodegenNames.nsp_tyco; |
|
1180 |
val nsp_inst = CodegenNames.nsp_inst; |
|
1181 |
val nsp_fun = CodegenNames.nsp_fun; |
|
1182 |
val nsp_dtco = CodegenNames.nsp_dtco; |
|
1183 |
val nsp_eval = CodegenNames.nsp_eval; |
|
1184 |
||
1185 |
||
1186 |
(** ML serializer **) |
|
1187 |
||
1188 |
local |
|
1189 |
||
1190 |
val reserved_ml' = [ |
|
1191 |
"bool", "int", "list", "unit", "option", "true", "false", "not", |
|
1192 |
"NONE", "SOME", "o", "string", "char", "String", "Term" |
|
1193 |
]; |
|
1194 |
||
1195 |
fun ml_from_defs (_, tyco_syntax, const_syntax) deresolver prefx defs = |
|
1196 |
let |
|
1197 |
val seri = pr_sml_def tyco_syntax const_syntax |
|
21082 | 1198 |
(CodegenThingol.make_vars (ThmDatabase.ml_reserved @ reserved_ml')) |
20896 | 1199 |
(deresolver prefx) #> SOME; |
1200 |
val filter_funs = |
|
1201 |
map |
|
1202 |
(fn (name, CodegenThingol.Fun info) => (name, info) |
|
1203 |
| (name, def) => error ("Function block containing illegal def: " ^ quote name) |
|
19042
630b8dd0b31a
exported some interfaces useful for other code generator approaches
haftmann
parents:
19038
diff
changeset
|
1204 |
) |
20896 | 1205 |
#> MLFuns; |
19042
630b8dd0b31a
exported some interfaces useful for other code generator approaches
haftmann
parents:
19038
diff
changeset
|
1206 |
val filter_datatype = |
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19466
diff
changeset
|
1207 |
map_filter |
19167
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19150
diff
changeset
|
1208 |
(fn (name, CodegenThingol.Datatype info) => SOME (name, info) |
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19150
diff
changeset
|
1209 |
| (name, CodegenThingol.Datatypecons _) => NONE |
20896 | 1210 |
| (name, def) => error ("Datatype block containing illegal def: " ^ quote name) |
1211 |
) |
|
1212 |
#> MLDatas; |
|
20191 | 1213 |
fun filter_class defs = |
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19466
diff
changeset
|
1214 |
case map_filter |
19167
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19150
diff
changeset
|
1215 |
(fn (name, CodegenThingol.Class info) => SOME (name, info) |
21082 | 1216 |
| (name, CodegenThingol.Classop _) => NONE |
20896 | 1217 |
| (name, def) => error ("Class block containing illegal def: " ^ quote name) |
1218 |
) defs |
|
1219 |
of [class] => MLClass class |
|
20389 | 1220 |
| _ => error ("Class block without class: " ^ (commas o map (quote o fst)) defs) |
18850 | 1221 |
in case defs |
20896 | 1222 |
of (_, CodegenThingol.Fun _)::_ => (seri o filter_funs) defs |
1223 |
| (_, CodegenThingol.Datatypecons _)::_ => (seri o filter_datatype) defs |
|
1224 |
| (_, CodegenThingol.Datatype _)::_ => (seri o filter_datatype) defs |
|
1225 |
| (_, CodegenThingol.Class _)::_ => (seri o filter_class) defs |
|
21082 | 1226 |
| (_, CodegenThingol.Classop _)::_ => (seri o filter_class) defs |
20896 | 1227 |
| [(inst, CodegenThingol.Classinst info)] => seri (MLClassinst (inst, info)) |
20389 | 1228 |
| defs => error ("Illegal mutual dependencies: " ^ (commas o map fst) defs) |
18216 | 1229 |
end; |
1230 |
||
21015 | 1231 |
fun ml_serializer root_name nspgrp = |
18216 | 1232 |
let |
21082 | 1233 |
fun ml_from_module resolv ((_, name), ps) = |
18756 | 1234 |
Pretty.chunks ([ |
18702 | 1235 |
str ("structure " ^ name ^ " = "), |
1236 |
str "struct", |
|
1237 |
str "" |
|
1238 |
] @ separate (str "") ps @ [ |
|
1239 |
str "", |
|
21093 | 1240 |
str ("end; (*struct " ^ name ^ "*)") |
18756 | 1241 |
]); |
20401 | 1242 |
fun postproc (shallow, n) = |
21082 | 1243 |
if shallow = CodegenNames.nsp_dtco |
1244 |
then first_upper n |
|
1245 |
else n; |
|
21015 | 1246 |
in abstract_serializer nspgrp |
20896 | 1247 |
root_name (ml_from_defs, ml_from_module, |
20699 | 1248 |
abstract_validator (ThmDatabase.ml_reserved @ reserved_ml'), postproc) end; |
20191 | 1249 |
|
1250 |
in |
|
1251 |
||
21015 | 1252 |
fun ml_from_thingol args = |
20699 | 1253 |
let |
21015 | 1254 |
val serializer = ml_serializer "ROOT" [[nsp_module], [nsp_class, nsp_tyco], |
21082 | 1255 |
[nsp_fun, nsp_dtco, nsp_class, nsp_inst]] |
18282 | 1256 |
in |
21082 | 1257 |
(parse_internal serializer |
20105 | 1258 |
|| parse_stdout serializer |
20896 | 1259 |
|| parse_single_file serializer) args |
18216 | 1260 |
end; |
1261 |
||
20389 | 1262 |
val eval_verbose = ref false; |
1263 |
||
21015 | 1264 |
fun eval_term_proto thy data1 data2 data3 data4 data5 data6 hidden ((ref_name, reff), e) code = |
20191 | 1265 |
let |
20699 | 1266 |
val (val_name, code') = CodegenThingol.add_eval_def (nsp_eval, e) code; |
21015 | 1267 |
val code'' = CodegenThingol.project_code hidden (SOME [NameSpace.pack [nsp_eval, val_name]]) code'; |
20191 | 1268 |
val struct_name = "EVAL"; |
20401 | 1269 |
fun output p = if !eval_verbose then (Pretty.writeln p; Pretty.output p) |
1270 |
else Pretty.output p; |
|
21015 | 1271 |
val serializer = ml_serializer struct_name [[nsp_module], [nsp_class, nsp_tyco], |
21082 | 1272 |
[nsp_fun, nsp_dtco, nsp_class, nsp_inst], [nsp_eval]] |
20926 | 1273 |
(fn "" => (fn p => (use_text Output.ml_output (!eval_verbose) (output p); NONE)) |
21015 | 1274 |
| _ => SOME) data1 data2 data3 data4 data5 data6; |
1275 |
val _ = serializer code''; |
|
20191 | 1276 |
val val_name_struct = NameSpace.append struct_name val_name; |
20600 | 1277 |
val _ = reff := NONE; |
20926 | 1278 |
val _ = use_text Output.ml_output (!eval_verbose) ("val _ = (" ^ ref_name ^ " := SOME (" ^ val_name_struct ^ "))"); |
20600 | 1279 |
in case !reff |
1280 |
of NONE => error ("Could not retrieve value of ML reference " ^ quote ref_name |
|
1281 |
^ " (reference probably has been shadowed)") |
|
1282 |
| SOME value => value |
|
1283 |
end; |
|
20191 | 1284 |
|
18216 | 1285 |
end; (* local *) |
1286 |
||
20191 | 1287 |
|
20699 | 1288 |
|
20896 | 1289 |
(** theory data **) |
1290 |
||
1291 |
datatype syntax_expr = SyntaxExpr of { |
|
1292 |
class: ((string * (string -> string option)) * serial) Symtab.table, |
|
1293 |
inst: unit Symtab.table, |
|
1294 |
tyco: (itype pretty_syntax * serial) Symtab.table, |
|
1295 |
const: (iterm pretty_syntax * serial) Symtab.table |
|
1296 |
}; |
|
18702 | 1297 |
|
20896 | 1298 |
fun mk_syntax_expr ((class, inst), (tyco, const)) = |
1299 |
SyntaxExpr { class = class, inst = inst, tyco = tyco, const = const }; |
|
1300 |
fun map_syntax_expr f (SyntaxExpr { class, inst, tyco, const }) = |
|
1301 |
mk_syntax_expr (f ((class, inst), (tyco, const))); |
|
1302 |
fun merge_syntax_expr (SyntaxExpr { class = class1, inst = inst1, tyco = tyco1, const = const1 }, |
|
1303 |
SyntaxExpr { class = class2, inst = inst2, tyco = tyco2, const = const2 }) = |
|
1304 |
mk_syntax_expr ( |
|
1305 |
(Symtab.merge (eq_snd (op =)) (class1, class2), |
|
1306 |
Symtab.merge (op =) (inst1, inst2)), |
|
1307 |
(Symtab.merge (eq_snd (op =)) (tyco1, tyco2), |
|
1308 |
Symtab.merge (eq_snd (op =)) (const1, const2)) |
|
1309 |
); |
|
1310 |
||
1311 |
datatype syntax_modl = SyntaxModl of { |
|
21015 | 1312 |
alias: string Symtab.table, |
20896 | 1313 |
prolog: Pretty.T Symtab.table |
1314 |
}; |
|
20699 | 1315 |
|
21015 | 1316 |
fun mk_syntax_modl (alias, prolog) = |
1317 |
SyntaxModl { alias = alias, prolog = prolog }; |
|
1318 |
fun map_syntax_modl f (SyntaxModl { alias, prolog }) = |
|
1319 |
mk_syntax_modl (f (alias, prolog)); |
|
1320 |
fun merge_syntax_modl (SyntaxModl { alias = alias1, prolog = prolog1 }, |
|
1321 |
SyntaxModl { alias = alias2, prolog = prolog2 }) = |
|
20896 | 1322 |
mk_syntax_modl ( |
21015 | 1323 |
Symtab.merge (op =) (alias1, alias2), |
20896 | 1324 |
Symtab.merge (op =) (prolog1, prolog2) |
1325 |
); |
|
20699 | 1326 |
|
21015 | 1327 |
type serializer = Args.T list |
1328 |
-> string list |
|
1329 |
-> (string -> string option) |
|
1330 |
-> (string -> Pretty.T option) |
|
1331 |
-> (string -> (string * (string -> string option)) option) |
|
1332 |
-> (string -> (int * (fixity -> (fixity -> itype -> Pretty.T) -> itype list -> Pretty.T)) option) |
|
1333 |
-> (string -> (int * (fixity -> (fixity -> iterm -> Pretty.T) -> iterm list -> Pretty.T)) option) |
|
1334 |
-> CodegenThingol.code -> unit; |
|
20896 | 1335 |
|
1336 |
datatype target = Target of { |
|
1337 |
serial: serial, |
|
1338 |
serializer: serializer, |
|
1339 |
syntax_expr: syntax_expr, |
|
21015 | 1340 |
syntax_modl: syntax_modl, |
1341 |
reserved: string list |
|
20896 | 1342 |
}; |
20699 | 1343 |
|
21015 | 1344 |
fun mk_target (serial, ((serializer, reserved), (syntax_expr, syntax_modl))) = |
1345 |
Target { serial = serial, reserved = reserved, serializer = serializer, syntax_expr = syntax_expr, syntax_modl = syntax_modl }; |
|
1346 |
fun map_target f ( Target { serial, serializer, reserved, syntax_expr, syntax_modl } ) = |
|
1347 |
mk_target (f (serial, ((serializer, reserved), (syntax_expr, syntax_modl)))); |
|
1348 |
fun merge_target target (Target { serial = serial1, serializer = serializer, reserved = reserved1, |
|
1349 |
syntax_expr = syntax_expr1, syntax_modl = syntax_modl1 }, |
|
1350 |
Target { serial = serial2, serializer = _, reserved = reserved2, |
|
1351 |
syntax_expr = syntax_expr2, syntax_modl = syntax_modl2 }) = |
|
20896 | 1352 |
if serial1 = serial2 then |
21015 | 1353 |
mk_target (serial1, ((serializer, merge (op =) (reserved1, reserved2)), |
20896 | 1354 |
(merge_syntax_expr (syntax_expr1, syntax_expr2), |
1355 |
merge_syntax_modl (syntax_modl1, syntax_modl2)) |
|
1356 |
)) |
|
1357 |
else |
|
1358 |
error ("Incompatible serializers: " ^ quote target); |
|
1359 |
||
1360 |
structure CodegenSerializerData = TheoryDataFun |
|
1361 |
(struct |
|
1362 |
val name = "Pure/codegen_serializer"; |
|
1363 |
type T = target Symtab.table; |
|
1364 |
val empty = Symtab.empty; |
|
1365 |
val copy = I; |
|
1366 |
val extend = I; |
|
1367 |
fun merge _ = Symtab.join merge_target; |
|
1368 |
fun print _ _ = (); |
|
1369 |
end); |
|
1370 |
||
1371 |
fun the_serializer (Target { serializer, ... }) = serializer; |
|
21015 | 1372 |
fun the_reserved (Target { reserved, ... }) = reserved; |
20896 | 1373 |
fun the_syntax_expr (Target { syntax_expr = SyntaxExpr x, ... }) = x; |
1374 |
fun the_syntax_modl (Target { syntax_modl = SyntaxModl x, ... }) = x; |
|
1375 |
||
1376 |
fun add_serializer (target, seri) thy = |
|
18702 | 1377 |
let |
20896 | 1378 |
val _ = case Symtab.lookup (CodegenSerializerData.get thy) target |
1379 |
of SOME _ => warning ("overwriting existing serializer " ^ quote target) |
|
1380 |
| NONE => (); |
|
20699 | 1381 |
in |
20896 | 1382 |
thy |
1383 |
|> (CodegenSerializerData.map oo Symtab.map_default) |
|
21015 | 1384 |
(target, mk_target (serial (), ((seri, []), |
20896 | 1385 |
(mk_syntax_expr ((Symtab.empty, Symtab.empty), (Symtab.empty, Symtab.empty)), |
1386 |
mk_syntax_modl (Symtab.empty, Symtab.empty))))) |
|
21015 | 1387 |
(map_target (fn (serial, ((_, keywords), syntax)) => (serial, ((seri, keywords), syntax)))) |
20699 | 1388 |
end; |
1389 |
||
21015 | 1390 |
fun map_seri_data target f thy = |
1391 |
let |
|
1392 |
val _ = if is_some (Symtab.lookup (CodegenSerializerData.get thy) target) |
|
1393 |
then () |
|
1394 |
else error ("Unknown code target language: " ^ quote target); |
|
1395 |
in |
|
1396 |
thy |
|
1397 |
|> (CodegenSerializerData.map o Symtab.map_entry target o map_target) f |
|
1398 |
end; |
|
1399 |
||
1400 |
val target_diag = "diag"; |
|
1401 |
||
20896 | 1402 |
val _ = Context.add_setup ( |
1403 |
CodegenSerializerData.init |
|
1404 |
#> add_serializer ("SML", ml_from_thingol) |
|
21082 | 1405 |
#> add_serializer ("Haskell", isar_seri_haskell) |
21015 | 1406 |
#> add_serializer (target_diag, (fn _ => fn _ => seri_diagnosis)) |
20896 | 1407 |
); |
1408 |
||
21015 | 1409 |
fun get_serializer thy target args cs = |
20896 | 1410 |
let |
1411 |
val data = case Symtab.lookup (CodegenSerializerData.get thy) target |
|
1412 |
of SOME data => data |
|
1413 |
| NONE => error ("Unknown code target language: " ^ quote target); |
|
1414 |
val seri = the_serializer data; |
|
21015 | 1415 |
val reserved = the_reserved data; |
1416 |
val { alias, prolog } = the_syntax_modl data; |
|
20896 | 1417 |
val { class, inst, tyco, const } = the_syntax_expr data; |
1418 |
fun fun_of sys = (Option.map fst oo Symtab.lookup) sys; |
|
21015 | 1419 |
val project = if target = target_diag then I |
1420 |
else CodegenThingol.project_code |
|
1421 |
(Symtab.keys class @ Symtab.keys inst @ Symtab.keys tyco @ Symtab.keys const) cs; |
|
20896 | 1422 |
in |
21015 | 1423 |
project #> seri args reserved (Symtab.lookup alias) (Symtab.lookup prolog) |
1424 |
(fun_of class) (fun_of tyco) (fun_of const) |
|
20896 | 1425 |
end; |
1426 |
||
21082 | 1427 |
fun assert_serializer thy target = |
1428 |
case Symtab.lookup (CodegenSerializerData.get thy) target |
|
1429 |
of SOME data => target |
|
1430 |
| NONE => error ("Unknown code target language: " ^ quote target); |
|
1431 |
||
20896 | 1432 |
fun has_serialization f thy targets name = |
1433 |
forall ( |
|
1434 |
is_some o (fn tab => Symtab.lookup tab name) o f o the_syntax_expr o the |
|
1435 |
o (Symtab.lookup ((CodegenSerializerData.get) thy)) |
|
1436 |
) targets; |
|
1437 |
||
1438 |
val tyco_has_serialization = has_serialization #tyco; |
|
1439 |
val const_has_serialization = has_serialization #const; |
|
1440 |
||
1441 |
fun eval_term thy = |
|
1442 |
let |
|
1443 |
val target = "SML"; |
|
1444 |
val data = case Symtab.lookup (CodegenSerializerData.get thy) target |
|
1445 |
of SOME data => data |
|
1446 |
| NONE => error ("Unknown code target language: " ^ quote target); |
|
21015 | 1447 |
val reserved = the_reserved data; |
1448 |
val { alias, prolog } = the_syntax_modl data; |
|
20896 | 1449 |
val { class, inst, tyco, const } = the_syntax_expr data; |
1450 |
fun fun_of sys = (Option.map fst oo Symtab.lookup) sys; |
|
1451 |
in |
|
21015 | 1452 |
eval_term_proto thy reserved (Symtab.lookup alias) (Symtab.lookup prolog) (fun_of class) (fun_of tyco) (fun_of const) |
20896 | 1453 |
(Symtab.keys class @ Symtab.keys inst @ Symtab.keys tyco @ Symtab.keys const) |
1454 |
end; |
|
1455 |
||
1456 |
||
20699 | 1457 |
|
20931 | 1458 |
(** ML and toplevel interface **) |
20699 | 1459 |
|
1460 |
local |
|
1461 |
||
21015 | 1462 |
fun map_syntax_exprs target = |
1463 |
map_seri_data target o (apsnd o apsnd o apfst o map_syntax_expr); |
|
1464 |
fun map_syntax_modls target = |
|
1465 |
map_seri_data target o (apsnd o apsnd o apsnd o map_syntax_modl); |
|
1466 |
fun map_reserveds target = |
|
1467 |
map_seri_data target o (apsnd o apfst o apsnd); |
|
20896 | 1468 |
|
20699 | 1469 |
fun gen_add_syntax_class prep_class prep_const target raw_class (syntax, raw_ops) thy = |
1470 |
let |
|
1471 |
val cls = prep_class thy raw_class |
|
1472 |
val class = CodegenNames.class thy cls; |
|
20896 | 1473 |
fun mk_classop (const as (c, _)) = case AxClass.class_of_param thy c |
1474 |
of SOME class' => if cls = class' then CodegenNames.const thy const |
|
20699 | 1475 |
else error ("Not a class operation for class " ^ quote class ^ ": " ^ quote c) |
1476 |
| NONE => error ("Not a class operation: " ^ quote c) |
|
1477 |
val ops = (map o apfst) (mk_classop o prep_const thy) raw_ops; |
|
1478 |
val syntax_ops = AList.lookup (op =) ops; |
|
1479 |
in |
|
1480 |
thy |
|
20896 | 1481 |
|> (map_syntax_exprs target o apfst o apfst) |
1482 |
(Symtab.update (class, ((syntax, syntax_ops), serial ()))) |
|
20699 | 1483 |
end; |
1484 |
||
1485 |
fun gen_add_syntax_inst prep_class prep_tyco target (raw_tyco, raw_class) thy = |
|
1486 |
let |
|
1487 |
val inst = CodegenNames.instance thy (prep_class thy raw_class, prep_tyco thy raw_tyco); |
|
1488 |
in |
|
1489 |
thy |
|
20896 | 1490 |
|> (map_syntax_exprs target o apfst o apsnd) |
1491 |
(Symtab.update (inst, ())) |
|
20699 | 1492 |
end; |
1493 |
||
21015 | 1494 |
fun gen_add_syntax_tyco prep_tyco target raw_tyco (syntax as (n, _)) thy = |
20699 | 1495 |
let |
21015 | 1496 |
val tyco = prep_tyco thy raw_tyco; |
1497 |
val tyco' = CodegenNames.tyco thy tyco; |
|
1498 |
val _ = if n > Sign.arity_number thy tyco |
|
1499 |
then error ("Too many arguments in syntax for type constructor " ^ quote tyco) |
|
1500 |
else () |
|
20699 | 1501 |
in |
1502 |
thy |
|
20896 | 1503 |
|> (map_syntax_exprs target o apsnd o apfst) |
21015 | 1504 |
(Symtab.update (tyco', (syntax, serial ()))) |
20699 | 1505 |
end; |
1506 |
||
21015 | 1507 |
fun gen_add_syntax_const prep_const target raw_c (syntax as (n, _)) thy = |
20699 | 1508 |
let |
21015 | 1509 |
val c = prep_const thy raw_c; |
1510 |
val c' = CodegenNames.const thy c; |
|
1511 |
val _ = if n > (length o fst o strip_type o Sign.the_const_type thy o fst) c |
|
1512 |
then error ("Too many arguments in syntax for constant " ^ (quote o fst) c) |
|
1513 |
else () |
|
20699 | 1514 |
in |
1515 |
thy |
|
20896 | 1516 |
|> (map_syntax_exprs target o apsnd o apsnd) |
21015 | 1517 |
(Symtab.update (c', (syntax, serial ()))) |
20699 | 1518 |
end; |
1519 |
||
1520 |
fun read_type thy raw_tyco = |
|
1521 |
let |
|
1522 |
val tyco = Sign.intern_type thy raw_tyco; |
|
1523 |
val _ = if Sign.declared_tyname thy tyco then () |
|
1524 |
else error ("No such type constructor: " ^ quote raw_tyco); |
|
1525 |
in tyco end; |
|
1526 |
||
1527 |
fun idfs_of_const_names thy cs = |
|
1528 |
let |
|
1529 |
val cs' = AList.make (fn c => Sign.the_const_type thy c) cs; |
|
1530 |
val cs'' = map (CodegenConsts.norm_of_typ thy) cs'; |
|
1531 |
in AList.make (CodegenNames.const thy) cs'' end; |
|
1532 |
||
21015 | 1533 |
val add_syntax_class = gen_add_syntax_class ClassPackage.read_class CodegenConsts.read_const; |
1534 |
val add_syntax_inst = gen_add_syntax_inst ClassPackage.read_class read_type; |
|
1535 |
val add_syntax_tyco = gen_add_syntax_tyco read_type; |
|
1536 |
val add_syntax_const = gen_add_syntax_const CodegenConsts.read_const; |
|
1537 |
||
1538 |
fun add_reserved target = |
|
1539 |
map_reserveds target o insert (op =); |
|
1540 |
||
1541 |
fun add_modl_alias target = |
|
1542 |
map_syntax_modls target o apfst o Symtab.update o apsnd CodegenNames.check_modulename; |
|
1543 |
||
1544 |
fun add_modl_prolog target = |
|
1545 |
map_syntax_modls target o apsnd o |
|
1546 |
(fn (modl, NONE) => Symtab.delete modl | (modl, SOME prolog) => |
|
1547 |
Symtab.update (modl, Pretty.str prolog)); |
|
20931 | 1548 |
|
1549 |
fun zip_list (x::xs) f g = |
|
21015 | 1550 |
f |
1551 |
#-> (fn y => |
|
1552 |
fold_map (fn x => g |-- f >> pair x) xs |
|
20931 | 1553 |
#-> (fn xys => pair ((x, y) :: xys))); |
20699 | 1554 |
|
20931 | 1555 |
structure P = OuterParse |
1556 |
and K = OuterKeyword |
|
20699 | 1557 |
|
20931 | 1558 |
fun parse_multi_syntax parse_thing parse_syntax = |
1559 |
P.and_list1 parse_thing |
|
21015 | 1560 |
#-> (fn things => Scan.repeat1 (P.$$$ "(" |-- P.name -- |
1561 |
(zip_list things parse_syntax (P.$$$ "and")) --| P.$$$ ")")); |
|
20699 | 1562 |
|
21015 | 1563 |
val (code_classK, code_instanceK, code_typeK, code_constK, |
1564 |
code_reservedK, code_modulenameK, code_moduleprologK) = |
|
1565 |
("code_class", "code_instance", "code_type", "code_const", |
|
1566 |
"code_reserved", "code_modulename", "code_moduleprolog"); |
|
20699 | 1567 |
|
21015 | 1568 |
in |
1569 |
||
1570 |
fun add_pretty_list target nill cons mk_list mk_char_string target_cons thy = |
|
20699 | 1571 |
let |
21015 | 1572 |
val [(_, nil''), (cons', cons'')] = idfs_of_const_names thy [nill, cons]; |
1573 |
val pr = pretty_list nil'' cons'' mk_list mk_char_string target_cons; |
|
20699 | 1574 |
in |
21015 | 1575 |
thy |
1576 |
|> gen_add_syntax_const (K I) target cons' pr |
|
20699 | 1577 |
end; |
1578 |
||
21015 | 1579 |
fun add_pretty_ml_string target nill cons str mk_char mk_string target_implode thy = |
20699 | 1580 |
let |
21015 | 1581 |
val [(_, nil''), (_, cons''), (str', _)] = idfs_of_const_names thy [nill, cons, str]; |
1582 |
val pr = pretty_ml_string nil'' cons'' mk_char mk_string target_implode; |
|
20699 | 1583 |
in |
21015 | 1584 |
thy |
1585 |
|> gen_add_syntax_const (K I) target str' pr |
|
20699 | 1586 |
end; |
1587 |
||
21015 | 1588 |
fun add_undefined target undef target_undefined thy = |
1589 |
let |
|
1590 |
val [(undef', _)] = idfs_of_const_names thy [undef]; |
|
1591 |
fun pretty _ _ _ = str target_undefined; |
|
1592 |
in |
|
1593 |
thy |
|
1594 |
|> gen_add_syntax_const (K I) target undef' (~1, pretty) |
|
1595 |
end; |
|
20931 | 1596 |
|
1597 |
val code_classP = |
|
1598 |
OuterSyntax.command code_classK "define code syntax for class" K.thy_decl ( |
|
1599 |
parse_multi_syntax P.xname |
|
21015 | 1600 |
(P.string -- Scan.optional (P.$$$ "where" |-- Scan.repeat1 |
20931 | 1601 |
(P.term --| (P.$$$ "\\<equiv>" || P.$$$ "==") -- P.string)) []) |
1602 |
>> (Toplevel.theory oo fold) (fn (target, syns) => |
|
1603 |
fold (fn (raw_class, syn) => add_syntax_class target raw_class syn) syns) |
|
1604 |
); |
|
1605 |
||
1606 |
val code_instanceP = |
|
1607 |
OuterSyntax.command code_instanceK "define code syntax for instance" K.thy_decl ( |
|
1608 |
parse_multi_syntax (P.xname --| P.$$$ "::" -- P.xname) |
|
21015 | 1609 |
(P.name #-> |
20931 | 1610 |
(fn "-" => Scan.succeed () | _ => Scan.fail_with (fn _ => "\"-\" expected") ())) |
1611 |
>> (Toplevel.theory oo fold) (fn (target, syns) => |
|
1612 |
fold (fn (raw_inst, ()) => add_syntax_inst target raw_inst) syns) |
|
1613 |
); |
|
1614 |
||
1615 |
val code_typeP = |
|
1616 |
OuterSyntax.command code_typeK "define code syntax for type constructor" K.thy_decl ( |
|
21015 | 1617 |
parse_multi_syntax P.xname parse_syntax |
1618 |
>> (Toplevel.theory oo fold) (fn (target, syns) => |
|
1619 |
fold (fn (raw_tyco, syn) => add_syntax_tyco target raw_tyco syn) syns) |
|
20931 | 1620 |
); |
1621 |
||
1622 |
val code_constP = |
|
1623 |
OuterSyntax.command code_constK "define code syntax for constant" K.thy_decl ( |
|
21015 | 1624 |
parse_multi_syntax P.term parse_syntax |
1625 |
>> (Toplevel.theory oo fold) (fn (target, syns) => |
|
1626 |
fold (fn (raw_const, syn) => add_syntax_const target raw_const syn) syns) |
|
20931 | 1627 |
); |
1628 |
||
21015 | 1629 |
val code_reservedP = |
1630 |
OuterSyntax.command code_reservedK "declare words as reserved for target language" K.thy_decl ( |
|
1631 |
P.name -- Scan.repeat1 P.name |
|
1632 |
>> (fn (target, reserveds) => (Toplevel.theory o fold (add_reserved target)) reserveds) |
|
1633 |
) |
|
20699 | 1634 |
|
21015 | 1635 |
val code_modulenameP = |
21082 | 1636 |
OuterSyntax.command code_modulenameK "alias module to other name" K.thy_decl ( |
21015 | 1637 |
P.name -- Scan.repeat1 (P.name -- P.name) |
1638 |
>> (fn (target, modlnames) => (Toplevel.theory o fold (add_modl_alias target)) modlnames) |
|
1639 |
) |
|
20699 | 1640 |
|
21015 | 1641 |
val code_moduleprologP = |
21082 | 1642 |
OuterSyntax.command code_moduleprologK "add prolog to module" K.thy_decl ( |
21015 | 1643 |
P.name -- Scan.repeat1 (P.name -- (P.string >> (fn "-" => NONE | s => SOME s))) |
1644 |
>> (fn (target, prologs) => (Toplevel.theory o fold (add_modl_prolog target)) prologs) |
|
1645 |
) |
|
1646 |
||
1647 |
val _ = OuterSyntax.add_parsers [code_classP, code_instanceP, code_typeP, code_constP, |
|
1648 |
code_reservedP, code_modulenameP, code_moduleprologP]; |
|
20699 | 1649 |
|
21082 | 1650 |
val _ = Context.add_setup (add_reserved "Haskell" "Show" #> add_reserved "Haskell" "Read") |
1651 |
||
20699 | 1652 |
end; (*local*) |
18702 | 1653 |
|
21093 | 1654 |
end; (*struct*) |