# Walking on SR-automata to detect grammar ambiguity

## TL;DR

This paper introduces SR-automata, a novel method leveraging LR parsing table nondeterminism to detect grammar ambiguity by analyzing paths that reach and diverge at conflict states.

## Contribution

It presents a new approach using SR-automata to identify ambiguity in grammars through conflict-driven analysis of LR parsing tables.

## Key findings

- SR-automata effectively identify ambiguous words in grammars.
- The method provides a systematic way to analyze LR parser conflicts.
- It enhances understanding of grammar ambiguity detection techniques.

## Abstract

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.