Reachability and error diagnosis in LR(1) automata

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/hal-01248101
Contributor : François Pottier <>
Submitted on : Wednesday, December 23, 2015 - 5:42:04 PM
Last modification on : Thursday, April 26, 2018 - 10:28:07 AM
Long-term archiving on : Thursday, March 24, 2016 - 1:00:58 PM

File

fpottier-reachability-jfla2016...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01248101, version 1

Collections

Citation

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

Share

Metrics

Record views

222

Files downloads

67