Software artifacts recovery using abstract regular expressions

被引:0
|
作者
Rasool, Ghulam [1 ]
Asif, Nadim [1 ]
机构
[1] CIIT Lahore, Dept Comp Sci, Lahore, Pakistan
关键词
artifact recovery; pattern matching; regular expressions; reverse engineering; source code analysis;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Program comprehension and artifacts recovery of legacy software systems is assisted by tools that match patterns oil the source code of different programming languages and text flies. There are different capable pattern matching tools including lexical, syntactic and semantic restricted by limitations. The lexical pattern matchers have been given excellent performance, known for case of use and abstract regular expression capabilities. Despite the high degree of performance in pattern matching, these matchers have limited vocabulary that restricts the eclectic restructuring of software components. The syntactic pattern matcher provides precision but may sacrifice the performance, robustness, or power. It is imperative to use the superlative features of both the lexical and syntactic tools that ensure performance, precision and high degree of innovative vocabulary. This paper present a lexical based Pattern matching technique using abstract regular expressions and design recovery tool(DRT) incorporating superlative features of lexical an syntactic pattern matching tools to extract artifacts from legacy software applications.
引用
收藏
页码:167 / 172
页数:6
相关论文
共 50 条
  • [41] Implication of regular expressions
    Thomo, Alex
    APPLIED MATHEMATICS LETTERS, 2012, 25 (10) : 1394 - 1398
  • [42] Synchronized regular expressions
    Giuseppe Della Penna
    Benedetto Intrigila
    Enrico Tronci
    Marisa Venturini Zilli
    Acta Informatica, 2003, 39 : 31 - 70
  • [43] Memoized Regular Expressions
    Van der Merwe, Brink
    Mouton, Jacobie
    Van Litsenborgh, Steyn
    Berglund, Martin
    IMPLEMENTATION AND APPLICATION OF AUTOMATA (CIAA 2021), 2021, 12803 : 39 - 52
  • [44] Intersection of -ω-Regular Expressions
    A. N. Chebotarev
    Cybernetics and Systems Analysis, 2021, 57 : 676 - 684
  • [45] On a generalization of regular expressions
    Gomozov, AL
    Stanevichene, LI
    PROGRAMMING AND COMPUTER SOFTWARE, 2000, 26 (05) : 258 - 267
  • [46] On Extended Regular Expressions
    Carle, Benjamin
    Narendran, Paliath
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 279 - 289
  • [47] Regular Expressions with Lookahead
    Berglund, Martin
    van Der Merwe, Brink
    van Litsenborgh, Steyn
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2021, 27 (04) : 324 - 340
  • [48] Probabilistic ω-Regular Expressions
    Weidner, Thomas
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 588 - 600
  • [49] Regular expressions of conditions
    Popa, Emil Marin
    3RD INT CONF ON CYBERNETICS AND INFORMATION TECHNOLOGIES, SYSTEMS, AND APPLICAT/4TH INT CONF ON COMPUTING, COMMUNICATIONS AND CONTROL TECHNOLOGIES, VOL 3, 2006, : 174 - 176
  • [50] Suggesting Reviewers of Software Artifacts using Traceability Graphs
    Sulun, Emre
    ESEC/FSE'2019: PROCEEDINGS OF THE 2019 27TH ACM JOINT MEETING ON EUROPEAN SOFTWARE ENGINEERING CONFERENCE AND SYMPOSIUM ON THE FOUNDATIONS OF SOFTWARE ENGINEERING, 2019, : 1250 - 1252