03/01/1990 09:00 AM
Computer Science
An algorithm for repairing syntax errors is presented. The algorithm is a modified best- first search which searches for the shortest repair. The algorithm adds little time or space costs to the parsing of correct input. It performs as well as other published techniques on a standard set of Pascal programs. A survey of other techniques shows a marked similarity between the first phase of each algorithm. This phase has been generalized into a full search in the best-first approach. A review of the set of programs reveals the successes of other approaches may be primarily due to this first phase. Notes: M.S. Thesis
