###
DOI:
Journal of Software:1993.4(4):8-14

一种扩展图重写模型下函数语言惰性模式匹配的实现方法
周光明,王鼎兴
(清华大学计算机系 北京 100084)
A LAZY PATTERN MATCHING IMPLEMENTING METHOD OF FUNCTIONAL LANGUAGE BASED ON EXTENDED GRAPH REWRITING MODEL
Zhou Guangming,Wang Dingxing
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 2773   Download 3008
Received:December 07, 1990    Revised:May 03, 1991
> 中文摘要: 本文给出惰性模式匹配基于扩展图重写模型的实现方法,包括模式匹配编译算法、参量一致化和模式平坦化算法,前一算法较好地实现了[6]中尚未解决的惰性模式匹配问题;而后一算法较[7]中提出的算法简单、高效。
中文关键词:
Abstract:A lazy pattern matching implementation method based on extended graph rewriting model is proposed, including a lazy pattern matching compiling algorithm, a sometime-matching argument eliminating and pattern flattening algorithm. The first algorithm has solved the problem of efficient implementing lazy pattern matching which remained unsolved in [6]. The later algorithm is simpler and more efficient than that proposed in [7].
keywords:
文章编号:     中图分类号:    文献标志码:
基金项目:
Foundation items:
Reference text:

周光明,王鼎兴.一种扩展图重写模型下函数语言惰性模式匹配的实现方法.软件学报,1993,4(4):8-14

Zhou Guangming,Wang Dingxing.A LAZY PATTERN MATCHING IMPLEMENTING METHOD OF FUNCTIONAL LANGUAGE BASED ON EXTENDED GRAPH REWRITING MODEL.Journal of Software,1993,4(4):8-14