This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Abstract syntax" – news · newspapers · books · scholar · JSTOR(November 2023) (Learn how and when to remove this message)
In computer science, the abstract syntax of data is its structure described as a data type (possibly, but not necessarily, an abstract data type), independent of any particular representation or encoding.[1] This is particularly used in the representation of text in computer languages,[2] which are generally stored in a tree structure as an abstract syntax tree. Abstract syntax, which only consists of the structure of data, is contrasted with concrete syntax, which also includes information about the representation. For example, concrete syntax includes features like parentheses (for grouping) or commas (for lists), which are not included in the abstract syntax, as they are implicit in the structure.
Abstract syntaxes are classified as first-order abstract syntax (FOAS), if the structure is abstract but names (identifiers) are still concrete (and thus requires name resolution), and higher-order abstract syntax, if the names themselves are abstract.[3]
^Fiore, M.; Plotkin, G.; Turi, D. (1999). "Abstract syntax and variable binding". Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158). pp. 193–202. doi:10.1109/LICS.1999.782615. ISBN 0-7695-0158-3. S2CID 7384052. Retrieved 2023-11-02.
^"ASTLOG: A language for examining abstract syntax trees". DSL'97: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997. USENIX Association. 15 October 1997. p. 18.
An abstractsyntax tree (AST) is a data structure used in computer science to represent the structure of a program or code snippet. It is a tree representation...
computer science, the abstractsyntax of data is its structure described as a data type (possibly, but not necessarily, an abstract data type), independent...
Each front end uses a parser to produce the abstractsyntax tree of a given source file. Due to the syntax tree abstraction, source files of any of the...
James Hendler and Guus Schreiber. The first working drafts of the abstractsyntax, reference and synopsis were published in July 2002. OWL became a formal...
SGML has an abstractsyntax implemented by many possible concrete syntaxes; however, this is not the same usage as in an abstractsyntax tree and as in...
In computer science, an abstract semantic graph (ASG) or term graph is a form of abstractsyntax in which an expression of a formal or programming language...
generic programming, modelling programming languages (higher-order abstractsyntax), maintaining invariants in data structures, expressing constraints...
syntax, the term syntax tree is more common. Concrete syntax trees reflect the syntax of the input language, making them distinct from the abstract syntax...
e. deconstructing and constructing abstractsyntax trees in concrete syntax. The following example defines a syntax extension of OCaml. It provides a new...
Apache Groovy is a Java-syntax-compatible object-oriented programming language for the Java platform. It is both a static and dynamic language with features...
use any desired syntax, but it must be possible to demonstrate precisely how the concrete syntax of a dialect conforms to the abstract CL semantics, which...
algorithms. Both abstract and concrete syntaxes of parsing expressions are seen in the literature, and in this article. The abstractsyntax is essentially...
standard.[citation needed] MMS Protocol Details MMS Overview MMS V1 AbstractSyntax MMS Protocol Description MMS. Presentation by Prof. Dr. H. Kirrmann...
Syntax tree may refer to: Abstractsyntax tree, used in computer science Concrete syntax tree, used in linguistics This disambiguation page lists articles...
processing. Algebraic data types are highly suited to implementing abstractsyntax. For example, the following algebraic data type describes a simple...
document as a parse tree with respect to language's grammar, or as an abstractsyntax tree (AST). For example, a DOM tree is essentially an AST with respect...
The syntax and semantics of Prolog, a programming language, are the sets of rules that define how a Prolog program is written and how it is interpreted...
notation string, also known as Reverse Polish notation (RPN), or an abstractsyntax tree (AST). The algorithm was invented by Edsger Dijkstra and named...
also used compile-time to run macros, which allow modification of the abstractsyntax tree (AST). This strategy of compiling to multiple source code languages...
combined lexer-parsers. Parsers can automatically generate parse trees or abstractsyntax trees, which can be further processed with tree parsers. ANTLR provides...
programming by means of manipulating abstractsyntax trees and 'splicing' results back into a program. The abstractsyntax is represented using ordinary Haskell...
Global Information