English  |  正體中文  |  简体中文  |  Items with full text/Total items : 57075/90742 (63%)
Visitors : 12495835      Online Users : 150
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/68639

    Title: Java的語法樹直譯器
    Other Titles: A Syntax-Tree-Based Interpreter for Java
    Authors: 周敬斐;郭肇安;廖賀田
    Contributors: 淡江大學資訊管理學系
    Keywords: Java;語法樹;直譯器;Java;Syntax Tree;Interpreter
    Date: 2008-06
    Issue Date: 2011-10-23 13:21:12 (UTC+8)
    Publisher: 淡江大學資訊管理研究所
    Abstract: The Java programming language, with advantages such as object-orientation,
    portability and multi-threading, is one of the most popular programming languages. In
    current time, the Java source code has to be compiled into an intermediate language, the
    bytecode, before it can be interpreted by the Java virtual machine. However, there is no
    intrinsic relationship between bytecode and its source code, and there is no special benefit
    in interpreting the bytecode either.
    In this paper, we recommend adoption of the syntax tree to be the intermediate
    language for Java, and we propose techniques for interpreting it. The syntax tree is an
    essential data structure when parsing the source code. Furthermore, it bears strongest
    relation with the source code. By appending suitable methods into various types of nodes in
    the syntax tree, the interpreter can be implemented through recursive call and dynamic
    binding. We also utilize the exception mechanism to quit from the control flow of deep
    method calls. In order to cooperate with the popular bytecode, we propose a bridge
    mechanism to interconnect the interpretations of both bytecode and the syntax tree.
    It is very easy to build an interpreter based on the syntax tree. Our syntax-tree-based
    interpreter for Java has been successfully implemented, and it works well on interpreting
    practical Java software. Since the correspondence between the syntax tree and the source
    code is direct and natural, it will be easier to implement a debugging mechanism in the
    future. Furthermore, we can equip graphical rendering functions into the syntax tree, so that
    the interpreter can provide instinctive assistance in teaching the Java programming
    language and data structures.
    Java 程式語言具有物件導向(object-oriented)、可攜(portable)與多執行緒
    (multi-threading)等優點,是當今最風行的程式語言之一。目前所有的 Java 原始檔都必
    須被編譯成稱為位元組碼(bytecode)的中間語言(intermediate language),再交由 Java 虛
    擬機(java virtual machine)進行直譯。但位元組碼與 Java 的原始碼之間並沒有本質上的
    本論文主張以 Java 語法樹(syntax tree)當成中間語言,並提出對它進行直譯
    (method),運用遞迴呼叫(recursive call)與動態繫結(dynamic binding)來製作直譯器。我
    們也利用例外機制(exception mechanism)來脫離進入多層呼叫後的控制流程(control
    Relation: 資訊管理展望 10(1), p.111-135
    DOI: 10.29715/JIMCSA.200806.0006
    Appears in Collections:[Graduate Institute & Department of Information Management] Journal Article

    Files in This Item:

    File Description SizeFormat
    Java的語法樹直譯器.pdf1772KbAdobe PDF0View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback