Pattern Matching Compilation of Function Defined in Context-Free Languages

LFC is a functional language based on recursive functions defined incontext-free languages. In this paper, a new pattern matching algorithm for LFC ispresented, which can represent a sequence of patterns as an integer byan encoding method.It is a rather simple method and produces efficient case-expressions forpattern matching definitions of LFC. The algorithm can also be used forother functional languages, but for nested patterns it may becomecomplicated and further studies are needed.