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.
Type de document :
Communication dans un congrès
CC 2016 - 25th International Conference on Compiler Construction, Mar 2016, Barcelone, Spain. pp.11, 2016, Proceedings of the 25th International Conference on Compiler Construction (CC 2016). <10.1145/2892208.2892224>
Liste complète des métadonnées


https://hal.inria.fr/hal-01417004
Contributeur : François Pottier <>
Soumis le : jeudi 15 décembre 2016 - 10:49:58
Dernière modification le : vendredi 16 décembre 2016 - 11:28:23
Document(s) archivé(s) le : jeudi 16 mars 2017 - 13:13:27

Fichier

fpottier-reachability-cc2016.p...
Fichiers produits par l'(les) auteur(s)

Identifiants

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, 2016, Proceedings of the 25th International Conference on Compiler Construction (CC 2016). <10.1145/2892208.2892224>. <hal-01417004>

Partager

Métriques

Consultations de
la notice

38

Téléchargements du document

26