]>
Commit | Line | Data |
---|---|---|
1 | # Simple calculator. -*- Autotest -*- | |
2 | ||
3 | # Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 Free Software | |
4 | # Foundation, Inc. | |
5 | ||
6 | # This program is free software; you can redistribute it and/or modify | |
7 | # it under the terms of the GNU General Public License as published by | |
8 | # the Free Software Foundation; either version 2, or (at your option) | |
9 | # any later version. | |
10 | ||
11 | # This program is distributed in the hope that it will be useful, | |
12 | # but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | # GNU General Public License for more details. | |
15 | ||
16 | # You should have received a copy of the GNU General Public License | |
17 | # along with this program; if not, write to the Free Software | |
18 | # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA | |
19 | # 02110-1301, USA. | |
20 | ||
21 | ## ---------------------------------------------------- ## | |
22 | ## Compile the grammar described in the documentation. ## | |
23 | ## ---------------------------------------------------- ## | |
24 | ||
25 | ||
26 | # ------------------------- # | |
27 | # Helping Autotest macros. # | |
28 | # ------------------------- # | |
29 | ||
30 | ||
31 | # _AT_DATA_CALC_Y($1, $2, $3, [BISON-DIRECTIVES]) | |
32 | # ----------------------------------------------- | |
33 | # Produce `calc.y'. Don't call this macro directly, because it contains | |
34 | # some occurrences of `$1' etc. which will be interpreted by m4. So | |
35 | # you should call it with $1, $2, and $3 as arguments, which is what | |
36 | # AT_DATA_CALC_Y does. | |
37 | m4_define([_AT_DATA_CALC_Y], | |
38 | [m4_if([$1$2$3], $[1]$[2]$[3], [], | |
39 | [m4_fatal([$0: Invalid arguments: $@])])dnl | |
40 | AT_DATA_GRAMMAR([calc.y], | |
41 | [[/* Infix notation calculator--calc */ | |
42 | ]$4 | |
43 | AT_SKEL_CC_IF( | |
44 | [%define global_tokens_and_yystype])[ | |
45 | %{ | |
46 | #include <stdio.h> | |
47 | ||
48 | #include <stdlib.h> | |
49 | #include <string.h> | |
50 | #if HAVE_UNISTD_H | |
51 | # include <unistd.h> | |
52 | #else | |
53 | # undef alarm | |
54 | # define alarm(seconds) /* empty */ | |
55 | #endif | |
56 | #include <ctype.h> | |
57 | #define USE(Var) | |
58 | ||
59 | /* Exercise pre-prologue dependency to %union. */ | |
60 | typedef int semantic_value; | |
61 | ||
62 | static semantic_value global_result = 0; | |
63 | static int global_count = 0; | |
64 | %} | |
65 | ||
66 | /* Exercise %union. */ | |
67 | %union | |
68 | { | |
69 | semantic_value ival; | |
70 | }; | |
71 | ||
72 | %{ | |
73 | static int power (int base, int exponent); | |
74 | ]AT_SKEL_CC_IF( | |
75 | [#ifndef YYLTYPE | |
76 | [#] define YYLTYPE AT_NAME_PREFIX::location | |
77 | #endif | |
78 | #define first_line begin.line | |
79 | #define first_column begin.column | |
80 | #define last_line end.line | |
81 | #define last_column end.column | |
82 | ], | |
83 | [/* yyerror receives the location if: | |
84 | - %location & %pure & %glr | |
85 | - %location & %pure & %yacc & %parse-param. */ | |
86 | static void yyerror (AT_YYERROR_ARG_LOC_IF([YYLTYPE *llocp, ]) | |
87 | AT_PARAM_IF([semantic_value *result, int *count, ]) | |
88 | const char *s | |
89 | );])[ | |
90 | static int yylex (]AT_LEX_FORMALS[); | |
91 | static int get_char (]AT_LEX_FORMALS[); | |
92 | static void unget_char (]AT_LEX_PRE_FORMALS[ int c); | |
93 | %} | |
94 | ||
95 | ]AT_SKEL_CC_IF( | |
96 | [/* The lalr1.cc skeleton, for backward compatibility, defines | |
97 | a constructor for position that initializes the filename. The | |
98 | glr.cc skeleton does not (and in fact cannot: location/position | |
99 | are stored in a union, from which objects with constructors are | |
100 | excluded in C++. */ | |
101 | %initial-action { | |
102 | @$.initialize (0); | |
103 | } | |
104 | ])[ | |
105 | ||
106 | /* Bison Declarations */ | |
107 | %token CALC_EOF 0 "end of input" | |
108 | %token <ival> NUM "number" | |
109 | %type <ival> exp | |
110 | ||
111 | %nonassoc '=' /* comparison */ | |
112 | %left '-' '+' | |
113 | %left '*' '/' | |
114 | %left NEG /* negation--unary minus */ | |
115 | %right '^' /* exponentiation */ | |
116 | ||
117 | /* Grammar follows */ | |
118 | %% | |
119 | input: | |
120 | line | |
121 | | input line { ]AT_PARAM_IF([++*count; ++global_count;])[ } | |
122 | ; | |
123 | ||
124 | line: | |
125 | '\n' | |
126 | | exp '\n' { ]AT_PARAM_IF([*result = global_result = $1], [USE ($1)])[; } | |
127 | ; | |
128 | ||
129 | exp: | |
130 | NUM { $$ = $1; } | |
131 | | exp '=' exp | |
132 | { | |
133 | if ($1 != $3) | |
134 | fprintf (stderr, "calc: error: %d != %d\n", $1, $3); | |
135 | $$ = $1; | |
136 | } | |
137 | | exp '+' exp { $$ = $1 + $3; } | |
138 | | exp '-' exp { $$ = $1 - $3; } | |
139 | | exp '*' exp { $$ = $1 * $3; } | |
140 | | exp '/' exp { $$ = $1 / $3; } | |
141 | | '-' exp %prec NEG { $$ = -$2; } | |
142 | | exp '^' exp { $$ = power ($1, $3); } | |
143 | | '(' exp ')' { $$ = $2; } | |
144 | | '(' error ')' { $$ = 1111; } | |
145 | | '!' { $$ = 0; YYERROR; } | |
146 | | '-' error { $$ = 0; YYERROR; } | |
147 | ; | |
148 | %% | |
149 | /* The input. */ | |
150 | static FILE *input; | |
151 | ||
152 | ]AT_SKEL_CC_IF( | |
153 | [/* A C++ error reporting function. */ | |
154 | void | |
155 | AT_NAME_PREFIX::parser::error (const location& l, const std::string& m) | |
156 | { | |
157 | (void) l; | |
158 | std::cerr << AT_LOCATION_IF([l << ": " << ])m << std::endl; | |
159 | } | |
160 | ||
161 | int | |
162 | yyparse (AT_PARAM_IF([semantic_value *result, int *count])) | |
163 | { | |
164 | AT_NAME_PREFIX::parser parser[]AT_PARAM_IF([ (result, count)]); | |
165 | #if YYDEBUG | |
166 | parser.set_debug_level (1); | |
167 | #endif | |
168 | return parser.parse (); | |
169 | } | |
170 | ], | |
171 | [static void | |
172 | yyerror (AT_YYERROR_ARG_LOC_IF([YYLTYPE *llocp, ]) | |
173 | AT_PARAM_IF([semantic_value *result, int *count, ]) | |
174 | const char *s) | |
175 | { | |
176 | AT_PARAM_IF([(void) result; (void) count;]) | |
177 | AT_YYERROR_SEES_LOC_IF([ | |
178 | fprintf (stderr, "%d.%d", | |
179 | AT_LOC.first_line, AT_LOC.first_column); | |
180 | if (AT_LOC.first_line != AT_LOC.last_line) | |
181 | fprintf (stderr, "-%d.%d", | |
182 | AT_LOC.last_line, AT_LOC.last_column - 1); | |
183 | else if (AT_LOC.first_column != AT_LOC.last_column - 1) | |
184 | fprintf (stderr, "-%d", | |
185 | AT_LOC.last_column - 1); | |
186 | fprintf (stderr, ": ");]) | |
187 | fprintf (stderr, "%s\n", s); | |
188 | }])[ | |
189 | ||
190 | ||
191 | ]AT_LOCATION_IF([ | |
192 | static YYLTYPE last_yylloc; | |
193 | ])[ | |
194 | static int | |
195 | get_char (]AT_LEX_FORMALS[) | |
196 | { | |
197 | int res = getc (input); | |
198 | ]AT_USE_LEX_ARGS[; | |
199 | ]AT_LOCATION_IF([ | |
200 | last_yylloc = AT_LOC; | |
201 | if (res == '\n') | |
202 | { | |
203 | AT_LOC.last_line++; | |
204 | AT_LOC.last_column = 1; | |
205 | } | |
206 | else | |
207 | AT_LOC.last_column++; | |
208 | ])[ | |
209 | return res; | |
210 | } | |
211 | ||
212 | ||
213 | static void | |
214 | unget_char (]AT_LEX_PRE_FORMALS[ int c) | |
215 | { | |
216 | ]AT_USE_LEX_ARGS[; | |
217 | ]AT_LOCATION_IF([ | |
218 | /* Wrong when C == `\n'. */ | |
219 | AT_LOC = last_yylloc; | |
220 | ])[ | |
221 | ungetc (c, input); | |
222 | } | |
223 | ||
224 | static int | |
225 | read_signed_integer (]AT_LEX_FORMALS[) | |
226 | { | |
227 | int c = get_char (]AT_LEX_ARGS[); | |
228 | int sign = 1; | |
229 | int n = 0; | |
230 | ||
231 | ]AT_USE_LEX_ARGS[; | |
232 | if (c == '-') | |
233 | { | |
234 | c = get_char (]AT_LEX_ARGS[); | |
235 | sign = -1; | |
236 | } | |
237 | ||
238 | while (isdigit (c)) | |
239 | { | |
240 | n = 10 * n + (c - '0'); | |
241 | c = get_char (]AT_LEX_ARGS[); | |
242 | } | |
243 | ||
244 | unget_char (]AT_LEX_PRE_ARGS[ c); | |
245 | ||
246 | return sign * n; | |
247 | } | |
248 | ||
249 | ||
250 | ||
251 | /*---------------------------------------------------------------. | |
252 | | Lexical analyzer returns an integer on the stack and the token | | |
253 | | NUM, or the ASCII character read if not a number. Skips all | | |
254 | | blanks and tabs, returns 0 for EOF. | | |
255 | `---------------------------------------------------------------*/ | |
256 | ||
257 | static int | |
258 | yylex (]AT_LEX_FORMALS[) | |
259 | { | |
260 | static int init = 1; | |
261 | int c; | |
262 | ||
263 | if (init) | |
264 | { | |
265 | init = 0; | |
266 | ]AT_LOCATION_IF([ | |
267 | AT_LOC.last_column = 1; | |
268 | AT_LOC.last_line = 1; | |
269 | ])[ | |
270 | } | |
271 | ||
272 | ]AT_LOCATION_IF([ | |
273 | AT_LOC.first_column = AT_LOC.last_column; | |
274 | AT_LOC.first_line = AT_LOC.last_line; | |
275 | ])[ | |
276 | ||
277 | /* Skip white space. */ | |
278 | while ((c = get_char (]AT_LEX_ARGS[)) == ' ' || c == '\t') | |
279 | { | |
280 | ]AT_LOCATION_IF( | |
281 | [ AT_LOC.first_column = AT_LOC.last_column; | |
282 | AT_LOC.first_line = AT_LOC.last_line; | |
283 | ])[ | |
284 | } | |
285 | ||
286 | /* process numbers */ | |
287 | if (c == '.' || isdigit (c)) | |
288 | { | |
289 | unget_char (]AT_LEX_PRE_ARGS[ c); | |
290 | ]AT_VAL[.ival = read_signed_integer (]AT_LEX_ARGS[); | |
291 | return NUM; | |
292 | } | |
293 | ||
294 | /* Return end-of-file. */ | |
295 | if (c == EOF) | |
296 | return CALC_EOF; | |
297 | ||
298 | /* Return single chars. */ | |
299 | return c; | |
300 | } | |
301 | ||
302 | static int | |
303 | power (int base, int exponent) | |
304 | { | |
305 | int res = 1; | |
306 | if (exponent < 0) | |
307 | exit (3); | |
308 | for (/* Niente */; exponent; --exponent) | |
309 | res *= base; | |
310 | return res; | |
311 | } | |
312 | ||
313 | ||
314 | int | |
315 | main (int argc, const char **argv) | |
316 | { | |
317 | semantic_value result = 0; | |
318 | int count = 0; | |
319 | int status; | |
320 | ||
321 | /* This used to be alarm (10), but that isn't enough time for | |
322 | a July 1995 vintage DEC Alphastation 200 4/100 system, | |
323 | according to Nelson H. F. Beebe. 100 seconds is enough. */ | |
324 | alarm (100); | |
325 | ||
326 | if (argc == 2) | |
327 | input = fopen (argv[1], "r"); | |
328 | else | |
329 | input = stdin; | |
330 | ||
331 | if (!input) | |
332 | { | |
333 | perror (argv[1]); | |
334 | return 3; | |
335 | } | |
336 | ||
337 | ]AT_SKEL_CC_IF([], [m4_bmatch([$4], [%debug], | |
338 | [ yydebug = 1;])])[ | |
339 | status = yyparse (]AT_PARAM_IF([[&result, &count]])[); | |
340 | fclose (input); | |
341 | if (global_result != result) | |
342 | abort (); | |
343 | if (global_count != count) | |
344 | abort (); | |
345 | return status; | |
346 | } | |
347 | ]]) | |
348 | ])# _AT_DATA_CALC_Y | |
349 | ||
350 | ||
351 | # AT_DATA_CALC_Y([BISON-OPTIONS]) | |
352 | # ------------------------------- | |
353 | # Produce `calc.y'. | |
354 | m4_define([AT_DATA_CALC_Y], | |
355 | [_AT_DATA_CALC_Y($[1], $[2], $[3], [$1]) | |
356 | ]) | |
357 | ||
358 | ||
359 | ||
360 | # _AT_CHECK_CALC(BISON-OPTIONS, INPUT, [NUM-STDERR-LINES]) | |
361 | # -------------------------------------------------------- | |
362 | # Run `calc' on INPUT and expect no STDOUT nor STDERR. | |
363 | # | |
364 | # If BISON-OPTIONS contains `%debug' but not `%glr-parser', then | |
365 | # | |
366 | # NUM-STDERR-LINES is the number of expected lines on stderr. | |
367 | # Currently this is ignored, though, since the output format is fluctuating. | |
368 | # | |
369 | # We don't count GLR's traces yet, since its traces are somewhat | |
370 | # different from LALR's. | |
371 | m4_define([_AT_CHECK_CALC], | |
372 | [AT_DATA([[input]], | |
373 | [[$2 | |
374 | ]]) | |
375 | AT_PARSER_CHECK([./calc input], 0, [], [stderr]) | |
376 | ]) | |
377 | ||
378 | ||
379 | # _AT_CHECK_CALC_ERROR(BISON-OPTIONS, EXIT-STATUS, INPUT, | |
380 | # [NUM-STDERR-LINES], | |
381 | # [VERBOSE-AND-LOCATED-ERROR-MESSAGE]) | |
382 | # --------------------------------------------------------- | |
383 | # Run `calc' on INPUT, and expect a `syntax error' message. | |
384 | # | |
385 | # If INPUT starts with a slash, it is used as absolute input file name, | |
386 | # otherwise as contents. | |
387 | # | |
388 | # NUM-STDERR-LINES is the number of expected lines on stderr. | |
389 | # Currently this is ignored, though, since the output format is fluctuating. | |
390 | # | |
391 | # If BISON-OPTIONS contains `%location', then make sure the ERROR-LOCATION | |
392 | # is correctly output on stderr. | |
393 | # | |
394 | # If BISON-OPTIONS contains `%error-verbose', then make sure the | |
395 | # IF-YYERROR-VERBOSE message is properly output after `syntax error, ' | |
396 | # on STDERR. | |
397 | # | |
398 | # If BISON-OPTIONS contains `%debug' but not `%glr', then NUM-STDERR-LINES | |
399 | # is the number of expected lines on stderr. | |
400 | m4_define([_AT_CHECK_CALC_ERROR], | |
401 | [m4_bmatch([$3], [^/], | |
402 | [AT_PARSER_CHECK([./calc $3], $2, [], [stderr])], | |
403 | [AT_DATA([[input]], | |
404 | [[$3 | |
405 | ]]) | |
406 | AT_PARSER_CHECK([./calc input], $2, [], [stderr])]) | |
407 | ||
408 | # Normalize the observed and expected error messages, depending upon the | |
409 | # options. | |
410 | # 1. Remove the traces from observed. | |
411 | sed '/^Starting/d | |
412 | /^Entering/d | |
413 | /^Stack/d | |
414 | /^Reading/d | |
415 | /^Reducing/d | |
416 | /^Return/d | |
417 | /^Shifting/d | |
418 | /^state/d | |
419 | /^Cleanup:/d | |
420 | /^Error:/d | |
421 | /^Next/d | |
422 | /^Now/d | |
423 | /^Discarding/d | |
424 | / \$[[0-9$]]* = /d | |
425 | /^yydestructor:/d' stderr >at-stderr | |
426 | mv at-stderr stderr | |
427 | # 2. Create the reference error message. | |
428 | AT_DATA([[expout]], | |
429 | [$5 | |
430 | ]) | |
431 | # 3. If locations are not used, remove them. | |
432 | AT_YYERROR_SEES_LOC_IF([], | |
433 | [[sed 's/^[-0-9.]*: //' expout >at-expout | |
434 | mv at-expout expout]]) | |
435 | # 4. If error-verbose is not used, strip the`, unexpected....' part. | |
436 | m4_bmatch([$1], [%error-verbose], [], | |
437 | [[sed 's/syntax error, .*$/syntax error/' expout >at-expout | |
438 | mv at-expout expout]]) | |
439 | # 5. Check | |
440 | AT_CHECK([cat stderr], 0, [expout]) | |
441 | ]) | |
442 | ||
443 | ||
444 | # AT_CHECK_CALC([BISON-OPTIONS, [EXPECTED-TO-FAIL]]) | |
445 | # -------------------------------------------------- | |
446 | # Start a testing chunk which compiles `calc' grammar with | |
447 | # BISON-OPTIONS, and performs several tests over the parser. | |
448 | # However, if EXPECTED-TO-FAIL is nonempty, this test is expected to fail. | |
449 | m4_define([AT_CHECK_CALC], | |
450 | [# We use integers to avoid dependencies upon the precision of doubles. | |
451 | AT_SETUP([Calculator $1]) | |
452 | ||
453 | m4_ifval([$2], [AT_CHECK([exit 77])]) | |
454 | ||
455 | AT_BISON_OPTION_PUSHDEFS([$1]) | |
456 | ||
457 | AT_DATA_CALC_Y([$1]) | |
458 | ||
459 | AT_SKEL_CC_IF( | |
460 | [AT_CHECK([bison -o calc.cc calc.y]) | |
461 | AT_COMPILE_CXX([calc])], | |
462 | [AT_CHECK([bison -o calc.c calc.y]) | |
463 | AT_COMPILE([calc])]) | |
464 | ||
465 | # Test the priorities. | |
466 | _AT_CHECK_CALC([$1], | |
467 | [1 + 2 * 3 = 7 | |
468 | 1 + 2 * -3 = -5 | |
469 | ||
470 | -1^2 = -1 | |
471 | (-1)^2 = 1 | |
472 | ||
473 | ---1 = -1 | |
474 | ||
475 | 1 - 2 - 3 = -4 | |
476 | 1 - (2 - 3) = 2 | |
477 | ||
478 | 2^2^3 = 256 | |
479 | (2^2)^3 = 64], | |
480 | [842]) | |
481 | ||
482 | # Some syntax errors. | |
483 | _AT_CHECK_CALC_ERROR([$1], [1], [0 0], [15], | |
484 | [1.3: syntax error, unexpected number]) | |
485 | _AT_CHECK_CALC_ERROR([$1], [1], [1//2], [20], | |
486 | [1.3: syntax error, unexpected '/', expecting number or '-' or '(' or '!']) | |
487 | _AT_CHECK_CALC_ERROR([$1], [1], [error], [5], | |
488 | [1.1: syntax error, unexpected $undefined]) | |
489 | _AT_CHECK_CALC_ERROR([$1], [1], [1 = 2 = 3], [30], | |
490 | [1.7: syntax error, unexpected '=']) | |
491 | _AT_CHECK_CALC_ERROR([$1], [1], | |
492 | [ | |
493 | +1], | |
494 | [20], | |
495 | [2.1: syntax error, unexpected '+']) | |
496 | # Exercise error messages with EOF: work on an empty file. | |
497 | _AT_CHECK_CALC_ERROR([$1], [1], [/dev/null], [4], | |
498 | [1.1: syntax error, unexpected end of input]) | |
499 | ||
500 | # Exercise the error token: without it, we die at the first error, | |
501 | # hence be sure to | |
502 | # | |
503 | # - have several errors which exercise different shift/discardings | |
504 | # - (): nothing to pop, nothing to discard | |
505 | # - (1 + 1 + 1 +): a lot to pop, nothing to discard | |
506 | # - (* * *): nothing to pop, a lot to discard | |
507 | # - (1 + 2 * *): some to pop and discard | |
508 | # | |
509 | # - test the action associated to `error' | |
510 | # | |
511 | # - check the lookahead that triggers an error is not discarded | |
512 | # when we enter error recovery. Below, the lookahead causing the | |
513 | # first error is ")", which is needed to recover from the error and | |
514 | # produce the "0" that triggers the "0 != 1" error. | |
515 | # | |
516 | _AT_CHECK_CALC_ERROR([$1], [0], | |
517 | [() + (1 + 1 + 1 +) + (* * *) + (1 * 2 * *) = 1], | |
518 | [250], | |
519 | [1.2: syntax error, unexpected ')', expecting number or '-' or '(' or '!' | |
520 | 1.18: syntax error, unexpected ')', expecting number or '-' or '(' or '!' | |
521 | 1.23: syntax error, unexpected '*', expecting number or '-' or '(' or '!' | |
522 | 1.41: syntax error, unexpected '*', expecting number or '-' or '(' or '!' | |
523 | calc: error: 4444 != 1]) | |
524 | ||
525 | # The same, but this time exercising explicitly triggered syntax errors. | |
526 | # POSIX says the lookahead causing the error should not be discarded. | |
527 | _AT_CHECK_CALC_ERROR([$1], [0], [(!) + (0 0) = 1], [102], | |
528 | [1.10: syntax error, unexpected number | |
529 | calc: error: 2222 != 1]) | |
530 | _AT_CHECK_CALC_ERROR([$1], [0], [(- *) + (0 0) = 1], [113], | |
531 | [1.4: syntax error, unexpected '*', expecting number or '-' or '(' or '!' | |
532 | 1.12: syntax error, unexpected number | |
533 | calc: error: 2222 != 1]) | |
534 | AT_BISON_OPTION_POPDEFS | |
535 | ||
536 | AT_CLEANUP | |
537 | ])# AT_CHECK_CALC | |
538 | ||
539 | ||
540 | ||
541 | ||
542 | # ------------------------ # | |
543 | # Simple LALR Calculator. # | |
544 | # ------------------------ # | |
545 | ||
546 | AT_BANNER([[Simple LALR(1) Calculator.]]) | |
547 | ||
548 | # AT_CHECK_CALC_LALR([BISON-OPTIONS]) | |
549 | # ----------------------------------- | |
550 | # Start a testing chunk which compiles `calc' grammar with | |
551 | # BISON-OPTIONS, and performs several tests over the parser. | |
552 | m4_define([AT_CHECK_CALC_LALR], | |
553 | [AT_CHECK_CALC($@)]) | |
554 | ||
555 | AT_CHECK_CALC_LALR() | |
556 | ||
557 | AT_CHECK_CALC_LALR([%defines]) | |
558 | AT_CHECK_CALC_LALR([%locations]) | |
559 | AT_CHECK_CALC_LALR([%name-prefix="calc"]) dnl test deprecated `=' | |
560 | AT_CHECK_CALC_LALR([%verbose]) | |
561 | AT_CHECK_CALC_LALR([%yacc]) | |
562 | AT_CHECK_CALC_LALR([%error-verbose]) | |
563 | ||
564 | AT_CHECK_CALC_LALR([%pure-parser %locations]) | |
565 | AT_CHECK_CALC_LALR([%push-pull-parser %pure-parser %locations]) | |
566 | AT_CHECK_CALC_LALR([%error-verbose %locations]) | |
567 | ||
568 | AT_CHECK_CALC_LALR([%error-verbose %locations %defines %name-prefix "calc" %verbose %yacc]) | |
569 | ||
570 | AT_CHECK_CALC_LALR([%debug]) | |
571 | AT_CHECK_CALC_LALR([%error-verbose %debug %locations %defines %name-prefix "calc" %verbose %yacc]) | |
572 | ||
573 | AT_CHECK_CALC_LALR([%pure-parser %error-verbose %debug %locations %defines %name-prefix "calc" %verbose %yacc]) | |
574 | AT_CHECK_CALC_LALR([%push-pull-parser %pure-parser %error-verbose %debug %locations %defines %name-prefix "calc" %verbose %yacc]) | |
575 | ||
576 | AT_CHECK_CALC_LALR([%pure-parser %error-verbose %debug %locations %defines %name-prefix "calc" %verbose %yacc %parse-param {semantic_value *result} %parse-param {int *count}]) | |
577 | ||
578 | ||
579 | # ----------------------- # | |
580 | # Simple GLR Calculator. # | |
581 | # ----------------------- # | |
582 | ||
583 | AT_BANNER([[Simple GLR Calculator.]]) | |
584 | ||
585 | # AT_CHECK_CALC_GLR([BISON-OPTIONS]) | |
586 | # ---------------------------------- | |
587 | # Start a testing chunk which compiles `calc' grammar with | |
588 | # BISON-OPTIONS and %glr-parser, and performs several tests over the parser. | |
589 | m4_define([AT_CHECK_CALC_GLR], | |
590 | [AT_CHECK_CALC([%glr-parser] $@)]) | |
591 | ||
592 | ||
593 | AT_CHECK_CALC_GLR() | |
594 | ||
595 | AT_CHECK_CALC_GLR([%defines]) | |
596 | AT_CHECK_CALC_GLR([%locations]) | |
597 | AT_CHECK_CALC_GLR([%name-prefix "calc"]) | |
598 | AT_CHECK_CALC_GLR([%verbose]) | |
599 | AT_CHECK_CALC_GLR([%yacc]) | |
600 | AT_CHECK_CALC_GLR([%error-verbose]) | |
601 | ||
602 | AT_CHECK_CALC_GLR([%pure-parser %locations]) | |
603 | AT_CHECK_CALC_GLR([%error-verbose %locations]) | |
604 | ||
605 | AT_CHECK_CALC_GLR([%error-verbose %locations %defines %name-prefix "calc" %verbose %yacc]) | |
606 | ||
607 | AT_CHECK_CALC_GLR([%debug]) | |
608 | AT_CHECK_CALC_GLR([%error-verbose %debug %locations %defines %name-prefix "calc" %verbose %yacc]) | |
609 | ||
610 | AT_CHECK_CALC_GLR([%pure-parser %error-verbose %debug %locations %defines %name-prefix "calc" %verbose %yacc]) | |
611 | ||
612 | AT_CHECK_CALC_GLR([%pure-parser %error-verbose %debug %locations %defines %name-prefix "calc" %verbose %yacc %parse-param {semantic_value *result} %parse-param {int *count}]) | |
613 | ||
614 | ||
615 | # ----------------------------- # | |
616 | # Simple LALR1 C++ Calculator. # | |
617 | # ----------------------------- # | |
618 | ||
619 | AT_BANNER([[Simple LALR(1) C++ Calculator.]]) | |
620 | ||
621 | # First let's try using %skeleton | |
622 | AT_CHECK_CALC([%skeleton "lalr1.cc" %defines %locations]) | |
623 | ||
624 | # AT_CHECK_CALC_LALR1_CC([BISON-OPTIONS]) | |
625 | # --------------------------------------- | |
626 | # Start a testing chunk which compiles `calc' grammar with | |
627 | # the C++ skeleton, and performs several tests over the parser. | |
628 | m4_define([AT_CHECK_CALC_LALR1_CC], | |
629 | [AT_CHECK_CALC([%language "C++" %defines %locations] $@)]) | |
630 | ||
631 | AT_CHECK_CALC_LALR1_CC([]) | |
632 | AT_CHECK_CALC_LALR1_CC([%error-verbose %name-prefix "calc" %verbose %yacc]) | |
633 | ||
634 | AT_CHECK_CALC_LALR1_CC([%error-verbose %debug %name-prefix "calc" %verbose %yacc]) | |
635 | ||
636 | AT_CHECK_CALC_LALR1_CC([%pure-parser %error-verbose %debug %name-prefix "calc" %verbose %yacc]) | |
637 | ||
638 | AT_CHECK_CALC_LALR1_CC([%pure-parser %error-verbose %debug %name-prefix "calc" %verbose %yacc %parse-param {semantic_value *result} %parse-param {int *count}]) | |
639 | ||
640 | ||
641 | ||
642 | # --------------------------- # | |
643 | # Simple GLR C++ Calculator. # | |
644 | # --------------------------- # | |
645 | ||
646 | AT_BANNER([[Simple GLR C++ Calculator.]]) | |
647 | ||
648 | # Again, we try also using %skeleton. | |
649 | AT_CHECK_CALC([%skeleton "glr.cc" %defines %locations]) | |
650 | ||
651 | # AT_CHECK_CALC_GLR_CC([BISON-OPTIONS]) | |
652 | # ------------------------------------- | |
653 | # Start a testing chunk which compiles `calc' grammar with | |
654 | # the GLR C++ skeleton, and performs several tests over the parser. | |
655 | m4_define([AT_CHECK_CALC_GLR_CC], | |
656 | [AT_CHECK_CALC([%language "C++" %glr-parser %defines %locations] $@)]) | |
657 | ||
658 | AT_CHECK_CALC_GLR_CC([]) | |
659 | AT_CHECK_CALC_GLR_CC([%error-verbose %name-prefix "calc" %verbose %yacc]) | |
660 | ||
661 | AT_CHECK_CALC_GLR_CC([%debug]) | |
662 | AT_CHECK_CALC_GLR_CC([%error-verbose %debug %name-prefix "calc" %verbose %yacc]) | |
663 | ||
664 | AT_CHECK_CALC_GLR_CC([%pure-parser %error-verbose %debug %name-prefix "calc" %verbose %yacc]) | |
665 | ||
666 | AT_CHECK_CALC_GLR_CC([%pure-parser %error-verbose %debug %name-prefix "calc" %verbose %yacc %parse-param {semantic_value *result} %parse-param {int *count}]) |