LFC is a functional language based on recursive functions defined in context-free languages. In this paper, a new patt matching algorithm for LFC is presented, which can represent a sequence of patts as an integer by an encoding method. It is a rather simple method and produces efficient case-expressions for patt matching definitions of LFC. The algorithm can also be used for other functional languages, but for nested patts it may become complicated and further studies are needed.