Skip to main content

Continuation Passing Combinators for Parsing Precedence Grammars

Hill, Steve (1994) Continuation Passing Combinators for Parsing Precedence Grammars. Technical report. University of Kent, Computing Laboratory, University of Kent, Canterbury, UK (KAR id:21168)

PDF
Language: English
Download (283kB) Preview
[thumbnail of ParseSteve.pdf]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format
Postscript
Language: English
Download (134kB) Preview
[thumbnail of ParseSteve.ps]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format

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: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 12 Aug 2009 20:01 UTC
Last Modified: 16 Nov 2021 09:59 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/21168 (The current URI for this page, for reference purposes)
  • Depositors only (login required):