School of Computing

Continuation passing combinators for parsing precedence grammars

Steve Hill

Technical Report 24-94*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, November 1994.

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.

Download publication 52 kbytes

Bibtex Record

@techreport{70,
author = {Steve Hill},
title = {Continuation Passing Combinators for Parsing Precedence Grammars},
month = {November},
year = {1994},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1994/70},
    address = {University of Kent, Canterbury, UK},
    hensa_abstractfilename = {pub/misc/ukc.reports/comp.sci/abstracts/24-94},
    hensa_ftpaddress = {unix.hensa.ac.uk},
    hensa_reportfilename = {pub/misc/ukc.reports/comp.sci/reports/24-94.ps.Z},
    institution = {University of Kent, Computing Laboratory},
    number = {24-94*},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014