]> git.saurik.com Git - bison.git/blame - tests/cxx-type.at
warnings: useless semantic types
[bison.git] / tests / cxx-type.at
CommitLineData
1154cced 1# Checking GLR Parsing. -*- Autotest -*-
6e30ede8 2
c932d613 3# Copyright (C) 2002-2012 Free Software Foundation, Inc.
12bebc04 4
f16b0819 5# This program is free software: you can redistribute it and/or modify
12bebc04 6# it under the terms of the GNU General Public License as published by
f16b0819
PE
7# the Free Software Foundation, either version 3 of the License, or
8# (at your option) any later version.
9#
12bebc04
PH
10# This program is distributed in the hope that it will be useful,
11# but WITHOUT ANY WARRANTY; without even the implied warranty of
12# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13# GNU General Public License for more details.
f16b0819 14#
12bebc04 15# You should have received a copy of the GNU General Public License
f16b0819 16# along with this program. If not, see <http://www.gnu.org/licenses/>.
12bebc04
PH
17
18AT_BANNER([[C++ Type Syntax (GLR).]])
19
9501dc6e
AD
20# _AT_TEST_GLR_CXXTYPES(DECL, RESOLVE1, RESOLVE2)
21# -----------------------------------------------
12bebc04
PH
22# Store into types.y the calc program, with DECL inserted as a declaration,
23# and with RESOLVE1 and RESOLVE2 as annotations on the conflicted rule for
24# stmt. Then compile the result.
9501dc6e 25m4_define([_AT_TEST_GLR_CXXTYPES],
6d559547 26[AT_BISON_OPTION_PUSHDEFS([%glr-parser $1])
25005f6a
PH
27
28AT_DATA_GRAMMAR([types.y],
1154cced 29[[/* Simplified C++ Type and Expression Grammar. */
12bebc04 30
1154cced 31$1
12bebc04 32
6d559547
AD
33%code requires
34{
12bebc04 35 #include <stdio.h>
2c3b392a
AD
36 union Node {
37 struct {
9ecafbbf 38 int isNterm;
2c3b392a 39 int parents;
9ecafbbf 40 } nodeInfo;
2c3b392a 41 struct {
9ecafbbf 42 int isNterm; /* 1 */
2c3b392a
AD
43 int parents;
44 char const *form;
45 union Node *children[3];
46 } nterm;
47 struct {
9ecafbbf 48 int isNterm; /* 0 */
2c3b392a
AD
49 int parents;
50 char *text;
51 } term;
52 };
53 typedef union Node Node;
6d559547
AD
54 #define YYSTYPE Node *
55}
56
57%code
58{
2c3b392a
AD
59 static Node *new_nterm (char const *, Node *, Node *, Node *);
60 static Node *new_term (char *);
61 static void free_node (Node *);
62 static char *node_to_string (Node *);
1154cced
AD
63]m4_bmatch([$2], [stmtMerge],
64[ static YYSTYPE stmtMerge (YYSTYPE x0, YYSTYPE x1);])[
12bebc04 65 #define YYINITDEPTH 10
e2688cd9 66 #define YYSTACKEXPANDABLE 1
6d559547
AD
67 ]AT_YYERROR_DECLARE[
68 ]AT_YYLEX_DECLARE[
69}
12bebc04
PH
70
71%token TYPENAME ID
72
73%right '='
74%left '+'
75
76%glr-parser
77
2c3b392a 78%destructor { free_node ($$); } stmt expr decl declarator TYPENAME ID
a22ff96f 79
12bebc04
PH
80%%
81
1154cced 82prog :
671881d1 83 | prog stmt {
6557bcce
AD
84 char *output;]AT_LOCATION_IF([
85 printf ("%d.%d-%d.%d: ",
86 @2.first_line, @2.first_column,
87 @2.last_line, @2.last_column);])[
88 output = node_to_string (]$[2);
89 printf ("%s\n", output);
90 free (output);
91 free_node (]$[2);
92 }
12bebc04
PH
93 ;
94
6557bcce 95stmt : expr ';' $2 { $$ = ]$[1; }
1154cced 96 | decl $3
6557bcce
AD
97 | error ';' { $$ = new_nterm ("<error>", YY_NULL, YY_NULL, YY_NULL); }
98 | '@' { YYACCEPT; }
12bebc04
PH
99 ;
100
25005f6a 101expr : ID
2c3b392a 102 | TYPENAME '(' expr ')'
6557bcce
AD
103 { $$ = new_nterm ("<cast>(%s,%s)", ]$[3, ]$[1, YY_NULL); }
104 | expr '+' expr { $$ = new_nterm ("+(%s,%s)", ]$[1, ]$[3, YY_NULL); }
105 | expr '=' expr { $$ = new_nterm ("=(%s,%s)", ]$[1, ]$[3, YY_NULL); }
12bebc04
PH
106 ;
107
1154cced 108decl : TYPENAME declarator ';'
6557bcce 109 { $$ = new_nterm ("<declare>(%s,%s)", ]$[1, ]$[2, YY_NULL); }
12bebc04 110 | TYPENAME declarator '=' expr ';'
6557bcce
AD
111 { $$ = new_nterm ("<init-declare>(%s,%s,%s)", ]$[1,
112 ]$[2, ]$[4); }
12bebc04
PH
113 ;
114
25005f6a
PH
115declarator : ID
116 | '(' declarator ')' { $$ = ]$[2; }
12bebc04
PH
117 ;
118
119%%
120
121#include <ctype.h>
c469acce 122#include <stdlib.h>
1154cced 123#include <string.h>
25005f6a 124#include <stdarg.h>
12bebc04 125
1154cced 126int
671881d1 127main (int argc, char **argv)
12bebc04 128{
500bbfcd
PE
129 if (argc != 2)
130 abort ();
927f7817 131 if (!freopen (argv[1], "r", stdin))
6100a9aa
PE
132 return 3;
133 return yyparse ();
12bebc04
PH
134}
135
6d559547
AD
136]AT_YYERROR_DEFINE[
137
230a3db4 138]AT_YYLEX_PROTOTYPE[
12bebc04
PH
139{
140 char buffer[256];
141 int c;
c469acce 142 unsigned int i;
25005f6a 143 static int lineNum = 1;
e342c3be 144 static int colNum = 0;
1154cced
AD
145
146#if YYPURE
c66dfadd 147# undef yylloc
25005f6a 148# define yylloc (*llocp)
c66dfadd 149# undef yylval
1154cced 150# define yylval (*lvalp)
1154cced
AD
151#endif
152
c469acce
PE
153 while (1)
154 {
cf806753 155 if (feof (stdin))
6557bcce 156 abort ();
c469acce
PE
157 c = getchar ();
158 switch (c)
6557bcce
AD
159 {
160 case EOF:
161 return 0;
162 case '\t':
163 colNum = (colNum + 7) & ~7;
164 break;
165 case ' ': case '\f':
166 colNum += 1;
167 break;
168 case '\n':
169 lineNum += 1;
170 colNum = 0;
171 break;
172 default:
173 {
6d559547 174 int tok;]AT_LOCATION_IF([[
6557bcce 175 yylloc.first_line = yylloc.last_line = lineNum;
6d559547 176 yylloc.first_column = colNum;]])[
6557bcce
AD
177 if (isalpha (c))
178 {
179 i = 0;
180
181 do
182 {
183 buffer[i++] = c;
184 colNum += 1;
185 if (i == sizeof buffer - 1)
186 abort ();
187 c = getchar ();
188 }
189 while (isalnum (c) || c == '_');
190
191 ungetc (c, stdin);
192 buffer[i++] = 0;
193 tok = isupper ((unsigned char) buffer[0]) ? TYPENAME : ID;
194 yylval = new_term (strcpy ((char *) malloc (i), buffer));
195 }
196 else
197 {
198 colNum += 1;
199 tok = c;
200 yylval = YY_NULL;
6d559547
AD
201 }]AT_LOCATION_IF([[
202 yylloc.last_column = colNum-1;]])[
6557bcce
AD
203 return tok;
204 }
205 }
12bebc04 206 }
12bebc04
PH
207}
208
2c3b392a
AD
209static Node *
210new_nterm (char const *form, Node *child0, Node *child1, Node *child2)
211{
9d9b8b70 212 Node *node = (Node *) malloc (sizeof (Node));
9ecafbbf 213 node->nterm.isNterm = 1;
2c3b392a
AD
214 node->nterm.parents = 0;
215 node->nterm.form = form;
216 node->nterm.children[0] = child0;
217 if (child0)
9ecafbbf 218 child0->nodeInfo.parents += 1;
2c3b392a
AD
219 node->nterm.children[1] = child1;
220 if (child1)
9ecafbbf 221 child1->nodeInfo.parents += 1;
2c3b392a
AD
222 node->nterm.children[2] = child2;
223 if (child2)
9ecafbbf 224 child2->nodeInfo.parents += 1;
2c3b392a
AD
225 return node;
226}
227
228static Node *
229new_term (char *text)
230{
9d9b8b70 231 Node *node = (Node *) malloc (sizeof (Node));
9ecafbbf 232 node->term.isNterm = 0;
2c3b392a
AD
233 node->term.parents = 0;
234 node->term.text = text;
235 return node;
236}
237
238static void
239free_node (Node *node)
240{
241 if (!node)
242 return;
9ecafbbf 243 node->nodeInfo.parents -= 1;
2c3b392a 244 /* Free only if 0 (last parent) or -1 (no parents). */
9ecafbbf 245 if (node->nodeInfo.parents > 0)
2c3b392a 246 return;
9ecafbbf 247 if (node->nodeInfo.isNterm == 1)
2c3b392a
AD
248 {
249 free_node (node->nterm.children[0]);
250 free_node (node->nterm.children[1]);
251 free_node (node->nterm.children[2]);
252 }
253 else
254 free (node->term.text);
255 free (node);
256}
25005f6a 257
671881d1 258static char *
2c3b392a 259node_to_string (Node *node)
25005f6a 260{
2c3b392a
AD
261 char *child0;
262 char *child1;
263 char *child2;
264 char *buffer;
265 if (!node)
266 {
9d9b8b70 267 buffer = (char *) malloc (1);
2c3b392a
AD
268 buffer[0] = 0;
269 }
9ecafbbf 270 else if (node->nodeInfo.isNterm == 1)
2c3b392a
AD
271 {
272 child0 = node_to_string (node->nterm.children[0]);
273 child1 = node_to_string (node->nterm.children[1]);
274 child2 = node_to_string (node->nterm.children[2]);
9d9b8b70 275 buffer = (char *) malloc (strlen (node->nterm.form) + strlen (child0)
6557bcce 276 + strlen (child1) + strlen (child2) + 1);
2c3b392a
AD
277 sprintf (buffer, node->nterm.form, child0, child1, child2);
278 free (child0);
279 free (child1);
280 free (child2);
281 }
282 else
283 buffer = strdup (node->term.text);
284 return buffer;
25005f6a
PH
285}
286
1154cced
AD
287]]
288m4_bmatch([$2], [stmtMerge],
289[[static YYSTYPE
290stmtMerge (YYSTYPE x0, YYSTYPE x1)
12bebc04 291{
6557bcce 292 return new_nterm ("<OR>(%s,%s)", x0, x1, YY_NULL);
12bebc04
PH
293}
294]])
1154cced 295)
12bebc04
PH
296
297AT_DATA([test-input],
298[[
299
300z + q;
301
302T x;
303
304T x = y;
305
306x = y;
307
308T (x) + y;
309
310T (x);
311
312T (y) = z + q;
313
314T (y y) = z + q;
315
316z + q;
317
318@
319
320This is total garbage, but it should be ignored.
321]])
322
da730230 323AT_BISON_CHECK([-o types.c types.y], 0, [], ignore)
1154cced 324AT_COMPILE([types])
25005f6a 325AT_BISON_OPTION_POPDEFS
12bebc04
PH
326])
327
328m4_define([_AT_RESOLVED_GLR_OUTPUT],
6d559547 329[[+(z,q)
25005f6a
PH
330<declare>(T,x)
331<init-declare>(T,x,y)
332=(x,y)
333+(<cast>(x,T),y)
334<declare>(T,x)
335<init-declare>(T,y,+(z,q))
336<error>
337+(z,q)
6d559547 338]])
25005f6a
PH
339
340m4_define([_AT_RESOLVED_GLR_OUTPUT_WITH_LOC],
6d559547 341[[3.0-3.5: +(z,q)
e342c3be
AD
3425.0-5.3: <declare>(T,x)
3437.0-7.7: <init-declare>(T,x,y)
3449.0-9.5: =(x,y)
34511.0-11.9: +(<cast>(x,T),y)
34613.0-13.5: <declare>(T,x)
34715.0-15.13: <init-declare>(T,y,+(z,q))
34817.0-17.15: <error>
34919.0-19.5: +(z,q)
6d559547 350]])
12bebc04
PH
351
352m4_define([_AT_AMBIG_GLR_OUTPUT],
6d559547 353[[+(z,q)
25005f6a
PH
354<declare>(T,x)
355<init-declare>(T,x,y)
356=(x,y)
357+(<cast>(x,T),y)
358<OR>(<declare>(T,x),<cast>(x,T))
359<OR>(<init-declare>(T,y,+(z,q)),=(<cast>(y,T),+(z,q)))
360<error>
361+(z,q)
6d559547 362]])
25005f6a
PH
363
364m4_define([_AT_AMBIG_GLR_OUTPUT_WITH_LOC],
6d559547 365[[3.0-3.5: +(z,q)
e342c3be
AD
3665.0-5.3: <declare>(T,x)
3677.0-7.7: <init-declare>(T,x,y)
3689.0-9.5: =(x,y)
36911.0-11.9: +(<cast>(x,T),y)
37013.0-13.5: <OR>(<declare>(T,x),<cast>(x,T))
37115.0-15.13: <OR>(<init-declare>(T,y,+(z,q)),=(<cast>(y,T),+(z,q)))
37217.0-17.15: <error>
37319.0-19.5: +(z,q)
6d559547 374]])
12bebc04 375
1154cced 376m4_define([_AT_GLR_STDERR],
6d559547
AD
377[[syntax error
378]])
379
380m4_define([_AT_GLR_STDERR_WITH_LOC],
381[[17.5-4: syntax error
382]])
12bebc04 383
1154cced 384m4_define([_AT_VERBOSE_GLR_STDERR],
6d559547
AD
385[[syntax error, unexpected ID, expecting '=' or '+' or ')'
386]])
387
388m4_define([_AT_VERBOSE_GLR_STDERR_WITH_LOC],
389[[17.5-4: syntax error, unexpected ID, expecting '=' or '+' or ')'
390]])
12bebc04
PH
391
392## ---------------------------------------------------- ##
393## Compile the grammar described in the documentation. ##
394## ---------------------------------------------------- ##
395
396AT_SETUP([GLR: Resolve ambiguity, impure, no locations])
9501dc6e 397_AT_TEST_GLR_CXXTYPES([],
6557bcce 398 [%dprec 1], [%dprec 2])
49b1cf79 399AT_PARSER_CHECK([[./types test-input]], 0,
6d559547 400 [_AT_RESOLVED_GLR_OUTPUT], [_AT_GLR_STDERR])
12bebc04
PH
401AT_CLEANUP
402
403AT_SETUP([GLR: Resolve ambiguity, impure, locations])
9501dc6e 404_AT_TEST_GLR_CXXTYPES([%locations],[%dprec 1],[%dprec 2])
49b1cf79 405AT_PARSER_CHECK([[./types test-input]], 0,
6d559547 406 [_AT_RESOLVED_GLR_OUTPUT_WITH_LOC], [_AT_GLR_STDERR_WITH_LOC])
12bebc04
PH
407AT_CLEANUP
408
409AT_SETUP([GLR: Resolve ambiguity, pure, no locations])
d9df47b6 410_AT_TEST_GLR_CXXTYPES([%define api.pure],
6557bcce 411 [%dprec 1], [%dprec 2])
49b1cf79 412AT_PARSER_CHECK([[./types test-input]], 0,
6d559547 413 [_AT_RESOLVED_GLR_OUTPUT], [_AT_GLR_STDERR])
12bebc04
PH
414AT_CLEANUP
415
416AT_SETUP([GLR: Resolve ambiguity, pure, locations])
d9df47b6 417_AT_TEST_GLR_CXXTYPES([%define api.pure %locations],
6557bcce 418 [%dprec 1], [%dprec 2])
49b1cf79 419AT_PARSER_CHECK([[./types test-input]], 0,
6d559547 420 [_AT_RESOLVED_GLR_OUTPUT_WITH_LOC], [_AT_GLR_STDERR_WITH_LOC])
12bebc04
PH
421AT_CLEANUP
422
423AT_SETUP([GLR: Merge conflicting parses, impure, no locations])
9501dc6e 424_AT_TEST_GLR_CXXTYPES([],
6557bcce 425 [%merge <stmtMerge>], [%merge <stmtMerge>])
49b1cf79 426AT_PARSER_CHECK([[./types test-input]], 0,
6d559547 427 [_AT_AMBIG_GLR_OUTPUT], [_AT_GLR_STDERR])
12bebc04
PH
428AT_CLEANUP
429
430AT_SETUP([GLR: Merge conflicting parses, impure, locations])
9501dc6e 431_AT_TEST_GLR_CXXTYPES([%locations],
6557bcce 432 [%merge <stmtMerge>], [%merge <stmtMerge>])
49b1cf79 433AT_PARSER_CHECK([[./types test-input]], 0,
6d559547 434 [_AT_AMBIG_GLR_OUTPUT_WITH_LOC], [_AT_GLR_STDERR_WITH_LOC])
12bebc04
PH
435AT_CLEANUP
436
437AT_SETUP([GLR: Merge conflicting parses, pure, no locations])
d9df47b6 438_AT_TEST_GLR_CXXTYPES([%define api.pure],
6557bcce 439 [%merge <stmtMerge>], [%merge <stmtMerge>])
49b1cf79 440AT_PARSER_CHECK([[./types test-input]], 0,
6d559547 441 [_AT_AMBIG_GLR_OUTPUT], [_AT_GLR_STDERR])
12bebc04
PH
442AT_CLEANUP
443AT_SETUP([GLR: Merge conflicting parses, pure, locations])
d9df47b6 444_AT_TEST_GLR_CXXTYPES([%define api.pure %locations],
6557bcce 445 [%merge <stmtMerge>],[%merge <stmtMerge>])
49b1cf79 446AT_PARSER_CHECK([[./types test-input]], 0,
6d559547 447 [_AT_AMBIG_GLR_OUTPUT_WITH_LOC], [_AT_GLR_STDERR_WITH_LOC])
12bebc04
PH
448AT_CLEANUP
449
450AT_SETUP([GLR: Verbose messages, resolve ambiguity, impure, no locations])
9501dc6e 451_AT_TEST_GLR_CXXTYPES([%error-verbose],
6557bcce 452 [%merge <stmtMerge>], [%merge <stmtMerge>])
49b1cf79 453AT_PARSER_CHECK([[./types test-input]], 0,
6d559547 454 [_AT_AMBIG_GLR_OUTPUT], [_AT_VERBOSE_GLR_STDERR])
12bebc04 455AT_CLEANUP