]> git.saurik.com Git - bison.git/blob - etc/bench.pl.in
bench.pl -d, --directive.
[bison.git] / etc / bench.pl.in
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
22 bench.pl - perform benches on Bison parsers.
23
24 =head1 SYNOPSIS
25
26 ./bench.pl [OPTIONS]... BENCHES
27
28 =head1 BENCHES
29
30 Specify the set of benches to run. I<bench-name> should be one of:
31
32 =over 4
33
34 =item I<fusion>
35
36 Test F<lalr1.cc> with three stacks against F<lalr1-fusion.cc> which
37 uses a single one.
38
39 =item I<push>
40
41 Test the push parser vs. the pull interface. Use the C parser.
42
43 =item I<variant>
44
45 Test the use of variants instead of union in the C++ parser.
46
47 =back
48
49 =head1 OPTIONS
50
51 =item B<-c>, B<--cflags>=I<flags>
52
53 Flags to pass to the C or C++ compiler. Defaults to -O2.
54
55 =item B<-d>, B<--directive>=I<directives>
56
57 Add a set of Bison directives to bench against each other.
58
59 =item B<-h>, B<--help>
60
61 Display this message and exit succesfully. The more verbose, the more
62 details.
63
64 =item B<-i>, B<--iterations>=I<integer>
65
66 Say how many times a single test of the bench must be run. If
67 negative, specify the minimum number of CPU seconds to run. Defaults
68 to -1.
69
70 =item B<-q>, B<--quiet>
71
72 Decrease the verbosity level (defaults to 1).
73
74 =item B<-v>, B<--verbose>
75
76 Raise the verbosity level (defaults to 1).
77
78 =back
79
80 =cut
81
82 use strict;
83 use IO::File;
84
85 ##################################################################
86
87 =head1 VARIABLES
88
89 =over 4
90
91 =item C<@bench>
92
93 The list of benches to run.
94
95 =item C<$bison>
96
97 The Bison program to use to compile the grammar.
98
99 =item C<$cc>
100
101 The C compiler.
102
103 =item C<$cxx>
104
105 The C++ compiler.
106
107 =item C<$cflags>
108
109 Compiler flags (C or C++).
110
111 =item C<@directive>
112
113 A list of directive sets to measure against each other.
114
115 =item C<$iterations>
116
117 The number of times the parser is run for a bench.
118
119 =item C<$verbose>
120
121 Verbosity level.
122
123 =back
124
125 =cut
126
127 my $bison = $ENV{'BISON'} || '@abs_top_builddir@/tests/bison';
128 my $cc = $ENV{'CC'} || 'gcc';
129 my $cxx = $ENV{'CXX'} || 'g++';
130 my $cflags = '-O2';
131 my @directive = ();
132 my $iterations = -1;
133 my $verbose = 1;
134
135 =head1 FUNCTIONS
136
137 =over 4
138
139 =item C<verbose($level, $message)>
140
141 Report the C<$message> is C<$level> E<lt>= C<$verbose>.
142
143 =cut
144
145 sub verbose($$)
146 {
147 my ($level, $message) = @_;
148 print STDERR $message
149 if $level <= $verbose;
150 }
151
152
153 ######################################################################
154
155 =item C<directives($bench, @directive)>
156
157 Format the list of directives for Bison for bench named C<$bench>.
158
159 =cut
160
161 sub directives($@)
162 {
163 my ($bench, @directive) = @_;
164 my $res = "/* Directives for bench `$bench'. */\n";
165 $res .= join ("\n", @directive) . "\n";
166 $res .= "/* End of directives for bench `$bench'. */\n";
167 return $res;
168 }
169
170 ######################################################################
171
172 =item C<generate_grammar_triangular ($base, $max, @directive)>
173
174 Create a large triangular grammar which looks like :
175
176 input:
177 exp { if ($1 != 0) abort (); $$ = $1; }
178 | input exp { if ($2 != $1 + 1) abort (); $$ = $2; }
179 ;
180
181 exp:
182 END { $$ = 0; }
183 | "1" END { $$ = 1; }
184 | "1" "2" END { $$ = 2; }
185 | "1" "2" "3" END { $$ = 3; }
186 | "1" "2" "3" "4" END { $$ = 4; }
187 | "1" "2" "3" "4" "5" END { $$ = 5; }
188 ;
189
190 C<$base> is the base name for the file to create (F<$base.y>).
191 C<$max> is the number of such rules (here, 5). You may pass
192 additional Bison C<@directive>.
193
194 The created parser is self contained: it includes its scanner, and
195 source of input.
196 =cut
197
198 sub generate_grammar_triangular ($$@)
199 {
200 my ($base, $max, @directive) = @_;
201 my $directives = directives ($base, @directive);
202
203 my $out = new IO::File ">$base.y"
204 or die;
205 print $out <<EOF;
206 %error-verbose
207 %debug
208 %{
209 #include <stdio.h>
210 #include <stdlib.h>
211
212 static int yylex (void);
213 static void yyerror (const char *msg);
214 %}
215 $directives
216 %union
217 {
218 int val;
219 };
220
221 %token END "end"
222 %type <val> exp input
223 EOF
224
225 for my $size (1 .. $max)
226 {
227 print $out "%token t$size $size \"$size\"\n";
228 };
229
230 print $out <<EOF;
231 %%
232 input:
233 exp { if (\$1 != 0) abort (); \$\$ = \$1; }
234 | input exp { if (\$2 != \$1 + 1) abort (); \$\$ = \$2; }
235 ;
236
237 exp:
238 END
239 { \$\$ = 0; }
240 EOF
241
242 for my $size (1 .. $max)
243 {
244 use Text::Wrap;
245 print $out wrap ("| ", " ",
246 (map { "\"$_\"" } (1 .. $size)),
247 " END \n"),
248 " { \$\$ = $size; }\n";
249 };
250 print $out ";\n";
251
252 print $out <<EOF;
253 %%
254 static int
255 yylex (void)
256 {
257 static int inner = 1;
258 static int outer = 0;
259 if (outer > $max)
260 return 0;
261 else if (inner > outer)
262 {
263 inner = 1;
264 ++outer;
265 return END;
266 }
267 return inner++;
268 }
269
270 static void
271 yyerror (const char *msg)
272 {
273 fprintf (stderr, "%s\\n", msg);
274 }
275
276 int
277 main (void)
278 {
279 yydebug = !!getenv ("YYDEBUG");
280 return yyparse ();
281 }
282 EOF
283 }
284
285 ##################################################################
286
287 =item C<calc_input ($base, $max)>
288
289 Generate the input file F<$base.input> for the calc parser. The input
290 is composed of two expressions. The first one is using left recursion
291 only and consumes no stack. The second one requires a deep stack.
292 These two expressions are repeated C<$max> times in the output file.
293
294 =cut
295
296 sub calc_input ($$)
297 {
298 my ($base, $max) = @_;
299 my $out = new IO::File ">$base.input"
300 or die;
301 foreach (1 .. $max)
302 {
303 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";
304 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";
305 }
306 }
307
308 ##################################################################
309
310 =item C<generate_grammar_calc ($base, $max, @directive)>
311
312 Generate a Bison file F<$base.y> for a calculator parser in C. Pass
313 the additional Bison C<@directive>. C<$max> is ignored, but left to
314 have the same interface as C<triangular_grammar>.
315
316 =cut
317
318 sub generate_grammar_calc ($$@)
319 {
320 my ($base, $max, @directive) = @_;
321 my $directives = directives ($base, @directive);
322
323 my $out = new IO::File ">$base.y"
324 or die;
325 print $out <<EOF;
326 %{
327 #include <stdio.h>
328
329 #include <stdlib.h>
330 #include <string.h>
331 #include <ctype.h>
332 #define USE(Var)
333
334 /* Exercise pre-prologue dependency to %union. */
335 typedef int semantic_value;
336
337 static semantic_value global_result = 0;
338 static int global_count = 0;
339 %}
340
341 $directives
342 %error-verbose
343 /* Exercise %union. */
344 %union
345 {
346 semantic_value ival;
347 };
348
349 %{
350 static int power (int base, int exponent);
351 /* yyerror receives the location if:
352 - %location & %pure & %glr
353 - %location & %pure & %yacc & %parse-param. */
354 static void yyerror (const char *s);
355 #if YYPURE
356 static int yylex (YYSTYPE* yylvalp);
357 #else
358 static int yylex (void);
359 #endif
360 %}
361
362 /* Bison Declarations */
363 %token CALC_EOF 0 "end of input"
364 %token <ival> NUM "number"
365 %type <ival> exp
366
367 %nonassoc '=' /* comparison */
368 %left '-' '+'
369 %left '*' '/'
370 %left NEG /* negation--unary minus */
371 %right '^' /* exponentiation */
372
373 /* Grammar follows */
374 %%
375 input:
376 line
377 | input line
378 ;
379
380 line:
381 '\\n'
382 | exp '\\n' { USE (\$1); }
383 ;
384
385 exp:
386 NUM { \$\$ = \$1; }
387 | exp '=' exp
388 {
389 if (\$1 != \$3)
390 fprintf (stderr, "calc: error: %d != %d\\n", \$1, \$3);
391 \$\$ = \$1;
392 }
393 | exp '+' exp { \$\$ = \$1 + \$3; }
394 | exp '-' exp { \$\$ = \$1 - \$3; }
395 | exp '*' exp { \$\$ = \$1 * \$3; }
396 | exp '/' exp { \$\$ = \$1 / \$3; }
397 | '-' exp %prec NEG { \$\$ = -\$2; }
398 | exp '^' exp { \$\$ = power (\$1, \$3); }
399 | '(' exp ')' { \$\$ = \$2; }
400 | '(' error ')' { \$\$ = 1111; }
401 | '!' { \$\$ = 0; YYERROR; }
402 | '-' error { \$\$ = 0; YYERROR; }
403 ;
404 %%
405 /* The input. */
406 static FILE *input;
407
408 static void
409 yyerror (const char *s)
410 {
411 fprintf (stderr, "%s\\n", s);
412 }
413
414 static int
415 get_char (void)
416 {
417 return getc (input);
418 }
419
420
421 static void
422 unget_char ( int c)
423 {
424 ungetc (c, input);
425 }
426
427 static int
428 read_signed_integer (void)
429 {
430 int c = get_char ();
431 int sign = 1;
432 int n = 0;
433
434 if (c == '-')
435 {
436 c = get_char ();
437 sign = -1;
438 }
439
440 while (isdigit (c))
441 {
442 n = 10 * n + (c - '0');
443 c = get_char ();
444 }
445
446 unget_char (c);
447
448 return sign * n;
449 }
450
451 static int
452 #if YYPURE
453 # define yylval (*yylvalp)
454 yylex (YYSTYPE* yylvalp)
455 #else
456 yylex (void)
457 #endif
458 {
459 int c;
460
461 /* Skip white space. */
462 while ((c = get_char ()) == ' ' || c == '\t')
463 continue;
464
465 /* process numbers */
466 if (c == '.' || isdigit (c))
467 {
468 unget_char ( c);
469 yylval.ival = read_signed_integer ();
470 return NUM;
471 }
472
473 /* Return end-of-file. */
474 if (c == EOF)
475 return CALC_EOF;
476
477 /* Return single chars. */
478 return c;
479 }
480
481 static int
482 power (int base, int exponent)
483 {
484 int res = 1;
485 if (exponent < 0)
486 exit (3);
487 for (/* Niente */; exponent; --exponent)
488 res *= base;
489 return res;
490 }
491
492
493 int
494 main (int argc, const char **argv)
495 {
496 semantic_value result = 0;
497 int count = 0;
498 int status;
499
500 input = fopen ("calc.input", "r");
501 if (!input)
502 {
503 perror ("calc.input");
504 return 3;
505 }
506
507 status = yyparse ();
508 if (global_result != result)
509 abort ();
510 if (global_count != count)
511 abort ();
512
513 return status;
514 }
515 EOF
516 }
517
518 ##################################################################
519
520 =item C<generate_grammar_variant ($base, $max, @directive)>
521
522 Generate a Bison file F<$base.y> that uses, or not, the Boost.Variants
523 depending on the C<@directive>.
524
525 =cut
526
527 sub generate_grammar_variant ($$@)
528 {
529 my ($base, $max, @directive) = @_;
530 my $directives = directives ($base, @directive);
531 my $variant = grep { $_ eq '%define variant' } @directive;
532
533 my $out = new IO::File ">$base.y"
534 or die;
535 print $out <<EOF;
536 %language "C++"
537 %defines
538 $directives
539
540 %code requires // variant.h
541 {
542 #include <string>
543 }
544
545 %code // variant.c
546 {
547 #include <algorithm>
548 #include <iostream>
549 #include <sstream>
550
551 // Prototype of the yylex function providing subsequent tokens.
552 static yy::parser::token_type yylex(yy::parser::semantic_type* yylval);
553
554 #define STAGE_MAX ($max * 10) // max = $max
555 #define USE_VARIANTS $variant
556 #if USE_VARIANTS
557 # define IF_VARIANTS(True, False) True
558 #else
559 # define IF_VARIANTS(True, False) False
560 #endif
561 }
562 EOF
563
564 if ($variant)
565 {
566 print $out <<'EOF';
567 %token <std::string> TEXT
568 %token <int> NUMBER
569 %printer { std::cerr << "Number: " << $$; } <int>
570 %printer { std::cerr << "Text: " << $$; } <std::string>
571 %token END_OF_FILE 0
572 %type <std::string> text result
573
574 %%
575 result:
576 text { /* Throw away the result. */ }
577 ;
578
579 text:
580 /* nothing */ { /* This will generate an empty string */ }
581 | text TEXT { std::swap($$,$1); $$.append($2); }
582 | text NUMBER {
583 std::swap($$,$1);
584 std::ostringstream ss;
585 ss << ' ' << $2;
586 $$.append(ss.str());
587 }
588 ;
589 EOF
590 }
591 else
592 {
593 # Not using Bison variants.
594 print $out <<'EOF';
595 %union {int ival; std::string* sval;}
596 %token <sval> TEXT
597 %token <ival> NUMBER
598 %printer { std::cerr << "Number: " << $$; } <ival>
599 %printer { std::cerr << "Text: " << *$$; } <sval>
600 %token END_OF_FILE 0
601 %type <sval> text result
602
603 %%
604 result:
605 text { delete $1; }
606 ;
607
608 text:
609 /* nothing */ { $$ = new std::string; }
610 | text TEXT { $$->append(*$2); delete $2; }
611 | text NUMBER {
612 std::ostringstream ss;
613 ss << ' ' << $2;
614 $$->append(ss.str());
615 }
616 ;
617 EOF
618 }
619
620 print $out <<'EOF';
621 %%
622 static
623 yy::parser::token_type
624 yylex(yy::parser::semantic_type* yylval)
625 {
626 static int stage = -1;
627 ++stage;
628 if (stage == STAGE_MAX)
629 return yy::parser::token::END_OF_FILE;
630 else if (stage % 2)
631 {
632 IF_VARIANTS(yylval->build<int>(), yylval->ival) = stage;
633 return yy::parser::token::NUMBER;
634 }
635 else
636 {
637 IF_VARIANTS(yylval->build<std::string>() =, yylval->sval = new) std::string("A string.");
638 return yy::parser::token::TEXT;
639 }
640 abort();
641 }
642
643 // Mandatory error function
644 void
645 yy::parser::error(const yy::parser::location_type& yylloc,
646 const std::string& message)
647 {
648 std::cerr << yylloc << ": " << message << std::endl;
649 }
650
651 int main(int argc, char *argv[])
652 {
653 yy::parser p;
654 #if YYDEBUG
655 p.set_debug_level(!!getenv("YYDEBUG"));
656 #endif
657 p.parse();
658 return 0;
659 }
660 EOF
661 }
662
663 ##################################################################
664
665 =item C<generate_grammar ($name, $base, @directive)>
666
667 Generate F<$base.y> by calling C<&generate_grammar_$name>.
668
669 =cut
670
671 sub generate_grammar ($$@)
672 {
673 my ($name, $base, @directive) = @_;
674 verbose 2, "Generating $base.y\n";
675 my %generator =
676 (
677 "calc" => \&generate_grammar_calc,
678 "triangular" => \&generate_grammar_triangular,
679 "variant" => \&generate_grammar_variant,
680 );
681 &{$generator{$name}}($base, 200, @directive);
682 }
683
684 ##################################################################
685
686 =item C<run ($command)>
687
688 Run, possibly verbosely, the shell C<$command>.
689
690 =cut
691
692 sub run ($)
693 {
694 my ($command) = @_;
695 verbose 2, "$command\n";
696 system ("$command") == 0
697 or die "$command failed";
698 }
699
700 ##################################################################
701
702 =item C<compile ($base)>
703
704 Compile C<$base.y> to an executable C, Using the C or C++ compiler
705 depending on the %language specification in C<$base.y>.
706
707 =cut
708
709 sub compile ($)
710 {
711 my ($base) = @_;
712 my $language = `sed -ne '/%language "\\(.*\\)"/{s//\\1/;p;q;}' $base.y`;
713 chomp $language;
714
715 my $compiler = $language eq 'C++' ? $cxx : $cc;
716
717 run "$bison $base.y -o $base.c";
718 run "$compiler -o $base $cflags $base.c";
719 }
720
721 ######################################################################
722
723 =item C<bench_grammar ($gram, %bench)>
724
725 Generate benches for C<$gram>. C<$gram> should be C<calc> or
726 C<triangle>. C<%bench> is a hash of the form:
727
728 $name => @directive
729
730 where C<$name> is the name of the bench, and C<@directive> are the
731 Bison directive to use for this bench. All the benches are compared
732 against each other, repeated 50 times.
733
734 =cut
735
736 sub bench_grammar ($%)
737 {
738 my ($gram, %test) = @_;
739
740 use Benchmark qw (:all :hireswallclock);
741
742 # Set up the benches as expected by timethese.
743 my %bench;
744 # For each bench, capture the size.
745 my %size;
746 # If there are no user specified directives, use an empty one.
747 @directive = ('')
748 unless @directive;
749 my %directive;
750 # A counter of directive sets.
751 my $count = 1;
752 for my $d (@directive)
753 {
754 $directive{$count} = $d;
755 while (my ($name, $directives) = each %test)
756 {
757 $name = "$count-$name";
758 generate_grammar ($gram, $name, (@$directives, $d));
759 # Compile the executable.
760 compile ($name);
761 $bench{$name} = "system ('./$name');";
762 chop($size{$name} = `wc -c <$name`);
763 }
764 $count++;
765 }
766
767 # Display the directives.
768 for my $d (sort keys %directive)
769 {
770 printf " %2d. %s\n", $d, $directive{$d};
771 }
772
773 # Run the benches.
774 #
775 # STYLE can be any of 'all', 'none', 'noc', 'nop' or 'auto'. 'all'
776 # shows each of the 5 times available ('wallclock' time, user time,
777 # system time, user time of children, and system time of
778 # children). 'noc' shows all except the two children times. 'nop'
779 # shows only wallclock and the two children times. 'auto' (the
780 # default) will act as 'all' unless the children times are both
781 # zero, in which case it acts as 'noc'. 'none' prevents output.
782 verbose 2, "Running the benches for $gram\n";
783 my $res = timethese ($iterations, \%bench, 'nop');
784
785 # Output the speed result.
786 cmpthese ($res, 'nop');
787
788 # Display the sizes.
789 print "Sizes (decreasing):\n";
790 my $width = 10;
791 for my $bench (keys %size)
792 {
793 $width = length $bench
794 if $width < length $bench;
795 }
796 # Benches sorted by decreasing size.
797 my @benches_per_size = sort {$size{$b} <=> $size{$a}} keys %size;
798 for my $bench (@benches_per_size)
799 {
800 printf "%${width}s: %5.2fkB\n", $bench, $size{$bench} / 1024;
801 }
802 }
803
804 ######################################################################
805
806 =item C<bench_push_parser ()>
807
808 Bench the C push parser against the pull parser, pure and impure
809 interfaces.
810
811 =cut
812
813 sub bench_push_parser ()
814 {
815 calc_input ('calc', 200);
816 bench_grammar
817 ('calc',
818 (
819 "pull-impure" => [],
820 "pull-pure" => ['%define api.pure'],
821 "push-impure" => ['%define api.push_pull "both"'],
822 "push-pure" => ['%define api.push_pull "both"', '%define api.pure'],
823 )
824 );
825 }
826
827 ######################################################################
828
829 =item C<bench_variant_parser ()>
830
831 Bench the C++ lalr1.cc parser using Boost.Variants or %union.
832
833 =cut
834
835 sub bench_variant_parser ()
836 {
837 bench_grammar
838 ('variant',
839 (
840 "f-union" => ['%skeleton "lalr1.cc"'],
841 "f-uni-deb" => ['%skeleton "lalr1.cc"', '%debug'],
842 "f-var" => ['%skeleton "lalr1.cc"', '%define variant'],
843 "f-var-deb" => ['%skeleton "lalr1.cc"', '%debug', '%define variant'],
844 "f-var-dtr" => ['%skeleton "lalr1.cc"', '%define variant', "%code {\n#define VARIANT_DESTROY\n}"],
845 "f-var-deb-dtr" => ['%skeleton "lalr1.cc"', '%debug', '%define variant', "%code {\n#define VARIANT_DESTROY\n}"],
846 "f-var-deb-dtr-ass" => ['%skeleton "lalr1.cc"', '%debug', '%define variant', "%code {\n#define VARIANT_DESTROY\n}", "%define assert"],
847 )
848 );
849 }
850
851 ######################################################################
852
853 =item C<bench_fusion_parser ()>
854
855 Bench the C++ lalr1.cc parser using Boost.Variants or %union.
856
857 =cut
858
859 sub bench_fusion_parser ()
860 {
861 bench_grammar
862 ('variant',
863 (
864 "split" => ['%skeleton "lalr1-split.cc"'],
865 "fused" => ['%skeleton "lalr1.cc"'],
866 )
867 );
868 }
869
870 ######################################################################
871
872 =item C<bench_list_parser ()>
873
874 Bench the "variant" grammar with debug and no-debug.
875
876 =cut
877
878 sub bench_list_parser ()
879 {
880 bench_grammar
881 ('variant',
882 (
883 "nodbd" => [''],
884 "debug" => ['%debug'],
885 )
886 );
887 }
888
889 ############################################################################
890
891 sub help ($)
892 {
893 my ($verbose) = @_;
894 use Pod::Usage;
895 # See <URL:http://perldoc.perl.org/pod2man.html#NOTES>.
896 pod2usage( { -message => "Bench Bison parsers",
897 -exitval => 0,
898 -verbose => $verbose,
899 -output => \*STDOUT });
900 }
901
902 ######################################################################
903
904 sub getopt ()
905 {
906 use Getopt::Long;
907 my %option = (
908 "c|cflags=s" => \$cflags,
909 "d|directive=s" => \@directive,
910 "h|help" => sub { help ($verbose) },
911 "i|iterations=i" => \$iterations,
912 "q|quiet" => sub { --$verbose },
913 "v|verbose" => sub { ++$verbose },
914 );
915 Getopt::Long::Configure ("bundling", "pass_through");
916 GetOptions (%option)
917 or exit 1;
918 }
919
920 ######################################################################
921
922 getopt;
923 verbose 1, "Using bison=$bison.\n";
924 verbose 1, "Using cc=$cc.\n";
925 verbose 1, "Using cxx=$cxx.\n";
926 verbose 1, "Using cflags=$cflags.\n";
927
928 for my $b (@ARGV)
929 {
930 verbose 1, "Running benchmark $b.\n";
931 bench_fusion_parser() if $b eq "fusion";
932 bench_list_parser() if $b eq "list";
933 bench_push_parser() if $b eq "push";
934 bench_variant_parser() if $b eq "variant";
935 }
936
937 ### Setup "GNU" style for perl-mode and cperl-mode.
938 ## Local Variables:
939 ## perl-indent-level: 2
940 ## perl-continued-statement-offset: 2
941 ## perl-continued-brace-offset: 0
942 ## perl-brace-offset: 0
943 ## perl-brace-imaginary-offset: 0
944 ## perl-label-offset: -2
945 ## cperl-indent-level: 2
946 ## cperl-brace-offset: 0
947 ## cperl-continued-brace-offset: 0
948 ## cperl-label-offset: -2
949 ## cperl-extra-newline-before-brace: t
950 ## cperl-merge-trailing-else: nil
951 ## cperl-continued-statement-offset: 2
952 ## End: