-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathreport.c
1583 lines (1500 loc) · 42.6 KB
/
report.c
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 "action.h"
#include "acttab.h"
#include "config.h"
#include "error.h"
#include "parse.h"
#include "set.h"
#include "lemon.h"
#include "rule.h"
#include "state.h"
#include "string.h"
#include "symbol.h"
#include <assert.h>
#include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#ifdef __WIN32__
#ifdef __cplusplus
extern "C" {
#endif
extern int access(const char *path, int mode);
#ifdef __cplusplus
}
#endif
#else
#include <unistd.h>
#endif
#define LINESIZE 1000
#define NO_OFFSET (-2147483647)
// TODO: move
extern int showPrecedenceConflict;
extern char *user_templatename;
/* Generate a filename with the given suffix. Space to hold the
* name comes from malloc() and must be freed by the calling
* function.
*/
static char *
file_makename(struct lemon *lemp, const char *suffix) {
char *name;
char *cp;
name = (char *)malloc(strlen(lemp->filename) + strlen(suffix) + 5);
MemoryCheck(name);
strcpy(name, lemp->filename);
cp = strrchr(name, '.');
if (cp)
*cp = 0;
strcat(name, suffix);
return name;
}
/* Open a file with a name based on the name of the input file,
* but with a different (specified) suffix, and return a pointer
* to the stream
*/
static FILE *
file_open(struct lemon *lemp, const char *suffix, const char *mode) {
FILE *fp;
if (lemp->outname)
free(lemp->outname);
lemp->outname = file_makename(lemp, suffix);
fp = fopen(lemp->outname, mode);
if (fp == 0 && *mode == 'w') {
lprintf(LERROR, "Can't open file \"%s\".", lemp->outname);
lemp->errorcnt++;
return 0;
}
return fp;
}
/* Duplicate the input file without comments and without actions
* on rules
*/
void
Reprint(struct lemon *lemp) {
struct rule_list *rp;
struct symbol *sp;
int i, j, maxlen, len, ncolumns, skip;
printf("// Reprint of input file \"%s\".\n// Symbols:\n", lemp->filename);
maxlen = 10;
for (i = 0; i < lemp->nsymbol; i++) {
sp = lemp->symbols[i];
len = strlen(sp->name);
if (len > maxlen)
maxlen = len;
}
ncolumns = 76 / (maxlen + 5);
if (ncolumns < 1)
ncolumns = 1;
skip = (lemp->nsymbol + ncolumns - 1) / ncolumns;
for (i = 0; i < skip; i++) {
printf("//");
for (j = i; j < lemp->nsymbol; j += skip) {
sp = lemp->symbols[j];
assert(sp->index == j);
printf(" %3d %-*.*s", j, maxlen, maxlen, sp->name);
}
printf("\n");
}
for (rp = lemp->rules; rp; rp = rp->next) {
printf("%s", rp->item->lhs->name);
printf(" ::=");
for (i = 0; i < rp->item->nrhs; i++) {
sp = rp->item->rhs[i];
if (sp->type == MULTITERMINAL) {
printf(" %s", sp->subsym[0]->name);
for (j = 1; j < sp->nsubsym; j++) {
printf("|%s", sp->subsym[j]->name);
}
} else {
printf(" %s", sp->name);
}
}
printf(".");
if (rp->item->precsym)
printf(" [%s]", rp->item->precsym->name);
printf("\n");
}
}
void
ConfigPrint(FILE *fp, struct config *cfp) {
struct rule *rp;
struct symbol *sp;
int i, j;
rp = cfp->rule;
fprintf(fp, "%s ::=", rp->lhs->name);
for (i = 0; i <= rp->nrhs; i++) {
if (i == cfp->position)
fprintf(fp, " *");
if (i == rp->nrhs)
break;
sp = rp->rhs[i];
if (sp->type == MULTITERMINAL) {
fprintf(fp, " %s", sp->subsym[0]->name);
for (j = 1; j < sp->nsubsym; j++) {
fprintf(fp, "|%s", sp->subsym[j]->name);
}
} else {
fprintf(fp, " %s", sp->name);
}
}
}
/* Print an action to the given file descriptor. Return FALSE if
* nothing was actually printed.
*/
int
PrintAction(struct action *ap, FILE *fp, int indent) {
int result = 1;
switch (ap->type) {
case SHIFT:
fprintf(fp, "%*s shift %d", indent, ap->sp->name, ap->x.stp->statenum);
break;
case REDUCE:
fprintf(fp, "%*s reduce %d", indent, ap->sp->name, ap->x.rp->index);
break;
case ACCEPT:
fprintf(fp, "%*s accept", indent, ap->sp->name);
break;
case ERROR:
fprintf(fp, "%*s error", indent, ap->sp->name);
break;
case SRCONFLICT:
case RRCONFLICT:
fprintf(fp, "%*s reduce %-3d ** Parsing conflict **", indent, ap->sp->name, ap->x.rp->index);
break;
case SSCONFLICT:
fprintf(fp, "%*s shift %-3d ** Parsing conflict **", indent, ap->sp->name, ap->x.stp->statenum);
break;
case SH_RESOLVED:
if (showPrecedenceConflict) {
fprintf(fp, "%*s shift %-3d -- dropped by precedence", indent, ap->sp->name, ap->x.stp->statenum);
} else {
result = 0;
}
break;
case RD_RESOLVED:
if (showPrecedenceConflict) {
fprintf(fp, "%*s reduce %-3d -- dropped by precedence", indent, ap->sp->name, ap->x.rp->index);
} else {
result = 0;
}
break;
case NOT_USED:
result = 0;
break;
}
return result;
}
/* Generate the "y.output" log file */
void
ReportOutput(struct lemon *lemp) {
int i;
struct state *stp;
struct config_list *cfp;
struct action_list *ap;
FILE *fp;
fp = file_open(lemp, ".out", "wb");
if (fp == 0)
return;
for (i = 0; i < lemp->nstate; i++) {
stp = lemp->sorted[i];
fprintf(fp, "State %d:\n", stp->statenum);
cfp = stp->configs;
while (cfp) {
char buf[20];
if (cfp->item->position == cfp->item->rule->nrhs) {
sprintf(buf, "(%d)", cfp->item->rule->index);
fprintf(fp, " %5s ", buf);
} else {
fprintf(fp, " ");
}
ConfigPrint(fp, cfp->item);
fprintf(fp, "\n");
cfp = cfp->next;
}
fprintf(fp, "\n");
for (ap = stp->actions; ap; ap = ap->next) {
if (PrintAction(ap->item, fp, 30))
fprintf(fp, "\n");
}
fprintf(fp, "\n");
}
fprintf(fp, "----------------------------------------------------\n");
fprintf(fp, "Symbols:\n");
for (i = 0; i < lemp->nsymbol; i++) {
int j;
struct symbol *sp;
sp = lemp->symbols[i];
fprintf(fp, " %3d: %s", i, sp->name);
if (sp->type == NONTERMINAL) {
fprintf(fp, ":");
if (sp->lambda) {
fprintf(fp, " <lambda>");
}
for (j = 0; j < lemp->nterminal; j++) {
if (sp->firstset && SetFind(sp->firstset, j)) {
fprintf(fp, " %s", lemp->symbols[j]->name);
}
}
}
fprintf(fp, "\n");
}
fclose(fp);
return;
}
/* Search for the file "name" which is in the same directory as
* the exacutable
*/
static char *
pathsearch(char *argv0, char *name, int modemask) {
const char *pathlist;
char *pathbufptr;
char *pathbuf;
char *path, *cp;
char c;
#ifdef __WIN32__
cp = strrchr(argv0, '\\');
#else
cp = strrchr(argv0, '/');
#endif
if (cp) {
c = *cp;
*cp = 0;
path = (char *)malloc(strlen(argv0) + strlen(name) + 2);
if (path)
sprintf(path, "%s/%s", argv0, name);
*cp = c;
} else {
pathlist = getenv("PATH");
if (pathlist == 0)
pathlist = ".:/bin:/usr/bin";
pathbuf = (char *)malloc(strlen(pathlist) + 1);
path = (char *)malloc(strlen(pathlist) + strlen(name) + 2);
if ((pathbuf != 0) && (path != 0)) {
pathbufptr = pathbuf;
strcpy(pathbuf, pathlist);
while (*pathbuf) {
cp = strchr(pathbuf, ':');
if (cp == 0)
cp = &pathbuf[strlen(pathbuf)];
c = *cp;
*cp = 0;
sprintf(path, "%s/%s", pathbuf, name);
*cp = c;
if (c == 0)
pathbuf[0] = 0;
else
pathbuf = &cp[1];
if (access(path, modemask) == 0)
break;
}
free(pathbufptr);
}
}
return path;
}
/* Given an action, compute the integer value for that action
* which is to be put in the action table of the generated machine.
* Return negative if no action should be generated.
*/
static int
compute_action(struct lemon *lemp, struct action *ap) {
int act;
switch (ap->type) {
case SHIFT:
act = ap->x.stp->statenum;
break;
case REDUCE:
act = ap->x.rp->index + lemp->nstate;
break;
case ERROR:
act = lemp->nstate + lemp->nrule;
break;
case ACCEPT:
act = lemp->nstate + lemp->nrule + 1;
break;
default:
act = -1;
break;
}
return act;
}
/* The next cluster of routines are for reading the template file
* and writing the results to the generated parser
* The first function transfers data from "in" to "out" until
* a line is seen which begins with "%%". The line number is
* tracked.
*
* if name!=0, then any word that begin with "Parse" is changed to
* begin with *name instead.
*/
static void
tplt_xfer(char *name, FILE *in, FILE *out, int *lineno) {
int i, iStart;
char line[LINESIZE];
while (fgets(line, LINESIZE, in) && (line[0] != '%' || line[1] != '%')) {
(*lineno)++;
iStart = 0;
if (name) {
for (i = 0; line[i]; i++) {
if (line[i] == 'P' && strncmp(&line[i], "Parse", 5) == 0 && (i == 0 || !isalpha(line[i - 1]))) {
if (i > iStart)
fprintf(out, "%.*s", i - iStart, &line[iStart]);
fprintf(out, "%s", name);
i += 4;
iStart = i + 1;
}
}
}
fprintf(out, "%s", &line[iStart]);
}
}
/* The next function finds the template file and opens it, returning
* a pointer to the opened file.
*/
static FILE *
tplt_open(struct lemon *lemp) {
static char templatename[] = "lempar.c";
char buf[1000];
FILE *in;
char *tpltname;
char *cp;
/* first, see if user specified a template filename on the command line. */
if (user_templatename != 0) {
if (access(user_templatename, 004) == -1) {
lprintf(LERROR, "\"Can't find the parser driver template file \\\"%s\\\".", user_templatename);
lemp->errorcnt++;
return 0;
}
in = fopen(user_templatename, "rb");
if (in == 0) {
lprintf(LERROR, "Can't open the template file \"%s\".", user_templatename);
lemp->errorcnt++;
return 0;
}
return in;
}
cp = strrchr(lemp->filename, '.');
if (cp) {
sprintf(buf, "%.*s.lt", (int)(cp - lemp->filename), lemp->filename);
} else {
sprintf(buf, "%s.lt", lemp->filename);
}
if (access(buf, 004) == 0) {
tpltname = buf;
} else if (access(templatename, 004) == 0) {
tpltname = templatename;
} else {
tpltname = pathsearch(lemp->argv0, templatename, 0);
}
if (tpltname == 0) {
lprintf(LERROR, "Can't find the parser driver template file \"%s\".", templatename);
lemp->errorcnt++;
return 0;
}
in = fopen(tpltname, "rb");
if (in == 0) {
lprintf(LERROR, "Can't open the template file \"%s\".", templatename);
lemp->errorcnt++;
return 0;
}
return in;
}
/* Print a #line directive line to the output file. */
static void
tplt_linedir(FILE *out, int lineno, char *filename) {
fprintf(out, "#line %d \"", lineno);
while (*filename) {
if (*filename == '\\')
putc('\\', out);
putc(*filename, out);
filename++;
}
fprintf(out, "\"\n");
}
/* Print a string to the file and keep the linenumber up to date */
static void
tplt_print(FILE *out, struct lemon *lemp, char *str, int *lineno) {
if (str == 0)
return;
while (*str) {
putc(*str, out);
if (*str == '\n')
(*lineno)++;
str++;
}
if (str[-1] != '\n') {
putc('\n', out);
(*lineno)++;
}
(*lineno)++;
tplt_linedir(out, *lineno, lemp->outname);
return;
}
/* The following routine emits code for the destructor for the
* symbol sp
*/
void
emit_destructor_code(FILE *out, struct symbol *sp, struct lemon *lemp, int *lineno) {
char *cp = 0;
if (sp->type == TERMINAL) {
cp = lemp->tokendest;
if (cp == 0)
return;
fprintf(out, "{\n");
(*lineno)++;
} else if (sp->destructor) {
cp = sp->destructor;
fprintf(out, "{\n");
(*lineno)++;
(*lineno)++;
tplt_linedir(out, sp->destLineno, lemp->filename);
} else if (lemp->vardest) {
cp = lemp->vardest;
if (cp == 0)
return;
fprintf(out, "{\n");
(*lineno)++;
} else {
assert(0); // Cannot happen
}
for (; *cp; cp++) {
if (*cp == '$' && cp[1] == '$') {
fprintf(out, "(yypminor->yy%d)", sp->dtnum);
cp++;
continue;
}
if (*cp == '\n')
(*lineno)++;
fputc(*cp, out);
}
fprintf(out, "\n");
(*lineno)++;
(*lineno)++;
tplt_linedir(out, *lineno, lemp->outname);
fprintf(out, "}\n");
(*lineno)++;
return;
}
/* Return TRUE (non-zero) if the given symbol has a destructor. */
int
has_destructor(struct symbol *sp, struct lemon *lemp) {
int ret;
if (sp->type == TERMINAL) {
ret = lemp->tokendest != 0;
} else {
ret = lemp->vardest != 0 || sp->destructor != 0;
}
return ret;
}
/* Append text to a dynamically allocated string. If zText is 0 then
* reset the string to be empty again. Always return the complete text
* of the string (which is overwritten with each call).
*
* n bytes of zText are stored. If n==0 then all of zText up to the first
* \000 terminator is stored. zText can contain up to two instances of
* %d. The values of p1 and p2 are written into the first and second
* %d.
*
* If n==-1, then the previous character is overwritten.
*/
static char *
append_str(const char *zText, int n, int p1, int p2) {
static char empty[1] = {0};
static char *z = 0;
static size_t alloced = 0;
static int used = 0;
int c;
char zInt[40];
if (zText == 0) {
used = 0;
return z;
}
if (n <= 0) {
if (n < 0) {
used += n;
assert(used >= 0);
}
n = (int)strlen(zText);
}
if ((int)(n + sizeof(zInt) * 2 + used) >= alloced) {
alloced = n + sizeof(zInt) * 2 + used + 200;
z = (char *)realloc(z, alloced);
}
if (z == 0)
return empty;
while (n-- > 0) {
c = *(zText++);
if (c == '%' && n > 0 && zText[0] == 'd') {
sprintf(zInt, "%d", p1);
p1 = p2;
strcpy(&z[used], zInt);
used += strlen(&z[used]);
zText++;
n--;
} else {
z[used++] = (char)c;
}
}
z[used] = 0;
return z;
}
/* zCode is a string that is the action associated with a rule. Expand
* the symbols in this string so that the refer to elements of the parser
* stack.
*/
static void
translate_code(struct lemon *lemp, struct rule *rp) {
char *cp, *xp;
int i;
char lhsused = 0; // True if the LHS element has been used
char used[MAXRHS]; // True for each RHS element which is used
for (i = 0; i < rp->nrhs; i++)
used[i] = 0;
lhsused = 0;
if (rp->code == 0) {
static char newlinestr[2] = {'\n', '\0'};
rp->code = newlinestr;
rp->line = rp->ruleline;
}
append_str(0, 0, 0, 0);
/* This const cast is wrong but harmless, if we're careful. */
for (cp = (char *)rp->code; *cp; cp++) {
if (isalpha(*cp) && (cp == rp->code || (!isalnum(cp[-1]) && cp[-1] != '_'))) {
char saved;
for (xp = &cp[1]; isalnum(*xp) || *xp == '_'; xp++)
;
saved = *xp;
*xp = 0;
if (rp->lhsalias && strcmp(cp, rp->lhsalias) == 0) {
append_str("yygotominor.yy%d", 0, rp->lhs->dtnum, 0);
cp = xp;
lhsused = 1;
} else {
for (i = 0; i < rp->nrhs; i++) {
if (rp->rhsalias[i] && strcmp(cp, rp->rhsalias[i]) == 0) {
if (cp != rp->code && cp[-1] == '@') {
/* If the argument is of the form @X then substituted
* the token number of X, not the value of X
*/
append_str("yymsp[%d].major", -1, i - rp->nrhs + 1, 0);
} else {
struct symbol *sp = rp->rhs[i];
int dtnum;
if (sp->type == MULTITERMINAL) {
dtnum = sp->subsym[0]->dtnum;
} else {
dtnum = sp->dtnum;
}
append_str("yymsp[%d].minor.yy%d", 0, i - rp->nrhs + 1, dtnum);
}
cp = xp;
used[i] = 1;
break;
}
}
}
*xp = saved;
}
append_str(cp, 1, 0, 0);
}
/* Check to make sure the LHS has been used */
if (rp->lhsalias && !lhsused) {
ErrorMsg(lemp, rp->ruleline, "Label \"%s\" for \"%s(%s)\" is never used.", rp->lhsalias, rp->lhs->name,
rp->lhsalias);
}
/* Generate destructor code for RHS symbols which are not used in the
* reduce code
*/
for (i = 0; i < rp->nrhs; i++) {
if (rp->rhsalias[i] && !used[i]) {
ErrorMsg(lemp, rp->ruleline, "Label %s for \"%s(%s)\" is never used.", rp->rhsalias[i],
rp->rhs[i]->name, rp->rhsalias[i]);
} else if (rp->rhsalias[i] == 0) {
if (has_destructor(rp->rhs[i], lemp)) {
append_str(" yy_destructor(yypParser,%d,&yymsp[%d].minor);\n", 0, rp->rhs[i]->index, i - rp->nrhs + 1);
} else {
/* No destructor defined for this term */
}
}
}
if (rp->code) {
cp = append_str(0, 0, 0, 0);
rp->code = make_string(cp ? cp : "");
}
}
/* Generate code which executes when the rule "rp" is reduced. Write
* the code to "out". Make sure lineno stays up-to-date.
*/
static void
emit_code(FILE *out, struct rule *rp, struct lemon *lemp, int *lineno) {
const char *cp;
/* Generate code to do the reduce action */
if (rp->code) {
(*lineno)++;
tplt_linedir(out, rp->line, lemp->filename);
fprintf(out, "{%s", rp->code);
for (cp = rp->code; *cp; cp++) {
if (*cp == '\n')
(*lineno)++;
}
fprintf(out, "}\n");
(*lineno)++;
(*lineno)++;
tplt_linedir(out, *lineno, lemp->outname);
}
return;
}
/* Print the definition of the union used for the parser's data stack.
* This union contains fields for every possible data type for tokens
* and nonterminals. In the process of computing and printing this
* union, also set the ".dtnum" field of every terminal and nonterminal
* symbol.
*/
void
print_stack_union(FILE *out, // The output stream
struct lemon *lemp, // The main info structure for this parser
int *plineno, // Pointer to the line number
int mhflag // True if generating makeheaders output
) {
int lineno = *plineno; // The line number of the output
char **types; // A hash table of datatypes
size_t arraysize; // Size of the "types" array
size_t maxdtlength; // Maximum length of any ".datatype" field.
char *stddt; // Standardized name for a datatype
int i, j; // Loop counters
unsigned hash; // For hashing the name of a type
const char *name; // Name of the parser
/* Allocate and initialize types[] and allocate stddt[] */
arraysize = (size_t)(lemp->nsymbol * 2);
types = (char **)calloc(arraysize, sizeof(char *));
MemoryCheck(types);
for (i = 0; i < arraysize; i++)
types[i] = 0;
maxdtlength = 0;
if (lemp->vartype) {
maxdtlength = strlen(lemp->vartype);
}
for (i = 0; i < lemp->nsymbol; i++) {
size_t len;
struct symbol *sp = lemp->symbols[i];
if (sp->datatype == 0)
continue;
len = strlen(sp->datatype);
if (len > maxdtlength)
maxdtlength = len;
}
stddt = (char *)malloc(maxdtlength * 2 + 1);
MemoryCheck(stddt);
/* Build a hash table of datatypes. The ".dtnum" field of each symbol
* is filled in with the hash index plus 1. A ".dtnum" value of 0 is
* used for terminal symbols. If there is no %default_type defined then
* 0 is also used as the .dtnum value for nonterminals which do not specify
* a datatype using the %type directive.
*/
for (i = 0; i < lemp->nsymbol; i++) {
struct symbol *sp = lemp->symbols[i];
char *cp;
if (sp == lemp->errsym) {
sp->dtnum = arraysize + 1;
continue;
}
if (sp->type != NONTERMINAL || (sp->datatype == 0 && lemp->vartype == 0)) {
sp->dtnum = 0;
continue;
}
cp = sp->datatype;
if (cp == 0)
cp = lemp->vartype;
j = 0;
while (isspace(*cp))
cp++;
while (*cp)
stddt[j++] = *cp++;
while (j > 0 && isspace(stddt[j - 1]))
j--;
stddt[j] = 0;
if (lemp->tokentype && strcmp(stddt, lemp->tokentype) == 0) {
sp->dtnum = 0;
continue;
}
hash = 0;
for (j = 0; stddt[j]; j++) {
hash = hash * 53 + stddt[j];
}
hash = (hash & 0x7fffffff) % arraysize;
while (types[hash]) {
if (strcmp(types[hash], stddt) == 0) {
sp->dtnum = hash + 1;
break;
}
hash++;
if (hash >= (unsigned)arraysize)
hash = 0;
}
if (types[hash] == 0) {
sp->dtnum = hash + 1;
types[hash] = (char *)malloc(strlen(stddt) + 1);
MemoryCheck(types[hash]);
strcpy(types[hash], stddt);
}
}
/* Print out the definition of YYTOKENTYPE and YYMINORTYPE */
name = lemp->name ? lemp->name : "Parse";
lineno = *plineno;
if (mhflag) {
fprintf(out, "#if INTERFACE\n");
lineno++;
}
fprintf(out, "#define %sTOKENTYPE %s\n", name, lemp->tokentype ? lemp->tokentype : "void*");
lineno++;
if (mhflag) {
fprintf(out, "#endif\n");
lineno++;
}
fprintf(out, "typedef union {\n");
lineno++;
fprintf(out, " int yyinit;\n");
lineno++;
fprintf(out, " %sTOKENTYPE yy0;\n", name);
lineno++;
for (i = 0; i < arraysize; i++) {
if (types[i] == 0)
continue;
fprintf(out, " %s yy%d;\n", types[i], i + 1);
lineno++;
free(types[i]);
}
if (lemp->errsym->useCnt) {
fprintf(out, " int yy%d;\n", lemp->errsym->dtnum);
lineno++;
}
free(stddt);
free(types);
fprintf(out, "} YYMINORTYPE;\n");
lineno++;
*plineno = lineno;
}
/* Return the name of a C datatype able to represent values between
* lwr and upr, inclusive.
*/
static const char *
minimum_size_type(int lwr, int upr) {
if (lwr >= 0) {
if (upr <= 255) {
return "unsigned char";
} else if (upr < 65535) {
return "unsigned short int";
} else {
return "unsigned int";
}
} else if (lwr >= -127 && upr <= 127) {
return "signed char";
} else if (lwr >= -32767 && upr < 32767) {
return "short";
} else {
return "int";
}
}
/* Each state contains a set of token transaction and a set of
* nonterminal transactions. Each of these sets makes an instance
* of the following structure. An array of these structures is used
* to order the creation of entries in the yy_action[] table.
*/
struct axset {
struct state *stp; // A pointer to a state
int isTkn; // True to use tokens. False for non-terminals
int nAction; // Number of actions
int iOrder; // Original order of action sets
};
/* Compare to axset structures for sorting purposes */
static int
axset_compare(const void *a, const void *b) {
struct axset *p1 = (struct axset *)a;
struct axset *p2 = (struct axset *)b;
int c;
c = p2->nAction - p1->nAction;
if (c == 0) {
c = p2->iOrder - p1->iOrder;
}
assert(c != 0 || p1 == p2);
return c;
}
/* Write text on "out" that describes the rule "rp". */
static void
writeRuleText(FILE *out, struct rule *rp) {
int j;
fprintf(out, "%s ::=", rp->lhs->name);
for (j = 0; j < rp->nrhs; j++) {
struct symbol *sp = rp->rhs[j];
if (sp->type != MULTITERMINAL) {
fprintf(out, " %s", sp->name);
} else {
int k;
fprintf(out, " %s", sp->subsym[0]->name);
for (k = 1; k < sp->nsubsym; k++) {
fprintf(out, "|%s", sp->subsym[k]->name);
}
}
}
}
/* Generate C source code for the parser */
void
ReportTable(struct lemon *lemp, int mhflag // Output in makeheaders format if true
) {
FILE *out, *in;
char line[LINESIZE];
int lineno;
struct state *stp;
struct action_list *ap;
struct rule_list *rp;
struct acttab *pActtab;
int i, j, n;
const char *name;
int mnTknOfst, mxTknOfst;
int mnNtOfst, mxNtOfst;
struct axset *ax;
in = tplt_open(lemp);
if (in == 0)
return;
out = file_open(lemp, ".c", "wb");
if (out == 0) {
fclose(in);
return;
}
lineno = 1;
tplt_xfer(lemp->name, in, out, &lineno);
/* Generate #defines for all tokens */
if (mhflag) {
const char *prefix;
fprintf(out, "#if INTERFACE\n");
lineno++;
if (lemp->tokenprefix)
prefix = lemp->tokenprefix;
else
prefix = "";
for (i = 1; i < lemp->nterminal; i++) {
fprintf(out, "#define %s%-30s %2d\n", prefix, lemp->symbols[i]->name, i);
lineno++;
}
fprintf(out, "#endif\n");
lineno++;
}
tplt_xfer(lemp->name, in, out, &lineno);
/* Generate the defines */
fprintf(out, "#define YYCODETYPE %s\n", minimum_size_type(0, lemp->nsymbol + 1));
lineno++;
fprintf(out, "#define YYNOCODE %d\n", lemp->nsymbol + 1);
lineno++;
fprintf(out, "#define YYACTIONTYPE %s\n", minimum_size_type(0, lemp->nstate + lemp->nrule + 5));
lineno++;
if (lemp->wildcard) {
fprintf(out, "#define YYWILDCARD %d\n", lemp->wildcard->index);
lineno++;
}
print_stack_union(out, lemp, &lineno, mhflag);
fprintf(out, "#ifndef YYSTACKDEPTH\n");
lineno++;
if (lemp->stacksize) {
fprintf(out, "#define YYSTACKDEPTH %s\n", lemp->stacksize);
lineno++;
} else {
fprintf(out, "#define YYSTACKDEPTH 100\n");
lineno++;
}
fprintf(out, "#endif\n");
lineno++;
if (mhflag) {
fprintf(out, "#if INTERFACE\n");
lineno++;
}
name = lemp->name ? lemp->name : "Parse";
if (lemp->arg && lemp->arg[0]) {
int i;
i = strlen(lemp->arg);
while (i >= 1 && isspace(lemp->arg[i - 1]))
i--;
while (i >= 1 && (isalnum(lemp->arg[i - 1]) || lemp->arg[i - 1] == '_'))
i--;
fprintf(out, "#define %sARG_SDECL %s;\n", name, lemp->arg);
lineno++;
fprintf(out, "#define %sARG_PDECL ,%s\n", name, lemp->arg);
lineno++;
fprintf(out, "#define %sARG_FETCH %s = yypParser->%s\n", name, lemp->arg, &lemp->arg[i]);
lineno++;
fprintf(out, "#define %sARG_STORE yypParser->%s = %s\n", name, &lemp->arg[i], &lemp->arg[i]);
lineno++;
} else {
fprintf(out, "#define %sARG_SDECL\n", name);
lineno++;
fprintf(out, "#define %sARG_PDECL\n", name);
lineno++;
fprintf(out, "#define %sARG_FETCH\n", name);
lineno++;
fprintf(out, "#define %sARG_STORE\n", name);
lineno++;
}
if (mhflag) {
fprintf(out, "#endif\n");
lineno++;
}
fprintf(out, "#define YYNSTATE %d\n", lemp->nstate);
lineno++;
fprintf(out, "#define YYNRULE %d\n", lemp->nrule);
lineno++;
if (lemp->errsym->useCnt) {
fprintf(out, "#define YYERRORSYMBOL %d\n", lemp->errsym->index);
lineno++;
fprintf(out, "#define YYERRSYMDT yy%d\n", lemp->errsym->dtnum);
lineno++;
}
if (lemp->has_fallback) {
fprintf(out, "#define YYFALLBACK 1\n");
lineno++;