X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/0fb669f9d648dfdd7a39478a6b658511455ae966..1b9c21fb18c6d82f9b7512bc0f2f9d980a32c398:/tests/torture.at

diff --git a/tests/torture.at b/tests/torture.at
index df20a346..ff373c21 100644
--- a/tests/torture.at
+++ b/tests/torture.at
@@ -50,13 +50,12 @@ my $max = $ARGV[0] || 10;
 
 print <<EOF;
 ]AT_DATA_GRAMMAR_PROLOGUE[
+%error-verbose
+%debug
 %{
 #include <stdio.h>
 #include <stdlib.h>
 
-#define YYERROR_VERBOSE 1
-#define YYDEBUG 1
-
 static int yylex (void);
 static void yyerror (const char *msg);
 %}
@@ -166,24 +165,25 @@ my $max = $ARGV[0] || 10;
 
 print <<EOF;
 ]AT_DATA_GRAMMAR_PROLOGUE[
+%error-verbose
+%debug
 %{
 #include <stdio.h>
 #include <stdlib.h>
 
-#define YYERROR_VERBOSE 1
-#define YYDEBUG 1
-
 static int yylex (void);
 static void yyerror (const char *msg);
 %}
-EOF
 
+%token
+EOF
 for my $size (1 .. $max)
   {
-    print "%token t$size $size \"$size\"\n";
+    print "    t$size $size \"$size\"\n";
   };
 
 print <<EOF;
+
 %%
 EOF
 
@@ -258,7 +258,7 @@ AT_CLEANUP
 
 
 # AT_DATA_LOOK_AHEAD_TOKENS_GRAMMAR(FILE-NAME, SIZE)
-# -------------------------------------------
+# --------------------------------------------------
 # Create FILE-NAME, containing a self checking parser for a grammar
 # requiring SIZE look-ahead tokens.
 m4_define([AT_DATA_LOOK_AHEAD_TOKENS_GRAMMAR],
@@ -270,12 +270,12 @@ use Text::Wrap;
 my $max = $ARGV[0] || 10;
 
 print <<EOF;
+%error-verbose
+%debug
 %{
-#include <stdio.h>
-#include <stdlib.h>
-
-#define YYERROR_VERBOSE 1
-#define YYDEBUG 1
+# include <stdio.h>
+# include <stdlib.h>
+# include <assert.h>
 
 static int yylex (void);
 static void yyerror (const char *msg);
@@ -295,25 +295,26 @@ print
 	map { "n$_" } (1 .. $max)),
   "\n";
 
+print "%token\n";
 for my $count (1 .. $max)
   {
-    print "%token t$count $count \"$count\"\n";
+    print "    t$count $count \"$count\"\n";
   };
 
 print <<EOF;
 %%
 input:
-  exp        { if (\@S|@1 != 1) abort (); \$\$ = \@S|@1; }
-| input exp  { if (\@S|@2 != \@S|@1 + 1) abort (); \$\$ = \@S|@2; }
+  exp        { assert (\@S|@1 == 1); \$\$ = \@S|@1; }
+| input exp  { assert (\@S|@2 == \@S|@1 + 1); \$\$ = \@S|@2; }
 ;
 
 exp:
-  n1 "1" { if (\@S|@1 != 1) abort (); }
+  n1 "1" { assert (\@S|@1 == 1); \@S|@\@S|@ = \@S|@1; }
 EOF
 
 for my $count (2 .. $max)
   {
-    print "| n$count \"$count\" { if (\@S|@1 != $count) abort (); }\n";
+    print "| n$count \"$count\" { assert (\@S|@1 == $count); \@S|@\@S|@ = \@S|@1; }\n";
   };
 print ";\n";
 
@@ -388,6 +389,8 @@ m4_define([AT_DATA_STACK_TORTURE],
 # exp:
 AT_DATA([input.y],
 [[%{
+#include <errno.h>
+#include <limits.h>
 #include <stdio.h>
 #include <stdlib.h>
 ]$1[
@@ -404,12 +407,8 @@ static void
 yyerror (const char *msg)
 {
   fprintf (stderr, "%s\n", msg);
-  exit (1);
 }
 
-/* There are YYLVAL_MAX of WAIT_FOR_EOFs. */
-unsigned int yylval_max;
-
 static int
 yylex (void)
 {
@@ -422,9 +421,14 @@ yylex (void)
 int
 main (int argc, const char **argv)
 {
+  char *endp;
   if (argc != 2)
     abort ();
-  yylval = atoi (argv[1]);
+  yylval = strtol (argv[1], &endp, 10);
+  if (! (argv[1] != endp
+	 && 0 <= yylval && yylval <= INT_MAX
+	 && errno != ERANGE))
+    abort ();
   yydebug = 1;
   return yyparse ();
 }
@@ -441,7 +445,8 @@ AT_COMPILE([input])
 AT_SETUP([Exploding the Stack Size with Alloca])
 
 AT_DATA_STACK_TORTURE([[
-#if defined __GNUC__ || defined alloca
+#if (defined __GNUC__ || defined __BUILTIN_VA_ARG_INCR \
+     || defined _AIX || defined _MSC_VER || defined _ALLOCA_H)
 # define YYSTACK_USE_ALLOCA 1
 #endif
 ]])
@@ -452,7 +457,7 @@ AT_PARSER_CHECK([./input 20], 0, [], [ignore])
 AT_PARSER_CHECK([./input 900], 0, [], [ignore])
 # Fails: beyond the limit of 10,000 (which we don't reach anyway since we
 # multiply by two starting at 200 => 5120 is the last possible).
-AT_PARSER_CHECK([./input 10000], 1, [], [ignore])
+AT_PARSER_CHECK([./input 10000], 2, [], [ignore])
 
 AT_CLEANUP
 
@@ -473,6 +478,6 @@ AT_PARSER_CHECK([./input 20], 0, [], [ignore])
 AT_PARSER_CHECK([./input 900], 0, [], [ignore])
 # Fails: beyond the limit of 10,000 (which we don't reach anyway since we
 # multiply by two starting at 200 => 5120 is the possible).
-AT_PARSER_CHECK([./input 10000], 1, [], [ignore])
+AT_PARSER_CHECK([./input 10000], 2, [], [ignore])
 
 AT_CLEANUP