X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/3ae2b51f0851bfd63f73ca4bc263292839d757b1..271efced6772d333b524cf6227ebf2ade1b7ecac:/TODO diff --git a/TODO b/TODO index 14bd676f..30abb3c4 100644 --- a/TODO +++ b/TODO @@ -15,17 +15,24 @@ to #define yyerror and yyprint to steal internal variables... * documentation Explain $axiom (and maybe change its name: BTYacc names it `goal', -byacc `$accept', probably based on AT&T Yacc). Complete the glossary -(item, axiom, ?). +byacc `$accept' probably based on AT&T Yacc, Meta `Start'...). +Complete the glossary (item, axiom, ?). -* report documentation +* Error messages +Some are really funky. For instance + + type clash (`%s' `%s') on default action + +is really weird. Revisit them all. + +* Report documentation Extend with error. The hard part will probably be finding the right rule so that a single state does not exhibit to many yet undocumented ``features''. Maybe an empty action ought to be presented too. Shall we try to make a single grammar with all these features, or should we have several very small grammars? -* documentation +* Documentation Some history of Bison and some bibliography would be most welcome. Are there any Texinfo standards for bibliography? @@ -52,7 +59,8 @@ When implementing multiple-%union support, bare the following in mind: * --report=conflict-path Provide better assistance for understanding the conflicts by providing -a sample text exhibiting the (LALR) ambiguity. +a sample text exhibiting the (LALR) ambiguity. See the paper from +DeRemer and Penello: they already provide the algorithm. * Coding system independence Paul notes: @@ -150,7 +158,10 @@ into exp: exp '+' exp | exp '&' exp; when there are no actions. This can significantly speed up some -grammars. +grammars. I can't find the papers. In particular the book `LR +parsing: Theory and Practice' is impossible to find, but according to +`Parsing Techniques: a Practical Guide', it includes information about +this issue. Does anybody have it? * Stupid error messages An example shows it easily: @@ -184,12 +195,6 @@ scheme. Sources of inspiration include GNU diff, and Free Recode. A round of memory leak clean ups would be most welcome. Dmalloc, Checker GCC, Electric Fence, or Valgrind: you chose your tool. -* Memory leaks in the parser -The same applies to the generated parsers. In particular, this is -critical for user data: when aborting a parsing, when handling the -error token etc., we often throw away yylval without giving a chance -of cleaning it up to the user. - * --graph Show reductions. [] @@ -285,9 +290,6 @@ should recognize these, and preserve them. See if we can integrate backtracking in Bison. Contact the BTYacc maintainers. -* Automaton report -Display more clearly the lookaheads for each item. - * RR conflicts See if we can use precedence between rules to solve RR conflicts. See what POSIX says. @@ -300,11 +302,6 @@ move to partial orders. This will be possible with a Bison parser for the grammar, as it will make it much easier to extend the grammar. -* Parsing grammars -Rewrite the reader in Flex/Bison. There will be delicate parts, in -particular, expect the scanner to be hard to write. Many interesting -features cannot be implemented without such a new reader. - * $undefined From Hans: - If the Bison generated parser experiences an undefined number in the @@ -367,6 +364,10 @@ at the proper place to bison.simple. Ditto for YYACT_PROLOGUE. I was wondering what you think about adding YYACT_PROLOGUE/EPILOGUE to bison. If you're interested, I'll work on a patch. +* Move to Graphviz +Well, VCG seems really dead. Move to Graphviz instead. Also, equip +the parser with a means to create the (visual) parse tree. + ----- Copyright (C) 2001, 2002 Free Software Foundation, Inc.