Deterministic, Error-Correcting Combinator Parsers
Deterministic, Error-Correcting Combinator Parsers
复制标题
确定性、纠错组合器解析器
DOI：
10.1007/3-540-61628-4_7
复制
发表时间：
1996
期刊：
影响因子：
--
通讯作者：
L. Duponcheel
中科院分区：
文献类型：
--
作者：
S. Swierstra;L. Duponcheel
我们展示了如何纠错，确定性，组合子解析器可以构造的语法具有LL（1）的属性。传统的组合子解析器的正常缺点，如缺乏速度和错误报告差，弥补。用这些组合子构造的解析器隐含地专门用于它们所描述的语法。由于这个性质，组合子充当LL（1）文法的分析器生成器。用于构造组合子的技术说明了如何使用部分参数化和计算的仔细排序来实现懒惰语言中的隐式部分求值。
We show how error-correcting, deterministic, combinator parsers can be constructed for grammars which have the LL(1) property. The normal disadvantages of conventional combinator parsers, such as their lack of speed and their poor error reporting, are remedied. Parsers constructed with these combinators are implicitly specialised for the grammar they describe. Because of this property the combinators act as a parser generator for LL(1) grammars. The techniques used to construct the combinators illustrate how partial parametrisation and careful ordering of computations can be used to achieve implicit partial evaluation in a lazy language.