基于Java语言的抽象语法树的创建与遍历_廖兴.pdfVIP

18 　 4 　　　　　 Vol.18　No.4 2 0 0 4 12 　　　　　　　　　J OURNA L OF CHA NGSHA UNIV ERSITY 　　　　　　　　　　 Dec.2 0 0 4 Java 廖　兴　尹俊文　蔡　放 ( , 410073) 　:抽象语法树(Abstract Syntax Tree , AST)作为程序的一种中间表示形式, 在程序分析等诸多领域有广泛的应用. 用抽象语法树可以方便地实现多种源程序处理工具, 比如源程序浏览器、智能编辑器、语言翻译器等.本文作者介绍了抽 象语法树涉及的原理及解释器的设计方案, 针对Java 语言, 用设计模式理论提出了创建和遍历抽象语法树的思路, 并给 出较为详细的代码说明. :抽象语法树;解释器;模式;创建;遍历 :TP311　　　:A　　　:1008-4681(2004)04-0050-04 Build and Traverse of Abstract Syntax Tree Based on Java Program LIAO Xing　 IN Junwen　CAI Fang (School of Computer Science, National University of DefenseTechnology, Changsha 410073, China) Abstract:Abstract Syntax Tree, referred as intermediate representation of program, has many applications in Program Analysis.UsingAbstract Syntax Tree, we can develop tools such as Source Code Explorer, Intellectual Edi- tor, etc.This paper introduces the principles of Abstract Syntax Tree, and presents an appropriate solution to design Interpreter based on Java Program.With the help of Design Patterns, we can build and traverse an Abstract Syntax Tree.Moreover, the paper gives illustrations of concerned source codes. Key words:Abstract Syntax Tree;Interpreter;Pattern;Build;Traverse getFoo(int foo)foo., 1　 getFoo(int foo) ,Java foo this.foo . .Java ? Java , , , Java ., , : “foo”, :Example “foo”, package example; . public class Example { , 　int foo = 1;