Efficient parsing of visual languages based on critical pair analysis and contextual layered graph transformation

Bottoni, Paolo; Taentzer, Gabriele; Schürr, Andy

doi:10.1109/vl.2000.874351

Cited by 49 publications

(40 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several applications using graph transformation need or already use negative application conditions (NACs) to express that certain structures at a given time are forbidden, e.g., [1][2][3][4][5]. In order to allow conflict detection and analysis for these applications, the theory already worked out for graph transformation systems (gts) without NACs should be generalized to gts with NACs.…”

Section: Introductionmentioning

confidence: 99%

Conflict Detection for Graph Transformation with Negative Application Conditions

Lambers

Ehrig

Orejas

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper introduces a new theory needed for the purpose of conflict detection for graph transformation with negative application conditions (NACs). Main results are the formulation of a conflict notion for graph transformation with NACs and a conflict characterization derived from it. A critical pair definition is introduced and completeness of the set of all critical pairs is shown. This means that for each conflict, occuring in a graph transformation system with NACs, there exists a critical pair expressing the same conflict in a minimal context. Moreover a necessary and sufficient condition is presented for parallel independence of graph transformation systems with NACs. In order to facilitate the implementation of the critical pair construction for a graph transformation system with NACs a correct construction is formulated. Finally, it is discussed how to continue with the development of conflict detection and analysis techniques in the near future.

show abstract

Section: Introductionmentioning

confidence: 99%

Conflict Detection for Graph Transformation with Negative Application Conditions

Lambers

Ehrig

Orejas

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In this way we ensure that the language defined by the parser is at least a sub-language of that defined by constraints. Critical pair analysis can be useful to optimise the visual language parser (see [7]). …”

Section: Discussionmentioning

confidence: 99%

Integrating Meta-modelling Aspects with Graph Transformation for Efficient Visual Language Definition and Model Manipulation

Bardohl

Ehrig

Lara

et al. 2004

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. Visual languages (VLs) play a central role in modelling various system aspects. Besides standard languages like UML, a variety of domain-specific languages exist which are the more used the more tool support is available for them. Different kinds of generators have been developed which produce visual modelling environments based on VL specifications. To define a VL, declarative as well as constructive approaches are used. The meta modelling approach is a declarative one where classes of symbols and relations are defined and associated to each other. Constraints describe additional language properties. Defining a VL by a graph grammar, the constructive way is followed where graphs describe the abstract syntax of models and graph rules formulate the language grammar. In this paper, we extend algebraic graph grammars by a node type inheritance concept which opens up the possibility to integrate both approaches by identifying symbol classes with node types and associations with edge types of some graph class. In this way, declarative as well as constructive elements may be used for language definition and model manipulation. Two concrete approaches, the GENGED and the AToM 3 approach, illustrate how VLs can be defined and models can be manipulated by the techniques described above.

show abstract

“…In the approach of [6], a restricted form of Statecharts was defined using a pure graph grammar approach (no meta-models). For this purpose, they used a low level (LLG, concrete syntax) and a high level (HLG, abstract syntax) representation.…”

Section: Related Workmentioning

confidence: 99%

“…-Three node inheritance graphs 6 Fig. 4 shows an example meta-model triple, which is an extension of the attributed type triple graph in Fig.…”

Section: Definition 12 (Attributed Type Triple Graph With Inheritancementioning

confidence: 99%

Event-driven grammars: relating abstract and concrete levels of visual languages

Guerra

Lara

2007

Softw Syst Model

View full text Add to dashboard Cite

El acceso a la versión del editor puede requerir la suscripción del recurso Access to the published version may require subscription Abstract In this work we introduce event-driven grammars, a kind of graph grammars that are especially suited for visual modelling environments generated by metamodelling. Rules in these grammars may be triggered by user actions (such as creating, editing or connecting elements) and in their turn may trigger other user-interface events. Their combination with triple graph transformation systems allows constructing and checking the consistency of the abstract syntax graph while the user is building the concrete syntax model, as well as managing the layout of the concrete syntax representation.As an example of these concepts, we show the definition of a modelling environment for UML sequence diagrams. A discussion is also presented of methodological aspects for the generation of environments for visual languages with multiple views, its connection with triple graph grammars, the formalization of the latter in the double pushout approach and its extension with an inheritance concept.

show abstract

Efficient parsing of visual languages based on critical pair analysis and contextual layered graph transformation

Cited by 49 publications

References 3 publications

Conflict Detection for Graph Transformation with Negative Application Conditions

Conflict Detection for Graph Transformation with Negative Application Conditions

Integrating Meta-modelling Aspects with Graph Transformation for Efficient Visual Language Definition and Model Manipulation

Event-driven grammars: relating abstract and concrete levels of visual languages

Contact Info

Product

Resources

About