Institutional Repository
| pattern matching compilation of functions defined in context-free languages | |
| Chen Haiming; Yunmei Dong | |
| 2001 | |
| Source | Journal of Computer Science and Technology
 |
| Volume | 16Issue:2Pages:159-167 |
| English Abstract | 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. |
| Indexed Type | sci |
| Keyword | Pattern Matching Algorithm Recursive Function Context-free Language Functional Language |
| Department | 计算机科学国家重点实验室 |
| Language | 英语 |
| WOS ID | WOS:000167726400006 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/2853 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation 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. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 20011602159.pdf（536KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment