Please use this identifier to cite or link to this item:
|Title:||The Generation of Error Recovering Simple Precedence Parsers|
|Authors:||Johns, Clive B.|
|Keywords:||Computational Engineering;Computational Engineering|
|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>|
|Appears in Collections:||Open Access Dissertations and Theses|
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.