-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathparser.cpp
More file actions
1986 lines (1679 loc) · 58.5 KB
/
parser.cpp
File metadata and controls
1986 lines (1679 loc) · 58.5 KB
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
#include <cassert>
#include <iomanip>
#include "main.h"
//////////////////////////////////////////////////////////////////////
const ParserKeywordSpec Parser::m_keywordspecs[] =
{
{ KeywordBEEP, &Parser::ParseStatementNoParams },
{ KeywordBLOAD, &Parser::ParseIgnoredStatement },
{ KeywordBSAVE, &Parser::ParseIgnoredStatement },
{ KeywordCLEAR, &Parser::ParseClear },
{ KeywordCLOAD, &Parser::ParseIgnoredStatement },
{ KeywordCLOSE, &Parser::ParseStatementNoParams },
{ KeywordCLS, &Parser::ParseStatementNoParams },
{ KeywordCOLOR, &Parser::ParseColor },
{ KeywordCSAVE, &Parser::ParseIgnoredStatement },
{ KeywordDATA, &Parser::ParseData },
{ KeywordDEF, &Parser::ParseDef },
{ KeywordDIM, &Parser::ParseDim },
{ KeywordKEY, &Parser::ParseKey },
{ KeywordDRAW, &Parser::ParseDraw },
{ KeywordEND, &Parser::ParseStatementNoParams },
{ KeywordFOR, &Parser::ParseFor },
{ KeywordGOSUB, &Parser::ParseGotoGosub },
{ KeywordGOTO, &Parser::ParseGotoGosub },
{ KeywordIF, &Parser::ParseIf },
{ KeywordINPUT, &Parser::ParseInput },
{ KeywordLET, &Parser::ParseLet },
{ KeywordLOAD, &Parser::ParseIgnoredStatement },
{ KeywordLOCATE, &Parser::ParseLocate },
{ KeywordMERGE, &Parser::ParseIgnoredStatement },
{ KeywordNEXT, &Parser::ParseNext },
{ KeywordON, &Parser::ParseOn },
{ KeywordOPEN, &Parser::ParseOpen },
{ KeywordOUT, &Parser::ParseOut },
{ KeywordPOKE, &Parser::ParsePoke },
{ KeywordPSET, &Parser::ParsePsetPreset },
{ KeywordPRESET, &Parser::ParsePsetPreset },
{ KeywordLINE, &Parser::ParseLine },
{ KeywordCIRCLE, &Parser::ParseCircle },
{ KeywordPAINT, &Parser::ParsePaint },
{ KeywordPRINT, &Parser::ParsePrint },
{ KeywordLPRINT, &Parser::ParsePrint },
{ KeywordREAD, &Parser::ParseRead },
{ KeywordREM, &Parser::ParseRem },
{ KeywordRESTORE, &Parser::ParseRestore },
{ KeywordRETURN, &Parser::ParseStatementNoParams },
{ KeywordSAVE, &Parser::ParseIgnoredStatement },
{ KeywordSCREEN, &Parser::ParseScreen },
{ KeywordSTOP, &Parser::ParseStatementNoParams },
{ KeywordSYSTEM, &Parser::ParseStatementNoParams },
{ KeywordTROFF, &Parser::ParseStatementNoParams },
{ KeywordTRON, &Parser::ParseStatementNoParams },
{ KeywordWIDTH, &Parser::ParseWidth },
};
const ParserFunctionSpec Parser::m_funcspecs[] =
{
{ KeywordSQR, 1, 1, ValueTypeSingle },
{ KeywordSIN, 1, 1, ValueTypeSingle },
{ KeywordCOS, 1, 1, ValueTypeSingle },
{ KeywordTAN, 1, 1, ValueTypeSingle },
{ KeywordATN, 1, 1, ValueTypeSingle },
{ KeywordPI, 0, 0, ValueTypeSingle },
{ KeywordEXP, 1, 1, ValueTypeSingle },
{ KeywordLOG, 1, 1, ValueTypeSingle },
{ KeywordABS, 1, 1, ValueTypeSingle },
{ KeywordFIX, 1, 1, ValueTypeInteger },
{ KeywordINT, 1, 1, ValueTypeInteger },
{ KeywordSGN, 1, 1, ValueTypeSingle },
{ KeywordRND, 1, 1, ValueTypeSingle },
{ KeywordFRE, 0, 1, ValueTypeInteger },
{ KeywordCINT, 1, 1, ValueTypeInteger },
{ KeywordCSNG, 1, 1, ValueTypeSingle },
{ KeywordCDBL, 1, 1, ValueTypeSingle }, // ValueTypeDouble
{ KeywordPEEK, 1, 1, ValueTypeInteger },
{ KeywordINP, 2, 2, ValueTypeInteger },
{ KeywordASC, 1, 1, ValueTypeInteger },
{ KeywordCHR, 1, 1, ValueTypeString },
{ KeywordLEN, 1, 1, ValueTypeInteger },
{ KeywordMID, 2, 3, ValueTypeString },
{ KeywordSTRING, 2, 2, ValueTypeString },
{ KeywordVAL, 1, 1, ValueTypeSingle },
{ KeywordINKEY, 0, 0, ValueTypeString },
{ KeywordSTR, 1, 1, ValueTypeString },
{ KeywordBIN, 1, 1, ValueTypeString },
{ KeywordOCT, 1, 1, ValueTypeString },
{ KeywordHEX, 1, 1, ValueTypeString },
{ KeywordCSRLIN, 0, 1, ValueTypeInteger },
{ KeywordPOS, 0, 1, ValueTypeInteger },
{ KeywordLPOS, 0, 1, ValueTypeInteger },
{ KeywordEOF, 0, 0, ValueTypeInteger },
{ KeywordAT, 2, 2, ValueTypeNone },
{ KeywordTAB, 1, 1, ValueTypeNone },
{ KeywordSPC, 1, 1, ValueTypeNone },
//NOTE: FN has special syntax
//NOTE: USR has special syntax
{ KeywordPOINT, 2, 2, ValueTypeInteger },
};
const char* MSG_UNEXPECTED = "Unexpected text.";
const char* MSG_UNEXPECTED_AT_END_OF_STATEMENT = "Unexpected text at the end of the statement.";
const char* MSG_EXPRESSION_SHOULDNOT_BE_EMPTY = "Expression should not be empty.";
const char* MSG_COMMA_EXPECTED = "Comma expected.";
const char* MSG_OPEN_BRACKET_EXPECTED = "Open bracket expected.";
const char* MSG_CLOSE_BRACKET_EXPECTED = "Close bracket expected.";
const char* MSG_ARGUMENTS_EXPECTED = "Arguments expected.";
const ParserFunctionSpec* Parser::FindFunctionSpec(KeywordIndex keyword)
{
for (auto it = std::begin(m_funcspecs); it != std::end(m_funcspecs); ++it)
{
if (keyword == it->keyword)
return it;
}
return nullptr;
}
Parser::Parser(Tokenizer* tokenizer)
{
assert(tokenizer != nullptr);
m_tokenizer = tokenizer;
m_nexttoken.type = TokenTypeNone;
m_havenexttoken = false;
m_prevlinenum = 0;
m_line = nullptr;
}
Token Parser::GetNextToken()
{
if (m_havenexttoken)
{
m_havenexttoken = false;
return m_nexttoken;
}
return m_tokenizer->GetNextToken();
}
Token Parser::GetNextTokenSkipDivider()
{
Token token = GetNextToken();
if (token.type == TokenTypeDivider)
token = GetNextToken();
return token;
}
Token Parser::PeekNextToken()
{
if (m_havenexttoken)
return m_nexttoken;
m_havenexttoken = true;
m_nexttoken = m_tokenizer->GetNextToken();
return m_nexttoken;
}
Token Parser::PeekNextTokenSkipDivider()
{
Token token = PeekNextToken();
if (token.type == TokenTypeDivider)
{
GetNextToken();
token = PeekNextToken();
}
return token;
}
SourceLineModel Parser::ParseNextLine()
{
Token token = GetNextToken();
SourceLineModel model;
m_line = &model;
model.text = m_tokenizer->GetLineText();
if (token.type == TokenTypeEOT)
{
model.number = 0;
return model;
}
if (token.type == TokenTypeEOL) // Empty lines allowed at the end of file
{
while (true)
{
token = GetNextToken();
if (token.type == TokenTypeEOL || token.type == TokenTypeDivider)
continue;
if (token.type == TokenTypeEOT)
{
model.number = 0;
return model;
}
Error(token, "Unexpected text after empty line.");
return model;
}
}
if (token.type != TokenTypeNumber)
{
Error(token, "Line number not found.");
return model;
}
model.number = atoi(token.text.c_str());
if (model.number <= 0 || model.number > MAX_LINE_NUMBER)
{
Error(token, "Line number is out of valid range.");
SkipTilEnd();
return model;
}
if (model.number == m_prevlinenum)
{
Error(token, "Line number duplicated.");
SkipTilEnd();
return model;
}
if (model.number <= m_prevlinenum)
{
Error(token, "Line number is incorrect.");
SkipTilEnd();
return model;
}
m_prevlinenum = model.number;
ParseStatement(model.statement);
token = PeekNextTokenSkipDivider();
if (token.IsEolOrEof())
GetNextToken();
return model;
}
void Parser::ParseStatement(StatementModel& statement)
{
Token token = PeekNextTokenSkipDivider();
if (token.type == TokenTypeEndComment) // REM short form
{
GetNextToken(); // get after peek
Token tokenrem;
tokenrem.keyword = KeywordREM;
statement.token = tokenrem;
return; // Empty line with end-line comment
}
if (token.type == TokenTypeSymbol && token.symbol == '?') // PRINT short form
{
GetNextToken(); // get after peek
Token tokenprint;
tokenprint.type = TokenTypeKeyword;
tokenprint.keyword = KeywordPRINT;
statement.token = tokenprint;
ParsePrint(statement);
goto skiptilend;
}
if (token.type == TokenTypeIdentifier) // LET without the keyword
{
Token tokenlet;
tokenlet.type = TokenTypeKeyword;
tokenlet.keyword = KeywordLET;
statement.token = tokenlet;
ParseLetShort(token, statement);
goto skiptilend;
}
if (token.IsKeyword(KeywordMID))
{
Token tokenlet;
tokenlet.type = TokenTypeKeyword;
tokenlet.keyword = KeywordLET;
statement.token = tokenlet;
ParseLetShort(token, statement);
goto skiptilend;
}
if (token.type != TokenTypeKeyword)
{
Error(token, "Statement keyword expected.");
return;
}
if (IsFunctionKeyword(token.keyword))
{
Error(token, "Statement keyword expected, function keyword found.");
return;
}
GetNextToken(); // keyword
statement.token = token;
{
// Find keyword parser implementation
ParseMethodRef methodref = nullptr;
for (auto it = std::begin(m_keywordspecs); it != std::end(m_keywordspecs); ++it)
{
if (token.keyword == it->keyword)
{
methodref = it->methodref;
break;
}
}
if (methodref == nullptr)
{
Error(token, "Parser not found for keyword " + token.text + ".");
SkipTilEnd();
return;
}
(this->*methodref)(statement);
}
skiptilend:
if (m_line->error)
{
if (statement.inner)
SkipTilStatementEnd();
else
SkipTilEnd();
}
}
void Parser::Error(const Token& token, const string& message)
{
assert(m_line != nullptr);
std::cerr << "ERROR at " << token.line << ":" << token.pos << " line " << m_line->number << " - " << message << std::endl;
const string& linetext = m_line->text;
if (!linetext.empty())
{
std::cerr << linetext << std::endl;
std::cerr << std::right << std::setw(token.pos) << "^" << std::endl;
}
m_line->error = true;
RegisterError();
}
void Parser::SkipTilEnd()
{
while (true) // Skip til EOL/EOF
{
Token token = GetNextToken();
if (token.IsEolOrEof())
break;
}
}
void Parser::SkipTilStatementEnd()
{
while (true) // Skip til EOL/EOF
{
Token token = PeekNextToken();
if (token.IsEndOfStatement())
break;
GetNextToken();
}
}
void Parser::SkipComma()
{
Token token = PeekNextTokenSkipDivider();
if (!token.IsComma())
{
Error(token, MSG_COMMA_EXPECTED);
return;
}
GetNextToken(); // comma
}
ExpressionModel Parser::ParseExpression()
{
ExpressionModel expression;
expression.root = -1; // Empty expression for now
bool isop = false; // Currently on operation or not
int prev = -1; // Index of previous operation
Token token = PeekNextTokenSkipDivider();
if (token.IsEndOfExpression())
return expression; // Empty expression
// Check if we have unary plus/minus sign or NOT operation
if (token.type == TokenTypeOperation && (token.text == "+" || token.text == "-" || token.text == "NOT"))
{
token = GetNextToken(); // get the token we peeked
if (token.type == TokenTypeOperation && (token.text == "+" || token.text == "-"))
{
Token tokenNext = PeekNextToken();
if (tokenNext.type == TokenTypeNumber) // Sign '+'/'-' before the number
{
tokenNext = GetNextToken(); // get the token we peeked
if (token.text == "-") // apply the negative sign
{
tokenNext.dvalue = -tokenNext.dvalue;
tokenNext.text.insert(tokenNext.text.begin(), '-');
}
// Put number node into the tree
ExpressionNode nodeNumber;
nodeNumber.token = tokenNext;
nodeNumber.vtype = tokenNext.vtype;
nodeNumber.constval = true;
expression.nodes.push_back(nodeNumber);
expression.root = 0;
prev = 0;
isop = true; // next thing should be a binary operation
}
else // Unary '+'/'-'
{
ExpressionNode nodeUnary;
nodeUnary.token = token;
expression.nodes.push_back(nodeUnary);
expression.root = 0;
prev = 0;
}
}
else
{
ExpressionNode nodeun;
nodeun.token = token;
expression.nodes.push_back(nodeun);
expression.root = 0;
prev = 0;
}
}
// Loop parse expression tokens into list
while (true)
{
Token token = PeekNextTokenSkipDivider();
if (isop) // Current node should be a binary operation
{
if (token.IsEndOfExpression())
break; // It's okay to end here
if (!token.IsBinaryOperation())
break; // End of expression: we have something unknown here
token = GetNextToken(); // get the token we peeked
// Put the token into the list
ExpressionNode node;
node.token = token;
prev = expression.AddOperationNode(node, prev);
}
else // Current node should be non-operation
{
if (token.IsEndOfExpression())
{
Error(token, "Operand expected in expression.");
return expression;
}
token = GetNextToken(); // get the token we peeked
// Process unary plus/minus/NOT here
if (token.type == TokenTypeOperation && token.text == "-")
{
Token tokenNext = PeekNextToken();
if (tokenNext.type == TokenTypeNumber) // Sign '-' before the number
{
token = GetNextToken(); // get the token we peeked
token.dvalue = -token.dvalue; // apply the negative sign
// Put number into the tree
ExpressionNode nodeNumber;
nodeNumber.token = token;
nodeNumber.vtype = token.vtype;
nodeNumber.constval = true;
expression.nodes.push_back(nodeNumber);
}
else // Unary '-'
{
// Put unary '-' into the tree
ExpressionNode nodeUnary;
nodeUnary.token = token;
expression.nodes.push_back(nodeUnary);
}
}
else if (token.IsBinaryOperation())
{
Error(token, "Binary operation is not expected here.");
return expression;
}
int index = -1; // Index of the new node/sub-tree
if (token.IsOpenBracket()) // Do recursion for expression inside brackets
{
ExpressionModel exprin = ParseExpression();
if (exprin.IsEmpty())
{
Error(token, "Expression in brackets should not be empty.");
return expression;
}
// Move expression nodes in the list
int shift = (int)expression.nodes.size();
for (size_t i = 0; i < exprin.nodes.size(); i++)
{
ExpressionNode& node = exprin.nodes[i];
if ((int)i == exprin.root)
node.brackets = true;
if (node.left >= 0)
node.left += shift;
if (node.right >= 0)
node.right += shift;
expression.nodes.push_back(node);
}
token = GetNextToken();
if (!token.IsCloseBracket())
{
Error(token, "Close bracket expected in expression.");
return expression;
}
index = exprin.root + shift;
}
else if (IsFunctionKeyword(token.keyword)) // Function with parameter list
{
const ParserFunctionSpec* funcspec = FindFunctionSpec(token.keyword);
assert(funcspec != nullptr);
ExpressionNode node;
node.token = token;
node.vtype = funcspec->resulttype;
token = PeekNextTokenSkipDivider();
if (token.IsOpenBracket()) // Function parameter list
{
if (funcspec->maxparams == 0)
{
Error(token, "This function should not have any parameters.");
return expression;
}
GetNextToken(); // open bracket
while (true)
{
ExpressionModel exprarg = ParseExpression();
node.args.push_back(exprarg);
token = PeekNextTokenSkipDivider();
if (token.IsCloseBracket())
{
GetNextToken(); // close bracket
break;
}
if (!token.IsComma())
{
Error(token, "Comma expected in function parameter list.");
return expression;
}
GetNextToken(); // comma
}
}
// Validate number of params for this function
if (node.args.size() == 0 && funcspec->minparams > 0)
{
if (funcspec->minparams == 1)
Error(token, "Expected parameter for this function.");
else
Error(token, "Expected parameters for this function.");
return expression;
}
if ((int)node.args.size() < funcspec->minparams)
{
Error(token, "Specified too few parameters for this function.");
return expression;
}
if ((int)node.args.size() > funcspec->maxparams)
{
Error(token, "Specified too many parameters for this function.");
return expression;
}
index = (int)expression.nodes.size();
expression.nodes.push_back(node);
}
else if (token.type == TokenTypeNumber)
{
// Put the token into the list
ExpressionNode node;
node.token = token;
node.vtype = token.vtype;
node.constval = true;
index = (int)expression.nodes.size();
expression.nodes.push_back(node);
}
else // Other token like Ident, Number, String
{
// Put the token into the list
ExpressionNode node;
node.token = token;
node.vtype = token.vtype;
node.constval = (token.type == TokenTypeString);
index = (int)expression.nodes.size();
expression.nodes.push_back(node);
if (token.type == TokenTypeIdentifier)
{
token = PeekNextTokenSkipDivider();
if (token.IsOpenBracket()) // List of array indices
{
GetNextToken(); // open bracket
while (true)
{
token = PeekNextTokenSkipDivider();
ExpressionModel expri = ParseExpression();
if (m_line->error)
return expression;
if (expri.IsEmpty())
{
Error(token, "Expression should not be empty.");
return expression;
}
node.args.push_back(expri);
token = PeekNextTokenSkipDivider();
if (token.IsCloseBracket())
{
GetNextToken(); // close bracket
break;
}
if (!token.IsComma())
{
Error(token, MSG_COMMA_EXPECTED);
return expression;
}
GetNextToken(); // comma
}
}
}
}
// Put node in the tree
if (expression.root < 0)
expression.root = index;
else
{
int pred = prev < 0 ? expression.root : prev;
ExpressionNode& nodepred = expression.nodes[pred];
if (nodepred.right < 0)
nodepred.right = index;
}
}
isop = !isop;
}
return expression;
}
// Parse variable like "A", or variable with indices like "A(1,2)"
VariableModel Parser::ParseVariable()
{
VariableModel var;
Token token = PeekNextTokenSkipDivider();
if (token.type != TokenTypeIdentifier)
{
Error(token, "Identifier expected.");
return var;
}
token = GetNextToken(); // Identifier
var.name = GetCanonicVariableName(token.text);
token = PeekNextTokenSkipDivider();
if (!token.IsOpenBracket()) // end of definition
return var;
GetNextToken(); // Open bracket
// Parse array indices
while (true)
{
token = PeekNextTokenSkipDivider();
if (token.type != TokenTypeNumber)
{
Error(token, "Array index expected.");
return var;
}
if (!token.IsDValueInteger())
{
Error(token, "Array index should be an integer.");
return var;
}
GetNextToken(); // array index
var.indices.push_back((int)token.dvalue);
token = PeekNextTokenSkipDivider();
if (token.IsCloseBracket())
{
GetNextToken(); // close bracket
break;
}
if (!token.IsComma())
{
Error(token, MSG_COMMA_EXPECTED);
return var;
}
GetNextToken(); // comma
}
return var;
}
VariableExpressionModel Parser::ParseVariableExpression()
{
VariableExpressionModel var;
Token token = PeekNextTokenSkipDivider();
if (token.type != TokenTypeIdentifier)
{
Error(token, "Identifier expected.");
return var;
}
token = GetNextToken(); // Identifier
var.name = GetCanonicVariableName(token.text);
token = PeekNextTokenSkipDivider();
if (!token.IsOpenBracket()) // end of definition
return var;
GetNextToken(); // Open bracket
// Parse array indices
while (true)
{
token = PeekNextTokenSkipDivider();
ExpressionModel expr1 = ParseExpression();
if (m_line->error)
return var;
if (expr1.IsEmpty())
{
Error(token, MSG_EXPRESSION_SHOULDNOT_BE_EMPTY);
return var;
}
var.args.push_back(expr1);
token = PeekNextTokenSkipDivider();
if (token.IsCloseBracket())
{
GetNextToken(); // close bracket
break;
}
if (!token.IsComma())
{
Error(token, MSG_COMMA_EXPECTED);
return var;
}
GetNextToken(); // comma
}
return var;
}
#define MODEL_ERROR(msg) \
{ Error(token, msg); return; }
#define CHECK_MODEL_ERROR \
{ if (m_line->error) return; }
#define CHECK_EXPRESSION_NOT_EMPTY(expr) \
{ if (expr.IsEmpty()) { Error(token, MSG_EXPRESSION_SHOULDNOT_BE_EMPTY); return; } }
#define SKIP_COMMA \
{ SkipComma(); if (m_line->error) return; }
#define SKIP_OPEN_BRACKET \
{ token = PeekNextTokenSkipDivider(); \
if (!token.IsOpenBracket()) { Error(token, MSG_OPEN_BRACKET_EXPECTED); return; } \
GetNextToken(); }
void Parser::ParseIgnoredStatement(StatementModel& statement)
{
SkipTilStatementEnd();
}
void Parser::ParseStatementNoParams(StatementModel& statement)
{
Token token = PeekNextTokenSkipDivider();
if (!token.IsEndOfStatement())
MODEL_ERROR(MSG_UNEXPECTED_AT_END_OF_STATEMENT);
}
void Parser::ParseClear(StatementModel& statement)
{
Token token = PeekNextTokenSkipDivider();
if (token.IsEndOfStatement())
return;
ExpressionModel expr1 = ParseExpression();
CHECK_MODEL_ERROR;
CHECK_EXPRESSION_NOT_EMPTY(expr1);
statement.args.push_back(expr1);
token = GetNextTokenSkipDivider();
if (token.IsEndOfStatement())
return; // One argument
if (!token.IsComma())
MODEL_ERROR(MSG_UNEXPECTED);
token = PeekNextTokenSkipDivider();
ExpressionModel expr2 = ParseExpression();
CHECK_MODEL_ERROR;
CHECK_EXPRESSION_NOT_EMPTY(expr2);
statement.args.push_back(expr2);
token = PeekNextTokenSkipDivider();
if (!token.IsEndOfStatement())
MODEL_ERROR(MSG_UNEXPECTED_AT_END_OF_STATEMENT);
}
void Parser::ParseColor(StatementModel& statement)
{
Token token = PeekNextTokenSkipDivider();
if (token.IsEndOfStatement())
MODEL_ERROR(MSG_ARGUMENTS_EXPECTED);
ExpressionModel expr1 = ParseExpression();
CHECK_MODEL_ERROR;
statement.args.push_back(expr1);
token = GetNextTokenSkipDivider();
if (token.IsEndOfStatement())
return;
if (!token.IsComma())
MODEL_ERROR(MSG_UNEXPECTED);
token = PeekNextTokenSkipDivider();
ExpressionModel expr2 = ParseExpression();
CHECK_MODEL_ERROR;
statement.args.push_back(expr2);
token = GetNextTokenSkipDivider();
if (token.IsEndOfStatement())
return;
if (!token.IsComma())
MODEL_ERROR(MSG_UNEXPECTED);
//NOTE: Documentation tells about optional third parameter for border color, not implemented on UKNC
token = PeekNextTokenSkipDivider();
ExpressionModel expr3 = ParseExpression();
CHECK_MODEL_ERROR;
CHECK_EXPRESSION_NOT_EMPTY(expr3);
statement.args.push_back(expr3);
token = PeekNextTokenSkipDivider();
if (!token.IsEndOfStatement())
MODEL_ERROR(MSG_UNEXPECTED_AT_END_OF_STATEMENT);
}
void Parser::ParseData(StatementModel& statement)
{
m_tokenizer->SetMode(TokenizerModeData);
Token token;
while (true)
{
token = GetNextTokenSkipDivider();
if (token.type == TokenTypeOperation && token.text == "-") // unary minus
{
token = GetNextToken();
if (token.type != TokenTypeNumber)
MODEL_ERROR("Number expected.");
token.text.insert(0, "-");
token.dvalue = -token.dvalue; // invert sign
}
else if (token.type != TokenTypeNumber && token.type != TokenTypeString)
MODEL_ERROR("Number or string expected.");
statement.params.push_back(token);
token = PeekNextTokenSkipDivider();
if (!token.IsComma())
break;
GetNextToken(); // Comma
}
if (!token.IsEndOfStatement())
MODEL_ERROR(MSG_UNEXPECTED_AT_END_OF_STATEMENT);
}
void Parser::ParseDim(StatementModel& statement)
{
Token token;
while (true)
{
VariableModel var = ParseVariable();
CHECK_MODEL_ERROR;
statement.variables.push_back(var);
token = PeekNextTokenSkipDivider();
if (token.IsEndOfStatement())
break; // End of the list
SKIP_COMMA;
}
}
void Parser::ParseDraw(StatementModel& statement)
{
Token token = PeekNextTokenSkipDivider();
ExpressionModel expr1 = ParseExpression();
CHECK_MODEL_ERROR;
CHECK_EXPRESSION_NOT_EMPTY(expr1);
statement.args.push_back(expr1);
token = PeekNextTokenSkipDivider();
if (!token.IsEndOfStatement())
MODEL_ERROR(MSG_UNEXPECTED_AT_END_OF_STATEMENT);
}
void Parser::ParseFor(StatementModel& statement)
{
Token token = PeekNextTokenSkipDivider();
if (token.type != TokenTypeIdentifier)
MODEL_ERROR("Identifier expected.");
GetNextToken(); // identifier
statement.ident = token;
token = PeekNextTokenSkipDivider();
if (!token.IsEqualSign())
MODEL_ERROR("Equal sign (\'=\') expected.");
GetNextToken(); // equal sign
token = PeekNextToken();
ExpressionModel expr1 = ParseExpression();
CHECK_MODEL_ERROR;
CHECK_EXPRESSION_NOT_EMPTY(expr1);
statement.args.push_back(expr1);
token = PeekNextTokenSkipDivider();
if (token.type != TokenTypeKeyword || token.keyword != KeywordTO)
MODEL_ERROR("TO keyword expected.");
GetNextToken(); // TO keyword
token = PeekNextToken();
ExpressionModel expr2 = ParseExpression();
CHECK_MODEL_ERROR;
CHECK_EXPRESSION_NOT_EMPTY(expr2);
statement.args.push_back(expr2);
token = GetNextTokenSkipDivider();
if (token.IsEndOfStatement())
return;
if (token.type != TokenTypeKeyword || token.keyword != KeywordSTEP)
MODEL_ERROR(MSG_UNEXPECTED);
token = PeekNextToken();
ExpressionModel expr3 = ParseExpression();
CHECK_MODEL_ERROR;
CHECK_EXPRESSION_NOT_EMPTY(expr3);
statement.args.push_back(expr3);
token = GetNextTokenSkipDivider();
if (!token.IsEndOfStatement())
MODEL_ERROR(MSG_UNEXPECTED_AT_END_OF_STATEMENT);
}
void Parser::ParseGotoGosub(StatementModel& statement)
{
Token token = PeekNextTokenSkipDivider();
if (token.type != TokenTypeNumber)
MODEL_ERROR("Line number expected.");
token = GetNextToken(); // line number
statement.paramline = atoi(token.text.c_str());
token = PeekNextTokenSkipDivider();
if (!token.IsEndOfStatement())
MODEL_ERROR(MSG_UNEXPECTED_AT_END_OF_STATEMENT);
}
//NOTE: For now, in form: IF expr THEN linenum [ELSE linueum]
void Parser::ParseIf(StatementModel& statement)
{
Token token = PeekNextTokenSkipDivider();
ExpressionModel expr = ParseExpression();
CHECK_MODEL_ERROR;
CHECK_EXPRESSION_NOT_EMPTY(expr);
statement.args.push_back(expr);
token = PeekNextTokenSkipDivider();