Lfc Is The Language Pattern Matching Method

This thesis is concerned with a part of the implementation of LFC (LanguageFor CFRF). Formal specification is a complete and accurate description of tasksthat a software system should perform. LFC is a functional language that isprovided by SAQ (Specification AcQuisition system), and is used to describeformal specifications. LFC can be executed directly in SAQ, so it is an executableformal specification language. While as a functional language, LFC has mostfeatures possessed by other functional languages; LFC is different from otherfunctional languages in that LFC uses context free language (CFL) as its basic datatype and the theory of CFRF (Recursive Function defined on Context-Freelanguages) as its theoretical basis. Pattern matching is an important feAn of mostfunctional languages, including LFC. The thesis itheduces a new method forpattern matching. The method uses term code, which is used in the current versionof LFC, and the idea on construction of pattern-matching tree, employs unificationtheory, and constructs pattern-matching tree via computing extensive set of thegiven pattern set.