Syntax Specification by Graph Grammars and Meta-Models

Transcription

1 Ou Synax Speciicaion by Graph Grammars and Mea-Models Mark Minas Insiue or Soware Technology Universiä der Bundeswehr München Germany (Some) Dimensions o Visual Languages & Ediors DiaGen Edior archiecure grammar-based speciicaion and diagram analysis DiaMea Edior archiecure Mea-based speciicaion and diagram analysis Conclusions Mark.Minas@unibw.de 2 (Some) Dimensions o Visual Languages & Ediors Ediing mode Free ediing Ediing Modes o Ediors Srucured ediing Absrac represenaion Semanics Srucured ediing Graphs direc Represenaion Easy o build Oers a se o ediing operaions Resrics user Free ediing Grammars Meas Logic Synax speciicaion 3 Requires expensive diagram analysis Oers maximum ediing reedom Doesn oer guidance Semanics 5

2 Ediing Modes o Ediors Synax Speciicaion Mehods or Visual Languages Combinaion o srucured and ree ediing Oers a se o ediing operaions Oers maximum ediing reedom Requires expensive diagram analysis Absrac Represenaion Semanics + Absrac Represenaion Semanics Semanics Direc synax speciicaion VLCC (Cosagliola e al.) Posiional Grammars Penguins (Chok, Marrio) Consrain Mulise Grammars Many ohers Graphs as absrac represenaion PAGG (Göler) Graph ransormaions GenGed (Bardohl) Graph ransormaions VisPro (Zhang) Conluen graph grammars DiaGen/DiaMea grammars & Meas Aom/3 (de Lara, Vangheluwe) Meas Kogge (Eber e al.) Graph schemas (=Meas) Moses (Janneck, Esser) Asserions Many ohers 6 8 Synax Speciicaion Mehods or Visual Languages Ou (Some) Dimensions o visual languages & ediors Ediing mode Free ediing Srucured ediing DiaGen PAGG GenGed VisPro Kogge AoM 3 VLCC Penguins DiaMea Moses Represenaion (Some) Dimensions o Visual Languages & Ediors DiaGen Edior archiecure grammar-based speciicaion and diagram analysis DiaMea Edior archiecure Mea-based speciicaion and diagram analysis Conclusions direc Grammars Meas Logic Graphs Synax speciicaion 9 10

3 DiaGen Generaing diagram ediors wih DiaGen Rapid Prooyping ool or creaing diagram ediors rom a speciicaion Free-hand ediing: ool Lexical, synacic, and semanic analysis Srucured ediing (opional) Auomaic layou (opional) even or ree-hand ediing Suppor o hierarchical diagrams (opional) Unparsing o diagrams, i.e. exernal orma diagram (opional) Semanic zooming (opional) Java DiaGen DiaGen edior ramework Speciicaion DiaGen Designer Generaed program code operaes Edior developer edior Example: Saechars Example: Message Sequence Chars (MSC) 13 14

4 DiaGen: Edior Archiecure DiaGen: Edior Archiecure Layouer Layou inormaion Highlighs synacically correc sub-diagrams Aribue evaluaion Consrains Layou Layouer inormaion componens & Highlighs Relaions synacically correc sub-diagrams Aribue hypergraph grammar Seman. represenaion Seman. represenaion Aribue evaluaion modiies Reduced Derivaion Reducer hypergraph Parser srucure modiies Reduced Derivaion Reducer hypergraph Parser srucure ool ransormer ool ransormer Reducer rules grammar selecs operaion selecs operaion Edior user Absrac Represenaion Semanics selecs operaion Se o diagram componens selecs operaion Programmed Edior user(hyper-) graphransormaions DiaGen: Edior Archiecure Example: Message Sequence Chars (MSC) Layouer Layou inormaion Seman. represenaion componens: Highlighs synacically correc sub-diagrams Aribue evaluaion modiies Reduced Derivaion Reducer hypergraph Parser srucure ool selecs operaion selecs operaion ransormer Acion Edior user Lie o an eniy Message 19 20

5 speciied in he DiaGen Designer speciied in he DiaGen Designer speciied in he DiaGen Designer DiaGen: Edior Archiecure Layouer Layou inormaion Seman. represenaion Highlighs synacically correc sub-diagrams Aribue evaluaion modiies Reduced Derivaion Reducer hypergraph Parser srucure ool ransormer selecs operaion selecs operaion Edior user 24 25

6 Model Componen hyperedge lie lie Model Componen hyperedge lie lie ac ac Nodes represen aachmen areas ac ac ac Aachmen area o he diagram componen ac speciied in he DiaGen Designer speciied in he DiaGen Designer 28 29

7 Model wih Relaionship Edges speciied in he DiaGen Designer lie lie ac ac ac Relaionship edges connec nodes whose aachmen areas are relaed in a speciic way DiaGen: Edior Archiecure Model wih Relaionship Edges Highlighs synacically correc sub-diagrams Seman. represenaion lie lie Layouer Layou inormaion Aribue evaluaion ac ool selecs operaion modiies selecs operaion ransormer Reduced Derivaion Reducer hypergraph Parser srucure ac ac Edior user 32 33

8 Reduced Model Reducing he Model lie lie acion Lie acion ac acion Lie acion ac ac acion acion Reducing he Model speciied in he DiaGen Designer Reducer rule lie s s For each lie edge and is visied node, creae a edge ogeher wih is visied node in he RHGM Acually (or each reducer rule!!): Don creae a new node in he RHGM i he HGM node has a corresponding RHGM node already. Use his RHGM node insead! Texual represenaion: lie(s) ==> (s) 36 37

9 Reducing he Model Reducing he Model lie lie acion Lie lie 1 lie Lie 2 ac ac acion lie wih 1.x < 3.x < 2.x Condiion: 1.x < 2.x Noe: Nodes have x and y coordinaes o heir aachmen areas Texual represenaion: ac acion lie(1) lie(2) -{ lie(3) where 1.x < 3.x && 3.x < 2.x } ==> Lie(1,2) speciied in he DiaGen Designer Reducing he Model lie lie acion Lie ac acion ac ac acion 40 41

10 Reducing he Model speciied in he DiaGen Designer lie l l = e wih e2.y < e.y e e2 Texual represenaion: lie(l) lieson(e,l) -{ lieson(e2,l) where e2.y < e.y } ==> e = l DiaGen: Edior Archiecure Grammar Layouer Layou inormaion Seman. represenaion Lies Lie Lies Lie ::= a a Lie a conex-ree producions Highlighs synacically correc sub-diagrams modiies Aribue evaluaion Reduced Derivaion Reducer hypergraph Parser srucure Lie a ::= a a Even acion ::= EvenSeq a a a a ool selecs operaion selecs operaion ransormer EvenSeq ::= Even Even a ::= a b a b Edior user a a EvenSeq embedding producion 44 45

11 speciied in he DiaGen Designer Grammar Derivaion Sequence Lies Lies Lie Lie Lie Lie Lie 2 acion Lie Lie * acion EvenSeq EvenSeq acion Derivaion DAG Ou acion acion Lie acion This visualizaion o he derivaion DAG has been creaed using DiaGen s GML expor aciliy and he graph drawing ool Graphle (Some) Dimensions o Visual Languages & Ediors DiaGen Edior archiecure grammar-based speciicaion and diagram analysis DiaMea Edior archiecure Mea-based speciicaion and diagram analysis Conclusions 48 49

12 DiaGen wih Meas Observaion: Mos visual languages are graph-like Mos people are no used o used o synax speciicaion using (graph) grammars However: Mos people are used o class diagrams Use meas as an alernaive o (graph) grammars or language speciicaion Implemened using EMF (Eclipse Modeling Framework) Beneis: Fas language speciicaion Mea also speciies inernal represenaions o edied diagrams Generaing diagram ediors wih DiaMea (EMF) Edior developer DiaGen DiaGen edior ramework operaes operaes Edior Speciicaion DiaGen Designer Generaed program code ECore Modeller ECore Speciicaion EMF Compiler Generaed program code edior DiaMea: Edior Archiecure Example: Trees Layouer (opional) Highlighs synacically correc sub-diagrams ool modiies Graph Graph Transormer (opional) Reducer Insance graph Model checker Java objecs Sample ree: Objec diagram: selecs operaion selecs operaion Edior user 54 56

13 Example: Trees Synax Analysis Sample ree: Insance graph: Graph homomorphism ha obeys subclassing Nodes are mapped o nodes Edges are mapped o edges Srucure preservaion Cardinaliy consrains no violaed Synax Analysis Search or Morphism: Consrain Saisacion Problem Node / Arc consisency Linear in #consrains Quadraic in domain size Backracking needless in pracical cases DiaMea: Edior Archiecure Layouer (opional) componens & Relaions Highlighs synacically correc sub-diagrams Graph Reducer Insance graph Model checker Java objecs ool selecs operaion Graph Transormer (opional) selecs operaion Reducer rules EMF modiies Edior user Programmed graph ransormaions Necessary speciicaion 59 60

14 Example: Trees EMF (drawn wih Omondo EclipseUML) Example: Trees Reducer Absrac Node Circle Arrow Absrac Node Circle circle Circle Absrac Node Absrac Node Circle Arrow Arrow Represen diagram componens ogeher wih heir saes circle circle Graph circle Insance graph Example: Trees Example: Peri-nes Reducer rules = riple graph grammar rules a c e EMF (drawn wih Omondo EclipseUML) b d border circle Circle nodeparam reduced Absrac Node a a rom o c Arrow reduced paren edgeparam child e Graph Correspondence graph Insance graph a b d 65 66

15 Example: Saechars EMF (drawn wih Omondo EclipseUML) Conclusions (Some) Dimensions o visual languages & ediors Ediing mode Free ediing DiaGen/DiaMea Srucured ediing direc Represenaion Graphs Grammars Meas Logic Synax speciicaion Fuure Work Using MOF as an alernaive o EMF layou Simpliying ree ediing wih auomaic layou Skeching Model ransormaion Improving srucured ediing Improving srucured ediing Operae on insance graph insead o graph ool selecs operaion Layouer (opional) Highlighs synacically correc sub-diagrams Graph selecs operaion Insance Reducer graph modiies Graph Transormer (opional) Model checker Java objecs Edior user 69 71