Continuation Passing Combinators for Parsing Precedence Grammars

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.