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
|
/***************************************
$Header: /cvs/src/jbofihe/tracebk.c,v 1.5 2001/03/05 22:59:53 richard Exp $
Provide traceback capability when parse errors are encountered.
***************************************/
/**********************************************************************
* Copyright (C) Richard P. Curnow 1998-2001
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
* 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
*
*********************************************************************/
#include <stdio.h>
#include <string.h>
#include "functions.h"
#include "trctabs.c"
#include "trcftabs.c"
typedef struct {
int state;
int rule;
} Reduction;
static Reduction reductions[1024];
static int n_reductions=0;
/* command line options in main.c */
extern int show_backtrace;
extern int require_elidables;
static void
display_rule(int ruleno, int indent, int focus)
{
int i, j;
char **toknames = require_elidables ? full_toknames : norm_toknames;
unsigned short *ruleindex = require_elidables ? full_ruleindex : norm_ruleindex;
unsigned short *rulelhs = require_elidables ? full_rulelhs : norm_rulelhs;
unsigned short *rulerhs = require_elidables ? full_rulerhs : norm_rulerhs;
for (i=0; i<indent; i++) fputc(' ', stdout);
fprintf(stderr, "Rule %d : %s <- ", ruleno, toknames[rulelhs[ruleno]]);
for (i=0, j=ruleindex[ruleno]; j<ruleindex[ruleno+1]; i++, j++) {
int rhs = rulerhs[j];
if (i>0) fprintf(stderr, " ");
if (strncmp(toknames[rhs], "PRIVATE_", 8)) {
fprintf(stderr, "%s", toknames[rulerhs[j]]);
}
if (i+1 == focus) {
fprintf(stderr, " .");
}
}
fprintf(stderr, "\n");
}
void
report_trace_reduce(int stateno, int ruleno)
{
reductions[n_reductions].rule = ruleno;
reductions[n_reductions].state = stateno;
n_reductions++;
}
void
report_trace_shift(int yychar, int yychar1)
{
/* After a successful shift, reduction list clears */
n_reductions = 0;
}
void
report_trace_error(short *yyss, short *yyssp)
{
int i;
short *s;
unsigned short *stateindex = require_elidables ? full_stateindex : norm_stateindex;
unsigned short *shiftrule = require_elidables ? full_shiftrule : norm_shiftrule;
unsigned char *focus = require_elidables ? full_focus : norm_focus;
unsigned short *shift_in_state = require_elidables ? full_shift_in_state : norm_shift_in_state;
unsigned short *shift_in_state_index = require_elidables ? full_shift_in_state_index : norm_shift_in_state_index;
char **toknames = require_elidables ? full_toknames : norm_toknames;
/* This stuff is done here now instead of in yyerror. It means the token
dump comes before the backtrace rather than after it, which makes more
sense. */
fprintf(stderr, "--------------------\n");
fprintf(stderr, "SYNTAX ERROR IN TEXT\n");
fprintf(stderr, "--------------------\n");
print_last_toks();
fprintf(stderr, "--------------------\n");
/* If not doing backtrace, exit now. */
if (!show_backtrace) return;
fprintf(stderr,
"==============================================\n"
"Rules reduced since misparsed token was read :\n"
"==============================================\n");
if (n_reductions == 0) {
fprintf(stderr," NONE\n");
} else {
for (i=0; i<n_reductions; i++) {
int ruleno = reductions[i].rule;
int stateno = reductions[i].state;
int r, r1, r2;
int is_first = 1;
display_rule(ruleno, 1, 0);
r1 = shift_in_state_index[stateno], r2 = shift_in_state_index[stateno+1];
if (r2 > r1) {
for (r=r1; r<r2; r++) {
int tokidx = shift_in_state[r];
if (strncmp("PRIVATE_", toknames[tokidx], 8)) {
if (is_first) {
fprintf(stderr," (Next word class could be :");
}
fprintf(stderr," %s", toknames[tokidx]);
is_first = 0;
}
}
if (!is_first) fprintf(stderr,")\n");
}
}
}
fprintf(stderr,
"==========================\n"
"Jammed parser state (%d) :\n"
"==========================\n", *yyssp);
{
int r1, r2;
int r;
int is_first;
r1 = stateindex[*yyssp], r2 = stateindex[*yyssp+1];
for (r=r1; r<r2; r++) {
display_rule(shiftrule[r], 1, focus[r]);
}
/* Print out which tokens would have been possible */
fprintf(stderr,"\nNext word class could be : ");
r1 = shift_in_state_index[*yyssp], r2 = shift_in_state_index[*yyssp+1];
is_first = 1;
for (r=r1; r<r2; r++) {
int tokidx = shift_in_state[r];
if (strncmp("PRIVATE_", toknames[tokidx], 8)) {
fprintf(stderr,"%s%s", is_first ? "" : " ", toknames[tokidx]);
is_first = 0;
}
}
fprintf(stderr,"\n\n");
}
fprintf(stderr,"=========================================================\n"
"Pending parser states (innermost first, outermost last) :\n"
"=========================================================\n");
for (s=yyssp-1; s>=yyss; s--) {
int r1, r2;
int r;
r1 = stateindex[*s], r2 = stateindex[*s+1];
fprintf(stderr, "State %d\n", *s);
for (r=r1; r<r2; r++) {
display_rule(shiftrule[r], 1, focus[r]);
}
fprintf(stderr,"---------------------------\n");
}
}
|
