Locally least-cost error repair scheme, proposed by Fischer et al.[10, 12, 13, 14], is an error repair scheme which allows the construction of a table-driven or algorithmic error repairing parser with the insertion and deletion cost of the terminal symbols given by the compiler designer[8]. Recently, Chose and Chang[8] have proposed an efficient algorithm for computing the locally least-cost insertion string for the LR-based parsers.
In this paper, the above algorithm is implemented with Yacc[17], a well-known parser generating system under UNIX, which is called Eryacc(Error Repair Yacc). Also several parsers for the practical programming languages such as CHILL, C, and Pascal are produced by Eryacc in order to show the practicality of the proposed error repair scheme and the implemented parser generating system.
