X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/5e6f62f2f10547c6552d3eb4003c44d66f172686..69ce078b8cf61eb5087b91538d79a1143ce77c46:/tests/glr-regression.at diff --git a/tests/glr-regression.at b/tests/glr-regression.at index fd822a18..e3bdd26b 100644 --- a/tests/glr-regression.at +++ b/tests/glr-regression.at @@ -34,7 +34,7 @@ AT_DATA_GRAMMAR([glr-regr1.y], #define YYSTYPE int static YYSTYPE exprMerge (YYSTYPE x0, YYSTYPE x1); int yylex (void); -int yyerror (char const *msg); +void yyerror (char const *msg); %} @@ -70,11 +70,10 @@ main (void) return yyparse (); } -int +void yyerror (char const *msg) { fprintf (stderr, "%s\n", msg); - exit (4); } @@ -122,8 +121,6 @@ AT_DATA_GRAMMAR([glr-regr2a.y], %{ #define YYSTYPE char const * - #define yyfalse 0 - #define yytrue 1 #include #include @@ -156,10 +153,11 @@ var_list: { $$ = $1; } | var ',' var_list { - $$ = malloc (strlen ($1) + 1 + strlen ($3) + 1); - strcpy ($$, $1); - strcat ($$, ","); - strcat ($$, $3); + char *s = (char *) malloc (strlen ($1) + 1 + strlen ($3) + 1); + strcpy (s, $1); + strcat (s, ","); + strcat (s, $3); + $$ = s; } ; @@ -168,13 +166,14 @@ var_printer: 'v' %% -FILE *yyin = NULL; +FILE *input = NULL; int yylex (void) { char buf[50]; - switch (fscanf (yyin, " %1[a-z,]", buf)) { + char *s; + switch (fscanf (input, " %1[a-z,]", buf)) { case 1: return buf[0]; case EOF: @@ -182,12 +181,13 @@ yylex (void) default: break; } - if (fscanf (yyin, "%49s", buf) != 1) - abort (); + if (fscanf (input, "%49s", buf) != 1) + return 0; if (sizeof buf - 1 <= strlen (buf)) abort (); - yylval = malloc (strlen (buf) + 1); - strcpy (yylval, buf); + s = (char *) malloc (strlen (buf) + 1); + strcpy (s, buf); + yylval = s; return 'V'; } @@ -199,8 +199,8 @@ yyerror (char const *s) int main (int argc, char **argv) { - yyin = stdin; - if (argc == 2 && !(yyin = fopen (argv[1], "r"))) return 1; + input = stdin; + if (argc == 2 && !(input = fopen (argv[1], "r"))) return 3; return yyparse (); } ]]) @@ -239,6 +239,7 @@ AT_DATA_GRAMMAR([glr-regr3.y], static int MergeRule (int x0, int x1); static void yyerror(char const * s); +int yylex (void); #define RULE(x) (1 << (x)) @@ -287,7 +288,7 @@ static void yyerror(char const * s) { fprintf(stderr,"error: %s\n",s); } -FILE *yyin = NULL; +FILE *input = NULL; int P[] = { P1, P2 }; int O[] = { O1, O2 }; @@ -296,9 +297,9 @@ int T[] = { T1, T2, T3, T4 }; int yylex (void) { char inp[3]; - if (fscanf (yyin, "%2s", inp) == EOF) + if (fscanf (input, "%2s", inp) == EOF) return 0; - switch (inp[0]) + switch (inp[0]) { case 'p': return P[inp[1] - '1']; case 't': return T[inp[1] - '1']; @@ -308,8 +309,8 @@ int yylex (void) } int main(int argc, char* argv[]) { - yyin = stdin; - if (argc == 2 && !(yyin = fopen (argv[1], "r"))) return 1; + input = stdin; + if (argc == 2 && !(input = fopen (argv[1], "r"))) return 3; return yyparse (); } ]]) @@ -324,3 +325,490 @@ AT_CHECK([[echo p1 t4 o2 p1 p1 t1 o1 t2 p2 o1 t3 p2 p2 | ./glr-regr3]], 0, ]], []) AT_CLEANUP + + +## ---------------------------------------------------------------------- ## +## Duplicate representation of merged trees ## +## Thanks to Joel E. Denny for this test; see ## +## . ## +## ---------------------------------------------------------------------- ## + +AT_SETUP([Duplicate representation of merged trees]) + +AT_DATA_GRAMMAR([glr-regr4.y], +[[ +%union { char *ptr; } +%type S A A1 A2 B +%glr-parser + +%{ + #include + #include + #include + static char *merge (YYSTYPE, YYSTYPE); + static char *make_value (char const *, char const *); + static void yyerror (char const *); + static int yylex (void); +%} + +%% + +tree: S { printf ("%s\n", $1); } ; + +S: + A %merge { $$ = make_value ("S", $1); } + | B %merge { $$ = make_value ("S", $1); } + ; + +A: + A1 %merge { $$ = make_value ("A", $1); } + | A2 %merge { $$ = make_value ("A", $1); } + ; + +A1: 'a' { $$ = make_value ("A1", "'a'"); } ; +A2: 'a' { $$ = make_value ("A2", "'a'"); } ; +B: 'a' { $$ = make_value ("B", "'a'"); } ; + +%% + +static int +yylex (void) +{ + static char const *input = "a"; + return *input++; +} + +int +main (void) +{ + return yyparse (); +} + +static char * +make_value (char const *parent, char const *child) +{ + char const format[] = "%s <- %s"; + char *value = + (char *) malloc (strlen (parent) + strlen (child) + sizeof format); + sprintf (value, format, parent, child); + return value; +} + +static char * +merge (YYSTYPE s1, YYSTYPE s2) +{ + char const format[] = "merge{ %s and %s }"; + char *value = + (char *) malloc (strlen (s1.ptr) + strlen (s2.ptr) + sizeof format); + sprintf (value, format, s1.ptr, s2.ptr); + return value; +} + +static void +yyerror (char const *msg) +{ + fprintf (stderr, "%s\n", msg); +} +]]) + +AT_CHECK([[bison -o glr-regr4.c glr-regr4.y]], 0, [], +[glr-regr4.y: conflicts: 1 reduce/reduce +]) +AT_COMPILE([glr-regr4]) + +AT_CHECK([[./glr-regr4]], 0, +[[merge{ S <- merge{ A <- A1 <- 'a' and A <- A2 <- 'a' } and S <- B <- 'a' } +]], []) + +AT_CLEANUP + + +## ------------------------------------------------------------------------- ## +## User destructor for unresolved GLR semantic value ## +## Thanks to Joel E. Denny for this test; see ## +## . ## +## ------------------------------------------------------------------------- ## + +AT_SETUP([User destructor for unresolved GLR semantic value]) + +AT_DATA_GRAMMAR([glr-regr5.y], +[[ +%{ + #include + #include + static void yyerror (char const *); + static int yylex (void); + enum { MAGIC_VALUE = -1057808125 }; /* originally chosen at random */ +%} + +%glr-parser +%union { int value; } +%type start + +%destructor { + if ($$ != MAGIC_VALUE) + { + fprintf (stderr, "Bad destructor call.\n"); + exit (EXIT_FAILURE); + } +} start + +%% + +start: + 'a' { $$ = MAGIC_VALUE; } + | 'a' { $$ = MAGIC_VALUE; } + ; + +%% + +static int +yylex (void) +{ + static char const *input = "a"; + return *input++; +} + +static void +yyerror (char const *msg) +{ + fprintf (stderr, "%s\n", msg); +} + +int +main (void) +{ + return yyparse () != 1; +} +]]) + +AT_CHECK([[bison -o glr-regr5.c glr-regr5.y]], 0, [], +[glr-regr5.y: conflicts: 1 reduce/reduce +]) +AT_COMPILE([glr-regr5]) + +AT_CHECK([[./glr-regr5]], 0, [], +[syntax is ambiguous +]) + +AT_CLEANUP + + +## ------------------------------------------------------------------------- ## +## User destructor after an error during a split parse ## +## Thanks to Joel E. Denny for this test; see ## +## . ## +## ------------------------------------------------------------------------- ## + +AT_SETUP([User destructor after an error during a split parse]) + +AT_DATA_GRAMMAR([glr-regr6.y], +[[ +%{ + #include + #include + static void yyerror (char const *); + static int yylex (void); +%} + +%glr-parser +%union { int value; } +%type 'a' + +%destructor { + printf ("Destructor called.\n"); +} 'a' + +%% + +start: 'a' | 'a' ; + +%% + +static int +yylex (void) +{ + static char const *input = "a"; + return *input++; +} + +static void +yyerror (char const *msg) +{ + fprintf (stderr, "%s\n", msg); +} + +int +main (void) +{ + return yyparse () != 1; +} +]]) + +AT_CHECK([[bison -o glr-regr6.c glr-regr6.y]], 0, [], +[glr-regr6.y: conflicts: 1 reduce/reduce +]) +AT_COMPILE([glr-regr6]) + +AT_CHECK([[./glr-regr6]], 0, +[Destructor called. +], +[syntax is ambiguous +]) + +AT_CLEANUP + + +## ------------------------------------------------------------------------- ## +## Duplicated user destructor for lookahead ## +## Thanks to Joel E. Denny for this test; see ## +## . ## +## ------------------------------------------------------------------------- ## + +AT_SETUP([Duplicated user destructor for lookahead]) + +AT_DATA_GRAMMAR([glr-regr7.y], +[[ +%{ + #include + #include + static void yyerror (char const *); + static int yylex (void); + #define YYSTACKEXPANDABLE 0 +%} + +%glr-parser +%union { int *count; } +%type 'a' + +%destructor { + if ((*$$)++) + fprintf (stderr, "Destructor called on same value twice.\n"); +} 'a' + +%% + +start: + stack1 start + | stack2 start + | /* empty */ + ; +stack1: 'a' ; +stack2: 'a' ; + +%% + +static int +yylex (void) +{ + yylval.count = (int *) malloc (sizeof (int)); + if (!yylval.count) + { + fprintf (stderr, "Test inconclusive.\n"); + exit (EXIT_FAILURE); + } + *yylval.count = 0; + return 'a'; +} + +static void +yyerror (char const *msg) +{ + fprintf (stderr, "%s\n", msg); +} + +int +main (void) +{ + return yyparse (); +} +]]) + +AT_CHECK([[bison -o glr-regr7.c glr-regr7.y]], 0, [], +[glr-regr7.y: conflicts: 2 reduce/reduce +]) +AT_COMPILE([glr-regr7]) + +AT_CHECK([[./glr-regr7]], 2, [], +[memory exhausted +]) + +AT_CLEANUP + + +## ------------------------------------------------------------------------- ## +## Incorrect default location for empty right-hand sides. Adapted from bug ## +## report by Claudia Hermann. ## +## See http://lists.gnu.org/archive/html/bug-bison/2005-10/msg00069.html and ## +## http://lists.gnu.org/archive/html/bug-bison/2005-10/msg00072.html ## +## ------------------------------------------------------------------------- ## + +AT_SETUP([Incorrectly initialized location for empty right-hand side in GLR]) + +AT_DATA_GRAMMAR([glr-regr8.y], +[[ +%{ + #include + #include + static void yyerror (char const *); + static int yylex (void); + static void yyerror(const char *msg); +%} + +%token T_CONSTANT +%token T_PORT +%token T_SIGNAL + +%glr-parser + +%% + + +PortClause : T_PORT InterfaceDeclaration T_PORT + { printf("%d/%d - %d/%d - %d/%d\n", + @1.first_column, @1.last_column, + @2.first_column, @2.last_column, + @3.first_column, @3.last_column); } + ; + +InterfaceDeclaration : OptConstantWord %dprec 1 + | OptSignalWord %dprec 2 + ; + +OptConstantWord : /* empty */ + | T_CONSTANT + ; + +OptSignalWord : /* empty */ + { printf("empty: %d/%d\n", @$.first_column, @$.last_column); } + | T_SIGNAL + ; + +%% + +void yyerror(const char *msg) +{ + fprintf (stderr, "error\n"); +} + +static int lexIndex; + +int yylex (void) +{ + lexIndex += 1; + switch (lexIndex) + { + case 1: + yylloc.first_column = 1; + yylloc.last_column = 9; + return T_PORT; + case 2: + yylloc.first_column = 13; + yylloc.last_column = 17; + return T_PORT; + default: + return 0; + } +} + +int +main (void) +{ + yyparse(); + return 0; +} +]]) + +AT_CHECK([[bison -o glr-regr8.c glr-regr8.y]], 0, [], +[glr-regr8.y: conflicts: 1 reduce/reduce +]) +AT_COMPILE([glr-regr8]) + +AT_CHECK([[./glr-regr8]], 0, +[empty: 9/9 +1/9 - 9/9 - 13/17 +], +[]) + +AT_CLEANUP + + +## ------------------------------------------------------------------------- ## +## No users destructors if stack 0 deleted ## +## Thanks to Joel E. Denny for this test; see ## +## . ## +## ------------------------------------------------------------------------- ## + +AT_SETUP([No users destructors if stack 0 deleted]) + +AT_DATA_GRAMMAR([glr-regr9.y], +[[ +%{ + #include + #include + static void yyerror (char const *); + static int yylex (void); + #define YYSTACKEXPANDABLE 0 + static int tokens = 0; + static int destructors = 0; +%} + +%glr-parser +%union { int dummy; } +%type 'a' + +%destructor { + destructors += 1; +} 'a' + +%% + +start: + ambig0 'a' { destructors += 2; } + | ambig1 start { destructors += 1; } + | ambig2 start { destructors += 1; } + ; + +ambig0: 'a' ; +ambig1: 'a' ; +ambig2: 'a' ; + +%% + +static int +yylex (void) +{ + tokens += 1; + return 'a'; +} + +static void +yyerror (char const *msg) +{ + fprintf (stderr, "%s\n", msg); +} + +int +main (void) +{ + int exit_status; + exit_status = yyparse (); + if (tokens != destructors) + { + fprintf (stderr, "Tokens = %d, Destructors = %d\n", tokens, destructors); + return 1; + } + return !exit_status; +} +]]) + +AT_CHECK([[bison -o glr-regr9.c glr-regr9.y]], 0, [], +[glr-regr9.y: conflicts: 1 reduce/reduce +]) +AT_COMPILE([glr-regr9]) + +AT_CHECK([[./glr-regr9]], 0, [], +[memory exhausted +]) + +AT_CLEANUP