Filters








531 Hits in 2.6 sec

Context-free hypergraph grammars have the same term-generating power as attribute grammars

Joost Engelfriet, Linda Heyker
1992 Acta Informatica  
Context-free hypergraph grammars and attribute grammars generate the same class of term languages.  ...  Extending the context-free hypergraph grammar with a context-free grammar and a semantic domain, a syntax-directed translation device is obtained that is equivalent to the attribute grammar.  ...  One possible type of attributed graph grammar would be the context-free hypergraph grammar extended with (inherited and synthesized) attributes, just as in the case of an ordinary context-free grammar.  ... 
doi:10.1007/bf01178504 fatcat:spgr3hfupzdchnqlxopuf6wnru

Graphical representation and manipulation of complex structures based on a formal model [chapter]

G. Viehstaedt, M. Minas
1995 Lecture Notes in Computer Science  
An editor for a certain kind of diagrams is generated from a specification, which includes a grammar to describe the structure of diagrams.  ...  The user of a diagram editor, however, doesn't have to be concerned with the grammar, but can manipulate diagrams in a very convenient way.  ...  Context-free hypergraph grammars are analogously defined as context-free (string) grammars and have similar properties [3] .  ... 
doi:10.1007/3-540-59498-1_250 fatcat:lxnep7yl2ngidcfmfrqyvf2vc4

Generating editors for direct manipulation of diagrams [chapter]

Gerhard Viehstaedt, Mark Minas
1995 Lecture Notes in Computer Science  
An editor for a certain kind of diagram is generated from a specification, which includes a grammar to describe the structure of diagrams.  ...  The user of a diagram editor, however, does not have to be concerned with the grammar, but can manipulate diagrams very conveniently by direct manipulation.  ...  Context-free hypergraph grammars are analogously defined as context-free (string) grammars and have similar properties [9] .  ... 
doi:10.1007/3-540-60614-9_2 fatcat:74dffa4bzvhhfdcvhuth6cpxka

Concepts and realization of a diagram editor generator based on hypergraph transformation

Mark Minas
2002 Science of Computer Programming  
hypergraphs.  ...  Created editors use hypergraphs as an internal diagram model and hypergraph parsers for syntactic analysis whereas syntax-directed editing is realized by programmed hypergraph transformation of these internal  ...  The derivation structure-similar to context-free string grammars-is a derivation tree if a context-free hypergraph grammar is used.  ... 
doi:10.1016/s0167-6423(02)00037-0 fatcat:7m2trexns5clfksyi4ig73jlii

Creating Semantic Representations of Diagrams [chapter]

Mark Minas
2000 Lecture Notes in Computer Science  
., position, size), and an attributed hypergraph grammar that describes the concrete diagram syntax as well as the rules for generating the semantic representation.  ...  P 24 of Fig. 7 are context-free ones. Context-free hypergraph grammars with embeddings are more expressive than context-free ones.  ...  The grammar is a context-free hypergraph grammar with embeddings. Productions P 1 . . .  ... 
doi:10.1007/3-540-45104-8_15 fatcat:vmf5zzbjszgcdnmwhxepojehcu

Syntax Definition with Graphs

Mark Minas
2006 Electronical Notes in Theoretical Computer Science  
The paper presents in a tutorial like way the DiaGen approach of defining visual language syntax with hypergraphs and hypergraph grammars.  ...  Context-free hypergraph grammars Context-free hypergraph grammars (also called hyperedge replacement grammars [8] ) are an extension of context-free grammars.  ...  Context-free hypergraph grammars with embeddings It has turned out that context-free hypergraph grammars are not expressive enough for specifying diagram language syntax.  ... 
doi:10.1016/j.entcs.2005.12.011 fatcat:2uv4hlpej5cl5i3jgnuhr3lpqm

Specifying and Implementing Visual Process Modeling Languages with DiaGen1 1Support by the Esprit Working Group AppliGraph is gratefully acknowledged

Mark Minas, Berthold Hoffmann
2001 Electronical Notes in Theoretical Computer Science  
This paper describes how a diagram language can be specified, based on graphs, graph grammars, and transformation rules, and how the diagram editor generator DiaGen generates a diagram editor from such  ...  All but the last two productions of Fig. 7 are context-free. Context-free hypergraph grammars with embeddings are more expressive than context-free ones.  ...  Whereas "pure" context-free hypergraph grammars cannot describe the syntax of every diagram language [10] , context-free hypergraph grammars with embeddings and application conditions have proven to be  ... 
doi:10.1016/s1571-0661(04)80944-7 fatcat:ludzmnwdivd45aqmpvfcihcnqi

Hypergraphs as a Uniform Diagram Representation Model [chapter]

Mark Minas
2000 Lecture Notes in Computer Science  
This paper also proposes a procedure for translating diagrams into their hypergraph model, i.e., a graphical scanner, and a procedure to check the hypergraph against a hypergraph grammar defining the diagrams  ...  Such procedures are necessary to make use of such a hypergraph model in visual environments that support free-hand editing where the user can modify diagrams arbitrarily.  ...  [14] has discussed efficient parsers for context-free hypergraph grammars with optional embedding productions: Similar to context-free string grammars, context-free hypergraph grammars are defined in  ... 
doi:10.1007/978-3-540-46464-8_20 fatcat:krbb4rr23rcvxpsusgunaephjq

Specifying Diagram Languages by Means of Hypergraph Grammars [chapter]

Mark Minas
2002 Diagrammatic Representation and Reasoning  
This paper describes continued work on how to specify a wide range of diagram languages in terms of a hypergraph model together with hypergraph grammars.  ...  Editors support syntax-directed editing as well as free hand editing of the diagrams on the screen which are internally represented by hypergraphs.  ...  A context-free hypergraph grammar is used to describe the hypergraph language.  ... 
doi:10.1007/978-1-4471-0109-3_32 fatcat:cpaazg6b6fcs5ns5ac4dthqhvy

Page 648 of Mathematical Reviews Vol. , Issue 2000a [page]

2000 Mathematical Reviews  
context-free hypergraph grammars.  ...  In this paper we introduce attributed context-free hypergraph grammars (acfhg grammars) as an extension of cfhg grammars.  ... 

Generating Diagram Editors with DiaGen [chapter]

Mark Minas, Oliver Köth
2000 Lecture Notes in Computer Science  
DiaGen is a specification method, which is primarily based on a hypergraph grammar, and a tool that allows to automatically generate diagram editors from such a specification.  ...  Generated editors are free-hand editors, but with an automatic, constraint-based layout for correct diagrams.  ...  DiaGen supports context-free hypergraph grammars with embeddings, i.e., productions are either context-free ones with a single nonterminal hyperedge on the production's left-hand side (LHS), or they are  ... 
doi:10.1007/3-540-45104-8_35 fatcat:wpl4jokaqbfrnfb2y72j4pc2em

Page 2133 of Mathematical Reviews Vol. , Issue 83e [page]

1983 Mathematical Reviews  
Taking trees over some ranked alphabet instead of derivation trees of a context-free grammar, allowing the values of attributes to be only trees over another ranked alphabet, and, finally, restricting  ...  Systems Theory 2 (1968), 127-145; Zbl 169, 14] as a formal tool for defining the meaning of sentences generated by a context-free grammar.  ... 

Parsing String Generating Hypergraph Grammars [chapter]

Sebastian Seifert, Ingrid Fischer
2004 Lecture Notes in Computer Science  
For parsing context-free Chomsky grammars, the Earley parser is well known.  ...  With the help of these grammars, string languages like a n b n c n can be modeled that can not be generated by context-free grammars for strings.  ...  A subset of hypergraph grammars, context-free string generating hypergraph grammars, are described in detail in [7] , [8] , [5] .  ... 
doi:10.1007/978-3-540-30203-2_25 fatcat:koukx7hqyrhelkvczved4autbi

Constructing a bidirectional transformation between BPMN and BPEL with a functional logic programming language

Steffen Mazanek, Michael Hanus
2011 Journal of Visual Languages and Computing  
We specify the abstract syntax of structured process models by a context-free hypergraph grammar.  ...  In order to be self-contained, this article also surveys context-free hypergraph grammars, the concepts of the programming language Curry, the example languages BPMN and BPEL, and the ideas of the Grappa  ...  Considering the definition of HRGs and their properties, HRGs are the graph grammar formalism closest to context-free string grammars.  ... 
doi:10.1016/j.jvlc.2010.11.005 fatcat:hyoegkuzbres5ixexg6czyqgwu

Specifying Graph-like Diagrams with Dia Gne

Mark Minas
2002 Electronical Notes in Theoretical Computer Science  
Parsing step The syntax of the hypergraph models of the diagram language -and thus the syntax of the language -is defined by a context-free hypergraph grammar with embeddings.  ...  The grammar is a context-free hypergraph grammar with embeddings. Ovals represent nonterminal hyperedges, whereas rectangles represent terminal hyperedges, i.e., hyperedges of the rHGM.  ... 
doi:10.1016/s1571-0661(05)80761-3 fatcat:sthlscoxozcitfiobip3bfloqu
« Previous Showing results 1 — 15 out of 531 results