View in EDS

A comparison of reserved graph grammar and edge-based graph grammar.

Saved in:
Bibliographic Details
Title: A comparison of reserved graph grammar and edge-based graph grammar.
Authors: Zou, Yang1 (AUTHOR)
Source: Computer Journal. Feb2025, Vol. 68 Issue 2, p145-162. 18p.
Subjects: Visual programming languages (Computer science), Graph grammars, Eggs
Abstract: Context-sensitive graph grammars are natural formalisms for the generation and parsing of visual programming languages. Being intuitive, rigorous, and expressive tools, they have been frequently employed in a wide range of research fields. Nevertheless, the expressive powers of the existing context-sensitive formalisms have not been investigated yet. To this end, this paper is dedicated to the comparison of expressive powers of the two prevalent graph grammar formalisms, Reserved Graph Grammar (RGG) and Edge-based Graph Grammar (EGG). By introducing a special variant of RGG as an intermediary, the relation between them concerning the expressive power is revealed that the set of graph languages of EGG is a proper subset of that of RGG. Moreover, bidirectional transformations between EGG and the variant of RGG are accordingly established, allowing them to take the advantages of each other in applications. [ABSTRACT FROM AUTHOR]
Copyright of Computer Journal is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 183076324
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A comparison of reserved graph grammar and edge-based graph grammar.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Zou%2C+Yang%22">Zou, Yang</searchLink><relatesTo>1</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Computer+Journal%22">Computer Journal</searchLink>. Feb2025, Vol. 68 Issue 2, p145-162. 18p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Visual+programming+languages+%28Computer+science%29%22">Visual programming languages (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+grammars%22">Graph grammars</searchLink><br /><searchLink fieldCode="DE" term="%22Eggs%22">Eggs</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Context-sensitive graph grammars are natural formalisms for the generation and parsing of visual programming languages. Being intuitive, rigorous, and expressive tools, they have been frequently employed in a wide range of research fields. Nevertheless, the expressive powers of the existing context-sensitive formalisms have not been investigated yet. To this end, this paper is dedicated to the comparison of expressive powers of the two prevalent graph grammar formalisms, Reserved Graph Grammar (RGG) and Edge-based Graph Grammar (EGG). By introducing a special variant of RGG as an intermediary, the relation between them concerning the expressive power is revealed that the set of graph languages of EGG is a proper subset of that of RGG. Moreover, bidirectional transformations between EGG and the variant of RGG are accordingly established, allowing them to take the advantages of each other in applications. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Computer Journal is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=183076324
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1093/comjnl/bxae100
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 18
        StartPage: 145
    Subjects:
      – SubjectFull: Visual programming languages (Computer science)
        Type: general
      – SubjectFull: Graph grammars
        Type: general
      – SubjectFull: Eggs
        Type: general
    Titles:
      – TitleFull: A comparison of reserved graph grammar and edge-based graph grammar.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Zou, Yang
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: Feb2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 00104620
          Numbering:
            – Type: volume
              Value: 68
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Computer Journal
              Type: main
ResultId 1