Reachability and Error Diagnosis in LR(1) Parsers

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. This allows building a collection of pairs of an erroneous input sentence and a (handwritten) 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 [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01417004
Contributor : François Pottier <>
Submitted on : Thursday, December 15, 2016 - 10:49:58 AM
Last modification on : Thursday, April 26, 2018 - 10:27:49 AM
Long-term archiving on : Thursday, March 16, 2017 - 1:13:27 PM

File

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

Identifiers

Collections

Citation

François Pottier. Reachability and Error Diagnosis in LR(1) Parsers. CC 2016 - 25th International Conference on Compiler Construction, Mar 2016, Barcelone, Spain. pp.11, ⟨10.1145/2892208.2892224⟩. ⟨hal-01417004⟩

Share

Metrics

Record views

152

Files downloads

240