Higher-order functions for parsing
Higher-order functions for parsing
复制标题
用于解析的高阶函数
DOI：
10.1017/s0956796800000411
复制
发表时间：
1992
影响因子：
1.1
通讯作者：
Graham Hutton
中科院分区：
文献类型：
--
作者：
Graham Hutton
摘要在分析中，分析者的文本类似于BNF符号，我们提出了基本方法，我们解决了许多扩展的问题。处理“越位规则”的形式。可以产生更有用的错误消息。
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.