[r46]: branches / macro_buffer_patch / gputils / gpasm / parse.c Maximize Restore History

Download this file

parse.c    1719 lines (1506 with data), 48.3 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
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
/* A Bison parser, made from parse.y
by GNU Bison version 1.28 */
#define YYBISON 1 /* Identify Bison output. */
#define LABEL 257
#define IDENTIFIER 258
#define CBLOCK 259
#define ENDC 260
#define FILL 261
#define NUMBER 262
#define STRING 263
#define HIGH 264
#define LOW 265
#define LSH 266
#define RSH 267
#define GREATER_EQUAL 268
#define LESS_EQUAL 269
#define EQUAL 270
#define NOT_EQUAL 271
#define LOGICAL_AND 272
#define LOGICAL_OR 273
#define ASSIGN_PLUS 274
#define ASSIGN_MINUS 275
#define ASSIGN_MULTIPLY 276
#define ASSIGN_DIVIDE 277
#define ASSIGN_MODULUS 278
#define ASSIGN_LSH 279
#define ASSIGN_RSH 280
#define ASSIGN_AND 281
#define ASSIGN_OR 282
#define ASSIGN_XOR 283
#define INCREMENT 284
#define DECREMENT 285
#define TBL_NO_CHANGE 286
#define TBL_POST_INC 287
#define TBL_POST_DEC 288
#define TBL_PRE_INC 289
#define CONCAT 290
#define VAR 291
#define VARLAB_BEGIN 292
#define VAR_BEGIN 293
#define VAR_END 294
#line 1 "parse.y"
/* Parser for gpasm
Copyright (C) 1998,1999,2000,2001 James Bowman, Craig Franklin
This file is part of gputils.
gputils is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
gputils is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with gputils; see the file COPYING. If not, write to
the Free Software Foundation, 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA. */
#include "stdhdr.h"
#include "gpasm.h"
#include "evaluate.h"
#include "gpsymbol.h"
#include "gperror.h"
#include "directive.h"
#include "lst.h"
#include "macro.h"
#include "scan.h"
void yyerror(char *message)
{
gperror(103, message);
}
int yylex(void);
extern int _16bit_core;
/************************************************************************/
/* Some simple functions for building parse trees */
static struct pnode *mk_pnode(enum pnode_tag tag)
{
struct pnode *new = malloc(sizeof(*new));
new->tag = tag;
return new;
}
struct pnode *mk_constant(int value)
{
struct pnode *new = mk_pnode(constant);
new->value.constant = value;
return new;
}
static struct pnode *mk_symbol(char *value)
{
struct pnode *new = mk_pnode(symbol);
new->value.symbol = value;
return new;
}
static struct pnode *mk_string(char *value)
{
struct pnode *new = mk_pnode(string);
new->value.string = value;
return new;
}
struct pnode *mk_list(struct pnode *head, struct pnode *tail)
{
struct pnode *new = mk_pnode(list);
new->value.list.head = head;
new->value.list.tail = tail;
return new;
}
static struct pnode *mk_2op(int op, struct pnode *p0, struct pnode *p1)
{
struct pnode *new = mk_pnode(binop);
new->value.binop.op = op;
new->value.binop.p0 = p0;
new->value.binop.p1 = p1;
return new;
}
static struct pnode *mk_1op(int op, struct pnode *p0)
{
struct pnode *new = mk_pnode(unop); new->value.unop.op = op;
new->value.unop.p0 = p0;
return new;
}
/************************************************************************/
/* shared functions */
gpasmVal set_label(char *label, struct pnode *parms)
{
gpasmVal value = 0;
if (asm_enabled()) {
value = do_or_append_insn("set", parms);
if (!state.mac_prev) {
set_global(label, value, TEMPORARY, gvt_constant);
} else {
state.mac_body->label = label;
}
}
return value;
}
int return_op(int operation)
{
/* returns an operator for the replacement of i+=1 with i=i+1*/
switch(operation) {
case ASSIGN_PLUS: return '+';
case ASSIGN_MINUS: return '-';
case ASSIGN_MULTIPLY: return '*';
case ASSIGN_DIVIDE: return '/';
case ASSIGN_MODULUS: return '%';
case ASSIGN_LSH: return LSH;
case ASSIGN_RSH: return RSH;
case ASSIGN_AND: return '&';
case ASSIGN_OR: return '|';
case ASSIGN_XOR: return '^';
default:
assert(0); /* Unhandled operator */
}
return 0;
}
void next_line(int value)
{
char l[BUFSIZ];
char *e = l;
if (state.src->type == macro) {
if ((state.lst.expand) && (state.lst.enabled) && (state.pass == 2)) {
lst_format_line(state.src->lst.m->src_line, value);
}
if (state.src->lst.m->next)
state.src->lst.m = state.src->lst.m->next;
} else if (state.src->lst.f != NULL) {
fgets(l, BUFSIZ, state.src->lst.f);
l[strlen(l) - 1] = '\0'; /* Eat the trailing newline */
if (state.mac_prev) {
state.lst.line.linetype = none;
if (state.mac_body)
state.mac_body->src_line = strdup(l);
}
if (state.lst.enabled && (state.pass == 2)) {
lst_format_line(e, value);
}
}
state.src->line_number++;
switch (state.next_state) {
case _exitmacro:
execute_exitm();
break;
case _macro:
/* push the label for local directive */
state.stTop = push_macro_symbol_table(state.stTop);
execute_macro(state.next_buffer.macro);
break;
case _include:
open_src(state.next_buffer.file, 1);
free(state.next_buffer.file);
break;
default:
break;
}
}
/************************************************************************/
#line 198 "parse.y"
typedef union {
gpasmVal i;
char *s;
struct pnode *p;
} YYSTYPE;
#ifndef YYDEBUG
#define YYDEBUG 1
#endif
#include <stdio.h>
#ifndef __cplusplus
#ifndef __STDC__
#define const
#endif
#endif
#define YYFINAL 152
#define YYFLAG -32768
#define YYNTBASE 60
#define YYTRANSLATE(x) ((unsigned)(x) <= 294 ? yytranslate[x] : 94)
static const char yytranslate[] = { 0,
2, 2, 2, 2, 2, 2, 2, 2, 2, 54,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 52, 2, 2, 58, 51, 20, 2, 59,
55, 49, 47, 56, 48, 2, 50, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 57, 2, 18,
25, 19, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 22, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 21, 2, 53, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 1, 3, 4, 5, 6,
7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
17, 23, 24, 26, 27, 28, 29, 30, 31, 32,
33, 34, 35, 36, 37, 38, 39, 40, 41, 42,
43, 44, 45, 46
};
#if YYDEBUG != 0
static const short yyprhs[] = { 0,
0, 1, 2, 6, 10, 15, 20, 24, 28, 31,
33, 35, 38, 42, 49, 57, 58, 66, 67, 74,
79, 80, 83, 85, 88, 91, 95, 97, 101, 103,
107, 109, 111, 113, 115, 117, 119, 121, 123, 125,
127, 129, 132, 136, 138, 140, 142, 146, 148, 150,
154, 156, 158, 162, 164, 166, 170, 172, 174, 176,
178, 182, 184, 186, 188, 190, 192, 194, 196, 200,
202, 204, 206, 210, 212, 214, 216, 220, 222, 224,
226, 228, 231, 233, 235, 237, 239, 241, 243, 245,
247, 249, 253, 255, 257, 259, 261, 263, 267, 271,
273, 277
};
static const short yyrhs[] = { -1,
0, 60, 61, 62, 0, 60, 1, 54, 0, 93,
70, 72, 54, 0, 93, 25, 72, 54, 0, 93,
37, 54, 0, 93, 36, 54, 0, 93, 63, 0,
63, 0, 54, 0, 4, 54, 0, 4, 71, 54,
0, 7, 4, 55, 56, 72, 54, 0, 7, 4,
71, 55, 56, 72, 54, 0, 0, 5, 72, 54,
64, 66, 6, 54, 0, 0, 5, 54, 65, 66,
6, 54, 0, 5, 1, 6, 54, 0, 0, 66,
67, 0, 54, 0, 68, 54, 0, 93, 54, 0,
93, 72, 54, 0, 69, 0, 68, 56, 69, 0,
92, 0, 92, 57, 72, 0, 26, 0, 27, 0,
28, 0, 29, 0, 30, 0, 31, 0, 32, 0,
33, 0, 34, 0, 35, 0, 72, 0, 72, 56,
0, 72, 56, 71, 0, 73, 0, 9, 0, 75,
0, 73, 74, 75, 0, 25, 0, 77, 0, 75,
76, 77, 0, 24, 0, 79, 0, 77, 78, 79,
0, 23, 0, 81, 0, 79, 80, 81, 0, 20,
0, 21, 0, 22, 0, 83, 0, 81, 82, 83,
0, 18, 0, 19, 0, 16, 0, 17, 0, 14,
0, 15, 0, 85, 0, 83, 84, 85, 0, 12,
0, 13, 0, 87, 0, 85, 86, 87, 0, 47,
0, 48, 0, 89, 0, 87, 88, 89, 0, 49,
0, 50, 0, 51, 0, 91, 0, 90, 91, 0,
10, 0, 11, 0, 48, 0, 52, 0, 53, 0,
47, 0, 92, 0, 8, 0, 58, 0, 59, 72,
55, 0, 49, 0, 39, 0, 40, 0, 41, 0,
4, 0, 45, 72, 55, 0, 45, 72, 46, 0,
3, 0, 44, 72, 55, 0, 44, 72, 46, 0
};
#endif
#if YYDEBUG != 0
static const short yyrline[] = { 0,
235, 237, 244, 244, 250, 262, 271, 280, 289, 347,
360, 369, 374, 379, 395, 411, 414, 418, 421, 425,
432, 433, 440, 442, 444, 449, 456, 458, 462, 467,
474, 474, 474, 474, 475, 475, 475, 475, 476, 476,
478, 483, 489, 496, 498, 518, 520, 527, 529, 531,
538, 540, 542, 549, 551, 553, 560, 560, 560, 562,
564, 571, 571, 571, 571, 571, 571, 573, 575, 582,
582, 584, 586, 593, 593, 595, 597, 604, 604, 604,
606, 608, 615, 615, 615, 615, 615, 615, 617, 622,
627, 632, 637, 642, 647, 652, 659, 664, 669, 677,
682, 690
};
#endif
#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
static const char * const yytname[] = { "$","error","$undefined.","LABEL",
"IDENTIFIER","CBLOCK","ENDC","FILL","NUMBER","STRING","HIGH","LOW","LSH","RSH",
"GREATER_EQUAL","LESS_EQUAL","EQUAL","NOT_EQUAL","'<'","'>'","'&'","'|'","'^'",
"LOGICAL_AND","LOGICAL_OR","'='","ASSIGN_PLUS","ASSIGN_MINUS","ASSIGN_MULTIPLY",
"ASSIGN_DIVIDE","ASSIGN_MODULUS","ASSIGN_LSH","ASSIGN_RSH","ASSIGN_AND","ASSIGN_OR",
"ASSIGN_XOR","INCREMENT","DECREMENT","TBL_NO_CHANGE","TBL_POST_INC","TBL_POST_DEC",
"TBL_PRE_INC","CONCAT","VAR","VARLAB_BEGIN","VAR_BEGIN","VAR_END","'+'","'-'",
"'*'","'/'","'%'","'!'","'~'","'\\n'","')'","','","':'","'$'","'('","program",
"@1","line","statement","@2","@3","const_block","const_line","const_def_list",
"const_def","assign_equal_ops","parameter_list","expr","e9","e9op","e8","e8op",
"e7","e7op","e6","e6op","e5","e5op","e4","e4op","e3","e3op","e2","e2op","e1",
"e1op","e0","cidentifier","label_concat", NULL
};
#endif
static const short yyr1[] = { 0,
60, 61, 60, 60, 62, 62, 62, 62, 62, 62,
63, 63, 63, 63, 63, 64, 63, 65, 63, 63,
66, 66, 67, 67, 67, 67, 68, 68, 69, 69,
70, 70, 70, 70, 70, 70, 70, 70, 70, 70,
71, 71, 71, 72, 72, 73, 73, 74, 75, 75,
76, 77, 77, 78, 79, 79, 80, 80, 80, 81,
81, 82, 82, 82, 82, 82, 82, 83, 83, 84,
84, 85, 85, 86, 86, 87, 87, 88, 88, 88,
89, 89, 90, 90, 90, 90, 90, 90, 91, 91,
91, 91, 91, 91, 91, 91, 92, 92, 92, 93,
93, 93
};
static const short yyr2[] = { 0,
0, 0, 3, 3, 4, 4, 3, 3, 2, 1,
1, 2, 3, 6, 7, 0, 7, 0, 6, 4,
0, 2, 1, 2, 2, 3, 1, 3, 1, 3,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 2, 3, 1, 1, 1, 3, 1, 1, 3,
1, 1, 3, 1, 1, 3, 1, 1, 1, 1,
3, 1, 1, 1, 1, 1, 1, 1, 3, 1,
1, 1, 3, 1, 1, 1, 3, 1, 1, 1,
1, 2, 1, 1, 1, 1, 1, 1, 1, 1,
1, 3, 1, 1, 1, 1, 1, 3, 3, 1,
3, 3
};
static const short yydefact[] = { 1,
0, 0, 0, 4, 100, 0, 0, 0, 0, 11,
3, 10, 0, 97, 90, 45, 83, 84, 94, 95,
96, 0, 88, 85, 93, 86, 87, 12, 91, 0,
0, 41, 44, 46, 49, 52, 55, 60, 68, 72,
76, 0, 81, 89, 0, 18, 0, 0, 0, 0,
31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
0, 0, 9, 0, 0, 0, 13, 42, 48, 0,
51, 0, 54, 0, 57, 58, 59, 0, 66, 67,
64, 65, 62, 63, 0, 70, 71, 0, 74, 75,
0, 78, 79, 80, 0, 82, 0, 21, 16, 0,
0, 102, 101, 0, 8, 7, 0, 99, 98, 92,
43, 47, 50, 53, 56, 61, 69, 73, 77, 20,
0, 21, 0, 0, 6, 5, 0, 23, 22, 0,
27, 29, 0, 0, 0, 0, 19, 24, 0, 0,
25, 0, 0, 14, 0, 28, 30, 26, 17, 15,
0, 0
};
static const short yydefgoto[] = { 1,
3, 11, 12, 122, 98, 121, 129, 130, 131, 64,
31, 32, 33, 70, 34, 72, 35, 74, 36, 78,
37, 85, 38, 88, 39, 91, 40, 95, 41, 42,
43, 44, 133
};
static const short yypact[] = {-32768,
96, -21, 184,-32768,-32768, 21, 0, 30, 156,-32768,
-32768,-32768, 229,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768, 156,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 156,
-8, -6, 26, 31, 44, 43, 3, 15, -35, 33,
-32768, 186,-32768,-32768, 50,-32768, 17, 83, -41, 156,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
18, 24,-32768, 156, -39, 40,-32768, 156,-32768, 171,
-32768, 171,-32768, 171,-32768,-32768,-32768, 171,-32768,-32768,
-32768,-32768,-32768,-32768, 171,-32768,-32768, 171,-32768,-32768,
171,-32768,-32768,-32768, 171,-32768, 27,-32768,-32768, 29,
47,-32768,-32768, 35,-32768,-32768, 51,-32768,-32768,-32768,
-32768, 31, 44, 43, 3, 15, -35, 33,-32768,-32768,
32,-32768, 156, 42,-32768,-32768, 52,-32768,-32768, 34,
-32768, 53, 104, 196, 55, 156,-32768,-32768, -1, 156,
-32768, 57, 63,-32768, 64,-32768,-32768,-32768,-32768,-32768,
107,-32768
};
static const short yypgoto[] = {-32768,
-32768,-32768, 91,-32768,-32768, -3,-32768,-32768, -19,-32768,
-42, -7,-32768,-32768, 67,-32768, 49,-32768, 60,-32768,
61,-32768, 62,-32768, 37,-32768, 36,-32768, 59,-32768,
106, -97, 143
};
#define YYLAST 283
static const short yytable[] = { 47,
45, 49, 14, 14, 102, 101, 108, 15, 16, 17,
18, 89, 90, 103, 65, 109, 79, 80, 81, 82,
83, 84, 66, 132, 14, 111, 86, 87, 15, 16,
17, 18, 4, 48, 5, 14, 132, 127, 19, 20,
21, 132, 104, 22, 22, 67, 23, 24, 25, 68,
69, 26, 27, 46, 71, 97, 107, 29, 30, 19,
20, 21, 75, 76, 77, 22, 73, 23, 24, 25,
99, 105, 26, 27, 28, 9, 22, 106, 29, 30,
120, 92, 93, 94, 123, 128, 14, 138, 125, 139,
15, 16, 17, 18, 110, 151, 2, 136, -2, -2,
-2, 124, -2, 63, 126, 137, 152, 14, 144, 140,
148, 15, 16, 17, 18, 135, 149, 150, 134, 146,
113, 19, 20, 21, 117, 142, 118, 22, 145, 23,
24, 25, 147, 114, 26, 27, 112, 100, 115, -2,
29, 30, 19, 20, 21, 13, 116, 96, 22, -2,
23, 24, 25, 119, 0, 26, 27, 141, 0, 14,
0, 29, 30, 15, 16, 17, 18, 0, 0, 0,
0, 0, 0, 0, 14, 0, 0, 0, 15, 0,
17, 18, 0, 0, 0, 0, 5, 6, 7, 14,
8, 0, 0, 15, 19, 20, 21, 0, 5, 14,
22, 143, 23, 24, 25, 0, 0, 26, 27, 19,
20, 21, 0, 29, 30, 22, 0, 23, 24, 25,
0, 0, 26, 27, 19, 20, 21, 9, 29, 30,
22, 0, 6, 7, 25, 8, 0, 10, 0, 9,
22, 0, 0, 29, 30, 0, 0, 0, 0, 128,
0, 0, 0, 50, 51, 52, 53, 54, 55, 56,
57, 58, 59, 60, 61, 62, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 10
};
static const short yycheck[] = { 7,
1, 9, 4, 4, 46, 48, 46, 8, 9, 10,
11, 47, 48, 55, 22, 55, 14, 15, 16, 17,
18, 19, 30, 121, 4, 68, 12, 13, 8, 9,
10, 11, 54, 4, 3, 4, 134, 6, 39, 40,
41, 139, 50, 45, 45, 54, 47, 48, 49, 56,
25, 52, 53, 54, 24, 6, 64, 58, 59, 39,
40, 41, 20, 21, 22, 45, 23, 47, 48, 49,
54, 54, 52, 53, 54, 44, 45, 54, 58, 59,
54, 49, 50, 51, 56, 54, 4, 54, 54, 56,
8, 9, 10, 11, 55, 0, 1, 56, 3, 4,
5, 55, 7, 13, 54, 54, 0, 4, 54, 57,
54, 8, 9, 10, 11, 123, 54, 54, 122, 139,
72, 39, 40, 41, 88, 133, 91, 45, 136, 47,
48, 49, 140, 74, 52, 53, 70, 55, 78, 44,
58, 59, 39, 40, 41, 3, 85, 42, 45, 54,
47, 48, 49, 95, -1, 52, 53, 54, -1, 4,
-1, 58, 59, 8, 9, 10, 11, -1, -1, -1,
-1, -1, -1, -1, 4, -1, -1, -1, 8, -1,
10, 11, -1, -1, -1, -1, 3, 4, 5, 4,
7, -1, -1, 8, 39, 40, 41, -1, 3, 4,
45, 6, 47, 48, 49, -1, -1, 52, 53, 39,
40, 41, -1, 58, 59, 45, -1, 47, 48, 49,
-1, -1, 52, 53, 39, 40, 41, 44, 58, 59,
45, -1, 4, 5, 49, 7, -1, 54, -1, 44,
45, -1, -1, 58, 59, -1, -1, -1, -1, 54,
-1, -1, -1, 25, 26, 27, 28, 29, 30, 31,
32, 33, 34, 35, 36, 37, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, 54
};
/* -*-C-*- Note some compilers choke on comments on `#line' lines. */
#line 3 "/usr/lib/bison.simple"
/* This file comes from bison-1.28. */
/* Skeleton output parser for bison,
Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA. */
/* As a special exception, when this file is copied by Bison into a
Bison output file, you may use that output file without restriction.
This special exception was added by the Free Software Foundation
in version 1.24 of Bison. */
/* This is the parser code that is written into each bison parser
when the %semantic_parser declaration is not specified in the grammar.
It was written by Richard Stallman by simplifying the hairy parser
used when %semantic_parser is specified. */
#ifndef YYSTACK_USE_ALLOCA
#ifdef alloca
#define YYSTACK_USE_ALLOCA
#else /* alloca not defined */
#ifdef __GNUC__
#define YYSTACK_USE_ALLOCA
#define alloca __builtin_alloca
#else /* not GNU C. */
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386))
#define YYSTACK_USE_ALLOCA
#include <alloca.h>
#else /* not sparc */
/* We think this test detects Watcom and Microsoft C. */
/* This used to test MSDOS, but that is a bad idea
since that symbol is in the user namespace. */
#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__)
#if 0 /* No need for malloc.h, which pollutes the namespace;
instead, just don't use alloca. */
#include <malloc.h>
#endif
#else /* not MSDOS, or __TURBOC__ */
#if defined(_AIX)
/* I don't know what this was needed for, but it pollutes the namespace.
So I turned it off. rms, 2 May 1997. */
/* #include <malloc.h> */
#pragma alloca
#define YYSTACK_USE_ALLOCA
#else /* not MSDOS, or __TURBOC__, or _AIX */
#if 0
#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up,
and on HPUX 10. Eventually we can turn this on. */
#define YYSTACK_USE_ALLOCA
#define alloca __builtin_alloca
#endif /* __hpux */
#endif
#endif /* not _AIX */
#endif /* not MSDOS, or __TURBOC__ */
#endif /* not sparc */
#endif /* not GNU C */
#endif /* alloca not defined */
#endif /* YYSTACK_USE_ALLOCA not defined */
#ifdef YYSTACK_USE_ALLOCA
#define YYSTACK_ALLOC alloca
#else
#define YYSTACK_ALLOC malloc
#endif
/* Note: there must be only one dollar sign in this file.
It is replaced by the list of actions, each action
as one case of the switch. */
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY -2
#define YYEOF 0
#define YYACCEPT goto yyacceptlab
#define YYABORT goto yyabortlab
#define YYERROR goto yyerrlab1
/* Like YYERROR except do call yyerror.
This remains here temporarily to ease the
transition to the new meaning of YYERROR, for GCC.
Once GCC version 2 has supplanted version 1, this can go. */
#define YYFAIL goto yyerrlab
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(token, value) \
do \
if (yychar == YYEMPTY && yylen == 1) \
{ yychar = (token), yylval = (value); \
yychar1 = YYTRANSLATE (yychar); \
YYPOPSTACK; \
goto yybackup; \
} \
else \
{ yyerror ("syntax error: cannot back up"); YYERROR; } \
while (0)
#define YYTERROR 1
#define YYERRCODE 256
#ifndef YYPURE
#define YYLEX yylex()
#endif
#ifdef YYPURE
#ifdef YYLSP_NEEDED
#ifdef YYLEX_PARAM
#define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM)
#else
#define YYLEX yylex(&yylval, &yylloc)
#endif
#else /* not YYLSP_NEEDED */
#ifdef YYLEX_PARAM
#define YYLEX yylex(&yylval, YYLEX_PARAM)
#else
#define YYLEX yylex(&yylval)
#endif
#endif /* not YYLSP_NEEDED */
#endif
/* If nonreentrant, generate the variables here */
#ifndef YYPURE
int yychar; /* the lookahead symbol */
YYSTYPE yylval; /* the semantic value of the */
/* lookahead symbol */
#ifdef YYLSP_NEEDED
YYLTYPE yylloc; /* location data for the lookahead */
/* symbol */
#endif
int yynerrs; /* number of parse errors so far */
#endif /* not YYPURE */
#if YYDEBUG != 0
int yydebug; /* nonzero means print parse trace */
/* Since this is uninitialized, it does not stop multiple parsers
from coexisting. */
#endif
/* YYINITDEPTH indicates the initial size of the parser's stacks */
#ifndef YYINITDEPTH
#define YYINITDEPTH 200
#endif
/* YYMAXDEPTH is the maximum size the stacks can grow to
(effective only if the built-in stack extension method is used). */
#if YYMAXDEPTH == 0
#undef YYMAXDEPTH
#endif
#ifndef YYMAXDEPTH
#define YYMAXDEPTH 10000
#endif
/* Define __yy_memcpy. Note that the size argument
should be passed with type unsigned int, because that is what the non-GCC
definitions require. With GCC, __builtin_memcpy takes an arg
of type size_t, but it can handle unsigned int. */
#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */
#define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT)
#else /* not GNU C or C++ */
#ifndef __cplusplus
/* This is the most reliable way to avoid incompatibilities
in available built-in functions on various systems. */
static void
__yy_memcpy (to, from, count)
char *to;
char *from;
unsigned int count;
{
register char *f = from;
register char *t = to;
register int i = count;
while (i-- > 0)
*t++ = *f++;
}
#else /* __cplusplus */
/* This is the most reliable way to avoid incompatibilities
in available built-in functions on various systems. */
static void
__yy_memcpy (char *to, char *from, unsigned int count)
{
register char *t = to;
register char *f = from;
register int i = count;
while (i-- > 0)
*t++ = *f++;
}
#endif
#endif
#line 217 "/usr/lib/bison.simple"
/* The user can define YYPARSE_PARAM as the name of an argument to be passed
into yyparse. The argument should have type void *.
It should actually point to an object.
Grammar actions can access the variable by casting it
to the proper pointer type. */
#ifdef YYPARSE_PARAM
#ifdef __cplusplus
#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
#define YYPARSE_PARAM_DECL
#else /* not __cplusplus */
#define YYPARSE_PARAM_ARG YYPARSE_PARAM
#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
#endif /* not __cplusplus */
#else /* not YYPARSE_PARAM */
#define YYPARSE_PARAM_ARG
#define YYPARSE_PARAM_DECL
#endif /* not YYPARSE_PARAM */
/* Prevent warning if -Wstrict-prototypes. */
#ifdef __GNUC__
#ifdef YYPARSE_PARAM
int yyparse (void *);
#else
int yyparse (void);
#endif
#endif
int
yyparse(YYPARSE_PARAM_ARG)
YYPARSE_PARAM_DECL
{
register int yystate;
register int yyn;
register short *yyssp;
register YYSTYPE *yyvsp;
int yyerrstatus; /* number of tokens to shift before error messages enabled */
int yychar1 = 0; /* lookahead token as an internal (translated) token number */
short yyssa[YYINITDEPTH]; /* the state stack */
YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */
short *yyss = yyssa; /* refer to the stacks thru separate pointers */
YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */
#ifdef YYLSP_NEEDED
YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */
YYLTYPE *yyls = yylsa;
YYLTYPE *yylsp;
#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
#else
#define YYPOPSTACK (yyvsp--, yyssp--)
#endif
int yystacksize = YYINITDEPTH;
int yyfree_stacks = 0;
#ifdef YYPURE
int yychar;
YYSTYPE yylval;
int yynerrs;
#ifdef YYLSP_NEEDED
YYLTYPE yylloc;
#endif
#endif
YYSTYPE yyval; /* the variable used to return */
/* semantic values from the action */
/* routines */
int yylen;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Starting parse\n");
#endif
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
/* Initialize stack pointers.
Waste one element of value and location stack
so that they stay on the same level as the state stack.
The wasted elements are never initialized. */
yyssp = yyss - 1;
yyvsp = yyvs;
#ifdef YYLSP_NEEDED
yylsp = yyls;
#endif
/* Push a new state, which is found in yystate . */
/* In all cases, when you get here, the value and location stacks
have just been pushed. so pushing a state here evens the stacks. */
yynewstate:
*++yyssp = yystate;
if (yyssp >= yyss + yystacksize - 1)
{
/* Give user a chance to reallocate the stack */
/* Use copies of these so that the &'s don't force the real ones into memory. */
YYSTYPE *yyvs1 = yyvs;
short *yyss1 = yyss;
#ifdef YYLSP_NEEDED
YYLTYPE *yyls1 = yyls;
#endif
/* Get the current used size of the three stacks, in elements. */
int size = yyssp - yyss + 1;
#ifdef yyoverflow
/* Each stack pointer address is followed by the size of
the data in use in that stack, in bytes. */
#ifdef YYLSP_NEEDED
/* This used to be a conditional around just the two extra args,
but that might be undefined if yyoverflow is a macro. */
yyoverflow("parser stack overflow",
&yyss1, size * sizeof (*yyssp),
&yyvs1, size * sizeof (*yyvsp),
&yyls1, size * sizeof (*yylsp),
&yystacksize);
#else
yyoverflow("parser stack overflow",
&yyss1, size * sizeof (*yyssp),
&yyvs1, size * sizeof (*yyvsp),
&yystacksize);
#endif
yyss = yyss1; yyvs = yyvs1;
#ifdef YYLSP_NEEDED
yyls = yyls1;
#endif
#else /* no yyoverflow */
/* Extend the stack our own way. */
if (yystacksize >= YYMAXDEPTH)
{
yyerror("parser stack overflow");
if (yyfree_stacks)
{
free (yyss);
free (yyvs);
#ifdef YYLSP_NEEDED
free (yyls);
#endif
}
return 2;
}
yystacksize *= 2;
if (yystacksize > YYMAXDEPTH)
yystacksize = YYMAXDEPTH;
#ifndef YYSTACK_USE_ALLOCA
yyfree_stacks = 1;
#endif
yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp));
__yy_memcpy ((char *)yyss, (char *)yyss1,
size * (unsigned int) sizeof (*yyssp));
yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp));
__yy_memcpy ((char *)yyvs, (char *)yyvs1,
size * (unsigned int) sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp));
__yy_memcpy ((char *)yyls, (char *)yyls1,
size * (unsigned int) sizeof (*yylsp));
#endif
#endif /* no yyoverflow */
yyssp = yyss + size - 1;
yyvsp = yyvs + size - 1;
#ifdef YYLSP_NEEDED
yylsp = yyls + size - 1;
#endif
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Stack size increased to %d\n", yystacksize);
#endif
if (yyssp >= yyss + yystacksize - 1)
YYABORT;
}
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Entering state %d\n", yystate);
#endif
goto yybackup;
yybackup:
/* Do appropriate processing given the current state. */
/* Read a lookahead token if we need one and don't already have one. */
/* yyresume: */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* yychar is either YYEMPTY or YYEOF
or a valid token in external form. */
if (yychar == YYEMPTY)
{
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Reading a token: ");
#endif
yychar = YYLEX;
}
/* Convert token to internal form (in yychar1) for indexing tables with */
if (yychar <= 0) /* This means end of input. */
{
yychar1 = 0;
yychar = YYEOF; /* Don't call YYLEX any more */
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Now at end of input.\n");
#endif
}
else
{
yychar1 = YYTRANSLATE(yychar);
#if YYDEBUG != 0
if (yydebug)
{
fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
/* Give the individual parser a way to print the precise meaning
of a token, for further debugging info. */
#ifdef YYPRINT
YYPRINT (stderr, yychar, yylval);
#endif
fprintf (stderr, ")\n");
}
#endif
}
yyn += yychar1;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
goto yydefault;
yyn = yytable[yyn];
/* yyn is what to do for this token type in this state.
Negative => reduce, -yyn is rule number.
Positive => shift, yyn is new state.
New state is final state => don't bother to shift,
just return success.
0, or most negative number => error. */
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrlab;
if (yyn == YYFINAL)
YYACCEPT;
/* Shift the lookahead token. */
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
#endif
/* Discard the token being shifted unless it is eof. */
if (yychar != YYEOF)
yychar = YYEMPTY;
*++yyvsp = yylval;
#ifdef YYLSP_NEEDED
*++yylsp = yylloc;
#endif
/* count tokens shifted since error; after three, turn off error status. */
if (yyerrstatus) yyerrstatus--;
yystate = yyn;
goto yynewstate;
/* Do the default action for the current state. */
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
/* Do a reduction. yyn is the number of a rule to reduce with. */
yyreduce:
yylen = yyr2[yyn];
if (yylen > 0)
yyval = yyvsp[1-yylen]; /* implement default value of the action */
#if YYDEBUG != 0
if (yydebug)
{
int i;
fprintf (stderr, "Reducing via rule %d (line %d), ",
yyn, yyrline[yyn]);
/* Print the symbols being reduced, and their result. */
for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
fprintf (stderr, "%s ", yytname[yyrhs[i]]);
fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
}
#endif
switch (yyn) {
case 2:
#line 239 "parse.y"
{
state.lst.line.was_org = state.org;
state.lst.line.linetype = none;
state.next_state = _nochange;
;
break;}
case 4:
#line 245 "parse.y"
{
next_line(0);
;
break;}
case 5:
#line 252 "parse.y"
{
struct pnode *parms;
int exp_result;
exp_result = do_or_append_insn("set", mk_list(yyvsp[-1].p, NULL));
parms = mk_list(mk_2op(return_op(yyvsp[-2].i),
mk_symbol(yyvsp[-3].s),
mk_constant(exp_result)), NULL);
next_line(set_label(yyvsp[-3].s, parms));
;
break;}
case 6:
#line 264 "parse.y"
{
struct pnode *parms;
/* implements i = 6 + 1 */
parms = mk_list(yyvsp[-1].p, NULL);
next_line(set_label(yyvsp[-3].s, parms));
;
break;}
case 7:
#line 273 "parse.y"
{
struct pnode *parms;
/* implements i-- */
parms = mk_list(mk_1op(DECREMENT, mk_symbol(yyvsp[-2].s)), NULL);
next_line(set_label(yyvsp[-2].s, parms));
;
break;}
case 8:
#line 282 "parse.y"
{
struct pnode *parms;
/* implements i++ */
parms = mk_list(mk_1op(INCREMENT, mk_symbol(yyvsp[-2].s)), NULL);
next_line(set_label(yyvsp[-2].s, parms));
;
break;}
case 9:
#line 291 "parse.y"
{
if (state.lst.line.linetype == none)
state.lst.line.linetype = insn;
if (asm_enabled()) {
if (state.mac_head) {
/* This is a macro definition. Set it up */
struct symbol *mac;
struct macro_head *h = NULL;
mac = get_symbol(state.stMacros, yyvsp[-1].s);
if (mac)
h = get_symbol_annotation(mac);
/* It's not an error if macro was defined on pass 1 and
we're in pass 2. */
if (h &&
!((h->pass == 1) && (state.pass == 2))) {
gperror(GPE_DUPLICATE_MACRO, NULL);
} else {
if (!mac)
mac = add_symbol(state.stMacros, yyvsp[-1].s);
annotate_symbol(mac, state.mac_head);
h = state.mac_head;
h->line_number = state.src->line_number;
}
h->pass = state.pass;
state.mac_head = NULL;
} else if (!state.mac_prev) {
/* Outside a macro, just define the label. */
switch (state.lst.line.linetype) {
case set:
set_global(yyvsp[-1].s, yyvsp[0].i, TEMPORARY, gvt_constant);
break;
case org:
case equ:
set_global(yyvsp[-1].s, yyvsp[0].i, PERMANENT, gvt_constant);
break;
case insn:
set_global(yyvsp[-1].s, yyvsp[0].i << _16bit_core, PERMANENT, gvt_address);
break;
case dir:
gperror(GPE_ILLEGAL_LABEL, NULL);
break;
default:
break;
}
} else {
/* Inside a macro; add the label to the current line */
if (state.mac_body)
state.mac_body->label = yyvsp[-1].s;
}
}
next_line(yyvsp[0].i);
;
break;}
case 10:
#line 349 "parse.y"
{
if (state.mac_head) {
/* This is a macro definition, but the label was missing */
state.mac_head = NULL;
gperror(GPE_NO_MACRO_NAME, NULL);
} else {
next_line(0);
}
;
break;}
case 11:
#line 362 "parse.y"
{
if (!state.mac_prev) {
yyval.i = state.org;
} else {
macro_append();
}
;
break;}
case 12:
#line 371 "parse.y"
{
yyval.i = do_or_append_insn(yyvsp[-1].s, NULL);
;
break;}
case 13:
#line 376 "parse.y"
{
yyval.i = do_or_append_insn(yyvsp[-2].s, yyvsp[-1].p);
;
break;}
case 14:
#line 381 "parse.y"
{
int number;
int i;
if (!state.mac_prev) {
number = eval_fill_number(yyvsp[-1].p);
for (i = 0; i < number; i++) {
yyval.i = do_insn(yyvsp[-4].s, NULL);
}
} else {
macro_append();
}
;
break;}
case 15:
#line 397 "parse.y"
{
int number;
int i;
if (!state.mac_prev) {
number = eval_fill_number(yyvsp[-1].p);
for (i = 0; i < number; i++) {
yyval.i = do_insn(yyvsp[-5].s, yyvsp[-4].p);
}
} else {
macro_append();
}
;
break;}
case 16:
#line 412 "parse.y"
{ begin_cblock(yyvsp[-1].p); next_line(0); ;
break;}
case 17:
#line 415 "parse.y"
{
yyval.i = 0;
;
break;}
case 18:
#line 419 "parse.y"
{ next_line(0); ;
break;}
case 19:
#line 422 "parse.y"
{
yyval.i = 0;
;
break;}
case 20:
#line 427 "parse.y"
{
yyval.i = 0;
;
break;}
case 22:
#line 435 "parse.y"
{
next_line(0);
;
break;}
case 25:
#line 446 "parse.y"
{
cblock_expr(mk_symbol(yyvsp[-1].s));
;
break;}
case 26:
#line 451 "parse.y"
{
cblock_expr_incr(mk_symbol(yyvsp[-2].s), yyvsp[-1].p);
;
break;}
case 29:
#line 464 "parse.y"
{
cblock_expr(yyvsp[0].p);
;
break;}
case 30:
#line 469 "parse.y"
{
cblock_expr_incr(yyvsp[-2].p, yyvsp[0].p);
;
break;}
case 41:
#line 480 "parse.y"
{
yyval.p = mk_list(yyvsp[0].p, NULL);
;
break;}
case 42:
#line 485 "parse.y"
{
gperror(GPE_BADCHAR, "Illegal Character (,)");
yyval.p = mk_list(yyvsp[-1].p, NULL);
;
break;}
case 43:
#line 491 "parse.y"
{
yyval.p = mk_list(yyvsp[-2].p, yyvsp[0].p);
;
break;}
case 45:
#line 500 "parse.y"
{
/* Cook up the string, replacing \X with its code. */
char *ps, *pd;
ps = pd = yyvsp[0].s;
while (*ps) {
if (*ps != '\\') {
*pd++ = *ps++;
} else {
*pd++ = gpasm_magic(ps);
ps += 2;
}
}
*pd = 0;
yyval.p = mk_string(yyvsp[0].s);
;
break;}
case 47:
#line 522 "parse.y"
{
yyval.p = mk_2op(yyvsp[-1].i, yyvsp[-2].p, yyvsp[0].p);
;
break;}
case 50:
#line 533 "parse.y"
{
yyval.p = mk_2op(yyvsp[-1].i, yyvsp[-2].p, yyvsp[0].p);
;
break;}
case 53:
#line 544 "parse.y"
{
yyval.p = mk_2op(yyvsp[-1].i, yyvsp[-2].p, yyvsp[0].p);
;
break;}
case 56:
#line 555 "parse.y"
{
yyval.p = mk_2op(yyvsp[-1].i, yyvsp[-2].p, yyvsp[0].p);
;
break;}
case 61:
#line 566 "parse.y"
{
yyval.p = mk_2op(yyvsp[-1].i, yyvsp[-2].p, yyvsp[0].p);
;
break;}
case 69:
#line 577 "parse.y"
{
yyval.p = mk_2op(yyvsp[-1].i, yyvsp[-2].p, yyvsp[0].p);
;
break;}
case 73:
#line 588 "parse.y"
{
yyval.p = mk_2op(yyvsp[-1].i, yyvsp[-2].p, yyvsp[0].p);
;
break;}
case 77:
#line 599 "parse.y"
{
yyval.p = mk_2op(yyvsp[-1].i, yyvsp[-2].p, yyvsp[0].p);
;
break;}
case 82:
#line 610 "parse.y"
{
yyval.p = mk_1op(yyvsp[-1].i, yyvsp[0].p);
;
break;}
case 89:
#line 619 "parse.y"
{
yyval.p = yyvsp[0].p;
;
break;}
case 90:
#line 624 "parse.y"
{
yyval.p = mk_constant(yyvsp[0].i);
;
break;}
case 91:
#line 629 "parse.y"
{
yyval.p = mk_symbol("$");
;
break;}
case 92:
#line 634 "parse.y"
{
yyval.p = yyvsp[-1].p;
;
break;}
case 93:
#line 639 "parse.y"
{
yyval.p = mk_constant(TBL_NO_CHANGE);
;
break;}
case 94:
#line 644 "parse.y"
{
yyval.p = mk_constant(yyvsp[0].i);
;
break;}
case 95:
#line 649 "parse.y"
{
yyval.p = mk_constant(yyvsp[0].i);
;
break;}
case 96:
#line 654 "parse.y"
{
yyval.p = mk_constant(yyvsp[0].i);
;
break;}
case 97:
#line 661 "parse.y"
{
yyval.p = mk_symbol(yyvsp[0].s);
;
break;}
case 98:
#line 666 "parse.y"
{
yyval.p = mk_2op(CONCAT, mk_symbol(yyvsp[-2].s), mk_1op(VAR, yyvsp[-1].p));
;
break;}
case 99:
#line 671 "parse.y"
{
yyval.p = mk_2op(CONCAT, mk_symbol(yyvsp[-2].s),
mk_2op(CONCAT, mk_1op(VAR, yyvsp[-1].p), mk_symbol(yyvsp[0].s)));
;
break;}
case 100:
#line 679 "parse.y"
{
yyval.s = yyvsp[0].s;
;
break;}
case 101:
#line 684 "parse.y"
{
if (!state.mac_prev) {
yyval.s = evaluate_concatenation(mk_2op(CONCAT, mk_symbol(yyvsp[-2].s),
mk_1op(VAR, yyvsp[-1].p)));
}
;
break;}
case 102:
#line 692 "parse.y"
{
if (!state.mac_prev) {
yyval.s = evaluate_concatenation(mk_2op(CONCAT, mk_symbol(yyvsp[-2].s),
mk_2op(CONCAT, mk_1op(VAR, yyvsp[-1].p), mk_symbol(yyvsp[0].s))));
}
;
break;}
}
/* the action file gets copied in in place of this dollarsign */
#line 543 "/usr/lib/bison.simple"
yyvsp -= yylen;
yyssp -= yylen;
#ifdef YYLSP_NEEDED
yylsp -= yylen;
#endif
#if YYDEBUG != 0
if (yydebug)
{
short *ssp1 = yyss - 1;
fprintf (stderr, "state stack now");
while (ssp1 != yyssp)
fprintf (stderr, " %d", *++ssp1);
fprintf (stderr, "\n");
}
#endif
*++yyvsp = yyval;
#ifdef YYLSP_NEEDED
yylsp++;
if (yylen == 0)
{
yylsp->first_line = yylloc.first_line;
yylsp->first_column = yylloc.first_column;
yylsp->last_line = (yylsp-1)->last_line;
yylsp->last_column = (yylsp-1)->last_column;
yylsp->text = 0;
}
else
{
yylsp->last_line = (yylsp+yylen-1)->last_line;
yylsp->last_column = (yylsp+yylen-1)->last_column;
}
#endif
/* Now "shift" the result of the reduction.
Determine what state that goes to,
based on the state we popped back to
and the rule number reduced by. */
yyn = yyr1[yyn];
yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTBASE];
goto yynewstate;
yyerrlab: /* here on detecting error */
if (! yyerrstatus)
/* If not already recovering from an error, report this error. */
{
++yynerrs;
#ifdef YYERROR_VERBOSE
yyn = yypact[yystate];
if (yyn > YYFLAG && yyn < YYLAST)
{
int size = 0;
char *msg;
int x, count;
count = 0;
/* Start X at -yyn if nec to avoid negative indexes in yycheck. */
for (x = (yyn < 0 ? -yyn : 0);
x < (sizeof(yytname) / sizeof(char *)); x++)
if (yycheck[x + yyn] == x)
size += strlen(yytname[x]) + 15, count++;
msg = (char *) malloc(size + 15);
if (msg != 0)
{
strcpy(msg, "parse error");
if (count < 5)
{
count = 0;
for (x = (yyn < 0 ? -yyn : 0);
x < (sizeof(yytname) / sizeof(char *)); x++)
if (yycheck[x + yyn] == x)
{
strcat(msg, count == 0 ? ", expecting `" : " or `");
strcat(msg, yytname[x]);
strcat(msg, "'");
count++;
}
}
yyerror(msg);
free(msg);
}
else
yyerror ("parse error; also virtual memory exceeded");
}
else
#endif /* YYERROR_VERBOSE */
yyerror("parse error");
}
goto yyerrlab1;
yyerrlab1: /* here on error raised explicitly by an action */
if (yyerrstatus == 3)
{
/* if just tried and failed to reuse lookahead token after an error, discard it. */
/* return failure if at end of input */
if (yychar == YYEOF)
YYABORT;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
#endif
yychar = YYEMPTY;
}
/* Else will try to reuse lookahead token
after shifting the error token. */
yyerrstatus = 3; /* Each real token shifted decrements this */
goto yyerrhandle;
yyerrdefault: /* current state does not do anything special for the error token. */
#if 0
/* This is wrong; only states that explicitly want error tokens
should shift them. */
yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/
if (yyn) goto yydefault;
#endif
yyerrpop: /* pop the current state because it cannot handle the error token */
if (yyssp == yyss) YYABORT;
yyvsp--;
yystate = *--yyssp;
#ifdef YYLSP_NEEDED
yylsp--;
#endif
#if YYDEBUG != 0
if (yydebug)
{
short *ssp1 = yyss - 1;
fprintf (stderr, "Error: state stack now");
while (ssp1 != yyssp)
fprintf (stderr, " %d", *++ssp1);
fprintf (stderr, "\n");
}
#endif
yyerrhandle:
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yyerrdefault;
yyn += YYTERROR;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
goto yyerrdefault;
yyn = yytable[yyn];
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrpop;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrpop;
if (yyn == YYFINAL)
YYACCEPT;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Shifting error token, ");
#endif
*++yyvsp = yylval;
#ifdef YYLSP_NEEDED
*++yylsp = yylloc;
#endif
yystate = yyn;
goto yynewstate;
yyacceptlab:
/* YYACCEPT comes here. */
if (yyfree_stacks)
{
free (yyss);
free (yyvs);
#ifdef YYLSP_NEEDED
free (yyls);
#endif
}
return 0;
yyabortlab:
/* YYABORT comes here. */
if (yyfree_stacks)
{
free (yyss);
free (yyvs);
#ifdef YYLSP_NEEDED
free (yyls);
#endif
}
return 1;
}
#line 700 "parse.y"