eCite Digital Repository

Predictive parser combinators need four values to report errors


Partridge, AS and Wright, DA, Predictive parser combinators need four values to report errors, Journal of Functional Programming, 6, (2) pp. 355-364. ISSN 0956-7968 (1996) [Refereed Article]

DOI: doi:10.1017/S0956796800001714


A combinator-based parser is a parser constructed directly from a BNF grammar, using higher-order functions (combinators) to model the alternative and sequencing operations of BNF. This paper describes a method for constructing parser combinators that can be used to build efficient predictive parsers which accurately report the cause of parsing errors. The method uses parsers that return values (parse trees or error indications) decorated with one of four tags.

Item Details

Item Type:Refereed Article
Research Division:Information and Computing Sciences
Research Group:Software engineering
Research Field:Software engineering not elsewhere classified
Objective Division:Information and Communication Services
Objective Group:Other information and communication services
Objective Field:Other information and communication services not elsewhere classified
UTAS Author:Partridge, AS (Dr Partridge)
UTAS Author:Wright, DA (Dr David Wright)
ID Code:346
Year Published:1996
Deposited By:Computer Science
Deposited On:1996-08-01
Last Modified:2011-08-16

Repository Staff Only: item control page