Pattern Matching Compilation of Functions Definedin Context-Free Languages  

作　　者：陈海明 董韫美 

机构地区：[1]ComputerScienceLaboratory,InstituteofSoftware,TheChineseAcademyofSciencesBeijing100080,P.R.China [2]ComputerScienceLaboratory,InstituteofSoftware,TheChineseAcademyofSciencesBeijing10

出　　处：《Journal of Computer Science & Technology》2001年第2期159-167,共9页计算机科学技术学报（英文版）

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

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

关 键 词：pattern matching ALGORITHM recursive function context-free  language functional language 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]