forked from alberthdev/spasm-ng
-
Notifications
You must be signed in to change notification settings - Fork 1
/
parser.cpp
735 lines (625 loc) · 16.3 KB
/
parser.cpp
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
#include "stdafx.h"
#define __PARSER_C
//max depth of #defines
#define RECURSION_LIMIT 20
#include "spasm.h"
#include "parser.h"
#include "storage.h"
#include "utils.h"
#include "preop.h"
#include "errors.h"
//case '+': total += last_num; break;
//case '-': total -= last_num; break;
//case '*': total *= last_num; break;
//case '/': total /= last_num; break;
//case '%': total %= last_num; break;
//case '^': total ^= last_num; break;
//case '&': total &= last_num; break;
//case '|': total |= last_num; break;
//case '<': total <<= last_num; break;
//case '>': total >>= last_num; break;
typedef enum tagMATHOP
{
// Math
M_ADD,
M_SUB,
M_MUL,
M_DIV,
M_MOD,
M_XOR,
M_LAND,
M_LOR,
M_LSHIFT,
M_RSHIFT,
// Conditions
M_AND,
M_OR,
M_LTE,
M_GTE,
M_LT,
M_GT,
M_EQUALS,
M_NOTEQUALS,
//
M_NONE,
}
MATHOP;
static const struct tagMATHOPDEF
{
MATHOP Op;
const char *szDef;
}
MathDefs[] =
{
{M_LSHIFT, "<<"},
{M_RSHIFT, ">>"},
// Conditions
{M_AND, "&&"},
{M_OR, "||"},
{M_LTE, "<="},
{M_GTE, ">="},
{M_LT, "<"},
{M_GT, ">"},
{M_EQUALS, "=="},
{M_EQUALS, "="},
{M_NOTEQUALS, "!="},
// Math
{M_ADD, "+"},
{M_SUB, "-"},
{M_MUL, "*"},
{M_DIV, "/"},
{M_MOD, "%"},
{M_XOR, "^"},
{M_LAND, "&"},
{M_LOR, "|"},
};
extern char *curr_input_file;
extern int line_num;
extern bool error_occurred;
extern bool pass_one;
extern unsigned int program_counter;
static const char *parse_single_num (const char *expr, int *value);
static const char *parse_num_full (const char *expr, int *value, int depth);
static bool conv_dec (const char* str, const char *end, int *output);
static bool conv_bin (const char* str, const char *end, int *output);
//set when the parser hits an undefined #define or label
bool parser_forward_ref_err;
//current recursive depth in expression
int parse_depth;
/*
* Parses an expression, sets
* the result in value and
* returns TRUE if successful,
* otherwise sets value to 0
* and returns FALSE
*/
bool parse_num (const char *expr, int *value) {
int fake_value;
const char *result;
if (value == NULL)
value = &fake_value;
parse_depth = 0;
result = parse_num_full (expr, value, 0);
if (!result)
*value = 0;
return (result != NULL);
}
/*
* Parses expression,
* ignoring errors
*/
int parse_f (const char *expr) {
int result;
int session = StartSPASMErrorSession();
if (!(parse_num (expr, &result)))
result = -1;
if (IsSPASMErrorSessionFatal(session) == true)
{
result = -1;
}
EndSPASMErrorSession(session);
return result;
}
/*
* Parses the contents of a define,
* handling preops, and returns
* the first line with a value,
* allocated
*/
char *parse_define (define_t *define)
{
char *curr_line = define->contents;
char *lpszResult = NULL;
while (curr_line != NULL && *curr_line && !error_occurred) {
char *next_line = curr_line;
curr_line = skip_whitespace(curr_line);
if (*curr_line == '#')
{
next_line = handle_preop(curr_line + 1);
}
else if (is_end_of_code_line(curr_line) == false)
{
//otherwise, it must be a value, so return that
lpszResult = strndup(curr_line, skip_to_code_line_end(curr_line) - curr_line);
break;
}
curr_line = next_code_line(next_line);
line_num++;
}
return lpszResult;
}
/*
* Parses a single number, sets
* the value, and returns the
* end of the number
*/
static const char *parse_single_num (const char *expr, int *value) {
switch (*expr) {
#ifdef USE_REUSABLES
case '+':
//case '_':
{
//Local label!
int this_reusable = get_curr_reusable();
while (*expr == '+')
{
expr++;
this_reusable++;
}
if (*(expr++) != '_')
{
SetLastSPASMError(SPASM_ERR_LOCAL_LABEL_SYNTAX);
return NULL;
}
else if (this_reusable >= get_num_reusables())
{
SetLastSPASMError(SPASM_ERR_LOCAL_LABEL_FORWARD_REF);
return NULL;
}
else
{
*value = search_reusables(this_reusable);
}
break;
}
case '-':
{
//Again, a local label!
int this_reusable = get_curr_reusable();
if (*expr == '-') expr++;
while (*expr == '-' && this_reusable > 0) {
expr++;
this_reusable--;
}
if (*(expr++) != '_' || this_reusable < 0)
{
SetLastSPASMError(SPASM_ERR_LOCAL_LABEL_SYNTAX);
return NULL;
}
*value = search_reusables(this_reusable);
break;
}
#endif
//If the number has a prefix it's easy to tell what the type is!
case '$':
{
const char *num_start = ++expr;
//Could be a hex number (ld hl,$1A2F) or the current address (ld hl,$)
if (isxdigit ((unsigned char) *expr)) {
while (isalnum(*expr))
expr++;
bool success = conv_hex (num_start, expr, value);
if (!success)
{
return NULL;
}
} else
//TODO: This is questionable behavior. It should probably check specifically for $
*value = program_counter;
break;
}
case '%':
{
const char *num_start = ++expr;
while (isalnum(*expr))
expr++;
bool succeeded = conv_bin (num_start, expr, value);
if (!succeeded)
{
return NULL;
}
break;
}
//Handle literal chars in single quotes
case '\'':
{
*value = *(++expr);
if (*value == '\\') {
switch (toupper (*(++expr))) {
case 'N': *value = '\n'; break;
case '\\': *value = '\\'; break;
case '0': *value = '\0'; break;
case 'R': *value = '\r'; break;
case 'T': *value = '\t'; break;
case '\'': *value = '\''; break;
case '#': *value = rand () & 0xFF; break;
default: *value = *expr;
}
}
if (*(++expr) != '\'') {
show_warning ("Literal char is missing single quote at end");
} else {
expr++;
}
break;
}
//By now, it's either a label, number, or macro
default:
if (isalpha ((unsigned char) *expr) || *expr == '_') {
//If it starts with a letter or underscore, it's a label or a macro that returns a value
label_t *label = NULL;
define_t *define = NULL;
char *name;
const char *expr_start = expr;
//Find the end of the name, then try it as a label first
expr = skip_to_name_end (expr_start);
name = strndup (expr_start, expr - expr_start);
define = search_local_defines(name);
if (define == NULL) {
label = search_labels(name);
if (label == NULL) {
define = search_defines(name);
}
}
//see if it's a local label
if (!strcmp (name, "_")) {
free (name);
if (get_curr_reusable() + 1 < get_num_reusables())
{
*value = search_reusables(get_curr_reusable() + 1);
}
else
{
SetLastSPASMError(SPASM_ERR_LOCAL_LABEL_FORWARD_REF);
return NULL;
}
}
else if (label != NULL) {
*value = label->value;
free (name);
//or the "eval" macro
} else if (!strcasecmp (name, "eval") && *expr == '(') {
free(name);
//show_warning ("eval() has no effect except in #define");
expr = parse_num_full (expr, value, 0);
//then a normal label
}
else if (!strcasecmp (name, "getc") && *expr == '(')
{
char filename[256];
FILE *temp_file;
define_t *define;
int char_index;
char parse_buf[256];
char *rfn;
free(name);
expr++;
read_expr(&expr, filename, ",");
// Is the filename given a macro?
if ((define = search_defines (filename)))
{
strncpy (filename, define->contents, sizeof (filename));
}
read_expr (&expr, parse_buf, ",");
char_index = parse_f (parse_buf);
rfn = fix_filename (reduce_string (filename));
if ((temp_file = fopen (rfn, "r"))) {
fseek (temp_file, char_index, SEEK_SET);
*value = fgetc (temp_file);
fclose (temp_file);
} else {
SetLastSPASMError(SPASM_ERR_FILE_NOT_FOUND, filename);
}
if (*expr == ')') expr++;
//If that didn't work, see if it's a macro
}
else if (define)
{
list_t *args = NULL;
char *contents;
free (name);
expr = parse_args (expr, define, &args);
if (!expr)
return NULL;
bool fHasError = false;
int old_line_num = line_num;
line_num = define->line_num;
int session = StartSPASMErrorSession();
contents = parse_define (define);
if (contents == NULL)
{
SetLastSPASMError(SPASM_ERR_ARG_USED_WITHOUT_VALUE, define->name);
}
else
{
parse_num_full(contents, value, 0);
free(contents);
}
line_num = old_line_num;
if (GetSPASMErrorSessionErrorCount(session) > 0)
{
AddSPASMErrorSessionAnnotation(session, _T("Error during evaluation of macro '%s'"), define->name);
ReplaySPASMErrorSession(session);
fHasError = true;
}
EndSPASMErrorSession(session);
remove_arg_set (args);
if (fHasError == true)
{
return NULL;
}
}
else
{
SetLastSPASMError(SPASM_ERR_LABEL_NOT_FOUND, name);
parser_forward_ref_err = true;
free (name);
return NULL;
}
} else if ((unsigned char) isdigit (expr[0])) {
const char *expr_start = expr;
//Find the end of the number
while (isalnum ((unsigned char) expr[1])) expr++;
bool success;
switch (toupper (expr[0])) {
case 'H': success = conv_hex (expr_start, expr++, value); break;
case 'B': success = conv_bin (expr_start, expr++, value); break;
case 'D': success = conv_dec (expr_start, expr++, value); break;
default: success = conv_dec (expr_start, ++expr, value); break;
}
if (!success)
{
return NULL;
}
} else {
SetLastSPASMError(SPASM_ERR_BAD_VALUE_PREFIX, *expr);
return NULL;
}
break;
}
return expr;
}
/*
* Skips until the next &&, ||,
* <, >, ==, !=, <=, or >=, and
* returns a pointer to it
*/
const char *find_next_condition (const char *ptr) {
int depth = 0;
while (!is_end_of_code_line (ptr)) {
if (depth == 0 &&
(((*ptr == '&' || *ptr == '|') && *(ptr + 1) == *ptr)
|| *ptr == '=' || *ptr == '!' ||
((*ptr == '<' || *ptr == '>') && *(ptr + 1) != *ptr)))
break;
switch (*ptr) {
case '(': depth++; break;
case ')':
depth--;
if (depth < 0) return ptr;
break;
case '\'':
ptr++;
if (*ptr == '\\') ptr++;
if (*ptr) ptr++;
break;
}
ptr++;
}
return ptr;
}
/*
* Evaluates the expression in expr, sets value to result, returns
* pointer to end of expression (if depth > 0) or NULL on error.
*/
static const char *parse_num_full (const char *expr, int *value, int depth) {
int total = 0, last_num;
MATHOP last_op = M_NONE;
bool invert_lastnum, neg_lastnum;
parser_forward_ref_err = false;
if (++parse_depth > RECURSION_LIMIT)
{
SetLastSPASMError(SPASM_ERR_EXCEEDED_RECURSION_LIMIT);
return NULL;
}
expr = skip_whitespace (expr);
if (!(*expr))
{
SetLastSPASMError(SPASM_ERR_VALUE_EXPECTED);
return NULL;
}
//Now loop through the whole expression
for (;;)
{
//First look for numbers
invert_lastnum = neg_lastnum = false;
//Catch any invert symbols before the number
if (*expr == '~') {
invert_lastnum = true;
expr++;
//Same with - signs
} else if (*expr == '-') {
expr++;
if (*expr == '-' || (*expr == '_' && skip_to_name_end (expr) == expr + 1))
//It's a local label, so let the number parsing stuff deal with it
expr--;
else
//Otherwise, it's something like "-3" or "-value"
neg_lastnum = true;
}
//If it's a parenthesis, evaluate the stuff inside there
if (*expr == '(') {
expr = parse_num_full (++expr, &last_num, depth + 1);
//If there was an error in that expression, then abort
if (!expr)
return NULL;
//Otherwise it's just a normal value
} else {
expr = parse_single_num (expr, &last_num);
if (!expr)
return NULL;
}
if (invert_lastnum)
last_num = ~last_num;
if (neg_lastnum)
last_num = -last_num;
//Now check on the last operator to see what to do with this number
switch (last_op) {
case M_NONE:
//Special case for the first number in the expression
total = last_num; break;
// Math
case M_ADD: total += last_num; break;
case M_SUB: total -= last_num; break;
case M_MUL: total *= last_num; break;
case M_DIV: total /= last_num; break;
case M_MOD: total %= last_num; break;
case M_XOR: total ^= last_num; break;
case M_LAND: total &= last_num; break;
case M_LOR: total |= last_num; break;
case M_LSHIFT: total <<= last_num; break;
case M_RSHIFT: total >>= last_num; break;
// Condition
case M_AND: total = total && last_num; break;
case M_OR: total = total || last_num; break;
case M_LT: total = total < last_num; break;
case M_GT: total = total > last_num; break;
case M_LTE: total = total <= last_num; break;
case M_GTE: total = total >= last_num; break;
case M_EQUALS: total = total == last_num; break;
case M_NOTEQUALS: total = total != last_num; break;
}
//Get the next operator
get_op:
expr = skip_whitespace (expr);
//If it's the end of the expression, return the total so far
if (is_end_of_code_line (expr)) {
if (depth > 0)
show_warning ("Missing %d parentheses at end of expression", depth);
*value = total;
parse_depth--;
return expr;
}
last_op = M_NONE;
for (int i = 0; i < ARRAYSIZE(MathDefs); i++)
{
if (strncmp(expr, MathDefs[i].szDef, strlen(MathDefs[i].szDef)) == 0)
{
last_op = MathDefs[i].Op;
expr += strlen(MathDefs[i].szDef);
break;
}
}
if (last_op != M_NONE)
{
}
else if (*expr == ')') {
if (depth > 0) {
// We've been parsing an expression in parentheses and reached the end,
// so return the result and go up a level again
*value = total;
expr = skip_whitespace (expr + 1);
parse_depth--;
return expr;
} else {
//Otherwise it's just an extra parenthesis
show_warning ("Extra parenthesis found, ignoring it");
expr++;
goto get_op;
}
} else {
SetLastSPASMError(SPASM_ERR_OPERATOR_EXPECTED, *expr);
return NULL;
}
//Skip any whitespace after the operator
expr = skip_whitespace (expr);
if (*expr == '\0') {
SetLastSPASMError(SPASM_ERR_VALUE_EXPECTED);
return NULL;
}
}
}
/*
* Evaluates a hexadecimal string
* returns true if succeeded, false otherwise
*/
bool conv_hex (const char* str, const char *end, int *output_num) {
int acc = 0;
const char *start = str;
while (str < end) {
char hexchar = toupper (*str);
if (!isxdigit (*str))
{
char number[256];
strncpy(number, start, end - start);
number[end - start] = '\0';
SetLastSPASMError(SPASM_ERR_INVALID_HEX_DIGIT, *str, number);
return false;
}
acc <<= 4;
if (hexchar > '9') {
acc+= hexchar - ('A' - 10);
} else {
acc += hexchar - '0';
}
str++;
}
*output_num = acc;
return true;
}
/*
* Evaluates a decimal string
* returns true if succeeded, false otherwise
*/
static bool conv_dec (const char* str, const char *end, int *output_num) {
int acc = 0;
const char *start = str;
while (str < end) {
acc *= 10;
if (!isdigit ((unsigned char) *str))
{
char number[256];
strncpy(number, start, end - start);
number[end - start] = '\0';
SetLastSPASMError(SPASM_ERR_INVALID_DECIMAL_DIGIT, *str, number);
return false;
}
acc += *str-'0';
str++;
}
*output_num = acc;
return true;
}
/*
* Evaluates a binary string
* returns true if succeeded, false otherwise
*/
static bool conv_bin (const char* str, const char *end, int *output_num) {
int acc = 0;
const char *start = str;
while (str < end) {
acc <<= 1;
if (!(*str == '0' || *str == '1'))
{
char number[256];
strncpy(number, start, end - start);
number[end - start] = '\0';
SetLastSPASMError(SPASM_ERR_INVALID_BINARY_DIGIT, *str, number);
return false;
}
if (*str == '1') acc++;
str++;
}
*output_num = acc;
return true;
}