论文信息 - A Language for Semantic Analysis

A Language for Semantic Analysis

Abstract : Semantic analysis is important for compilers. In the APTS program transformation system, semantics is specified by rules in the language RSL. The semantic rules are interpreted by APTS to generate the semantic information of the program, which is then used by the rewriting engine for program translation. This approach has proved to be convenient and powerful in our construction of a SETL-to-C compiler. In this paper, we discuss the features, applications, implementation strategy, and performance of RSL.

J. Cai | J. Cai

[1] Ho Soo Lee,et al. Advances in Rete Pattern Matching , 1986, AAAI.

[2] Daniel P. Miranker. TREAT: a better match algorithm for AI production systems , 1987, AAAI 1987.

[3] Charles L. Forgy,et al. Rete: a fast algorithm for the many pattern/many object pattern match problem , 1991 .

[4] Alfred V. Aho,et al. Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[5] Ho Soo Lee,et al. Match Algorithms for Generalized Rete Networks , 1992, Artif. Intell..

[6] Robert E. Tarjan,et al. More Efficient Bottom-Up Tree Pattern Matching , 1990, CAAP.

[7] Jeffrey D. Uuman. Principles of database and knowledge- base systems , 1989 .

[8] Robert Paige,et al. Program Derivation by Fixed Point Computation , 1989, Sci. Comput. Program..

[9] Daniel P. Miranker,et al. The Organization and Performance of a TREAT-Based Production System Compiler , 1991, IEEE Trans. Knowl. Data Eng..

[10] Jeffrey D. Ullman,et al. Principles Of Database And Knowledge-Base Systems , 1979 .

[11] Elaine J. Weyuker,et al. Computability, complexity, and languages , 1983 .

[12] H. S. Lee,et al. Dynamic augmentation of generalized Rete networks for demand-driven matching and rule updating , 1990, Sixth Conference on Artificial Intelligence for Applications.