-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathparenthesis-inferrer.c
2130 lines (1855 loc) · 76.5 KB
/
parenthesis-inferrer.c
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
/*
MIT License
Copyright (c) 2023 Joseph Herguth
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
#include "parenthesis-inferrer.h"
#include "DuckLib/string.h"
#include "duckLisp.h"
#include "duckVM.h"
#include "parser.h"
#include "generators.h"
/* This contains the parenthesis inferrer for duck-lisp. When Forth-like syntax mode is enabled the raw AST from the
reader is only partially complete. Forth syntax is not context free, so another stage (this one) is desirable. It
*is* possible to implement the algorithm entirely in duck-lisp's recursive descent parser, but keeping the inferrer
separate from the parser improves modularity and readability. The algorithm used for tree correction is similar to
Forth's algorithm, the primary difference being that this variant requires a static type system since it operates on
the entire tree at compile-time.
Basic rules:
* Literal value types are not touched: bool, int, float, string
* Parenthesized expressions are not touched. Use of parentheses for a function call opts out of inference for that
call. Parentheses are still inferred for the arguments if appropriate and the arity of the form is checked against
the type.
* Callbacks are converted to identifiers. Callbacks are not candidates for inference.
* Literal expressions are converted to expressions. Neither literal expressions nor their arguments are candidates
for inference.
* Identifiers that do not occur at the start of a parenthesized expression may be candidates for inference.
When an identifier that is a candidate for inference is encountered, its name is looked up in the function dictionary
stack. If it was not found, then the identifier is assumed not to be a function call and inference is stopped. If it
was found, then the type is returned.
There are two basic types:
I: Infer -- Inference will be run on this argument.
L: Literal -- Inference will not be run on this argument or its sub-forms.
Normal variables have the type `L`. Functions have a list as their type. It can be empty, or it can contain a
combination of `L` and `I`. Variadic functions are indicated by `&rest` in the third-to-last position of the
type. The default number of arguments for a variadic function is in the second-to-last position.
Some examples: `()`, `(I I I)`, `(L I)`, `(L L L &rest 1 I)`.
Types are declared with the keyword `declare`. It accepts two arguments by default.
declare * (I I)
declare if (I I I)
declare setq (L I)
Unfortunately the use of these static type declarations is limited due to the existence of macros. To allow the type
system to understand macros such as `defun`, `declare` can be passed a duck-lisp script. When `declare` is passed
four arguments, the last argument is interpreted as the body of the script. When the declared function is used in a
call, the script should parse and analyze the arguments in order to declare additional identifiers used by arguments
or by forms that occur in the same declaration scope. The duck-lisp scripts that occur in the body of a `declare`
form are run at inference-time. This is a separate instance of the duck-lisp compiler and VM than is used in the rest
of the language. This instance is used solely in the inferrer.
The inference-time instance of duck-lisp is defined with three additional functions:
(infer-and-get-next-argument)::Any -- C callback -- Switches to the next argument and runs inference on the current
argument. Returns the resulting AST.
(declare-identifier name::(Symbol String) type::(Symbol List))::Nil -- C callback -- Declares the provided symbol
`name` as an identifier in the current declaration scope with a type specified by `type`.
(declaration-scope body::Any*)::Any -- Generator -- Create a new declaration scope. Identifiers declared in the
body using `declare-identifier` are automatically deleted when the scope is exited.
Examples:
;; `var' itself makes a declaration, so it requires a script. This declaration will persist until the end of the
;; scope `var' was used in.
(declare var (L I)
(declare-identifier (infer-and-get-next-argument)
(quote #L)))
;; `defmacro' declares each of its parameters as a normal variable, and the provided name and `self` as functions of
;; the specified type. `self` and the parameters are scoped to the body while the declaration of the macro itself
;; persists until the end of the scope `defmacro' was used in.
(declare defmacro (L L L &rest 1 I)
(
(var name (infer-and-get-next-argument))
(var parameters (infer-and-get-next-argument))
(var type (infer-and-get-next-argument))
(declaration-scope
(while parameters
var parameter car parameters
(unless (= (quote #&rest) parameter)
(declare-identifier parameter (quote #L)))
(setq parameters (cdr parameters)))
(declare-identifier (quote #self) type)
(infer-and-get-next-argument))
(declare-identifier name type)))
(declare let ((&rest 1 (L I)) &rest 1 I)
;; The bindings of the `let' statement is the first argument. It will be inferred using the type above.
(var bindings (infer-and-get-next-argument))
;; Create a new scope. All declarations in the scope will be deleted when the scope exits.
(declaration-scope
(dolist binding bindings
;; Declare each new identifier in the `let' as a variable.
(declare-identifier (first binding) (quote L)))
;; Infer body in scope.
(infer-and-get-next-argument)))
This system cannot recognize some macros due to the simplicity of the parsing functions used in inference-time
scripts. It can correctly infer a complicated form like `let`, but is unable to infer `let*`. */
dl_error_t duckLisp_parenthesisInferrer_declarationPrototype_prettyPrint(dl_array_t *string_array,
duckLisp_parenthesisInferrer_declarationPrototype_t declarationPrototype) {
dl_error_t e = dl_error_ok;
e = dl_array_pushElements(string_array, DL_STR("(duckLisp_parenthesisInferrer_declarationPrototype_t) {"));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("dl_uint8_t name["));
if (e) goto cleanup;
e = dl_string_fromSize(string_array, declarationPrototype.name_length);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("] = "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, declarationPrototype.name, declarationPrototype.name_length);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("dl_uint8_t type["));
if (e) goto cleanup;
e = dl_string_fromSize(string_array, declarationPrototype.type_length);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("] = "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, declarationPrototype.type, declarationPrototype.type_length);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("dl_uint8_t script["));
if (e) goto cleanup;
e = dl_string_fromSize(string_array, declarationPrototype.script_length);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("] = "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, declarationPrototype.script, declarationPrototype.script_length);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("}"));
if (e) goto cleanup;
cleanup: return e;
}
#ifdef USE_PARENTHESIS_INFERENCE
typedef enum {
inferrerTypeSymbol_L,
inferrerTypeSymbol_I
} inferrerTypeSymbol_t;
#if 0
static dl_error_t inferrerTypeSymbol_prettyPrint(dl_array_t *string_array, inferrerTypeSymbol_t inferrerTypeSymbol) {
switch (inferrerTypeSymbol) {
case inferrerTypeSymbol_L:
return dl_array_pushElements(string_array, DL_STR("inferrerTypeSymbol_L"));
case inferrerTypeSymbol_I:
return dl_array_pushElements(string_array, DL_STR("inferrerTypeSymbol_I"));
default:
return dl_array_pushElements(string_array, DL_STR("INVALID"));
}
}
#endif
typedef enum {
inferrerTypeSignature_type_expression,
inferrerTypeSignature_type_symbol
} inferrerTypeSignature_type_t;
#if 0
static dl_error_t inferrerTypeSignature_type_prettyPrint(dl_array_t *string_array,
inferrerTypeSignature_type_t inferrerTypeSignature_type) {
switch (inferrerTypeSignature_type) {
case inferrerTypeSignature_type_expression:
return dl_array_pushElements(string_array, DL_STR("inferrerTypeSignature_type_expression"));
case inferrerTypeSignature_type_symbol:
return dl_array_pushElements(string_array, DL_STR("inferrerTypeSignature_type_symbol"));
default:
return dl_array_pushElements(string_array, DL_STR("INVALID"));
}
}
#endif
typedef struct inferrerTypeSignature_s {
inferrerTypeSignature_type_t type;
union {
struct {
/* '(L L I) or '(L L &rest 2 I) or '((&rest 1 (L I)) &rest 1 I) &c. */
struct inferrerTypeSignature_s *positionalSignatures;
dl_size_t positionalSignatures_length;
struct inferrerTypeSignature_s *restSignature; /* Contains a max of one element */
dl_ptrdiff_t defaultRestLength;
dl_bool_t variadic;
} expression;
/* 'I or 'L */
inferrerTypeSymbol_t symbol;
} value;
} inferrerTypeSignature_t;
#if 0
static dl_error_t inferrerTypeSignature_prettyPrint(dl_array_t *string_array,
inferrerTypeSignature_t inferrerTypeSignature) {
dl_error_t e = dl_error_ok;
e = dl_array_pushElements(string_array, DL_STR("(inferrerTypeSignature_t) {"));
if (e) goto cleanup;
if (inferrerTypeSignature.type == inferrerTypeSignature_type_symbol) {
e = inferrerTypeSymbol_prettyPrint(string_array, inferrerTypeSignature.value.symbol);
if (e) goto cleanup;
}
else {
e = dl_array_pushElements(string_array, DL_STR("("));
if (e) goto cleanup;
DL_DOTIMES(j, inferrerTypeSignature.value.expression.positionalSignatures_length) {
e = inferrerTypeSignature_prettyPrint(string_array,
inferrerTypeSignature.value.expression.positionalSignatures[j]);
if (e) goto cleanup;
if ((dl_size_t) j != inferrerTypeSignature.value.expression.positionalSignatures_length - 1) {
e = dl_array_pushElements(string_array, DL_STR(" "));
if (e) goto cleanup;
}
}
if (inferrerTypeSignature.value.expression.variadic) {
e = dl_array_pushElements(string_array, DL_STR(" "));
if (e) goto cleanup;
e = dl_string_fromPtrdiff(string_array, inferrerTypeSignature.value.expression.defaultRestLength);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR(" "));
if (e) goto cleanup;
e = inferrerTypeSignature_prettyPrint(string_array,
*inferrerTypeSignature.value.expression.restSignature);
if (e) goto cleanup;
}
e = dl_array_pushElements(string_array, DL_STR(")"));
if (e) goto cleanup;
}
cleanup: return e;
}
#endif
typedef struct {
dl_uint8_t *bytecode;
dl_size_t bytecode_length;
inferrerTypeSignature_t type;
} inferrerType_t;
#if 0
static dl_error_t inferrerType_prettyPrint(dl_array_t *string_array, inferrerType_t inferrerType) {
dl_error_t e = dl_error_ok;
e = dl_array_pushElements(string_array, DL_STR("(inferrerType_t) {"));
if (e) goto cleanup;
e = inferrerTypeSignature_prettyPrint(string_array, inferrerType.type);
if (e) goto cleanup;
e = duckVM_bytecode_prettyPrint(string_array, inferrerType.bytecode);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("}"));
if (e) goto cleanup;
cleanup: return e;
}
#endif
typedef struct {
dl_trie_t identifiersTrie; /* A:int-->types[A],bytecode[A] */
dl_array_t types; /* dl_array_t:inferrerType_t */
} inferrerScope_t;
#if 0
static dl_error_t inferrerScope_prettyPrint(dl_array_t *string_array, inferrerScope_t inferrerScope) {
dl_error_t e = dl_error_ok;
e = dl_array_pushElements(string_array, DL_STR("(inferrerScope_t) {"));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("identifiersTrie = "));
if (e) goto cleanup;
e = dl_trie_prettyPrint(string_array, inferrerScope.identifiersTrie);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("types = {"));
if (e) goto cleanup;
DL_DOTIMES(i, inferrerScope.types.elements_length) {
e = inferrerType_prettyPrint(string_array, DL_ARRAY_GETADDRESS(inferrerScope.types, inferrerType_t, i));
if (e) goto cleanup;
if ((dl_size_t) i != inferrerScope.types.elements_length - 1) {
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
}
}
e = dl_array_pushElements(string_array, DL_STR("}"));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("}"));
if (e) goto cleanup;
cleanup: return e;
}
#endif
typedef struct {
dl_memoryAllocation_t *memoryAllocation;
duckLisp_t duckLisp;
duckVM_t duckVM;
dl_array_t *errors; /* dl_array_t:duckLisp_error_t */
dl_array_t *log; /* dl_array_t:dl_uint8_t */
const dl_uint8_t *fileName;
dl_size_t fileName_length;
dl_array_t scopeStack; /* dl_array_t:inferrerScope_t */
} inferrerState_t;
#if 0
static dl_error_t inferrerState_prettyPrint(dl_array_t *string_array, inferrerState_t inferrerState) {
dl_error_t e = dl_error_ok;
e = dl_array_pushElements(string_array, DL_STR("(inferrerState_t) {"));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("duckLisp = "));
if (e) goto cleanup;
e = duckLisp_prettyPrint(string_array, inferrerState.duckLisp);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("duckVM = "));
if (e) goto cleanup;
e = duckVM_prettyPrint(string_array, inferrerState.duckVM);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("error = "));
if (e) goto cleanup;
if (inferrerState.errors == dl_null) {
e = dl_array_pushElements(string_array, DL_STR("NULL"));
if (e) goto cleanup;
}
else {
e = dl_array_pushElements(string_array, DL_STR("{"));
if (e) goto cleanup;
DL_DOTIMES(i, inferrerState.errors->elements_length) {
e = duckLisp_error_prettyPrint(string_array,
DL_ARRAY_GETADDRESS(*inferrerState.errors, duckLisp_error_t, i));
if (e) goto cleanup;
if ((dl_size_t) i != inferrerState.errors->elements_length - 1) {
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
}
}
e = dl_array_pushElements(string_array, DL_STR("}"));
if (e) goto cleanup;
}
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("log = "));
if (e) goto cleanup;
if (inferrerState.log == dl_null) {
e = dl_array_pushElements(string_array, DL_STR("NULL"));
if (e) goto cleanup;
}
else {
e = dl_array_pushElements(string_array, DL_STR("\""));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, inferrerState.log->elements, inferrerState.log->elements_length);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("\""));
if (e) goto cleanup;
}
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("fileName = \""));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, inferrerState.fileName, inferrerState.fileName_length);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("\""));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("scopeStack = {"));
if (e) goto cleanup;
DL_DOTIMES(i, inferrerState.scopeStack.elements_length) {
e = inferrerScope_prettyPrint(string_array, DL_ARRAY_GETADDRESS(inferrerState.scopeStack, inferrerScope_t, i));
if (e) goto cleanup;
if ((dl_size_t) i != inferrerState.scopeStack.elements_length - 1) {
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
}
}
e = dl_array_pushElements(string_array, DL_STR("}"));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("}"));
if (e) goto cleanup;
cleanup: return e;
}
#endif
typedef struct {
inferrerState_t *state;
dl_uint8_t *fileName;
dl_size_t fileName_length;
inferrerType_t type;
dl_ptrdiff_t *type_index;
duckLisp_ast_expression_t *expression;
dl_ptrdiff_t *expression_index;
dl_array_t *newExpression; /* dl_array_t:duckLisp_ast_compoundExpression_t */
dl_size_t *newLength;
dl_bool_t parenthesized;
dl_bool_t infer;
} vmContext_t;
#if 0
static dl_error_t vmContext_prettyPrint(dl_array_t *string_array, vmContext_t vmContext) {
dl_error_t e = dl_error_ok;
e = dl_array_pushElements(string_array, DL_STR("(vmContext_t) {"));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("state = "));
if (e) goto cleanup;
if (vmContext.state == dl_null) {
e = dl_array_pushElements(string_array, DL_STR("NULL"));
if (e) goto cleanup;
}
else {
e = inferrerState_prettyPrint(string_array, *vmContext.state);
if (e) goto cleanup;
}
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("fileName = \""));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, vmContext.fileName, vmContext.fileName_length);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("\""));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("type = "));
if (e) goto cleanup;
e = inferrerType_prettyPrint(string_array, vmContext.type);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("type_index = "));
if (e) goto cleanup;
if (vmContext.type_index == dl_null) {
e = dl_array_pushElements(string_array, DL_STR("NULL"));
}
else {
e = dl_string_fromPtrdiff(string_array, *vmContext.type_index);
}
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("expression = "));
if (e) goto cleanup;
if (vmContext.expression == dl_null) {
e = dl_array_pushElements(string_array, DL_STR("NULL"));
}
else {
e = duckLisp_ast_expression_prettyPrint(string_array, *vmContext.expression);
}
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("expression_index = "));
if (e) goto cleanup;
if (vmContext.expression_index == dl_null) {
e = dl_array_pushElements(string_array, DL_STR("NULL"));
}
else {
e = dl_string_fromPtrdiff(string_array, *vmContext.expression_index);
}
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("newExpression = "));
if (e) goto cleanup;
if (vmContext.newExpression == dl_null) {
e = dl_array_pushElements(string_array, DL_STR("NULL"));
if (e) goto cleanup;
}
else {
e = dl_array_pushElements(string_array, DL_STR("{"));
if (e) goto cleanup;
DL_DOTIMES(i, vmContext.newExpression->elements_length) {
e = duckLisp_ast_compoundExpression_prettyPrint(string_array, DL_ARRAY_GETADDRESS(*vmContext.newExpression, duckLisp_ast_compoundExpression_t, i));
if (e) goto cleanup;
if ((dl_size_t) i != vmContext.newExpression->elements_length - 1) {
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
}
}
e = dl_array_pushElements(string_array, DL_STR("}"));
if (e) goto cleanup;
}
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("newLength = "));
if (e) goto cleanup;
if (vmContext.newLength == dl_null) {
e = dl_array_pushElements(string_array, DL_STR("NULL"));
}
else {
e = dl_string_fromSize(string_array, *vmContext.newLength);
}
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("parenthesized = "));
if (e) goto cleanup;
e = dl_string_fromBool(string_array, vmContext.parenthesized);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR(", "));
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("infer = "));
if (e) goto cleanup;
e = dl_string_fromBool(string_array, vmContext.infer);
if (e) goto cleanup;
e = dl_array_pushElements(string_array, DL_STR("}"));
if (e) goto cleanup;
cleanup: return e;
}
#endif
static dl_error_t duckLisp_error_pushInference(inferrerState_t *inferrerState,
const dl_uint8_t *message,
const dl_size_t message_length);
static dl_error_t inferrerState_log(inferrerState_t *inferrerState,
const dl_uint8_t *message,
const dl_size_t message_length) {
return dl_array_pushElements(inferrerState->log, message, message_length);
}
static void inferrerTypeSignature_init(inferrerTypeSignature_t *inferrerTypeSignature) {
inferrerTypeSignature->type = inferrerTypeSignature_type_symbol;
inferrerTypeSignature->value.symbol = inferrerTypeSymbol_L;
}
static dl_error_t inferrerTypeSignature_quit(inferrerTypeSignature_t *inferrerTypeSignature,
dl_memoryAllocation_t *memoryAllocation) {
dl_error_t e = dl_error_ok;
if (inferrerTypeSignature == dl_null) {
/* OK */
return e;
}
if (inferrerTypeSignature->type == inferrerTypeSignature_type_symbol) {
/* OK */
return e;
}
if (inferrerTypeSignature->value.expression.variadic) {
e = inferrerTypeSignature_quit(inferrerTypeSignature->value.expression.restSignature, memoryAllocation);
if (e) return e;
e = DL_FREE(memoryAllocation, &inferrerTypeSignature->value.expression.restSignature);
if (e) return e;
}
inferrerTypeSignature->value.expression.variadic = dl_false;
inferrerTypeSignature->value.expression.defaultRestLength = 0;
DL_DOTIMES(i, inferrerTypeSignature->value.expression.positionalSignatures_length) {
e = inferrerTypeSignature_quit(inferrerTypeSignature->value.expression.positionalSignatures + i,
memoryAllocation);
if (e) break;
}
e = DL_FREE(memoryAllocation, &inferrerTypeSignature->value.expression.positionalSignatures);
if (e) return e;
return e;
}
dl_error_t inferrerTypeSignature_serialize(inferrerState_t *state, inferrerTypeSignature_t inferrerTypeSignature) {
dl_error_t e = dl_error_ok;
if (inferrerTypeSignature.type == inferrerTypeSignature_type_symbol) {
if (inferrerTypeSignature.value.symbol == inferrerTypeSymbol_L) {
e = inferrerState_log(state, DL_STR("L"));
}
else {
e = inferrerState_log(state, DL_STR("I"));
}
if (e) goto cleanup;
}
else {
dl_bool_t first = dl_true;
e = inferrerState_log(state, DL_STR("("));
if (e) goto cleanup;
DL_DOTIMES(j, inferrerTypeSignature.value.expression.positionalSignatures_length) {
if (first) {
first = dl_false;
}
else {
e = inferrerState_log(state, DL_STR(" "));
if (e) goto cleanup;
}
inferrerTypeSignature_serialize(state, inferrerTypeSignature.value.expression.positionalSignatures[j]);
}
if (inferrerTypeSignature.value.expression.variadic) {
if (inferrerTypeSignature.value.expression.positionalSignatures_length > 0) {
e = inferrerState_log(state, DL_STR(" "));
if (e) goto cleanup;
}
e = inferrerState_log(state, DL_STR("&rest "));
if (e) goto cleanup;
e = dl_string_fromPtrdiff(state->log, inferrerTypeSignature.value.expression.defaultRestLength);
if (e) goto cleanup;
e = inferrerState_log(state, DL_STR(" "));
if (e) goto cleanup;
inferrerTypeSignature_serialize(state, *inferrerTypeSignature.value.expression.restSignature);
}
if (e) goto cleanup;
e = inferrerState_log(state, DL_STR(")"));
}
cleanup: return e;
}
static dl_error_t inferrerTypeSignature_fromAst(inferrerState_t *state,
inferrerTypeSignature_t *inferrerTypeSignature,
duckLisp_ast_compoundExpression_t compoundExpression) {
dl_error_t e = dl_error_ok;
dl_error_t eError = dl_error_ok;
switch (compoundExpression.type) {
case duckLisp_ast_type_identifier:
/* Fall through */
case duckLisp_ast_type_callback: {
dl_bool_t result;
duckLisp_ast_identifier_t identifier = compoundExpression.value.identifier;
(void) dl_string_compare(&result,
DL_STR("L"),
identifier.value,
identifier.value_length);
if (result) {
inferrerTypeSignature->value.symbol = inferrerTypeSymbol_L;
}
else {
(void) dl_string_compare(&result,
DL_STR("I"),
identifier.value,
identifier.value_length);
if (result) {
inferrerTypeSignature->value.symbol = inferrerTypeSymbol_I;
}
else {
e = dl_error_invalidValue;
eError = duckLisp_error_pushInference(state, DL_STR("Invalid type symbol"));
if (eError) e = eError;
goto cleanup;
}
}
inferrerTypeSignature->type = inferrerTypeSignature_type_symbol;
break;
}
case duckLisp_ast_type_expression: {
duckLisp_ast_expression_t expression = compoundExpression.value.expression;
inferrerTypeSignature_t subInferrerTypeSignature;
(void) inferrerTypeSignature_init(&subInferrerTypeSignature);
dl_array_t subInferrerTypeSignaturesArray;
(void) dl_array_init(&subInferrerTypeSignaturesArray,
state->memoryAllocation,
sizeof(inferrerTypeSignature_t),
dl_array_strategy_double);
dl_bool_t variadic = dl_false;
dl_ptrdiff_t variadic_arg = 0;
DL_DOTIMES(j, expression.compoundExpressions_length) {
if (variadic_arg == 1) {
variadic_arg++;
if (expression.compoundExpressions[j].type != duckLisp_ast_type_int) {
e = dl_error_invalidValue;
eError = duckLisp_error_pushInference(state, DL_STR("Default argument length is not an integer"));
if (eError) e = eError;
goto expressionCleanup;
}
inferrerTypeSignature->value.expression.defaultRestLength = (expression.compoundExpressions[j]
.value.integer.value);
continue;
}
if (variadic_arg == 2) {
variadic_arg++;
e = inferrerTypeSignature_fromAst(state, &subInferrerTypeSignature, expression.compoundExpressions[j]);
if (e) goto expressionCleanup;
e = DL_MALLOC(state->memoryAllocation,
&inferrerTypeSignature->value.expression.restSignature,
1,
inferrerTypeSignature_t);
if (e) goto expressionCleanup;
*inferrerTypeSignature->value.expression.restSignature = subInferrerTypeSignature;
continue;
}
if ((expression.compoundExpressions[j].type == duckLisp_ast_type_identifier)
|| (expression.compoundExpressions[j].type == duckLisp_ast_type_callback)) {
dl_bool_t result;
duckLisp_ast_identifier_t identifier = expression.compoundExpressions[j].value.identifier;
(void) dl_string_compare(&result,
DL_STR("&rest"),
identifier.value,
identifier.value_length);
if (result) {
if (variadic) {
e = dl_error_invalidValue;
eError = duckLisp_error_pushInference(state, DL_STR("Duplicate \"&rest\" in type specifier"));
if (eError) e = eError;
goto expressionCleanup;
}
if ((dl_size_t) j != (expression.compoundExpressions_length - 3)) {
e = dl_error_invalidValue;
eError = duckLisp_error_pushInference(state,
DL_STR("Exactly two forms should follow \"&rest\"."));
if (eError) e = eError;
goto expressionCleanup;
}
variadic = dl_true;
variadic_arg++;
continue;
}
}
e = inferrerTypeSignature_fromAst(state, &subInferrerTypeSignature, expression.compoundExpressions[j]);
if (e) goto expressionCleanup;
e = dl_array_pushElement(&subInferrerTypeSignaturesArray, &subInferrerTypeSignature);
if (e) goto expressionCleanup;
}
inferrerTypeSignature->type = inferrerTypeSignature_type_expression;
inferrerTypeSignature->value.expression.positionalSignatures = subInferrerTypeSignaturesArray.elements;
(inferrerTypeSignature
->value.expression.positionalSignatures_length) = subInferrerTypeSignaturesArray.elements_length;
inferrerTypeSignature->value.expression.variadic = variadic;
expressionCleanup:
if (e) {
eError = dl_array_quit(&subInferrerTypeSignaturesArray);
if (eError) e = eError;
eError = inferrerTypeSignature_quit(&subInferrerTypeSignature, state->memoryAllocation);
if (eError) e = eError;
}
break;
}
case duckLisp_ast_type_bool:
/* Fall through */
case duckLisp_ast_type_int:
/* Fall through */
case duckLisp_ast_type_float:
/* Fall through */
case duckLisp_ast_type_string:
e = dl_error_invalidValue;
// Log error.
goto cleanup;
default:
e = dl_error_cantHappen;
// Log error.
goto cleanup;
}
cleanup:
if (e) {
eError = inferrerTypeSignature_quit(inferrerTypeSignature, state->memoryAllocation);
if (eError) e = eError;
}
return e;
}
static void inferrerType_init(inferrerType_t *inferrerType) {
(void) inferrerTypeSignature_init(&inferrerType->type);
inferrerType->bytecode = dl_null;
inferrerType->bytecode_length = 0;
}
static dl_error_t inferrerType_quit(inferrerType_t *inferrerType, dl_memoryAllocation_t *memoryAllocation) {
dl_error_t e = inferrerTypeSignature_quit(&inferrerType->type, memoryAllocation);
e = DL_FREE(memoryAllocation, &inferrerType->bytecode);
inferrerType->bytecode_length = 0;
return e;
}
static void inferrerScope_init(inferrerScope_t *inferrerScope, dl_memoryAllocation_t *ma) {
(void) dl_trie_init(&inferrerScope->identifiersTrie, ma, -1);
(void) dl_array_init(&inferrerScope->types, ma, sizeof(inferrerType_t), dl_array_strategy_double);
}
static dl_error_t inferrerScope_quit(inferrerScope_t *inferrerScope, dl_memoryAllocation_t *ma) {
dl_error_t e = dl_trie_quit(&inferrerScope->identifiersTrie);
DL_DOTIMES(i, inferrerScope->types.elements_length) {
inferrerType_t inferrerType;
e = dl_array_get(&inferrerScope->types, &inferrerType, i);
if (e) break;
e = inferrerType_quit(&inferrerType, ma);
}
e = dl_array_quit(&inferrerScope->types);
return e;
}
static dl_error_t inferrerState_init(inferrerState_t *inferrerState,
dl_memoryAllocation_t *memoryAllocation,
dl_size_t maxComptimeVmObjects,
dl_array_t *errors,
dl_array_t *log,
const dl_uint8_t *fileName,
const dl_size_t fileName_length) {
dl_error_t e = dl_error_ok;
dl_array_t *inferrerContext = dl_null;
e = DL_MALLOC(memoryAllocation, &inferrerContext, 1, vmContext_t);
if (e) goto cleanup;
(void) dl_array_init(inferrerContext,
memoryAllocation,
sizeof(vmContext_t),
dl_array_strategy_double);
inferrerState->memoryAllocation = memoryAllocation;
e = duckLisp_init(&inferrerState->duckLisp, memoryAllocation, maxComptimeVmObjects, maxComptimeVmObjects);
if (e) goto cleanup;
e = duckVM_init(&inferrerState->duckVM, memoryAllocation, maxComptimeVmObjects);
if (e) goto cleanup;
inferrerState->duckVM.inferrerContext = inferrerContext;
inferrerState->errors = errors;
inferrerState->log = log;
inferrerState->fileName = fileName;
inferrerState->fileName_length = fileName_length;
(void) dl_array_init(&inferrerState->scopeStack,
memoryAllocation,
sizeof(inferrerScope_t),
dl_array_strategy_double);
cleanup: return e;
}
static dl_error_t inferrerState_quit(inferrerState_t *inferrerState) {
dl_error_t e = dl_error_ok;
dl_error_t eError = dl_error_ok;
{
dl_size_t length = inferrerState->scopeStack.elements_length;
DL_DOTIMES(i, length) {
inferrerScope_t inferrerScope;
e = dl_array_get(&inferrerState->scopeStack, &inferrerScope, i);
if (e) break;
e = inferrerScope_quit(&inferrerScope, inferrerState->memoryAllocation);
}
}
eError = dl_array_quit(&inferrerState->scopeStack);
if (eError) e = eError;
inferrerState->fileName_length = 0;
inferrerState->fileName = dl_null;
inferrerState->errors = dl_null;
inferrerState->log = dl_null;
e = dl_array_quit((dl_array_t *) inferrerState->duckVM.inferrerContext);
eError = DL_FREE(inferrerState->memoryAllocation, &inferrerState->duckVM.inferrerContext);
if (eError) e = eError;
(void) duckVM_quit(&inferrerState->duckVM);
(void) duckLisp_quit(&inferrerState->duckLisp);
inferrerState->memoryAllocation = dl_null;
return e;
}
static dl_error_t pushDeclarationScope(inferrerState_t *state, inferrerScope_t *scope) {
return dl_array_pushElement(&state->scopeStack, scope);
}
static dl_error_t popDeclarationScope(inferrerState_t *state, inferrerScope_t *scope) {
if (scope == dl_null) {
inferrerScope_t scope;
dl_error_t e = dl_array_popElement(&state->scopeStack, &scope);
if (e) goto cleanup;
e = inferrerScope_quit(&scope, state->memoryAllocation);
if (e) goto cleanup;
cleanup: return e;
}
else {
return dl_array_popElement(&state->scopeStack, scope);
}
}
static dl_error_t findDeclaration(inferrerState_t *state,
dl_bool_t *found,
inferrerType_t *type,
duckLisp_ast_identifier_t identifier) {
dl_error_t e = dl_error_ok;
*found = dl_false;
dl_array_t scopeStack = state->scopeStack;
for (dl_ptrdiff_t i = state->scopeStack.elements_length - 1; i >= 0; --i) {
inferrerScope_t scope;
e = dl_array_get(&scopeStack, &scope, i);
if (e) goto cleanup;
dl_ptrdiff_t index = -1;
(void) dl_trie_find(scope.identifiersTrie, &index, identifier.value, identifier.value_length);
if (index != -1) {
e = dl_array_get(&scope.types, type, index);
if (e) goto cleanup;
*found = dl_true;
break;
}
}
cleanup: return e;
}
static dl_error_t addDeclaration(inferrerState_t *state,
const dl_uint8_t *name,
const dl_size_t name_length,
duckLisp_ast_compoundExpression_t typeAst,
dl_uint8_t *bytecode,
dl_size_t bytecode_length) {
dl_error_t e = dl_error_ok;
dl_error_t eError = dl_error_ok;
inferrerType_t type;
inferrerScope_t scope;
(void) inferrerType_init(&type);
e = popDeclarationScope(state, &scope);
if (e) goto cleanup;
type.bytecode = bytecode;
type.bytecode_length = bytecode_length;
e = inferrerTypeSignature_fromAst(state, &type.type, typeAst);
if (e) goto cleanup;