5 From Franc,ois: should we keep the directory part in the CPP guard?
 
  10 Do some people use YYPURE, YYLSP_NEEDED like we do in the test suite?
 
  11 They should not: it is not documented.  But if they need to, let's
 
  12 find something clean (not like YYLSP_NEEDED...).
 
  15 * URGENT: Documenting C++ output
 
  16 Write a first documentation for C++ output.
 
  20 Before releasing, make sure the documentation ("Understanding your
 
  21 parser") refers to the current `output' format.
 
  25 Currently, the GLR parser cannot compile with a C++ compiler.
 
  31 How would Paul like to display the conflicted actions?  In particular,
 
  32 what when two reductions are possible on a given look-ahead token, but one is
 
  33 part of $default.  Should we make the two reductions explicit, or just
 
  34 keep $default?  See the following point.
 
  36 ** Disabled Reductions
 
  37 See `tests/conflicts.at (Defaulted Conflicted Reduction)', and decide
 
  41 Extend with error productions.  The hard part will probably be finding
 
  42 the right rule so that a single state does not exhibit too many yet
 
  43 undocumented ``features''.  Maybe an empty action ought to be
 
  44 presented too.  Shall we try to make a single grammar with all these
 
  45 features, or should we have several very small grammars?
 
  47 ** --report=conflict-path
 
  48 Provide better assistance for understanding the conflicts by providing
 
  49 a sample text exhibiting the (LALR) ambiguity.  See the paper from
 
  50 DeRemer and Penello: they already provide the algorithm.
 
  56 I think we should document it as experimental, and allow its use in
 
  57 the next releases.  But we also need to port it to GLR.  What about
 
  58 lalr1.cc?  Well, read what Hans reported, maybe we don't want
 
  59 %detructor.  On the other hand, there is no reason not to provide it:
 
  60 users can avoid its use.
 
  63 Have a look at the Lemon parser generator: instead of $1, $2 etc. they
 
  64 can name the values.  This is much more pleasant.  For instance:
 
  66        exp (res): exp (a) '+' exp (b) { $res = $a + $b; };
 
  68 I love this.  I have been bitten too often by the removal of the
 
  69 symbol, and forgetting to shift all the $n to $n-1.  If you are
 
  70 unlucky, it compiles...
 
  73 We should find a means to provide an access to values deep in the
 
  74 stack.  For instance, instead of
 
  76         baz: qux { $$ = $<foo>-1 + $<bar>0 + $1; }
 
  78 we should be able to have:
 
  80   foo($foo) bar($bar) baz($bar): qux($qux) { $baz = $foo + $bar + $qux; }
 
  82 Or something like this.
 
  84 ** yysymprint interface
 
  85 It should be improved, in particular when using Bison features such as
 
  86 locations, and YYPARSE_PARAMS.  For the time being, it is almost
 
  87 recommended to yyprint to steal internal variables...
 
  90 I think this is a pleasant (but useless currently) feature, but in the
 
  91 future, I want a means to %include other bits of grammars, and _then_
 
  92 it will be important for the various bits to define their needs in
 
  95 When implementing multiple-%union support, bare the following in mind:
 
  97 - when --yacc, this must be flagged as an error.  Don't make it fatal
 
 100 - The #line must now appear *inside* the definition of yystype.
 
 111 It should be possible to have %if/%else/%endif.  The implementation is
 
 112 not clear: should it be lexical or syntactic.  Vadim Maslow thinks it
 
 113 must be in the scanner: we must not parse what is in a switched off
 
 114 part of %if.  Akim Demaille thinks it should be in the parser, so as
 
 115 to avoid falling into another CPP mistake.
 
 117 ** -D, --define-muscle NAME=VALUE
 
 118 To define muscles via cli.  Or maybe support directly NAME=VALUE?
 
 121 There are couple of available extensions of Bison targeting some XML
 
 122 output.  Some day we should consider including them.  One issue is
 
 123 that they seem to be quite orthogonal to the parsing technique, and
 
 124 seem to depend mostly on the possibility to have some code triggered
 
 125 for each reduction.  As a matter of fact, such hooks could also be
 
 126 used to generate the yydebug traces.  Some generic scheme probably
 
 129 XML output for GNU Bison and gcc
 
 130    http://www.cs.may.ie/~jpower/Research/bisonXML/
 
 132 XML output for GNU Bison
 
 133    http://yaxx.sourceforge.net/
 
 136 Maybe we could expand unit rules, i.e., transform
 
 144         exp: exp '+' exp | exp '&' exp;
 
 146 when there are no actions.  This can significantly speed up some
 
 147 grammars.  I can't find the papers.  In particular the book `LR
 
 148 parsing: Theory and Practice' is impossible to find, but according to
 
 149 `Parsing Techniques: a Practical Guide', it includes information about
 
 150 this issue.  Does anybody have it?
 
 156 ** History/Bibliography
 
 157 Some history of Bison and some bibliography would be most welcome.
 
 158 Are there any Texinfo standards for bibliography?
 
 162 * Java, Fortran, etc.
 
 167 There are a couple of proposed outputs:
 
 170   which is based on Byacc.
 
 171   <http://troi.lincom-asg.com/~rjamison/byacc/>
 
 174   which is based on Bison.
 
 175   <http://www.goice.co.jp/member/mo/hack-progs/bison-java.html>
 
 177 Sebastien Serrurier (serrur_s@epita.fr) is working on this: he is
 
 178 expected to contact the authors, design the output, and implement it
 
 182 * Coding system independence
 
 185         Currently Bison assumes 8-bit bytes (i.e. that UCHAR_MAX is
 
 186         255).  It also assumes that the 8-bit character encoding is
 
 187         the same for the invocation of 'bison' as it is for the
 
 188         invocation of 'cc', but this is not necessarily true when
 
 189         people run bison on an ASCII host and then use cc on an EBCDIC
 
 190         host.  I don't think these topics are worth our time
 
 191         addressing (unless we find a gung-ho volunteer for EBCDIC or
 
 192         PDP-10 ports :-) but they should probably be documented
 
 203 ** Skeleton strategy.   []
 
 204 Must we keep %no-parser?
 
 208 Find the best graph parameters. []
 
 212 informations about ERROR_VERBOSE.       []
 
 213 ** Add explanations about
 
 218 ** tests/pure-parser.at []
 
 222 See if we can integrate backtracking in Bison.  Charles-Henri de
 
 223 Boysson <de-boy_c@epita.fr> is working on this, and already has some
 
 224 results.  Vadim Maslow, the maintainer of BTYacc was contacted, and we
 
 225 stay in touch with him.  Adjusting the Bison grammar parser will be
 
 226 needed to support some extra BTYacc features.  This is less urgent.
 
 228 ** Keeping the conflicted actions
 
 229 First, analyze the differences between byacc and btyacc (I'm referring
 
 230 to the executables).  Find where the conflicts are preserved.
 
 232 ** Compare with the GLR tables
 
 233 See how isomorphic the way BTYacc and the way the GLR adjustments in
 
 234 Bison are compatible.  *As much as possible* one should try to use the
 
 235 same implementation in the Bison executables.  I insist: it should be
 
 236 very feasible to use the very same conflict tables.
 
 238 ** Adjust the skeletons
 
 239 Import the skeletons for C and C++.
 
 241 ** Improve the skeletons
 
 242 Have them support yysymprint, yydestruct and so forth.
 
 248 It is unfortunate that there is a total order for precedence.  It
 
 249 makes it impossible to have modular precedence information.  We should
 
 250 move to partial orders (sounds like series/parallel orders to me).
 
 252 This will be possible with a Bison parser for the grammar, as it will
 
 253 make it much easier to extend the grammar.
 
 255 ** Correlation b/w precedence and associativity
 
 256 Also, I fail to understand why we have to assign the same
 
 257 associativity to operators with the same precedence.  For instance,
 
 258 why can't I decide that the precedence of * and / is the same, but the
 
 261 If there is really no profound motivation, we should find a new syntax
 
 262 to allow specifying this.
 
 265 See if we can use precedence between rules to solve RR conflicts.  See
 
 271 - If the Bison generated parser experiences an undefined number in the
 
 272 character range, that character is written out in diagnostic messages, an
 
 273 addition to the $undefined value.
 
 275 Suggest: Change the name $undefined to undefined; looks better in outputs.
 
 280 - For use with my C++ parser, I transported the "switch (yyn)" statement
 
 281 that Bison writes to the bison.simple skeleton file. This way, I can remove
 
 282 the current default rule $$ = $1 implementation, which causes a double
 
 283 assignment to $$ which may not be OK under C++, replacing it with a
 
 284 "default:" part within the switch statement.
 
 286 Note that the default rule $$ = $1, when typed, is perfectly OK under C,
 
 287 but in the C++ implementation I made, this rule is different from
 
 288 $<type_name>$ = $<type_name>1. I therefore think that one should implement
 
 289 a Bison option where every typed default rule is explicitly written out
 
 290 (same typed ruled can of course be grouped together).
 
 292 Note: Robert Anisko handles this.  He knows how to do it.
 
 296 It would be nice to have warning support.  See how Autoconf handles
 
 297 them, it is fairly well described there.  It would be very nice to
 
 298 implement this in such a way that other programs could use
 
 301 Don't work on this without first announcing you do, as I already have
 
 302 thought about it, and know many of the components that can be used to
 
 306 * Pre and post actions.
 
 307 From: Florian Krohm <florian@edamail.fishkill.ibm.com>
 
 308 Subject: YYACT_EPILOGUE
 
 309 To: bug-bison@gnu.org
 
 310 X-Sent: 1 week, 4 days, 14 hours, 38 minutes, 11 seconds ago
 
 312 The other day I had the need for explicitly building the parse tree. I
 
 313 used %locations for that and defined YYLLOC_DEFAULT to call a function
 
 314 that returns the tree node for the production. Easy. But I also needed
 
 315 to assign the S-attribute to the tree node. That cannot be done in
 
 316 YYLLOC_DEFAULT, because it is invoked before the action is executed.
 
 317 The way I solved this was to define a macro YYACT_EPILOGUE that would
 
 318 be invoked after the action. For reasons of symmetry I also added
 
 319 YYACT_PROLOGUE. Although I had no use for that I can envision how it
 
 320 might come in handy for debugging purposes.
 
 321 All is needed is to add
 
 324     YYACT_EPILOGUE (yyval, (yyvsp - yylen), yylen, yyloc, (yylsp - yylen));
 
 326     YYACT_EPILOGUE (yyval, (yyvsp - yylen), yylen);
 
 329 at the proper place to bison.simple. Ditto for YYACT_PROLOGUE.
 
 331 I was wondering what you think about adding YYACT_PROLOGUE/EPILOGUE
 
 332 to bison. If you're interested, I'll work on a patch.
 
 335 Well, VCG seems really dead.  Move to Graphviz instead.  Also, equip
 
 336 the parser with a means to create the (visual) parse tree.
 
 340 Copyright (C) 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
 
 342 This file is part of GNU Bison.
 
 344 GNU Bison is free software; you can redistribute it and/or modify
 
 345 it under the terms of the GNU General Public License as published by
 
 346 the Free Software Foundation; either version 2, or (at your option)
 
 349 GNU Bison is distributed in the hope that it will be useful,
 
 350 but WITHOUT ANY WARRANTY; without even the implied warranty of
 
 351 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 
 352 GNU General Public License for more details.
 
 354 You should have received a copy of the GNU General Public License
 
 355 along with Bison; see the file COPYING.  If not, write to
 
 356 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 
 357 Boston, MA 02111-1307, USA.