Walking on SR-automata to detect grammar ambiguity

Autor:	Quaglia, Paola
Rok vydání:	2019
Předmět:	Computer Science - Formal Languages and Automata Theory F.4.2
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1902.02439 Zobrazit plný text záznamu View this record from Arxiv