Inferring Bug Patterns for Detecting Bugs in JavaScript By Analyzing Abstract Syntax Tree

2018 ◽  
Author(s):  
Afsana Tasnim ◽  
Md. Rayhanur Rahman
Keyword(s):  
Abstract Syntax ◽  
Abstract Syntax Tree ◽  
Syntax Tree

scholarly journals Multi-purpose Syntax Definition with SDF3

2020 ◽  
pp. 1-23 ◽  
Author(s):  
Luís Eduardo de Souza Amorim ◽  
Eelco Visser
Keyword(s):  
Error Recovery ◽  
Abstract Syntax ◽  
Abstract Syntax Tree ◽  
Syntax Tree ◽  
Full Class ◽  
High Level ◽  
Modular Composition ◽  
Tree Representations ◽  
Context Free ◽  
Context Free Grammars

Abstract SDF3 is a syntax definition formalism that extends plain context-free grammars with features such as constructor declarations, declarative disambiguation rules, character-level grammars, permissive syntax, layout constraints, formatting templates, placeholder syntax, and modular composition. These features support the multi-purpose interpretation of syntax definitions, including derivation of type schemas for abstract syntax tree representations, scannerless generalized parsing of the full class of context-free grammars, error recovery, layout-sensitive parsing, parenthesization and formatting, and syntactic completion. This paper gives a high level overview of SDF3 by means of examples and provides a guide to the literature for further details.

scholarly journals WASTK: A Weighted Abstract Syntax Tree Kernel Method for Source Code Plagiarism Detection

2017 ◽  
Vol 2017 ◽  
pp. 1-8 ◽  
Author(s):  
Deqiang Fu ◽  
Yanyan Xu ◽  
Haoran Yu ◽  
Boyang Yang
Keyword(s):  
Kernel Method ◽  
Source Code ◽  
Detection Methods ◽  
Abstract Syntax ◽  
Plagiarism Detection ◽  
Abstract Syntax Tree ◽  
Syntax Tree ◽  
Tree Kernel ◽  
Document Frequency ◽  
Abstract Syntax Trees

In this paper, we introduce a source code plagiarism detection method, named WASTK (Weighted Abstract Syntax Tree Kernel), for computer science education. Different from other plagiarism detection methods, WASTK takes some aspects other than the similarity between programs into account. WASTK firstly transfers the source code of a program to an abstract syntax tree and then gets the similarity by calculating the tree kernel of two abstract syntax trees. To avoid misjudgment caused by trivial code snippets or frameworks given by instructors, an idea similar to TF-IDF (Term Frequency-Inverse Document Frequency) in the field of information retrieval is applied. Each node in an abstract syntax tree is assigned a weight by TF-IDF. WASTK is evaluated on different datasets and, as a result, performs much better than other popular methods like Sim and JPlag.

scholarly journals Abstract Syntax Tree Based Source Code Antiplagiarism System for Large Projects Set

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 175347-175359
Author(s):  
Michal Duracik ◽  
Patrik Hrkut ◽  
Emil Krsak ◽  
Stefan Toth
Keyword(s):  
Source Code ◽  
Abstract Syntax ◽  
Abstract Syntax Tree ◽  
Syntax Tree

scholarly journals Automatic Grading for Complex Multifile Programs

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Tiantian Wang ◽  
Djoko Budi Santoso ◽  
Kechao Wang ◽  
Xiaohong Su
Keyword(s):  
Programming Problem ◽  
Program Analysis ◽  
Abstract Syntax ◽  
Fusion Algorithm ◽  
Abstract Syntax Tree ◽  
Syntax Tree ◽  
External Sources ◽  
Standardization Process ◽  
Automatic Grading ◽  
And Function

This paper presents an automatic grading method DGRADER, which handles complex multifile programs. Both the dynamic and the static grading support multifile program analysis. So, it can be an advantage to handle complex programming problem which requires more than one program file. Dynamic analysis takes advantage of object file linker in compilation to link complex multifile program. The static grading module consists of the following steps. Firstly, the program is parsed into abstract syntax tree, which is mapped into abstract syntax tree data map. Then, the information of preprocessor is used for linking external sources called in main program by complex multifile program linker-fusion algorithm. Next, standardization process is performed for problematic code removal, unused function removal, and function sequence ordering based on function call. Finally, program matching successfully tackles structure variance problem by previous standardization process and by simple tree matching using tag classifier. The novelty of the approach is that it handles complex multifile program analysis with flexible grading with consideration of modularity and big scale of programming problem complexity. The results have shown improvement in grading precision which gives reliable grading score delivered with intuitive system.

Design of MDA Based Model Transformation Profile for Model Verification

2012 ◽  
Vol 224 ◽  
pp. 69-72
Author(s):  
Jong Won Ko
Keyword(s):  
Model Transformation ◽  
Model Verification ◽  
Design Model ◽  
Abstract Syntax ◽  
Formal Representation ◽  
Design Models ◽  
Abstract Syntax Tree ◽  
Syntax Tree ◽  
Traditional Research ◽  
Model Transformation Verification

Validation of existing software design models and transformed target models for the study, mainly checking (Model Checking) with a code-based software designed to define in the abstract syntax tree or on the models generated using refactoring on design models for refinery operations and define how to perform. The problem with these traditional research methods, but the first model, design model for checking the information with the model by defining a formal representation in the form of an abstract syntax tree, as you've shown how to perform validation of UML design model. Additional steps need to define more complex due to a software problem that is not the way to the model suitable for model transformation verification. In this paper, as defined in the MDA based model transformation studies of a graph based mode transformation, and how to perform model transformation verification through improving graph comparison algorithm and model property information.

Sign in / Sign up

Export Citation Format

Share Document