Automatically Fixing Syntax Errors Using the Levenshtein Distance
Clicks: 277
ID: 13834
2016
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
66.6
/100
277 views
221 readers
Trending
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #28 of 148 articles by views in adbu journal of engineering technology
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 148 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Abstract: To ensure high quality software, much emphasis is laid on software testing. While a number of techniques and tools already exist to identify and locate syntax errors, it is still the duty of programmers to manually fix each of these uncovered syntax errors. In this paper we propose an approach to automate the task of fixing syntax errors by using existing compilers and the levenshtein distance between the identified bug and the possible fixes. The levenshtein distance is a measure of the similarity between two strings. A prototype, called ASBF, has also been built and a number of tests carried out which show that the technique works well in most cases. ASBF is able to automatically fix syntax errors in any erroneous source file and can also process several erroneous files in a source folder. The tests carried out also show that the technique can also be applied to multiple programming languages. Currently ASBF can automatically fix software bugs in the Java and the Python programming languages. The tool also has auto-learning capabilities where it can automatically learn from corrections made manually by a user. It can thereafter couple this learning process with the levenshtein distance to improve its software bug correction capabilities. Keywords: Automatically fixing syntax errors, bug fixing, auto-learn, levenshtein distance, Java, Python (Article history: Received 16 September 2016 and accepted 9 December 2016)
| Reference Key |
nagowah2016automaticallyadbu
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Leckraj Nagowah Antish Jeetun Suneil Jooty, Soulakshmee Nagowah; |
| Journal | adbu journal of engineering technology |
| Year | 2016 |
| DOI |
DOI not found
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.