{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/7355"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/7355","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"The Generation of Error Recovering Simple Precedence Parsers","abstract":"<p>A survey of error detection and error recovery in simple precedence parsers is given, and in particular the error detection of Leinius, and the error recovery of Rhodes are described. An implementation of a system which generates error recovering simple precendence parsers is presented. The system divides into two subsystems, a constructor, and a skeletal parser. The grammar of the simple precedence language (L) for which a parser is required is used as input to the constructor. The constructor processes the grammar, and produces data used to prime the skeletal parser such that it can parse a sentence of L (or, an L program). The skeletal parser includes error detection based on the work of Leinius, and error recovery based on the work of Rhodes.</p>","abstract_html":"&lt;p&gt;A survey of error detection and error recovery in simple precedence parsers is given, and in particular the error detection of Leinius, and the error recovery of Rhodes are described. An implementation of a system which generates error recovering simple precendence parsers is presented. The system divides into two subsystems, a constructor, and a skeletal parser. The grammar of the simple precedence language (L) for which a parser is required is used as input to the constructor. The constructor processes the grammar, and produces data used to prime the skeletal parser such that it can parse a sentence of L (or, an L program). The skeletal parser includes error detection based on the work of Leinius, and error recovery based on the work of Rhodes.&lt;/p&gt;","abstract_has_math":false,"creators":["Johns, Clive B."],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computation","school":null,"contributors":[],"advisors":["Wood, D."],"committee_chairs":[],"committee_members":[],"year":1974,"date_issued":"1974-07","date_published":"1974-07","updated_at":"2026-11-18T19:33:08Z","subjects":["Computational Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/13389"],"render_values":[{"text":"https://doi.org/10.71548/13389","href":"https://doi.org/10.71548/13389","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/2636","3564","1390811"],"render_values":[{"text":"opendissertations/2636","href":null,"code":true},{"text":"3564","href":null,"code":true},{"text":"1390811","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/7355","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/7355","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F7355","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Wood, D."]},{"key":"dc:contributor.department","label":"Department","values":["Computation"]},{"key":"dc:creator","label":"Author","values":["Johns, Clive B."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T16:39:04Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T16:39:04Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2010-07-12"]},{"key":"dc:date.issued","label":"Date","values":["1974-07"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computational Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/2636","3564","1390811"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/7355","https://doi.org/10.71548/13389"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>A survey of error detection and error recovery in simple precedence parsers is given, and in particular the error detection of Leinius, and the error recovery of Rhodes are described. An implementation of a system which generates error recovering simple precendence parsers is presented. The system divides into two subsystems, a constructor, and a skeletal parser. The grammar of the simple precedence language (L) for which a parser is required is used as input to the constructor. The constructor processes the grammar, and produces data used to prime the skeletal parser such that it can parse a sentence of L (or, an L program). The skeletal parser includes error detection based on the work of Leinius, and error recovery based on the work of Rhodes.</p>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Engineering (ME)"]},{"key":"dc:title","label":"Title","values":["The Generation of Error Recovering Simple Precedence Parsers"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Wood, D."],"dc:contributor.department":["Computation"],"dc:creator":["Johns, Clive B."],"dc:date.accessioned":["2014-06-18T16:39:04Z"],"dc:date.available":["2014-06-18T16:39:04Z"],"dc:date.created":["2010-07-12"],"dc:date.issued":["1974-07"],"dc:description.abstract":["<p>A survey of error detection and error recovery in simple precedence parsers is given, and in particular the error detection of Leinius, and the error recovery of Rhodes are described. An implementation of a system which generates error recovering simple precendence parsers is presented. The system divides into two subsystems, a constructor, and a skeletal parser. The grammar of the simple precedence language (L) for which a parser is required is used as input to the constructor. The constructor processes the grammar, and produces data used to prime the skeletal parser such that it can parse a sentence of L (or, an L program). The skeletal parser includes error detection based on the work of Leinius, and error recovery based on the work of Rhodes.</p>"],"dc:description.degree":["Master of Engineering (ME)"],"dc:identifier.other":["opendissertations/2636","3564","1390811"],"dc:identifier.uri":["http://hdl.handle.net/11375/7355","https://doi.org/10.71548/13389"],"dc:subject":["Computational Engineering"],"dc:title":["The Generation of Error Recovering Simple Precedence Parsers"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:33:08Z"}