Skip to main content
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 27
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Izmaylova, Anastasia Afroozeh, Ali and Storm, Tijs van der 2016. Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation - PEPM 2016. p. 1.

    Afroozeh, Ali and Izmaylova, Anastasia 2015. 2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!) - Onward! 2015. p. 151.

    Adams, Michael D. and Ağacan, Ömer S. 2014. Indentation-sensitive parsing for Parsec. ACM SIGPLAN Notices, Vol. 49, Issue. 12, p. 121.

    Bogk, Andreas and Schopl, Marco 2014. 2014 IEEE Security and Privacy Workshops. p. 198.

    Cazzola, Walter and Vacchi, Edoardo 2014. On the incremental growth and shrinkage of LR goto-graphs. Acta Informatica, Vol. 51, Issue. 7, p. 419.

    Medeiros, Sérgio Mascarenhas, Fabio and Ierusalimschy, Roberto 2014. Left recursion in Parsing Expression Grammars. Science of Computer Programming, Vol. 96, p. 177.

    Iwama, Futoshi Nakamura, Taiga and Takeuchi, Hironori 2012. 2012 34th International Conference on Software Engineering (ICSE). p. 1012.

    Volanschi, Nic 2012. Pattern matching for the masses using custom notations. Science of Computer Programming, Vol. 77, Issue. 5, p. 609.

    Goldberg, Daniel W. 2011. Improving Geocoding Match Rates with Spatially-Varying Block Metrics. Transactions in GIS, Vol. 15, Issue. 6, p. 829.

    Koprowski, Adam Binsztok, Henri and Gordon, Andrew 2011. TRX: A Formally Verified Parser Interpreter. Logical Methods in Computer Science, Vol. 7, Issue. 2,

    Mazanek, Steffen and Hanus, Michael 2011. Constructing a bidirectional transformation between BPMN and BPEL with a functional logic programming language. Journal of Visual Languages & Computing, Vol. 22, Issue. 1, p. 66.

    Heeren, Bastiaan Jeuring, Johan and Gerdes, Alex 2010. Specifying Rewrite Strategies for Interactive Exercises. Mathematics in Computer Science, Vol. 3, Issue. 3, p. 349.

    Heeren, Bastiaan and Jeuring, Johan 2009. Recognizing Strategies. Electronic Notes in Theoretical Computer Science, Vol. 237, p. 91.

    Ierusalimschy, Roberto 2009. A text pattern-matching tool based on Parsing Expression Grammars. Software: Practice and Experience, Vol. 39, Issue. 3, p. 221.

    Giegerich, Robert Meyer, Carsten and Steffen, Peter 2004. A discipline of dynamic programming over sequence data. Science of Computer Programming, Vol. 51, Issue. 3, p. 215.

    Winter, Michael 2003. Generating Processes from Specifications using the Relation Manipulation System RelView. Electronic Notes in Theoretical Computer Science, Vol. 44, Issue. 3, p. 194.

    Meyer, Carsten and Giegerich, Robert 2002. Matching and Significance Evaluation of Combined Sequence-Structure Motifs in RNA. Zeitschrift für Physikalische Chemie, Vol. 216, Issue. 2/2002,

    Sloane, A.M. 2002. Proceedings of the 35th Annual Hawaii International Conference on System Sciences. p. 3647.

    Oliveira, P.I. and Camarao, C. 2001. SCCC 2001. 21st International Conference of the Chilean Computer Science Society. p. 223.

    Tremblay, G. 2000. Lenient evaluation is neither strict nor lazy. Computer Languages, Vol. 26, Issue. 1, p. 43.


Higher-order functions for parsing*

  • Graham Hutton (a1)
  • DOI:
  • Published online: 01 November 2008

In combinator parsing, the text of parsers resembles BNF notation. We present the basic method, and a number of extensions. We address the special problems presented by white-space, and parsers with separate lexical and syntactic phases. In particular, a combining form for handling the ‘offside rule’ is given. Other extensions to the basic method include an ‘into’ combining form with many useful applications, and a simple means by which combinator parsers can produce more informative error messages.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

P. Landin 1966. The Next 700 Programming Languages. Comm. ACM, 9 (Mar.).

P. Wadler 1985. How to Replace Failure by a List of Successes. In Proc. FPCA 85, Vol. 201 of Lecture Notes in Computer Science. Springer-Verlag.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *