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