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.
Walking on SR-automata to detect grammar ambiguity / Quaglia, Paola. - ELETTRONICO. - (2019), pp. 1-11.
Walking on SR-automata to detect grammar ambiguity
Paola Quaglia
2019-01-01
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
