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
|
/* Recursive-descent parenthesis checker.
Copyright (C) 2001-2023 J. Marcel van der Veer.
Copyright (C) 2025 Jose E. Marchesi.
Original implementation by J. Marcel van der Veer.
Adapted for GCC by Jose E. Marchesi.
GCC 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 3, or (at your option)
any later version.
GCC 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 GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "a68.h"
/* After this checker, we know that at least brackets are matched. This
stabilises later parser phases.
Note that this checker operates on a linear list of nodes.
Error diagnostics are placed near offending lines. */
/* Intelligible diagnostics for the bracket checker. */
static void
bracket_check_error (char *txt, int n, const char *bra, const char *ket)
{
BUFFER buf;
if (n == 0)
return;
const char *strop_ket = a68_strop_keyword (ket);
const char *strop_bra = a68_strop_keyword (bra);
BUFCLR (buf);
if (snprintf (buf, SNPRINTF_SIZE, "missing matching %%<%s%%>",
(n > 0 ? strop_ket : strop_bra)) < 0)
gcc_unreachable ();
if (strlen (txt) > 0)
a68_bufcat (txt, " or ", BUFFER_SIZE);
a68_bufcat (txt, buf, BUFFER_SIZE);
}
/* Diagnose brackets in local branch of the tree. */
static char *
bracket_check_diagnose (NODE_T *p)
{
int begins = 0, opens = 0, format_delims = 0, format_opens = 0;
int subs = 0, ifs = 0, cases = 0, dos = 0;
for (; p != NO_NODE; FORWARD (p))
{
switch (ATTRIBUTE (p))
{
case BEGIN_SYMBOL:
begins++;
break;
case END_SYMBOL:
begins--;
break;
case OPEN_SYMBOL:
opens++;
break;
case CLOSE_SYMBOL:
opens--;
break;
case FORMAT_DELIMITER_SYMBOL:
if (format_delims == 0)
format_delims = 1;
else
format_delims = 0;
break;
case FORMAT_OPEN_SYMBOL:
format_opens++;
break;
case FORMAT_CLOSE_SYMBOL:
format_opens--;
break;
case SUB_SYMBOL:
subs++;
break;
case BUS_SYMBOL:
subs--;
break;
case IF_SYMBOL:
ifs++;
break;
case FI_SYMBOL:
ifs--;
break;
case CASE_SYMBOL:
cases++;
break;
case ESAC_SYMBOL:
cases--;
break;
case DO_SYMBOL:
dos++;
break;
case OD_SYMBOL:
dos--;
break;
default:
break;
}
}
A68 (edit_line)[0] = '\0';
bracket_check_error (A68 (edit_line), begins, "BEGIN", "END");
bracket_check_error (A68 (edit_line), opens, "(", ")");
bracket_check_error (A68 (edit_line), format_opens, "(", ")");
bracket_check_error (A68 (edit_line), format_delims, "$", "$");
bracket_check_error (A68 (edit_line), subs, "[", "]");
bracket_check_error (A68 (edit_line), ifs, "IF", "FI");
bracket_check_error (A68 (edit_line), cases, "CASE", "ESAC");
bracket_check_error (A68 (edit_line), dos, "DO", "OD");
return A68 (edit_line);
}
/* Driver for locally diagnosing non-matching tokens. */
static NODE_T *
bracket_check_parse (NODE_T *top, NODE_T *p)
{
for (; p != NO_NODE; FORWARD (p))
{
int ket = STOP;
NODE_T *q = NO_NODE;
bool ignore_token = false;
switch (ATTRIBUTE (p))
{
case BEGIN_SYMBOL:
ket = END_SYMBOL;
q = bracket_check_parse (top, NEXT (p));
break;
case OPEN_SYMBOL:
ket = CLOSE_SYMBOL;
q = bracket_check_parse (top, NEXT (p));
break;
case FORMAT_OPEN_SYMBOL:
ket = FORMAT_CLOSE_SYMBOL;
q = bracket_check_parse (top, NEXT (p));
break;
case SUB_SYMBOL:
ket = BUS_SYMBOL;
q = bracket_check_parse (top, NEXT (p));
break;
case IF_SYMBOL:
ket = FI_SYMBOL;
q = bracket_check_parse (top, NEXT (p));
break;
case CASE_SYMBOL:
ket = ESAC_SYMBOL;
q = bracket_check_parse (top, NEXT (p));
break;
case DO_SYMBOL:
ket = OD_SYMBOL;
q = bracket_check_parse (top, NEXT (p));
break;
case END_SYMBOL:
case CLOSE_SYMBOL:
case FORMAT_CLOSE_SYMBOL:
case BUS_SYMBOL:
case FI_SYMBOL:
case ESAC_SYMBOL:
case OD_SYMBOL:
return p;
default:
ignore_token = true;
}
if (ignore_token)
;
else if (q != NO_NODE && IS (q, ket))
p = q;
else if (q == NO_NODE)
{
char *diag = bracket_check_diagnose (top);
a68_error (p, "incorrect nesting, check for Y",
(strlen (diag) > 0 ? diag : "missing or unmatched keyword"));
longjmp (A68_PARSER (top_down_crash_exit), 1);
}
else
{
char *diag = bracket_check_diagnose (top);
a68_error (q, "unexpected X, check for Y",
ATTRIBUTE (q),
(strlen (diag) > 0 ? diag : "missing or unmatched keyword"));
longjmp (A68_PARSER (top_down_crash_exit), 1);
}
}
return NO_NODE;
}
/* Driver for globally diagnosing non-matching tokens. */
void
a68_check_parenthesis (NODE_T *top)
{
if (!setjmp (A68_PARSER (top_down_crash_exit)))
{
if (bracket_check_parse (top, top) != NO_NODE)
a68_error (top, "incorrect nesting, check for Y",
"missing or unmatched keyword");
}
}
|
