X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/51cbef6f6332c3ec10bc64182bcf2f83351d7dff..75ad86eebd3f49dff81976eb83036eb7b7793e68:/TODO diff --git a/TODO b/TODO index 573e0867..94bd12c8 100644 --- a/TODO +++ b/TODO @@ -12,6 +12,8 @@ They should not: it is not documented. But if they need to, let's find something clean (not like YYLSP_NEEDED...). +* Installation + * Documentation Before releasing, make sure the documentation ("Understanding your parser") refers to the current `output' format. @@ -27,7 +29,7 @@ Catch up with yacc.c. ** GLR How would Paul like to display the conflicted actions? In particular, -what when two reductions are possible on a given look-ahead token, but one is +what when two reductions are possible on a given lookahead token, but one is part of $default. Should we make the two reductions explicit, or just keep $default? See the following point. @@ -47,6 +49,9 @@ Provide better assistance for understanding the conflicts by providing a sample text exhibiting the (LALR) ambiguity. See the paper from DeRemer and Penello: they already provide the algorithm. +** Statically check for potential ambiguities in GLR grammars. See + for an approach. + * Extensions @@ -87,11 +92,6 @@ we should be able to have: Or something like this. -** yysymprint interface -It should be improved, in particular when using Bison features such as -locations, and YYPARSE_PARAMS. For the time being, it is almost -recommended to yyprint to steal internal variables... - ** %if and the like It should be possible to have %if/%else/%endif. The implementation is not clear: should it be lexical or syntactic. Vadim Maslow thinks it @@ -147,23 +147,6 @@ Are there any Texinfo standards for bibliography? * Java, Fortran, etc. -** Java - -There are a couple of proposed outputs: - -- BYACC/J - which is based on Byacc. - - -- Bison Java - which is based on Bison. - - -Sebastien Serrurier (serrur_s@epita.fr) is working on this: he is -expected to contact the authors, design the output, and implement it -into Bison. - - * Coding system independence Paul notes: @@ -182,28 +165,16 @@ Paul notes: the source code. This should get fixed. * --graph -Show reductions. [] +Show reductions. * Broken options ? -** %no-parser [] -** %token-table [] -** Skeleton strategy. [] -Must we keep %no-parser? - %token-table? +** %no-parser +** %token-table +** Skeleton strategy +Must we keep %no-parser? %token-table? * src/print_graph.c -Find the best graph parameters. [] - -* doc/bison.texinfo -** Update -informations about ERROR_VERBOSE. [] -** Add explanations about -skeleton muscles. [] -%skeleton. [] - -* testsuite -** tests/pure-parser.at [] -New tests. +Find the best graph parameters. * BTYacc See if we can integrate backtracking in Bison. Charles-Henri de @@ -236,9 +207,6 @@ It is unfortunate that there is a total order for precedence. It makes it impossible to have modular precedence information. We should move to partial orders (sounds like series/parallel orders to me). -This will be possible with a Bison parser for the grammar, as it will -make it much easier to extend the grammar. - ** Correlation b/w precedence and associativity Also, I fail to understand why we have to assign the same associativity to operators with the same precedence. For instance, @@ -318,9 +286,8 @@ 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. +* Better graphics +Equip the parser with a means to create the (visual) parse tree. -----