  We exploit the nondeterminism of LR parsing tables to reason about grammar
ambiguity after a conflict-driven strategy. First, from parsing tables we
define specialized structures, called SR-automata. Next, we search for
ambiguous words along the paths of SR-automata that reach a conflict state and
then diverge along the branches corresponding to distinct resolutions of the
conflict.
