pattern matching compilation of functions defined in context-free languages
文献类型：期刊论文
| 作者 | Chen Haiming ; Yunmei Dong |
| 刊名 | Journal of Computer Science and Technology
 |
| 出版日期 | 2001 |
| 卷号 | 16期号:2页码:159-167 |
| 关键词 | 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. |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000167726400006 |
| 公开日期 | 2010-07-22 |
| 源URL | [http://124.16.136.157/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. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。