About: Abstract semantic graph

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Abstract semantic graph Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In computer science, an abstract semantic graph (ASG) or term graph is a form of abstract syntax in which an expression of a formal or programming language is represented by a graph whose vertices are the expression's subterms. An ASG is at a higher level of abstraction than an abstract syntax tree (or AST), which is used to express the syntactic structure of an expression or program.

Attributes	Values
rdfs:label	Abstract semantic graph (en)
rdfs:comment	In computer science, an abstract semantic graph (ASG) or term graph is a form of abstract syntax in which an expression of a formal or programming language is represented by a graph whose vertices are the expression's subterms. An ASG is at a higher level of abstraction than an abstract syntax tree (or AST), which is used to express the syntactic structure of an expression or program. (en)
sameAs	Abstract semantic graph Abstract semantic graph
dbp:wikiPageUsesTemplate	dbt:Cite_conference dbt:Cite_document dbt:Cite_web dbt:Clarify dbt:Reflist dbt:Formalmethods-stub dbt:Semantics
Subject	Formal languages Graph data structures
Link from a Wikipage to an external page	http://citeseer.ist.psu.edu/devanbu96generating.html http://www.citeulike.org/user/hayashi/article/259537 http://www.swag.uwaterloo.ca/cppx/old_cppx_site/ https://web.archive.org/web/20080117121308/http:/www.citeulike.org/user/hayashi/article/259537
gold:hypernym	Form
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Abstract_semantic_graph?oldid=1068330170&ns=0
Wikipage page ID	1137033 (xsd:integer)
page length (characters) of wiki page	7435 (xsd:nonNegativeInteger)
Wikipage revision ID	1068330170 (xsd:integer)
Link from a Wikipage to another Wikipage	Formal language Logical consequence Programming language Abstract syntax Abstract syntax tree Abstraction (computer science) Semantic Web Semantic grid Glossary of graph theory Formal languages Graph data structures Directed acyclic graph Name Cycle (graph theory) Declaration (computer programming) Linguistics Term (logic) Code refactoring Common subexpression elimination Compiler Computer program Computer science Control flow Ontology (information science) Parsing Functional programming Graph (abstract data type) Graph Graph rewriting Identifier Syntax Expression (computer science) Intermediate representation Tree (data structure) Type system Variable (computer science) Iteration Pointer (computer programming) Recursion
has abstract	In computer science, an abstract semantic graph (ASG) or term graph is a form of abstract syntax in which an expression of a formal or programming language is represented by a graph whose vertices are the expression's subterms. An ASG is at a higher level of abstraction than an abstract syntax tree (or AST), which is used to express the syntactic structure of an expression or program. ASGs are more complex and concise than ASTs because they may contain shared subterms (also known as "common subexpressions"). Abstract semantic graphs are often used as an intermediate representation by compilers to store the results of performing common subexpression elimination upon abstract syntax trees. ASTs are trees and are thus incapable of representing shared terms. ASGs are usually directed acyclic graphs (DAG), although in some applications graphs containing cycles may be permitted. For example, a graph containing a cycle might be used to represent the recursive expressions that are commonly used in functional programming languages as non-looping iteration constructs. The mutability of these types of graphs, is studied in the field of graph rewriting. The nomenclature term graph is associated with the field of term graph rewriting, which involves the transformation and processing of expressions by the specification of rewriting rules, whereas abstract semantic graph is used when discussing linguistics, programming languages, type systems and compilation. Abstract syntax trees are not capable of sharing subexpression nodes because it is not possible for a node in a proper tree to have more than one parent. Although this conceptual simplicity is appealing, it may come at the cost of redundant representation and, in turn, possibly inefficiently duplicating the computation of identical terms. For this reason ASGs are often used as an intermediate language at a subsequent compilation stage to abstract syntax tree construction via parsing. An abstract semantic graph is typically constructed from an abstract syntax tree by a process of enrichment and abstraction. The enrichment can for example be the addition of back-pointers, edges from an identifier node (where a variable is being used) to a node representing the declaration of that variable. The abstraction can entail the removal of details which are relevant only in parsing, not for semantics. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Abstract_semantic_graph
is Link from a Wikipage to another Wikipage of	ASG Abstract syntax tree List of computing and IT abbreviations Data cube Index of philosophy articles (A–C)
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Abstract_semantic_graph

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software