]>
Commit | Line | Data |
---|---|---|
416bd7a9 MA |
1 | -*- outline -*- |
2 | ||
3c146b5e AD |
3 | * Header guards |
4 | ||
32f0598d | 5 | From Franc,ois: should we keep the directory part in the CPP guard? |
3c146b5e AD |
6 | |
7 | ||
c19988b7 AD |
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 | ||
efea6231 AD |
15 | * URGENT: Documenting C++ output |
16 | Write a first documentation for C++ output. | |
17 | ||
bc933ef1 | 18 | |
88bce5a2 | 19 | * Documentation |
959e5f51 AD |
20 | Before releasing, make sure the documentation ("Understanding your |
21 | parser") refers to the current `output' format. | |
88bce5a2 AD |
22 | |
23 | ||
d43baf71 AD |
24 | * GLR & C++ |
25 | Currently, the GLR parser cannot compile with a C++ compiler. | |
26 | ||
27 | ||
2ab9a04f | 28 | * Report |
ec3bc396 | 29 | |
2ab9a04f AD |
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. | |
d7215705 | 35 | |
2ab9a04f AD |
36 | ** Disabled Reductions |
37 | See `tests/conflicts.at (Defaulted Conflicted Reduction)', and decide | |
38 | what we want to do. | |
d7215705 | 39 | |
2ab9a04f | 40 | ** Documentation |
bc933ef1 AD |
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? | |
ec3bc396 | 46 | |
2ab9a04f AD |
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 | ||
ec3bc396 | 52 | |
948be909 | 53 | * Extensions |
2ab9a04f | 54 | |
959e5f51 AD |
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 | ||
959e5f51 | 84 | ** yysymprint interface |
2ab9a04f | 85 | It should be improved, in particular when using Bison features such as |
959e5f51 AD |
86 | locations, and YYPARSE_PARAMS. For the time being, it is almost |
87 | recommended to yyprint to steal internal variables... | |
2ab9a04f AD |
88 | |
89 | ** Several %unions | |
6cbfbcc5 AD |
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 | |
93 | %union. | |
76551463 | 94 | |
5c0a0514 AD |
95 | When 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 | ||
f0e48240 AD |
110 | ** %if and the like |
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. | |
116 | ||
117 | ** -D, --define-muscle NAME=VALUE | |
118 | To define muscles via cli. Or maybe support directly NAME=VALUE? | |
119 | ||
ca752c34 AD |
120 | ** XML Output |
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 | |
127 | exists in there. | |
128 | ||
129 | XML output for GNU Bison and gcc | |
130 | http://www.cs.may.ie/~jpower/Research/bisonXML/ | |
131 | ||
132 | XML output for GNU Bison | |
133 | http://yaxx.sourceforge.net/ | |
f0e48240 | 134 | |
fa770c86 AD |
135 | * Unit rules |
136 | Maybe we could expand unit rules, i.e., transform | |
137 | ||
138 | exp: arith | bool; | |
139 | arith: exp '+' exp; | |
140 | bool: exp '&' exp; | |
141 | ||
142 | into | |
143 | ||
144 | exp: exp '+' exp | exp '&' exp; | |
145 | ||
146 | when there are no actions. This can significantly speed up some | |
d7215705 AD |
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? | |
fa770c86 | 151 | |
51dec47b | 152 | |
51dec47b | 153 | |
2ab9a04f | 154 | * Documentation |
51dec47b | 155 | |
2ab9a04f AD |
156 | ** History/Bibliography |
157 | Some history of Bison and some bibliography would be most welcome. | |
158 | Are there any Texinfo standards for bibliography? | |
159 | ||
160 | ||
161 | ||
948be909 PE |
162 | * Java, Fortran, etc. |
163 | ||
948be909 | 164 | |
f414d77d AD |
165 | ** Java |
166 | ||
167 | There 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. | |
948be909 PE |
175 | <http://www.goice.co.jp/member/mo/hack-progs/bison-java.html> |
176 | ||
ba1ecc07 | 177 | Sebastien Serrurier (serrur_s@epita.fr) is working on this: he is |
f414d77d AD |
178 | expected to contact the authors, design the output, and implement it |
179 | into Bison. | |
948be909 | 180 | |
2ab9a04f AD |
181 | |
182 | * Coding system independence | |
183 | Paul 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. | |
fa770c86 | 194 | |
fa770c86 | 195 | |
aef1ffd5 | 196 | |
bcb05e75 MA |
197 | * --graph |
198 | Show reductions. [] | |
199 | ||
704a47c4 | 200 | * Broken options ? |
04a76783 | 201 | ** %no-parser [] |
04a76783 | 202 | ** %token-table [] |
fbbf9b3b | 203 | ** Skeleton strategy. [] |
c3a8cbaa MA |
204 | Must we keep %no-parser? |
205 | %token-table? | |
416bd7a9 | 206 | |
c111e171 | 207 | * src/print_graph.c |
31b53af2 | 208 | Find the best graph parameters. [] |
63c2d5de MA |
209 | |
210 | * doc/bison.texinfo | |
1a4648ff | 211 | ** Update |
c3a8cbaa | 212 | informations about ERROR_VERBOSE. [] |
948be909 | 213 | ** Add explanations about |
c3a8cbaa MA |
214 | skeleton muscles. [] |
215 | %skeleton. [] | |
eeeb962b | 216 | |
704a47c4 | 217 | * testsuite |
c3a8cbaa MA |
218 | ** tests/pure-parser.at [] |
219 | New tests. | |
0f8d586a | 220 | |
0e95c1dd | 221 | * BTYacc |
f0e48240 AD |
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. | |
0e95c1dd | 227 | |
2ab9a04f AD |
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. | |
231 | ||
232 | ** Compare with the GLR tables | |
948be909 | 233 | See how isomorphic the way BTYacc and the way the GLR adjustments in |
2ab9a04f AD |
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. | |
237 | ||
238 | ** Adjust the skeletons | |
239 | Import the skeletons for C and C++. | |
240 | ||
241 | ** Improve the skeletons | |
242 | Have them support yysymprint, yydestruct and so forth. | |
243 | ||
0e95c1dd AD |
244 | |
245 | * Precedence | |
2ab9a04f AD |
246 | |
247 | ** Partial order | |
0e95c1dd AD |
248 | It is unfortunate that there is a total order for precedence. It |
249 | makes it impossible to have modular precedence information. We should | |
2ab9a04f | 250 | move to partial orders (sounds like series/parallel orders to me). |
0e95c1dd | 251 | |
3c9160d9 AD |
252 | This will be possible with a Bison parser for the grammar, as it will |
253 | make it much easier to extend the grammar. | |
254 | ||
2ab9a04f AD |
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 | |
259 | latter is nonassoc? | |
260 | ||
261 | If there is really no profound motivation, we should find a new syntax | |
262 | to allow specifying this. | |
263 | ||
264 | ** RR conflicts | |
265 | See if we can use precedence between rules to solve RR conflicts. See | |
266 | what POSIX says. | |
267 | ||
268 | ||
69991a58 AD |
269 | * $undefined |
270 | From Hans: | |
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. | |
274 | ||
275 | Suggest: Change the name $undefined to undefined; looks better in outputs. | |
276 | ||
2ab9a04f | 277 | |
69991a58 AD |
278 | * Default Action |
279 | From Hans: | |
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. | |
285 | ||
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). | |
291 | ||
3c9160d9 AD |
292 | Note: Robert Anisko handles this. He knows how to do it. |
293 | ||
2ab9a04f | 294 | |
0164db68 AD |
295 | * Warnings |
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 | |
299 | lib/warnings.[ch]. | |
300 | ||
9306c70c AD |
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 | |
303 | implement it. | |
304 | ||
2ab9a04f | 305 | |
69991a58 AD |
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 | |
311 | ||
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. | |
76551463 | 321 | All is needed is to add |
69991a58 AD |
322 | |
323 | #if YYLSP_NEEDED | |
324 | YYACT_EPILOGUE (yyval, (yyvsp - yylen), yylen, yyloc, (yylsp - yylen)); | |
325 | #else | |
326 | YYACT_EPILOGUE (yyval, (yyvsp - yylen), yylen); | |
327 | #endif | |
328 | ||
329 | at the proper place to bison.simple. Ditto for YYACT_PROLOGUE. | |
330 | ||
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. | |
333 | ||
d7215705 AD |
334 | * Move to Graphviz |
335 | Well, VCG seems really dead. Move to Graphviz instead. Also, equip | |
336 | the parser with a means to create the (visual) parse tree. | |
337 | ||
f294a2c2 AD |
338 | ----- |
339 | ||
ba1ecc07 | 340 | Copyright (C) 2001, 2002, 2003 Free Software Foundation, Inc. |
f294a2c2 | 341 | |
976e6270 | 342 | This file is part of GNU Bison. |
f294a2c2 | 343 | |
976e6270 | 344 | GNU Bison is free software; you can redistribute it and/or modify |
f294a2c2 AD |
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) | |
347 | any later version. | |
348 | ||
976e6270 | 349 | GNU Bison is distributed in the hope that it will be useful, |
f294a2c2 AD |
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. | |
353 | ||
354 | You should have received a copy of the GNU General Public License | |
976e6270 | 355 | along with Bison; see the file COPYING. If not, write to |
f294a2c2 AD |
356 | the Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
357 | Boston, MA 02111-1307, USA. |