Higher-Order Functions for parsing

Higher-Order Functions for parsing (1993)

by Graham Hutton

Citations:

94 - 3 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Higher-Order Functions for parsing	user correction - Legacy Corrections
AUTHOR NAME	Graham Hutton	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science, University of Utrecht,	SVM HeaderParse 0.2
AUTHOR ADDR	PO Box 80.089, 3508 TB Utrecht, The Netherlands.	SVM HeaderParse 0.1
ABSTRACT	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. 1 Introduction Broadly speaking, a parser may be defined as a program which analyses text to determine its logical structure. For example, the parsing phase in a compiler takes a program text, and produces a parse tree which expounds the structure of the program. Many programs can be improved by having their input parsed. The form of input which is acceptable is usually defined by a context--free grammar, using BNF notation. Parsers themselves may be built by hand, but are most often ge...	user correction - Legacy Corrections
YEAR	1993	user correction - Legacy Corrections
CITATIONS	7 found	ParsCit 1.0