Back to search

McMaster University

The Generation of Error Recovering Simple Precedence Parsers

Abstract

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>

Degree

thesis:*
Department dc:contributor.department
Computation
Year dc:date.issued
1974

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Johns, Clive B.
Advisor dc:contributor.advisor
  • Wood, D.

Subjects

dc:subject × 1

Identifiers

dc:identifier.*
Dc Identifier Other
opendissertations/2636
3564
1390811

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Johns, Clive B.. The Generation of Error Recovering Simple Precedence Parsers. 1974. http://hdl.handle.net/11375/7355