3 * URGENT: Documenting C++ output
4 Write a first documentation for C++ output.
6 * value_components_used
7 Was defined but not used: where was it coming from? It can't be to
8 check if %union is used, since the user is free to $<foo>n on her
11 * yyerror, yyprint interface
12 It should be improved, in particular when using Bison features such as
13 locations, and YYPARSE_PARAMS. For the time being, it is recommended
14 to #define yyerror and yyprint to steal internal variables...
17 Explain $axiom (and maybe change its name: BTYacc names it `goal',
18 byacc `$accept' probably based on AT&T Yacc, Meta `Start'...).
19 Complete the glossary (item, axiom, ?).
22 Some are really funky. For instance
24 type clash (`%s' `%s') on default action
26 is really weird. Revisit them all.
28 * Report documentation
29 Extend with error. The hard part will probably be finding the right
30 rule so that a single state does not exhibit to many yet undocumented
31 ``features''. Maybe an empty action ought to be presented too. Shall
32 we try to make a single grammar with all these features, or should we
33 have several very small grammars?
36 Some history of Bison and some bibliography would be most welcome.
37 Are there any Texinfo standards for bibliography?
40 I think this is a pleasant (but useless currently) feature, but in the
41 future, I want a means to %include other bits of grammars, and _then_
42 it will be important for the various bits to define their needs in
45 When implementing multiple-%union support, bare the following in mind:
47 - when --yacc, this must be flagged as an error. Don't make it fatal
50 - The #line must now appear *inside* the definition of yystype.
60 * --report=conflict-path
61 Provide better assistance for understanding the conflicts by providing
62 a sample text exhibiting the (LALR) ambiguity. See the paper from
63 DeRemer and Penello: they already provide the algorithm.
65 * Coding system independence
68 Currently Bison assumes 8-bit bytes (i.e. that UCHAR_MAX is
69 255). It also assumes that the 8-bit character encoding is
70 the same for the invocation of 'bison' as it is for the
71 invocation of 'cc', but this is not necessarily true when
72 people run bison on an ASCII host and then use cc on an EBCDIC
73 host. I don't think these topics are worth our time
74 addressing (unless we find a gung-ho volunteer for EBCDIC or
75 PDP-10 ports :-) but they should probably be documented
79 Maybe we could expand unit rules, i.e., transform
87 exp: exp '+' exp | exp '&' exp;
89 when there are no actions. This can significantly speed up some
90 grammars. I can't find the papers. In particular the book `LR
91 parsing: Theory and Practice' is impossible to find, but according to
92 `Parsing Techniques: a Practical Guide', it includes information about
93 this issue. Does anybody have it?
95 * Stupid error messages
96 An example shows it easily:
98 src/bison/tests % ./testsuite -k calc,location,error-verbose -l
99 GNU Bison 1.49a test suite test groups:
101 NUM: FILENAME:LINE TEST-GROUP-NAME
104 51: calc.at:440 Calculator --locations --yyerror-verbose
105 52: calc.at:442 Calculator --defines --locations --name-prefix=calc --verbose --yacc --yyerror-verbose
106 54: calc.at:445 Calculator --debug --defines --locations --name-prefix=calc --verbose --yacc --yyerror-verbose
107 src/bison/tests % ./testsuite 51 -d
108 ## --------------------------- ##
109 ## GNU Bison 1.49a test suite. ##
110 ## --------------------------- ##
112 ## ---------------------------- ##
113 ## All 1 tests were successful. ##
114 ## ---------------------------- ##
115 src/bison/tests % cd ./testsuite.dir/51
116 tests/testsuite.dir/51 % echo "()" | ./calc
117 1.2-1.3: parse error, unexpected ')', expecting error or "number" or '-' or '('
120 This is not portable to DOS for instance. Implement a more portable
121 scheme. Sources of inspiration include GNU diff, and Free Recode.
123 * Memory leaks in the generator
124 A round of memory leak clean ups would be most welcome. Dmalloc,
125 Checker GCC, Electric Fence, or Valgrind: you chose your tool.
135 ** Options which could use parse_dquoted_param ().
136 Maybe transfered in lex.c.
142 ** Skeleton strategy. []
143 Must we keep %no-parser?
145 *** New skeletons. []
148 Find the best graph parameters. []
152 informations about ERROR_VERBOSE. []
153 ** Add explainations about
158 ** tests/pure-parser.at []
165 akim demaille <akim.demaille@epita.fr> writes:
167 > With great pleasure! Nonetheless, things which are debatable
168 > (or not, but just `big') should be discuss in `public': something
169 > like help- or bug-bison@gnu.org is just fine. Jesse and I are there,
170 > but there is also Jim and some other people.
172 I have no idea whether it qualifies as big or controversial, so I'll
173 just summarize for you. I proposed this change years ago and was
174 surprised that it was met with utter indifference!
176 This debug feature is for the programs/grammars one develops with
177 bison, not for debugging bison itself. I find that the YYDEBUG
178 output comes in a very inconvenient format for my purposes.
179 When debugging gcc, for instance, what I want is to see a trace of
180 the sequence of reductions and the line#s for the semantic actions
181 so I can follow what's happening. Single-step in gdb doesn't cut it
182 because to move from one semantic action to the next takes you through
183 lots of internal machinery of the parser, which is uninteresting.
185 The change I made was to the format of the debug output, so that it
186 comes out in the format of C error messages, digestible by emacs
187 compile mode, like so:
189 grammar.y:1234: foo: bar(0x123456) baz(0x345678)
191 where "foo: bar baz" is the reduction rule, whose semantic action
192 appears on line 1234 of the bison grammar file grammar.y. The hex
193 numbers on the rhs tokens are the parse-stack values associated with
194 those tokens. Of course, yytype might be something totally
195 incompatible with that representation, but for the most part, yytype
196 values are single words (scalars or pointers). In the case of gcc,
197 they're most often pointers to tree nodes. Come to think of it, the
198 right thing to do is to make the printing of stack values be
199 user-definable. It would also be useful to include the filename &
200 line# of the file being parsed, but the main filename & line# should
201 continue to be that of grammar.y
203 Anyway, this feature has saved my life on numerous occasions. The way
204 I customarily use it is to first run bison with the traces on, isolate
205 the sequence of reductions that interests me, put those traces in a
206 buffer and force it into compile-mode, then visit each of those lines
207 in the grammar and set breakpoints with C-x SPACE. Then, I can run
208 again under the control of gdb and stop at each semantic action.
209 With the hex addresses of tree nodes, I can inspect the values
210 associated with any rhs token.
215 Some users create their foo.y files, and equip them with #line. Bison
216 should recognize these, and preserve them.
219 See if we can integrate backtracking in Bison. Contact the BTYacc
223 See if we can use precedence between rules to solve RR conflicts. See
227 It is unfortunate that there is a total order for precedence. It
228 makes it impossible to have modular precedence information. We should
229 move to partial orders.
231 This will be possible with a Bison parser for the grammar, as it will
232 make it much easier to extend the grammar.
236 - If the Bison generated parser experiences an undefined number in the
237 character range, that character is written out in diagnostic messages, an
238 addition to the $undefined value.
240 Suggest: Change the name $undefined to undefined; looks better in outputs.
244 - For use with my C++ parser, I transported the "switch (yyn)" statement
245 that Bison writes to the bison.simple skeleton file. This way, I can remove
246 the current default rule $$ = $1 implementation, which causes a double
247 assignment to $$ which may not be OK under C++, replacing it with a
248 "default:" part within the switch statement.
250 Note that the default rule $$ = $1, when typed, is perfectly OK under C,
251 but in the C++ implementation I made, this rule is different from
252 $<type_name>$ = $<type_name>1. I therefore think that one should implement
253 a Bison option where every typed default rule is explicitly written out
254 (same typed ruled can of course be grouped together).
256 Note: Robert Anisko handles this. He knows how to do it.
259 It would be nice to have warning support. See how Autoconf handles
260 them, it is fairly well described there. It would be very nice to
261 implement this in such a way that other programs could use
264 Don't work on this without first announcing you do, as I already have
265 thought about it, and know many of the components that can be used to
268 * Pre and post actions.
269 From: Florian Krohm <florian@edamail.fishkill.ibm.com>
270 Subject: YYACT_EPILOGUE
271 To: bug-bison@gnu.org
272 X-Sent: 1 week, 4 days, 14 hours, 38 minutes, 11 seconds ago
274 The other day I had the need for explicitly building the parse tree. I
275 used %locations for that and defined YYLLOC_DEFAULT to call a function
276 that returns the tree node for the production. Easy. But I also needed
277 to assign the S-attribute to the tree node. That cannot be done in
278 YYLLOC_DEFAULT, because it is invoked before the action is executed.
279 The way I solved this was to define a macro YYACT_EPILOGUE that would
280 be invoked after the action. For reasons of symmetry I also added
281 YYACT_PROLOGUE. Although I had no use for that I can envision how it
282 might come in handy for debugging purposes.
283 All is needed is to add
286 YYACT_EPILOGUE (yyval, (yyvsp - yylen), yylen, yyloc, (yylsp - yylen));
288 YYACT_EPILOGUE (yyval, (yyvsp - yylen), yylen);
291 at the proper place to bison.simple. Ditto for YYACT_PROLOGUE.
293 I was wondering what you think about adding YYACT_PROLOGUE/EPILOGUE
294 to bison. If you're interested, I'll work on a patch.
297 Well, VCG seems really dead. Move to Graphviz instead. Also, equip
298 the parser with a means to create the (visual) parse tree.
302 Copyright (C) 2001, 2002 Free Software Foundation, Inc.
304 This file is part of GNU Autoconf.
306 GNU Autoconf is free software; you can redistribute it and/or modify
307 it under the terms of the GNU General Public License as published by
308 the Free Software Foundation; either version 2, or (at your option)
311 GNU Autoconf is distributed in the hope that it will be useful,
312 but WITHOUT ANY WARRANTY; without even the implied warranty of
313 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
314 GNU General Public License for more details.
316 You should have received a copy of the GNU General Public License
317 along with autoconf; see the file COPYING. If not, write to
318 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
319 Boston, MA 02111-1307, USA.