3 * URGENT: Documenting C++ output
4 Write a first documentation for C++ output.
8 Some are really funky. For instance
10 type clash (`%s' `%s') on default action
12 is really weird. Revisit them all.
14 * Stupid error messages
15 An example shows it easily:
17 src/bison/tests % ./testsuite -k calc,location,error-verbose -l
18 GNU Bison 1.49a test suite test groups:
20 NUM: FILENAME:LINE TEST-GROUP-NAME
23 51: calc.at:440 Calculator --locations --yyerror-verbose
24 52: calc.at:442 Calculator --defines --locations --name-prefix=calc --verbose --yacc --yyerror-verbose
25 54: calc.at:445 Calculator --debug --defines --locations --name-prefix=calc --verbose --yacc --yyerror-verbose
26 src/bison/tests % ./testsuite 51 -d
27 ## --------------------------- ##
28 ## GNU Bison 1.49a test suite. ##
29 ## --------------------------- ##
31 ## ---------------------------- ##
32 ## All 1 tests were successful. ##
33 ## ---------------------------- ##
34 src/bison/tests % cd ./testsuite.dir/51
35 tests/testsuite.dir/51 % echo "()" | ./calc
36 1.2-1.3: parse error, unexpected ')', expecting error or "number" or '-' or '('
40 This is not portable to DOS for instance. Implement a more portable
41 scheme. Sources of inspiration include GNU diff, and Free Recode.
44 * value_components_used
45 Was defined but not used: where was it coming from? It can't be to
46 check if %union is used, since the user is free to $<foo>n on her
53 How would Paul like to display the conflicted actions? In particular,
54 what when two reductions are possible on a given lookahead, but one is
55 part of $default. Should we make the two reductions explicit, or just
56 keep $default? See the following point.
58 ** Disabled Reductions
59 See `tests/conflicts.at (Defaulted Conflicted Reduction)', and decide
63 Extend with error productions. The hard part will probably be finding
64 the right rule so that a single state does not exhibit too many yet
65 undocumented ``features''. Maybe an empty action ought to be
66 presented too. Shall we try to make a single grammar with all these
67 features, or should we have several very small grammars?
69 ** --report=conflict-path
70 Provide better assistance for understanding the conflicts by providing
71 a sample text exhibiting the (LALR) ambiguity. See the paper from
72 DeRemer and Penello: they already provide the algorithm.
77 ** yyerror, yysymprint interface
78 It should be improved, in particular when using Bison features such as
79 locations, and YYPARSE_PARAMS. For the time being, it is recommended
80 to #define yyerror and yyprint to steal internal variables...
83 I think this is a pleasant (but useless currently) feature, but in the
84 future, I want a means to %include other bits of grammars, and _then_
85 it will be important for the various bits to define their needs in
88 When implementing multiple-%union support, bare the following in mind:
90 - when --yacc, this must be flagged as an error. Don't make it fatal
93 - The #line must now appear *inside* the definition of yystype.
104 Maybe we could expand unit rules, i.e., transform
112 exp: exp '+' exp | exp '&' exp;
114 when there are no actions. This can significantly speed up some
115 grammars. I can't find the papers. In particular the book `LR
116 parsing: Theory and Practice' is impossible to find, but according to
117 `Parsing Techniques: a Practical Guide', it includes information about
118 this issue. Does anybody have it?
125 Explain $axiom (and maybe change its name: BTYacc names it `goal',
126 byacc `$accept' probably based on AT&T Yacc, Meta `Start'...).
127 Complete the glossary (item, axiom, ?). Should we also rename `$'?
128 BYacc uses `$end'. `$eof' is attracting, but after all we may be
129 parsing a string, a stream etc.
131 ** History/Bibliography
132 Some history of Bison and some bibliography would be most welcome.
133 Are there any Texinfo standards for bibliography?
138 * Coding system independence
141 Currently Bison assumes 8-bit bytes (i.e. that UCHAR_MAX is
142 255). It also assumes that the 8-bit character encoding is
143 the same for the invocation of 'bison' as it is for the
144 invocation of 'cc', but this is not necessarily true when
145 people run bison on an ASCII host and then use cc on an EBCDIC
146 host. I don't think these topics are worth our time
147 addressing (unless we find a gung-ho volunteer for EBCDIC or
148 PDP-10 ports :-) but they should probably be documented
161 ** Options which could use parse_dquoted_param ().
162 Maybe transfered in lex.c.
168 ** Skeleton strategy. []
169 Must we keep %no-parser?
171 *** New skeletons. []
174 Find the best graph parameters. []
178 informations about ERROR_VERBOSE. []
179 ** Add explainations about
184 ** tests/pure-parser.at []
188 Some users create their foo.y files, and equip them with #line. Bison
189 should recognize these, and preserve them.
192 See if we can integrate backtracking in Bison. Contact the BTYacc
195 ** Keeping the conflicted actions
196 First, analyze the differences between byacc and btyacc (I'm referring
197 to the executables). Find where the conflicts are preserved.
199 ** Compare with the GLR tables
200 See how isomorphic the way BTYacc and the way the GLR adjustements in
201 Bison are compatible. *As much as possible* one should try to use the
202 same implementation in the Bison executables. I insist: it should be
203 very feasible to use the very same conflict tables.
205 ** Adjust the skeletons
206 Import the skeletons for C and C++.
208 ** Improve the skeletons
209 Have them support yysymprint, yydestruct and so forth.
215 It is unfortunate that there is a total order for precedence. It
216 makes it impossible to have modular precedence information. We should
217 move to partial orders (sounds like series/parallel orders to me).
219 This will be possible with a Bison parser for the grammar, as it will
220 make it much easier to extend the grammar.
222 ** Correlation b/w precedence and associativity
223 Also, I fail to understand why we have to assign the same
224 associativity to operators with the same precedence. For instance,
225 why can't I decide that the precedence of * and / is the same, but the
228 If there is really no profound motivation, we should find a new syntax
229 to allow specifying this.
232 See if we can use precedence between rules to solve RR conflicts. See
238 - If the Bison generated parser experiences an undefined number in the
239 character range, that character is written out in diagnostic messages, an
240 addition to the $undefined value.
242 Suggest: Change the name $undefined to undefined; looks better in outputs.
247 - For use with my C++ parser, I transported the "switch (yyn)" statement
248 that Bison writes to the bison.simple skeleton file. This way, I can remove
249 the current default rule $$ = $1 implementation, which causes a double
250 assignment to $$ which may not be OK under C++, replacing it with a
251 "default:" part within the switch statement.
253 Note that the default rule $$ = $1, when typed, is perfectly OK under C,
254 but in the C++ implementation I made, this rule is different from
255 $<type_name>$ = $<type_name>1. I therefore think that one should implement
256 a Bison option where every typed default rule is explicitly written out
257 (same typed ruled can of course be grouped together).
259 Note: Robert Anisko handles this. He knows how to do it.
263 It would be nice to have warning support. See how Autoconf handles
264 them, it is fairly well described there. It would be very nice to
265 implement this in such a way that other programs could use
268 Don't work on this without first announcing you do, as I already have
269 thought about it, and know many of the components that can be used to
273 * Pre and post actions.
274 From: Florian Krohm <florian@edamail.fishkill.ibm.com>
275 Subject: YYACT_EPILOGUE
276 To: bug-bison@gnu.org
277 X-Sent: 1 week, 4 days, 14 hours, 38 minutes, 11 seconds ago
279 The other day I had the need for explicitly building the parse tree. I
280 used %locations for that and defined YYLLOC_DEFAULT to call a function
281 that returns the tree node for the production. Easy. But I also needed
282 to assign the S-attribute to the tree node. That cannot be done in
283 YYLLOC_DEFAULT, because it is invoked before the action is executed.
284 The way I solved this was to define a macro YYACT_EPILOGUE that would
285 be invoked after the action. For reasons of symmetry I also added
286 YYACT_PROLOGUE. Although I had no use for that I can envision how it
287 might come in handy for debugging purposes.
288 All is needed is to add
291 YYACT_EPILOGUE (yyval, (yyvsp - yylen), yylen, yyloc, (yylsp - yylen));
293 YYACT_EPILOGUE (yyval, (yyvsp - yylen), yylen);
296 at the proper place to bison.simple. Ditto for YYACT_PROLOGUE.
298 I was wondering what you think about adding YYACT_PROLOGUE/EPILOGUE
299 to bison. If you're interested, I'll work on a patch.
302 Well, VCG seems really dead. Move to Graphviz instead. Also, equip
303 the parser with a means to create the (visual) parse tree.
307 Copyright (C) 2001, 2002 Free Software Foundation, Inc.
309 This file is part of GNU Bison.
311 GNU Bison is free software; you can redistribute it and/or modify
312 it under the terms of the GNU General Public License as published by
313 the Free Software Foundation; either version 2, or (at your option)
316 GNU Bison is distributed in the hope that it will be useful,
317 but WITHOUT ANY WARRANTY; without even the implied warranty of
318 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
319 GNU General Public License for more details.
321 You should have received a copy of the GNU General Public License
322 along with Bison; see the file COPYING. If not, write to
323 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
324 Boston, MA 02111-1307, USA.