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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
|
(* This Source Code Form is subject to the terms of the Mozilla Public License,
v. 2.0. If a copy of the MPL was not distributed with this file, You can
obtain one at https://mozilla.org/MPL/2.0/. *)
module
import common, sys.posix.cstdlib, lexer, ast, diagnostic
proc elna_parser_expect*(cursor: ^ElnaLexerCursor; expected: ElnaLexerKind; error_list: ^ElnaList) -> ^ElnaLexerToken
var
token: ^ElnaLexerToken
parser_error: ^ElnaErrorUnexpectedToken
begin
elna_lexer_skip_empty_lines(cursor);
token := elna_lexer_peek(cursor);
if token^.kind = expected then
token := elna_lexer_read(cursor)
else
token := nil;
parser_error := elna_error_unexpected_token_create(cursor, 1u);
parser_error^.expected[1] := expected;
elna_list_append(error_list, cast(parser_error: ^ElnaListNode))
end
return token
proc elna_parser_escape*(current_position: ^const Word8; result: ^Word8) -> Word
var
parsed_length: Word
next_character: Word8
pos: ^const Word8
begin
pos := current_position;
next_character := pos^;
if next_character = '\\' then
parsed_length := 2u;
pos := pos + 1u;
next_character := pos^;
if next_character = '\\' then
result^ := 92u8
elsif next_character = 'n' then
result^ := 10u8
elsif next_character = 't' then
result^ := 9u8
elsif next_character = 'f' then
result^ := 12u8
elsif next_character = 'r' then
result^ := 13u8
elsif next_character = 'v' then
result^ := 11u8
elsif next_character = '"' then
result^ := 34u8
elsif next_character = '\'' then
result^ := 39u8
elsif next_character = '0' then
result^ := 0u8
else
result^ := next_character
end
else
parsed_length := 1u;
result^ := next_character
end
return parsed_length
proc elna_parser_integer_literal*(cursor: ^ElnaLexerCursor) -> ^ElnaTreeIntegerLiteral
var
token: ^ElnaLexerToken
result: ^ElnaTreeIntegerLiteral
i: Word := 1u
val: Word := 0u
begin
result := malloc#[ElnaTreeIntegerLiteral](#size(ElnaTreeIntegerLiteral));
token := elna_lexer_read(cursor);
result^.kind := ElnaTreeKind.integer_literal;
result^.type_decoration := nil;
result^.position := token^.position;
while i <= token^.start.length do
val := val * 10u + cast(token^.start[i] - '0': Word);
i := i + 1u
end;
result^.value := val
return result
proc elna_parser_boolean_literal*(cursor: ^ElnaLexerCursor) -> ^ElnaTreeBooleanLiteral
var
token: ^ElnaLexerToken
result: ^ElnaTreeBooleanLiteral
begin
token := elna_lexer_read(cursor);
result := malloc#[ElnaTreeBooleanLiteral](#size(ElnaTreeBooleanLiteral));
result^.kind := ElnaTreeKind.boolean_literal;
result^.value := token^.start = "true";
result^.type_decoration := nil;
result^.position := token^.position
return result
proc elna_parser_nil_literal*(cursor: ^ElnaLexerCursor) -> ^ElnaTreeNilLiteral
var
token: ^ElnaLexerToken
result: ^ElnaTreeNilLiteral
begin
token := elna_lexer_read(cursor);
result := malloc#[ElnaTreeNilLiteral](#size(ElnaTreeNilLiteral));
result^.kind := ElnaTreeKind.null;
result^.type_decoration := nil;
result^.position := token^.position
return result
proc elna_parser_character_literal*(cursor: ^ElnaLexerCursor) -> ^ElnaTreeCharacterLiteral
var
result: ^ElnaTreeCharacterLiteral
token: ^ElnaLexerToken
begin
result := malloc#[ElnaTreeCharacterLiteral](#size(ElnaTreeCharacterLiteral));
token := elna_lexer_read(cursor);
result^.kind := ElnaTreeKind.character_literal;
result^.position := token^.position;
result^.type_decoration := nil;
elna_parser_escape(token^.start.ptr + 1u, @result^.value)
return result
proc elna_parser_variable_expression*(cursor: ^ElnaLexerCursor) -> ^ElnaTreeVariableExpression
var
result: ^ElnaTreeVariableExpression
token: ^ElnaLexerToken
begin
result := malloc#[ElnaTreeVariableExpression](#size(ElnaTreeVariableExpression));
token := elna_lexer_read(cursor);
result^.kind := ElnaTreeKind.variable_expression;
result^.name := token^.start;
result^.position := token^.position;
result^.type_decoration := nil
return result
proc elna_parser_string_literal*(cursor: ^ElnaLexerCursor) -> ^ElnaTreeStringLiteral
var
result: ^ElnaTreeStringLiteral
token: ^ElnaLexerToken
current_position: ^const Word8
parsed_length: Word
parsed_total: Word
target_start, target_position: ^Word8
begin
result := malloc#[ElnaTreeStringLiteral](#size(ElnaTreeStringLiteral));
token := elna_lexer_read(cursor);
target_start := malloc#[Word8](token^.start.length);
target_position := target_start;
current_position := token^.start.ptr + 1u;
parsed_total := 2u;
result^.kind := ElnaTreeKind.string_literal;
result^.position := token^.position;
result^.type_decoration := nil;
while parsed_total < token^.start.length do
parsed_length := elna_parser_escape(current_position, target_position);
current_position := current_position + parsed_length;
parsed_total := parsed_total + parsed_length;
target_position := target_position + 1u
end;
result^.value := target_start[1 to cast(target_position - target_start: Word)]
return result
proc elna_parser_trait_expression*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeTraitExpression
var
result: ^ElnaTreeTraitExpression
token: ^ElnaLexerToken
begin
result := malloc#[ElnaTreeTraitExpression](#size(ElnaTreeTraitExpression));
result^.kind := ElnaTreeKind.trait_expression;
token := elna_lexer_read(cursor);
result^.name := token^.start;
result^.position := token^.position;
if elna_parser_expect(cursor, ElnaLexerKind.left_paren, error_list) <> nil then
result^.argument := elna_parser_type_expression(cursor, error_list);
if result^.argument = nil then
result := free_and_nil(result)
elsif elna_parser_expect(cursor, ElnaLexerKind.right_paren, error_list) = nil then
result := free_and_nil(result)
end
else
result := free_and_nil(result)
end
return result
proc elna_parser_cast_expression*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeCastExpression
var
result: ^ElnaTreeCastExpression := nil
token: ^ElnaLexerToken
start_location: ElnaLocation
begin
token := elna_lexer_read(cursor);
start_location := token^.position.start_location;
if elna_parser_expect(cursor, ElnaLexerKind.left_paren, error_list) <> nil then
result := malloc#[ElnaTreeCastExpression](#size(ElnaTreeCastExpression));
result^.kind := ElnaTreeKind._cast;
result^.position.start_location := start_location;
result^.type_decoration := nil;
result^.expression := elna_parser_binary_expression(cursor, error_list);
if result^.expression = nil then
result := free_and_nil(result)
elsif elna_parser_expect(cursor, ElnaLexerKind.colon, error_list) = nil then
result := free_and_nil(result)
else
result^.type_expression := elna_parser_type_expression(cursor, error_list);
if result^.type_expression = nil then
result := free_and_nil(result)
else
token := elna_parser_expect(cursor, ElnaLexerKind.right_paren, error_list);
if token = nil then
result := free_and_nil(result)
else
result^.position.end_location := token^.position.end_location
end
end
end
end
return result
proc elna_parser_simple_expression*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeExpression
var
token: ^ElnaLexerToken
result: ^ElnaTreeExpression := nil
begin
token := elna_lexer_peek(cursor);
case token^.kind of
ElnaLexerKind.character:
result := cast(elna_parser_character_literal(cursor): ^ElnaTreeExpression)
| ElnaLexerKind.integer:
result := cast(elna_parser_integer_literal(cursor): ^ElnaTreeExpression)
| ElnaLexerKind.string:
result := cast(elna_parser_string_literal(cursor): ^ElnaTreeExpression)
| ElnaLexerKind.boolean:
result := cast(elna_parser_boolean_literal(cursor): ^ElnaTreeExpression)
| ElnaLexerKind.null:
result := cast(elna_parser_nil_literal(cursor): ^ElnaTreeExpression)
| ElnaLexerKind._cast:
result := cast(elna_parser_cast_expression(cursor, error_list): ^ElnaTreeExpression)
| ElnaLexerKind.trait:
result := cast(elna_parser_trait_expression(cursor, error_list): ^ElnaTreeExpression)
| ElnaLexerKind.identifier:
result := cast(elna_parser_variable_expression(cursor): ^ElnaTreeExpression)
else
end
return result
proc elna_parser_dereference_expression*(cursor: ^ElnaLexerCursor;
simple_expression: ^ElnaTreeExpression) -> ^ElnaTreeDereferenceExpression
var
result: ^ElnaTreeDereferenceExpression
token: ^ElnaLexerToken
begin
token := elna_lexer_read(cursor);
result := malloc#[ElnaTreeDereferenceExpression](#size(ElnaTreeDereferenceExpression));
result^.kind := ElnaTreeKind.dereference_expression;
result^.pointer := simple_expression;
result^.type_decoration := nil;
result^.position := token^.position
return result
proc elna_parser_field_access_expression*(cursor: ^ElnaLexerCursor;
aggregate: ^ElnaTreeExpression) -> ^ElnaTreeFieldAccessExpression
var
result: ^ElnaTreeFieldAccessExpression
token: ^ElnaLexerToken
begin
token := elna_lexer_read(cursor);
result := malloc#[ElnaTreeFieldAccessExpression](#size(ElnaTreeFieldAccessExpression));
result^.kind := ElnaTreeKind.field_access_expression;
result^.type_decoration := nil;
result^.aggregate := aggregate;
result^.position.start_location := token^.position.start_location;
token := elna_lexer_read(cursor);
result^.field := token^.start;
result^.position.end_location := token^.position.end_location
return result
proc elna_parser_array_access_expression*(cursor: ^ElnaLexerCursor;
array: ^ElnaTreeExpression; error_list: ^ElnaList) -> ^ElnaTreeArrayAccessExpression
var
result: ^ElnaTreeArrayAccessExpression
token: ^ElnaLexerToken
begin
token := elna_lexer_read(cursor);
result := malloc#[ElnaTreeArrayAccessExpression](#size(ElnaTreeArrayAccessExpression));
result^.kind := ElnaTreeKind.array_access_expression;
result^.type_decoration := nil;
result^.array := array;
result^.position.start_location := token^.position.start_location;
result^.index := elna_parser_binary_expression(cursor, error_list);
if result^.index = nil then
result := free_and_nil(result)
else
token := elna_parser_expect(cursor, ElnaLexerKind.right_square, error_list);
if token = nil then
result := free_and_nil(result)
else
result^.position.end_location := token^.position.end_location
end
end
return result
proc elna_parser_call*(cursor: ^ElnaLexerCursor; callee: ^ElnaTreeExpression; error_list: ^ElnaList) -> ^ElnaTreeCall
var
result: ^ElnaTreeCall
argument_entry: ^ElnaTreeExpressionList
token: ^ElnaLexerToken
parser_error: ^ElnaErrorUnexpectedToken
reading_args: Bool := true
begin
result := malloc#[ElnaTreeCall](#size(ElnaTreeCall));
result^.kind := ElnaTreeKind.call;
result^.type_decoration := nil;
result^.arguments := nil;
result^.count := 0u;
result^.callee := cast(callee: ^ElnaTreeVariableExpression);
token := elna_lexer_read(cursor);
result^.position.start_location := token^.position.start_location;
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind.right_paren then
token := elna_lexer_read(cursor);
result^.position.end_location := token^.position.end_location
else
while reading_args do
if result^.arguments = nil then
result^.arguments := malloc#[ElnaTreeExpressionList](#size(ElnaTreeExpressionList));
argument_entry := result^.arguments
else
argument_entry^.next := malloc#[ElnaTreeExpressionList](#size(ElnaTreeExpressionList));
argument_entry := argument_entry^.next
end;
argument_entry^.next := nil;
argument_entry^.expression := elna_parser_binary_expression(cursor, error_list);
if argument_entry^.expression = nil then
result := free_and_nil(result);
reading_args := false
else
result^.count := result^.count + 1u;
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind.comma then
elna_lexer_read(cursor)
elsif token^.kind = ElnaLexerKind.right_paren then
token := elna_lexer_read(cursor);
result^.position.end_location := token^.position.end_location;
reading_args := false
else
parser_error := elna_error_unexpected_token_create(cursor, 2u);
parser_error^.expected[1] := ElnaLexerKind.comma;
parser_error^.expected[2] := ElnaLexerKind.right_paren;
elna_list_append(error_list, cast(parser_error: ^ElnaListNode));
result := free_and_nil(result);
reading_args := false
end
end
end
end
return result
proc elna_parser_designator*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeExpression
var
simple_expression: ^ElnaTreeExpression
token: ^ElnaLexerToken
continue_loop: Bool := true
begin
simple_expression := elna_parser_simple_expression(cursor, error_list);
if simple_expression <> nil then
while continue_loop do
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind.hat then
simple_expression := cast(elna_parser_dereference_expression(cursor, simple_expression): ^ElnaTreeExpression)
elsif token^.kind = ElnaLexerKind.dot then
simple_expression := cast(elna_parser_field_access_expression(cursor, simple_expression): ^ElnaTreeExpression)
elsif token^.kind = ElnaLexerKind.left_square then
simple_expression := cast(elna_parser_array_access_expression(cursor, simple_expression, error_list): ^ElnaTreeExpression);
if simple_expression = nil then
continue_loop := false
end
elsif token^.kind = ElnaLexerKind.left_paren then
simple_expression := cast(elna_parser_call(cursor, simple_expression, error_list): ^ElnaTreeExpression);
if simple_expression = nil then
continue_loop := false
end
else
continue_loop := false
end
end
end
return simple_expression
proc elna_parser_unary_expression*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeExpression
var
unary_result: ^ElnaTreeUnaryExpression
result: ^ElnaTreeExpression
op_kind: ElnaLexerKind
has_op: Bool := false
token: ^ElnaLexerToken
begin
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind.at or token^.kind = ElnaLexerKind.minus or token^.kind = ElnaLexerKind.not then
op_kind := token^.kind;
has_op := true;
elna_lexer_read(cursor)
end;
result := elna_parser_designator(cursor, error_list);
if result <> nil & has_op then
unary_result := malloc#[ElnaTreeUnaryExpression](#size(ElnaTreeUnaryExpression));
unary_result^.kind := ElnaTreeKind.unary_expression;
unary_result^.operand := result;
unary_result^.operator := op_kind;
unary_result^.position := token^.position;
unary_result^.type_decoration := nil;
result := cast(unary_result: ^ElnaTreeExpression)
end
return result
proc elna_parser_binary_expression*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeExpression
var
lhs_node: ^ElnaTreeExpression
rhs_node: ^ElnaTreeExpression := nil
bin_result: ^ElnaTreeBinaryExpression
token: ^ElnaLexerToken
begin
lhs_node := elna_parser_unary_expression(cursor, error_list);
token := elna_lexer_peek(cursor);
case token^.kind of
ElnaLexerKind.plus,
ElnaLexerKind.minus,
ElnaLexerKind.multiplication,
ElnaLexerKind.and,
ElnaLexerKind._or,
ElnaLexerKind._xor,
ElnaLexerKind.equals,
ElnaLexerKind.remainder,
ElnaLexerKind.division,
ElnaLexerKind.less_than,
ElnaLexerKind.greater_than,
ElnaLexerKind.less_equal,
ElnaLexerKind.not_equal,
ElnaLexerKind.greater_equal:
elna_lexer_read(cursor);
rhs_node := elna_parser_unary_expression(cursor, error_list)
else
end;
if rhs_node <> nil then
bin_result := malloc#[ElnaTreeBinaryExpression](#size(ElnaTreeBinaryExpression));
bin_result^.kind := ElnaTreeKind.binary_expression;
bin_result^.lhs := lhs_node;
bin_result^.rhs := rhs_node;
bin_result^.operator := token^.kind;
bin_result^.position := token^.position;
bin_result^.type_decoration := nil;
lhs_node := cast(bin_result: ^ElnaTreeExpression)
end
return lhs_node
proc elna_parser_label_declaration*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeLabelDeclaration
var
result: ^ElnaTreeLabelDeclaration
token: ^ElnaLexerToken
begin
token := elna_lexer_read(cursor);
result := malloc#[ElnaTreeLabelDeclaration](#size(ElnaTreeLabelDeclaration));
result^.kind := ElnaTreeKind.label_declaration;
result^.next := nil;
result^.position.start_location := token^.position.start_location;
token := elna_parser_expect(cursor, ElnaLexerKind.identifier, error_list);
if token <> nil then
result^.label := token^.start;
result^.position.end_location := token^.position.end_location
else
result := free_and_nil(result)
end
return result
proc elna_parser_assign_statement*(cursor: ^ElnaLexerCursor; assignee: ^ElnaTreeExpression; error_list: ^ElnaList) -> ^ElnaTreeAssignStatement
var
token: ^ElnaLexerToken
result: ^ElnaTreeAssignStatement
begin
result := malloc#[ElnaTreeAssignStatement](#size(ElnaTreeAssignStatement));
result^.kind := ElnaTreeKind.assign_statement;
result^.next := nil;
result^.assignee := assignee;
result^.assignment := nil;
token := elna_parser_expect(cursor, ElnaLexerKind.assignment, error_list);
if token <> nil then
result^.position := token^.position;
result^.assignment := elna_parser_binary_expression(cursor, error_list)
end;
if result^.assignment = nil then
result := free_and_nil(result)
end
return result
proc elna_parser_return_statement*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeReturnStatement
var
token: ^ElnaLexerToken
result: ^ElnaTreeReturnStatement
begin
token := elna_lexer_read(cursor);
result := malloc#[ElnaTreeReturnStatement](#size(ElnaTreeReturnStatement));
result^.kind := ElnaTreeKind.return_statement;
result^.next := nil;
result^.position := token^.position;
result^.returned := elna_parser_binary_expression(cursor, error_list);
if result^.returned = nil then
result := free_and_nil(result)
end
return result
proc elna_parser_conditional_statements*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList;
block_keyword: ElnaLexerKind) -> ^ElnaTreeConditionalStatements
var
result: ^ElnaTreeConditionalStatements
begin
result := malloc#[ElnaTreeConditionalStatements](#size(ElnaTreeConditionalStatements));
elna_lexer_read(cursor);
result^.condition := elna_parser_binary_expression(cursor, error_list);
if result^.condition = nil then
result := free_and_nil(result)
else
if elna_parser_expect(cursor, block_keyword, error_list) <> nil then
result^.statements := elna_parser_statements(cursor, error_list)
end;
if elna_list_empty(error_list) then
result^.next := nil
else
result := free_and_nil(result)
end
end
return result
proc elna_parser_if_statement*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeIfStatement
var
result: ^ElnaTreeIfStatement
previous_conditional: ^ElnaTreeConditionalStatements
next_conditional: ^ElnaTreeConditionalStatements
token: ^ElnaLexerToken
reading_elsif: Bool := true
begin
token := elna_lexer_peek(cursor);
result := malloc#[ElnaTreeIfStatement](#size(ElnaTreeIfStatement));
result^.kind := ElnaTreeKind.if_statement;
result^.position := token^.position;
result^.next := nil;
previous_conditional := elna_parser_conditional_statements(cursor, error_list, ElnaLexerKind._then);
result^.conditionals := previous_conditional;
while reading_elsif do
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind._elsif then
next_conditional := elna_parser_conditional_statements(cursor, error_list, ElnaLexerKind._then);
previous_conditional^.next := next_conditional;
previous_conditional := next_conditional
elsif token^.kind = ElnaLexerKind._else then
elna_lexer_read(cursor);
result^._else := elna_parser_statements(cursor, error_list);
reading_elsif := false
else
result^._else := nil;
reading_elsif := false
end
end;
elna_parser_expect(cursor, ElnaLexerKind._end, error_list)
return result
proc elna_parser_statement*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeStatement
var
result: ^ElnaTreeStatement := nil
call_result: ^ElnaTreeCallStatement
designator: ^ElnaTreeExpression
token: ^ElnaLexerToken
begin
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind._if then
result := cast(elna_parser_if_statement(cursor, error_list): ^ElnaTreeStatement)
elsif token^.kind = ElnaLexerKind._return then
result := cast(elna_parser_return_statement(cursor, error_list): ^ElnaTreeStatement)
elsif token^.kind = ElnaLexerKind.dot then
result := cast(elna_parser_label_declaration(cursor, error_list): ^ElnaTreeStatement)
elsif token^.kind = ElnaLexerKind.identifier then
designator := elna_parser_designator(cursor, error_list);
if designator <> nil then
if designator^.kind <> ElnaTreeKind.call then
result := cast(elna_parser_assign_statement(cursor, designator, error_list): ^ElnaTreeStatement)
else
call_result := malloc#[ElnaTreeCallStatement](#size(ElnaTreeCallStatement));
call_result^.kind := ElnaTreeKind.call_statement;
call_result^.next := nil;
call_result^.call := cast(designator: ^ElnaTreeCall);
call_result^.position := designator^.position;
result := cast(call_result: ^ElnaTreeStatement)
end
end
end
return result
proc elna_parser_statements*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeStatement
var
previous_statement: ^ElnaTreeStatement
next_statement: ^ElnaTreeStatement
first_statement: ^ElnaTreeStatement
token: ^ElnaLexerToken
begin
elna_lexer_skip_empty_lines(cursor);
first_statement := elna_parser_statement(cursor, error_list);
previous_statement := first_statement;
if previous_statement <> nil then
token := elna_lexer_peek(cursor);
while token^.kind = ElnaLexerKind.semicolon & elna_list_empty(error_list) do
elna_lexer_read(cursor);
elna_lexer_skip_empty_lines(cursor);
next_statement := elna_parser_statement(cursor, error_list);
previous_statement^.next := next_statement;
previous_statement := next_statement;
token := elna_lexer_peek(cursor)
end
end;
elna_lexer_skip_empty_lines(cursor)
return first_statement
proc elna_parser_named_type_expression*(cursor: ^ElnaLexerCursor) -> ^ElnaTreeNamedTypeExpression
var
result: ^ElnaTreeNamedTypeExpression
token: ^ElnaLexerToken
begin
result := malloc#[ElnaTreeNamedTypeExpression](#size(ElnaTreeNamedTypeExpression));
token := elna_lexer_read(cursor);
result^.kind := ElnaTreeKind.named_type_expression;
result^.name := token^.start;
result^.position := token^.position
return result
proc elna_parser_pointer_type_expression*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreePointerTypeExpression
var
result: ^ElnaTreePointerTypeExpression
token: ^ElnaLexerToken
begin
token := elna_lexer_read(cursor);
result := malloc#[ElnaTreePointerTypeExpression](#size(ElnaTreePointerTypeExpression));
result^.kind := ElnaTreeKind.pointer_type_expression;
result^.base := elna_parser_type_expression(cursor, error_list);
result^.position := token^.position;
if result^.base = nil then
result := free_and_nil(result)
end
return result
proc elna_parser_array_type_expression*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeArrayTypeExpression
var
result: ^ElnaTreeArrayTypeExpression
token: ^ElnaLexerToken
begin
token := elna_lexer_read(cursor);
result := malloc#[ElnaTreeArrayTypeExpression](#size(ElnaTreeArrayTypeExpression));
result^.kind := ElnaTreeKind.array_type_expression;
result^.position.start_location := token^.position.start_location;
result^.length := elna_parser_binary_expression(cursor, error_list);
if result^.length = nil then
result := free_and_nil(result)
else
token := elna_parser_expect(cursor, ElnaLexerKind.right_square, error_list);
if token = nil then
result := free_and_nil(result)
else
result^.base := elna_parser_type_expression(cursor, error_list);
if result^.base = nil then
result := free_and_nil(result)
else
result^.position.end_location := token^.position.end_location
end
end
end
return result
proc elna_parser_record_type_expression*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeRecordTypeExpression
var
entry: ^ElnaTreeField
result: ^ElnaTreeRecordTypeExpression
previous_entry: ^ElnaTreeField
token: ^ElnaLexerToken
parser_error: ^ElnaErrorUnexpectedToken
reading_members: Bool := true
begin
token := elna_lexer_read(cursor);
result := malloc#[ElnaTreeRecordTypeExpression](#size(ElnaTreeRecordTypeExpression));
result^.kind := ElnaTreeKind.record_type_expression;
result^.members := nil;
result^.length := 0u;
result^.position := token^.position;
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind.left_paren then
elna_lexer_read(cursor);
token := elna_parser_expect(cursor, ElnaLexerKind.identifier, error_list);
if token = nil then
result := free_and_nil(result);
reading_members := false
else
result^.parent := token^.start;
if elna_parser_expect(cursor, ElnaLexerKind.right_paren, error_list) = nil then
result := free_and_nil(result);
reading_members := false
end
end
end;
while reading_members & result <> nil do
token := elna_lexer_read(cursor);
if token^.kind = ElnaLexerKind._end then
reading_members := false
elsif token^.kind <> ElnaLexerKind.identifier then
parser_error := elna_error_unexpected_token_create(cursor, 2u);
parser_error^.expected[1] := ElnaLexerKind._end;
parser_error^.expected[2] := ElnaLexerKind.identifier;
elna_list_append(error_list, cast(parser_error: ^ElnaListNode));
result := free_and_nil(result);
reading_members := false
else
entry := malloc#[ElnaTreeField](#size(ElnaTreeField));
result^.length := result^.length + 1u;
entry^.name := token^.start;
if elna_parser_expect(cursor, ElnaLexerKind.colon, error_list) = nil then
result := free_and_nil(result);
reading_members := false
else
entry^.type_expression := elna_parser_type_expression(cursor, error_list);
if entry^.type_expression = nil then
result := free_and_nil(result);
reading_members := false
else
entry^.next := nil;
if result^.members = nil then
result^.members := entry
else
previous_entry^.next := entry
end;
previous_entry := entry;
token := elna_lexer_read(cursor);
if token^.kind = ElnaLexerKind.semicolon then
(* continue *)
elsif token^.kind = ElnaLexerKind._end then
reading_members := false
else
parser_error := elna_error_unexpected_token_create(cursor, 2u);
parser_error^.expected[1] := ElnaLexerKind._end;
parser_error^.expected[2] := ElnaLexerKind.semicolon;
elna_list_append(error_list, cast(parser_error: ^ElnaListNode));
reading_members := false
end
end
end
end
end
return result
proc elna_parser_enumeration_type_expression*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeEnumerationTypeExpression
var
result: ^ElnaTreeEnumerationTypeExpression
entry: ^ElnaTreeEnumeration
previous_entry: ^ElnaTreeEnumeration
token: ^ElnaLexerToken
parser_error: ^ElnaErrorUnexpectedToken
reading_members: Bool := true
begin
token := elna_lexer_read(cursor);
result := malloc#[ElnaTreeEnumerationTypeExpression](#size(ElnaTreeEnumerationTypeExpression));
result^.kind := ElnaTreeKind.enumeration_type_expression;
result^.members := nil;
result^.length := 0u;
result^.position.start_location := token^.position.start_location;
while reading_members & result <> nil do
token := elna_parser_expect(cursor, ElnaLexerKind.identifier, error_list);
if token = nil then
result := free_and_nil(result);
reading_members := false
else
entry := malloc#[ElnaTreeEnumeration](#size(ElnaTreeEnumeration));
result^.length := result^.length + 1u;
entry^.name := token^.start;
entry^.next := nil;
if result^.members = nil then
result^.members := entry
else
previous_entry^.next := entry
end;
previous_entry := entry;
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind.comma then
elna_lexer_read(cursor)
elsif token^.kind = ElnaLexerKind.right_paren then
token := elna_lexer_read(cursor);
result^.position.end_location := token^.position.end_location;
reading_members := false
else
parser_error := elna_error_unexpected_token_create(cursor, 2u);
parser_error^.expected[1] := ElnaLexerKind.comma;
parser_error^.expected[2] := ElnaLexerKind.right_paren;
elna_list_append(error_list, cast(parser_error: ^ElnaListNode));
result := free_and_nil(result);
reading_members := false
end
end
end
return result
proc elna_parser_type_expression*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeTypeExpression
var
result: ^ElnaTreeTypeExpression := nil
token: ^ElnaLexerToken
parser_error: ^ElnaErrorUnexpectedToken
begin
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind.identifier then
result := cast(elna_parser_named_type_expression(cursor): ^ElnaTreeTypeExpression)
elsif token^.kind = ElnaLexerKind.left_paren then
result := cast(elna_parser_enumeration_type_expression(cursor, error_list): ^ElnaTreeTypeExpression)
elsif token^.kind = ElnaLexerKind._record then
result := cast(elna_parser_record_type_expression(cursor, error_list): ^ElnaTreeTypeExpression)
elsif token^.kind = ElnaLexerKind.hat then
result := cast(elna_parser_pointer_type_expression(cursor, error_list): ^ElnaTreeTypeExpression)
elsif token^.kind = ElnaLexerKind.left_square then
result := cast(elna_parser_array_type_expression(cursor, error_list): ^ElnaTreeTypeExpression)
else
parser_error := elna_error_unexpected_token_create(cursor, 5u);
parser_error^.expected[1] := ElnaLexerKind.identifier;
parser_error^.expected[2] := ElnaLexerKind.left_paren;
parser_error^.expected[3] := ElnaLexerKind._record;
parser_error^.expected[4] := ElnaLexerKind.hat;
parser_error^.expected[5] := ElnaLexerKind.left_square;
elna_list_append(error_list, cast(parser_error: ^ElnaListNode))
end
return result
proc elna_parser_variable_declaration*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeVariableDeclaration
var
var_type: ^ElnaTreeTypeExpression
result: ^ElnaTreeVariableDeclaration := nil
token: ^ElnaLexerToken
begin
token := elna_parser_expect(cursor, ElnaLexerKind.identifier, error_list);
if token <> nil then
if elna_parser_expect(cursor, ElnaLexerKind.colon, error_list) <> nil then
var_type := elna_parser_type_expression(cursor, error_list);
if var_type <> nil then
result := malloc#[ElnaTreeVariableDeclaration](#size(ElnaTreeVariableDeclaration));
result^.kind := ElnaTreeKind.variable_declaration;
result^.next := nil;
result^.name := token^.start;
result^.type_expression := var_type;
result^.position := token^.position
end
end
end
return result
proc elna_parser_parameters*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeVariableDeclaration
var
parameters: ^ElnaTreeVariableDeclaration := nil
token: ^ElnaLexerToken
current_declaration: ^ElnaTreeVariableDeclaration
next_declaration: ^ElnaTreeVariableDeclaration
reading: Bool := true
begin
token := elna_lexer_peek(cursor);
if token^.kind <> ElnaLexerKind.right_paren then
while reading do
next_declaration := elna_parser_variable_declaration(cursor, error_list);
if next_declaration = nil then
parameters := free_and_nil(parameters);
reading := false
else
if parameters = nil then
parameters := next_declaration
else
current_declaration^.next := cast(next_declaration: ^ElnaTreeDeclaration)
end;
current_declaration := next_declaration;
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind.comma or token^.kind = ElnaLexerKind.semicolon then
elna_lexer_read(cursor)
else
reading := false
end
end
end
end
return parameters
proc elna_parser_procedure_declaration*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeProcedureDeclaration
var
result: ^ElnaTreeProcedureDeclaration
token: ^ElnaLexerToken
begin
token := elna_lexer_read(cursor);
result := malloc#[ElnaTreeProcedureDeclaration](#size(ElnaTreeProcedureDeclaration));
result^.kind := ElnaTreeKind.procedure_declaration;
result^.next := nil;
result^.position := token^.position;
token := elna_parser_expect(cursor, ElnaLexerKind.identifier, error_list);
if token = nil then
result := free_and_nil(result)
else
result^.name := token^.start;
if elna_parser_expect(cursor, ElnaLexerKind.left_paren, error_list) = nil then
result := free_and_nil(result)
else
result^.parameters := elna_parser_parameters(cursor, error_list);
if elna_list_empty(error_list) = false then
result := free_and_nil(result)
elsif elna_parser_expect(cursor, ElnaLexerKind.right_paren, error_list) = nil then
result := free_and_nil(result)
else
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind.arrow then
elna_lexer_read(cursor);
result^.return_type := elna_parser_type_expression(cursor, error_list);
if result^.return_type = nil then
result := free_and_nil(result)
end
else
result^.return_type := nil
end;
if result <> nil then
token := elna_lexer_peek(cursor);
result^.is_extern := token^.kind = ElnaLexerKind._extern;
if result^.is_extern then
elna_lexer_read(cursor);
result^.temporaries := nil;
result^.body := nil
else
result^.temporaries := elna_parser_var_part(cursor, error_list);
if elna_list_empty(error_list) = false then
result := free_and_nil(result)
else
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind._begin then
elna_lexer_read(cursor);
result^.body := elna_parser_statements(cursor, error_list);
if elna_list_empty(error_list) = false then
result := free_and_nil(result)
elsif elna_parser_expect(cursor, ElnaLexerKind._end, error_list) = nil then
result := free_and_nil(result)
end
elsif token^.kind = ElnaLexerKind._return then
result^.body := cast(elna_parser_return_statement(cursor, error_list): ^ElnaTreeStatement);
if result^.body = nil then
result := free_and_nil(result)
end
end
end
end
end
end
end
end
return result
proc elna_parser_procedures*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeProcedureDeclaration
var
parser_node: ^ElnaTreeProcedureDeclaration
result: ^ElnaTreeProcedureDeclaration := nil
current_declaration: ^ElnaTreeProcedureDeclaration
token: ^ElnaLexerToken
reading: Bool := true
begin
while reading do
elna_lexer_skip_empty_lines(cursor);
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind._proc then
parser_node := elna_parser_procedure_declaration(cursor, error_list);
if parser_node <> nil then
if result = nil then
result := parser_node
else
current_declaration^.next := cast(parser_node: ^ElnaTreeDeclaration)
end;
current_declaration := parser_node
else
reading := false
end
else
reading := false
end
end
return result
proc elna_parser_type_declaration*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeTypeDeclaration
var
result: ^ElnaTreeTypeDeclaration
token: ^ElnaLexerToken
begin
token := elna_lexer_read(cursor);
result := malloc#[ElnaTreeTypeDeclaration](#size(ElnaTreeTypeDeclaration));
result^.kind := ElnaTreeKind.type_declaration;
result^.next := nil;
result^.name := token^.start;
result^.position := token^.position;
if elna_parser_expect(cursor, ElnaLexerKind.equals, error_list) <> nil then
result^.type_expression := elna_parser_type_expression(cursor, error_list)
else
result := free_and_nil(result)
end
return result
proc elna_parser_type_part*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeDeclaration
var
parser_node: ^ElnaTreeDeclaration
result: ^ElnaTreeDeclaration := nil
current_declaration: ^ElnaTreeDeclaration
token: ^ElnaLexerToken
reading: Bool := true
begin
elna_lexer_skip_empty_lines(cursor);
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind._type then
elna_lexer_read(cursor);
while reading do
elna_lexer_skip_empty_lines(cursor);
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind.identifier then
parser_node := cast(elna_parser_type_declaration(cursor, error_list): ^ElnaTreeDeclaration);
if parser_node <> nil then
if result = nil then
result := parser_node
else
current_declaration^.next := parser_node
end;
current_declaration := parser_node;
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind.semicolon then
elna_lexer_read(cursor)
end
else
reading := false
end
else
reading := false
end
end
end
return result
proc elna_parser_var_part*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeVariableDeclaration
var
result: ^ElnaTreeVariableDeclaration := nil
variable_node: ^ElnaTreeVariableDeclaration
current_declaration: ^ElnaTreeVariableDeclaration
token: ^ElnaLexerToken
reading: Bool := true
begin
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind._var then
elna_lexer_read(cursor);
while reading do
elna_lexer_skip_empty_lines(cursor);
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind.identifier then
variable_node := elna_parser_variable_declaration(cursor, error_list);
if variable_node <> nil then
if result = nil then
result := variable_node
else
current_declaration^.next := cast(variable_node: ^ElnaTreeDeclaration)
end;
current_declaration := variable_node;
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind.semicolon then
elna_lexer_read(cursor)
end
else
reading := false
end
else
reading := false
end
end
end
return result
proc elna_parser_program_body*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeStatement
var
result: ^ElnaTreeStatement := nil
token: ^ElnaLexerToken
begin
elna_lexer_skip_empty_lines(cursor);
token := elna_lexer_peek(cursor);
if token^.kind = ElnaLexerKind._begin then
elna_lexer_read(cursor);
result := elna_parser_statements(cursor, error_list);
if elna_parser_expect(cursor, ElnaLexerKind._end, error_list) = nil then
result := free_and_nil(result)
elsif elna_parser_expect(cursor, ElnaLexerKind.dot, error_list) = nil then
result := free_and_nil(result)
end
elsif token^.kind = ElnaLexerKind._end then
elna_lexer_read(cursor);
if elna_parser_expect(cursor, ElnaLexerKind.dot, error_list) = nil then
result := free_and_nil(result)
end
end
return result
proc elna_parser_module_declaration*(cursor: ^ElnaLexerCursor; error_list: ^ElnaList) -> ^ElnaTreeModuleDeclaration
var
result: ^ElnaTreeModuleDeclaration
begin
result := malloc#[ElnaTreeModuleDeclaration](#size(ElnaTreeModuleDeclaration));
result^.kind := ElnaTreeKind.module_declaration;
result^.position.start_location := { ElnaLocation; line: 1u, column: 1u };
result^.position.end_location := result^.position.start_location;
result^.types := elna_parser_type_part(cursor, error_list);
if elna_list_empty(error_list) = false then
result := free_and_nil(result)
end;
if result <> nil then
result^.globals := elna_parser_var_part(cursor, error_list);
if elna_list_empty(error_list) = false then
result := free_and_nil(result)
end
end;
if result <> nil then
result^.procedures := elna_parser_procedures(cursor, error_list);
if elna_list_empty(error_list) = false then
result := free_and_nil(result)
end
end;
if result <> nil then
result^.body := elna_parser_program_body(cursor, error_list);
if elna_list_empty(error_list) = false then
result := free_and_nil(result)
end
end
return result
end.
|