Higher-Order Functions for Parsing
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 ru...
| Main Author: | |
|---|---|
| Format: | Article |
| Published: |
Cambridge University Press
1992
|
| Online Access: | https://eprints.nottingham.ac.uk/221/ |
| _version_ | 1848790372858200064 |
|---|---|
| author | Hutton, Graham |
| author_facet | Hutton, Graham |
| author_sort | Hutton, Graham |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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 $quot;into$quot; combining form with many useful applications, and a simple means by which combinator parsers can produce more informative error messages. |
| first_indexed | 2025-11-14T18:11:34Z |
| format | Article |
| id | nottingham-221 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T18:11:34Z |
| publishDate | 1992 |
| publisher | Cambridge University Press |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-2212020-05-04T20:33:48Z https://eprints.nottingham.ac.uk/221/ Higher-Order Functions for Parsing Hutton, Graham 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 $quot;into$quot; combining form with many useful applications, and a simple means by which combinator parsers can produce more informative error messages. Cambridge University Press 1992-07 Article PeerReviewed Hutton, Graham (1992) Higher-Order Functions for Parsing. Journal of Functional Programming, 2 (3). pp. 323-343. |
| spellingShingle | Hutton, Graham Higher-Order Functions for Parsing |
| title | Higher-Order Functions for Parsing |
| title_full | Higher-Order Functions for Parsing |
| title_fullStr | Higher-Order Functions for Parsing |
| title_full_unstemmed | Higher-Order Functions for Parsing |
| title_short | Higher-Order Functions for Parsing |
| title_sort | higher-order functions for parsing |
| url | https://eprints.nottingham.ac.uk/221/ |