Hill, Steve (1994) Continuation Passing Combinators for Parsing Precedence Grammars. Technical report. University of Kent, Computing Laboratory, University of Kent, Canterbury, UK
|
Download (158Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
| Postscript | ||
|
Download (131Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
Abstract
We describe a scheme for constructing parsers for precedence grammars based on the combinators described by Hutton. The new combinators provide a robust method for building parsers and help avoid the possibility of a non-terminating parser. Efficiency is improved via an optimisation to the grammar. A number of approaches to the problem are described - the most elegant and efficient method is based on continuation passing. A parser for the expression part of the C programming language is presented.
| Item Type: | Monograph (Technical report) |
|---|---|
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 12 Aug 2009 20:01 |
| Last Modified: | 06 Sep 2011 03:44 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/21168 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
