Pattern Matching Compilation of Functions Definedin Context-Free Languages

被引：0
|
作者：
陈海明
董韫美
机构：
来源：
JournalofComputerScienceandTechnology | 2001年 / 02期
关键词：
pattern matching; algorithm; recursive function; context-free language; functional language;
D O I：
暂无
中图分类号：
TP312 [程序语言、算法语言];
学科分类号：
081202 ; 0835 ;
摘要：
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.
引用
收藏
页码：159 / 167
页数：9
相关论文
共 50 条
12345