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 条
  • [1] Pattern matching compilation of functions defined in context-free languages
    Haiming Chen
    Yunmei Dong
    Journal of Computer Science and Technology, 2001, 16 : 159 - 167
  • [2] Pattern matching compilation of functions defined in context-free languages
    Chen, HM
    Dong, YM
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2001, 16 (02) : 159 - 167
  • [3] APPROXIMATELY MATCHING CONTEXT-FREE LANGUAGES
    MYERS, G
    INFORMATION PROCESSING LETTERS, 1995, 54 (02) : 85 - 92
  • [4] ON CONTEXT-FREE LANGUAGES
    PARIKH, RJ
    JOURNAL OF THE ACM, 1966, 13 (04) : 570 - +
  • [5] Towards practical computable functions on context-free languages
    Chen, Haiming
    Dong, Yunmei
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2006, 3959 : 555 - 565
  • [6] NATURAL LANGUAGES AND CONTEXT-FREE LANGUAGES
    PULLUM, GK
    GAZDAR, G
    LINGUISTICS AND PHILOSOPHY, 1982, 4 (04) : 471 - 504
  • [7] On differentiation functions, structure functions, and related languages of context-free grammars
    Dassow, J
    Mitrana, V
    Paun, G
    Stiebe, R
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2004, 38 (03): : 257 - 267
  • [8] Regular and Context-Free Pattern Languages over Small Alphabets
    Reidenbach, Daniel
    Schmid, Markus L.
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2012), 2012, 7410 : 130 - 141
  • [9] Regular and context-free pattern languages over small alphabets
    Reidenbach, Daniel
    Schmid, Markus L.
    THEORETICAL COMPUTER SCIENCE, 2014, 518 : 80 - 95
  • [10] PARALLEL CONTEXT-FREE LANGUAGES
    SKYUM, S
    INFORMATION AND CONTROL, 1974, 26 (03): : 280 - 285
12345