Locally least-cost error repair scheme, proposed by Fischer et al.[20], is an error repair scheme which allows the construction of a table-driven of algorithmic error repairing parser with the insertion and deletion cost of the terminal symbols given by the compiler designer. Choe and Chang have proposed an efficient algorithm for computing the locally least-cost insertion string for the LR-based parsers[11]. Jung have proposed three conditions factoring out the common suffixes of right context at parser generation time[19]. But in their methods some unnecessary computations still appear repeatedly.
In this paper, new method is proposed to remove redundant computations. Comparison between new method and old ones is also appended.
