]> git.saurik.com Git - bison.git/blob - TODO
Remove.
[bison.git] / TODO
1 -*- outline -*-
2
3 * Several %unions
4 I think this is a pleasant (but useless currently) feature, but in the
5 future, I want a means to %include other bits of grammars, and _then_
6 it will be important for the various bits to define their needs in
7 %union.
8
9 When implementing multiple-%union support, bare the following in mind:
10
11 - when --yacc, this must be flagged as an error. Don't make it fatal
12 though.
13
14 - The #line must now appear *inside* the definition of yystype.
15 Something like
16
17 {
18 #line 12 "foo.y"
19 int ival;
20 #line 23 "foo.y"
21 char *sval;
22 }
23
24 * Experimental report features
25 Decide whether they should be enabled, or optional. For instance, on:
26
27 input:
28 exp
29 | input exp
30 ;
31
32 exp:
33 token1 "1"
34 | token2 "2"
35 | token3 "3"
36 ;
37
38 token1: token;
39 token2: token;
40 token3: token;
41
42 the traditional Bison reports:
43
44 state 0
45
46 $axiom -> . input $ (rule 0)
47
48 token shift, and go to state 1
49
50 input go to state 2
51 exp go to state 3
52 token1 go to state 4
53 token2 go to state 5
54 token3 go to state 6
55
56 state 1
57
58 token1 -> token . (rule 6)
59 token2 -> token . (rule 7)
60 token3 -> token . (rule 8)
61
62 "2" reduce using rule 7 (token2)
63 "3" reduce using rule 8 (token3)
64 $default reduce using rule 6 (token1)
65
66 while with --trace, i.e., when enabling both the display of non-core
67 item sets and the display of lookaheads, Bison now displays:
68
69 state 0
70
71 $axiom -> . input $ (rule 0)
72 input -> . exp (rule 1)
73 input -> . input exp (rule 2)
74 exp -> . token1 "1" (rule 3)
75 exp -> . token2 "2" (rule 4)
76 exp -> . token3 "3" (rule 5)
77 token1 -> . token (rule 6)
78 token2 -> . token (rule 7)
79 token3 -> . token (rule 8)
80
81 token shift, and go to state 1
82
83 input go to state 2
84 exp go to state 3
85 token1 go to state 4
86 token2 go to state 5
87 token3 go to state 6
88
89 state 1
90
91 token1 -> token . ["1"] (rule 6)
92 token2 -> token . ["2"] (rule 7)
93 token3 -> token . ["3"] (rule 8)
94
95 "2" reduce using rule 7 (token2)
96 "3" reduce using rule 8 (token3)
97 $default reduce using rule 6 (token1)
98
99 so decide whether this should be an option, or always enabled. I'm in
100 favor of making it the default, but maybe we should tune the output to
101 distinguish core item sets from non core:
102
103 state 0
104 Core:
105 $axiom -> . input $ (rule 0)
106
107 Derived:
108 input -> . exp (rule 1)
109 input -> . input exp (rule 2)
110 exp -> . token1 "1" (rule 3)
111 exp -> . token2 "2" (rule 4)
112 exp -> . token3 "3" (rule 5)
113 token1 -> . token (rule 6)
114 token2 -> . token (rule 7)
115 token3 -> . token (rule 8)
116
117 token shift, and go to state 1
118
119 input go to state 2
120 exp go to state 3
121 token1 go to state 4
122 token2 go to state 5
123 token3 go to state 6
124
125
126 Note that the same questions applies to --graph.
127
128 * Coding system independence
129 Paul notes:
130
131 Currently Bison assumes 8-bit bytes (i.e. that UCHAR_MAX is
132 255). It also assumes that the 8-bit character encoding is
133 the same for the invocation of 'bison' as it is for the
134 invocation of 'cc', but this is not necessarily true when
135 people run bison on an ASCII host and then use cc on an EBCDIC
136 host. I don't think these topics are worth our time
137 addressing (unless we find a gung-ho volunteer for EBCDIC or
138 PDP-10 ports :-) but they should probably be documented
139 somewhere.
140
141 * Output directory
142 Akim:
143
144 | I consider this to be a bug in bison:
145 |
146 | /tmp % mkdir src
147 | /tmp % cp ~/src/bison/tests/calc.y src
148 | /tmp % mkdir build && cd build
149 | /tmp/build % bison ../src/calc.y
150 | /tmp/build % cd ..
151 | /tmp % ls -l build src
152 | build:
153 | total 0
154 |
155 | src:
156 | total 32
157 | -rw-r--r-- 1 akim lrde 27553 oct 2 16:31 calc.tab.c
158 | -rw-r--r-- 1 akim lrde 3335 oct 2 16:31 calc.y
159 |
160 |
161 | Would it be safe to change this behavior to something more reasonable?
162 | Do you think some people depend upon this?
163
164 Jim:
165
166 Is it that behavior documented?
167 If so, then it's probably not reasonable to change it.
168 I've Cc'd the automake list, because some of automake's
169 rules use bison through $(YACC) -- though I'll bet they
170 all use it in yacc-compatible mode.
171
172 Pavel:
173
174 Hello, Jim and others!
175
176 > Is it that behavior documented?
177 > If so, then it's probably not reasonable to change it.
178 > I've Cc'd the automake list, because some of automake's
179 > rules use bison through $(YACC) -- though I'll bet they
180 > all use it in yacc-compatible mode.
181
182 Yes, Automake currently used bison in Automake-compatible mode, but it
183 would be fair for Automake to switch to the native mode as long as the
184 processed files are distributed and "missing" emulates bison.
185
186 In any case, the makefiles should specify the output file explicitly
187 instead of relying on weird defaults.
188
189 > | src:
190 > | total 32
191 > | -rw-r--r-- 1 akim lrde 27553 oct 2 16:31 calc.tab.c
192 > | -rw-r--r-- 1 akim lrde 3335 oct 2 16:31 calc.y
193
194 This is not _that_ ugly as it seems - with Automake you want to put
195 sources where they belong - to the source directory.
196
197 > | This is not _that_ ugly as it seems - with Automake you want to put
198 > | sources where they belong - to the source directory.
199 >
200 > The difference source/build you are referring to is based on Automake
201 > concepts. They have no sense at all for tools such as bison or gcc
202 > etc. They have input and output. I do not want them to try to grasp
203 > source/build. I want them to behave uniformly: output *here*.
204
205 I realize that.
206
207 It's unfortunate that the native mode of Bison behaves in a less uniform
208 way than the yacc mode. I agree with your point. Bison maintainters may
209 want to fix it along with the documentation.
210
211
212 * Unit rules
213 Maybe we could expand unit rules, i.e., transform
214
215 exp: arith | bool;
216 arith: exp '+' exp;
217 bool: exp '&' exp;
218
219 into
220
221 exp: exp '+' exp | exp '&' exp;
222
223 when there are no actions. This can significantly speed up some
224 grammars.
225
226 * Stupid error messages
227 An example shows it easily:
228
229 src/bison/tests % ./testsuite -k calc,location,error-verbose -l
230 GNU Bison 1.49a test suite test groups:
231
232 NUM: FILENAME:LINE TEST-GROUP-NAME
233 KEYWORDS
234
235 51: calc.at:440 Calculator --locations --yyerror-verbose
236 52: calc.at:442 Calculator --defines --locations --name-prefix=calc --verbose --yacc --yyerror-verbose
237 54: calc.at:445 Calculator --debug --defines --locations --name-prefix=calc --verbose --yacc --yyerror-verbose
238 src/bison/tests % ./testsuite 51 -d
239 ## --------------------------- ##
240 ## GNU Bison 1.49a test suite. ##
241 ## --------------------------- ##
242 51: calc.at:440 ok
243 ## ---------------------------- ##
244 ## All 1 tests were successful. ##
245 ## ---------------------------- ##
246 src/bison/tests % cd ./testsuite.dir/51
247 tests/testsuite.dir/51 % echo "()" | ./calc
248 1.2-1.3: parse error, unexpected ')', expecting error or "number" or '-' or '('
249
250 * yyerror, yyprint interface
251 It should be improved, in particular when using Bison features such as
252 locations, and YYPARSE_PARAMS. For the time being, it is recommended
253 to #define yyerror and yyprint to steal internal variables...
254
255 * read_pipe.c
256 This is not portable to DOS for instance. Implement a more portable
257 scheme. Sources of inspiration include GNU diff, and Free Recode.
258
259 * Memory leaks in the generator
260 A round of memory leak clean ups would be most welcome. Dmalloc,
261 Checker GCC, Electric Fence, or Valgrind: you chose your tool.
262
263 * Memory leaks in the parser
264 The same applies to the generated parsers. In particular, this is
265 critical for user data: when aborting a parsing, when handling the
266 error token etc., we often throw away yylval without giving a chance
267 of cleaning it up to the user.
268
269 * --graph
270 Show reductions. []
271
272 * Broken options ?
273 ** %no-lines [ok]
274 ** %no-parser []
275 ** %pure-parser []
276 ** %token-table []
277 ** Options which could use parse_dquoted_param ().
278 Maybe transfered in lex.c.
279 *** %skeleton [ok]
280 *** %output []
281 *** %file-prefix []
282 *** %name-prefix []
283
284 ** Skeleton strategy. []
285 Must we keep %no-parser?
286 %token-table?
287 *** New skeletons. []
288
289 * src/print_graph.c
290 Find the best graph parameters. []
291
292 * doc/bison.texinfo
293 ** Update
294 informations about ERROR_VERBOSE. []
295 ** Add explainations about
296 skeleton muscles. []
297 %skeleton. []
298
299 * testsuite
300 ** tests/pure-parser.at []
301 New tests.
302
303 * Debugging parsers
304
305 From Greg McGary:
306
307 akim demaille <akim.demaille@epita.fr> writes:
308
309 > With great pleasure! Nonetheless, things which are debatable
310 > (or not, but just `big') should be discuss in `public': something
311 > like help- or bug-bison@gnu.org is just fine. Jesse and I are there,
312 > but there is also Jim and some other people.
313
314 I have no idea whether it qualifies as big or controversial, so I'll
315 just summarize for you. I proposed this change years ago and was
316 surprised that it was met with utter indifference!
317
318 This debug feature is for the programs/grammars one develops with
319 bison, not for debugging bison itself. I find that the YYDEBUG
320 output comes in a very inconvenient format for my purposes.
321 When debugging gcc, for instance, what I want is to see a trace of
322 the sequence of reductions and the line#s for the semantic actions
323 so I can follow what's happening. Single-step in gdb doesn't cut it
324 because to move from one semantic action to the next takes you through
325 lots of internal machinery of the parser, which is uninteresting.
326
327 The change I made was to the format of the debug output, so that it
328 comes out in the format of C error messages, digestible by emacs
329 compile mode, like so:
330
331 grammar.y:1234: foo: bar(0x123456) baz(0x345678)
332
333 where "foo: bar baz" is the reduction rule, whose semantic action
334 appears on line 1234 of the bison grammar file grammar.y. The hex
335 numbers on the rhs tokens are the parse-stack values associated with
336 those tokens. Of course, yytype might be something totally
337 incompatible with that representation, but for the most part, yytype
338 values are single words (scalars or pointers). In the case of gcc,
339 they're most often pointers to tree nodes. Come to think of it, the
340 right thing to do is to make the printing of stack values be
341 user-definable. It would also be useful to include the filename &
342 line# of the file being parsed, but the main filename & line# should
343 continue to be that of grammar.y
344
345 Anyway, this feature has saved my life on numerous occasions. The way
346 I customarily use it is to first run bison with the traces on, isolate
347 the sequence of reductions that interests me, put those traces in a
348 buffer and force it into compile-mode, then visit each of those lines
349 in the grammar and set breakpoints with C-x SPACE. Then, I can run
350 again under the control of gdb and stop at each semantic action.
351 With the hex addresses of tree nodes, I can inspect the values
352 associated with any rhs token.
353
354 You like?
355
356 * input synclines
357 Some users create their foo.y files, and equip them with #line. Bison
358 should recognize these, and preserve them.
359
360 * BTYacc
361 See if we can integrate backtracking in Bison. Contact the BTYacc
362 maintainers.
363
364 * Automaton report
365 Display more clearly the lookaheads for each item.
366
367 * RR conflicts
368 See if we can use precedence between rules to solve RR conflicts. See
369 what POSIX says.
370
371 * Precedence
372 It is unfortunate that there is a total order for precedence. It
373 makes it impossible to have modular precedence information. We should
374 move to partial orders.
375
376 This will be possible with a Bison parser for the grammar, as it will
377 make it much easier to extend the grammar.
378
379 * Parsing grammars
380 Rewrite the reader in Flex/Bison. There will be delicate parts, in
381 particular, expect the scanner to be hard to write. Many interesting
382 features cannot be implemented without such a new reader.
383
384 * Presentation of the report file
385 From: "Baum, Nathan I" <s0009525@chelt.ac.uk>
386 Subject: Token Alias Bug
387 To: "'bug-bison@gnu.org'" <bug-bison@gnu.org>
388
389 I've also noticed something, that whilst not *wrong*, is inconvienient: I
390 use the verbose mode to help find the causes of unresolved shift/reduce
391 conflicts. However, this mode insists on starting the .output file with a
392 list of *resolved* conflicts, something I find quite useless. Might it be
393 possible to define a -v mode, and a -vv mode -- Where the -vv mode shows
394 everything, but the -v mode only tells you what you need for examining
395 conflicts? (Or, perhaps, a "*** This state has N conflicts ***" marker above
396 each state with conflicts.)
397
398 * $undefined
399 From Hans:
400 - If the Bison generated parser experiences an undefined number in the
401 character range, that character is written out in diagnostic messages, an
402 addition to the $undefined value.
403
404 Suggest: Change the name $undefined to undefined; looks better in outputs.
405
406 * Default Action
407 From Hans:
408 - For use with my C++ parser, I transported the "switch (yyn)" statement
409 that Bison writes to the bison.simple skeleton file. This way, I can remove
410 the current default rule $$ = $1 implementation, which causes a double
411 assignment to $$ which may not be OK under C++, replacing it with a
412 "default:" part within the switch statement.
413
414 Note that the default rule $$ = $1, when typed, is perfectly OK under C,
415 but in the C++ implementation I made, this rule is different from
416 $<type_name>$ = $<type_name>1. I therefore think that one should implement
417 a Bison option where every typed default rule is explicitly written out
418 (same typed ruled can of course be grouped together).
419
420 Note: Robert Anisko handles this. He knows how to do it.
421
422 * Documenting C++ output
423 Write a first documentation for C++ output.
424
425 * Warnings
426 It would be nice to have warning support. See how Autoconf handles
427 them, it is fairly well described there. It would be very nice to
428 implement this in such a way that other programs could use
429 lib/warnings.[ch].
430
431 Don't work on this without first announcing you do, as I already have
432 thought about it, and know many of the components that can be used to
433 implement it.
434
435 * Pre and post actions.
436 From: Florian Krohm <florian@edamail.fishkill.ibm.com>
437 Subject: YYACT_EPILOGUE
438 To: bug-bison@gnu.org
439 X-Sent: 1 week, 4 days, 14 hours, 38 minutes, 11 seconds ago
440
441 The other day I had the need for explicitly building the parse tree. I
442 used %locations for that and defined YYLLOC_DEFAULT to call a function
443 that returns the tree node for the production. Easy. But I also needed
444 to assign the S-attribute to the tree node. That cannot be done in
445 YYLLOC_DEFAULT, because it is invoked before the action is executed.
446 The way I solved this was to define a macro YYACT_EPILOGUE that would
447 be invoked after the action. For reasons of symmetry I also added
448 YYACT_PROLOGUE. Although I had no use for that I can envision how it
449 might come in handy for debugging purposes.
450 All is needed is to add
451
452 #if YYLSP_NEEDED
453 YYACT_EPILOGUE (yyval, (yyvsp - yylen), yylen, yyloc, (yylsp - yylen));
454 #else
455 YYACT_EPILOGUE (yyval, (yyvsp - yylen), yylen);
456 #endif
457
458 at the proper place to bison.simple. Ditto for YYACT_PROLOGUE.
459
460 I was wondering what you think about adding YYACT_PROLOGUE/EPILOGUE
461 to bison. If you're interested, I'll work on a patch.
462
463 -----
464
465 Copyright (C) 2001, 2002 Free Software Foundation, Inc.
466
467 This file is part of GNU Autoconf.
468
469 GNU Autoconf is free software; you can redistribute it and/or modify
470 it under the terms of the GNU General Public License as published by
471 the Free Software Foundation; either version 2, or (at your option)
472 any later version.
473
474 GNU Autoconf is distributed in the hope that it will be useful,
475 but WITHOUT ANY WARRANTY; without even the implied warranty of
476 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
477 GNU General Public License for more details.
478
479 You should have received a copy of the GNU General Public License
480 along with autoconf; see the file COPYING. If not, write to
481 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
482 Boston, MA 02111-1307, USA.