]> git.saurik.com Git - bison.git/blob - tests/actions.at
maint: run "make update-copyright"
[bison.git] / tests / actions.at
1 # Executing Actions. -*- Autotest -*-
2 # Copyright (C) 2001-2007, 2009-2010 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 3 of the License, or
7 # (at your option) 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, see <http://www.gnu.org/licenses/>.
16
17 AT_BANNER([[User Actions.]])
18
19 ## ------------------ ##
20 ## Mid-rule actions. ##
21 ## ------------------ ##
22
23 AT_SETUP([Mid-rule actions])
24
25 # Bison once forgot the mid-rule actions. It was because the action
26 # was attached to the host rule (the one with the mid-rule action),
27 # instead of being attached to the empty rule dedicated to this
28 # action.
29
30 AT_DATA_GRAMMAR([[input.y]],
31 [[%error-verbose
32 %debug
33 %{
34 # include <stdio.h>
35 # include <stdlib.h>
36 static void yyerror (const char *msg);
37 static int yylex (void);
38 %}
39 %%
40 exp: { putchar ('0'); }
41 '1' { putchar ('1'); }
42 '2' { putchar ('2'); }
43 '3' { putchar ('3'); }
44 '4' { putchar ('4'); }
45 '5' { putchar ('5'); }
46 '6' { putchar ('6'); }
47 '7' { putchar ('7'); }
48 '8' { putchar ('8'); }
49 '9' { putchar ('9'); }
50 { putchar ('\n'); }
51 ;
52 %%
53 static int
54 yylex (void)
55 {
56 static char const input[] = "123456789";
57 static size_t toknum;
58 if (! (toknum < sizeof input))
59 abort ();
60 return input[toknum++];
61 }
62
63 static void
64 yyerror (const char *msg)
65 {
66 fprintf (stderr, "%s\n", msg);
67 }
68
69 int
70 main (void)
71 {
72 return yyparse ();
73 }
74 ]])
75
76 AT_BISON_CHECK([-d -v -o input.c input.y])
77 AT_COMPILE([input])
78 AT_PARSER_CHECK([./input], 0,
79 [[0123456789
80 ]])
81
82 AT_CLEANUP
83
84
85
86
87
88 ## ---------------- ##
89 ## Exotic Dollars. ##
90 ## ---------------- ##
91
92 AT_SETUP([Exotic Dollars])
93
94 AT_DATA_GRAMMAR([[input.y]],
95 [[%error-verbose
96 %debug
97 %{
98 # include <stdio.h>
99 # include <stdlib.h>
100 static void yyerror (const char *msg);
101 static int yylex (void);
102 # define USE(Var)
103 %}
104
105 %union
106 {
107 int val;
108 };
109
110 %type <val> a_1 a_2 a_5
111 sum_of_the_five_previous_values
112
113 %%
114 exp: a_1 a_2 { $<val>$ = 3; } { $<val>$ = $<val>3 + 1; } a_5
115 sum_of_the_five_previous_values
116 {
117 USE (($1, $2, $<foo>3, $<foo>4, $5));
118 printf ("%d\n", $6);
119 }
120 ;
121 a_1: { $$ = 1; };
122 a_2: { $$ = 2; };
123 a_5: { $$ = 5; };
124
125 sum_of_the_five_previous_values:
126 {
127 $$ = $<val>0 + $<val>-1 + $<val>-2 + $<val>-3 + $<val>-4;
128 }
129 ;
130
131 %%
132 static int
133 yylex (void)
134 {
135 static int called;
136 if (called++)
137 abort ();
138 return EOF;
139 }
140
141 static void
142 yyerror (const char *msg)
143 {
144 fprintf (stderr, "%s\n", msg);
145 }
146
147 int
148 main (void)
149 {
150 return yyparse ();
151 }
152 ]])
153
154 AT_BISON_CHECK([-d -v -o input.c input.y], 0)
155 AT_COMPILE([input])
156 AT_PARSER_CHECK([./input], 0,
157 [[15
158 ]])
159
160 AT_CLEANUP
161
162
163
164 ## -------------------------- ##
165 ## Printers and Destructors. ##
166 ## -------------------------- ##
167
168 # _AT_CHECK_PRINTER_AND_DESTRUCTOR($1, $2, $3, $4, BISON-DIRECTIVE, UNION-FLAG)
169 # -----------------------------------------------------------------------------
170 m4_define([_AT_CHECK_PRINTER_AND_DESTRUCTOR],
171 [# Make sure complex $n work.
172 m4_if([$1$2$3], $[1]$[2]$[3], [],
173 [m4_fatal([$0: Invalid arguments: $@])])dnl
174
175 # Be sure to pass all the %directives to this macro to have correct
176 # helping macros. So don't put any directly in the Bison file.
177 AT_BISON_OPTION_PUSHDEFS([$5])
178 AT_DATA_GRAMMAR([[input.y]],
179 [[%code requires {
180 #include <stdio.h>
181 #include <stdlib.h>
182 #include <string.h>
183 #include <assert.h>
184
185 #define YYINITDEPTH 10
186 #define YYMAXDEPTH 10
187 ]AT_LALR1_CC_IF(
188 [#define RANGE(Location) (Location).begin.line, (Location).end.line],
189 [#define RANGE(Location) (Location).first_line, (Location).last_line])
190 [}
191
192 $5]
193 m4_ifval([$6], [%union
194 {
195 int ival;
196 }])
197 AT_LALR1_CC_IF([%define global_tokens_and_yystype])
198 m4_ifval([$6], [[%code provides {]], [[%code {]])
199 AT_LALR1_CC_IF([typedef yy::location YYLTYPE;])
200 [static int yylex (]AT_LEX_FORMALS[);
201 ]AT_LALR1_CC_IF([], [static void yyerror (const char *msg);])
202 [}
203
204 ]m4_ifval([$6], [%type <ival> '(' 'x' 'y' ')' ';' thing line input END])[
205
206 /* FIXME: This %printer isn't actually tested. */
207 %printer
208 {
209 ]AT_LALR1_CC_IF([debug_stream () << $$;],
210 [fprintf (yyoutput, "%d", $$)])[;
211 }
212 input line thing 'x' 'y'
213
214 %destructor
215 { printf ("Freeing nterm input (%d@%d-%d)\n", $$, RANGE (@$)); }
216 input
217
218 %destructor
219 { printf ("Freeing nterm line (%d@%d-%d)\n", $$, RANGE (@$)); }
220 line
221
222 %destructor
223 { printf ("Freeing nterm thing (%d@%d-%d)\n", $$, RANGE (@$)); }
224 thing
225
226 %destructor
227 { printf ("Freeing token 'x' (%d@%d-%d)\n", $$, RANGE (@$)); }
228 'x'
229
230 %destructor
231 { printf ("Freeing token 'y' (%d@%d-%d)\n", $$, RANGE (@$)); }
232 'y'
233
234 %token END 0
235 %destructor
236 { printf ("Freeing token END (%d@%d-%d)\n", $$, RANGE (@$)); }
237 END
238
239 %%
240 /*
241 This grammar is made to exercise error recovery.
242 "Lines" starting with `(' support error recovery, with
243 ')' as synchronizing token. Lines starting with 'x' can never
244 be recovered from if in error.
245 */
246
247 input:
248 /* Nothing. */
249 {
250 $$ = 0;
251 printf ("input (%d@%d-%d): /* Nothing */\n", $$, RANGE (@$));
252 }
253 | line input /* Right recursive to load the stack so that popping at
254 END can be exercised. */
255 {
256 $$ = 2;
257 printf ("input (%d@%d-%d): line (%d@%d-%d) input (%d@%d-%d)\n",
258 $$, RANGE (@$), $1, RANGE (@1), $2, RANGE (@2));
259 }
260 ;
261
262 line:
263 thing thing thing ';'
264 {
265 $$ = $1;
266 printf ("line (%d@%d-%d): thing (%d@%d-%d) thing (%d@%d-%d) thing (%d@%d-%d) ';' (%d@%d-%d)\n",
267 $$, RANGE (@$), $1, RANGE (@1), $2, RANGE (@2),
268 $3, RANGE (@3), $4, RANGE (@4));
269 }
270 | '(' thing thing ')'
271 {
272 $$ = $1;
273 printf ("line (%d@%d-%d): '(' (%d@%d-%d) thing (%d@%d-%d) thing (%d@%d-%d) ')' (%d@%d-%d)\n",
274 $$, RANGE (@$), $1, RANGE (@1), $2, RANGE (@2),
275 $3, RANGE (@3), $4, RANGE (@4));
276 }
277 | '(' thing ')'
278 {
279 $$ = $1;
280 printf ("line (%d@%d-%d): '(' (%d@%d-%d) thing (%d@%d-%d) ')' (%d@%d-%d)\n",
281 $$, RANGE (@$), $1, RANGE (@1), $2, RANGE (@2), $3, RANGE (@3));
282 }
283 | '(' error ')'
284 {
285 $$ = -1;
286 printf ("line (%d@%d-%d): '(' (%d@%d-%d) error (@%d-%d) ')' (%d@%d-%d)\n",
287 $$, RANGE (@$), $1, RANGE (@1), RANGE (@2), $3, RANGE (@3));
288 }
289 ;
290
291 thing:
292 'x'
293 {
294 $$ = $1;
295 printf ("thing (%d@%d-%d): 'x' (%d@%d-%d)\n",
296 $$, RANGE (@$), $1, RANGE (@1));
297 }
298 ;
299 %%
300 /* Alias to ARGV[1]. */
301 const char *source = 0;
302
303 static int
304 yylex (]AT_LEX_FORMALS[)
305 {
306 static unsigned int counter = 0;
307
308 int c = ]AT_VAL[]m4_ifval([$6], [.ival])[ = counter++;
309 /* As in BASIC, line numbers go from 10 to 10. */
310 ]AT_LALR1_CC_IF(
311 [ AT_LOC.begin.line = AT_LOC.begin.column = 10 * c;
312 AT_LOC.end.line = AT_LOC.end.column = AT_LOC.begin.line + 9;
313 ],
314 [ AT_LOC.first_line = AT_LOC.first_column = 10 * c;
315 AT_LOC.last_line = AT_LOC.last_column = AT_LOC.first_line + 9;
316 ])[
317
318 if (! (0 <= c && c <= strlen (source)))
319 abort ();
320 if (source[c])
321 printf ("sending: '%c'", source[c]);
322 else
323 printf ("sending: END");
324 printf (" (%d@%d-%d)\n", c, RANGE (]AT_LOC[));
325 return source[c];
326 }
327
328 ]AT_LALR1_CC_IF(
329 [/* A C++ error reporting function. */
330 void
331 yy::parser::error (const location& l, const std::string& m)
332 {
333 printf ("%d-%d: %s\n", RANGE (l), m.c_str());
334 }
335
336 static bool yydebug;
337 int
338 yyparse ()
339 {
340 yy::parser parser;
341 parser.set_debug_level (yydebug);
342 return parser.parse ();
343 }
344 ],
345 [static void
346 yyerror (const char *msg)
347 {
348 printf ("%d-%d: %s\n", RANGE (yylloc), msg);
349 }])[
350
351 int
352 main (int argc, const char *argv[])
353 {
354 int status;
355 yydebug = !!getenv ("YYDEBUG");
356 assert (argc == 2);
357 source = argv[1];
358 status = yyparse ();
359 switch (status)
360 {
361 case 0: printf ("Successful parse.\n"); break;
362 case 1: printf ("Parsing FAILED.\n"); break;
363 default: printf ("Parsing FAILED (status %d).\n", status); break;
364 }
365 return status;
366 }
367 ]])
368
369 AT_LALR1_CC_IF(
370 [AT_BISON_CHECK([-o input.cc input.y])
371 AT_COMPILE_CXX([input])],
372 [AT_BISON_CHECK([-o input.c input.y])
373 AT_COMPILE([input])])
374
375
376 # Check the location of "empty"
377 # -----------------------------
378 # I.e., epsilon-reductions, as in "(x)" which ends by reducing
379 # an empty "line" nterm.
380 # FIXME: This location is not satisfying. Depend on the lookahead?
381 AT_PARSER_CHECK([./input '(x)'], 0,
382 [[sending: '(' (0@0-9)
383 sending: 'x' (1@10-19)
384 thing (1@10-19): 'x' (1@10-19)
385 sending: ')' (2@20-29)
386 line (0@0-29): '(' (0@0-9) thing (1@10-19) ')' (2@20-29)
387 sending: END (3@30-39)
388 input (0@29-29): /* Nothing */
389 input (2@0-29): line (0@0-29) input (0@29-29)
390 Freeing token END (3@30-39)
391 Freeing nterm input (2@0-29)
392 Successful parse.
393 ]])
394
395
396 # Check locations in error recovery
397 # ---------------------------------
398 # '(y)' is an error, but can be recovered from. But what's the location
399 # of the error itself ('y'), and of the resulting reduction ('(error)').
400 AT_PARSER_CHECK([./input '(y)'], 0,
401 [[sending: '(' (0@0-9)
402 sending: 'y' (1@10-19)
403 10-19: syntax error, unexpected 'y', expecting 'x'
404 Freeing token 'y' (1@10-19)
405 sending: ')' (2@20-29)
406 line (-1@0-29): '(' (0@0-9) error (@10-19) ')' (2@20-29)
407 sending: END (3@30-39)
408 input (0@29-29): /* Nothing */
409 input (2@0-29): line (-1@0-29) input (0@29-29)
410 Freeing token END (3@30-39)
411 Freeing nterm input (2@0-29)
412 Successful parse.
413 ]])
414
415
416 # Syntax errors caught by the parser
417 # ----------------------------------
418 # Exercise the discarding of stack top and input until `error'
419 # can be reduced.
420 #
421 # '(', 'x', 'x', 'x', 'x', 'x', ')',
422 #
423 # Load the stack and provoke an error that cannot be caught by the
424 # grammar, to check that the stack is cleared. And make sure the
425 # lookahead is freed.
426 #
427 # '(', 'x', ')',
428 # '(', 'x', ')',
429 # 'y'
430 AT_PARSER_CHECK([./input '(xxxxx)(x)(x)y'], 1,
431 [[sending: '(' (0@0-9)
432 sending: 'x' (1@10-19)
433 thing (1@10-19): 'x' (1@10-19)
434 sending: 'x' (2@20-29)
435 thing (2@20-29): 'x' (2@20-29)
436 sending: 'x' (3@30-39)
437 30-39: syntax error, unexpected 'x', expecting ')'
438 Freeing nterm thing (2@20-29)
439 Freeing nterm thing (1@10-19)
440 Freeing token 'x' (3@30-39)
441 sending: 'x' (4@40-49)
442 Freeing token 'x' (4@40-49)
443 sending: 'x' (5@50-59)
444 Freeing token 'x' (5@50-59)
445 sending: ')' (6@60-69)
446 line (-1@0-69): '(' (0@0-9) error (@10-59) ')' (6@60-69)
447 sending: '(' (7@70-79)
448 sending: 'x' (8@80-89)
449 thing (8@80-89): 'x' (8@80-89)
450 sending: ')' (9@90-99)
451 line (7@70-99): '(' (7@70-79) thing (8@80-89) ')' (9@90-99)
452 sending: '(' (10@100-109)
453 sending: 'x' (11@110-119)
454 thing (11@110-119): 'x' (11@110-119)
455 sending: ')' (12@120-129)
456 line (10@100-129): '(' (10@100-109) thing (11@110-119) ')' (12@120-129)
457 sending: 'y' (13@130-139)
458 input (0@129-129): /* Nothing */
459 input (2@100-129): line (10@100-129) input (0@129-129)
460 input (2@70-129): line (7@70-99) input (2@100-129)
461 input (2@0-129): line (-1@0-69) input (2@70-129)
462 130-139: syntax error, unexpected 'y', expecting END
463 Freeing nterm input (2@0-129)
464 Freeing token 'y' (13@130-139)
465 Parsing FAILED.
466 ]])
467
468
469 # Syntax error caught by the parser where lookahead = END
470 # --------------------------------------------------------
471 # Load the stack and provoke an error that cannot be caught by the
472 # grammar, to check that the stack is cleared. And make sure the
473 # lookahead is freed.
474 #
475 # '(', 'x', ')',
476 # '(', 'x', ')',
477 # 'x'
478 AT_PARSER_CHECK([./input '(x)(x)x'], 1,
479 [[sending: '(' (0@0-9)
480 sending: 'x' (1@10-19)
481 thing (1@10-19): 'x' (1@10-19)
482 sending: ')' (2@20-29)
483 line (0@0-29): '(' (0@0-9) thing (1@10-19) ')' (2@20-29)
484 sending: '(' (3@30-39)
485 sending: 'x' (4@40-49)
486 thing (4@40-49): 'x' (4@40-49)
487 sending: ')' (5@50-59)
488 line (3@30-59): '(' (3@30-39) thing (4@40-49) ')' (5@50-59)
489 sending: 'x' (6@60-69)
490 thing (6@60-69): 'x' (6@60-69)
491 sending: END (7@70-79)
492 70-79: syntax error, unexpected END, expecting 'x'
493 Freeing nterm thing (6@60-69)
494 Freeing nterm line (3@30-59)
495 Freeing nterm line (0@0-29)
496 Freeing token END (7@70-79)
497 Parsing FAILED.
498 ]])
499
500
501 # Check destruction upon stack overflow
502 # -------------------------------------
503 # Upon stack overflow, all symbols on the stack should be destroyed.
504 # Only check for yacc.c.
505 AT_YACC_IF([
506 AT_PARSER_CHECK([./input '(x)(x)(x)(x)(x)(x)(x)'], 2,
507 [[sending: '(' (0@0-9)
508 sending: 'x' (1@10-19)
509 thing (1@10-19): 'x' (1@10-19)
510 sending: ')' (2@20-29)
511 line (0@0-29): '(' (0@0-9) thing (1@10-19) ')' (2@20-29)
512 sending: '(' (3@30-39)
513 sending: 'x' (4@40-49)
514 thing (4@40-49): 'x' (4@40-49)
515 sending: ')' (5@50-59)
516 line (3@30-59): '(' (3@30-39) thing (4@40-49) ')' (5@50-59)
517 sending: '(' (6@60-69)
518 sending: 'x' (7@70-79)
519 thing (7@70-79): 'x' (7@70-79)
520 sending: ')' (8@80-89)
521 line (6@60-89): '(' (6@60-69) thing (7@70-79) ')' (8@80-89)
522 sending: '(' (9@90-99)
523 sending: 'x' (10@100-109)
524 thing (10@100-109): 'x' (10@100-109)
525 sending: ')' (11@110-119)
526 line (9@90-119): '(' (9@90-99) thing (10@100-109) ')' (11@110-119)
527 sending: '(' (12@120-129)
528 sending: 'x' (13@130-139)
529 thing (13@130-139): 'x' (13@130-139)
530 sending: ')' (14@140-149)
531 line (12@120-149): '(' (12@120-129) thing (13@130-139) ')' (14@140-149)
532 sending: '(' (15@150-159)
533 sending: 'x' (16@160-169)
534 thing (16@160-169): 'x' (16@160-169)
535 sending: ')' (17@170-179)
536 line (15@150-179): '(' (15@150-159) thing (16@160-169) ')' (17@170-179)
537 sending: '(' (18@180-189)
538 sending: 'x' (19@190-199)
539 thing (19@190-199): 'x' (19@190-199)
540 sending: ')' (20@200-209)
541 200-209: memory exhausted
542 Freeing nterm thing (19@190-199)
543 Freeing nterm line (15@150-179)
544 Freeing nterm line (12@120-149)
545 Freeing nterm line (9@90-119)
546 Freeing nterm line (6@60-89)
547 Freeing nterm line (3@30-59)
548 Freeing nterm line (0@0-29)
549 Parsing FAILED (status 2).
550 ]])
551 ])
552
553 ])
554
555
556 # AT_CHECK_PRINTER_AND_DESTRUCTOR([BISON-OPTIONS], [UNION-FLAG], [SKIP_FLAG])
557 # ---------------------------------------------------------------------------
558 m4_define([AT_CHECK_PRINTER_AND_DESTRUCTOR],
559 [AT_SETUP([Printers and Destructors $2: $1])
560
561 $3
562 _AT_CHECK_PRINTER_AND_DESTRUCTOR($[1], $[2], $[3], $[4],
563 [%error-verbose
564 %debug
565 %verbose
566 %locations
567 $1], [$2])
568
569 AT_CLEANUP
570 ])
571
572
573 AT_CHECK_PRINTER_AND_DESTRUCTOR([])
574 AT_CHECK_PRINTER_AND_DESTRUCTOR([], [with union])
575
576 AT_CHECK_PRINTER_AND_DESTRUCTOR([%defines %skeleton "lalr1.cc"])
577 AT_CHECK_PRINTER_AND_DESTRUCTOR([%defines %skeleton "lalr1.cc"], [with union])
578
579 AT_CHECK_PRINTER_AND_DESTRUCTOR([%glr-parser])
580 AT_CHECK_PRINTER_AND_DESTRUCTOR([%glr-parser], [with union])
581
582
583
584 ## ----------------------------------------- ##
585 ## Default tagless %printer and %destructor. ##
586 ## ----------------------------------------- ##
587
588 # Check that the right %printer and %destructor are called, that they're not
589 # called for $end, and that $$ and @$ work correctly.
590
591 AT_SETUP([Default tagless %printer and %destructor])
592
593 AT_DATA_GRAMMAR([[input.y]],
594 [[%error-verbose
595 %debug
596 %locations
597 %initial-action {
598 @$.first_line = @$.last_line = 1;
599 @$.first_column = @$.last_column = 1;
600 }
601
602 %{
603 # include <stdio.h>
604 # include <stdlib.h>
605 static void yyerror (const char *msg);
606 static int yylex (void);
607 # define USE(SYM)
608 %}
609
610 %printer {
611 fprintf (yyoutput, "<*> printer should not be called.\n");
612 } <*>
613
614 %printer {
615 fprintf (yyoutput, "<> printer for '%c' @ %d", $$, @$.first_column);
616 } <>
617 %destructor {
618 fprintf (stdout, "<> destructor for '%c' @ %d.\n", $$, @$.first_column);
619 } <>
620
621 %printer {
622 fprintf (yyoutput, "'b'/'c' printer for '%c' @ %d", $$, @$.first_column);
623 } 'b' 'c'
624 %destructor {
625 fprintf (stdout, "'b'/'c' destructor for '%c' @ %d.\n", $$, @$.first_column);
626 } 'b' 'c'
627
628 %destructor {
629 fprintf (yyoutput, "<*> destructor should not be called.\n");
630 } <*>
631
632 %%
633
634 start: 'a' 'b' 'c' 'd' 'e' { $$ = 'S'; USE(($1, $2, $3, $4, $5)); } ;
635
636 %%
637
638 static int
639 yylex (void)
640 {
641 static char const input[] = "abcd";
642 static size_t toknum;
643 if (! (toknum < sizeof input))
644 abort ();
645 yylval = input[toknum++];
646 yylloc.first_line = yylloc.last_line = 1;
647 yylloc.first_column = yylloc.last_column = toknum;
648 return yylval;
649 }
650
651 static void
652 yyerror (const char *msg)
653 {
654 fprintf (stderr, "%s\n", msg);
655 }
656
657 int
658 main (void)
659 {
660 yydebug = 1;
661 return yyparse ();
662 }
663 ]])
664
665 AT_BISON_CHECK([-o input.c input.y])
666 AT_COMPILE([input])
667 AT_PARSER_CHECK([./input], 1,
668 [[<> destructor for 'd' @ 4.
669 'b'/'c' destructor for 'c' @ 3.
670 'b'/'c' destructor for 'b' @ 2.
671 <> destructor for 'a' @ 1.
672 ]],
673 [[Starting parse
674 Entering state 0
675 Reading a token: Next token is token 'a' (1.1-1.1: <> printer for 'a' @ 1)
676 Shifting token 'a' (1.1-1.1: <> printer for 'a' @ 1)
677 Entering state 1
678 Reading a token: Next token is token 'b' (1.2-1.2: 'b'/'c' printer for 'b' @ 2)
679 Shifting token 'b' (1.2-1.2: 'b'/'c' printer for 'b' @ 2)
680 Entering state 3
681 Reading a token: Next token is token 'c' (1.3-1.3: 'b'/'c' printer for 'c' @ 3)
682 Shifting token 'c' (1.3-1.3: 'b'/'c' printer for 'c' @ 3)
683 Entering state 5
684 Reading a token: Next token is token 'd' (1.4-1.4: <> printer for 'd' @ 4)
685 Shifting token 'd' (1.4-1.4: <> printer for 'd' @ 4)
686 Entering state 6
687 Reading a token: Now at end of input.
688 syntax error, unexpected $end, expecting 'e'
689 Error: popping token 'd' (1.4-1.4: <> printer for 'd' @ 4)
690 Stack now 0 1 3 5
691 Error: popping token 'c' (1.3-1.3: 'b'/'c' printer for 'c' @ 3)
692 Stack now 0 1 3
693 Error: popping token 'b' (1.2-1.2: 'b'/'c' printer for 'b' @ 2)
694 Stack now 0 1
695 Error: popping token 'a' (1.1-1.1: <> printer for 'a' @ 1)
696 Stack now 0
697 Cleanup: discarding lookahead token $end (1.5-1.5: )
698 Stack now 0
699 ]])
700
701 AT_CLEANUP
702
703
704
705 ## ------------------------------------------------------ ##
706 ## Default tagged and per-type %printer and %destructor. ##
707 ## ------------------------------------------------------ ##
708
709 AT_SETUP([Default tagged and per-type %printer and %destructor])
710
711 AT_DATA_GRAMMAR([[input.y]],
712 [[%error-verbose
713 %debug
714
715 %{
716 # include <stdio.h>
717 # include <stdlib.h>
718 static void yyerror (const char *msg);
719 static int yylex (void);
720 # define USE(SYM)
721 %}
722
723 %printer {
724 fprintf (yyoutput, "<> printer should not be called.\n");
725 } <>
726
727 %union { int field0; int field1; int field2; }
728 %type <field0> start 'a' 'g'
729 %type <field1> 'e'
730 %type <field2> 'f'
731 %printer {
732 fprintf (yyoutput, "<*>/<field2>/e printer");
733 } <*> 'e' <field2>
734 %destructor {
735 fprintf (stdout, "<*>/<field2>/e destructor.\n");
736 } <*> 'e' <field2>
737
738 %type <field1> 'b'
739 %printer { fprintf (yyoutput, "<field1> printer"); } <field1>
740 %destructor { fprintf (stdout, "<field1> destructor.\n"); } <field1>
741
742 %type <field0> 'c'
743 %printer { fprintf (yyoutput, "'c' printer"); } 'c'
744 %destructor { fprintf (stdout, "'c' destructor.\n"); } 'c'
745
746 %type <field1> 'd'
747 %printer { fprintf (yyoutput, "'d' printer"); } 'd'
748 %destructor { fprintf (stdout, "'d' destructor.\n"); } 'd'
749
750 %destructor {
751 fprintf (yyoutput, "<> destructor should not be called.\n");
752 } <>
753
754 %%
755
756 start:
757 'a' 'b' 'c' 'd' 'e' 'f' 'g'
758 {
759 USE(($1, $2, $3, $4, $5, $6, $7));
760 $$ = 'S';
761 }
762 ;
763
764 %%
765
766 static int
767 yylex (void)
768 {
769 static char const input[] = "abcdef";
770 static size_t toknum;
771 if (! (toknum < sizeof input))
772 abort ();
773 return input[toknum++];
774 }
775
776 static void
777 yyerror (const char *msg)
778 {
779 fprintf (stderr, "%s\n", msg);
780 }
781
782 int
783 main (void)
784 {
785 yydebug = 1;
786 return yyparse ();
787 }
788 ]])
789
790 AT_BISON_CHECK([-o input.c input.y])
791 AT_COMPILE([input])
792 AT_PARSER_CHECK([./input], 1,
793 [[<*>/<field2>/e destructor.
794 <*>/<field2>/e destructor.
795 'd' destructor.
796 'c' destructor.
797 <field1> destructor.
798 <*>/<field2>/e destructor.
799 ]],
800 [[Starting parse
801 Entering state 0
802 Reading a token: Next token is token 'a' (<*>/<field2>/e printer)
803 Shifting token 'a' (<*>/<field2>/e printer)
804 Entering state 1
805 Reading a token: Next token is token 'b' (<field1> printer)
806 Shifting token 'b' (<field1> printer)
807 Entering state 3
808 Reading a token: Next token is token 'c' ('c' printer)
809 Shifting token 'c' ('c' printer)
810 Entering state 5
811 Reading a token: Next token is token 'd' ('d' printer)
812 Shifting token 'd' ('d' printer)
813 Entering state 6
814 Reading a token: Next token is token 'e' (<*>/<field2>/e printer)
815 Shifting token 'e' (<*>/<field2>/e printer)
816 Entering state 7
817 Reading a token: Next token is token 'f' (<*>/<field2>/e printer)
818 Shifting token 'f' (<*>/<field2>/e printer)
819 Entering state 8
820 Reading a token: Now at end of input.
821 syntax error, unexpected $end, expecting 'g'
822 Error: popping token 'f' (<*>/<field2>/e printer)
823 Stack now 0 1 3 5 6 7
824 Error: popping token 'e' (<*>/<field2>/e printer)
825 Stack now 0 1 3 5 6
826 Error: popping token 'd' ('d' printer)
827 Stack now 0 1 3 5
828 Error: popping token 'c' ('c' printer)
829 Stack now 0 1 3
830 Error: popping token 'b' (<field1> printer)
831 Stack now 0 1
832 Error: popping token 'a' (<*>/<field2>/e printer)
833 Stack now 0
834 Cleanup: discarding lookahead token $end ()
835 Stack now 0
836 ]])
837
838 AT_CLEANUP
839
840
841
842 ## ------------------------------------------------------------- ##
843 ## Default %printer and %destructor for user-defined end token. ##
844 ## ------------------------------------------------------------- ##
845
846 AT_SETUP([Default %printer and %destructor for user-defined end token])
847
848 # _AT_CHECK_DEFAULT_PRINTER_AND_DESTRUCTOR_FOR_END_TOKEN(TYPED)
849 # -----------------------------------------------------------------------------
850 m4_define([_AT_CHECK_DEFAULT_PRINTER_AND_DESTRUCTOR_FOR_END_TOKEN],
851 [m4_if($1, 0,
852 [m4_pushdef([kind], []) m4_pushdef([not_kind], [*])],
853 [m4_pushdef([kind], [*]) m4_pushdef([not_kind], [])])
854
855 AT_DATA_GRAMMAR([[input]]$1[[.y]],
856 [[%error-verbose
857 %debug
858 %locations
859 %initial-action {
860 @$.first_line = @$.last_line = 1;
861 @$.first_column = @$.last_column = 1;
862 }
863
864 %{
865 # include <stdio.h>
866 # include <stdlib.h>
867 static void yyerror (const char *msg);
868 static int yylex (void);
869 # define USE(SYM)
870 %}
871
872 %destructor {
873 fprintf (yyoutput, "<]]not_kind[[> destructor should not be called.\n");
874 } <]]not_kind[[>
875
876 %token END 0
877 %printer {
878 fprintf (yyoutput, "<]]kind[[> for '%c' @ %d", $$, @$.first_column);
879 } <]]kind[[>
880 %destructor {
881 fprintf (stdout, "<]]kind[[> for '%c' @ %d.\n", $$, @$.first_column);
882 } <]]kind[[>
883
884 %printer {
885 fprintf (yyoutput, "<]]not_kind[[> printer should not be called.\n");
886 } <]]not_kind[[>
887
888 ]]m4_if($1, 0, [[[
889 ]]],
890 [[[%union { char tag; }
891 %type <tag> start END]]])[[
892
893 %%
894
895 start: { $$ = 'S'; } ;
896
897 %%
898
899 static int
900 yylex (void)
901 {
902 static int called;
903 if (called++)
904 abort ();
905 yylval]]m4_if($1, 0,, [[[.tag]]])[[ = 'E';
906 yylloc.first_line = yylloc.last_line = 1;
907 yylloc.first_column = yylloc.last_column = 1;
908 return 0;
909 }
910
911 static void
912 yyerror (const char *msg)
913 {
914 fprintf (stderr, "%s\n", msg);
915 }
916
917 int
918 main (void)
919 {
920 yydebug = 1;
921 return yyparse ();
922 }
923 ]])
924
925 AT_BISON_CHECK([-o input$1.c input$1.y])
926 AT_COMPILE([input$1])
927 AT_PARSER_CHECK([./input$1], 0,
928 [[<]]kind[[> for 'E' @ 1.
929 <]]kind[[> for 'S' @ 1.
930 ]],
931 [[Starting parse
932 Entering state 0
933 Reducing stack by rule 1 (line 46):
934 -> $$ = nterm start (1.1-1.1: <]]kind[[> for 'S' @ 1)
935 Stack now 0
936 Entering state 1
937 Reading a token: Now at end of input.
938 Shifting token END (1.1-1.1: <]]kind[[> for 'E' @ 1)
939 Entering state 2
940 Stack now 0 1 2
941 Cleanup: popping token END (1.1-1.1: <]]kind[[> for 'E' @ 1)
942 Cleanup: popping nterm start (1.1-1.1: <]]kind[[> for 'S' @ 1)
943 ]])
944
945 m4_popdef([kind])
946 m4_popdef([not_kind])
947 ])
948
949 _AT_CHECK_DEFAULT_PRINTER_AND_DESTRUCTOR_FOR_END_TOKEN(0)
950 _AT_CHECK_DEFAULT_PRINTER_AND_DESTRUCTOR_FOR_END_TOKEN(1)
951
952 AT_CLEANUP
953
954
955
956 ## ------------------------------------------------------------------ ##
957 ## Default %printer and %destructor are not for error or $undefined. ##
958 ## ------------------------------------------------------------------ ##
959
960 AT_SETUP([Default %printer and %destructor are not for error or $undefined])
961
962 # If Bison were to apply the default %printer and %destructor to the error
963 # token or to $undefined:
964 # - For the error token:
965 # - It would generate warnings for unused $n.
966 # - It would invoke the %printer and %destructor on the error token's
967 # semantic value, which would be initialized from the lookahead, which
968 # would be destroyed separately.
969 # - For $undefined, who knows what the semantic value would be.
970
971 AT_DATA_GRAMMAR([[input.y]],
972 [[%debug
973
974 %{
975 # include <stdio.h>
976 # include <stdlib.h>
977 static void yyerror (const char *msg);
978 static int yylex (void);
979 # define USE(SYM)
980 %}
981
982 %printer {
983 fprintf (yyoutput, "'%c'", $$);
984 } <> <*>
985 %destructor {
986 fprintf (stderr, "DESTROY '%c'\n", $$);
987 } <> <*>
988
989 %%
990
991 start:
992 { $$ = 'S'; }
993 /* In order to reveal the problems that this bug caused during parsing, add
994 * $2 to USE. */
995 | 'a' error 'b' 'c' { USE(($1, $3, $4)); $$ = 'S'; }
996 ;
997
998 %%
999
1000 static int
1001 yylex (void)
1002 {
1003 static char const input[] = "abd";
1004 static size_t toknum;
1005 if (! (toknum < sizeof input))
1006 abort ();
1007 yylval = input[toknum++];
1008 return yylval;
1009 }
1010
1011 static void
1012 yyerror (const char *msg)
1013 {
1014 fprintf (stderr, "%s\n", msg);
1015 }
1016
1017 int
1018 main (void)
1019 {
1020 yydebug = 1;
1021 return yyparse ();
1022 }
1023 ]])
1024
1025 AT_BISON_CHECK([-o input.c input.y])
1026 AT_COMPILE([input])
1027 AT_PARSER_CHECK([./input], [1], [],
1028 [[Starting parse
1029 Entering state 0
1030 Reading a token: Next token is token 'a' ('a')
1031 Shifting token 'a' ('a')
1032 Entering state 1
1033 Reading a token: Next token is token 'b' ('b')
1034 syntax error
1035 Shifting token error ()
1036 Entering state 3
1037 Next token is token 'b' ('b')
1038 Shifting token 'b' ('b')
1039 Entering state 5
1040 Reading a token: Next token is token $undefined ()
1041 Error: popping token 'b' ('b')
1042 DESTROY 'b'
1043 Stack now 0 1 3
1044 Error: popping token error ()
1045 Stack now 0 1
1046 Shifting token error ()
1047 Entering state 3
1048 Next token is token $undefined ()
1049 Error: discarding token $undefined ()
1050 Error: popping token error ()
1051 Stack now 0 1
1052 Shifting token error ()
1053 Entering state 3
1054 Reading a token: Now at end of input.
1055 Cleanup: discarding lookahead token $end ()
1056 Stack now 0 1 3
1057 Cleanup: popping token error ()
1058 Cleanup: popping token 'a' ('a')
1059 DESTROY 'a'
1060 ]])
1061
1062 AT_CLEANUP
1063
1064
1065
1066 ## ------------------------------------------------------ ##
1067 ## Default %printer and %destructor are not for $accept. ##
1068 ## ------------------------------------------------------ ##
1069
1070 AT_SETUP([Default %printer and %destructor are not for $accept])
1071
1072 # If YYSTYPE is a union and Bison were to apply the default %printer and
1073 # %destructor to $accept:
1074 # - The %printer and %destructor code generated for $accept would always be
1075 # dead code because $accept is currently never shifted onto the stack.
1076 # - $$ for $accept would always be of type YYSTYPE because it's not possible
1077 # to declare `%type <field> $accept'. (Also true for $undefined.)
1078 # - Thus, the compiler might complain that the user code assumes the wrong
1079 # type for $$ since the code might assume the type associated with a
1080 # specific union field, which is especially reasonable in C++ since that
1081 # type may be a base type. This test case checks for this problem. (Also
1082 # true for $undefined and the error token, so there are three warnings for
1083 # %printer and three for %destructor.)
1084
1085 AT_DATA_GRAMMAR([[input.y]],
1086 [[%debug /* So that %printer is actually compiled. */
1087
1088 %{
1089 # include <stdio.h>
1090 # include <stdlib.h>
1091 static void yyerror (const char *msg);
1092 static int yylex (void);
1093 # define USE(SYM)
1094 %}
1095
1096 %printer {
1097 char chr = $$;
1098 fprintf (yyoutput, "'%c'", chr);
1099 } <> <*>
1100 %destructor {
1101 char chr = $$;
1102 fprintf (stderr, "DESTROY '%c'\n", chr);
1103 } <> <*>
1104
1105 %union { char chr; }
1106 %type <chr> start
1107
1108 %%
1109
1110 start: { USE($$); } ;
1111
1112 %%
1113
1114 static int
1115 yylex (void)
1116 {
1117 static int called;
1118 if (called++)
1119 abort ();
1120 return 0;
1121 }
1122
1123 static void
1124 yyerror (const char *msg)
1125 {
1126 fprintf (stderr, "%s\n", msg);
1127 }
1128
1129 int
1130 main (void)
1131 {
1132 return yyparse ();
1133 }
1134 ]])
1135
1136 AT_BISON_CHECK([-o input.c input.y])
1137 AT_COMPILE([input])
1138
1139 AT_CLEANUP
1140
1141
1142
1143 ## ------------------------------------------------------ ##
1144 ## Default %printer and %destructor for mid-rule values. ##
1145 ## ------------------------------------------------------ ##
1146
1147 AT_SETUP([Default %printer and %destructor for mid-rule values])
1148
1149 AT_DATA_GRAMMAR([[input.y]],
1150 [[%debug /* So that %printer is actually compiled. */
1151
1152 %{
1153 # include <stdio.h>
1154 # include <stdlib.h>
1155 static void yyerror (const char *msg);
1156 static int yylex (void);
1157 # define USE(SYM)
1158 # define YYLTYPE int
1159 # define YYLLOC_DEFAULT(Current, Rhs, N)
1160 # define YY_LOCATION_PRINT(File, Loc)
1161 %}
1162
1163 %printer { fprintf (yyoutput, "%d", @$); } <>
1164 %destructor { fprintf (stderr, "DESTROY %d\n", @$); } <>
1165 %printer { fprintf (yyoutput, "<*> printer should not be called"); } <*>
1166 %destructor { fprintf (yyoutput, "<*> destructor should not be called"); } <*>
1167
1168 %%
1169
1170 start:
1171 { @$ = 1; } // Not set or used.
1172 { USE ($$); @$ = 2; } // Both set and used.
1173 { USE ($$); @$ = 3; } // Only set.
1174 { @$ = 4; } // Only used.
1175 'c'
1176 { USE (($$, $2, $4, $5)); @$ = 0; }
1177 ;
1178
1179 %%
1180
1181 static int
1182 yylex (void)
1183 {
1184 static int called;
1185 if (called++)
1186 abort ();
1187 return 0;
1188 }
1189
1190 static void
1191 yyerror (const char *msg)
1192 {
1193 fprintf (stderr, "%s\n", msg);
1194 }
1195
1196 int
1197 main (void)
1198 {
1199 yydebug = 1;
1200 return yyparse ();
1201 }
1202 ]])
1203
1204 AT_BISON_CHECK([-o input.c input.y], 0,,
1205 [[input.y:33.3-23: warning: unset value: $$
1206 input.y:30.3-35.37: warning: unused value: $3
1207 ]])
1208
1209 AT_COMPILE([input])
1210 AT_PARSER_CHECK([./input], 1,,
1211 [[Starting parse
1212 Entering state 0
1213 Reducing stack by rule 1 (line 30):
1214 -> $$ = nterm $@1 (: )
1215 Stack now 0
1216 Entering state 2
1217 Reducing stack by rule 2 (line 31):
1218 -> $$ = nterm @2 (: 2)
1219 Stack now 0 2
1220 Entering state 4
1221 Reducing stack by rule 3 (line 32):
1222 -> $$ = nterm @3 (: 3)
1223 Stack now 0 2 4
1224 Entering state 5
1225 Reducing stack by rule 4 (line 33):
1226 -> $$ = nterm @4 (: 4)
1227 Stack now 0 2 4 5
1228 Entering state 6
1229 Reading a token: Now at end of input.
1230 syntax error
1231 Error: popping nterm @4 (: 4)
1232 DESTROY 4
1233 Stack now 0 2 4 5
1234 Error: popping nterm @3 (: 3)
1235 DESTROY 3
1236 Stack now 0 2 4
1237 Error: popping nterm @2 (: 2)
1238 DESTROY 2
1239 Stack now 0 2
1240 Error: popping nterm $@1 (: )
1241 Stack now 0
1242 Cleanup: discarding lookahead token $end (: )
1243 Stack now 0
1244 ]])
1245
1246 AT_CLEANUP
1247
1248
1249 ## ----------------------- ##
1250 ## @$ implies %locations. ##
1251 ## ----------------------- ##
1252
1253 # Bison once forgot to check for @$ in actions other than semantic actions.
1254
1255 # AT_CHECK_ACTION_LOCATIONS(ACTION-DIRECTIVE)
1256 # -------------------------------------------------------
1257 m4_define([AT_CHECK_ACTION_LOCATIONS],
1258 [AT_SETUP([[@$ in ]$1[ implies %locations]])
1259
1260 AT_DATA_GRAMMAR([[input.y]],
1261 [[%code {
1262 #include <stdio.h>
1263 static int yylex (void);
1264 static void yyerror (char const *msg);
1265 }
1266
1267 %debug
1268
1269 ]$1[ {
1270 printf ("%d\n", @$.first_line);
1271 } ]m4_if($1, [%initial-action], [], [[start]])[
1272
1273 %%
1274
1275 start: ;
1276
1277 %%
1278
1279 static int
1280 yylex (void)
1281 {
1282 return 0;
1283 }
1284
1285 static void
1286 yyerror (char const *msg)
1287 {
1288 fprintf (stderr, "%s\n", msg);
1289 }
1290
1291 int
1292 main (void)
1293 {
1294 return yyparse ();
1295 }
1296 ]])
1297
1298 AT_BISON_CHECK([[-o input.c input.y]])
1299 AT_COMPILE([[input]])
1300
1301 AT_CLEANUP])
1302
1303 AT_CHECK_ACTION_LOCATIONS([[%initial-action]])
1304 AT_CHECK_ACTION_LOCATIONS([[%destructor]])
1305 AT_CHECK_ACTION_LOCATIONS([[%printer]])