Java語法樹與直譯機制

機構典藏 > College of Business and Management > Graduate Institute & Department of Information Management > Thesis > Item 987654321/34136

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/34136

Title:	Java語法樹與直譯機制
Other Titles:	Syntax tree and interpreting mechanism for Java language
Authors:	郭肇安;Kuo, Chao-an
Contributors:	淡江大學資訊管理學系碩士班廖賀田;Liaw, Heh-tyan
Keywords:	Java;語法樹;直譯器;Java;Syntax tree;Interpreter
Date:	2006
Issue Date:	2010-01-11 04:57:37 (UTC+8)
Abstract:	在傳統Java 程式的環境下，程式員若需執行Java 程式，都必須將原始碼編譯為位元組碼，再交由Java 虛擬機解譯執行。編譯後的位元組碼只是模擬原始碼的一種虛擬機器語言，與原始碼之間並沒有任何先天的關連性。本論文提出對Java 語言的直譯機制，透過此機制我們不需將原始碼編譯為位元組碼，而是將原始碼轉成語法樹結構。透過樹狀節點所配置的虛擬函數，以遞迴呼叫直接執行原始碼的語意。由於本直譯機制是採用遞迴呼叫的方式來完成，在遇到return 敘述、break 敘述與continue 敘述時，僅能跳離單一層級的遞迴呼叫，無法跳離多層級的遞迴呼叫。本論文採用try/catch 技術來突破因遞迴呼叫導致return 敘述、break 敘述與continue 敘述無法脫離深層遞迴的問題。在進行再造工程時，若採用Java 原始碼轉為語法樹結構，可利用語法樹的樹狀運動來完成再造工程。 In the Java environment, source codes are compiled into bytecodes and executed by the Java Virtual Machine. Bytecodes are opcodes for Java Virtual Machine that simulates source codes. There is no significant relationship between Java source codes and bytecodes. This thesis proposed an interpreting mechanism for Java language. Without compiling source codes into bytecodes, a syntax tree is presented. The source codes are parsed into syntax tree and executed through virtual functions and recursive calls. The interpreting mechanism executes codes through massive recursive calls. When executing statements such as return, break, or continue, the control flow should be returned to specific ancestor, and it can not be done by simplex recursive call. This problem is solved by adopting try/catch mechanism. The Syntax tree and interpreting mechanism proposed in the thesis provides an infrastructure for software developing and reengineering.
Appears in Collections:	[Graduate Institute & Department of Information Management] Thesis

Files in This Item:

File	Size	Format
	0Kb	Unknown	590	View/Open

Loading...