Show simple item record

dc.contributor.authorDion, Bernarden_US
dc.contributor.authorFischer, Charlesen_US
dc.date.accessioned2012-03-15T16:28:56Z
dc.date.available2012-03-15T16:28:56Z
dc.date.created1978en_US
dc.date.issued1978
dc.identifier.citationTR333
dc.identifier.urihttp://digital.library.wisc.edu/1793/58108
dc.description.abstractAn error corrector working with LR(1) parsers and variations such as SLR(1) and LALR(1) is studied. The corrector is able to correct and parse any input string. Upon detection of a syntax error, it operates by deleting 0 or more input symbols and inserting a terminal string that guarantees the first non-deleted symbol to be accepted by the parser. The total correction costs, as defined by a table of deletion and insertion costs, is minimized.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleA Least-Cost Error Corrector for LR(1)-Based Parsersen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record