University of Tasmania
Browse

File(s) not publicly available

Predictive parser combinators need four values to report errors

journal contribution
posted on 2023-05-16, 07:37 authored by Partridge, AS, Wright, DA
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.

History

Publication title

Journal of Functional Programming

Volume

6

Pagination

355-364

ISSN

0956-7968

Department/School

School of Information and Communication Technology

Publisher

Cambridge Univ Press

Place of publication

Cambridge University Press

Repository Status

  • Restricted

Socio-economic Objectives

Other information and communication services not elsewhere classified

Usage metrics

    University Of Tasmania

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC