This thesis presents a study on the efficient error repair for LR-based Parsers and the development of an error repairing system.
The error repairing system presented in this thesis consists of an error repairing parser generator and an error repairing parser. After the algorithms of calculating error repair tables produced by the error repairing parser generator are studied, the error repair tables are calculated and generated using the algorithms. Studying the error repair model and algorithm of generating an effective least cost insertion string using the L-graph are followed by implementing a error repairing parser based on the algorithm.
The study and analysis on the insertion cost and the deletion cost of terminal symbols are followed by proposing several basic factors for finding out good repair cost.
In this thesis, the error repairing system is implemented by upgrading the existing error repairing system, Error Correcting Parser generating system(ECP) of Fisher et al. It is presented that the proposed system is superior to ECP. in terms of space and time in generating error repair tables.
