TODO

   1 -*- outline -*-
   2
   3 * Header guards
   4
   5 From Franc,ois: should we keep the directory part in the CPP guard?
   6
   7
   8 * URGENT: Documenting C++ output
   9 Write a first documentation for C++ output.
  10
  11
  12 * Documentation
  13 Before releasing, make sure the documentation refers to the current
  14 `output' format.
  15
  16
  17 * Error messages
  18 Some are really funky.  For instance
  19
  20         type clash (`%s' `%s') on default action
  21
  22 is really weird.  Revisit them all.
  23
  24
  25 * read_pipe.c
  26 This is not portable to DOS for instance.  Implement a more portable
  27 scheme.  Sources of inspiration include GNU diff, and Free Recode.
  28
  29
  30 * value_components_used
  31 Was defined but not used: where was it coming from?  It can't be to
  32 check if %union is used, since the user is free to $<foo>n on her
  33 union, doesn't she?
  34
  35
  36 * Report
  37
  38 **  GLR
  39 How would Paul like to display the conflicted actions?  In particular,
  40 what when two reductions are possible on a given lookahead, but one is
  41 part of $default.  Should we make the two reductions explicit, or just
  42 keep $default?  See the following point.
  43
  44 ** Disabled Reductions
  45 See `tests/conflicts.at (Defaulted Conflicted Reduction)', and decide
  46 what we want to do.
  47
  48 ** Documentation
  49 Extend with error productions.  The hard part will probably be finding
  50 the right rule so that a single state does not exhibit too many yet
  51 undocumented ``features''.  Maybe an empty action ought to be
  52 presented too.  Shall we try to make a single grammar with all these
  53 features, or should we have several very small grammars?
  54
  55 ** --report=conflict-path
  56 Provide better assistance for understanding the conflicts by providing
  57 a sample text exhibiting the (LALR) ambiguity.  See the paper from
  58 DeRemer and Penello: they already provide the algorithm.
  59
  60
  61 * Extensions
  62
  63 ** yyerror, yysymprint interface
  64 It should be improved, in particular when using Bison features such as
  65 locations, and YYPARSE_PARAMS.  For the time being, it is recommended
  66 to #define yyerror and yyprint to steal internal variables...
  67
  68 ** Several %unions
  69 I think this is a pleasant (but useless currently) feature, but in the
  70 future, I want a means to %include other bits of grammars, and _then_
  71 it will be important for the various bits to define their needs in
  72 %union.
  73
  74 When implementing multiple-%union support, bare the following in mind:
  75
  76 - when --yacc, this must be flagged as an error.  Don't make it fatal
  77   though.
  78
  79 - The #line must now appear *inside* the definition of yystype.
  80   Something like
  81
  82         {
  83         #line 12 "foo.y"
  84           int ival;
  85         #line 23 "foo.y"
  86           char *sval;
  87         }
  88
  89 * Unit rules
  90 Maybe we could expand unit rules, i.e., transform
  91
  92         exp: arith | bool;
  93         arith: exp '+' exp;
  94         bool: exp '&' exp;
  95
  96 into
  97
  98         exp: exp '+' exp | exp '&' exp;
  99
 100 when there are no actions.  This can significantly speed up some
 101 grammars.  I can't find the papers.  In particular the book `LR
 102 parsing: Theory and Practice' is impossible to find, but according to
 103 `Parsing Techniques: a Practical Guide', it includes information about
 104 this issue.  Does anybody have it?
 105
 106
 107
 108 * Documentation
 109
 110 ** History/Bibliography
 111 Some history of Bison and some bibliography would be most welcome.
 112 Are there any Texinfo standards for bibliography?
 113
 114
 115
 116 * Java, Fortran, etc.
 117
 118
 119 ** Java
 120
 121 There are a couple of proposed outputs:
 122
 123 - BYACC/J
 124   which is based on Byacc.
 125   <http://troi.lincom-asg.com/~rjamison/byacc/>
 126
 127 - Bison Java
 128   which is based on Bison.
 129   <http://www.goice.co.jp/member/mo/hack-progs/bison-java.html>
 130
 131 Sébastien Serrurier (serrur_s@epita.fr) is working on this: he is
 132 expected to contact the authors, design the output, and implement it
 133 into Bison.
 134
 135
 136 * Coding system independence
 137 Paul notes:
 138
 139         Currently Bison assumes 8-bit bytes (i.e. that UCHAR_MAX is
 140         255).  It also assumes that the 8-bit character encoding is
 141         the same for the invocation of 'bison' as it is for the
 142         invocation of 'cc', but this is not necessarily true when
 143         people run bison on an ASCII host and then use cc on an EBCDIC
 144         host.  I don't think these topics are worth our time
 145         addressing (unless we find a gung-ho volunteer for EBCDIC or
 146         PDP-10 ports :-) but they should probably be documented
 147         somewhere.
 148
 149
 150
 151 * --graph
 152 Show reductions.        []
 153
 154 * Broken options ?
 155 ** %no-lines            [ok]
 156 ** %no-parser           []
 157 ** %pure-parser         []
 158 ** %token-table         []
 159 ** Options which could use parse_dquoted_param ().
 160 Maybe transferred in lex.c.
 161 *** %skeleton           [ok]
 162 *** %output             []
 163 *** %file-prefix        []
 164 *** %name-prefix        []
 165
 166 ** Skeleton strategy.   []
 167 Must we keep %no-parser?
 168              %token-table?
 169 *** New skeletons.      []
 170
 171 * src/print_graph.c
 172 Find the best graph parameters. []
 173
 174 * doc/bison.texinfo
 175 ** Update
 176 informations about ERROR_VERBOSE.       []
 177 ** Add explanations about
 178 skeleton muscles.       []
 179 %skeleton.              []
 180
 181 * testsuite
 182 ** tests/pure-parser.at []
 183 New tests.
 184
 185 * input synclines
 186 Some users create their foo.y files, and equip them with #line.  Bison
 187 should recognize these, and preserve them.
 188
 189 * BTYacc
 190 See if we can integrate backtracking in Bison.  Contact the BTYacc
 191 maintainers.
 192
 193 ** Keeping the conflicted actions
 194 First, analyze the differences between byacc and btyacc (I'm referring
 195 to the executables).  Find where the conflicts are preserved.
 196
 197 ** Compare with the GLR tables
 198 See how isomorphic the way BTYacc and the way the GLR adjustments in
 199 Bison are compatible.  *As much as possible* one should try to use the
 200 same implementation in the Bison executables.  I insist: it should be
 201 very feasible to use the very same conflict tables.
 202
 203 ** Adjust the skeletons
 204 Import the skeletons for C and C++.
 205
 206 ** Improve the skeletons
 207 Have them support yysymprint, yydestruct and so forth.
 208
 209
 210 * Precedence
 211
 212 ** Partial order
 213 It is unfortunate that there is a total order for precedence.  It
 214 makes it impossible to have modular precedence information.  We should
 215 move to partial orders (sounds like series/parallel orders to me).
 216
 217 This will be possible with a Bison parser for the grammar, as it will
 218 make it much easier to extend the grammar.
 219
 220 ** Correlation b/w precedence and associativity
 221 Also, I fail to understand why we have to assign the same
 222 associativity to operators with the same precedence.  For instance,
 223 why can't I decide that the precedence of * and / is the same, but the
 224 latter is nonassoc?
 225
 226 If there is really no profound motivation, we should find a new syntax
 227 to allow specifying this.
 228
 229 ** RR conflicts
 230 See if we can use precedence between rules to solve RR conflicts.  See
 231 what POSIX says.
 232
 233
 234 * $undefined
 235 From Hans:
 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.
 239
 240 Suggest: Change the name $undefined to undefined; looks better in outputs.
 241
 242
 243 * Default Action
 244 From Hans:
 245 - For use with my C++ parser, I transported the "switch (yyn)" statement
 246 that Bison writes to the bison.simple skeleton file. This way, I can remove
 247 the current default rule $$ = $1 implementation, which causes a double
 248 assignment to $$ which may not be OK under C++, replacing it with a
 249 "default:" part within the switch statement.
 250
 251 Note that the default rule $$ = $1, when typed, is perfectly OK under C,
 252 but in the C++ implementation I made, this rule is different from
 253 $<type_name>$ = $<type_name>1. I therefore think that one should implement
 254 a Bison option where every typed default rule is explicitly written out
 255 (same typed ruled can of course be grouped together).
 256
 257 Note: Robert Anisko handles this.  He knows how to do it.
 258
 259
 260 * Warnings
 261 It would be nice to have warning support.  See how Autoconf handles
 262 them, it is fairly well described there.  It would be very nice to
 263 implement this in such a way that other programs could use
 264 lib/warnings.[ch].
 265
 266 Don't work on this without first announcing you do, as I already have
 267 thought about it, and know many of the components that can be used to
 268 implement it.
 269
 270
 271 * Pre and post actions.
 272 From: Florian Krohm <florian@edamail.fishkill.ibm.com>
 273 Subject: YYACT_EPILOGUE
 274 To: bug-bison@gnu.org
 275 X-Sent: 1 week, 4 days, 14 hours, 38 minutes, 11 seconds ago
 276
 277 The other day I had the need for explicitly building the parse tree. I
 278 used %locations for that and defined YYLLOC_DEFAULT to call a function
 279 that returns the tree node for the production. Easy. But I also needed
 280 to assign the S-attribute to the tree node. That cannot be done in
 281 YYLLOC_DEFAULT, because it is invoked before the action is executed.
 282 The way I solved this was to define a macro YYACT_EPILOGUE that would
 283 be invoked after the action. For reasons of symmetry I also added
 284 YYACT_PROLOGUE. Although I had no use for that I can envision how it
 285 might come in handy for debugging purposes.
 286 All is needed is to add
 287
 288 #if YYLSP_NEEDED
 289     YYACT_EPILOGUE (yyval, (yyvsp - yylen), yylen, yyloc, (yylsp - yylen));
 290 #else
 291     YYACT_EPILOGUE (yyval, (yyvsp - yylen), yylen);
 292 #endif
 293
 294 at the proper place to bison.simple. Ditto for YYACT_PROLOGUE.
 295
 296 I was wondering what you think about adding YYACT_PROLOGUE/EPILOGUE
 297 to bison. If you're interested, I'll work on a patch.
 298
 299 * Move to Graphviz
 300 Well, VCG seems really dead.  Move to Graphviz instead.  Also, equip
 301 the parser with a means to create the (visual) parse tree.
 302
 303 -----
 304
 305 Copyright (C) 2001, 2002 Free Software Foundation, Inc.
 306
 307 This file is part of GNU Bison.
 308
 309 GNU Bison is free software; you can redistribute it and/or modify
 310 it under the terms of the GNU General Public License as published by
 311 the Free Software Foundation; either version 2, or (at your option)
 312 any later version.
 313
 314 GNU Bison is distributed in the hope that it will be useful,
 315 but WITHOUT ANY WARRANTY; without even the implied warranty of
 316 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 317 GNU General Public License for more details.
 318
 319 You should have received a copy of the GNU General Public License
 320 along with Bison; see the file COPYING.  If not, write to
 321 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 322 Boston, MA 02111-1307, USA.