## ------------------------ ##
-## Many lookahead tokens. ##
+## Many lookahead tokens. ##
## ------------------------ ##
AT_SETUP([Many lookahead tokens])
-# AT_DATA_STACK_TORTURE(C-PROLOGUE)
-# ---------------------------------
+# AT_DATA_STACK_TORTURE(C-PROLOGUE, [BISON-DECLS])
+# ------------------------------------------------
# A parser specialized in torturing the stack size.
m4_define([AT_DATA_STACK_TORTURE],
[# A grammar of parens growing the stack thanks to right recursion.
static int yylex (void);
static void yyerror (const char *msg);
%}
+]$2[
%error-verbose
%debug
%token WAIT_FOR_EOF
main (int argc, const char **argv)
{
char *endp;
+ YYSTYPE yylval_init;
if (argc != 2)
abort ();
- yylval = strtol (argv[1], &endp, 10);
+ yylval_init = strtol (argv[1], &endp, 10);
if (! (argv[1] != endp
- && 0 <= yylval && yylval <= INT_MAX
+ && 0 <= yylval_init && yylval_init <= INT_MAX
&& errno != ERANGE))
abort ();
yydebug = 1;
- return yyparse ();
+ {
+ int count;
+ int status;
+]m4_bmatch([$2], [%push-],
+[[ yypstate *yyps = yypstate_new ();
+]])[ for (count = 0; count < 2; ++count)
+ {
+ int new_status;
+ yylval = yylval_init;
+]m4_bmatch([$2], [%push-],
+[[ new_status = yypull_parse (yyps);
+]],
+[[ new_status = yyparse ();
+]])[ if (count > 0 && new_status != status)
+ abort ();
+ status = new_status;
+ }
+]m4_bmatch([$2], [%push-],
+[[ yypstate_delete (yyps);
+]])[ return status;
+ }
}
]])
AT_CHECK([bison -o input.c input.y])
AT_SETUP([Exploding the Stack Size with Alloca])
-AT_DATA_STACK_TORTURE([[
+m4_pushdef([AT_USE_ALLOCA], [[
#if (defined __GNUC__ || defined __BUILTIN_VA_ARG_INCR \
|| defined _AIX || defined _MSC_VER || defined _ALLOCA_H)
# define YYSTACK_USE_ALLOCA 1
#endif
]])
+AT_DATA_STACK_TORTURE([AT_USE_ALLOCA])
+
# Below the limit of 200.
AT_PARSER_CHECK([./input 20], 0, [], [ignore])
# Two enlargements: 2 * 2 * 200.
# multiply by two starting at 200 => 5120 is the last possible).
AT_PARSER_CHECK([./input 10000], 2, [], [ignore])
+AT_DATA_STACK_TORTURE([AT_USE_ALLOCA],
+[[%push-pull-parser
+]])
+AT_PARSER_CHECK([./input 20], 0, [], [ignore])
+AT_PARSER_CHECK([./input 900], 0, [], [ignore])
+AT_PARSER_CHECK([./input 10000], 2, [], [ignore])
+
+m4_popdef([AT_USE_ALLOCA])
+
AT_CLEANUP
AT_SETUP([Exploding the Stack Size with Malloc])
-AT_DATA_STACK_TORTURE([[#define YYSTACK_USE_ALLOCA 0]])
+m4_pushdef([AT_USE_ALLOCA], [[#define YYSTACK_USE_ALLOCA 0]])
+
+AT_DATA_STACK_TORTURE([AT_USE_ALLOCA])
# Below the limit of 200.
AT_PARSER_CHECK([./input 20], 0, [], [ignore])
# multiply by two starting at 200 => 5120 is the possible).
AT_PARSER_CHECK([./input 10000], 2, [], [ignore])
+AT_DATA_STACK_TORTURE([AT_USE_ALLOCA],
+[[%push-pull-parser
+]])
+AT_PARSER_CHECK([./input 20], 0, [], [ignore])
+AT_PARSER_CHECK([./input 900], 0, [], [ignore])
+AT_PARSER_CHECK([./input 10000], 2, [], [ignore])
+
+m4_popdef([AT_USE_ALLOCA])
+
AT_CLEANUP