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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Cambridge University Press
1992
|
| Online Access: | http://eprints.nottingham.ac.uk/221/ http://eprints.nottingham.ac.uk/221/1/parsing.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|