Pattern Matching Compilation of Functions Definedin Context-Free Languages

作     者：陈海明 董韫美 

作者机构：ComputerScienceLaboratoryInstituteofSoftwareTheChineseAcademyofSciencesBeijing100080P.R.China ComputerScienceLaboratoryInstituteofSoftwareTheChineseAcademyofSciencesBeijing10 

出 版 物：《Journal of Computer Science & Technology》 (计算机科学技术学报（英文版）)

年 卷 期：2001年第16卷第2期

页      面：159-167页

核心收录：

学科分类：08[工学] 0835[工学-软件工程] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：the National Natural Science Foundation (No.69873042)  the National'863' High-Tech Programme (No. 863- 306- 05-04- 1 )  and th 

主　　题：pattern matching algorithm recursive function context-free language functional language 

摘      要：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.