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