A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Reachability and error diagnosis in LR(1) parsers
2016
Proceedings of the 25th International Conference on Compiler Construction - CC 2016
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
doi:10.1145/2892208.2892224
dblp:conf/cc/Pottier16
fatcat:sshofm7langrpawyjxwsqporri