pattern matching compilation of functions defined in context-free languages

	pattern matching compilation of functions defined in context-free languages
	Chen Haiming; Yunmei Dong
	2001
发表期刊	Journal of Computer Science and Technology
卷号	16 期号:2 页码:159-167
摘要	LFC is a functional language based on recursive functions defined in context-free languages. In this paper, a new pattern matching algorithm for LFC is presented, which can represent a sequence of patterns as an integer by an encoding method. It is a rather simple method and produces efficient case-expressions for pattern matching definitions of LFC. The algorithm can also be used for other functional languages, but for nested patterns it may become complicated and further studies are needed.
收录类别	sci
关键词	Pattern Matching Algorithm Recursive Function Context-free Language Functional Language
部门归属	计算机科学国家重点实验室
语种	英语
WOS记录号	WOS:000167726400006
引用统计
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/2853
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Chen Haiming,Yunmei Dong. pattern matching compilation of functions defined in context-free languages[J]. Journal of Computer Science and Technology,2001,16(2):159-167.
APA	Chen Haiming,&Yunmei Dong.(2001).pattern matching compilation of functions defined in context-free languages.Journal of Computer Science and Technology,16(2),159-167.
MLA	Chen Haiming,et al."pattern matching compilation of functions defined in context-free languages".Journal of Computer Science and Technology 16.2(2001):159-167.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
20011602159.pdf（536KB）			开放获取	--	请求全文