Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,115,626 papers from all fields of science
Search
Sign In
Create Free Account
Abstract syntax tree
Known as:
Abstract syntax trees
, Abstract syntax tree representation
, Syntax tree
Expand
In computer science, an abstract syntax tree (AST), or just syntax tree, is a tree representation of the abstract syntactic structure of source code…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ANTLR
Abstract syntax
Automatic bug fixing
Camlp4
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A fast abstract syntax tree interpreter for R
T. Kalibera
,
Petr Maj
,
Floréal Morandat
,
J. Vitek
International Conference on Virtual Execution…
2014
Corpus ID: 16602972
Dynamic languages have been gaining popularity to the point that their performance is starting to matter. The effort required to…
Expand
Highly Cited
2010
Highly Cited
2010
Online mining of temporal maximal utility itemsets from data streams
Bai-En Shie
,
V. Tseng
,
Philip S. Yu
ACM Symposium on Applied Computing
2010
Corpus ID: 15630693
Data stream mining has become an emerging research topic in the data mining field, and finding frequent itemsets is an important…
Expand
Highly Cited
2004
Highly Cited
2004
Design and Evaluation of an Automated Aspect Mining Tool
D. Shepherd
,
Emily Hill
,
L. Pollock
Software Engineering Research and Practice
2004
Corpus ID: 17402049
Also presented at the 2005 Mid-Atlantic Student Workshop on Programming Languages and Systems (MASPLAS) in April 2005.
2001
2001
Compressed Abstract Syntax Trees for Mobile Code
Christian H. Stork
,
Vivek Haldar
2001
Corpus ID: 16148637
Abstract syntax trees (ASTs) have numerous advantages as a mobile code format over the more commonly used bytecode-based formats…
Expand
2000
2000
Uniform abstract syntax trees
Chris Clark
SIGP
2000
Corpus ID: 32579109
The key reason one might want to use AST nodes with uniform structure is so that those nodes can be easily moved around. With…
Expand
Highly Cited
2000
Highly Cited
2000
Stepping through Haskell
A. Dijkstra
2000
Corpus ID: 26980200
This thesis contains a description of an implementation of an extended subset of the programming language Haskell. At the same…
Expand
1997
1997
Toward a calculus for abstract syntax trees
D. S. Wile
1997
Corpus ID: 35124914
Metaprogramming — writing programs that manipulate programs as data — requires a formal foundation in order that people be able…
Expand
1997
1997
Intelligent Components and Software Generators
D. Batory
1997
Corpus ID: 59664306
The production of well-understood software will eventually be the responsibility of software generators. Generators will enable…
Expand
1996
1996
Implicit Modeling of Tree Surfaces
Brent Baker
,
J. Hart
1996
Corpus ID: 16806759
Tree models can be categorized into two classes: global models that represent the developmental form of the entire tree, and…
Expand
Highly Cited
1979
Highly Cited
1979
Generalized1.5 Sequential Machine Maps
A. Buda
Information Processing Letters
1979
Corpus ID: 41466295
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE