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