forked from pikatchu/LinearML
/
eval.ml
286 lines (260 loc) · 7.34 KB
/
eval.ml
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
(*
Copyright (c) 2011, Julien Verlaguet
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the
distribution.
3. Neither the name of Julien Verlaguet nor the names of
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*)
open Utils
open Ist
type value =
| Unit
| Bool of bool
| Char of char
| Int of int
| Float of float
| String of string
| Array of value array
| Variant of id * value list
| Record of value list IMap.t
| Fun of pat * tuple
| Prim1 of (value -> value)
| Prim2 of (value -> value -> value)
module Genv = struct
let make_prims env =
let env = ref env in
let register x v =
env := IMap.add x v !env
in
register Naming.bnot (Prim1
(function
| Bool b -> Bool (not b)
| _ -> assert false
));
register Naming.alength (Prim1
(function
| Array a -> Int (Array.length a)
| _ -> assert false
));
register Naming.imake (Prim2
(fun size v ->
match size, v with
| Int size, v -> Array (Array.make size v)
| _ -> assert false
));
register Naming.imake (Prim2
(fun size v ->
match size, v with
| Int size, v -> Array (Array.make size v)
| _ -> assert false
));
!env
let rec program mdl =
let env = IMap.empty in
List.fold_left module_ env mdl
and module_ env md =
List.fold_left def env md.md_defs
and def env (_, x, p, t) =
IMap.add x (Fun (p, t)) env
end
let rec program root_id mdl =
let env = Genv.program mdl in
(match root_id with
| None -> failwith "main not found"
| Some (_, id) ->
match IMap.find id env with
| Fun (_, e) ->
let v = tuple env e in
let o = output_string stdout in
print o v
| _ -> assert false)
and pat env ptl vl =
match ptl with
| [] -> failwith "match failed"
| pt :: rl ->
(try pat_tuple env pt vl
with Exit -> pat env rl vl)
and pat_tuple env pel vl =
List.fold_left2 pat_el env pel vl
and pat_el env (_, p) v =
pat_ env p v
and pat_ env p v =
match p with
| Pany -> env
| Pid x -> IMap.add x v env
| Pvalue _ -> assert false
| Pvariant (x, p) ->
(match v with
| Variant (y, vl) when x = y ->
pat env p vl
| _ -> raise Exit)
| Precord pfl ->
(match v with
| Record fds ->
List.fold_left (pat_field fds) env pfl
| _ -> raise Exit)
| Pas (x, p) ->
let env = pat env p [v] in
IMap.add x v env
and pat_field fds env = function
| PFany -> env
| PFid x -> IMap.add x (Record fds) env
| PField (x, p) ->
let fd = IMap.find x fds in
pat env p fd
and tuple env el =
List.flatten (List.map (expr env) el)
and expr env (_, e) = expr_ env e
and expr_ env = function
| Eid x ->
(try [IMap.find x env]
with Not_found ->
let x = Ident.to_string x in
Printf.fprintf stderr "Not an interpreted value: %s" x;
exit 2)
| Evalue v -> [value v]
| Evariant (x, e) ->
let e = tuple env e in
[Variant (x, e)]
| Ebinop (bop, e1, e2) ->
let e1 = List.hd (expr env e1) in
let e2 = List.hd (expr env e2) in
[binop bop e1 e2]
| Euop (uop, e) ->
let e = List.hd (expr env e) in
[unop uop e]
| Erecord fdl ->
let fields = List.fold_left (field env) IMap.empty fdl in
[Record fields]
| Ewith (e, fdl) ->
let e = expr env e in
(match e with
| [Record fds] ->
let fields = List.fold_left (field env) fds fdl in
[Record fields]
| _ -> assert false)
| Efield (e, v) ->
(match expr env e with
| [Record fds] -> IMap.find v fds
| _ -> assert false)
| Ematch (e, al) ->
actions env (tuple env e) al
| Elet (p, e1, e2) ->
let env = pat env p (tuple env e1) in
tuple env e2
| Eif (c, e1, e2) ->
(match expr env c with
| [Bool true] -> tuple env e1
| [Bool false] -> tuple env e2
| _ -> assert false)
| Eapply (_, _, f, e) ->
(match IMap.find f env with
| Fun (p, b) ->
let env = pat env p (tuple env e) in
tuple env b
| _ -> assert false)
| Eseq (e1, e2) ->
let _ = expr env e1 in
tuple env e2
| Efree _ -> [Unit]
| Eset (e1, e2, e3) ->
[match expr env e1, expr env e2 with
| [Array a], [Int i] ->
let v = List.hd (expr env e3) in
a.(i) <- v ;
Unit
| _ -> assert false]
| Eget (e1, e2) ->
[match expr env e1, expr env e2 with
| [Array a], [Int i] -> a.(i)
| _ -> assert false]
| Eswap (e1, e2, e3) ->
[match expr env e1, expr env e2 with
| [Array a], [Int i] ->
let res = a.(i) in
a.(i) <- List.hd (expr env e3) ;
res
| _ -> assert false]
| Epartial _ -> failwith "TODO partial"
| Efun (_, pel, e) -> failwith "TODO fun"
and field env acc (x, e) =
let e = tuple env e in
IMap.add x e acc
and value = function
| Eunit -> Unit
| Ebool b -> Bool b
| Eint n -> Int (int_of_string n)
| Efloat f -> Float (float_of_string f)
| Echar c -> Char (c.[0])
| Estring s -> String s
and binop bop e1 e2 =
match bop with
| Ast.Eeq -> Bool (e1 = e2)
| Ast.Ediff -> Bool (e1 <> e2)
| Ast.Elt -> Bool (e1 < e2)
| Ast.Elte -> Bool (e1 <= e2)
| Ast.Egt -> Bool (e1 > e2)
| Ast.Egte -> Bool (e1 >= e2)
| Ast.Eor
| Ast.Eand as op ->
Bool (bool_op op e1 e2)
| Ast.Eplus
| Ast.Eminus
| Ast.Estar
| Ast.Emod
| Ast.Ediv as op ->
Int (int_op op e1 e2)
| Ast.Eband -> failwith "TODO"
and bool_op op e1 e2 =
match e1, e2 with
| Bool b1, Bool b2 ->
(match op with
| Ast.Eor -> b1 || b2
| Ast.Eand -> b1 && b2
| _ -> assert false
)
| _ -> assert false
and int_op op e1 e2 =
match e1, e2 with
| Int n1, Int n2 ->
(match op with
| Ast.Eplus -> n1 + n2
| Ast.Eminus -> n1 - n2
| Ast.Estar -> n1 * n2
| Ast.Emod -> n1 mod n2
| Ast.Ediv -> n1 / n2
| _ -> assert false
)
| _ -> assert false
and unop op e =
match e with
| Int n -> Int (-n)
| _ -> assert false
and actions env e al =
match al with
| [] -> failwith "pattern-match failed"
| (p, a) :: rl ->
(try
let env = pat env p e in
tuple env a
with Exit -> actions env e rl)