token strings that exercise shift/reduce conflicts

Hello.


Anyone know of tools for taking the description of the parser.output
automaton (from yacc -v) containing shift/reduce conflicts and
generating a concrete example of a string of tokens that "exercises"
the ambiguity?


One can often do this by hand, but for complex grammars with lots of
precedence rules it gets difficult.


Any pointers would be gratefully received.


Thanks,
-James

Return to the comp.compilers page.
Search the comp.compilers archives again.