• Title, Summary, Keyword: 추상구조화트리

Search Result 3, Processing Time 0.024 seconds

AST Creating and Crosscutting Concern Weaving Mechanism for Class Optimization in .NET Framework (닷넷 프레임워크에서 클래스 최적화를 위한 추상구조트리 생성 및 크로스커팅 위빙 메커니즘)

  • Lee, Seung-Hyung;Park, Je-Yeon;Song, Young-Jae
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.2
    • /
    • pp.89-98
    • /
    • 2010
  • The enterprise system is becoming more complex and larger. With the changes of the times, the system is developing to object-oriented programming method(OOP). However, the same code inserts to the core class repetitiously in the OOP, that causes a decrease in productivity and a trouble of application of another requirement. To solve this weak point, we propose a weaving mechanism what applies to metadata and crosscutting concern. For a class optimization and an integration between different languages, we take the following way. This paper uses three ways, those are, metadata generation using reflection, transformation to Abstract Syntax Tree, and mapping through crosscutting information specified XML. Through the proposed theory, class optimization can be accomplished by solving a functional decentralization and a confusion of codes.

Aspect Mining Process Design Using Abstract Syntax Tree (추상구문트리를 이용한 어스팩트 마이닝 프로세스 설계)

  • Lee, Seung-Hyung;Song, Young-Jae
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.5
    • /
    • pp.75-83
    • /
    • 2011
  • Aspect-oriented programming is the paradigm which extracts crosscutting concern from a system and solves scattering of a function and confusion of a code through software modularization. Existing aspect developing method has a difficult to extract a target area, so it is not easy to apply aspect mining. In an aspect minning, it is necessary a technique that convert existing program refactoring elements to crosscutting area. In the paper, it is suggested an aspect mining technique for extracting crosscutting concern in a system. Using abstract syntax structure specification, extract functional duplicated relation elements. Through Apriori algorithm, it is possible to create a duplicated syntax tree and automatic creation and optimization of a duplicated source module, target of crosscutting area. As a result of applying module of Berkeley Yacc(berbose.c) to mining process, it is confirmed that the length and volume of program has been decreased of 9.47% compared with original module, and it has been decreased of 4.92% in length and 5.11% in volume compared with CCFinder.

Visualization Techniques for Massive Source Code (대용량 소스코드 시각화기법 연구)

  • Seo, Dong-Su
    • The Journal of Korean Association of Computer Education
    • /
    • v.18 no.4
    • /
    • pp.63-70
    • /
    • 2015
  • Program source code is a set of complex syntactic information which are expressed in text forms, and contains complex logical structures. Structural and logical complexity inside source code become barriers in applying visualization techniques shown in traditional big-data approaches when the volume of source code become over ten-thousand lines of code. This paper suggests a procedure for making visualization of structural characteristics in source code. For this purpose, this paper defines internal data structures as well as inter-procedural relationships among functions. The paper also suggests a means of outlining the structural characteristics of source code by visualizing the source codes with network forms The result of the research work can be used as a means of controling and understanding the massive volume of source code.