X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/bfcf1f3af044b8aa2193a4271a065085f7868777..506ffb1f7442541ace4623e03d9ba2a6f32a663e:/tests/regression.at?ds=inline diff --git a/tests/regression.at b/tests/regression.at index 7517b931..dd87ef2d 100644 --- a/tests/regression.at +++ b/tests/regression.at @@ -1,5 +1,5 @@ # Bison Regressions. -*- Autotest -*- -# Copyright 2001 Free Software Foundation, Inc. +# Copyright (C) 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by @@ -19,85 +19,50 @@ AT_BANNER([[Regression tests.]]) -## ------------------- ## -## %nonassoc and eof. ## -## ------------------- ## +## ------------------------- ## +## Early token definitions. ## +## ------------------------- ## -AT_SETUP([%nonassoc and eof]) -AT_DATA([input.y], -[[ -%{ -#include +AT_SETUP([Early token definitions]) -#define YYERROR_VERBOSE 1 -#define yyerror(Msg) \ -do { \ - fprintf (stderr, "%s\n", Msg); \ - exit (1); \ -} while (0) +# Found in GCJ: they expect the tokens to be defined before the user +# prologue, so that they can use the token definitions in it. -/* The current argument. */ -static const char *input = NULL; +AT_DATA_GRAMMAR([input.y], +[[%{ +void yyerror (const char *s); +int yylex (void); +%} -static int -yylex (void) +%union { - /* No token stands for end of file. */ - if (input && *input) - return *input++; - else - return 0; -} - + int val; +}; +%{ +#ifndef MY_TOKEN +# error "MY_TOKEN not defined." +#endif %} - -%nonassoc '<' '>' - +%token MY_TOKEN %% -expr: expr '<' expr - | expr '>' expr - | '0' - ; +exp: MY_TOKEN; %% -int -main (int argc, const char *argv[]) -{ - if (argc > 1) - input = argv[1]; - return yyparse (); -} ]]) -# Specify the output files to avoid problems on different file systems. -AT_CHECK([bison input.y -o input.c]) -AT_CHECK([$CC $CFLAGS $CPPFLAGS input.c -o input], 0, [], [ignore]) - -AT_CHECK([./input '0<0']) -# FIXME: This is an actual bug, but a new one, in the sense that -# no one has ever spotted it! The messages are *wrong*: there should -# be nothing there, it should be expected eof. -AT_CHECK([./input '0<0<0'], [1], [], - [parse error, unexpected '<', expecting '<' or '>' -]) +AT_CHECK([bison -o input.c input.y]) +AT_COMPILE([input.o], [-c input.c]) -AT_CHECK([./input '0>0']) -AT_CHECK([./input '0>0>0'], [1], [], - [parse error, unexpected '>', expecting '<' or '>' -]) +AT_CLEANUP -AT_CHECK([./input '0<0>0'], [1], [], - [parse error, unexpected '>', expecting '<' or '>' -]) -AT_CLEANUP ## ---------------- ## ## Braces parsing. ## ## ---------------- ## -AT_SETUP([braces parsing]) +AT_SETUP([Braces parsing]) AT_DATA([input.y], [[/* Bison used to swallow the character after `}'. */ @@ -107,9 +72,9 @@ exp: { tests = {{{{{{{{{{}}}}}}}}}}; }; %% ]]) -AT_CHECK([bison -v input.y -o input.c], 0, ignore, ignore) +AT_CHECK([bison -v -o input.c input.y]) -AT_CHECK([fgrep 'tests = {{{{{{{{{{}}}}}}}}}};' input.c], 0, [ignore]) +AT_CHECK([grep 'tests = {{{{{{{{{{}}}}}}}}}};' input.c], 0, [ignore]) AT_CLEANUP @@ -134,227 +99,21 @@ exp: '(' exp ')' | NUM ; %% ]]) -AT_CHECK([bison -v input.y -o input.c], 0, ignore, ignore) - -AT_CLEANUP - - -## ------------------------- ## -## Unresolved SR Conflicts. ## -## ------------------------- ## - -AT_SETUP([Unresolved SR Conflicts]) - -AT_DATA([input.y], -[[%token NUM OP -%% -exp: exp OP exp | NUM; -]]) - -AT_CHECK([bison input.y -o input.c -v], 0, [], -[input.y contains 1 shift/reduce conflict. -]) - -# Check the contents of the report. -AT_CHECK([cat input.output], [], -[[State 5 contains 1 shift/reduce conflict. - - -Grammar - - Number, Line, Rule - 0 3 $axiom -> exp $ - 1 3 exp -> exp OP exp - 2 3 exp -> NUM - - -Terminals, with rules where they appear - -$ (0) 0 -error (256) -NUM (257) 2 -OP (258) 1 - - -Nonterminals, with rules where they appear - -$axiom (5) - on left: 0 -exp (6) - on left: 1 2, on right: 0 1 - - -state 0 - - NUM shift, and go to state 1 - - exp go to state 2 - - - -state 1 - - exp -> NUM . (rule 2) - - $default reduce using rule 2 (exp) - - - -state 2 - - $axiom -> exp . $ (rule 0) - exp -> exp . OP exp (rule 1) - - $ shift, and go to state 3 - OP shift, and go to state 4 - - - -state 3 - - $axiom -> exp $ . (rule 0) - - $default accept - - -state 4 - - exp -> exp OP . exp (rule 1) - - NUM shift, and go to state 1 - - exp go to state 5 - - - -state 5 - - exp -> exp . OP exp (rule 1) - exp -> exp OP exp . (rule 1) - - OP shift, and go to state 4 - - OP [reduce using rule 1 (exp)] - $default reduce using rule 1 (exp) - - - -]]) - -AT_CLEANUP - - -## --------------------- ## -## Solved SR Conflicts. ## -## --------------------- ## - -AT_SETUP([Solved SR Conflicts]) - -AT_DATA([input.y], -[[%token NUM OP -%right OP -%% -exp: exp OP exp | NUM; -]]) - -AT_CHECK([bison input.y -o input.c -v], 0, [], []) - -# Check the contents of the report. -AT_CHECK([cat input.output], [], -[[Conflict in state 5 between rule 2 and token OP resolved as shift. - - -Grammar - - Number, Line, Rule - 0 4 $axiom -> exp $ - 1 4 exp -> exp OP exp - 2 4 exp -> NUM - - -Terminals, with rules where they appear - -$ (0) 0 -error (256) -NUM (257) 2 -OP (258) 1 - - -Nonterminals, with rules where they appear - -$axiom (5) - on left: 0 -exp (6) - on left: 1 2, on right: 0 1 - - -state 0 - - NUM shift, and go to state 1 - - exp go to state 2 - - - -state 1 - - exp -> NUM . (rule 2) - - $default reduce using rule 2 (exp) - - - -state 2 - - $axiom -> exp . $ (rule 0) - exp -> exp . OP exp (rule 1) - - $ shift, and go to state 3 - OP shift, and go to state 4 - - - -state 3 - - $axiom -> exp $ . (rule 0) - - $default accept - - -state 4 - - exp -> exp OP . exp (rule 1) - - NUM shift, and go to state 1 - - exp go to state 5 - - - -state 5 - - exp -> exp . OP exp (rule 1) - exp -> exp OP exp . (rule 1) - - OP shift, and go to state 4 - - $default reduce using rule 1 (exp) - - - +AT_CHECK([bison -v -o input.c input.y], 0, [], +[[input.y:6.8-14: warning: symbol `"<="' used more than once as a literal string ]]) AT_CLEANUP - - ## ------------------- ## ## Rule Line Numbers. ## ## ------------------- ## AT_SETUP([Rule Line Numbers]) +AT_KEYWORDS([report]) + AT_DATA([input.y], [[%% expr: @@ -385,23 +144,26 @@ expr: }; ]]) -AT_CHECK([bison input.y -o input.c -v], 0, [], []) +AT_CHECK([bison -o input.c -v input.y]) # Check the contents of the report. AT_CHECK([cat input.output], [], [[Grammar - Number, Line, Rule - 0 2 $axiom -> expr $ - 1 2 @1 -> /* empty */ - 2 2 expr -> 'a' @1 'b' - 3 15 @2 -> /* empty */ - 4 15 expr -> @2 'c' + 0 $accept: expr $end + + 1 @1: /* empty */ + + 2 expr: 'a' @1 'b' + + 3 @2: /* empty */ + + 4 expr: @2 'c' Terminals, with rules where they appear -$ (0) 0 +$end (0) 0 'a' (97) 2 'b' (98) 2 'c' (99) 4 @@ -410,7 +172,7 @@ error (256) Nonterminals, with rules where they appear -$axiom (6) +$accept (6) on left: 0 expr (7) on left: 2 4, on right: 0 @@ -422,134 +184,70 @@ expr (7) state 0 - 'a' shift, and go to state 1 + 0 $accept: . expr $end - $default reduce using rule 3 (@2) + 'a' shift, and go to state 1 - expr go to state 2 - @2 go to state 3 + $default reduce using rule 3 (@2) + expr go to state 2 + @2 go to state 3 state 1 - expr -> 'a' . @1 'b' (rule 2) + 2 expr: 'a' . @1 'b' - $default reduce using rule 1 (@1) - - @1 go to state 4 + $default reduce using rule 1 (@1) + @1 go to state 4 state 2 - $axiom -> expr . $ (rule 0) - - $ shift, and go to state 5 + 0 $accept: expr . $end + $end shift, and go to state 5 state 3 - expr -> @2 . 'c' (rule 4) - - 'c' shift, and go to state 6 + 4 expr: @2 . 'c' + 'c' shift, and go to state 6 state 4 - expr -> 'a' @1 . 'b' (rule 2) - - 'b' shift, and go to state 7 + 2 expr: 'a' @1 . 'b' + 'b' shift, and go to state 7 state 5 - $axiom -> expr $ . (rule 0) + 0 $accept: expr $end . - $default accept + $default accept state 6 - expr -> @2 'c' . (rule 4) - - $default reduce using rule 4 (expr) + 4 expr: @2 'c' . + $default reduce using rule 4 (expr) state 7 - expr -> 'a' @1 'b' . (rule 2) - - $default reduce using rule 2 (expr) - - - -]]) - -AT_CLEANUP - - - -## -------------------- ## -## %expect not enough. ## -## -------------------- ## - -AT_SETUP([%expect not enough]) - -AT_DATA([input.y], -[[%token NUM OP -%expect 0 -%% -exp: exp OP exp | NUM; -]]) - -AT_CHECK([bison input.y -o input.c], 1, [], -[input.y contains 1 shift/reduce conflict. -expected 0 shift/reduce conflicts -]) -AT_CLEANUP + 2 expr: 'a' @1 'b' . - -## --------------- ## -## %expect right. ## -## --------------- ## - -AT_SETUP([%expect right]) - -AT_DATA([input.y], -[[%token NUM OP -%expect 1 -%% -exp: exp OP exp | NUM; + $default reduce using rule 2 (expr) ]]) -AT_CHECK([bison input.y -o input.c], 0) AT_CLEANUP -## ------------------ ## -## %expect too much. ## -## ------------------ ## - -AT_SETUP([%expect too much]) - -AT_DATA([input.y], -[[%token NUM OP -%expect 2 -%% -exp: exp OP exp | NUM; -]]) - -AT_CHECK([bison input.y -o input.c], 1, [], -[input.y contains 1 shift/reduce conflict. -expected 2 shift/reduce conflicts -]) -AT_CLEANUP - ## ---------------------- ## ## Mixing %token styles. ## @@ -568,7 +266,7 @@ exp: ; %% ]]) -AT_CHECK([bison -v input.y -o input.c], 0, ignore, ignore) +AT_CHECK([bison -v -o input.c input.y]) AT_CLEANUP @@ -585,42 +283,78 @@ AT_DATA([input.y], [[%% ? default: 'a' } -%{ %& -%a +%a-does-not-exist %- +%{ ]]) AT_CHECK([bison input.y], [1], [], -[[input.y:2: invalid input: `?' -input.y:3: invalid input: `}' -input.y:4: invalid input: `%{' -input.y:5: invalid input: `%&' -input.y:6: invalid input: `%a' -input.y:7: invalid input: `%-' +[[input.y:2.1: invalid character: `?' +input.y:3.14: invalid character: `}' +input.y:4.1: invalid character: `%' +input.y:4.2: invalid character: `&' +input.y:5.1-17: invalid directive: `%a-does-not-exist' +input.y:6.1: invalid character: `%' +input.y:6.2: invalid character: `-' +input.y:7.1-8.0: missing `%}' at end of file ]]) AT_CLEANUP -## -------------------- ## -## Invalid %directive. ## -## -------------------- ## +## ------------------- ## +## Token definitions. ## +## ------------------- ## -AT_SETUP([Invalid %directive]) +AT_SETUP([Token definitions]) -AT_DATA([input.y], -[[%invalid +# Bison managed, when fed with `%token 'f' "f"' to #define 'f'! +AT_DATA_GRAMMAR([input.y], +[%{ +void yyerror (const char *s); +int yylex (void); +%} +[%token MYEOF 0 "end of file" +%token 'a' "a" +%token B_TOKEN "b" +%token C_TOKEN 'c' +%token 'd' D_TOKEN +%% +exp: "a"; ]]) -AT_CHECK([bison input.y], [1], [], -[[input.y:1: unrecognized: %invalid -input.y:1: Skipping to next % -input.y:2: fatal error: no input grammar +AT_CHECK([bison -o input.c input.y]) +AT_COMPILE([input.o], [-c input.c]) +AT_CLEANUP + + + +## -------------------- ## +## Characters Escapes. ## +## -------------------- ## + + +AT_SETUP([Characters Escapes]) + +AT_DATA_GRAMMAR([input.y], +[%{ +void yyerror (const char *s); +int yylex (void); +%} +[%% +exp: + '\'' "\'" +| '\"' "\"" +| '"' "'" +; ]]) +# Pacify font-lock-mode: " +AT_CHECK([bison -o input.c input.y]) +AT_COMPILE([input.o], [-c input.c]) AT_CLEANUP @@ -636,6 +370,8 @@ AT_CLEANUP AT_SETUP([Web2c Report]) +AT_KEYWORDS([report]) + AT_DATA([input.y], [[%token undef_id_tok const_id_tok @@ -655,29 +391,37 @@ CONST_DEC: { } undef_id_tok '=' const_id_tok ';' ; %% - ]]) AT_CHECK([bison -v input.y]) - -AT_CHECK([sed -n 's/ *$//;/^$/!p' input.output], 0, +AT_CHECK([cat input.output], 0, [[Grammar - Number, Line, Rule - 0 6 $axiom -> CONST_DEC_PART $ - 1 6 CONST_DEC_PART -> CONST_DEC_LIST - 2 10 CONST_DEC_LIST -> CONST_DEC - 3 12 CONST_DEC_LIST -> CONST_DEC_LIST CONST_DEC - 4 15 @1 -> /* empty */ - 5 15 CONST_DEC -> @1 undef_id_tok '=' const_id_tok ';' + + 0 $accept: CONST_DEC_PART $end + + 1 CONST_DEC_PART: CONST_DEC_LIST + + 2 CONST_DEC_LIST: CONST_DEC + 3 | CONST_DEC_LIST CONST_DEC + + 4 @1: /* empty */ + + 5 CONST_DEC: @1 undef_id_tok '=' const_id_tok ';' + + Terminals, with rules where they appear -$ (0) 0 + +$end (0) 0 ';' (59) 5 '=' (61) 5 error (256) -undef_id_tok (257) 5 -const_id_tok (258) 5 +undef_id_tok (258) 5 +const_id_tok (259) 5 + + Nonterminals, with rules where they appear -$axiom (7) + +$accept (7) on left: 0 CONST_DEC_PART (8) on left: 1, on right: 0 @@ -687,46 +431,93 @@ CONST_DEC (10) on left: 5, on right: 2 3 @1 (11) on left: 4, on right: 5 + + state 0 - $default reduce using rule 4 (@1) - CONST_DEC_PART go to state 1 - CONST_DEC_LIST go to state 2 - CONST_DEC go to state 3 - @1 go to state 4 + + 0 $accept: . CONST_DEC_PART $end + + $default reduce using rule 4 (@1) + + CONST_DEC_PART go to state 1 + CONST_DEC_LIST go to state 2 + CONST_DEC go to state 3 + @1 go to state 4 + + state 1 - $axiom -> CONST_DEC_PART . $ (rule 0) - $ shift, and go to state 5 + + 0 $accept: CONST_DEC_PART . $end + + $end shift, and go to state 5 + + state 2 - CONST_DEC_PART -> CONST_DEC_LIST . (rule 1) - CONST_DEC_LIST -> CONST_DEC_LIST . CONST_DEC (rule 3) - undef_id_tok reduce using rule 4 (@1) - $default reduce using rule 1 (CONST_DEC_PART) - CONST_DEC go to state 6 - @1 go to state 4 + + 1 CONST_DEC_PART: CONST_DEC_LIST . + 3 CONST_DEC_LIST: CONST_DEC_LIST . CONST_DEC + + undef_id_tok reduce using rule 4 (@1) + $default reduce using rule 1 (CONST_DEC_PART) + + CONST_DEC go to state 6 + @1 go to state 4 + + state 3 - CONST_DEC_LIST -> CONST_DEC . (rule 2) - $default reduce using rule 2 (CONST_DEC_LIST) + + 2 CONST_DEC_LIST: CONST_DEC . + + $default reduce using rule 2 (CONST_DEC_LIST) + + state 4 - CONST_DEC -> @1 . undef_id_tok '=' const_id_tok ';' (rule 5) - undef_id_tok shift, and go to state 7 + + 5 CONST_DEC: @1 . undef_id_tok '=' const_id_tok ';' + + undef_id_tok shift, and go to state 7 + + state 5 - $axiom -> CONST_DEC_PART $ . (rule 0) - $default accept + + 0 $accept: CONST_DEC_PART $end . + + $default accept + + state 6 - CONST_DEC_LIST -> CONST_DEC_LIST CONST_DEC . (rule 3) - $default reduce using rule 3 (CONST_DEC_LIST) + + 3 CONST_DEC_LIST: CONST_DEC_LIST CONST_DEC . + + $default reduce using rule 3 (CONST_DEC_LIST) + + state 7 - CONST_DEC -> @1 undef_id_tok . '=' const_id_tok ';' (rule 5) - '=' shift, and go to state 8 + + 5 CONST_DEC: @1 undef_id_tok . '=' const_id_tok ';' + + '=' shift, and go to state 8 + + state 8 - CONST_DEC -> @1 undef_id_tok '=' . const_id_tok ';' (rule 5) - const_id_tok shift, and go to state 9 + + 5 CONST_DEC: @1 undef_id_tok '=' . const_id_tok ';' + + const_id_tok shift, and go to state 9 + + state 9 - CONST_DEC -> @1 undef_id_tok '=' const_id_tok . ';' (rule 5) - ';' shift, and go to state 10 + + 5 CONST_DEC: @1 undef_id_tok '=' const_id_tok . ';' + + ';' shift, and go to state 10 + + state 10 - CONST_DEC -> @1 undef_id_tok '=' const_id_tok ';' . (rule 5) - $default reduce using rule 5 (CONST_DEC) + + 5 CONST_DEC: @1 undef_id_tok '=' const_id_tok ';' . + + $default reduce using rule 5 (CONST_DEC) ]]) AT_CLEANUP @@ -744,7 +535,7 @@ AT_CLEANUP # # It used to be wrong on yydefact only: # -# static const short yydefact[] = +# static const short int yydefact[] = # { # - 2, 0, 1, 0, 0, 2, 3, 2, 5, 4, # + 2, 0, 1, 0, 0, 0, 3, 2, 5, 4, @@ -756,6 +547,8 @@ AT_CLEANUP AT_SETUP([Web2c Actions]) +AT_KEYWORDS([report]) + AT_DATA([input.y], [[%% statement: struct_stat; @@ -765,12 +558,14 @@ else: "else" statement; %% ]]) -AT_CHECK([bison -v input.y -o input.c]) +AT_CHECK([bison -v -o input.c input.y]) # Check only the tables. We don't use --no-parser, because it is # still to be implemented in the experimental branch of Bison. -AT_CHECK([[sed -n 's/ *$//;/^static const.*\[\] =/,/^}/p' input.c]], 0, -[[static const char yytranslate[] = +[sed -n 's/ *$//;/^static const.*\[\] =/,/^}/p' input.c >tables.c] + +AT_CHECK([[cat tables.c]], 0, +[[static const unsigned char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, @@ -797,65 +592,201 @@ AT_CHECK([[sed -n 's/ *$//;/^static const.*\[\] =/,/^}/p' input.c]], 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 1, 3, 4, 5, - 6 + 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, + 5, 6 }; -static const short yyprhs[] = +static const unsigned char yyprhs[] = { 0, 0, 3, 5, 6, 9, 14 }; -static const short yyrhs[] = +static const yysigned_char yyrhs[] = { 8, 0, -1, 9, -1, -1, 10, 11, -1, 3, 4, 5, 8, -1, 6, 8, -1 }; -static const short yyrline[] = +static const unsigned char yyrline[] = { 0, 2, 2, 3, 3, 4, 5 }; static const char *const yytname[] = { - "$", "error", "$undefined.", "\"if\"", "\"const\"", "\"then\"", - "\"else\"", "$axiom", "statement", "struct_stat", "if", "else", 0 + "$end", "error", "$undefined", "\"if\"", "\"const\"", "\"then\"", + "\"else\"", "$accept", "statement", "struct_stat", "if", "else", 0 }; -static const short yytoknum[] = +static const unsigned short int yytoknum[] = { - 0, 256, 2, 257, 258, 259, 260, -1 + 0, 256, 257, 258, 259, 260, 261 }; -static const short yyr1[] = +static const unsigned char yyr1[] = { 0, 7, 8, 9, 9, 10, 11 }; -static const short yyr2[] = +static const unsigned char yyr2[] = { 0, 2, 1, 0, 2, 4, 2 }; -static const short yydefact[] = +static const unsigned char yydefact[] = { - 3, 0, 0, 2, 0, 0, 0, 3, 4, 3, + 3, 0, 0, 2, 0, 0, 1, 3, 4, 3, 6, 5 }; -static const short yydefgoto[] = +static const yysigned_char yydefgoto[] = { -1, 2, 3, 4, 8 }; -static const short yypact[] = +static const yysigned_char yypact[] = { - -2, -1, 4,-32768, 0, 2,-32768, -2,-32768, -2, - -32768,-32768 + -2, -1, 4, -8, 0, 2, -8, -2, -8, -2, + -8, -8 }; -static const short yypgoto[] = +static const yysigned_char yypgoto[] = { - -32768, -7,-32768,-32768,-32768 + -8, -7, -8, -8, -8 }; -static const short yytable[] = +static const unsigned char yytable[] = { 10, 1, 11, 5, 6, 0, 7, 9 }; -static const short yycheck[] = +static const yysigned_char yycheck[] = { 7, 3, 9, 4, 0, -1, 6, 5 }; +static const unsigned char yystos[] = +{ + 0, 3, 8, 9, 10, 4, 0, 6, 11, 5, + 8, 8 +}; ]]) AT_CLEANUP + + +## ------------------------- ## +## yycheck Bound Violation. ## +## ------------------------- ## + + +# _AT_DATA_DANCER_Y(BISON-OPTIONS) +# -------------------------------- +# The following grammar, taken from Andrew Suffield's GPL'd implementation +# of DGMTP, the Dancer Generic Message Transport Protocol, used to violate +# yycheck's bounds where issuing a verbose error message. Keep this test +# so that possible bound checking compilers could check all the skeletons. +m4_define([_AT_DATA_DANCER_Y], +[AT_DATA_GRAMMAR([dancer.y], +[%{ +static int yylex (AT_LALR1_CC_IF([int *], [void])); +AT_LALR1_CC_IF([], +[#include +static void yyerror (const char *);]) +%} +$1 +%token ARROW INVALID NUMBER STRING DATA +%defines +%verbose +%error-verbose +/* Grammar follows */ +%% +line: header body + ; + +header: '<' from ARROW to '>' type ':' + | '<' ARROW to '>' type ':' + | ARROW to type ':' + | type ':' + | '<' '>' + ; + +from: DATA + | STRING + | INVALID + ; + +to: DATA + | STRING + | INVALID + ; + +type: DATA + | STRING + | INVALID + ; + +body: /* empty */ + | body member + ; + +member: STRING + | DATA + | '+' NUMBER + | '-' NUMBER + | NUMBER + | INVALID + ; +%% +AT_LALR1_CC_IF( +[/* A C++ error reporting function. */ +void +yy::parser::error (const location&, const std::string& m) +{ + std::cerr << m << std::endl; +} + +int +yyparse () +{ + yy::parser parser; + parser.set_debug_level (!!YYDEBUG); + return parser.parse (); +} +], +[static void +yyerror (const char *s) +{ + fprintf (stderr, "%s\n", s); +}]) + +static int +yylex (AT_LALR1_CC_IF([int *lval], [void])) +[{ + static int toknum = 0; + int tokens[] = + { + ':', -1 + }; + ]AT_LALR1_CC_IF([*lval = 0; /* Pacify GCC. */])[ + return tokens[toknum++]; +}] + +int +main (void) +{ + return yyparse (); +} +]) +])# _AT_DATA_DANCER_Y + + +# AT_CHECK_DANCER(BISON-OPTIONS) +# ------------------------------ +# Generate the grammar, compile it, run it. +m4_define([AT_CHECK_DANCER], +[AT_SETUP([Dancer $1]) +AT_BISON_OPTION_PUSHDEFS([$1]) +_AT_DATA_DANCER_Y([$1]) +AT_CHECK([bison -o dancer.c dancer.y]) +AT_LALR1_CC_IF( + [AT_CHECK([bison -o dancer.cc dancer.y]) + AT_COMPILE_CXX([dancer])], + [AT_CHECK([bison -o dancer.c dancer.y]) + AT_COMPILE([dancer])]) +AT_PARSER_CHECK([./dancer], 1, [], +[syntax error, unexpected ':' +]) +AT_BISON_OPTION_POPDEFS +AT_CLEANUP +]) + +AT_CHECK_DANCER() +AT_CHECK_DANCER([%glr-parser]) +AT_CHECK_DANCER([%skeleton "lalr1.cc"])