summaryrefslogtreecommitdiff
path: root/etc
diff options
context:
space:
mode:
authorAkim Demaille <demaille@gostai.com>2008-07-17 15:54:30 +0200
committerAkim Demaille <demaille@gostai.com>2008-11-03 22:00:48 +0100
commit5b421a4e8ef66052fd5aa72add2030da679d220e (patch)
treea98bce71b51fee926ac1156e9bbb84bffe1d4b36 /etc
parentd11ee647c32a0216902e8b4da5d9501c0fbc6d11 (diff)
downloadbison-5b421a4e8ef66052fd5aa72add2030da679d220e.tar.gz
bench: check impact of %debug on variants.
* etc/bench.pl.in (variant_grammar): Fix the computation of $variant. Generate a grammar file that can work with or without %debug. Do use the @directive. (bench_variant_parser): Check impact of %debug. (@directives): Rename all the occurrences to... (@directive): this, for consistency.
Diffstat (limited to 'etc')
-rwxr-xr-xetc/bench.pl.in49
1 files changed, 27 insertions, 22 deletions
diff --git a/etc/bench.pl.in b/etc/bench.pl.in
index 1d6d90c8..481f3dda 100755
--- a/etc/bench.pl.in
+++ b/etc/bench.pl.in
@@ -119,9 +119,9 @@ not a valid directive.
sub directives($@)
{
- my ($bench, @directives) = @_;
+ my ($bench, @directive) = @_;
my $res = "/* Directives for bench `$bench'. */\n";
- for my $d (@directives)
+ for my $d (@directive)
{
$res .= $d . "\n"
unless $d eq '%variant';
@@ -130,7 +130,7 @@ sub directives($@)
return $res;
}
-=item C<triangular_grammar ($base, $max, @directives)>
+=item C<triangular_grammar ($base, $max, @directive)>
Create a large triangular grammar which looks like :
@@ -150,7 +150,7 @@ Create a large triangular grammar which looks like :
C<$base> is the base name for the file to create (F<$base.y>).
C<$max> is the number of such rules (here, 5). You may pass
-additional Bison C<@directives>.
+additional Bison C<@directive>.
The created parser is self contained: it includes its scanner, and
source of input.
@@ -158,8 +158,8 @@ source of input.
sub triangular_grammar ($$$)
{
- my ($base, $max, @directives) = @_;
- my $directives = directives ($base, @directives);
+ my ($base, $max, @directive) = @_;
+ my $directives = directives ($base, @directive);
my $out = new IO::File ">$base.y"
or die;
@@ -267,18 +267,18 @@ sub calc_input ($$)
}
##################################################################
-=item C<calc_grammar ($base, $max, @directives)>
+=item C<calc_grammar ($base, $max, @directive)>
Generate a Bison file F<$base.y> for a calculator parser in C. Pass
-the additional Bison C<@directives>. C<$max> is ignored, but left to
+the additional Bison C<@directive>. C<$max> is ignored, but left to
have the same interface as C<triangular_grammar>.
=cut
sub calc_grammar ($$$)
{
- my ($base, $max, @directives) = @_;
- my $directives = directives ($base, @directives);
+ my ($base, $max, @directive) = @_;
+ my $directives = directives ($base, @directive);
my $out = new IO::File ">$base.y"
or die;
@@ -477,32 +477,32 @@ EOF
##################################################################
-=item C<variant_grammar ($base, $max, @directives)>
+=item C<variant_grammar ($base, $max, @directive)>
Generate a Bison file F<$base.y> that uses, or not, the Boost.Variants
-depending on the C<@directives>.
+depending on the C<@directive>.
=cut
sub variant_grammar ($$$)
{
- my ($base, $max, @directives) = @_;
- my $directives = directives ($base, @directives);
- my $variant = grep { '%variant' } @directives;
+ my ($base, $max, @directive) = @_;
+ my $directives = directives ($base, @directive);
+ my $variant = grep { $_ eq '%variant' } @directive;
my $out = new IO::File ">$base.y"
or die;
print $out <<EOF;
-%debug
%language "C++"
%defines
+$directives
-%code requires // code for the .hh file
+%code requires // variant.h
{
#include <string>
}
-%code // code for the .cc file
+%code // variant.c
{
#include <algorithm>
#include <iostream>
@@ -612,7 +612,9 @@ yy::parser::error(const yy::parser::location_type& yylloc,
int main(int argc, char *argv[])
{
yy::parser p;
+#if YYDEBUG
p.set_debug_level(!!getenv("YYDEBUG"));
+#endif
p.parse();
return 0;
}
@@ -647,9 +649,9 @@ sub compile ($)
Generate benches for C<$gram>. C<$gram> should be C<calc> or
C<triangle>. C<%bench> is a hash of the form:
- $name => @directives
+ $name => @directive
-where C<$name> is the name of the bench, and C<@directives> are the
+where C<$name> is the name of the bench, and C<@directive> are the
Bison directive to use for this bench. All the benches are compared
against each other, repeated 50 times.
@@ -671,6 +673,7 @@ sub bench_grammar ($%)
# Call the Bison input file generator.
my $generator = "$gram" . "_grammar";
&$generator ($name, 200, @$directives);
+ # Compile the executable.
compile ($name);
$bench{$name} = "system ('./$name');";
chop($size{$name} = `wc -c <$name`);
@@ -732,8 +735,10 @@ sub bench_variant_parser ()
bench_grammar
('variant',
(
- "union" => [],
- "variant" => ['%variant'],
+ "union" => [],
+ "variant" => ['%variant'],
+ "union-debug" => ['%debug'],
+ "variant-debug" => ['%debug', '%variant'],
)
);
}