The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

  
       
         
    STUDIA INFORMATICA - Issue no. 2 / 2008  
         
  Article:   THE RECONSTRUCTION OF A CONTRACTED ABSTRACT SYNTAX TREE.

Authors:  RÓBERT KITLEI. 		 
       
         
  Abstract:  Syntax trees are commonly used by compilers to represent the structure of the source code of a program, but they are not convenient enough for other tasks. One such task is refactoring, a technique to improve program code by changing its structure. In this paper, we shortly describe a representation of the abstract syntax tree (AST), which is better suited for the needs of refactoring. This is achieved by contracting nodes and edges in the tree. The representation serves as the basis of the back-end of a prototype Erlang refactoring tool, however, it is adaptable to languages different from Erlang. In turn, we introduce an algorithm to reconstruct the AST from the representation. This is required in turn to reproduce the source code, the ultimate step of refactoring.

Key words and phrases. Abstract syntax tree, Syntactic reconstruction. 		 
         
     
         
         
      Back to previous page