Pattern matching compilation of functions defined in context-free languages

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-...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computer science and technology 2001-03, Vol.16 (2), p.159-167
Main Authors: Chen, Haiming, Dong, Yunmei
Format: Article
Language:English
Subjects:
Algorithms
Context free languages
Encoding
Functionals
Integers
Matching
Mathematical analysis
Mathematical models
Pattern matching
Recursive functions
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1000-9000
1860-4749
DOI:10.1007/BF02950420