-
Notifications
You must be signed in to change notification settings - Fork 18
/
translator.lua
1722 lines (1565 loc) · 46.8 KB
/
translator.lua
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
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
--[=[
Copyright (C) 2013-2014 Richard Hundt and contributors.
See Copyright Notice in shine
]=]
local util = require('shine.lang.util')
local tvm = require("tvm")
local DEBUG = true
local Op = { }
setmetatable(Op, {
__call = function(Op, ...)
local v = ...
local t = type(v)
if t == 'string' then
if v == '...' then
return '!vararg'
end
return tvm.quote(v)
elseif v == true then
return '!true'
elseif v == false then
return '!false'
elseif v == nil then
if select('#', ...) == 0 then
return setmetatable({ }, Op)
else
return '!nil'
end
elseif t == 'table' then
return setmetatable(v, Op)
else
return tostring(v)
end
end
})
local wantnl = {
['!line'] = true,
['!do'] = true,
}
function Op.__tostring(o)
local t = { }
if o[0] then
t[#t+1] = '0: '..tostring(o[0])
end
for i = 1, #o do
t[#t+1] = tostring(o[i])
end
for k, v in pairs(o) do
if type(k) ~= 'number' or k < 0 or k > #o then
t[#t+1] = tostring(k)..': '..tostring(v)
end
end
return (wantnl[o[1]] and "\n(" or "(")..table.concat(t, ' ')..')'
end
local OpList = { }
setmetatable(OpList, {
__call = function(mt, t)
return setmetatable(t or { }, mt)
end
})
function OpList.__tostring(o)
local t = { }
for i=1, #o do
t[#t+1] = tostring(o[i])
end
return table.concat(t, " ")
end
local OpChunk = { }
setmetatable(OpChunk, {
__call = function(mt, t)
return setmetatable(t or { }, mt)
end
})
function OpChunk.__tostring(o)
local t = { }
for i=1, #o do
t[#t+1] = tostring(o[i])
end
return table.concat(t, "")
end
local Scope = { }
Scope.__index = Scope
function Scope.new(outer)
local self = {
outer = outer;
entries = { };
hoist = { };
block = { };
macro = { };
}
if outer then
setmetatable(self.macro, { __index = outer.macro })
else
local function reify(ctx, expr)
if expr.type == 'FunctionDeclaration' and expr.expression then
return ctx:oplist{ctx:op(tostring(ctx:get(expr.body)))}
end
return ctx:oplist{ctx:op(tostring(ctx:get(expr)))}
end
self.macro['reify!'] = reify
end
return setmetatable(self, Scope)
end
function Scope:define(name, info)
info.name = name
self.entries[name] = info
end
function Scope:lookup(name)
if self.entries[name] then
return self.entries[name]
elseif self.outer then
return self.outer:lookup(name)
else
return nil
end
end
local Context = { }
Context.__index = Context
function Context.new(name, opts)
local self = {
scope = Scope.new();
line = 1;
name = name or "(eval)";
undef = { };
opts = opts or { };
}
return setmetatable(self, Context)
end
function Context:abort(mesg, line)
mesg = string.format("shine: %s:%s: %s\n", self.name, line or self.line, mesg)
if DEBUG then
error(mesg)
else
io.stderr:write(mesg)
os.exit(1)
end
end
function Context:enter(type)
local topline
if type == "function" or type == "module" then
topline = self.line
else
topline = self.scope.topline
end
self.scope.type = type
self.scope = Scope.new(self.scope)
self.scope.topline = topline
if type == "function" then
self.scope.level = (self.scope.outer.level or 0) + 1
else
self.scope.level = self.scope.outer.level or 1
end
return self.scope.block
end
function Context:leave(block)
block = block or self.scope.hoist
-- propagate hoisted statements to outer scope
self:unhoist(block)
self.scope = self.scope.outer
end
function Context:in_module()
return self.scope.outer and self.scope.outer.type == "module"
end
function Context:hoist(stmt)
self.scope.hoist[#self.scope.hoist + 1] = stmt
end
function Context:unhoist(block)
for i=#self.scope.hoist, 1, -1 do
table.insert(block, 1, self.scope.hoist[i])
end
self.scope.hoist = { }
end
function Context:push(stmt)
local scope = self.scope.outer or self.scope
scope.block[#scope.block + 1] = stmt
end
function Context:shift(into)
for i=1, #self.scope.block do
into[#into + 1] = self.scope.block[i]
end
self.scope.block = { }
end
function Context:define(name, info, guard)
info = info or { line = self.line }
if guard then
info.guard = guard
end
self.scope:define(name, info)
for i=#self.undef, 1, -1 do
local u = self.undef[i]
if u.name == name and u.line < self.line then
if u.from.level <= self.scope.level then
self:abort(string.format("%q used before defined", u.name), u.line)
else
-- XXX: scan up
table.remove(self.undef, i)
end
end
end
return info
end
function Context:lookup(name)
return self.scope:lookup(name)
end
function Context:resolve(name)
if not self.opts.eval then
self.undef[#self.undef + 1] = {
name = name, line = self.line, from = self.scope
}
end
end
function Context:close()
for i=1, #self.undef do
local u = self.undef[i]
self:abort(string.format("%q used but not defined", u.name), u.line)
end
end
function Context:op(...)
return Op(...)
end
function Context:opchunk(...)
return OpChunk(...)
end
function Context:oplist(...)
return OpList(...)
end
function Context:reify(code)
local parser = require('shine.lang.parser')
local translator = require('shine.lang.translator')
local srctree = parser.parse(code, self.name, self.line)
return translator.translate(srctree, self.name, { eval = true })
end
function Context:sync(node)
if node.line then
self.line = node.line
end
return self.line
end
local match = { }
local globals = {
'Nil','Number','Boolean', 'String', 'Function', 'Coroutine', 'Range',
'UserData', 'Table', 'Array', 'Error', 'Module', 'Class', 'Object',
'Grammar', 'Pattern', 'ArrayPattern', 'TablePattern', 'ApplyPattern',
'__magic__', 'yield', 'take', 'typeof', 'null', 'warn', 'eval', 'any', 'all',
'__FILE__', '__LINE__', '_M', '_PACKAGE', '_NAME', 'Meta', 'Any', 'All'
}
for k,v in pairs(_G) do
globals[#globals + 1] = k
end
local magic = {
'null', '__range__', '__spread__', '__match__', '__extract__', '__each__',
'__var__', '__in__', '__is__', '__as__', '__lshift__', '__rshift__',
'__arshift__', '__bor__', '__bxor__', '__band__', '__bnot__'
}
function match:Chunk(node, opts)
local chunk = { }
for i=1, #globals do
self.ctx:define(globals[i])
end
self.ctx:enter("module")
-- import magic from core
chunk[#chunk + 1] = Op{'!line', Op("@"..self.ctx.name), Op(1) }
if not self.ctx.opts.eval then
chunk[#chunk + 1] = OpChunk{
Op{'!define', '__magic__', Op{'!index',
Op{'!call1', 'require', Op "core" }, Op"__magic__" } },
Op{'!call', Op{'!index', '_G', Op"module"}, '!vararg',
Op{'!index', '__magic__', Op"environ" } }
}
--[[
local sym = { }
for i = 1, #magic do
sym[#sym + 1] = magic[i]
end
chunk[#chunk + 1] = Op{'!define', Op(sym), Op(sym)}
--]]
end
for i=1, #node.body do
local line = self.ctx:sync(node.body[i])
local stmt = self:get(node.body[i])
self.ctx:shift(chunk)
chunk[#chunk + 1] = OpList{Op{'!line', line}, stmt}
end
local seen_export = self.ctx.seen_export
if seen_export then
self.ctx:hoist(Op{'!define', 'export', Op{ }})
end
self.ctx:leave(chunk)
if seen_export then
chunk[#chunk + 1] = Op{'!return', 'export'}
end
return OpChunk(chunk)
end
local translate
local function import_macro_func(import, package_name, func_name)
local errs = string.format(
"imported macro body for '%s' cannot be resolved",
name)
assert(type(package_name) == 'string', errs)
package_name = util.unquote(package_name)
local func = import(package_name, func_name)
assert(func ~= nil, errs)
return func
end
local function iterate_imported_symbols(import_stmt_node)
local function iterator(names_num, i)
if i >= names_num then return end
i = i + 1
local current_name = import_stmt_node.names[i]
local imported_symbol_alias = current_name[1].name
local imported_symbol
if current_name[2] then
imported_symbol = current_name[2].name
else
imported_symbol = imported_symbol_alias
end
return i, imported_symbol_alias, imported_symbol
end
return iterator, #import_stmt_node.names, 0
end
function match:ImportStatement(node)
if node.macro then
local import = require("core").__magic__.import
local package_name = self:get(node.from)
for i, macro_name, func_name in iterate_imported_symbols(node) do
local macro_func = import_macro_func(import, package_name, func_name)
self.ctx.scope.macro[macro_name] = macro_func
end
return OpChunk{ }
end
local args = OpList{ self:get(node.from) }
local syms = OpList{ }
for i=1, #node.names do
local n = node.names[i]
self.ctx:define(n[1].name, { type = "import", node = node })
if n[2] then
args[#args + 1] = Op(n[2].name)
else
args[#args + 1] = Op(n[1].name)
end
syms[#syms + 1] = n[1].name
end
if self.ctx.opts.eval then
return Op{'!massign', Op{ syms }, Op{ Op{'!call', 'import', args } } }
else
return Op{'!define', Op{ syms }, Op{ Op{'!call', 'import', args } } }
end
end
function match:ExportStatement(node)
local ops = { }
self.ctx.seen_export = true
for i=1, #node.names do
local expr = Op{'!index', 'export', Op(self:get(node.names[i])) }
ops[#ops + 1] = Op{'!assign', expr, self:get(node.names[i]) }
end
return OpChunk(ops)
end
function match:Literal(node)
return Op(node.value)
end
function match:Identifier(node)
if node.name == '__FILE__' then
return Op(self.ctx.name)
end
if node.name == '__LINE__' then
return Op(self.ctx.line)
end
if node.check then
local info = self.ctx:lookup(node.name)
if info == nil then
self.ctx:resolve(node.name)
end
end
return node.name
end
function match:MacroDeclaration(node)
local eval = self.ctx.opts.eval
self.ctx.opts.eval = true
local name = node.name.name
local core = require("core")
local func
if node.head == '=' then
local nref = node.body.name
local info = self.ctx:lookup(nref)
if info.type == 'import' then
local from = self:get(info.node.from)
local function import(package_name, func_name)
return require(package_name)[func_name]
end
for i, alias, func_name in iterate_imported_symbols(info.node) do
if alias == nref then
func = import_macro_func(import, from, func_name)
break
end
end
elseif info.type == 'function' then
local defn = self:get(info.node)
local wrap = OpChunk{ defn, Op{'!return', nref} }
wrap = assert(tvm.load(tostring(wrap)))
setfenv(wrap, core.__magic__.environ({ }))
func = wrap()
end
else
local head = self:list(node.head)
local body = self:list(node.body)
local wrap = OpChunk{
Op{'!return', Op{'!lambda', Op{ OpList(head) }, OpChunk(body) } }
}
wrap = assert(tvm.load(tostring(wrap)))
setfenv(wrap, core.__magic__.environ({ }))
func = wrap()
end
self.ctx.opts.eval = eval
self.ctx.scope.macro[name] = func
return OpChunk{ }
end
local function extract_bindings(node, ident)
local list = { }
local queue = { node }
while #queue > 0 do
local n = table.remove(queue)
if n.type == 'ArrayPattern' then
for i=#n.elements, 1, -1 do
queue[#queue + 1] = n.elements[i]
end
elseif n.type == 'TablePattern' then
for i=#n.entries, 1, -1 do
queue[#queue + 1] = n.entries[i].value
end
elseif n.type == 'ApplyPattern' then
for i=#n.arguments, 1, -1 do
queue[#queue + 1] = n.arguments[i]
end
elseif n.type == 'Identifier' then
list[#list + 1] = n
elseif n.type == 'MemberExpression' then
if ident then
queue[#queue + 1] = n.object
else
list[#list + 1] = n
end
else
assert(n.type == 'Literal')
end
end
return list
end
function match:LocalDeclaration(node)
node.is_local = true
local decl = { }
for i=1, #node.names do
local list = extract_bindings(node.names[i])
for i=1, #list do
if list[i].type == 'Identifier' then
decl[#decl + 1] = list[i].name
end
end
end
node.left = node.names
node.right = node.inits
local frag = OpChunk{ match.AssignmentExpression(self, node) }
for i=#node.decorators, 1, -1 do
local deco = node.decorators[i]
frag[#frag + 1] = Op{'!massign', Op{decl},
Op{Op{'!call', self:get(deco.term), OpList(decl) }}
}
end
return frag
end
function match:AssignmentExpression(node)
local body = { }
local decl = { }
local init = { }
local dest = { }
local chks = { }
local exps
if node.right then
exps = self:list(node.right)
else
exps = Op{Op(nil)}
end
for i=1, #node.left do
local n = node.left[i]
local t = n.type
if t == 'TablePattern' or t == 'ArrayPattern' or t == 'ApplyPattern' then
-- destructuring
local temp = util.genid()
self.ctx:define(temp)
local left = { }
n.temp = temp
n.left = left
init[#init + 1] = temp
decl[#decl + 1] = temp
dest[#dest + 1] = n
-- define new variables
local bind = extract_bindings(n)
for i=1, #bind do
local n = bind[i]
if n.type == 'Identifier' then
if node.is_local or n.guard or not self.ctx:lookup(n.name) then
local guard
if n.guard then
guard = util.genid()
body[#body + 1] = Op{'!let', guard, self:get(n.guard)}
end
self.ctx:define(n.name, nil, guard)
if not self.ctx.opts.eval then
decl[#decl + 1] = n.name
end
end
if self.ctx:lookup(n.name).guard then
chks[#chks + 1] = self.ctx:lookup(n.name)
end
left[#left + 1] = n.name
elseif n.type == 'MemberExpression' then
left[#left + 1] = self:get(n)
end
end
else
-- simple case
if n.type == 'Identifier' then
if node.is_local or n.guard or not self.ctx:lookup(n.name) then
local guard
if n.guard then
guard = util.genid()
body[#body + 1] = Op{'!let', guard, self:get(n.guard)}
end
self.ctx:define(n.name, nil, guard)
if not self.ctx.opts.eval then
decl[#decl + 1] = n.name
end
end
if self.ctx:lookup(n.name).guard then
chks[#chks + 1] = self.ctx:lookup(n.name)
end
end
init[#init + 1] = self:get(n)
end
end
-- declare locals
if #decl > 0 then
if #decl == 0 then
body[#body + 1] = Op{'!define', Op(decl)}
else
body[#body + 1] = Op{'!define', Op(decl), Op{Op(nil)}}
end
end
for i=1, #dest do
local patt = util.genid()
body[#body + 1] = Op{'!define', Op{ patt }, Op{ self:get(dest[i])} }
dest[i].patt = patt
end
body[#body + 1] = Op{'!massign', Op(init), Op(exps) }
-- destructure
for i=1, #dest do
body[#body + 1] = Op{'!massign',
Op(dest[i].left),
Op{ Op{'!call', '__extract__', dest[i].patt, dest[i].temp } } }
end
for i=1, #chks do
body[#body + 1] = Op{'!call', '__check__',
Op(chks[i].name), chks[i].name, chks[i].guard }
end
return OpChunk(body)
end
function match:ArrayPattern(node)
local list = { }
for i=1, #node.elements do
local n = node.elements[i]
if n.type == 'Identifier' or n.type == 'MemberExpression' then
list[#list + 1] = '__var__'
else
list[#list + 1] = self:get(n)
end
end
return Op{'!call', 'ArrayPattern', unpack(list) }
end
function match:TablePattern(node)
local idx = 1
local keys = { }
local desc = { }
for i=1, #node.entries do
local n = node.entries[i]
local key, val
if n.name then
key = Op(n.name.name)
elseif n.expr then
key = self:get(n.expr)
else
-- array part
key = Op(idx)
idx = idx + 1
end
local nv = n.value
if nv.type == 'Identifier' or nv.type == 'MemberExpression' then
val = '__var__'
else
val = self:get(nv)
end
keys[#keys + 1] = key
desc[key] = val
end
keys = Op(keys)
desc = Op(desc)
local args = { keys, desc }
if node.coerce then
args[#args + 1] = self:get(node.coerce)
end
return Op{'!call', 'TablePattern', unpack(args)}
end
function match:ApplyPattern(node)
local args = { self:get(node.callee) }
for i=1, #node.arguments do
local n = node.arguments[i]
if n.type == 'Identifier' or n.type == 'MemberExpression' then
args[#args + 1] = '__var__'
else
args[#args + 1] = self:get(n)
end
end
return Op{'!call', 'ApplyPattern', unpack(args)}
end
function match:InExpression(node)
local names = { }
for i=1, #node.names do
names[#names + 1] = Op(node.names[i].name)
end
return Op{ '!call', '__in__', Op(names), self:get(node.expression) }
end
function match:UpdateExpression(node)
local oper = string.sub(node.operator, 1, -2)
local expr
if oper == 'or' or oper == 'and' then
expr = match.LogicalExpression(self, {
operator = oper,
left = node.left,
right = node.right
})
else
expr = match.BinaryExpression(self, {
operator = oper,
left = node.left,
right = node.right
})
end
return Op{'!assign', self:get(node.left), expr}
end
function match:MemberExpression(node)
if node.computed then
return Op{'!index', self:get(node.object), self:get(node.property)}
else
return Op{'!index', self:get(node.object), Op(self:get(node.property))}
end
end
function match:SelfExpression(node)
return 'self'
end
function match:SuperExpression(node)
return 'super'
end
function match:ThrowStatement(node)
return Op{'!call', 'throw', self:get(node.argument)}
end
function match:ReturnStatement(node)
local args = self:list(node.arguments)
if self.retsig then
return Op{'!do',
Op{'!assign', self.retsig, '!true' },
Op{'!assign', self.retval, #args > 0 and OpList(args) or '!nil'},
Op{'!return', self.retval },
}
end
return Op{'!return', OpList(args)}
end
function match:IfStatement(node)
local test, cons, altn = self:get(node.test), nil, nil
if node.consequent then
self.ctx:enter()
cons = self:get(node.consequent)
self.ctx:leave()
end
if node.alternate then
self.ctx:enter()
altn = self:get(node.alternate)
self.ctx:leave()
end
return Op{'!if', test, Op{'!do', cons}, Op{'!do', altn } }
end
function match:GivenStatement(node)
local body = { }
local disc = util.genid()
body[#body + 1] = Op{'!define', disc, self:get(node.discriminant) }
local labels = { }
for i=1, #node.cases do
labels[#labels + 1] = util.genid()
end
self.ctx:enter()
for i=1, #node.cases do
local n = node.cases[i]
if n.test then
local t = n.test.type
local case = { }
if t == 'ArrayPattern' or t == 'TablePattern' or t == 'ApplyPattern' then
local cons = { }
-- for storing the template
local temp = util.genid()
self.ctx:define(temp)
case[#case + 1] = Op{'!define', temp, self:get(n.test) }
cons[#cons + 1] = Op{'!if',
Op{'!not', Op{'!call', '__match__', temp, disc } },
Op{'!goto', labels[i] }
}
self.ctx:enter() -- consequent
local into = { }
local bind = extract_bindings(n.test)
local vars = { }
local chks = { }
for i=1, #bind do
local n = bind[i]
if n.type == 'Identifier' then
local guard
if n.guard then
guard = util.genid()
case[#case + 1] = Op{'!let', guard, self:get(n.guard)}
end
self.ctx:define(n.name, nil, guard)
if guard then
chks[#chks + 1] = self.ctx:lookup(n.name)
end
vars[#vars + 1] = n.name
end
bind[i] = self:get(n)
end
if #vars > 0 then
case[#case + 1] = Op{'!define', Op(vars), Op{ Op(nil) } }
end
cons[#cons + 1] = Op{'!massign',
Op(bind), Op{ Op{'!call', '__extract__', temp, disc } }
}
for i=1, #chks do
cons[#cons + 1] = Op{'!call', '__check__',
Op(chks[i].name), chks[i].name, chks[i].guard }
end
if n.guard then
cons[#cons + 1] = Op{'!if',
Op{'!not', self:get(n.guard) }, Op{'!goto', labels[i] }
}
end
cons[#cons + 1] = self:get(n.consequent)
self.ctx:leave()
case[#case + 1] = Op{'!do', OpChunk(cons)}
case[#case + 1] = Op{'!goto', labels[#labels] }
else
case[#case + 1] = Op{'!if',
Op{'!not', Op{'!call', '__match__', self:get(n.test), disc } },
Op{'!goto', labels[i] }
}
if n.guard then
case[#case + 1] = Op{'!if',
Op{'!not', self:get(n.guard) }, Op{'!goto', labels[i] }
}
end
case[#case + 1] = self:get(n.consequent)
case[#case + 1] = Op{'!goto', labels[#labels] }
end
body[#body + 1] = Op{'!do', OpChunk(case) }
else
-- else clause
body[#body + 1] = Op{'!do', self:get(n.consequent) }
end
body[#body + 1] = Op{'!label', labels[i]}
end
self.ctx:leave(body)
return Op{'!do', OpChunk(body) }
end
function match:TryStatement(node)
local oldret = self.retsig
local oldval = self.retval
local oldbrk = self.brksig
local oldcnt = self.cntsig
self.retsig = util.genid()
self.retval = util.genid()
self.brksig = util.genid()
self.cntsig = util.genid()
local try = Op{'!lambda', Op{ }, self:get(node.body)}
local finally
if node.finalizer then
finally = Op{'!lambda', Op{ }, self:get(node.finalizer)}
end
local exit = util.genid()
local clauses = { }
for i=#node.guardedHandlers, 1, -1 do
local clause = node.guardedHandlers[i]
self.ctx:define(clause.param.name)
local cons = self:get(clause.body)
local head = Op{'!define', self:get(clause.param), '!vararg'}
cons[#cons + 1] = Op{'!goto', exit }
clauses[#clauses + 1] = Op{'!do', head,
Op{'!if', self:get(clause.guard), Op{'!do', OpChunk(cons)}} }
end
if node.handler then
local clause = node.handler
self.ctx:define(clause.param.name)
local cons = self:get(clause.body)
local head = Op{'!define', self:get(clause.param), '!vararg'}
cons[#cons + 1] = Op{'!goto', exit}
clauses[#clauses + 1] = Op{'!do', head, Op{'!do', OpChunk(cons)}}
end
clauses[#clauses + 1] = Op{'!label', exit }
local catch = Op{'!lambda', Op{'!vararg'}, OpChunk(clauses)}
local expr = Op{'!call', 'try', try, catch, finally }
local temp = self.retval
local rets = self.retsig
local brks = self.brksig
local cnts = self.cntsig
self.retsig = oldret
self.retval = oldval
self.brksig = oldbrk
self.cntsig = oldcnt
local frag = Op{'!do',
Op{'!define', Op{ rets, brks, cnts }, Op{ '!false', '!false', '!false' } },
Op{'!define', temp, Op(nil) },
Op(expr),
Op{'!if', rets, Op{'!return', temp } }
}
if self.loop then
frag[#frag + 1] = Op{'!if', cnts, Op{'!goto', self.loop} }
frag[#frag + 1] = Op{'!if', brks, Op{'!break'} }
end
return frag
end
function match:LabelStatement(node)
return Op{'!label', node.label.name }
end
function match:GotoStatement(node)
return Op{'!goto', node.label.name }
end
function match:BreakStatement(node)
if self.brksig then
return OpChunk{
Op{'!assign', self.brksig, '!true'},
Op{'!return'}
}
end
return Op{'!break'}
end
function match:ContinueStatement(node)
if not self.loop then
self.ctx:fail("no loop to continue")
end
if self.cntsig then
return OpChunk{
Op{'!assign', self.cntsig, '!true'},
Op{'!return'}
}
end
return Op{'!goto', self.loop}
end
function match:LogicalExpression(node)
local op = node.operator
if op == 'and' then
return Op{'!and', self:get(node.left), self:get(node.right) }
elseif op == 'or' then
return Op{'!or', self:get(node.left), self:get(node.right) }
else
assert(false, "Unhandled operator "..op.." in logical expression")
end
end
local bitop = {
[">>"] = '__rshift__',
[">>>"] = '__arshift__',
["<<"] = '__lshift__',
["|"] = '__bor__',
["&"] = '__band__',
["^"] = '__bxor__',
}
local binop = {
['+'] = '!add',
['-'] = '!sub',
['*'] = '!mul',
['/'] = '!div',
['%'] = '!mod',
['**'] = '!pow',
['~'] = '!concat',
['=='] = '!eq',
['!='] = '!ne',
['>='] = '!ge',
['<='] = '!le',
['>'] = '!gt',
['<'] = '!lt',
}
function match:BinaryExpression(node)
local o = node.operator
if bitop[o] then
return Op{'!call', bitop[o], self:get(node.left), self:get(node.right) }
end
if o == 'is' then
return Op{'!call', '__is__', self:get(node.left), self:get(node.right)}
end
if o == 'as' then
return Op{'!call', '__as__', self:get(node.left), self:get(node.right)}
end
if o == '..' then
return Op{'!call', '__range__', self:get(node.left), self:get(node.right)}
end
if o == "~~" then
return Op{'!call', '__match__', self:get(node.right), self:get(node.left)}
end
if o == "!~" then
return Op{'!not', Op{'!call', '__match__', self:get(node.right), self:get(node.left)} }
end
if string.sub(o, 1, 1) == ':' then
return Op{'!call', '__usrop__', Op(o), self:get(node.left), self:get(node.right) }
end