Reachability and error diagnosis in LR(1) automata

François Pottier (1)

1 GALLIUM - Langages de programmation, types, compilation et preuves

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.

Domaines: Langage de programmation [cs.PL]

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