-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.py
1243 lines (1131 loc) · 31.8 KB
/
main.py
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
import time
import ply.lex as lex
import ply.yacc as yacc
from check_indents import validate_indent
from objects import (Unit, Nat, Int, Bool,
Map, BigMap, Timestamp, Mutez,
NoneType, Pair, String, Bytes, Set, List, Or, Lambda,
Operation, deep_compare)
from objects.contract_types import Address, Contract
from objects.utils import check_signature
tokens = (
'EXIT',
# reserved words
'NUMBER',
'TEXT',
'CONTRACT',
'DROP',
'FAILWITH',
'FAIL',
'DUP',
'SWAP',
'PUSH',
'LAMBDA',
'EXEC',
'DIP',
'PAIR_SUGAR',
'UNPAIR_SUGAR',
'SET_CAR',
'SET_CDR',
### Generic Comparison
'EQ',
'NEQ',
'LT',
'GT',
'LE',
'GE',
### Boolean Operations
'OR',
'AND',
'XOR',
'NOT',
### Integer Operations
'NEG',
'ABS',
'ADD',
'SUB',
'MUL',
'EDIV',
'LSL',
'LSR',
'COMPARE',
### String Operations
'CONCAT',
'SIZE',
'SLICE',
# 'COMPARE',
### Pair Operations
'PAIR',
'CAR',
'CDR',
### Set Operations
'EMPTY_SET',
'MEM',
'UPDATE',
'ITER',
# 'SIZE',
### Map Operations
'EMPTY_MAP',
'GET',
# 'MEM',
# 'UPDATE',
'MAP',
# ITER body,
# 'SIZE',
### Option Operations
'SOME',
'NONE',
# IF_NONE bt bf
### Union Operations
'LEFT',
'RIGHT',
'IF_LEFT',
'IF_RIGHT',
'IF_SOME',
### Operations on Lists
'CONS',
'NIL',
'IF_CONS',
# 'MAP',
# 'SIZE',
# 'ITER' body
###
'UNIT',
'NAT',
'STRING',
'INT',
'BOOL',
'BYTES',
'LPAIR',
'TRUE',
'FALSE',
'PAIR_CONSTRUCTOR',
### Cryptographic Primitives
'HASH_KEY',
'BLAKE2B',
'SHA256',
'SHA512',
'CHECK_SIGNATURE',
# # types
'TIMESTAMP',
'MUTEZ',
# "contract 'param",
'ADDRESS',
'OPERATION',
# 'key',
# 'key_hash',
# 'signature',
### Special Operations
'STEPS_TO_QUOTA',
'NOW',
'LPARENS',
'RPARENS',
'LBRACKET',
'RBRACKET',
'SCOLON',
### DEBUG
'PRINTER',
### Assertion Macros
'ASSERT',
'ASSERT_EQ',
'ASSERT_NEQ',
'ASSERT_LT',
'ASSERT_LTE',
'ASSERT_GT',
'ASSERT_GTE',
'ASSERT_CMPEQ',
'ASSERT_CMPNEQ',
'ASSERT_CMPLT',
'ASSERT_CMPLTE',
'ASSERT_CMPGT',
'ASSERT_CMPGTE',
'ASSERT_NONE',
'ASSERT_SOME',
'ASSERT_LEFT',
'ASSERT_RIGHT',
### type decl
'PARAMETER',
'STORAGE',
'CODE',
)
### My Tokens
t_EXIT = '(exit|EXIT)'
# Tokens
t_DROP = 'DROP'
t_SWAP = 'SWAP'
t_UNIT = 'UNIT'
t_FAILWITH = 'FAILWITH'
t_PUSH = 'PUSH'
t_LAMBDA = 'LAMBDA'
t_EXEC = 'EXEC'
t_DIP = 'DI*P'
t_DUP = 'DU*P'
t_PAIR_SUGAR = 'P[PAI]+R'
t_UNPAIR_SUGAR = 'UN[PAI]+R'
t_SET_CAR = 'SET_CAR'
t_SET_CDR = 'SET_CDR'
### Generic Comparison
t_EQ = 'EQ'
t_NEQ = 'NEQ'
t_LT = 'LT'
t_GT = 'GT'
t_LE = 'LE'
t_GE = 'GE'
### Boolean Operations
t_OR = 'OR'
t_AND = 'AND'
t_XOR = 'XOR'
t_NOT = 'NOT'
### Integer Operations
t_NEG = 'NEG'
t_ABS = 'ABS'
t_ADD = 'ADD'
t_SUB = 'SUB'
t_MUL = 'MUL'
t_EDIV = 'EDIV'
t_LSL = 'LSL'
t_LSR = 'LSR'
t_COMPARE = 'COMPARE'
### String Operations
t_CONCAT = 'CONCAT'
t_SIZE = 'SIZE'
t_SLICE = 'SLICE'
# t_COMPARE = 'COMPARE'
### Pair Operations
t_PAIR = 'PAIR'
t_CAR = 'CAR'
t_CDR = 'CDR'
### Set Operations
t_EMPTY_SET = 'EMPTY_SET'
t_MEM = 'MEM'
t_UPDATE = 'UPDATE'
### Map Operations
t_EMPTY_MAP = 'EMPTY_MAP'
t_MAP = 'MAP'
t_GET = 'GET'
t_ITER = 'ITER'
t_IF_CONS = 'IF_CONS'
### Option Operations
t_SOME = 'SOME'
t_NONE = 'NONE'
### Union Operations
t_LEFT = 'LEFT'
t_RIGHT = 'RIGHT'
t_IF_LEFT = 'IF_LEFT'
t_IF_RIGHT = 'IF_RIGHT'
t_IF_SOME = 'IF_SOME'
### List Operations
t_CONS = 'CONS'
t_NIL = 'NIL'
### Special Operations
t_STEPS_TO_QUOTA = 'STEPS_TO_QUOTA'
t_NOW = 'NOW'
### Cryptographic Primitives
t_HASH_KEY = 'HASH_KEY'
t_BLAKE2B = 'BLAKE2B'
t_SHA256 = 'SHA256'
t_SHA512 = 'SHA512'
t_CHECK_SIGNATURE = 'CHECK_SIGNATURE'
### Assertion Macros
t_ASSERT = 'ASSERT'
t_ASSERT_EQ = 'ASSERT_EQ'
t_ASSERT_NEQ = 'ASSERT_NEQ'
t_ASSERT_LT = 'ASSERT_LT'
t_ASSERT_LTE = 'ASSERT_LTE'
t_ASSERT_GT = 'ASSERT_GT'
t_ASSERT_GTE = 'ASSERT_GTE'
t_ASSERT_CMPEQ = 'ASSERT_CMPEQ'
t_ASSERT_CMPNEQ = 'ASSERT_CMPNEQ'
t_ASSERT_CMPLT = 'ASSERT_CMPLT'
t_ASSERT_CMPLTE = 'ASSERT_CMPLTE'
t_ASSERT_CMPGT = 'ASSERT_CMPGT'
t_ASSERT_CMPGTE = 'ASSERT_CMPGTE'
t_ASSERT_NONE = 'ASSERT_NONE'
t_ASSERT_SOME = 'ASSERT_SOME'
t_ASSERT_LEFT = 'ASSERT_LEFT'
t_ASSERT_RIGHT = 'ASSERT_RIGHT'
t_NAT = 'nat'
t_STRING = 'string'
t_INT = 'int'
t_BOOL = 'bool'
t_BYTES = 'bytes'
t_OPERATION = 'operation'
t_ADDRESS = 'address'
t_MUTEZ = 'mutez'
t_TIMESTAMP = 'timestamp'
t_CONTRACT = 'contract'
t_TRUE = 'True'
t_FALSE = 'False'
t_TEXT = '".*"'
t_LBRACKET = '{'
t_RBRACKET = '}'
t_LPARENS = '\('
t_RPARENS = '\)'
t_LPAIR = 'pair'
t_PAIR_CONSTRUCTOR = 'Pair'
t_SCOLON = ';'
# type decl
t_PARAMETER = 'parameter'
t_STORAGE = 'storage'
t_CODE = 'code'
### DEBUG
t_PRINTER = '%PRINT%'
def t_comment(t):
r"[ ]*\043[^\n]*" # \043 is '#'
pass
def t_NUMBER(t):
r'-?\d+'
try:
t.value = int(t.value)
except ValueError:
print("Integer value too large %d", t.value)
t.value = 0
return t
# Ignored characters
t_ignore = " \t"
def t_newline(t):
r'\n+'
pass
# t.lexer.lineno += t.value.count("\n")
def t_error(t):
print("Illegal character '%s'" % t.value[0])
t.lexer.skip(1)
def p_contract(t):
'''contract_run : contract_decl code_decl
| execution'''
return
def p_contract_constructor(t):
'''contract_decl : PARAMETER type SCOLON STORAGE type SCOLON'''
contract_decl.update_parameters(t[2])
contract_decl.update_storage(t[5])
def p_contract_code(t):
'''code_decl : CODE body'''
# TODO: make this depend on whether the contract should execute or is
# just being added to the contract stack
global remaining_steps
if True:
# If execute
t[0] = t[2]
for stmt in t[0]:
stmt(stack)
remaining_steps -= 1
def p_execution(t):
'''execution : compound_statement
| compound_statement SCOLON
| body'''
global remaining_steps
# stmt is allowed for the repl
t[0] = t[1]
for stmt in t[0]:
stmt(stack)
remaining_steps -= 1
def p_compound_statement(t):
'''compound_statement : stmt
| compound_statement SCOLON stmt'''
if len(t) == 2:
t[0] = [t[1]]
elif type(t[1]) == list:
t[0] = t[1] + [t[3]]
else:
t[0] = [t[1], t[3]]
def p_body(t):
'''body : LBRACKET compound_statement SCOLON RBRACKET
| LBRACKET compound_statement RBRACKET
| LBRACKET RBRACKET'''
if len(t) >= 4:
t[0] = t[2]
else:
t[0] = NoneType
def p_lambda_statement(t):
'''stmt : LAMBDA type type body'''
lam_func = Lambda(t[2], t[3], t[4])
def add_lambda(stack):
stack.append(lam_func)
t[0] = add_lambda
def p_statement_drop(t):
'stmt : DROP'
def exec_drop(stack):
stack.pop(-1)
return stack
t[0] = exec_drop
def p_statement_dup(t):
'stmt : DUP'
u_count = len(t[1]) - 2
def exec_dup(stack):
stack.append(stack[u_count * -1])
return stack
t[0] = exec_dup
def p_statement_swap(t):
'stmt : SWAP'
def exec_swap(stack):
stack[-1], stack[-2] = stack[-2], stack[-1]
return stack
t[0] = exec_swap
def p_statement_unit(t):
'stmt : UNIT'
def exec_unit(stack):
stack.append(Unit)
return stack
t[0] = exec_unit
def p_bool(t):
'''bool : TRUE
| FALSE '''
t[0] = t[1]
def p_statement_value(t):
'''value : NUMBER
| bool
| TEXT
| LPARENS PAIR_CONSTRUCTOR value value RPARENS '''
if t[1] == '(':
t[0] = (t[3], t[4])
else:
t[0] = t[1]
def p_statement_generic_comparison(t):
'''stmt : EQ
| NEQ
| LT
| GT
| LE
| GE '''
generic_comparison = t[1]
def exec_generic(stack):
top = stack.pop()
assert isinstance(stack[-1], Int)
if generic_comparison == 'EQ':
stack.append(Bool(top == Int(0)))
elif generic_comparison == 'NEQ':
stack.append(Bool(top != Int(0)))
elif generic_comparison == 'LT':
stack.append(Bool(top < Int(0)))
elif generic_comparison == 'GT':
stack.append(Bool(top > Int(0)))
elif generic_comparison == 'LE':
stack.append(Bool(top <= Int(0)))
elif generic_comparison == 'GE':
stack.append(Bool(top >= Int(0)))
return stack
t[0] = exec_generic
def p_boolean_comparison(t):
'''stmt : OR
| AND
| XOR '''
bool_comparison = t[1]
def exec_bool_comparison(stack):
first = stack.pop(-1)
second = stack.pop(-1)
if isinstance(first, Bool) and isinstance(second, Bool):
first = first.value
second = second.value
if bool_comparison == 'OR':
stack.append(Bool(first or second))
elif bool_comparison == 'AND':
stack.append(Bool(first and second))
elif bool_comparison == 'XOR':
stack.append(Bool(first != second))
elif isinstance(first, Nat) and isinstance(second, Nat):
if bool_comparison == 'OR':
stack.append(first.bit_or(second))
elif bool_comparison == 'AND':
stack.append(first.bit_and(second))
elif bool_comparison == 'XOR':
stack.append(first.bit_xor(second))
else:
# TODO: explain error better
print('Invalid Stack State')
return stack
t[0] = exec_bool_comparison
def p_compare_operation(t):
'stmt : COMPARE'
def exec_compare(stack):
value = stack.pop(-1)
if type(top) in (Int, Nat, String, Timestamp, Mutez, Bytes, KeyHash):
value2 = stack.pop(-1)
assert type(value2) == type(value1)
stack.append(value.compare(value2))
else:
print('Invalid Stack State')
return stack
t[0] = exec_compare
def p_integer_operations(t):
'''stmt : NEG
| ABS
| ADD
| SUB
| MUL
| EDIV
| LSL
| LSR '''
integer_operator = t[1]
def exec_integer_op(stack):
value = stack.pop(-1)
assert type(value) in (Nat, Int)
if integer_operator == 'NEG':
stack.append(value.neg())
elif integer_operator == 'ABS':
stack.append(value.abs())
elif integer_operator == 'ADD':
value2 = stack.pop(-1)
stack.append(value.add(value2))
elif integer_operator == 'SUB':
value2 = stack.pop(-1)
stack.append(value.add(value2.neg()))
elif integer_operator == 'MUL':
value2 = stack.pop(-1)
stack.append(value.mul(value2))
elif integer_operator == 'EDIV':
value2 = stack.pop(-1)
stack.append(value.ediv(value2))
elif integer_operator == 'LSL':
value2 = stack.pop(-1)
assert isinstance(value, Nat)
stack.append(value.lsl(value2))
elif integer_operator == 'LSR':
value2 = stack.pop(-1)
assert isinstance(value, Nat)
stack.append(value.lsr(value2))
else:
# TODO: better error
print('Invalid Stack State')
return stack
t[0] = exec_integer_op
def p_size_operation(t):
'stmt : SIZE'
size_operation = t[1]
def exec_size_op(stack):
first = stack.pop(-1)
assert type(first) in (String, Set, List, Map)
stack.append(first.size())
t[0] = exec_size_op
def p_string_operations(t):
'''stmt : CONCAT
| SLICE'''
string_operation = t[1]
def exec_string_op(stack):
if string_operation == 'CONCAT':
first = stack.pop(-1)
second = stack.pop(-1)
assert isinstance(first, String) and isinstance(second, String)
stack.append(first.concat(second))
elif string_operation == 'SLICE':
first = stack.pop(-1)
second = stack.pop(-1)
third = stack.pop(-1)
assert isinstance(first, Nat) and isinstance(second, Nat) and isinstance(third, String)
stack.append(third.slice(first, second))
t[0] = exec_string_op
def p_set_car(t):
'''stmt : SET_CAR'''
# CDR; SWAP; PAIR
def set_cdr(stack):
first = stack.pop(-1).right
second = stack.pop(-1)
p = Pair(second.type, type(first))
p((second.value, first.value))
stack.append(p)
return stack
t[0] = set_cdr
def p_set_cdr(t):
'''stmt : SET_CDR'''
# CAR ; PAIR
def set_cdr(stack):
first = stack.pop(-1)
second = stack.pop(-1)
p = Pair(first.type, type(second))
p((first.value, second.value))
stack.append(p)
return stack
t[0] = set_cdr
def p_unpair_sugar(t):
'''stmt : UNPAIR_SUGAR'''
# TODO: This only works for UNPAIR
unpair_sugar = list(t[1][3:])
def exec_unpair_values(stack):
left = None
right = None
top = stack.pop(-1)
curr_char = unpair_sugar.pop(0)
if curr_char == 'A':
left = top.left
while unpair_sugar:
curr_char = unpair_sugar.pop(0)
if curr_char == 'A':
top = top.left
elif curr_char == 'I':
top = top.right
elif curr_char == 'P':
pass
right = top
stack.append(right)
stack.append(left)
return stack
t[0] = exec_unpair_values
def p_pair_sugar(t):
'''stmt : PAIR_SUGAR'''
pair_sugar = list(t[1][1:])
def validate_tree(root):
if root is None:
return False
if not isinstance(root, Pair):
return True
return validate_tree(root.left) and validate_tree(root.right)
def exec_pair_sugar(stack):
# 'P' 'APPAII' 'R'
root = Pair(None, None)
nodes = [root]
curr_char = pair_sugar.pop(0)
active_node = root
while pair_sugar:
curr_root = nodes[-1]
if curr_char == 'A':
for curr_root in nodes:
if curr_root.left is None:
curr_root.left = stack.pop(-1)
break
curr_char = pair_sugar.pop(0)
elif curr_char == 'I':
for curr_root in nodes[::-1]:
if curr_root.right is None:
curr_root.right = stack.pop(-1)
break
curr_char = pair_sugar.pop(0)
else:
for curr_root in nodes:
if curr_root.left is None:
curr_root.left = Pair(None, None)
nodes.append(curr_root.left)
break
if curr_root.right is None:
curr_root.right = Pair(None, None)
nodes.append(curr_root.right)
break
curr_char = pair_sugar.pop(0)
if not validate_tree(root):
print('Invalid Statement')
stack.clear()
else:
stack.append(root)
return stack
t[0] = exec_pair_sugar
def p_pair_operations(t):
'''stmt : PAIR
| CAR
| CDR '''
pair_operation = t[1]
def exec_pair_operation(stack):
first = stack.pop(-1)
if pair_operation == 'PAIR':
second = stack.pop(-1)
p = Pair(first.type, type(second))
p((first.value, second.value))
stack.append(p)
return
if not isinstance(first, Pair):
print('Invalid Stack State')
return
if pair_operation == 'CAR':
stack.append(first.left)
elif pair_operation == 'CDR':
stack.append(first.right)
return stack
t[0] = exec_pair_operation
def p_set_operations(t):
'''stmt : EMPTY_SET type
| MEM
| UPDATE '''
set_operation = t[1]
if len(t) == 3:
set_type = t[2]
else:
set_type = None
def exec_set_op(stack):
if set_operation == 'EMPTY_SET':
stack.append(Set(set_type))
elif set_operation == 'MEM':
top = stack.pop(-1)
stack_set = stack.pop(-1)
assert type(stack_set) in (Set, Map)
assert isinstance(top, stack_set.list_type)
stack.append(stack_set.contains(top))
elif set_operation == 'UPDATE':
elt = stack.pop(-1)
bool = stack.pop(-1)
stack_set = stack.pop(-1)
stack.append(stack_set.update(elt, bool))
return stack
t[0] = exec_set_op
def p_map_operations(t):
'''stmt : EMPTY_MAP type type
| MAP body
| ITER body
| GET'''
map_operation = t[1]
second_arg = t[2]
if len(t) == 4:
third_arg = t[3]
else:
third_arg = None
def exec_map_op(stack):
if map_operation == 'EMPTY_MAP':
stack.append(MAP(second_arg, third_arg))
elif map_operation == 'MAP':
values = stack.pop(-1)
if type(values) == List:
list_values = values.value
list_type = values.list_type
new_list = []
for value in list_values:
# TODO: add item get method and set type in getter
ministack = stack + [list_type(value)]
for arg in second_arg:
ministack = arg(ministack)
new_list.append(ministack.pop(-1))
values.value = new_list
stack.append(values)
elif map_operation == 'ITER':
values = stack.pop(-1)
if type(values) in (List, Map, Set):
list_values = values.value
list_type = values.list_type
for value in list_values:
# TODO: add item get method and set type in getter
stack.append(list_type(value))
for arg in second_arg:
arg(stack)
elif map_operation == 'GET':
key = stack.pop(-1)
mapping = stack.pop(-1)
assert isinstance(top, mapping.key_type)
stack.append(mapping.get(key))
return stack
t[0] = exec_map_op
def p_if_left_right(t):
'''stmt : IF_LEFT body body
| IF_RIGHT body body'''
command = t[1]
first_body = t[2]
second_body = t[3]
def exec_if_left_right(stack):
assert isinstance(stack[-1], Or)
if command == 'IS_LEFT':
if stack[-1].isleft:
for arg in first_body:
stack = arg(stack)
else:
for arg in second_body:
stack = arg(stack)
else:
if stack[-1].isleft:
for arg in second_body:
stack = arg(stack)
else:
for arg in first_body:
stack = arg(stack)
t[0] = exec_if_left_right
def p_if_some(t):
'''stmt : IF_SOME body body'''
first_body = t[2]
second_body = t[3]
def exec_if_some(stack):
top = stack.pop(-1)
assert type(top) in (Some, NoneType)
if isinstance(top, Some):
stack.append(top)
for arg in first_body:
stack = arg(stack)
else:
for arg in second_body:
stack = arg(stack)
return stack
t[0] = exec_if_some
def p_if_cons(t):
'stmt : IF_CONS body body'
first_body = t[2]
second_body = t[3]
def exec_if_cons(stack):
top = stack.pop(-1)
assert isinstance(top, List)
if top.size() == 0:
for arg in second_body:
stack = arg(stack)
else:
stack.append(top)
for arg in first_body:
stack = arg(stack)
return stack
t[0] = exec_if_cons
def p_option_operations(t):
'''stmt : SOME
| NONE type '''
option_op = t[1]
def exec_option_op(stack):
top = stack.pop(-1)
if option_op == 'SOME':
stack.append(Some(top))
else:
stack.append(NoneType(t[2]))
return stack
t[0] = exec_option_op
def p_union_operations(t):
'''stmt : LEFT type
| RIGHT type '''
value_type = t[2]
side = t[1]
def exec_union_op(stack):
top = stack.pop(-1)
new_or = Or(type(top), value_type, side=side)
new_or.add_value(top)
stack.append(new_or)
return stack
t[0] = exec_union_op
def p_list_operations(t):
'''stmt : CONS
| NIL type '''
list_op = t[1]
if len(t) == 3:
list_type = t[2]
else:
list_type = None
def exec_list_op(stack):
if list_op == 'NIL':
stack.append(List(list_type))
else:
top = stack.pop(-1)
list = stack.pop(-1)
assert isinstance(list, List)
stack.append(list.cons(top))
return stack
t[0] = exec_list_op
def p_boolean_not(t):
'stmt : NOT'
def exec_not(stack):
first = stack.pop(-1)
if type(first) in (Bool, Nat, Int):
stack.append(first.flip())
else:
# TODO: better error
print('Invalid Stack State')
return stack
t[0] = exec_not
def p_exec(t):
'stmt : EXEC'
def func_exec(stack):
arg = stack.pop(-1)
lam_func = stack.pop(-1)
assert isinstance(lam_func, Lambda)
assert deep_compare(arg, lam_func.input_type)
ministack = [arg]
for func in lam_func.body:
ministack = func(ministack)
assert len(ministack) == 1
assert isinstance(ministack[0], lam_func.return_type)
stack.append(ministack[0])
return stack
t[0] = func_exec
def p_special_operations(t):
'''stmt : STEPS_TO_QUOTA
| NOW '''
command = t[1]
def exec_special(stack):
if command == 'STEPS_TO_QUOTA':
stack.append(remaining_steps)
else:
stack.append(Timestamp(int(time.time())))
return stack
t[0] = exec_special
def p_contract_push(t):
'''stmt : CONTRACT type'''
def push_contract(stack):
address = stack.pop(-1)
if not isinstance(address, Address):
print('Invalid Stack State\n\n')
return stack
if contract_registry[address.value] and contract_registry[address.value].has_type(t[2]):
stack.append(Some(Contract(t[2])))
else:
stack.append(NoneType)
return stack
t[0] = push_contract
def p_cryptographic_primitives(t):
'''stmt : HASH_KEY
| BLAKE2B
| SHA256
| SHA512
| CHECK_SIGNATURE'''
command = t[1]
def execute_primitive(stack):
top = stack.pop(-1)
if command == 'HASH_KEY':
assert isinstance(top, Key)
stack.append(top.hash_key())
elif command == 'BLAKE2B':
assert isinstance(top, Bytes)
stack.append(top.blake2b())
elif command == 'SHA256':
assert isinstance(top, Bytes)
stack.append(top.sha256())
elif command == 'SHA512':
assert isinstance(top, Bytes)
stack.append(top.sha512())
else:
key = top
signature = stack.pop(-1)
msg = stack.pop(-1)
stack.append(Bool(check_signature(key, signature, msg)))
return stack
t[0] = execute_primitive
def p_statement_type(t):
'''type : NAT
| STRING
| INT
| BOOL
| BYTES
| OPERATION
| ADDRESS
| TIMESTAMP
| MUTEZ
| LPARENS LPAIR type type RPARENS '''
if t[1] == 'nat':
t[0] = Nat
elif t[1] == 'string':
t[0] = String
elif t[1] == 'int':
t[0] = Int
elif t[1] == 'bool':
t[0] = Bool
elif t[1] == 'bytes':
t[0] = Bytes
elif t[1] == 'operation':
t[0] = Operation
elif t[1] == 'timestamp':
t[0] = Timestamp
elif t[1] == 'address':
t[0] = Address
elif t[1] == 'mutez':
t[0] = Mutez
elif t[1] == '(':
t[0] = Pair(t[3], t[4])