This article needs additional citations for verification. (November 2023) |
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]
Uses
editTo be implemented either for computation or communications, a mapping from the abstract syntax to specific machine representations and encodings must be defined; these may be called the "concrete syntax" (in language implementation)[4] or the "transfer syntax" (in communications).
A compiler's internal representation of a program will typically be specified by an abstract syntax in terms of categories such as "statement", "expression" and "identifier". This is independent of the source syntax (concrete syntax) of the language being compiled (though it will often be very similar). A parse tree is similar to an abstract syntax tree but it will typically also contain features such as parentheses, which are syntactically significant but which are implicit in the structure of the abstract syntax tree.
Algebraic data types are particularly well-suited to the implementation of abstract syntax.[5]
See also
editReferences
edit- ^ 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.
- ^ Pfenning, F.; Elliott, C. (1988-06-01). "Higher-order abstract syntax". ACM SIGPLAN Notices. 23 (7): 199–208. doi:10.1145/960116.54010. ISSN 0362-1340.
- ^ Wile, David S. (1997). "Abstract syntax from concrete syntax". Proceedings of the 19th international conference on Software engineering - ICSE '97. ACM Press. pp. 472–480. doi:10.1145/253228.253388. ISBN 978-0-89791-914-2. S2CID 14351497.
- ^ Corradini, Andrea; Gadducci, Fabio (2002-09-17). "A functorial semantics for multi-algebras and partial algebras, with applications to syntax". Theoretical Computer Science. 286 (2): 293–322. doi:10.1016/S0304-3975(01)00319-X. ISSN 0304-3975.
 | This programming-language-related article is a stub. You can help Wikipedia by expanding it. |