|token strings that exercise shift/reduce conflicts James.Leifer@inria.fr (James Leifer) (2004-03-19)|
|From:||James Leifer <James.Leifer@inria.fr>|
|Date:||19 Mar 2004 23:56:00 -0500|
|Keywords:||yacc, errors, question|
|Posted-Date:||19 Mar 2004 23:56:00 EST|
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"
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.
Return to the
Search the comp.compilers archives again.