mirror of
https://git.savannah.gnu.org/git/bison.git
synced 2026-03-09 12:23:04 +00:00
e9955c8373
* src/reader.c, src/reader.h (prologue_augment): New. * src/reader.c (copy_definition): Remove. * src/reader.h, src/reader.c (gram_start_symbol_set, prologue_augment) (grammar_symbol_append, grammar_rule_begin, grammar_midrule_action) (grammar_current_rule_prec_set, grammar_current_rule_check) (grammar_current_rule_symbol_append) (grammar_current_rule_action_append): Export. * src/parse-gram.y (symbol_list_new, symbol_list_symbol_append_ (symbol_list_action_append): Remove. Hook the routines from reader. * src/scan-gram.l: In INITIAL, characters and strings are tokens. * src/system.h (ATTRIBUTE_NORETURN, ATTRIBUTE_UNUSED): Now. * src/reader.c (read_declarations): Remove, unused. * src/parse-gram.y: Handle the epilogue. * src/reader.h, src/reader.c (gram_start_symbol_set): Rename as... (grammar_start_symbol_set): this. * src/scan-gram.l: Be sure to ``use'' yycontrol to keep GCC quiet. * src/reader.c (readgram): Remove, unused. (reader): Adjust to insert eoftoken and axiom where appropriate. * src/reader.c (copy_dollar): Replace with... * src/scan-gram.h (handle_dollar): this. * src/parse-gram.y: Remove `%thong'. * src/reader.c (copy_at): Replace with... * src/scan-gram.h (handle_at): this. * src/complain.h, src/complain.c (warn_at, complain_at, fatal_at): New. * src/scan-gram.l (YY_LINES): Keep lineno synchronized for the time being. * src/reader.h, src/reader.c (grammar_rule_end): New. * src/parse.y (current_type, current_class): New. Implement `%nterm', `%token' support. Merge `%term' into `%token'. (string_as_id): New. * src/symtab.h, src/symtab.c (symbol_make_alias): Don't pass the type name. * src/parse-gram.y: Be sure to handle properly the beginning of rules. * src/parse-gram.y: Handle %type. * src/reader.c (grammar_rule_end): Call grammar_current_rule_check. * src/parse-gram.y: More directives support. * src/options.c: No longer handle source directives. * src/parse-gram.y: Fix %output. * src/parse-gram.y: Handle %union. Use the prologue locations. * src/reader.c (parse_union_decl): Remove. * src/reader.h, src/reader.c (epilogue_set): New. * src/parse-gram.y: Use it. * data/bison.simple, data/bison.c++: b4_stype is now either not defined, then default to int, or to the contents of %union, without `union' itself. Adjust. * src/muscle_tab.c (muscle_init): Don't predefine `stype'. * src/output.c (actions_output): Don't output braces, as they are already handled by the scanner. * src/scan-gram.l (SC_CHARACTER): Set the user_token_number of characters to themselves. * tests/reduce.at (Reduced Automaton): End the grammars with %% so that the epilogue has a proper #line. * src/parse-gram.y: Handle precedence/associativity. * src/symtab.c (symbol_precedence_set): Requires the symbol to be a terminal. * src/scan-gram.l (SC_BRACED_CODE): Catch strings and characters. * tests/calc.at: Do not use `%token "foo"' as it makes not sense at all to define terminals that cannot be emitted. * src/scan-gram.l: Escape M4 characters. * src/scan-gram.l: Working properly with escapes in user strings/characters. * tests/torture.at (AT_DATA_TRIANGULAR_GRAMMAR) (AT_DATA_HORIZONTAL_GRAMMAR): Respect the `%token ID NUM STRING' grammar. Use more modest sizes, as for the time being the parser does not release memory, and therefore the process swallows a huge amount of memory. * tests/torture.at (AT_DATA_LOOKAHEADS_GRAMMAR): Adjust to the stricter %token grammar. * src/symtab.h (associativity): Add `undef_assoc'. (symbol_precedence_set): Do nothing when passed an undef_assoc. * src/symtab.c (symbol_check_alias_consistence): Adjust. * tests/regression.at (Invalid %directive): Remove, as it is now meaningless. (Invalid inputs): Adjust to the new error messages. (Token definitions): The new grammar doesn't allow too many eccentricities. * src/lex.h, src/lex.c: Remove. * src/reader.c (lastprec, skip_to_char, read_signed_integer) (copy_character, copy_string2, copy_string, copy_identifier) (copy_comment, parse_token_decl, parse_type_decl, parse_assoc_decl) (parse_muscle_decl, parse_dquoted_param, parse_skel_decl) (parse_action): Remove. * po/POTFILES.in: Adjust.
455 lines
8.8 KiB
Plaintext
455 lines
8.8 KiB
Plaintext
# Torturing Bison. -*- Autotest -*-
|
|
# Copyright (C) 2001, 2002 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
|
|
# the Free Software Foundation; either version 2, or (at your option)
|
|
# any later version.
|
|
|
|
# This program is distributed in the hope that it will be useful,
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
# GNU General Public License for more details.
|
|
|
|
# You should have received a copy of the GNU General Public License
|
|
# along with this program; if not, write to the Free Software
|
|
# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
|
# 02111-1307, USA.
|
|
|
|
AT_BANNER([[Torture Tests.]])
|
|
|
|
|
|
## ------------------------------------- ##
|
|
## Creating a large artificial grammar. ##
|
|
## ------------------------------------- ##
|
|
|
|
# AT_DATA_TRIANGULAR_GRAMMAR(FILE-NAME, SIZE)
|
|
# -------------------------------------------
|
|
# Create FILE-NAME, containing a self checking parser for a huge
|
|
# triangular grammar.
|
|
m4_define([AT_DATA_TRIANGULAR_GRAMMAR],
|
|
[AT_DATA([[gengram.pl]],
|
|
[[#! /usr/bin/perl -w
|
|
|
|
use strict;
|
|
my $max = $ARGV[0] || 10;
|
|
|
|
print <<EOF;
|
|
%{
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <assert.h>
|
|
|
|
#define YYERROR_VERBOSE 1
|
|
#define YYDEBUG 1
|
|
|
|
static int yylex (void);
|
|
static void yyerror (const char *msg);
|
|
%}
|
|
%union
|
|
{
|
|
int val;
|
|
};
|
|
|
|
%token END "end"
|
|
%type <val> exp input
|
|
EOF
|
|
|
|
for my $size (1 .. $max)
|
|
{
|
|
print "%token t$size $size \"$size\"\n";
|
|
};
|
|
|
|
print <<EOF;
|
|
%%
|
|
input:
|
|
exp { assert (\@S|@1 == 0); \$\$ = \@S|@1; }
|
|
| input exp { assert (\@S|@2 == \@S|@1 + 1); \$\$ = \@S|@2; }
|
|
;
|
|
|
|
exp:
|
|
END
|
|
{ \$\$ = 0; }
|
|
EOF
|
|
|
|
for my $size (1 .. $max)
|
|
{
|
|
use Text::Wrap;
|
|
print wrap ("| ", " ",
|
|
(map { "\"$_\"" } (1 .. $size)),
|
|
" END \n"),
|
|
" { \$\$ = $size; }\n";
|
|
};
|
|
print ";\n";
|
|
|
|
print <<EOF;
|
|
%%
|
|
static int
|
|
yylex (void)
|
|
{
|
|
static int inner = 1;
|
|
static int outer = 0;
|
|
if (outer > $max)
|
|
return 0;
|
|
else if (inner > outer)
|
|
{
|
|
inner = 1;
|
|
++outer;
|
|
return END;
|
|
}
|
|
return inner++;
|
|
}
|
|
|
|
static void
|
|
yyerror (const char *msg)
|
|
{
|
|
fprintf (stderr, "%s\\n", msg);
|
|
}
|
|
|
|
int
|
|
main (void)
|
|
{
|
|
yydebug = !!getenv ("YYDEBUG");
|
|
return yyparse ();
|
|
}
|
|
EOF
|
|
]])
|
|
|
|
AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
|
|
mv stdout $1
|
|
])
|
|
|
|
|
|
## -------------- ##
|
|
## Big triangle. ##
|
|
## -------------- ##
|
|
|
|
AT_SETUP([Big triangle])
|
|
|
|
# I have been able to go up to 2000 on my machine.
|
|
# I tried 3000, a 29Mb grammar file, but then my system killed bison.
|
|
# With 500 and the new parser, which consume far too much memory,
|
|
# it gets killed too. Of course the parser is to be cleaned.
|
|
AT_DATA_TRIANGULAR_GRAMMAR([input.y], [200])
|
|
AT_CHECK([bison input.y -v -o input.c])
|
|
AT_CHECK([$CC $CFLAGS $CPPFLAGS input.c -o input], 0, [], [ignore])
|
|
AT_CHECK([./input])
|
|
|
|
AT_CLEANUP
|
|
|
|
|
|
|
|
# AT_DATA_HORIZONTAL_GRAMMAR(FILE-NAME, SIZE)
|
|
# -------------------------------------------
|
|
# Create FILE-NAME, containing a self checking parser for a huge
|
|
# horizontal grammar.
|
|
m4_define([AT_DATA_HORIZONTAL_GRAMMAR],
|
|
[AT_DATA([[gengram.pl]],
|
|
[[#! /usr/bin/perl -w
|
|
|
|
use strict;
|
|
my $max = $ARGV[0] || 10;
|
|
|
|
print <<EOF;
|
|
%{
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <assert.h>
|
|
|
|
#define YYERROR_VERBOSE 1
|
|
#define YYDEBUG 1
|
|
|
|
static int yylex (void);
|
|
static void yyerror (const char *msg);
|
|
%}
|
|
EOF
|
|
|
|
for my $size (1 .. $max)
|
|
{
|
|
print "%token t$size $size \"$size\"\n";
|
|
};
|
|
|
|
print <<EOF;
|
|
%%
|
|
EOF
|
|
|
|
use Text::Wrap;
|
|
print
|
|
wrap ("exp: ", " ",
|
|
(map { "\"$_\"" } (1 .. $max)), ";"),
|
|
"\n";
|
|
|
|
print <<EOF;
|
|
%%
|
|
static int
|
|
yylex (void)
|
|
{
|
|
static int counter = 1;
|
|
if (counter > $max)
|
|
return 0;
|
|
else
|
|
return counter++;
|
|
}
|
|
|
|
static void
|
|
yyerror (const char *msg)
|
|
{
|
|
fprintf (stderr, "%s\\n", msg);
|
|
}
|
|
|
|
int
|
|
main (void)
|
|
{
|
|
yydebug = !!getenv ("YYDEBUG");
|
|
return yyparse ();
|
|
}
|
|
EOF
|
|
]])
|
|
|
|
AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
|
|
mv stdout $1
|
|
])
|
|
|
|
|
|
## ---------------- ##
|
|
## Big horizontal. ##
|
|
## ---------------- ##
|
|
|
|
AT_SETUP([Big horizontal])
|
|
|
|
# I have been able to go up to 10000 on my machine, but I had to
|
|
# increase the maximum stack size (* 100). It gave:
|
|
#
|
|
# input.y 263k
|
|
# input.tab.c 1.3M
|
|
# input 453k
|
|
#
|
|
# gengram.pl 10000 0.70s user 0.01s sys 99% cpu 0.711 total
|
|
# bison input.y 730.56s user 0.53s sys 99% cpu 12:12.34 total
|
|
# gcc -Wall input.tab.c -o input 5.81s user 0.20s sys 100% cpu 6.01 total
|
|
# ./input 0.00s user 0.01s sys 108% cpu 0.01 total
|
|
#
|
|
AT_DATA_HORIZONTAL_GRAMMAR([input.y], [1000])
|
|
AT_CHECK([bison input.y -v -o input.c])
|
|
AT_CHECK([$CC $CFLAGS $CPPFLAGS input.c -o input], 0, [], [ignore])
|
|
AT_CHECK([./input])
|
|
|
|
AT_CLEANUP
|
|
|
|
|
|
|
|
# AT_DATA_LOOKAHEADS_GRAMMAR(FILE-NAME, SIZE)
|
|
# -------------------------------------------
|
|
# Create FILE-NAME, containing a self checking parser for a grammar
|
|
# requiring SIZE lookaheads.
|
|
m4_define([AT_DATA_LOOKAHEADS_GRAMMAR],
|
|
[AT_DATA([[gengram.pl]],
|
|
[[#! /usr/bin/perl -w
|
|
|
|
use strict;
|
|
use Text::Wrap;
|
|
my $max = $ARGV[0] || 10;
|
|
|
|
print <<EOF;
|
|
%{
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <assert.h>
|
|
|
|
#define YYERROR_VERBOSE 1
|
|
#define YYDEBUG 1
|
|
|
|
static int yylex (void);
|
|
static void yyerror (const char *msg);
|
|
%}
|
|
%union
|
|
{
|
|
int val;
|
|
};
|
|
|
|
%type <val> input exp
|
|
%token token
|
|
EOF
|
|
|
|
print
|
|
wrap ("%type <val> ",
|
|
" ",
|
|
map { "n$_" } (1 .. $max)),
|
|
"\n";
|
|
|
|
for my $count (1 .. $max)
|
|
{
|
|
print "%token t$count $count \"$count\"\n";
|
|
};
|
|
|
|
print <<EOF;
|
|
%%
|
|
input:
|
|
exp { assert (\@S|@1 == 1); \$\$ = \@S|@1; }
|
|
| input exp { assert (\@S|@2 == \@S|@1 + 1); \$\$ = \@S|@2; }
|
|
;
|
|
|
|
exp:
|
|
n1 "1" { assert (\@S|@1 == 1); }
|
|
EOF
|
|
|
|
for my $count (2 .. $max)
|
|
{
|
|
print "| n$count \"$count\" { assert (\@S|@1 == $count); }\n";
|
|
};
|
|
print ";\n";
|
|
|
|
for my $count (1 .. $max)
|
|
{
|
|
print "n$count: token { \$\$ = $count; };\n";
|
|
};
|
|
|
|
print <<EOF;
|
|
%%
|
|
static int
|
|
yylex (void)
|
|
{
|
|
static int return_token = 1;
|
|
static int counter = 1;
|
|
if (counter > $max)
|
|
return 0;
|
|
if (return_token)
|
|
{
|
|
return_token = 0;
|
|
return token;
|
|
}
|
|
return_token = 1;
|
|
return counter++;
|
|
}
|
|
|
|
static void
|
|
yyerror (const char *msg)
|
|
{
|
|
fprintf (stderr, "%s\\n", msg);
|
|
}
|
|
|
|
int
|
|
main (void)
|
|
{
|
|
yydebug = !!getenv ("YYDEBUG");
|
|
return yyparse ();
|
|
}
|
|
EOF
|
|
]])
|
|
|
|
AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
|
|
mv stdout $1
|
|
])
|
|
|
|
|
|
## ----------------- ##
|
|
## Many lookaheads. ##
|
|
## ----------------- ##
|
|
|
|
AT_SETUP([Many lookaheads])
|
|
|
|
AT_DATA_LOOKAHEADS_GRAMMAR([input.y], [1000])
|
|
AT_CHECK([bison input.y -v -o input.c])
|
|
AT_CHECK([$CC $CFLAGS $CPPFLAGS input.c -o input], 0, [], [ignore])
|
|
AT_CHECK([./input])
|
|
|
|
AT_CLEANUP
|
|
|
|
|
|
|
|
# AT_DATA_STACK_TORTURE(C-PROLOGUE)
|
|
# ---------------------------------
|
|
# 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.
|
|
# exp:
|
|
AT_DATA([input.y],
|
|
[[%{
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <assert.h>
|
|
]$1[
|
|
static int yylex (void);
|
|
static void yyerror (const char *msg);
|
|
#define YYPRINT(File, Type, Value) \
|
|
fprintf (File, " (%d, stack size = %d, max = %d)", \
|
|
Value, yyssp - yyss + 1, yystacksize);
|
|
%}
|
|
%error-verbose
|
|
%debug
|
|
%token WAIT_FOR_EOF
|
|
%%
|
|
exp: WAIT_FOR_EOF exp | ;
|
|
%%
|
|
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)
|
|
{
|
|
if (yylval--)
|
|
return WAIT_FOR_EOF;
|
|
else
|
|
return EOF;
|
|
}
|
|
|
|
int
|
|
main (int argc, const char **argv)
|
|
{
|
|
assert (argc == 2);
|
|
yylval = atoi (argv[1]);
|
|
yydebug = 1;
|
|
return yyparse ();
|
|
}
|
|
]])
|
|
AT_CHECK([bison input.y -o input.c])
|
|
AT_CHECK([$CC $CFLAGS $CPPFLAGS input.c -o input], 0, [], [ignore])
|
|
])
|
|
|
|
|
|
## -------------------------------------- ##
|
|
## Exploding the Stack Size with Alloca. ##
|
|
## -------------------------------------- ##
|
|
|
|
AT_SETUP([Exploding the Stack Size with Alloca])
|
|
|
|
AT_DATA_STACK_TORTURE
|
|
|
|
# Below the limit of 200.
|
|
AT_CHECK([./input 20], 0, [], [ignore])
|
|
# Two enlargements: 2 * 2 * 200.
|
|
AT_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_CHECK([./input 10000], 1, [], [ignore])
|
|
|
|
AT_CLEANUP
|
|
|
|
|
|
|
|
|
|
## -------------------------------------- ##
|
|
## Exploding the Stack Size with Malloc. ##
|
|
## -------------------------------------- ##
|
|
|
|
AT_SETUP([Exploding the Stack Size with Malloc])
|
|
|
|
AT_DATA_STACK_TORTURE([[#define YYSTACK_USE_ALLOCA 0]])
|
|
|
|
# Below the limit of 200.
|
|
AT_CHECK([./input 20], 0, [], [ignore])
|
|
# Two enlargements: 2 * 2 * 200.
|
|
AT_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_CHECK([./input 10000], 1, [], [ignore])
|
|
|
|
AT_CLEANUP
|