Polytypic Syntax Tree Operations

2006 ◽  
pp. 142-159 ◽  
Author(s):  
Arjen van Weelden ◽  
Sjaak Smetsers ◽  
Rinus Plasmeijer
Keyword(s):  
Syntax Tree

Source-Code Similarity Measurement: Syntax Tree Fingerprinting for Automated Evaluation

2021 ◽  
Author(s):  
Arjun Verma ◽  
Prateksha Udhayanan ◽  
Rahul Murali Shankar ◽  
Nikhila KN ◽  
Sujit Kumar Chakrabarti
Keyword(s):  
Source Code ◽  
Similarity Measurement ◽  
Syntax Tree ◽  
Automated Evaluation

Abstract Syntax Tree (AST) and Control Flow Graph (CFG) Construction of Notasi Algoritmik

2021 ◽  
Author(s):  
Irfan Sofyana Putra ◽  
Satrio Adi Rukmono ◽  
Riza Satria Perdana
Keyword(s):  
Control Flow ◽  
Control Flow Graph ◽  
Abstract Syntax ◽  
Flow Graph ◽  
Abstract Syntax Tree ◽  
Syntax Tree ◽  
And Control

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.

Visualizing Project Evolution through Abstract Syntax Tree Analysis

2016 ◽  
Author(s):  
Michael D. Feist ◽  
Eddie Antonio Santos ◽  
Ian Watts ◽  
Abram Hindle
Keyword(s):  
Abstract Syntax ◽  
Tree Analysis ◽  
Abstract Syntax Tree ◽  
Syntax Tree

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
Sign in / Sign up

Export Citation Format

Share Document