Identification of File and Directory Level Near-Miss Clones for Higher Level Cloning
Sonam Gupta1, Vishwachi2
1Sonam Gupta, Associate Professor, Department of Computer Science and Engineering, Ajay Kumar Garg Engineering College, Ghaziabad (U.P), India.
2Vishwachi, Assistant Professor, Department of Information Technology, ABESIT Engineering College, Ghaziabad (U.P), India.
Manuscript received on 18 February 2019 | Revised Manuscript received on 27 February 2019 | Manuscript published on 28 February 2019 | PP: 257-262 | Volume-8 Issue-3, February 2019 | Retrieval Number: C572002831919/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The presence of code cloning, which speaks to duplicate segments of code, has been archived to happen much of the time in programming frameworks. The principle reason for cloning is reusing the part of the code that plays out some usefulness by duplicating and rewriting it to another area in the source code. The concentration here is to detect duplication in software program, which is a noteworthy reason for poor structure in programs. The key, novel part of our duplicationdetection approach is detection of near-miss clones at higher level of granularity i.e, the directory and file level. Our work is a progress over past work around there as earlier the granularity of clone detection was method level. The technique adopted incorporates a novel hybrid approach using Abstract Syntax Tree and metrics to achieve precision. The results indicate the ability to detect Type-1, 2, 3 clones at directory and folder level.
Keywords: Levenshtein Distance, Re-Ordered Clones, Syntactic Clones.
Scope of the Article: Information Retrieval