Commit 521b9d37 authored by POTTIER Francois's avatar POTTIER Francois

TODO.

parent c5a04a37
......@@ -115,28 +115,6 @@
* Define [print_checkpoint].
Define a printer that shows the states in the stack.
Try computing a set of expected symbols in the current state.
* Instead of directly invoking ocamlc (in --infer mode), Menhir could
dump an .actions.ml file,
expect the build system to invoke "ocamlc -i" and create .actions.mli,
and continue (in a second invocation) from there.
(Suggestion by Fabrice Le Fessant.)
* Test and document --lalr (maybe). Explain that it is (probably)
incompatible in principle with --explain. Modify the code to fail
gracefully when the problem arises.
* BUG: --only-preprocess imprime des actions sémantiques où les $ ont
été remplacés par _, ce qui rend la grammaire invalide.
* Tenter une minimisation a posteriori de l'automate. Sur la grammaire
OCaml on devrait retrouver l'automate LALR, non?
Faire cette minimisation *après* la résolution des conflits afin que
la minimisation n'affecte pas le comportement de l'automate, même en
présence de directives de priorité. Du coup si on combine --canonical
et --minimize alors on devrait obtenir un automate correct, proche de
IELR, voir Denny et Malloy. Confirmer.
* Documenter la différence de philosophie avec Denny & Malloy à propos
des conflits (cf. email à Laurence Tratt).
......
......@@ -51,3 +51,18 @@ for now.
However, my impression so far is that the whole thing is of interest
mainly to people who are doing lexer hacks. Otherwise, it is much easier
to just parse, produce a tree, and transform the tree afterwards.
* Instead of directly invoking ocamlc (in --infer mode), Menhir could
dump an .actions.ml file,
expect the build system to invoke "ocamlc -i" and create .actions.mli,
and continue (in a second invocation) from there.
(Suggestion by Fabrice Le Fessant.)
* Try generating a canonical automaton, resolving conflicts, and THEN
minimizing the automaton. Would the result be close to IELR(1)?
(Unfortunately, producing a canonical automaton remains a bit costly:
8 seconds for OCaml's grammar.)
* Why does --canonical --table consume a huge amount of time on a large grammar?
(3m57s for ocaml.mly, versus 16s without --table)
Display how much time is spent compressing tables.
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment