Abstract semantic graph

Abstract semantic graph

In computer science, an abstract semantic graph (ASG) is a data structure used in representing or deriving the semantics of an expression in a formal language (for example, a programming language).

An abstract semantic graph is a higher level abstraction than an abstract syntax tree (or AST), which is used to express the syntactic structure of an expression or program.

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.

External links

*Article " [http://swag.uwaterloo.ca/~dean/cppx/ CPPX - C/C++ Fact Extractor] " by Tom Dean
*Paper " [http://citeseer.ist.psu.edu/devanbu96generating.html Generating Testing and Analysis Tools with Aria] " by Premkumar T. Devanbu, David S. Rosenblum and Alexander L. Wolf
*Paper " [http://www.swen.uwaterloo.ca/~evan/Papers/wcre2000.pdf Towards Portable Source Code Representations Using XML] " by Evan Mamas and Kostas Kontogiannis
*Paper " [http://www.citeulike.org/user/hayashi/article/259537 Dex: a semantic-graph differencing tool for studying changes in large code bases] "

ee also

*Ontology (computer science)
*Semantic Web
*Semantic Grid
*Web 3.0


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Abstract syntax tree — In computer science, an abstract syntax tree (AST), or just syntax tree, is a tree representation of the syntax of some source code (that has been written in a programming language). Each node of the tree denotes a construct occurring in the… …   Wikipedia

  • List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A …   Wikipedia

  • List of computing and IT abbreviations — This is a list of computing and IT acronyms and abbreviations. Contents: 0–9 A B C D E F G H I J K L M N O P Q R S T U V W X Y …   Wikipedia

  • Universal Networking Language — (UNL) is a declarative formal language specifically designed to represent semantic data extracted from natural language texts. It can be used as a pivot language in interlingual machine translation systems or as a knowledge representation… …   Wikipedia

  • ASG — may refer to: *ASG (band) *Abstract semantic graph *Abu Sayyaf Group *Adaptive Services Grid *Airsoft gun *All Saints Greek Orthodox Grammar School, or All Saints Grammar *All star game *Alsager railway station s national rail code *Alternating… …   Wikipedia

  • Syntactic methods — In software engineering, syntactic methods are techniques for developing correct software programs. The techniques attempt to detect, and thus prevent, certain kinds of defects (bugs) by examining the structure of the code being produced at its… …   Wikipedia

  • Resource Description Framework — Infobox file format name = Resource Description Framework icon = logo = extension = .rdf mime = application/rdf+xml type code = uniform type = magic = owner = [http://www.w3.org/ World Wide Web Consortium] genre = semantic web container for =… …   Wikipedia

  • Chinese writing — Introduction       basically logographic writing system, one of the world s great writing systems.       Like Semitic writing in the West, Chinese script was fundamental to the writing systems in the East. Until relatively recently, Chinese… …   Universalium

  • information processing — Acquisition, recording, organization, retrieval, display, and dissemination of information. Today the term usually refers to computer based operations. Information processing consists of locating and capturing information, using software to… …   Universalium

  • Scale-free network — A scale free network is a network whose degree distribution follows a power law, at least asymptotically. That is, the fraction P ( k ) of nodes in the network having k connections to other nodes goes for large values of k as P ( k ) k − γ where… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”