Reachability and error diagnosis in LR(1) automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Reachability and error diagnosis in LR(1) automata


Given an LR(1) automaton, what are the states in which an error can be detected? For each such " error state " , what is a minimal input sentence that causes an error in this state? We propose an algorithm that answers these questions. Such an algorithm allows building a collection of pairs of an erroneous input sentence and a diagnostic message, ensuring that this collection covers every error state, and maintaining this property as the grammar evolves. We report on an application of this technique to the CompCert ISO C99 parser, and discuss its strengths and limitations.
Fichier principal
Vignette du fichier
fpottier-reachability-jfla2016.pdf (544.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01248101 , version 1 (23-12-2015)


  • HAL Id : hal-01248101 , version 1


François Pottier. Reachability and error diagnosis in LR(1) automata. Journées Francophones des Langages Applicatifs, Jan 2016, Saint-Malo, France. ⟨hal-01248101⟩
201 View
64 Download


Gmail Facebook X LinkedIn More