Paper Info
Title
Pattern Matching Compilation of Functions Defined in Context-Free Languages
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.
Year
DOI
Venue
2001
10.1007/BF02950420
Journal of Computer Science and Technology
Keywords
Field
DocType
algorithm,context-free language,functional language,pattern matching,recursive function,context free language
Integer,String searching algorithm,Context-free language,Programming language,Functional programming,Computer science,Theoretical computer science,Recursive functions,Pattern matching,Encoding (memory)
Journal
Volume
Issue
ISSN
16
2
1860-4749
Citations 
PageRank 
References 
0
0.34
5
Authors
2
Name
Order
Citations
PageRank
Haiming Chen126632.36
Yunmei Dong241.13