]> git.saurik.com Git - bison.git/blame_incremental - etc/bench.pl.in
b4_args is more general than only C++.
[bison.git] / etc / bench.pl.in
... / ...
CommitLineData
1#! /usr/bin/perl -w
2
3# Copyright (C) 2006, 2008 Free Software Foundation, Inc.
4#
5# This file is part of Bison, the GNU Compiler Compiler.
6#
7# This program is free software: you can redistribute it and/or modify
8# it under the terms of the GNU General Public License as published by
9# the Free Software Foundation, either version 3 of the License, or
10# (at your option) any later version.
11#
12# This program is distributed in the hope that it will be useful,
13# but WITHOUT ANY WARRANTY; without even the implied warranty of
14# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15# GNU General Public License for more details.
16#
17# You should have received a copy of the GNU General Public License
18# along with this program. If not, see <http://www.gnu.org/licenses/>.
19
20=head1 NAME
21
22bench.pl - bench marks for Bison parsers.
23
24=head1 SYNOPSIS
25
26 ./bench.pl [OPTIONS]... DIRECTIVES
27
28=head1 DIRECTIVES
29
30Specify the set of benches to run. The following grammar defines the
31I<directives>:
32
33 directives ::=
34 directives | directives -- Alternation
35 | directives & directives -- Concatenation
36 | [ directives> ] -- Optional
37 | ( directives> ) -- Parentheses
38 | #d NAME[=VALUE] -- %code { #define NAME [VALUE] }
39 | %d NAME[=VALUE] -- %define NAME ["VALUE"]
40 | %s skeleton -- %skeleton "skeleton"
41 | directive
42
43Parentheses only group to override precedence. For instance:
44
45 [ %debug ] & [ %error-verbose ] & [ %define variant ]
46
47will generate eight different cases.
48
49=head1 OPTIONS
50
51=over 4
52
53=item B<-b>, B<--bench>
54
55Predefined benches, that is, combimation between a grammar and a I<directives>
56request.
57
58=over 4
59
60=item I<fusion>
61
62Test F<lalr1.cc> with three stacks against F<lalr1-fusion.cc> which
63uses a single one.
64
65=item I<push>
66
67Test the push parser vs. the pull interface. Use the C parser.
68
69=item I<variant>
70
71Test the use of variants instead of union in the C++ parser.
72
73=back
74
75=item B<-c>, B<--cflags>=I<flags>
76
77Flags to pass to the C or C++ compiler. Defaults to -O2.
78
79=item B<-d>, B<--directive>=I<directives>
80
81Add a set of Bison directives to bench against each other.
82
83=item B<-g>, B<--grammar>=I<grammar>
84
85Select the base I<grammar> to use. Defaults to I<calc>.
86
87=over 4
88
89=item I<calc>
90
91Traditional calculator.
92
93=item I<list>
94
95C++ grammar that uses std::string and std::list. Can be used with
96or without %define variant.
97
98=item I<triangular>
99
100Artificial grammar with very long rules.
101
102=back
103
104=item B<-h>, B<--help>
105
106Display this message and exit succesfully. The more verbose, the more
107details.
108
109=item B<-i>, B<--iterations>=I<integer>
110
111Say how many times a single test of the bench must be run. If
112negative, specify the minimum number of CPU seconds to run. Defaults
113to -1.
114
115=item B<-q>, B<--quiet>
116
117Decrease the verbosity level (defaults to 1).
118
119=item B<-v>, B<--verbose>
120
121Raise the verbosity level (defaults to 1).
122
123=back
124
125=cut
126
127use strict;
128use IO::File;
129
130##################################################################
131
132=head1 VARIABLES
133
134=over 4
135
136=item C<@bench>
137
138The list of benches to run.
139
140=item C<$bison>
141
142The Bison program to use to compile the grammar.
143
144=item C<$cc>
145
146The C compiler.
147
148=item C<$cxx>
149
150The C++ compiler.
151
152=item C<$cflags>
153
154Compiler flags (C or C++).
155
156=item C<@directive>
157
158A list of directive sets to measure against each other.
159
160=item C<$iterations>
161
162The number of times the parser is run for a bench.
163
164=item C<$verbose>
165
166Verbosity level.
167
168=back
169
170=cut
171
172my $bench;
173my $bison = $ENV{'BISON'} || '@abs_top_builddir@/tests/bison';
174my $cc = $ENV{'CC'} || 'gcc';
175my $cxx = $ENV{'CXX'} || 'g++';
176my $cflags = '-O2';
177my @directive = ();
178my $grammar = 'calc';
179my $iterations = -1;
180my $verbose = 1;
181
182=head1 FUNCTIONS
183
184=over 4
185
186=item C<verbose($level, $message)>
187
188Report the C<$message> is C<$level> E<lt>= C<$verbose>.
189
190=cut
191
192sub verbose($$)
193{
194 my ($level, $message) = @_;
195 print STDERR $message
196 if $level <= $verbose;
197}
198
199
200######################################################################
201
202=item C<directives($bench, @directive)>
203
204Format the list of directives for Bison for bench named C<$bench>.
205
206=cut
207
208sub directives($@)
209{
210 my ($bench, @directive) = @_;
211 my $res = "/* Directives for bench `$bench'. */\n";
212 $res .= join ("\n", @directive) . "\n";
213 $res .= "/* End of directives for bench `$bench'. */\n";
214 return $res;
215}
216
217######################################################################
218
219=item C<generate_grammar_triangular ($base, $max, @directive)>
220
221Create a large triangular grammar which looks like :
222
223 input:
224 exp { if ($1 != 0) abort (); $$ = $1; }
225 | input exp { if ($2 != $1 + 1) abort (); $$ = $2; }
226 ;
227
228 exp:
229 END { $$ = 0; }
230 | "1" END { $$ = 1; }
231 | "1" "2" END { $$ = 2; }
232 | "1" "2" "3" END { $$ = 3; }
233 | "1" "2" "3" "4" END { $$ = 4; }
234 | "1" "2" "3" "4" "5" END { $$ = 5; }
235 ;
236
237C<$base> is the base name for the file to create (F<$base.y>).
238C<$max> is the number of such rules (here, 5). You may pass
239additional Bison C<@directive>.
240
241The created parser is self contained: it includes its scanner, and
242source of input.
243=cut
244
245sub generate_grammar_triangular ($$@)
246{
247 my ($base, $max, @directive) = @_;
248 my $directives = directives ($base, @directive);
249
250 my $out = new IO::File ">$base.y"
251 or die;
252 print $out <<EOF;
253%error-verbose
254%debug
255%{
256#include <stdio.h>
257#include <stdlib.h>
258
259static int yylex (void);
260static void yyerror (const char *msg);
261%}
262$directives
263%union
264{
265 int val;
266};
267
268%token END "end"
269%type <val> exp input
270EOF
271
272 for my $size (1 .. $max)
273 {
274 print $out "%token t$size $size \"$size\"\n";
275 };
276
277print $out <<EOF;
278%%
279input:
280 exp { if (\$1 != 0) abort (); \$\$ = \$1; }
281| input exp { if (\$2 != \$1 + 1) abort (); \$\$ = \$2; }
282;
283
284exp:
285 END
286 { \$\$ = 0; }
287EOF
288
289for my $size (1 .. $max)
290 {
291 use Text::Wrap;
292 print $out wrap ("| ", " ",
293 (map { "\"$_\"" } (1 .. $size)),
294 " END \n"),
295 " { \$\$ = $size; }\n";
296 };
297print $out ";\n";
298
299print $out <<EOF;
300%%
301static int
302yylex (void)
303{
304 static int inner = 1;
305 static int outer = 0;
306 if (outer > $max)
307 return 0;
308 else if (inner > outer)
309 {
310 inner = 1;
311 ++outer;
312 return END;
313 }
314 return inner++;
315}
316
317static void
318yyerror (const char *msg)
319{
320 fprintf (stderr, "%s\\n", msg);
321}
322
323int
324main (void)
325{
326 yydebug = !!getenv ("YYDEBUG");
327 return yyparse ();
328}
329EOF
330}
331
332##################################################################
333
334=item C<calc_input ($base, $max)>
335
336Generate the input file F<$base.input> for the calc parser. The input
337is composed of two expressions. The first one is using left recursion
338only and consumes no stack. The second one requires a deep stack.
339These two expressions are repeated C<$max> times in the output file.
340
341=cut
342
343sub calc_input ($$)
344{
345 my ($base, $max) = @_;
346 my $out = new IO::File ">$base.input"
347 or die;
348 foreach (1 .. $max)
349 {
350 print $out "0+1+2+3+4+5+6+7+8+9+10+11+12+13+14+15+16+17+18+19+20+21+22+23+24+25+26+27+28+29+30+31+32+33+34+35+36+37+38+39+40+41+42+43+44+45+46+47+48+49+50+51+52+53+54+55+56+57+58+59+60+61+62+63+64+65+66+67+68+69+70+71+72+73+74+75+76+77+78+79+80+81+82+83+84+85+86+87+88+89+90+91+92+93+94+95+96+97+98+99\n";
351 print $out "1+1*(2+2*(3+3*(4+4*(5+5*(6+6*(7+7*(8+8*(9+9*(10+10*(11+11*(12+12*(13+13*(14+14*(15+15*(16+16*(17+17*(18+18*(19+19*(20+20*(21+21*(22+22*(23+23*(24+24*(25+25*(26+26*(27+27*(28+28*(29+29*(30+30*(31+31*(32+32*(33+33*(34+34*(35+35*(36+36*(37+37*(38+38*(39+39*(40+40*(41+41*(42+42*(43+43*(44+44*(45+45*(46+46*(47+47*(48+48*(49+49*(50+50*(51+51*(52+52*(53+53*(54+54*(55+55*(56+56*(57+57*(58+58*(59+59*(60+60*(61+61*(62+62*(63+63*(64+64*(65+65*(66+66*(67+67*(68+68*(69+69*(70+70*(71+71*(72+72*(73+73*(74+74*(75+75*(76+76*(77+77*(78+78*(79+79*(80+80*(81+81*(82+82*(83+83*(84+84*(85+85*(86+86*(87+87*(88+88*(89+89*(90+90*(91+91*(92+92*(93+93*(94+94*(95+95*(96+96*(97+97*(98+98*(99+99*(100+100*(101+101*(102+102*(103+103*(104+104*(105+105*(106+106*(107+107*(108+108*(109+109*(110+110*(111+111*(112+112*(113+113*(114+114*(115+115*(116+116*(117+117*(118+118*(119+119*(120+120*(121+121*(122+122*(123+123*(124+124*(125+125*(126+126*(127+127*(128+128*(129+129*(130+130*(131+131*(132+132*(133+133*(134+134*(135+135*(136+136*(137+137*(138+138*(139+139*(140+140*(141+141*(142+142*(143+143*(144+144*(145+145*(146+146*(147+147*(148+148*(149+149*(150+150*(151+151*(152+152*(153+153*(154+154*(155+155*(156+156*(157+157*(158+158*(159+159*(160+160*(161+161*(162+162*(163+163*(164+164*(165+165*(166+166*(167+167*(168+168*(169+169*(170+170*(171+171*(172+172*(173+173*(174+174*(175+175*(176+176*(177+177*(178+178*(179+179*(180+180*(181+181*(182+182*(183+183*(184+184*(185+185*(186+186*(187+187*(188+188*(189+189*(190+190*(191+191*(192+192*(193+193*(194+194*(195+195*(196+196*(197+197*(198+198*(199+199*(200+200*(201+201*(202+202*(203+203*(204+204*(205+205*(206+206*(207+207*(208+208*(209+209*(210+210*(211+211*(212+212*(213+213*(214+214*(215+215*(216+216*(217+217*(218+218*(219+219*(220+220*(221+221*(222+222*(223+223*(224+224*(225+225*(226+226*(227+227*(228+228*(229+229*(230+230*(231+231*(232+232*(233+233*(234+234*(235+235*(236+236*(237+237*(238+238*(239+239*(240+240*(241+241*(242+242*(243+243*(244+244*(245+245*(246+246*(247+247*(248+248*(249+249*(250+250*(251+251*(252+252*(253+253*(254+254*(255+255*(256+256*(257+257*(258+258*(259+259*(260+260*(261+261*(262+262*(263+263*(264+264*(265+265*(266+266*(267+267*(268+268*(269+269*(270+270*(271+271*(272+272*(273+273*(274+274*(275+275*(276+276*(277+277*(278+278*(279+279*(280+280*(281+281*(282+282*(283+283*(284+284*(285+285*(286+286*(287+287*(288+288*(289+289*(290+290*(291+291*(292+292*(293+293*(294+294*(295+295*(296+296*(297+297*(298+298*(299+299*(300+300*(301+301*(302+302*(303+303*(304+304*(305+305*(306+306*(307+307*(308+308*(309+309*(310+310*(311+311*(312+312*(313+313*(314+314*(315+315*(316+316*(317+317*(318+318*(319+319*(320+320*(321+321*(322+322*(323+323*(324+324*(325+325*(326+326*(327+327*(328+328*(329+329*(330+330*(331+331*(332+332*(333+333*(334+334*(335+335*(336+336*(337+337*(338+338*(339+339*(340+340*(341+341*(342+342*(343+343*(344+344*(345+345*(346+346*(347+347*(348+348*(349+349*(350+350*(351+351*(352+352*(353+353*(354+354*(355+355*(356+356*(357+357*(358+358*(359+359*(360+360*(361+361*(362+362*(363+363*(364+364*(365+365*(366+366*(367+367*(368+368*(369+369*(370+370*(371+371*(372+372*(373+373*(374+374*(375+375*(376+376*(377+377*(378+378*(379+379*(380+380*(381+381*(382+382*(383+383*(384+384*(385+385*(386+386*(387+387*(388+388*(389+389*(390+390*(391+391*(392+392*(393+393*(394+394*(395+395*(396+396*(397+397*(398+398*(399+399*(400+400*(401+401*(402+402*(403+403*(404+404*(405+405*(406+406*(407+407*(408+408*(409+409*(410+410*(411+411*(412+412*(413+413*(414+414*(415+415*(416+416*(417+417*(418+418*(419+419*(420+420*(421+421*(422+422*(423+423*(424+424*(425+425*(426+426*(427+427*(428+428*(429+429*(430+430*(431+431*(432+432*(433+433*(434+434*(435+435*(436+436*(437+437*(438+438*(439+439*(440+440*(441+441*(442+442*(443+443*(444+444*(445+445*(446+446*(447+447*(448+448*(449+449*(450+450*(451+451*(452+452*(453+453*(454+454*(455+455*(456+456*(457+457*(458+458*(459+459*(460+460*(461+461*(462+462*(463+463*(464+464*(465+465*(466+466*(467+467*(468+468*(469+469*(470+470*(471+471*(472+472*(473+473*(474+474*(475+475*(476+476*(477+477*(478+478*(479+479*(480+480*(481+481*(482+482*(483+483*(484+484*(485+485*(486+486*(487+487*(488+488*(489+489*(490+490*(491+491*(492+492*(493+493*(494+494*(495+495*(496+496*(497+497*(498+498*(499+499*(500+500*(501+501*(502+502*(503+503*(504+504*(505+505*(506+506*(507+507*(508+508*(509+509*(510+510*(511+511*(512+512*(513+513*(514+514*(515+515*(516+516*(517+517*(518+518*(519+519*(520+520*(521+521*(522+522*(523+523*(524+524*(525+525*(526+526*(527+527*(528+528*(529+529*(530+530*(531+531*(532+532*(533+533*(534+534*(535+535*(536+536*(537+537*(538+538*(539+539*(540+540*(541+541*(542+542*(543+543*(544+544*(545+545*(546+546*(547+547*(548+548*(549+549*(550+550*(551+551*(552+552*(553+553*(554+554*(555+555*(556+556*(557+557*(558+558*(559+559*(560+560*(561+561*(562+562*(563+563*(564+564*(565+565*(566+566*(567+567*(568+568*(569+569*(570+570*(571+571*(572+572*(573+573*(574+574*(575+575*(576+576*(577+577*(578+578*(579+579*(580+580*(581+581*(582+582*(583+583*(584+584*(585+585*(586+586*(587+587*(588+588*(589+589*(590+590*(591+591*(592+592*(593+593*(594+594*(595+595*(596+596*(597+597*(598+598*(599+599*(600+600*(601+601*(602+602*(603+603*(604+604*(605+605*(606+606*(607+607*(608+608*(609+609*(610+610*(611+611*(612+612*(613+613*(614+614*(615+615*(616+616*(617+617*(618+618*(619+619*(620+620*(621+621*(622+622*(623+623*(624+624*(625+625*(626+626*(627+627*(628+628*(629+629*(630+630*(631+631*(632+632*(633+633*(634+634*(635+635*(636+636*(637+637*(638+638*(639+639*(640+640*(641+641*(642+642*(643+643*(644+644*(645+645*(646+646*(647+647*(648+648*(649+649*(650+650*(651+651*(652+652*(653+653*(654+654*(655+655*(656+656*(657+657*(658+658*(659+659*(660+660*(661+661*(662+662*(663+663*(664+664*(665+665*(666+666*(667+667*(668+668*(669+669*(670+670*(671+671*(672+672*(673+673*(674+674*(675+675*(676+676*(677+677*(678+678*(679+679*(680+680*(681+681*(682+682*(683+683*(684+684*(685+685*(686+686*(687+687*(688+688*(689+689*(690+690*(691+691*(692+692*(693+693*(694+694*(695+695*(696+696*(697+697*(698+698*(699+699*(700+700*(701+701*(702+702*(703+703*(704+704*(705+705*(706+706*(707+707*(708+708*(709+709*(710+710*(711+711*(712+712*(713+713*(714+714*(715+715*(716+716*(717+717*(718+718*(719+719*(720+720*(721+721*(722+722*(723+723*(724+724*(725+725*(726+726*(727+727*(728+728*(729+729*(730+730*(731+731*(732+732*(733+733*(734+734*(735+735*(736+736*(737+737*(738+738*(739+739*(740+740*(741+741*(742+742*(743+743*(744+744*(745+745*(746+746*(747+747*(748+748*(749+749*(750+750*(751+751*(752+752*(753+753*(754+754*(755+755*(756+756*(757+757*(758+758*(759+759*(760+760*(761+761*(762+762*(763+763*(764+764*(765+765*(766+766*(767+767*(768+768*(769+769*(770+770*(771+771*(772+772*(773+773*(774+774*(775+775*(776+776*(777+777*(778+778*(779+779*(780+780*(781+781*(782+782*(783+783*(784+784*(785+785*(786+786*(787+787*(788+788*(789+789*(790+790*(791+791*(792+792*(793+793*(794+794*(795+795*(796+796*(797+797*(798+798*(799+799*(800+800*(801+801*(802+802*(803+803*(804+804*(805+805*(806+806*(807+807*(808+808*(809+809*(810+810*(811+811*(812+812*(813+813*(814+814*(815+815*(816+816*(817+817*(818+818*(819+819*(820+820*(821+821*(822+822*(823+823*(824+824*(825+825*(826+826*(827+827*(828+828*(829+829*(830+830*(831+831*(832+832*(833+833*(834+834*(835+835*(836+836*(837+837*(838+838*(839+839*(840+840*(841+841*(842+842*(843+843*(844+844*(845+845*(846+846*(847+847*(848+848*(849+849*(850+850*(851+851*(852+852*(853+853*(854+854*(855+855*(856+856*(857+857*(858+858*(859+859*(860+860*(861+861*(862+862*(863+863*(864+864*(865+865*(866+866*(867+867*(868+868*(869+869*(870+870*(871+871*(872+872*(873+873*(874+874*(875+875*(876+876*(877+877*(878+878*(879+879*(880+880*(881+881*(882+882*(883+883*(884+884*(885+885*(886+886*(887+887*(888+888*(889+889*(890+890*(891+891*(892+892*(893+893*(894+894*(895+895*(896+896*(897+897*(898+898*(899+899*(900+900*(901+901*(902+902*(903+903*(904+904*(905+905*(906+906*(907+907*(908+908*(909+909*(910+910*(911+911*(912+912*(913+913*(914+914*(915+915*(916+916*(917+917*(918+918*(919+919*(920+920*(921+921*(922+922*(923+923*(924+924*(925+925*(926+926*(927+927*(928+928*(929+929*(930+930*(931+931*(932+932*(933+933*(934+934*(935+935*(936+936*(937+937*(938+938*(939+939*(940+940*(941+941*(942+942*(943+943*(944+944*(945+945*(946+946*(947+947*(948+948*(949+949*(950+950*(951+951*(952+952*(953+953*(954+954*(955+955*(956+956*(957+957*(958+958*(959+959*(960+960*(961+961*(962+962*(963+963*(964+964*(965+965*(966+966*(967+967*(968+968*(969+969*(970+970*(971+971*(972+972*(973+973*(974+974*(975+975*(976+976*(977+977*(978+978*(979+979*(980+980*(981+981*(982+982*(983+983*(984+984*(985+985*(986+986*(987+987*(988+988*(989+989*(990+990*(991+991*(992+992*(993+993*(994+994*(995+995*(996+996*(997+997*(998+998*(999+999*(1000+1000*(1001))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))\n";
352 }
353}
354
355##################################################################
356
357=item C<generate_grammar_calc ($base, $max, @directive)>
358
359Generate a Bison file F<$base.y> for a calculator parser in C. Pass
360the additional Bison C<@directive>. C<$max> is ignored, but left to
361have the same interface as C<triangular_grammar>.
362
363=cut
364
365sub generate_grammar_calc ($$@)
366{
367 my ($base, $max, @directive) = @_;
368 my $directives = directives ($base, @directive);
369
370 # Putting this request here is stupid, since the input will be
371 # generated each time we generate a grammar.
372 calc_input ('calc', 200);
373
374 my $out = new IO::File ">$base.y"
375 or die;
376 print $out <<EOF;
377%{
378#include <stdio.h>
379
380#include <stdlib.h>
381#include <string.h>
382#include <ctype.h>
383#define USE(Var)
384
385/* Exercise pre-prologue dependency to %union. */
386typedef int semantic_value;
387
388static semantic_value global_result = 0;
389static int global_count = 0;
390%}
391
392$directives
393%error-verbose
394/* Exercise %union. */
395%union
396{
397 semantic_value ival;
398};
399
400%{
401static int power (int base, int exponent);
402/* yyerror receives the location if:
403 - %location & %pure & %glr
404 - %location & %pure & %yacc & %parse-param. */
405static void yyerror (const char *s);
406#if YYPURE
407static int yylex (YYSTYPE* yylvalp);
408#else
409static int yylex (void);
410#endif
411%}
412
413/* Bison Declarations */
414%token CALC_EOF 0 "end of input"
415%token <ival> NUM "number"
416%type <ival> exp
417
418%nonassoc '=' /* comparison */
419%left '-' '+'
420%left '*' '/'
421%left NEG /* negation--unary minus */
422%right '^' /* exponentiation */
423
424/* Grammar follows */
425%%
426input:
427 line
428| input line
429;
430
431line:
432 '\\n'
433| exp '\\n' { USE (\$1); }
434;
435
436exp:
437 NUM { \$\$ = \$1; }
438| exp '=' exp
439 {
440 if (\$1 != \$3)
441 fprintf (stderr, "calc: error: %d != %d\\n", \$1, \$3);
442 \$\$ = \$1;
443 }
444| exp '+' exp { \$\$ = \$1 + \$3; }
445| exp '-' exp { \$\$ = \$1 - \$3; }
446| exp '*' exp { \$\$ = \$1 * \$3; }
447| exp '/' exp { \$\$ = \$1 / \$3; }
448| '-' exp %prec NEG { \$\$ = -\$2; }
449| exp '^' exp { \$\$ = power (\$1, \$3); }
450| '(' exp ')' { \$\$ = \$2; }
451| '(' error ')' { \$\$ = 1111; }
452| '!' { \$\$ = 0; YYERROR; }
453| '-' error { \$\$ = 0; YYERROR; }
454;
455%%
456/* The input. */
457static FILE *input;
458
459static void
460yyerror (const char *s)
461{
462 fprintf (stderr, "%s\\n", s);
463}
464
465static int
466get_char (void)
467{
468 return getc (input);
469}
470
471
472static void
473unget_char ( int c)
474{
475 ungetc (c, input);
476}
477
478static int
479read_signed_integer (void)
480{
481 int c = get_char ();
482 int sign = 1;
483 int n = 0;
484
485 if (c == '-')
486 {
487 c = get_char ();
488 sign = -1;
489 }
490
491 while (isdigit (c))
492 {
493 n = 10 * n + (c - '0');
494 c = get_char ();
495 }
496
497 unget_char (c);
498
499 return sign * n;
500}
501
502static int
503#if YYPURE
504# define yylval (*yylvalp)
505yylex (YYSTYPE* yylvalp)
506#else
507yylex (void)
508#endif
509{
510 int c;
511
512 /* Skip white space. */
513 while ((c = get_char ()) == ' ' || c == '\t')
514 continue;
515
516 /* process numbers */
517 if (c == '.' || isdigit (c))
518 {
519 unget_char ( c);
520 yylval.ival = read_signed_integer ();
521 return NUM;
522 }
523
524 /* Return end-of-file. */
525 if (c == EOF)
526 return CALC_EOF;
527
528 /* Return single chars. */
529 return c;
530}
531
532static int
533power (int base, int exponent)
534{
535 int res = 1;
536 if (exponent < 0)
537 exit (3);
538 for (/* Niente */; exponent; --exponent)
539 res *= base;
540 return res;
541}
542
543
544int
545main (int argc, const char **argv)
546{
547 semantic_value result = 0;
548 int count = 0;
549 int status;
550
551 input = fopen ("calc.input", "r");
552 if (!input)
553 {
554 perror ("calc.input");
555 return 3;
556 }
557
558 status = yyparse ();
559 if (global_result != result)
560 abort ();
561 if (global_count != count)
562 abort ();
563
564 return status;
565}
566EOF
567}
568
569##################################################################
570
571=item C<generate_grammar_list ($base, $max, @directive)>
572
573Generate a Bison file F<$base.y> for a C++ parser that uses C++
574objects (std::string, std::list). Tailored for using %define variant.
575
576=cut
577
578sub generate_grammar_list ($$@)
579{
580 my ($base, $max, @directive) = @_;
581 my $directives = directives ($base, @directive);
582 my $variant = grep { /%define "?variant"?/ } @directive;
583 my $lex_symbol = grep { /%define "?lex_symbol"?/ } @directive;
584 my $out = new IO::File ">$base.y"
585 or die;
586 print $out <<EOF;
587%language "C++"
588%defines
589%locations
590$directives
591
592%code requires // *.h
593{
594#include <string>
595}
596
597%code // *.c
598{
599#include <algorithm>
600#include <iostream>
601#include <sstream>
602
603#define STAGE_MAX ($max * 10) // max = $max
604
605#define USE_LEX_SYMBOL $lex_symbol
606#define USE_VARIANTS $variant
607
608 // Prototype of the yylex function providing subsequent tokens.
609 static
610#if USE_LEX_SYMBOL
611 yy::parser::symbol_type yylex();
612#else
613 yy::parser::token_type yylex(yy::parser::semantic_type* yylval,
614 yy::parser::location_type* yylloc);
615#endif
616
617 // Conversion to string.
618 template <typename T>
619 inline
620 std::string
621 string_cast (const T& t)
622 {
623 std::ostringstream o;
624 o << t;
625 return o.str ();
626 }
627}
628
629%token END_OF_FILE 0
630EOF
631
632 if ($variant)
633 {
634 print $out <<'EOF';
635%token <std::string> TEXT
636%token <int> NUMBER
637%printer { std::cerr << "Number: " << $$; } <int>
638%printer { std::cerr << "Text: " << $$; } <std::string>
639%type <std::string> text result
640
641%%
642result:
643 text { /* Throw away the result. */ }
644;
645
646text:
647 /* nothing */ { /* This will generate an empty string */ }
648| text TEXT { std::swap ($$, $2); }
649| text NUMBER { $$ = string_cast($2); }
650;
651EOF
652 }
653 else
654 {
655 # Not using Bison variants.
656 print $out <<'EOF';
657%union {int ival; std::string* sval;}
658%token <sval> TEXT
659%token <ival> NUMBER
660%printer { std::cerr << "Number: " << $$; } <ival>
661%printer { std::cerr << "Text: " << *$$; } <sval>
662%type <sval> text result
663
664%%
665result:
666 text { delete $1; }
667;
668
669text:
670 /* nothing */ { $$ = new std::string; }
671| text TEXT { delete $1; $$ = $2; }
672| text NUMBER { delete $1; $$ = new std::string (string_cast ($2)); }
673;
674EOF
675 }
676
677 print $out <<'EOF';
678%%
679#
680
681static
682#if USE_LEX_SYMBOL
683yy::parser::symbol_type yylex()
684#else
685yy::parser::token_type yylex(yy::parser::semantic_type* yylval,
686 yy::parser::location_type* yylloc)
687#endif
688{
689 typedef yy::parser::location_type location_type;
690 typedef yy::parser::token token;
691 static int stage = -1;
692 ++stage;
693 if (stage == STAGE_MAX)
694 {
695#if USE_LEX_SYMBOL
696 return yy::parser::make_END_OF_FILE (yy::location());
697#else
698 *yylloc = location_type ();
699 return token::END_OF_FILE;
700#endif
701 }
702 else if (stage % 2)
703 {
704#if USE_LEX_SYMBOL
705 return yy::parser::make_NUMBER (stage, yy::location());
706#else
707# if defined ONE_STAGE_BUILD
708 yylval->build(stage);
709# elif USE_VARIANTS
710 yylval->build<int>() = stage;
711# else
712 yylval->ival = stage;
713# endif
714 *yylloc = location_type ();
715 return token::NUMBER;
716#endif
717 }
718 else
719 {
720#if USE_LEX_SYMBOL
721 return yy::parser::make_TEXT ("A string.", yy::location());
722#else
723# if defined ONE_STAGE_BUILD
724 yylval->build(std::string("A string."));
725# elif USE_VARIANTS
726 yylval->build<std::string>() = std::string("A string.");
727# else
728 yylval->sval = new std::string("A string.");
729# endif
730 *yylloc = location_type ();
731 return token::TEXT;
732#endif
733 }
734 abort();
735}
736
737// Mandatory error function
738void
739yy::parser::error(const yy::parser::location_type& yylloc,
740 const std::string& message)
741{
742 std::cerr << yylloc << ": " << message << std::endl;
743}
744
745int main(int argc, char *argv[])
746{
747 yy::parser p;
748#if YYDEBUG
749 p.set_debug_level(!!getenv("YYDEBUG"));
750#endif
751 p.parse();
752 return 0;
753}
754EOF
755}
756
757##################################################################
758
759=item C<generate_grammar ($name, $base, @directive)>
760
761Generate F<$base.y> by calling C<&generate_grammar_$name>.
762
763=cut
764
765sub generate_grammar ($$@)
766{
767 my ($name, $base, @directive) = @_;
768 verbose 3, "Generating $base.y\n";
769 my %generator =
770 (
771 "calc" => \&generate_grammar_calc,
772 "list" => \&generate_grammar_list,
773 "triangular" => \&generate_grammar_triangular,
774 );
775 &{$generator{$name}}($base, 200, @directive);
776}
777
778##################################################################
779
780=item C<run ($command)>
781
782Run, possibly verbosely, the shell C<$command>.
783
784=cut
785
786sub run ($)
787{
788 my ($command) = @_;
789 verbose 3, "$command\n";
790 system ("$command") == 0
791 or die "$command failed";
792}
793
794##################################################################
795
796=item C<compile ($base)>
797
798Compile C<$base.y> to an executable C, Using the C or C++ compiler
799depending on the %language specification in C<$base.y>.
800
801=cut
802
803sub compile ($)
804{
805 my ($base) = @_;
806 my $language = `sed -ne '/%language "\\(.*\\)"/{s//\\1/;p;q;}' $base.y`;
807 chomp $language;
808
809 my $compiler = $language eq 'C++' ? $cxx : $cc;
810
811 run "$bison $base.y -o $base.c";
812 run "$compiler -o $base $cflags $base.c";
813}
814
815######################################################################
816
817=item C<bench ($grammar, @token)>
818
819Generate benches for the C<$grammar> and the directive specification
820given in the list of C<@token>.
821
822=cut
823
824sub bench ($@)
825{
826 my ($grammar, @token) = @_;
827 use Benchmark qw (:all :hireswallclock);
828
829 my @directive = parse (@token);
830
831 # Set up the benches as expected by timethese.
832 my %bench;
833 # A counter of directive sets.
834 my $count = 1;
835 for my $d (@directive)
836 {
837 $bench{$count} = $d;
838 printf " %2d. %s\n", $count, join (' ', split ("\n", $d));
839 $count++;
840 };
841
842 # For each bench, capture the size.
843 my %size;
844
845 while (my ($name, $directives) = each %bench)
846 {
847 generate_grammar ($grammar, $name, $directives);
848 # Compile the executable.
849 compile ($name);
850 $bench{$name} = "system ('./$name');";
851 chop($size{$name} = `wc -c <$name`);
852 }
853
854 # Run the benches.
855 #
856 # STYLE can be any of 'all', 'none', 'noc', 'nop' or 'auto'. 'all'
857 # shows each of the 5 times available ('wallclock' time, user time,
858 # system time, user time of children, and system time of
859 # children). 'noc' shows all except the two children times. 'nop'
860 # shows only wallclock and the two children times. 'auto' (the
861 # default) will act as 'all' unless the children times are both
862 # zero, in which case it acts as 'noc'. 'none' prevents output.
863 verbose 3, "Running the benches for $grammar\n";
864 my $res = timethese ($iterations, \%bench, 'nop');
865
866 # Output the speed result.
867 cmpthese ($res, 'nop');
868
869 # Display the sizes.
870 print "Sizes (decreasing):\n";
871 my $width = 10;
872 for my $bench (keys %size)
873 {
874 $width = length $bench
875 if $width < length $bench;
876 }
877 # Benches sorted by decreasing size.
878 my @benches_per_size = sort {$size{$b} <=> $size{$a}} keys %size;
879 for my $bench (@benches_per_size)
880 {
881 printf "%${width}s: %5.2fkB\n", $bench, $size{$bench} / 1024;
882 }
883}
884
885######################################################################
886
887=item C<bench_push_parser ()>
888
889Bench the C push parser against the pull parser, pure and impure
890interfaces.
891
892=cut
893
894sub bench_push_parser ()
895{
896 bench ('calc',
897 qw(
898 [ %d api.pure ]
899 &
900 [ %d api.push_pull=both ]
901 ));
902}
903
904######################################################################
905
906=item C<bench_variant_parser ()>
907
908Bench the C++ lalr1.cc parser using variants or %union.
909
910=cut
911
912sub bench_variant_parser ()
913{
914 bench ('list',
915 qw(
916 [
917 %d variant
918 &
919 [ #d ONE_STAGE_BUILD | %d lex_symbol ]
920 ]
921 )
922 );
923}
924
925######################################################################
926
927=item C<bench_fusion_parser ()>
928
929Bench the C++ lalr1.cc parser using Boost.Variants or %union.
930
931=cut
932
933sub bench_fusion_parser ()
934{
935 bench ('list',
936 qw(
937 %s lalr1-split.cc
938 |
939 %s lalr1.cc
940 )
941 );
942}
943
944############################################################################
945
946sub help ($)
947{
948 my ($verbose) = @_;
949 use Pod::Usage;
950 # See <URL:http://perldoc.perl.org/pod2man.html#NOTES>.
951 pod2usage( { -message => "Bench Bison parsers",
952 -exitval => 0,
953 -verbose => $verbose,
954 -output => \*STDOUT });
955}
956
957######################################################################
958
959# The end of the directives to parse.
960my $eod = "end of directives";
961# The list of tokens parsed by the following functions.
962my @token;
963
964# eat ($EXPECTED)
965# ---------------
966# Check that the current token is $EXPECTED, and move to the next.
967sub eat ($)
968{
969 my ($expected) = @_;
970 die "expected $expected, unexpected: $token[0] (@token)\n"
971 unless $token[0] eq $expected;
972 shift @token;
973}
974
975# Parse directive specifications:
976# expr: term (| term)*
977# term: fact (& fact)*
978# fact: ( expr ) | [ expr ] | dirs
979# dirs: %s SKELETON | #d NAME[=VALUE] | %d NAME[=VALUE] | directive
980sub parse (@)
981{
982 @token = (@_, $eod);
983 verbose 3, "Parsing: @token\n";
984 my @res = parse_expr ();
985 eat ($eod);
986 return @res;
987}
988
989sub parse_expr ()
990{
991 my @res = parse_term ();
992 while ($token[0] eq '|')
993 {
994 eat ('|');
995 # Alternation.
996 push @res, parse_term ();
997 }
998 return @res;
999}
1000
1001sub parse_term ()
1002{
1003 my @res = parse_fact ();
1004 while ($token[0] eq '&')
1005 {
1006 eat ('&');
1007 # Cartesian product.
1008 my @lhs = @res;
1009 @res = ();
1010 for my $rhs (parse_fact ())
1011 {
1012 for my $lhs (@lhs)
1013 {
1014 push @res, $lhs . ($lhs && $rhs ? "\n" : "") . $rhs;
1015 }
1016 }
1017 }
1018 return @res;
1019}
1020
1021sub parse_fact ()
1022{
1023 my @res;
1024 die "unexpected end of expression"
1025 unless defined $token[0];
1026
1027 if ($token[0] eq '(')
1028 {
1029 eat ('(');
1030 @res = parse_expr ();
1031 eat (')');
1032 }
1033 elsif ($token[0] eq '[')
1034 {
1035 eat ('[');
1036 @res = (parse_expr (), '');
1037 eat (']');
1038 }
1039 else
1040 {
1041 @res = parse_dirs ();
1042 }
1043 return @res;
1044}
1045
1046sub parse_dirs ()
1047{
1048 my @res;
1049 die "unexpected end of expression"
1050 unless defined $token[0];
1051
1052 if ($token[0] eq '#d')
1053 {
1054 eat ('#d');
1055 $token[0] =~ s/(.*?)=(.*)/$1 $2/;
1056 @res = ("%code {\n#define $token[0]\n}");
1057 shift @token;
1058 }
1059 elsif ($token[0] eq '%d')
1060 {
1061 shift @token;
1062 $token[0] =~ s/(.*?)=(.*)/$1 "$2"/;
1063 @res = ("%define $token[0]");
1064 shift @token;
1065 }
1066 elsif ($token[0] eq '%s')
1067 {
1068 shift @token;
1069 @res = ("%skeleton \"$token[0]\"");
1070 shift @token;
1071 }
1072 else
1073 {
1074 @res = $token[0];
1075 shift @token;
1076 }
1077
1078 return @res;
1079}
1080
1081######################################################################
1082
1083sub getopt ()
1084{
1085 use Getopt::Long;
1086 my %option = (
1087 "b|bench=s" => \$bench,
1088 "c|cflags=s" => \$cflags,
1089 "d|directive=s" => \@directive,
1090 "g|grammar=s" => \$grammar,
1091 "h|help" => sub { help ($verbose) },
1092 "i|iterations=i" => \$iterations,
1093 "q|quiet" => sub { --$verbose },
1094 "v|verbose" => sub { ++$verbose },
1095 );
1096 Getopt::Long::Configure ("bundling", "pass_through");
1097 GetOptions (%option)
1098 or exit 1;
1099}
1100
1101######################################################################
1102
1103getopt;
1104
1105# Create the directory we work in.
1106mkdir "benches" or die "cannot create benches"
1107 unless -d "benches";
1108my $count = 1;
1109++$count
1110 while -d "benches/$count";
1111my $dir = "benches/$count";
1112mkdir $dir
1113 or die "cannot create $dir";
1114chdir $dir
1115 or die "cannot chdir $dir";
1116
1117# The following message is tailored to please Emacs' compilation-mode.
1118verbose 1, "Entering directory `$dir'\n";
1119verbose 1, "Using bison=$bison.\n";
1120verbose 2, "Using cc=$cc.\n";
1121verbose 2, "Using cxx=$cxx.\n";
1122verbose 2, "Using cflags=$cflags.\n";
1123verbose 2, "Grammar: $grammar\n";
1124
1125
1126# Support -b: predefined benches.
1127my %bench =
1128 (
1129 "fusion" => \&bench_fusion_parser,
1130 "push" => \&bench_push_parser,
1131 "variant" => \&bench_variant_parser,
1132 );
1133
1134if (defined $bench)
1135{
1136 die "invalid argument for --bench: $bench"
1137 unless defined $bench{$bench};
1138 &{$bench{$bench}}();
1139 exit 0;
1140}
1141else
1142{
1143 # Launch the bench marking.
1144 bench ($grammar, @ARGV);
1145}
1146
1147### Setup "GNU" style for perl-mode and cperl-mode.
1148## Local Variables:
1149## perl-indent-level: 2
1150## perl-continued-statement-offset: 2
1151## perl-continued-brace-offset: 0
1152## perl-brace-offset: 0
1153## perl-brace-imaginary-offset: 0
1154## perl-label-offset: -2
1155## cperl-indent-level: 2
1156## cperl-brace-offset: 0
1157## cperl-continued-brace-offset: 0
1158## cperl-label-offset: -2
1159## cperl-extra-newline-before-brace: t
1160## cperl-merge-trailing-else: nil
1161## cperl-continued-statement-offset: 2
1162## End: