Results 251 to 260 of about 113,367 (297)

Large language model based mutations in genetic improvement. [PDF]

open access: yesAutom Softw Eng
Brownlee AEI   +7 more
europepmc   +1 more source

A fast abstract syntax tree interpreter for R

Proceedings of the 10th ACM SIGPLAN/SIGOPS international conference on Virtual execution environments, 2014
Dynamic languages have been gaining popularity to the point that their performance is starting to matter. The effort required to develop a production-quality, high-performance runtime is, however, staggering and the expertise required to do so is often out of reach of the community maintaining a particular language.
Tomas Kalibera   +3 more
openaire   +3 more sources

Integer Promotion Elimination on Abstract Syntax Tree

2010 10th IEEE International Conference on Computer and Information Technology, 2010
In the C programming language standard, there are rules for implicit type conversions, including integer promotion rules. These rules, as well as the explicit type conversions imposed by the coder, may result in redundant code for 8-bit MCUs. However, code size is critical for the programs running in embedded systems, since smaller code size often ...
Lei Zhou   +4 more
openaire   +2 more sources

Clone detection using abstract syntax trees

Proceedings. International Conference on Software Maintenance (Cat. No. 98CB36272), 2002
Existing research suggests that a considerable fraction (5-10%) of the source code of large scale computer programs is duplicate code ("clones"). Detection and removal of such clones promises decreased software maintenance costs of possibly the same magnitude. Previous work was limited to detection of either near misses differing only in single lexems,
Marcelo Sant'Anna   +4 more
openaire   +2 more sources

A Heterogeneous Graph to Abstract Syntax Tree Framework for Text-to-SQL

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2023
Text-to-SQL is the task of converting a natural language utterance plus the corresponding database schema into a SQL program. The inputs naturally form a heterogeneous graph while the output SQL can be transduced into an abstract syntax tree (AST). Traditional encoder-decoder models ignore higher-order semantics in heterogeneous graph encoding and ...
Ruisheng Cao   +6 more
openaire   +2 more sources

Migrating to an Extensible Architecture for Abstract Syntax Trees

2015 12th Working IEEE/IFIP Conference on Software Architecture, 2015
We present and analyse an architectural migration in the Overture tool, a tool for which the primary internal data structure is an Abstract Syntax Tree (AST). The migration was from a high-cohesion AST with functionality encapsulated in its nodes to an extensible, low-cohesion AST with functionality implemented in visitors.
Luis Diogo Couto   +3 more
openaire   +2 more sources

TBCNN for Programs’ Abstract Syntax Trees

2018
In this chapter, we will apply the tree-based convolutional neural network (TBCNN) to the source code of programming languages, which we call programming language processing. In fact, programming language processing is a hot research topic in the field of software engineering; it has also aroused growing interest in the artificial intelligence ...
Lili Mou, Zhi Jin
openaire   +2 more sources

Code Summarization with Abstract Syntax Tree

2019
Code summarization, which provides a high-level description of the function implemented by code, plays a vital role in software maintenance and code retrieval. Traditional approaches focus on retrieving similar code snippets to generate summaries, and recently researchers pay increasing attention to leverage deep learning approaches, especially the ...
Qiuyuan Chen, Zhaoyi Liu, Han Hu
openaire   +2 more sources

Generating Rewritable Abstract Syntax Trees

2009
Building a production-quality refactoring engine or similar source code transformation tool traditionally requires a large amount of hand-written, language-specific support code. We describe a system which reduces this overhead by allowing both a parser and a fully rewritable AST to be generated automatically from an annotated grammar, requiring little
Jeffrey Overbey, Ralph E. Johnson
openaire   +2 more sources

Home - About - Disclaimer - Privacy