Walking on SR-automata to detect grammar ambiguity
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- February 2019
- DOI:
- 10.48550/arXiv.1902.02439
- arXiv:
- arXiv:1902.02439
- Bibcode:
- 2019arXiv190202439Q
- Keywords:
-
- Computer Science - Formal Languages and Automata Theory;
- F.4.2