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