A modification to Earley's algorithm for syntax error recovery

dc.contributor.author	Hagglund, Dale	en_US
dc.date.accessioned	2024-08-14T16:42:15Z
dc.date.available	2024-08-14T16:42:15Z
dc.date.copyright	1988	en_US
dc.date.issued	1988
dc.degree.department	Department of Computer Science
dc.degree.level	Master of Science M.Sc.	en
dc.description.abstract	The problem of syntax error recovery has recently received a great deal of attention. Most methods in common use are largely ad hoc. Because of this, they tend to have certain pathological cases which cause cascades of error messages. One method of avoiding these error cascades involves using a suffix parser - one which can parse an arbitrary suffix of the specified language. Once an error is detected, the parser is simply restarted to look for subsequent errors. Thus, no spurious error messages are ever generated. Earley's algorithm provides the basis for a general suffix parser. Using a suffix parser as described above allows recovery from syntax errors with no attempt at repair. The modified Earley parser leaves a large amount of information behind in the states it builds to describe its parsing actions which can be used to guide the search for potential repairs. An algorithm based on this fact is presented, along with a simple implementation.
dc.format.extent	63 pages
dc.identifier.uri	https://hdl.handle.net/1828/18048
dc.rights	Available to the World Wide Web	en_US
dc.title	A modification to Earley's algorithm for syntax error recovery	en_US
dc.type	Thesis	en_US

Files

Now showing 1 - 1 of 1