I suspect that one doesn exist, but is there any visualizer or >converter for the .v file that YACC produces?
If the .v file contains the stack state machine (push-down automaton) description, current Bison has a way to visualize it. Hans Aberg * Anti-spam: remove “remove.” from email address. … … … Hans Aberg wrote: > > Can somebody give a reference to a description of the LALR(1) > algorithm that Bison uses? > > The file state.h of the Bison sources says that first, a > non-deterministic finite state machine that parses the specified > grammar is created; it is then converted into a deterministic finite > state machine. I don’t know what Bison uses, but your description sounds like the algorithm I first came across in: Syntax Analysis and Software Tools K.John Gough Addison-Wesley 1988 chapter 9 Bottom-up parsing The references there point to D.E.Knuth (1965) On the translation of languages from left to right Information and control v8 pp323-350 which apparently covers both this and the “usual” form of the algorithm.
