Results 271 to 280 of about 100,345 (312)
Some of the next articles are maybe not open access.
A fast abstract syntax tree interpreter for R
Proceedings of the 10th ACM SIGPLAN/SIGOPS international conference on Virtual execution environments, 2014Dynamic 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 +1 more source
Migrating to an Extensible Architecture for Abstract Syntax Trees
2015 12th Working IEEE/IFIP Conference on Software Architecture, 2015We 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.
Monteiro Duarte Couto, Luis Diogo +3 more
openaire +3 more sources
Automating Abstract Syntax Tree Construction for Context Free Grammars
2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012In most of the compilers or programming languages tools, parsers are used for transforming human readable code into Parse Trees or Abstract Syntax Trees (AST). A popular method to create parsers is to use a parser generator. Advanced parser generators (e.g.
Andrei Arusoaie, Daniel Ionut Vicol
openaire +1 more source
Inferring Student Coding Goals Using Abstract Syntax Trees
2016The rapidly growing demand for programming skills has driven improvements in the technologies delivering programming education to students. Intelligent tutoring systems will potentially contribute to solving this problem, but development of effective systems has been slow to take hold in this area.
Paul Freeman, Ian Watson, Paul Denny
openaire +1 more source
Toward a calculus for abstract syntax trees
1997Metaprogramming — writing programs that manipulate programs as data — requires a formal foundation in order that people be able to reason about the effects of their metaprograms. Of equal importance, metaprogramming requires an intuitive foundation that facilitates most frequent, natural manipulations of programs as data.
openaire +1 more source
Improved Plagiarism Detection Algorithm Based on Abstract Syntax Tree
2013 Fourth International Conference on Emerging Intelligent Data and Web Technologies, 2013Statements with conditionals are widely used in C, C++ and java, such as if and while statements and they are easy to plagiarize by adjusting the logical structure of the corresponding statements. However, the existing relative algorithms and tools cannot effectively detect code plagiarism of these statements.
Guo Tao +3 more
openaire +1 more source
An Abstract Syntax Tree based static fuzzing mutation for vulnerability evolution analysis
Information and Software Technology, 2023Wei Zheng +3 more
semanticscholar +1 more source
Exploiting Parallelism Available in Loops Using Abstract Syntax Tree
2019Performance of a program depends on two factors: better hardware of the executing machine and exploiting parallelism for concurrent execution. Loops with multiple iterations provide efficient parallelism in an application, and are used to reduce overall execution time and also to increase performance.
Anil Kumar, Hardeep Singh
openaire +1 more source
Foundations of Tree- and Graph-Based Abstract Syntax
2018A software language can be regarded as a set of structured elements with some associated meaning. A language’s syntax defines its elements and their structure. We may speak of string, tree, and graph languages – to convey the nature of the elements’ structure. One may distinguish two forms of syntax: concrete versus abstract syntax.
openaire +1 more source