We assume three types of syntax errors can debase the sentences of a language generated by a context-free grammar: the replacement of a symbol by an incorrect symbol, the insertion of an extraneous symbol, or the deletion of a symbol. We present an algorithm that will parse any input string to completion finding the fewest possible number of errors. On a random access computer the algorithm requires time proportional to the cube of the length of the input.
No takes yet. Share an insight, caveat, or question.
Aho et al. (1972) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: