/
explode.rml
411 lines (295 loc) · 10 KB
/
explode.rml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
(**
** file: scode.rml
** description: SCode intermediate form
**
** RCS: $Id$
**
**)
module SCode :
with "absyn.rml"
type Ident = Absyn.Ident
type Path = Absyn.Path
type Subscript = Absyn.Subscript
type Restriction = Absyn.Restriction
datatype SubMod = NAMEMOD of Ident * Mod
| IDXMOD of Subscript list * Mod
and Mod = MOD of bool * (SubMod list) * (Absyn.Exp option)
| REDECL of bool * Absyn.ElementSpec
| NOMOD
type Program = Class list
(** - Classes *)
datatype Class = CLASS of Ident (* Name *)
* bool (* Partial *)
* Restriction (* Restricion *)
* ClassDef (* Parts *)
(* FIXME: should the name really be part of the class type? *)
datatype ClassDef = PARTS of Element list
* Equation list
* Algorithm list
| DERIVED of Path
* Absyn.ArrayDim option
* Mod
(* - Equations *)
datatype Equation = EQ_EXPR of Absyn.Exp (* more later? *)
| EQ_IF of Absyn.Exp (* conditional *)
* Equation list (* true branch *)
* Equation list (* false branch *)
| EQ_EQUALS of Absyn.Exp * Absyn.Exp
| EQ_CONNECT of Absyn.ComponentRef * Absyn.ComponentRef
| EQ_FOR of Ident * Absyn.Exp * Equation list
(** - Algorithms *)
datatype Algorithm = ALGORITHM of Absyn.Algorithm list
(** - Elements *)
datatype Element = EXTENDS of Path * Mod
| CLASSDEF of Ident (* name *)
* bool (* final *)
* bool (* replaceable *)
* Class
| COMPONENT of Ident (* component name *)
* bool (* final *)
* bool (* protected *)
* Attributes
* Path (* type name *)
* Mod
(** There are three types of elements in a declaration, represented *)
(** by the constructors `EXTENDS' (for `extends' clauses), *)
(** `CLASSDEF' (for local class definitions) and `COMPONENT' (for *)
(** local variables). *)
datatype Attributes = ATTR of Absyn.ArrayDim
* bool (* flow *)
* Accessibility
* Absyn.Variability (* parameter *)
* Absyn.Direction
datatype Accessibility = RW (* read/write *)
| RO (* read-only *)
| WO (* write-only (not used) *)
relation elaborate : Absyn.Program => Program
(* Modification handling *)
relation build_mod : (Absyn.Modification option, bool) => Mod
relation print_mod : Mod => ()
end
with "dump.rml"
(** relation: elaborate
**)
relation elaborate: Absyn.Program => Program =
axiom elaborate([]) => []
rule elab_class(c) => c' &
elaborate(cs) => cs'
-----------------------------
elaborate(c::cs) => (c'::cs')
end
(** relation: elab_class
**)
relation elab_class: Absyn.Class => Class =
rule elab_classdef d => d'
--------------------------------------------
elab_class(Absyn.CLASS(n,p,r,d)) => CLASS(n,p,r,d')
end
(** relation: elab_classdef
**)
relation elab_classdef: Absyn.ClassDef => ClassDef =
rule build_mod(SOME(Absyn.CLASSMOD(a, NONE)), false) => mod
------------------------------------------------
elab_classdef(Absyn.DERIVED(p,d,a)) => DERIVED(p,d,mod)
axiom elab_classdef(Absyn.PARTS([])) => PARTS([],[],[])
(* Lots of unnecessary consing ahead... *)
rule elab_classdef(Absyn.PARTS(ps)) => PARTS(els,eqs,als) &
elab_equations(l) => l' &
list_append(eqs,l') => eqs'
------------------------------
elab_classdef(Absyn.PARTS(Absyn.EQUATIONS(l)::ps))
=> PARTS(els,eqs',als)
rule elab_classdef(Absyn.PARTS(ps)) => PARTS(els,eqs,als) &
let als' = ALGORITHM(l)::als
----------------------------
elab_classdef(Absyn.PARTS(Absyn.ALGORITHMS(l)::ps))
=> PARTS(els,eqs,als')
rule elab_classdef(Absyn.PARTS(ps)) => PARTS(els,eqs,als) &
elab_elist(es,false) => es' &
list_append(els,es') => els'
------------------------------
elab_classdef(Absyn.PARTS(Absyn.PUBLIC(es)::ps))
=> PARTS(els',eqs,als)
rule elab_classdef(Absyn.PARTS(ps)) => PARTS(els,eqs,als) &
elab_elist(es,true) => es' &
list_append(els,es') => els'
------------------------------
elab_classdef(Absyn.PARTS(Absyn.PROTECTED(es)::ps))
=> PARTS(els',eqs,als)
end
(** relation: elab_elist
**)
relation elab_elist : (Absyn.Element list, bool) => Element list =
axiom elab_elist([],_) => []
rule elab_element(e, prot) => e' &
elab_elist(es, prot) => es' &
list_append(e',es') => l
---------------------
elab_elist(e::es, prot) => l
end
(** relation: elab_element
**)
relation elab_element : (Absyn.Element, bool) => Element list =
rule elab_elementspec(f,prot,s) => es
--------------------------------
elab_element(Absyn.ELEMENT(f,_,s), prot) => es
end
(** relation: elab_elementspec
**)
relation elab_elementspec: (bool,bool,Absyn.ElementSpec) => Element list =
rule elab_classdef(de) => de'
-----------------------
elab_elementspec(final,prot,Absyn.CLASSDEF(rp,Absyn.CLASS(n,pa,re,de)))
=> [CLASSDEF(n,final,rp,CLASS(n,pa,re,de'))]
rule build_mod(SOME(Absyn.CLASSMOD(args, NONE)), false) => mod &
Absyn.path_string(n) => ns &
print "extends " & print ns & print_mod mod & print "\n"
---------------------------------------------------
elab_elementspec(final,prot,Absyn.EXTENDS(n,args))
=> [EXTENDS(n,mod)]
axiom elab_elementspec(_,_,Absyn.COMPONENTS(_,_,[])) => []
rule elab_elementspec(final,prot,Absyn.COMPONENTS(attr,t,xs)) => xs' &
build_mod(m,false) => mod
--------------------------------------------------
elab_elementspec(final,prot,
Absyn.COMPONENTS(attr as Absyn.ATTR(fl,pa,di),t,
(Absyn.COMPONENT(n,d,m))::xs))
=> COMPONENT(n,final,prot,ATTR(d,fl,RW,pa,di),t,mod)::xs'
end
(** relation: elab_equations
**)
relation elab_equations : Absyn.Equation list => Equation list =
axiom elab_equations [] => []
rule elab_equation e => e' &
elab_equations es => es'
------------------------
elab_equations e::es => e'::es'
end
(** relation: elab_equation
**
** The translation of equations are straightforward, with one
** exception. `If' clauses are translated so that the SCode only
** contains simple `if'-`else' constructs, and no `elseif'.
**)
relation elab_equation : Absyn.Equation => Equation =
axiom elab_equation Absyn.EQ_EXPR(e) => EQ_EXPR(e)
rule elab_equations tb => tb' &
elab_equations fb => fb'
------------------------
elab_equation Absyn.EQ_IF(e,tb,[],fb) => EQ_IF(e,tb',fb')
rule elab_equation Absyn.EQ_IF(e,tb,[],[Absyn.EQ_IF(ee,ei,eis,fb)]) => eq
------------------------------------------------------------------
elab_equation Absyn.EQ_IF(e,tb,(ee,ei)::eis,fb) => eq
axiom elab_equation Absyn.EQ_EQUALS(e1,e2) => EQ_EQUALS(e1,e2)
axiom elab_equation Absyn.EQ_CONNECT(c1,c2) => EQ_CONNECT(c1,c2)
rule elab_equations l => l'
----------------------
elab_equation Absyn.EQ_FOR(i,e,l) => EQ_FOR(i,e,l')
end
(** - Modification management *)
(** relation: build_mod
**
** Builds an `SCode.Mod' from an `Absyn.Modification'. The boolean
** argument flags whether the modification is `final'.
**)
relation build_mod : (Absyn.Modification option, bool) => Mod =
axiom build_mod(NONE, _) => NOMOD
axiom build_mod(SOME(Absyn.CLASSMOD([], e as SOME(_))), final)
=> MOD(final,[],e)
rule build_args(l) => subs
---------------------------------
build_mod(SOME(Absyn.CLASSMOD(l,e)),final) => MOD(final,subs,e)
end
relation build_args : (Absyn.ElementArg list) => SubMod list =
axiom build_args [] => []
rule build_args xs => subs &
build_mod(SOME(mod),final) => mod' &
build_sub(cref,mod') => sub
----------------------
build_args((Absyn.MODIFICATION(final,cref,mod)::xs)) => (sub::subs)
rule build_args xs => subs &
Absyn.element_spec_name spec => n
---------------------------
build_args((Absyn.REDECLARATION(final,spec)::xs))
=> (NAMEMOD(n,REDECL(final,spec))::subs)
end
(** relation: build_sub
**
** This relation converts a `ComponentRef' into a number of nested
** `SUBMOD's.
**)
relation build_sub : (Absyn.ComponentRef,Mod) => SubMod =
(* First some rules to prevent bad modifications *)
rule print "# Illegal modification of " & Dump.print_component_ref c &
Dump.print_component_ref c & print "\n"
---------------------------------------
build_sub(c as Absyn.CREF_IDENT(_,_::_),MOD(_,_::_,_)) => fail
rule print "# Illegal modification of " &
Dump.print_component_ref c & print "\n"
---------------------------------------
build_sub(c as Absyn.CREF_QUAL(_,_::_,_),MOD(_,_::_,_)) => fail
(* Then the normal rules *)
rule build_sub_sub (ss,mod) => mod'
------------------------------
build_sub(Absyn.CREF_IDENT(i,ss),mod) => NAMEMOD(i,mod')
rule build_sub(path,mod) => sub &
let mod = MOD(false,[sub],NONE) &
build_sub_sub(ss,mod) => mod'
--------------------------
build_sub(Absyn.CREF_QUAL(i,ss,path),mod) => NAMEMOD(i,mod')
end
(** relation: build_sub_sub *)
relation build_sub_sub : (Subscript list, Mod) => Mod =
axiom build_sub_sub ([], m) => m
axiom build_sub_sub (l, m) => MOD(false(*FIXME*),[IDXMOD(l,m)],NONE)
end
(** relation: print_mod *)
relation print_mod : Mod => () =
axiom print_mod(NOMOD)
rule print "(redeclared)"
------------------------------
print_mod REDECL(_,_)
rule print_final final &
print_subs1 subs &
print_eqmod ass
------------
print_mod MOD(final, subs, ass)
end
(**)
relation print_final : bool => () =
axiom print_final false
rule print " final "
--------------
print_final true
end
relation print_subs : SubMod list => () =
axiom print_subs []
rule print n & print_mod mod
-----------------------
print_subs [NAMEMOD(n,mod)]
rule print n & print_mod mod & print ", " &
print_subs subs
---------------
print_subs NAMEMOD(n,mod)::subs
rule Dump.print_subscripts ss & print_mod mod
------------------
print_subs [IDXMOD(ss,mod)]
rule Dump.print_subscripts ss & print_mod mod & print ", " &
print_subs subs
--------------
print_subs IDXMOD(ss,mod)::subs
end
relation print_subs1 : SubMod list => () =
axiom print_subs1 [] => ()
rule print "(" &
print_subs l &
print ")"
-----------
print_subs1 l
end
relation print_eqmod : Absyn.Exp option => () =
axiom print_eqmod NONE
rule print " = " & Dump.print_exp e
-----------------------------
print_eqmod SOME(e)
end