Indian Journal of Science and Technology
Year: 2016, Volume: 9, Issue: 38, Pages: 1-6
Shanthi Makka* and B. B. Sagar
BITs-Ranchi (Noida Campus), Noida - 201301, Uttar Pradesh, India; [email protected]
*Author for correspondence
BITs-Ranchi (Noida Campus)
The Objective is to optimize the time in identification of similar code segment in a program, which is represented using PDG. The method adapted is minimization of finite automata, the states, which are having similar transitions, can be combined into a single state, through which we can remove the duplicate code in program. Methodology used in current study is detection of isomorphic sub graphs in a graph where the program segment has been represented using graph, this approach is very lengthy because finding of sub graphs and identifying isomorphicity between sub graphs. Findings are the demonstrated through an example in figure 1 to figure 4. The efficiency of suggested idea has been demonstrated in analysis part. This approach can be used in compiler optimization phase because it connects computationally related parts of a program; PDG is non-linear data structure in which the transformations can be performed uniformly for both data and control dependences.
Keywords: DFA, Finite Automata, Isomorphic Graphs, Minimization of Finite Automata, Optimized PDG, PDG
Subscribe now for latest articles and news.