Hmm … that should be pretty simple.
Can someone please write a tool that takes a BNF for an LALR parser with shift/reduce or reduce/reduce conflicts as input and produces minimal inputs for how the conflict can be triggered? That would be super helpful, thanks! (Also: Let me know if such a thing exists. :)
-
-
-
I think so as well. And it would be extremely helpful in cases where it is unclear why certain rules end up in the same state when they are seemingly unrelated from just looking at the grammar.
- Show replies
New conversation -
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Have a look at BISON and FLEX!
-
I am using bison and flex. I don't think bison has such a feature. All you get from bison is the .output file "bison -r" generates. That includes a complete dump of the state machine, but no path to the conflict state.
End of conversation
New conversation -
-
-
OCaml's Menhir library has great features for this kind of thing. Will tell you all conflicts with example inputs to reach them. More general than LALR though, IIRC. http://gallium.inria.fr/~fpottier/menhir/ …
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
If this for yosys, then from what I saw in the grammar, I suspected the issue might be due to mid-action rules. Maybe try the subroutine-in-a-rule workaround in https://www.gnu.org/software/bison/manual/html_node/Mid_002dRule-Conflicts.html#Mid_002dRule-Conflicts …
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.