token strings that exercise shift/reduce conflicts

James Leifer <>
19 Mar 2004 23:56:00 -0500

          From comp.compilers

Related articles
token strings that exercise shift/reduce conflicts (James Leifer) (2004-03-19)
| List of all articles for this month |

From: James Leifer <>
Newsgroups: comp.compilers
Date: 19 Mar 2004 23:56:00 -0500
Organization: I.N.R.I.A Rocquencourt
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"
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.


Post a followup to this message

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