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
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
|
//
//
// The Nimrod Compiler
// (c) Copyright 2008 Andreas Rumpf
//
// See the file "copying.txt", included in this
// distribution, for details about the copyright.
//
unit pasparse;
// This module implements the parser of the Pascal variant Nimrod is written in.
// It transfers a Pascal module into a Nimrod AST. Then the renderer can be
// used to generate the Nimrod version of the compiler.
{$include config.inc}
interface
uses
nsystem, nos, llstream, charsets, scanner, paslex, idents, wordrecg, strutils,
ast, astalgo, msgs, options;
type
TPasSection = (seImplementation, seInterface);
TPasContext = (conExpr, conStmt, conTypeDesc);
TPasParser = record
section: TPasSection;
inParamList: boolean;
context: TPasContext; // needed for the @emit command
lastVarSection: PNode;
lex: TPasLex;
tok: TPasTok;
repl: TIdTable; // replacements
end;
TReplaceTuple = array [0..1] of string;
const
ImportBlackList: array [1..3] of string = (
'nsystem', 'sysutils', 'charsets'
);
stdReplacements: array [1..19] of TReplaceTuple = (
('include', 'incl'),
('exclude', 'excl'),
('pchar', 'cstring'),
('assignfile', 'open'),
('integer', 'int'),
('longword', 'int32'),
('cardinal', 'int'),
('boolean', 'bool'),
('shortint', 'int8'),
('smallint', 'int16'),
('longint', 'int32'),
('byte', 'int8'),
('word', 'int16'),
('single', 'float32'),
('double', 'float64'),
('real', 'float'),
('length', 'len'),
('len', 'length'),
('setlength', 'setlen')
);
nimReplacements: array [1..35] of TReplaceTuple = (
('nimread', 'read'),
('nimwrite', 'write'),
('nimclosefile', 'close'),
('closefile', 'close'),
('openfile', 'open'),
('nsystem', 'system'),
('ntime', 'times'),
('nos', 'os'),
('nmath', 'math'),
('ncopy', 'copy'),
('addChar', 'add'),
('halt', 'quit'),
('nobject', 'TObject'),
('eof', 'EndOfFile'),
('input', 'stdin'),
('output', 'stdout'),
('addu', '`+%`'),
('subu', '`-%`'),
('mulu', '`*%`'),
('divu', '`/%`'),
('modu', '`%%`'),
('ltu', '`<%`'),
('leu', '`<=%`'),
('shlu', '`shl`'),
('shru', '`shr`'),
('assigned', 'not isNil'),
('eintoverflow', 'EOverflow'),
('format', '`%`'),
('snil', 'nil'),
('tostringf', '$'+''),
('ttextfile', 'tfile'),
('tbinaryfile', 'tfile'),
('strstart', '0'+''),
('nl', '"\n"'),
('tostring', '$'+'')
{,
('NL', '"\n"'),
('tabulator', '''\t'''),
('esc', '''\e'''),
('cr', '''\r'''),
('lf', '''\l'''),
('ff', '''\f'''),
('bel', '''\a'''),
('backspace', '''\b'''),
('vt', '''\v''') }
);
function ParseUnit(var p: TPasParser): PNode;
procedure openPasParser(var p: TPasParser; const filename: string;
inputStream: PLLStream);
procedure closePasParser(var p: TPasParser);
procedure exSymbol(var n: PNode);
procedure fixRecordDef(var n: PNode);
// XXX: move these two to an auxiliary module
implementation
procedure OpenPasParser(var p: TPasParser; const filename: string;
inputStream: PLLStream);
var
i: int;
begin
{@ignore}
FillChar(p, sizeof(p), 0);
{@emit}
OpenLexer(p.lex, filename, inputStream);
initIdTable(p.repl);
for i := low(stdReplacements) to high(stdReplacements) do
IdTablePut(p.repl, getIdent(stdReplacements[i][0]),
getIdent(stdReplacements[i][1]));
if gCmd = cmdBoot then
for i := low(nimReplacements) to high(nimReplacements) do
IdTablePut(p.repl, getIdent(nimReplacements[i][0]),
getIdent(nimReplacements[i][1]));
end;
procedure ClosePasParser(var p: TPasParser);
begin
CloseLexer(p.lex);
end;
// ---------------- parser helpers --------------------------------------------
procedure getTok(var p: TPasParser);
begin
getPasTok(p.lex, p.tok)
end;
procedure parMessage(const p: TPasParser; const msg: TMsgKind;
const arg: string = '');
begin
lexMessage(p.lex, msg, arg);
end;
function parLineInfo(const p: TPasParser): TLineInfo;
begin
result := getLineInfo(p.lex)
end;
procedure skipCom(var p: TPasParser; n: PNode);
begin
while p.tok.xkind = pxComment do begin
if (n <> nil) then begin
if n.comment = snil then n.comment := p.tok.literal
else n.comment := n.comment +{&} nl +{&} p.tok.literal;
end
else
parMessage(p, warnCommentXIgnored, p.tok.literal);
getTok(p);
end
end;
procedure ExpectIdent(const p: TPasParser);
begin
if p.tok.xkind <> pxSymbol then
lexMessage(p.lex, errIdentifierExpected, pasTokToStr(p.tok));
end;
procedure Eat(var p: TPasParser; xkind: TPasTokKind);
begin
if p.tok.xkind = xkind then getTok(p)
else lexMessage(p.lex, errTokenExpected, PasTokKindToStr[xkind])
end;
procedure Opt(var p: TPasParser; xkind: TPasTokKind);
begin
if p.tok.xkind = xkind then getTok(p)
end;
// ----------------------------------------------------------------------------
function newNodeP(kind: TNodeKind; const p: TPasParser): PNode;
begin
result := newNodeI(kind, getLineInfo(p.lex));
end;
function newIntNodeP(kind: TNodeKind; const intVal: BiggestInt;
const p: TPasParser): PNode;
begin
result := newNodeP(kind, p);
result.intVal := intVal;
end;
function newFloatNodeP(kind: TNodeKind; const floatVal: BiggestFloat;
const p: TPasParser): PNode;
begin
result := newNodeP(kind, p);
result.floatVal := floatVal;
end;
function newStrNodeP(kind: TNodeKind; const strVal: string;
const p: TPasParser): PNode;
begin
result := newNodeP(kind, p);
result.strVal := strVal;
end;
function newIdentNodeP(ident: PIdent; const p: TPasParser): PNode;
begin
result := newNodeP(nkIdent, p);
result.ident := ident;
end;
function createIdentNodeP(ident: PIdent; const p: TPasParser): PNode;
var
x: PIdent;
begin
result := newNodeP(nkIdent, p);
x := PIdent(IdTableGet(p.repl, ident));
if x <> nil then result.ident := x
else result.ident := ident;
end;
// ------------------- Expression parsing ------------------------------------
function parseExpr(var p: TPasParser): PNode; forward;
function parseStmt(var p: TPasParser): PNode; forward;
function parseTypeDesc(var p: TPasParser;
definition: PNode=nil): PNode; forward;
function parseEmit(var p: TPasParser; definition: PNode): PNode;
var
a: PNode;
begin
getTok(p); // skip 'emit'
result := nil;
if p.tok.xkind <> pxCurlyDirRi then
case p.context of
conExpr: result := parseExpr(p);
conStmt: begin
result := parseStmt(p);
if p.tok.xkind <> pxCurlyDirRi then begin
a := result;
result := newNodeP(nkStmtList, p);
addSon(result, a);
while p.tok.xkind <> pxCurlyDirRi do begin
addSon(result, parseStmt(p));
end
end
end;
conTypeDesc: result := parseTypeDesc(p, definition);
end;
eat(p, pxCurlyDirRi);
end;
function parseCommand(var p: TPasParser; definition: PNode=nil): PNode;
var
a: PNode;
begin
result := nil;
getTok(p);
if p.tok.ident.id = getIdent('discard').id then begin
result := newNodeP(nkDiscardStmt, p);
getTok(p); eat(p, pxCurlyDirRi);
addSon(result, parseExpr(p));
end
else if p.tok.ident.id = getIdent('set').id then begin
getTok(p); eat(p, pxCurlyDirRi);
result := parseExpr(p);
result.kind := nkCurly;
assert(sonsNotNil(result));
end
else if p.tok.ident.id = getIdent('cast').id then begin
getTok(p); eat(p, pxCurlyDirRi);
a := parseExpr(p);
if (a.kind = nkCall) and (sonsLen(a) = 2) then begin
result := newNodeP(nkCast, p);
addSon(result, a.sons[0]);
addSon(result, a.sons[1]);
end
else begin
parMessage(p, errInvalidDirectiveX, pasTokToStr(p.tok));
result := a
end
end
else if p.tok.ident.id = getIdent('emit').id then begin
result := parseEmit(p, definition);
end
else if p.tok.ident.id = getIdent('ignore').id then begin
getTok(p); eat(p, pxCurlyDirRi);
while true do begin
case p.tok.xkind of
pxEof: parMessage(p, errTokenExpected, '{@emit}');
pxCommand: begin
getTok(p);
if p.tok.ident.id = getIdent('emit').id then begin
result := parseEmit(p, definition);
break
end
else begin
while (p.tok.xkind <> pxCurlyDirRi) and (p.tok.xkind <> pxEof) do
getTok(p);
eat(p, pxCurlyDirRi);
end;
end;
else getTok(p) // skip token
end
end
end
else if p.tok.ident.id = getIdent('ptr').id then begin
result := newNodeP(nkPtrTy, p);
getTok(p); eat(p, pxCurlyDirRi);
end
else if p.tok.ident.id = getIdent('tuple').id then begin
result := newNodeP(nkTupleTy, p);
getTok(p); eat(p, pxCurlyDirRi);
end
else if p.tok.ident.id = getIdent('acyclic').id then begin
result := newIdentNodeP(p.tok.ident, p);
getTok(p); eat(p, pxCurlyDirRi);
end
else begin
parMessage(p, errInvalidDirectiveX, pasTokToStr(p.tok));
while true do begin
getTok(p);
if (p.tok.xkind = pxCurlyDirRi) or (p.tok.xkind = pxEof) then break;
end;
eat(p, pxCurlyDirRi);
result := nil
end;
end;
function getPrecedence(const kind: TPasTokKind): int;
begin
case kind of
pxDiv, pxMod, pxStar, pxSlash, pxShl, pxShr, pxAnd: result := 5; // highest
pxPlus, pxMinus, pxOr, pxXor: result := 4;
pxIn, pxEquals, pxLe, pxLt, pxGe, pxGt, pxNeq, pxIs: result := 3;
else result := -1;
end;
end;
function rangeExpr(var p: TPasParser): PNode;
var
a: PNode;
begin
a := parseExpr(p);
if p.tok.xkind = pxDotDot then begin
result := newNodeP(nkRange, p);
addSon(result, a);
getTok(p); skipCom(p, result);
addSon(result, parseExpr(p))
end
else result := a
end;
function bracketExprList(var p: TPasParser; first: PNode): PNode;
var
a: PNode;
begin
result := newNodeP(nkBracketExpr, p);
addSon(result, first);
getTok(p);
skipCom(p, result);
while true do begin
if p.tok.xkind = pxBracketRi then begin
getTok(p); break
end;
if p.tok.xkind = pxEof then begin
parMessage(p, errTokenExpected, PasTokKindToStr[pxBracketRi]); break
end;
a := rangeExpr(p);
skipCom(p, a);
if p.tok.xkind = pxComma then begin
getTok(p);
skipCom(p, a)
end;
addSon(result, a);
end;
end;
function exprColonEqExpr(var p: TPasParser; kind: TNodeKind;
tok: TPasTokKind): PNode;
var
a: PNode;
begin
a := parseExpr(p);
if p.tok.xkind = tok then begin
result := newNodeP(kind, p);
getTok(p);
skipCom(p, result);
addSon(result, a);
addSon(result, parseExpr(p));
end
else
result := a
end;
procedure exprListAux(var p: TPasParser; elemKind: TNodeKind;
endTok, sepTok: TPasTokKind; result: PNode);
var
a: PNode;
begin
getTok(p);
skipCom(p, result);
while true do begin
if p.tok.xkind = endTok then begin
getTok(p); break
end;
if p.tok.xkind = pxEof then begin
parMessage(p, errTokenExpected, PasTokKindToStr[endtok]); break
end;
a := exprColonEqExpr(p, elemKind, sepTok);
skipCom(p, a);
if (p.tok.xkind = pxComma) or (p.tok.xkind = pxSemicolon) then begin
getTok(p);
skipCom(p, a)
end;
addSon(result, a);
end;
end;
function qualifiedIdent(var p: TPasParser): PNode;
var
a: PNode;
begin
if p.tok.xkind = pxSymbol then
result := createIdentNodeP(p.tok.ident, p)
else begin
parMessage(p, errIdentifierExpected, pasTokToStr(p.tok));
result := nil;
exit
end;
getTok(p);
skipCom(p, result);
if p.tok.xkind = pxDot then begin
getTok(p);
skipCom(p, result);
if p.tok.xkind = pxSymbol then begin
a := result;
result := newNodeI(nkDotExpr, a.info);
addSon(result, a);
addSon(result, createIdentNodeP(p.tok.ident, p));
getTok(p);
end
else parMessage(p, errIdentifierExpected, pasTokToStr(p.tok))
end;
end;
procedure qualifiedIdentListAux(var p: TPasParser; endTok: TPasTokKind;
result: PNode);
var
a: PNode;
begin
getTok(p);
skipCom(p, result);
while true do begin
if p.tok.xkind = endTok then begin
getTok(p); break
end;
if p.tok.xkind = pxEof then begin
parMessage(p, errTokenExpected, PasTokKindToStr[endtok]); break
end;
a := qualifiedIdent(p);
skipCom(p, a);
if p.tok.xkind = pxComma then begin
getTok(p); skipCom(p, a)
end;
addSon(result, a);
end
end;
function exprColonEqExprList(var p: TPasParser; kind, elemKind: TNodeKind;
endTok, sepTok: TPasTokKind): PNode;
begin
result := newNodeP(kind, p);
exprListAux(p, elemKind, endTok, sepTok, result);
end;
procedure setBaseFlags(n: PNode; base: TNumericalBase);
begin
case base of
base10: begin end;
base2: include(n.flags, nfBase2);
base8: include(n.flags, nfBase8);
base16: include(n.flags, nfBase16);
end
end;
function identOrLiteral(var p: TPasParser): PNode;
var
a: PNode;
begin
case p.tok.xkind of
pxSymbol: begin
result := createIdentNodeP(p.tok.ident, p);
getTok(p)
end;
// literals
pxIntLit: begin
result := newIntNodeP(nkIntLit, p.tok.iNumber, p);
setBaseFlags(result, p.tok.base);
getTok(p);
end;
pxInt64Lit: begin
result := newIntNodeP(nkInt64Lit, p.tok.iNumber, p);
setBaseFlags(result, p.tok.base);
getTok(p);
end;
pxFloatLit: begin
result := newFloatNodeP(nkFloatLit, p.tok.fNumber, p);
setBaseFlags(result, p.tok.base);
getTok(p);
end;
pxStrLit: begin
if length(p.tok.literal) <> 1 then
result := newStrNodeP(nkStrLit, p.tok.literal, p)
else
result := newIntNodeP(nkCharLit, ord(p.tok.literal[strStart]), p);
getTok(p);
end;
pxNil: begin
result := newNodeP(nkNilLit, p);
getTok(p);
end;
pxParLe: begin // () constructor
result := exprColonEqExprList(p, nkPar, nkExprColonExpr, pxParRi,
pxColon);
//if hasSonWith(result, nkExprColonExpr) then
// replaceSons(result, nkExprColonExpr, nkExprEqExpr)
if (sonsLen(result) > 1) and not hasSonWith(result, nkExprColonExpr) then
result.kind := nkBracket; // is an array constructor
end;
pxBracketLe: begin // [] constructor
result := newNodeP(nkBracket, p);
getTok(p);
skipCom(p, result);
while (p.tok.xkind <> pxBracketRi) and (p.tok.xkind <> pxEof) do begin
a := rangeExpr(p);
if a.kind = nkRange then
result.kind := nkCurly; // it is definitely a set literal
opt(p, pxComma);
skipCom(p, a);
assert(a <> nil);
addSon(result, a);
end;
eat(p, pxBracketRi);
end;
pxCommand: result := parseCommand(p);
else begin
parMessage(p, errExprExpected, pasTokToStr(p.tok));
getTok(p); // we must consume a token here to prevend endless loops!
result := nil
end
end;
if result <> nil then
skipCom(p, result);
end;
function primary(var p: TPasParser): PNode;
var
a: PNode;
begin
// prefix operator?
if (p.tok.xkind = pxNot) or (p.tok.xkind = pxMinus)
or (p.tok.xkind = pxPlus) then begin
result := newNodeP(nkPrefix, p);
a := newIdentNodeP(getIdent(pasTokToStr(p.tok)), p);
addSon(result, a);
getTok(p);
skipCom(p, a);
addSon(result, primary(p));
exit
end
else if p.tok.xkind = pxAt then begin
result := newNodeP(nkAddr, p);
a := newIdentNodeP(getIdent(pasTokToStr(p.tok)), p);
getTok(p);
if p.tok.xkind = pxBracketLe then begin
result := newNodeP(nkPrefix, p);
addSon(result, a);
addSon(result, identOrLiteral(p));
end
else
addSon(result, primary(p));
exit
end;
result := identOrLiteral(p);
while true do begin
case p.tok.xkind of
pxParLe: begin
a := result;
result := newNodeP(nkCall, p);
addSon(result, a);
exprListAux(p, nkExprEqExpr, pxParRi, pxEquals, result);
end;
pxDot: begin
a := result;
result := newNodeP(nkDotExpr, p);
addSon(result, a);
getTok(p); // skip '.'
skipCom(p, result);
if p.tok.xkind = pxSymbol then begin
addSon(result, createIdentNodeP(p.tok.ident, p));
getTok(p);
end
else
parMessage(p, errIdentifierExpected, pasTokToStr(p.tok));
end;
pxHat: begin
a := result;
result := newNodeP(nkDerefExpr, p);
addSon(result, a);
getTok(p);
end;
pxBracketLe: result := bracketExprList(p, result);
else break
end
end
end;
function lowestExprAux(var p: TPasParser; out v: PNode;
limit: int): TPasTokKind;
var
op, nextop: TPasTokKind;
opPred: int;
v2, node, opNode: PNode;
begin
v := primary(p);
// expand while operators have priorities higher than 'limit'
op := p.tok.xkind;
opPred := getPrecedence(op);
while (opPred > limit) do begin
node := newNodeP(nkInfix, p);
opNode := newIdentNodeP(getIdent(pasTokToStr(p.tok)), p);
// skip operator:
getTok(p);
case op of
pxPlus: begin
case p.tok.xkind of
pxPer: begin getTok(p); eat(p, pxCurlyDirRi);
opNode.ident := getIdent('+%') end;
pxAmp: begin getTok(p); eat(p, pxCurlyDirRi);
opNode.ident := getIdent('&'+'') end;
else begin end
end
end;
pxMinus: begin
if p.tok.xkind = pxPer then begin
getTok(p); eat(p, pxCurlyDirRi);
opNode.ident := getIdent('-%')
end;
end;
pxEquals: opNode.ident := getIdent('==');
pxNeq: opNode.ident := getIdent('!=');
else begin end
end;
skipCom(p, opNode);
// read sub-expression with higher priority
nextop := lowestExprAux(p, v2, opPred);
addSon(node, opNode);
addSon(node, v);
addSon(node, v2);
v := node;
op := nextop;
opPred := getPrecedence(nextop);
end;
result := op; // return first untreated operator
end;
function fixExpr(n: PNode): PNode;
var
i: int;
begin
result := n;
if n = nil then exit;
case n.kind of
nkInfix: begin
if n.sons[1].kind = nkBracket then // binary expression with [] is a set
n.sons[1].kind := nkCurly;
if n.sons[2].kind = nkBracket then // binary expression with [] is a set
n.sons[2].kind := nkCurly;
if (n.sons[0].kind = nkIdent) then begin
if (n.sons[0].ident.id = getIdent('+'+'').id) then begin
if (n.sons[1].kind = nkCharLit)
and (n.sons[2].kind = nkStrLit) and (n.sons[2].strVal = '') then
begin
result := newStrNode(nkStrLit, chr(int(n.sons[1].intVal))+'');
result.info := n.info;
exit; // do not process sons as they don't exist anymore
end
else if (n.sons[1].kind in [nkCharLit, nkStrLit])
or (n.sons[2].kind in [nkCharLit, nkStrLit]) then begin
n.sons[0].ident := getIdent('&'+''); // fix operator
end
end
end
end
else begin end
end;
if not (n.kind in [nkEmpty..nkNilLit]) then
for i := 0 to sonsLen(n)-1 do
result.sons[i] := fixExpr(n.sons[i])
end;
function parseExpr(var p: TPasParser): PNode;
var
oldcontext: TPasContext;
begin
oldcontext := p.context;
p.context := conExpr;
if p.tok.xkind = pxCommand then begin
result := parseCommand(p)
end
else begin
{@discard} lowestExprAux(p, result, -1);
result := fixExpr(result)
end;
//if result = nil then
// internalError(parLineInfo(p), 'parseExpr() returned nil');
p.context := oldcontext;
end;
// ---------------------- statement parser ------------------------------------
function parseExprStmt(var p: TPasParser): PNode;
var
a, b: PNode;
info: TLineInfo;
begin
info := parLineInfo(p);
a := parseExpr(p);
if p.tok.xkind = pxAsgn then begin
getTok(p);
skipCom(p, a);
b := parseExpr(p);
result := newNodeI(nkAsgn, info);
addSon(result, a);
addSon(result, b);
end
else
result := a
end;
function inImportBlackList(ident: PIdent): bool;
var
i: int;
begin
for i := low(ImportBlackList) to high(ImportBlackList) do
if ident.id = getIdent(ImportBlackList[i]).id then begin
result := true; exit
end;
result := false
end;
function parseUsesStmt(var p: TPasParser): PNode;
var
a: PNode;
begin
result := newNodeP(nkImportStmt, p);
getTok(p); // skip `import`
skipCom(p, result);
while true do begin
case p.tok.xkind of
pxEof: break;
pxSymbol: a := newIdentNodeP(p.tok.ident, p);
else begin
parMessage(p, errIdentifierExpected, pasTokToStr(p.tok));
break
end;
end;
getTok(p); // skip identifier, string
skipCom(p, a);
if (gCmd <> cmdBoot) or not inImportBlackList(a.ident) then
addSon(result, createIdentNodeP(a.ident, p));
if p.tok.xkind = pxComma then begin
getTok(p);
skipCom(p, a)
end
else break
end;
if sonsLen(result) = 0 then result := nil;
end;
function parseIncludeDir(var p: TPasParser): PNode;
var
filename: string;
begin
result := newNodeP(nkIncludeStmt, p);
getTok(p); // skip `include`
filename := '';
while true do begin
case p.tok.xkind of
pxSymbol, pxDot, pxDotDot, pxSlash: begin
filename := filename +{&} pasTokToStr(p.tok);
getTok(p);
end;
pxStrLit: begin
filename := p.tok.literal;
getTok(p);
break
end;
pxCurlyDirRi: break;
else begin
parMessage(p, errIdentifierExpected, pasTokToStr(p.tok));
break
end;
end;
end;
addSon(result, newStrNodeP(nkStrLit, changeFileExt(filename, 'nim'), p));
if filename = 'config.inc' then result := nil;
end;
function definedExprAux(var p: TPasParser): PNode;
begin
result := newNodeP(nkCall, p);
addSon(result, newIdentNodeP(getIdent('defined'), p));
ExpectIdent(p);
addSon(result, createIdentNodeP(p.tok.ident, p));
getTok(p);
end;
function isHandledDirective(const p: TPasParser): bool;
begin
result := false;
if p.tok.xkind in [pxCurlyDirLe, pxStarDirLe] then
case whichKeyword(p.tok.ident) of
wElse, wEndif: result := false
else result := true
end
end;
function parseStmtList(var p: TPasParser): PNode;
begin
result := newNodeP(nkStmtList, p);
while true do begin
case p.tok.xkind of
pxEof: break;
pxCurlyDirLe, pxStarDirLe: begin
if not isHandledDirective(p) then break;
end
else begin end
end;
addSon(result, parseStmt(p))
end;
if sonsLen(result) = 1 then result := result.sons[0];
end;
procedure parseIfDirAux(var p: TPasParser; result: PNode);
var
s: PNode;
endMarker: TPasTokKind;
begin
addSon(result.sons[0], parseStmtList(p));
if p.tok.xkind in [pxCurlyDirLe, pxStarDirLe] then begin
endMarker := succ(p.tok.xkind);
if whichKeyword(p.tok.ident) = wElse then begin
s := newNodeP(nkElse, p);
while (p.tok.xkind <> pxEof) and (p.tok.xkind <> endMarker) do getTok(p);
eat(p, endMarker);
addSon(s, parseStmtList(p));
addSon(result, s);
end;
if p.tok.xkind in [pxCurlyDirLe, pxStarDirLe] then begin
endMarker := succ(p.tok.xkind);
if whichKeyword(p.tok.ident) = wEndif then begin
while (p.tok.xkind <> pxEof) and (p.tok.xkind <> endMarker) do getTok(p);
eat(p, endMarker);
end
else parMessage(p, errXExpected, '{$endif}');
end
end
else
parMessage(p, errXExpected, '{$endif}');
end;
function parseIfdefDir(var p: TPasParser; endMarker: TPasTokKind): PNode;
begin
result := newNodeP(nkWhenStmt, p);
addSon(result, newNodeP(nkElifBranch, p));
getTok(p);
addSon(result.sons[0], definedExprAux(p));
eat(p, endMarker);
parseIfDirAux(p, result);
end;
function parseIfndefDir(var p: TPasParser; endMarker: TPasTokKind): PNode;
var
e: PNode;
begin
result := newNodeP(nkWhenStmt, p);
addSon(result, newNodeP(nkElifBranch, p));
getTok(p);
e := newNodeP(nkCall, p);
addSon(e, newIdentNodeP(getIdent('not'), p));
addSon(e, definedExprAux(p));
eat(p, endMarker);
addSon(result.sons[0], e);
parseIfDirAux(p, result);
end;
function parseIfDir(var p: TPasParser; endMarker: TPasTokKind): PNode;
begin
result := newNodeP(nkWhenStmt, p);
addSon(result, newNodeP(nkElifBranch, p));
getTok(p);
addSon(result.sons[0], parseExpr(p));
eat(p, endMarker);
parseIfDirAux(p, result);
end;
function parseDirective(var p: TPasParser): PNode;
var
endMarker: TPasTokKind;
begin
result := nil;
if not (p.tok.xkind in [pxCurlyDirLe, pxStarDirLe]) then exit;
endMarker := succ(p.tok.xkind);
if p.tok.ident <> nil then
case whichKeyword(p.tok.ident) of
wInclude: begin
result := parseIncludeDir(p);
eat(p, endMarker);
end;
wIf: result := parseIfDir(p, endMarker);
wIfdef: result := parseIfdefDir(p, endMarker);
wIfndef: result := parseIfndefDir(p, endMarker);
else begin
// skip unknown compiler directive
while (p.tok.xkind <> pxEof) and (p.tok.xkind <> endMarker) do
getTok(p);
eat(p, endMarker);
end
end
else eat(p, endMarker);
end;
function parseRaise(var p: TPasParser): PNode;
begin
result := newNodeP(nkRaiseStmt, p);
getTok(p);
skipCom(p, result);
if p.tok.xkind <> pxSemicolon then addSon(result, parseExpr(p))
else addSon(result, nil);
end;
function parseIf(var p: TPasParser): PNode;
var
branch: PNode;
begin
result := newNodeP(nkIfStmt, p);
while true do begin
getTok(p); // skip ``if``
branch := newNodeP(nkElifBranch, p);
skipCom(p, branch);
addSon(branch, parseExpr(p));
eat(p, pxThen);
skipCom(p, branch);
addSon(branch, parseStmt(p));
skipCom(p, branch);
addSon(result, branch);
if p.tok.xkind = pxElse then begin
getTok(p);
if p.tok.xkind <> pxIf then begin
// ordinary else part:
branch := newNodeP(nkElse, p);
skipCom(p, result); // BUGFIX
addSon(branch, parseStmt(p));
addSon(result, branch);
break
end
// else: next iteration
end
else break
end
end;
function parseWhile(var p: TPasParser): PNode;
begin
result := newNodeP(nkWhileStmt, p);
getTok(p);
skipCom(p, result);
addSon(result, parseExpr(p));
eat(p, pxDo);
skipCom(p, result);
addSon(result, parseStmt(p));
end;
function parseRepeat(var p: TPasParser): PNode;
var
a, b, c, s: PNode;
begin
result := newNodeP(nkWhileStmt, p);
getTok(p);
skipCom(p, result);
addSon(result, newIdentNodeP(getIdent('true'), p));
s := newNodeP(nkStmtList, p);
while (p.tok.xkind <> pxEof) and (p.tok.xkind <> pxUntil) do begin
addSon(s, parseStmt(p))
end;
eat(p, pxUntil);
a := newNodeP(nkIfStmt, p);
skipCom(p, a);
b := newNodeP(nkElifBranch, p);
c := newNodeP(nkBreakStmt, p);
addSon(c, nil);
addSon(b, parseExpr(p));
skipCom(p, a);
addSon(b, c);
addSon(a, b);
if (b.sons[0].kind = nkIdent) and (b.sons[0].ident.id = getIdent('false').id)
then begin end // do not add an ``if false: break`` statement
else addSon(s, a);
addSon(result, s);
end;
function parseCase(var p: TPasParser): PNode;
var
b: PNode;
begin
result := newNodeP(nkCaseStmt, p);
getTok(p);
addSon(result, parseExpr(p));
eat(p, pxOf);
skipCom(p, result);
while (p.tok.xkind <> pxEnd) and (p.tok.xkind <> pxEof) do begin
if p.tok.xkind = pxElse then begin
b := newNodeP(nkElse, p);
getTok(p);
end
else begin
b := newNodeP(nkOfBranch, p);
while (p.tok.xkind <> pxEof) and (p.tok.xkind <> pxColon) do begin
addSon(b, rangeExpr(p));
opt(p, pxComma);
skipcom(p, b);
end;
eat(p, pxColon);
end;
skipCom(p, b);
addSon(b, parseStmt(p));
addSon(result, b);
if b.kind = nkElse then break;
end;
eat(p, pxEnd);
end;
function parseTry(var p: TPasParser): PNode;
var
b, e: PNode;
begin
result := newNodeP(nkTryStmt, p);
getTok(p);
skipCom(p, result);
b := newNodeP(nkStmtList, p);
while not (p.tok.xkind in [pxFinally, pxExcept, pxEof, pxEnd]) do
addSon(b, parseStmt(p));
addSon(result, b);
if p.tok.xkind = pxExcept then begin
getTok(p);
while p.tok.ident.id = getIdent('on').id do begin
b := newNodeP(nkExceptBranch, p);
getTok(p);
e := qualifiedIdent(p);
if p.tok.xkind = pxColon then begin
getTok(p);
e := qualifiedIdent(p);
end;
addSon(b, e);
eat(p, pxDo);
addSon(b, parseStmt(p));
addSon(result, b);
if p.tok.xkind = pxCommand then {@discard} parseCommand(p);
end;
if p.tok.xkind = pxElse then begin
b := newNodeP(nkExceptBranch, p);
getTok(p);
addSon(b, parseStmt(p));
addSon(result, b);
end
end;
if p.tok.xkind = pxFinally then begin
b := newNodeP(nkFinally, p);
getTok(p);
e := newNodeP(nkStmtList, p);
while (p.tok.xkind <> pxEof) and (p.tok.xkind <> pxEnd) do begin
addSon(e, parseStmt(p))
end;
if sonsLen(e) = 0 then
addSon(e, newNodeP(nkNilLit, p));
addSon(result, e);
end;
eat(p, pxEnd);
end;
function parseFor(var p: TPasParser): PNode;
var
a, b, c: PNode;
begin
result := newNodeP(nkForStmt, p);
getTok(p);
skipCom(p, result);
expectIdent(p);
addSon(result, createIdentNodeP(p.tok.ident, p));
getTok(p);
eat(p, pxAsgn);
a := parseExpr(p);
b := nil;
c := newNodeP(nkCall, p);
if p.tok.xkind = pxTo then begin
addSon(c, newIdentNodeP(getIdent('countup'), p));
getTok(p);
b := parseExpr(p);
end
else if p.tok.xkind = pxDownto then begin
addSon(c, newIdentNodeP(getIdent('countdown'), p));
getTok(p);
b := parseExpr(p);
end
else
parMessage(p, errTokenExpected, PasTokKindToStr[pxTo]);
addSon(c, a);
addSon(c, b);
eat(p, pxDo);
skipCom(p, result);
addSon(result, c);
addSon(result, parseStmt(p))
end;
function parseParam(var p: TPasParser): PNode;
var
a, v: PNode;
begin
result := newNodeP(nkIdentDefs, p);
v := nil;
case p.tok.xkind of
pxConst: getTok(p);
pxVar: begin getTok(p); v := newNodeP(nkVarTy, p); end;
pxOut: begin getTok(p); v := newNodeP(nkVarTy, p); end;
else begin end
end;
while true do begin
case p.tok.xkind of
pxSymbol: a := createIdentNodeP(p.tok.ident, p);
pxColon, pxEof, pxParRi, pxEquals: break;
else begin
parMessage(p, errIdentifierExpected, pasTokToStr(p.tok));
exit;
end;
end;
getTok(p); // skip identifier
skipCom(p, a);
if p.tok.xkind = pxComma then begin
getTok(p); skipCom(p, a)
end;
addSon(result, a);
end;
if p.tok.xkind = pxColon then begin
getTok(p); skipCom(p, result);
if v <> nil then addSon(v, parseTypeDesc(p))
else v := parseTypeDesc(p);
addSon(result, v);
end
else begin
addSon(result, nil);
if p.tok.xkind <> pxEquals then
parMessage(p, errColonOrEqualsExpected, pasTokToStr(p.tok))
end;
if p.tok.xkind = pxEquals then begin
getTok(p); skipCom(p, result);
addSon(result, parseExpr(p));
end
else
addSon(result, nil);
end;
function parseParamList(var p: TPasParser): PNode;
var
a: PNode;
begin
result := newNodeP(nkFormalParams, p);
addSon(result, nil); // return type
if p.tok.xkind = pxParLe then begin
p.inParamList := true;
getTok(p);
skipCom(p, result);
while true do begin
case p.tok.xkind of
pxSymbol, pxConst, pxVar, pxOut: a := parseParam(p);
pxParRi: begin getTok(p); break end;
else begin parMessage(p, errTokenExpected, ')'+''); break; end;
end;
skipCom(p, a);
if p.tok.xkind = pxSemicolon then begin
getTok(p); skipCom(p, a)
end;
addSon(result, a)
end;
p.inParamList := false
end;
if p.tok.xkind = pxColon then begin
getTok(p);
skipCom(p, result);
result.sons[0] := parseTypeDesc(p)
end
end;
function parseCallingConvention(var p: TPasParser): PNode;
begin
result := nil;
if p.tok.xkind = pxSymbol then begin
case whichKeyword(p.tok.ident) of
wStdcall, wCDecl, wSafeCall, wSysCall, wInline, wFastCall: begin
result := newNodeP(nkPragma, p);
addSon(result, newIdentNodeP(p.tok.ident, p));
getTok(p);
opt(p, pxSemicolon);
end;
wRegister: begin
result := newNodeP(nkPragma, p);
addSon(result, newIdentNodeP(getIdent('fastcall'), p));
getTok(p);
opt(p, pxSemicolon);
end
else begin end
end
end
end;
function parseRoutineSpecifiers(var p: TPasParser; out noBody: boolean): PNode;
var
e: PNode;
begin
result := parseCallingConvention(p);
noBody := false;
while p.tok.xkind = pxSymbol do begin
case whichKeyword(p.tok.ident) of
wAssembler, wOverload, wFar: begin
getTok(p); opt(p, pxSemicolon);
end;
wForward: begin
noBody := true;
getTok(p); opt(p, pxSemicolon);
end;
wImportc: begin
// This is a fake for platform module. There is no ``importc``
// directive in Pascal.
if result = nil then result := newNodeP(nkPragma, p);
addSon(result, newIdentNodeP(getIdent('importc'), p));
noBody := true;
getTok(p); opt(p, pxSemicolon);
end;
wNoConv: begin
// This is a fake for platform module. There is no ``noconv``
// directive in Pascal.
if result = nil then result := newNodeP(nkPragma, p);
addSon(result, newIdentNodeP(getIdent('noconv'), p));
noBody := true;
getTok(p); opt(p, pxSemicolon);
end;
wProcVar: begin
// This is a fake for the Nimrod compiler. There is no ``procvar``
// directive in Pascal.
if result = nil then result := newNodeP(nkPragma, p);
addSon(result, newIdentNodeP(getIdent('procvar'), p));
getTok(p); opt(p, pxSemicolon);
end;
wVarargs: begin
if result = nil then result := newNodeP(nkPragma, p);
addSon(result, newIdentNodeP(getIdent('varargs'), p));
getTok(p); opt(p, pxSemicolon);
end;
wExternal: begin
if result = nil then result := newNodeP(nkPragma, p);
getTok(p);
noBody := true;
e := newNodeP(nkExprColonExpr, p);
addSon(e, newIdentNodeP(getIdent('dynlib'), p));
addSon(e, parseExpr(p));
addSon(result, e);
opt(p, pxSemicolon);
if (p.tok.xkind = pxSymbol)
and (p.tok.ident.id = getIdent('name').id) then begin
e := newNodeP(nkExprColonExpr, p);
getTok(p);
addSon(e, newIdentNodeP(getIdent('importc'), p));
addSon(e, parseExpr(p));
addSon(result, e);
end
else
addSon(result, newIdentNodeP(getIdent('importc'), p));
opt(p, pxSemicolon);
end
else begin
e := parseCallingConvention(p);
if e = nil then break;
if result = nil then result := newNodeP(nkPragma, p);
addSon(result, e.sons[0]);
end;
end
end
end;
function parseRoutineType(var p: TPasParser): PNode;
begin
result := newNodeP(nkProcTy, p);
getTok(p); skipCom(p, result);
addSon(result, parseParamList(p));
opt(p, pxSemicolon);
addSon(result, parseCallingConvention(p));
skipCom(p, result);
end;
function parseEnum(var p: TPasParser): PNode;
var
a, b: PNode;
begin
result := newNodeP(nkEnumTy, p);
getTok(p);
skipCom(p, result);
addSon(result, nil); // it does not inherit from any enumeration
while true do begin
case p.tok.xkind of
pxEof, pxParRi: break;
pxSymbol: a := newIdentNodeP(p.tok.ident, p);
else begin
parMessage(p, errIdentifierExpected, pasTokToStr(p.tok));
break
end;
end;
getTok(p); // skip identifier
skipCom(p, a);
if (p.tok.xkind = pxEquals) or (p.tok.xkind = pxAsgn) then begin
getTok(p);
skipCom(p, a);
b := a;
a := newNodeP(nkEnumFieldDef, p);
addSon(a, b);
addSon(a, parseExpr(p));
end;
if p.tok.xkind = pxComma then begin
getTok(p); skipCom(p, a)
end;
addSon(result, a);
end;
eat(p, pxParRi)
end;
function identVis(var p: TPasParser): PNode; // identifier with visability
var
a: PNode;
begin
a := createIdentNodeP(p.tok.ident, p);
if p.section = seInterface then begin
result := newNodeP(nkPostfix, p);
addSon(result, newIdentNodeP(getIdent('*'+''), p));
addSon(result, a);
end
else
result := a;
getTok(p)
end;
type
TSymbolParser = function (var p: TPasParser): PNode;
function rawIdent(var p: TPasParser): PNode;
begin
result := createIdentNodeP(p.tok.ident, p);
getTok(p);
end;
function parseIdentColonEquals(var p: TPasParser;
identParser: TSymbolParser): PNode;
var
a: PNode;
begin
result := newNodeP(nkIdentDefs, p);
while true do begin
case p.tok.xkind of
pxSymbol: a := identParser(p);
pxColon, pxEof, pxParRi, pxEquals: break;
else begin
parMessage(p, errIdentifierExpected, pasTokToStr(p.tok));
exit;
end;
end;
skipCom(p, a);
if p.tok.xkind = pxComma then begin
getTok(p);
skipCom(p, a)
end;
addSon(result, a);
end;
if p.tok.xkind = pxColon then begin
getTok(p); skipCom(p, result);
addSon(result, parseTypeDesc(p));
end
else begin
addSon(result, nil);
if p.tok.xkind <> pxEquals then
parMessage(p, errColonOrEqualsExpected, pasTokToStr(p.tok))
end;
if p.tok.xkind = pxEquals then begin
getTok(p); skipCom(p, result);
addSon(result, parseExpr(p));
end
else
addSon(result, nil);
if p.tok.xkind = pxSemicolon then begin
getTok(p); skipCom(p, result);
end
end;
function parseRecordCase(var p: TPasParser): PNode;
var
a, b, c: PNode;
begin
result := newNodeP(nkRecCase, p);
getTok(p);
a := newNodeP(nkIdentDefs, p);
addSon(a, rawIdent(p));
eat(p, pxColon);
addSon(a, parseTypeDesc(p));
addSon(a, nil);
addSon(result, a);
eat(p, pxOf);
skipCom(p, result);
while true do begin
case p.tok.xkind of
pxEof, pxEnd: break;
pxElse: begin
b := newNodeP(nkElse, p);
getTok(p);
end;
else begin
b := newNodeP(nkOfBranch, p);
while (p.tok.xkind <> pxEof) and (p.tok.xkind <> pxColon) do begin
addSon(b, rangeExpr(p));
opt(p, pxComma);
skipcom(p, b);
end;
eat(p, pxColon);
end
end;
skipCom(p, b);
c := newNodeP(nkRecList, p);
eat(p, pxParLe);
while (p.tok.xkind <> pxParRi) and (p.tok.xkind <> pxEof) do begin
addSon(c, parseIdentColonEquals(p, rawIdent));
opt(p, pxSemicolon);
skipCom(p, lastSon(c));
end;
eat(p, pxParRi);
opt(p, pxSemicolon);
if sonsLen(c) > 0 then skipCom(p, lastSon(c))
else addSon(c, newNodeP(nkNilLit, p));
addSon(b, c);
addSon(result, b);
if b.kind = nkElse then break;
end
end;
function parseRecordPart(var p: TPasParser): PNode;
begin
result := nil;
while (p.tok.xkind <> pxEof) and (p.tok.xkind <> pxEnd) do begin
if result = nil then result := newNodeP(nkRecList, p);
case p.tok.xkind of
pxSymbol: begin
addSon(result, parseIdentColonEquals(p, rawIdent));
opt(p, pxSemicolon);
skipCom(p, lastSon(result));
end;
pxCase: begin
addSon(result, parseRecordCase(p));
end;
pxComment: skipCom(p, lastSon(result));
else begin
parMessage(p, errIdentifierExpected, pasTokToStr(p.tok));
break
end
end
end
end;
procedure exSymbol(var n: PNode);
var
a: PNode;
begin
case n.kind of
nkPostfix: begin end; // already an export marker
nkPragmaExpr: exSymbol(n.sons[0]);
nkIdent, nkAccQuoted: begin
a := newNodeI(nkPostFix, n.info);
addSon(a, newIdentNode(getIdent('*'+''), n.info));
addSon(a, n);
n := a
end;
else internalError(n.info, 'exSymbol(): ' + nodekindtostr[n.kind]);
end
end;
procedure fixRecordDef(var n: PNode);
var
i, len: int;
begin
if n = nil then exit;
case n.kind of
nkRecCase: begin
fixRecordDef(n.sons[0]);
for i := 1 to sonsLen(n)-1 do begin
len := sonsLen(n.sons[i]);
fixRecordDef(n.sons[i].sons[len-1])
end
end;
nkRecList, nkRecWhen, nkElse, nkOfBranch, nkElifBranch,
nkObjectTy: begin
for i := 0 to sonsLen(n)-1 do fixRecordDef(n.sons[i])
end;
nkIdentDefs: begin
for i := 0 to sonsLen(n)-3 do exSymbol(n.sons[i])
end;
nkNilLit: begin end;
//nkIdent: exSymbol(n);
else internalError(n.info, 'fixRecordDef(): ' + nodekindtostr[n.kind]);
end
end;
procedure addPragmaToIdent(var ident: PNode; pragma: PNode);
var
e, pragmasNode: PNode;
begin
if ident.kind <> nkPragmaExpr then begin
pragmasNode := newNodeI(nkPragma, ident.info);
e := newNodeI(nkPragmaExpr, ident.info);
addSon(e, ident);
addSon(e, pragmasNode);
ident := e;
end
else begin
pragmasNode := ident.sons[1];
if pragmasNode.kind <> nkPragma then
InternalError(ident.info, 'addPragmaToIdent');
end;
addSon(pragmasNode, pragma);
end;
procedure parseRecordBody(var p: TPasParser; result, definition: PNode);
var
a: PNode;
begin
skipCom(p, result);
a := parseRecordPart(p);
if result.kind <> nkTupleTy then fixRecordDef(a);
addSon(result, a);
eat(p, pxEnd);
case p.tok.xkind of
pxSymbol: begin
if (p.tok.ident.id = getIdent('acyclic').id) then begin
if definition <> nil then
addPragmaToIdent(definition.sons[0], newIdentNodeP(p.tok.ident, p))
else
InternalError(result.info, 'anonymous record is not supported');
getTok(p);
end
else
InternalError(result.info, 'parseRecordBody');
end;
pxCommand: begin
if definition <> nil then
addPragmaToIdent(definition.sons[0], parseCommand(p))
else
InternalError(result.info, 'anonymous record is not supported');
end;
else begin end
end;
opt(p, pxSemicolon);
skipCom(p, result);
end;
function parseRecordOrObject(var p: TPasParser; kind: TNodeKind;
definition: PNode): PNode;
var
a: PNode;
begin
result := newNodeP(kind, p);
getTok(p);
addSon(result, nil);
if p.tok.xkind = pxParLe then begin
a := newNodeP(nkOfInherit, p);
getTok(p);
addSon(a, parseTypeDesc(p));
addSon(result, a);
eat(p, pxParRi);
end
else addSon(result, nil);
parseRecordBody(p, result, definition);
end;
function parseTypeDesc(var p: TPasParser; definition: PNode=nil): PNode;
var
oldcontext: TPasContext;
a, r: PNode;
i: int;
begin
oldcontext := p.context;
p.context := conTypeDesc;
if p.tok.xkind = pxPacked then getTok(p);
case p.tok.xkind of
pxCommand: result := parseCommand(p, definition);
pxProcedure, pxFunction: result := parseRoutineType(p);
pxRecord: begin
getTok(p);
if p.tok.xkind = pxCommand then begin
result := parseCommand(p);
if result.kind <> nkTupleTy then
InternalError(result.info, 'parseTypeDesc');
parseRecordBody(p, result, definition);
a := lastSon(result);
// embed nkRecList directly into nkTupleTy
for i := 0 to sonsLen(a)-1 do
if i = 0 then result.sons[sonsLen(result)-1] := a.sons[0]
else addSon(result, a.sons[i]);
end
else begin
result := newNodeP(nkObjectTy, p);
addSon(result, nil);
addSon(result, nil);
parseRecordBody(p, result, definition);
if definition <> nil then
addPragmaToIdent(definition.sons[0],
newIdentNodeP(getIdent('final'), p))
else
InternalError(result.info, 'anonymous record is not supported');
end;
end;
pxObject: result := parseRecordOrObject(p, nkObjectTy, definition);
pxParLe: result := parseEnum(p);
pxArray: begin
result := newNodeP(nkBracketExpr, p);
getTok(p);
if p.tok.xkind = pxBracketLe then begin
addSon(result, newIdentNodeP(getIdent('array'), p));
getTok(p);
addSon(result, rangeExpr(p));
eat(p, pxBracketRi);
end
else begin
if p.inParamList then
addSon(result, newIdentNodeP(getIdent('openarray'), p))
else
addSon(result, newIdentNodeP(getIdent('seq'), p));
end;
eat(p, pxOf);
addSon(result, parseTypeDesc(p));
end;
pxSet: begin
result := newNodeP(nkBracketExpr, p);
getTok(p);
eat(p, pxOf);
addSon(result, newIdentNodeP(getIdent('set'), p));
addSon(result, parseTypeDesc(p));
end;
pxHat: begin
getTok(p);
if p.tok.xkind = pxCommand then
result := parseCommand(p)
else if gCmd = cmdBoot then
result := newNodeP(nkRefTy, p)
else
result := newNodeP(nkPtrTy, p);
addSon(result, parseTypeDesc(p))
end;
pxType: begin
getTok(p);
result := parseTypeDesc(p);
end;
else begin
a := primary(p);
if p.tok.xkind = pxDotDot then begin
result := newNodeP(nkBracketExpr, p);
r := newNodeP(nkRange, p);
addSon(result, newIdentNodeP(getIdent('range'), p));
getTok(p);
addSon(r, a);
addSon(r, parseExpr(p));
addSon(result, r);
end
else
result := a
end
end;
p.context := oldcontext;
end;
function parseTypeDef(var p: TPasParser): PNode;
var
a: PNode;
begin
result := newNodeP(nkTypeDef, p);
addSon(result, identVis(p));
addSon(result, nil); // generic params
if p.tok.xkind = pxEquals then begin
getTok(p); skipCom(p, result);
a := parseTypeDesc(p, result);
addSon(result, a);
end
else
addSon(result, nil);
if p.tok.xkind = pxSemicolon then begin
getTok(p); skipCom(p, result);
end;
end;
function parseTypeSection(var p: TPasParser): PNode;
begin
result := newNodeP(nkTypeSection, p);
getTok(p);
skipCom(p, result);
while p.tok.xkind = pxSymbol do begin
addSon(result, parseTypeDef(p))
end
end;
function parseConstant(var p: TPasParser): PNode;
begin
result := newNodeP(nkConstDef, p);
addSon(result, identVis(p));
if p.tok.xkind = pxColon then begin
getTok(p); skipCom(p, result);
addSon(result, parseTypeDesc(p));
end
else begin
addSon(result, nil);
if p.tok.xkind <> pxEquals then
parMessage(p, errColonOrEqualsExpected, pasTokToStr(p.tok));
end;
if p.tok.xkind = pxEquals then begin
getTok(p); skipCom(p, result);
addSon(result, parseExpr(p));
end
else
addSon(result, nil);
if p.tok.xkind = pxSemicolon then begin
getTok(p); skipCom(p, result);
end;
end;
function parseConstSection(var p: TPasParser): PNode;
begin
result := newNodeP(nkConstSection, p);
getTok(p);
skipCom(p, result);
while p.tok.xkind = pxSymbol do begin
addSon(result, parseConstant(p))
end
end;
function parseVar(var p: TPasParser): PNode;
begin
result := newNodeP(nkVarSection, p);
getTok(p);
skipCom(p, result);
while p.tok.xkind = pxSymbol do begin
addSon(result, parseIdentColonEquals(p, identVis));
end;
p.lastVarSection := result
end;
function parseRoutine(var p: TPasParser): PNode;
var
a, stmts: PNode;
noBody: boolean;
i: int;
begin
result := newNodeP(nkProcDef, p);
getTok(p);
skipCom(p, result);
expectIdent(p);
addSon(result, identVis(p));
addSon(result, nil); // generic parameters
addSon(result, parseParamList(p));
opt(p, pxSemicolon);
addSon(result, parseRoutineSpecifiers(p, noBody));
if (p.section = seInterface) or noBody then
addSon(result, nil)
else begin
stmts := newNodeP(nkStmtList, p);
while true do begin
case p.tok.xkind of
pxVar: addSon(stmts, parseVar(p));
pxConst: addSon(stmts, parseConstSection(p));
pxType: addSon(stmts, parseTypeSection(p));
pxComment: skipCom(p, result);
pxBegin: break;
else begin
parMessage(p, errTokenExpected, 'begin');
break
end
end
end;
a := parseStmt(p);
for i := 0 to sonsLen(a)-1 do addSon(stmts, a.sons[i]);
addSon(result, stmts);
end
end;
function fixExit(var p: TPasParser; n: PNode): boolean;
var
len: int;
a: PNode;
begin
result := false;
if (p.tok.ident.id = getIdent('exit').id) then begin
len := sonsLen(n);
if (len <= 0) then exit;
a := n.sons[len-1];
if (a.kind = nkAsgn)
and (a.sons[0].kind = nkIdent)
and (a.sons[0].ident.id = getIdent('result').id) then begin
delSon(a, 0);
a.kind := nkReturnStmt;
result := true;
getTok(p); opt(p, pxSemicolon);
skipCom(p, a);
end
end
end;
procedure fixVarSection(var p: TPasParser; counter: PNode);
var
i, j: int;
v: PNode;
begin
if p.lastVarSection = nil then exit;
assert(counter.kind = nkIdent);
for i := 0 to sonsLen(p.lastVarSection)-1 do begin
v := p.lastVarSection.sons[i];
for j := 0 to sonsLen(v)-3 do begin
if v.sons[j].ident.id = counter.ident.id then begin
delSon(v, j);
if sonsLen(v) <= 2 then // : type = int remains --> delete it
delSon(p.lastVarSection, i);
exit
end
end
end
end;
procedure parseBegin(var p: TPasParser; result: PNode);
begin
getTok(p);
while true do begin
case p.tok.xkind of
pxComment: addSon(result, parseStmt(p));
pxSymbol: begin
if not fixExit(p, result) then addSon(result, parseStmt(p))
end;
pxEnd: begin getTok(p); break end;
pxSemicolon: begin getTok(p); end;
pxEof: parMessage(p, errExprExpected);
else addSonIfNotNil(result, parseStmt(p));
end
end;
if sonsLen(result) = 0 then
addSon(result, newNodeP(nkNilLit, p));
end;
function parseStmt(var p: TPasParser): PNode;
var
oldcontext: TPasContext;
begin
oldcontext := p.context;
p.context := conStmt;
result := nil;
case p.tok.xkind of
pxBegin: begin
result := newNodeP(nkStmtList, p);
parseBegin(p, result);
end;
pxCommand: result := parseCommand(p);
pxCurlyDirLe, pxStarDirLe: begin
if isHandledDirective(p) then
result := parseDirective(p);
end;
pxIf: result := parseIf(p);
pxWhile: result := parseWhile(p);
pxRepeat: result := parseRepeat(p);
pxCase: result := parseCase(p);
pxTry: result := parseTry(p);
pxProcedure, pxFunction: result := parseRoutine(p);
pxType: result := parseTypeSection(p);
pxConst: result := parseConstSection(p);
pxVar: result := parseVar(p);
pxFor: begin
result := parseFor(p);
fixVarSection(p, result.sons[0]);
end;
pxRaise: result := parseRaise(p);
pxUses: result := parseUsesStmt(p);
pxProgram, pxUnit, pxLibrary: begin
// skip the pointless header
while not (p.tok.xkind in [pxSemicolon, pxEof]) do getTok(p);
getTok(p);
end;
pxInitialization: begin
getTok(p); // just skip the token
end;
pxImplementation: begin
p.section := seImplementation;
result := newNodeP(nkCommentStmt, p);
result.comment := '# implementation';
getTok(p);
end;
pxInterface: begin
p.section := seInterface;
getTok(p);
end;
pxComment: begin
result := newNodeP(nkCommentStmt, p);
skipCom(p, result);
end;
pxSemicolon: getTok(p);
pxSymbol: begin
if p.tok.ident.id = getIdent('break').id then begin
result := newNodeP(nkBreakStmt, p);
getTok(p); skipCom(p, result);
addSon(result, nil);
end
else if p.tok.ident.id = getIdent('continue').id then begin
result := newNodeP(nkContinueStmt, p);
getTok(p); skipCom(p, result);
addSon(result, nil);
end
else if p.tok.ident.id = getIdent('exit').id then begin
result := newNodeP(nkReturnStmt, p);
getTok(p); skipCom(p, result);
addSon(result, nil);
end
else result := parseExprStmt(p)
end;
pxDot: getTok(p); // BUGFIX for ``end.`` in main program
else result := parseExprStmt(p)
end;
opt(p, pxSemicolon);
if result <> nil then skipCom(p, result);
p.context := oldcontext;
end;
function parseUnit(var p: TPasParser): PNode;
begin
result := newNodeP(nkStmtList, p);
getTok(p); // read first token
while true do begin
case p.tok.xkind of
pxEof, pxEnd: break;
pxBegin: parseBegin(p, result);
pxCurlyDirLe, pxStarDirLe: begin
if isHandledDirective(p) then
addSon(result, parseDirective(p))
else
parMessage(p, errXNotAllowedHere, p.tok.ident.s)
end
else addSon(result, parseStmt(p))
end;
end;
opt(p, pxEnd);
opt(p, pxDot);
if p.tok.xkind <> pxEof then
addSon(result, parseStmt(p)); // comments after final 'end.'
end;
end.
|