{"title":"GENGED:基于代数图语法的通用可视化语言图形编辑器","authors":"R. Bardohl","doi":"10.1109/VL.1998.706133","DOIUrl":null,"url":null,"abstract":"GENGED is a generic graphical editor supporting the graphical definition of visual languages. Given an alphabet and rules of a specific visual language, GENGED generates a syntax-directed graphical editor for this language. GENGED, as well as each visual language defined using GENGED, is based on algebraic graph grammars. A sentence is given by a graphical structure consisting of a logical (abstract syntax) and a visual level (concrete syntax). Both levels are connected by layout operations. Visual language rules are defined by graph grammar rules. The underlying logical structure, however is hidden from the user but it is essential for a formal presentation and manipulation of graphical structures on both levels. The manipulations are performed by a graph transformation machine working on the logical level, whereas a graphical constraint solver manages the layout the user works with.","PeriodicalId":185794,"journal":{"name":"Proceedings. 1998 IEEE Symposium on Visual Languages (Cat. No.98TB100254)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"49","resultStr":"{\"title\":\"GENGED: a generic graphical editor for visual languages based on algebraic graph grammars\",\"authors\":\"R. Bardohl\",\"doi\":\"10.1109/VL.1998.706133\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"GENGED is a generic graphical editor supporting the graphical definition of visual languages. Given an alphabet and rules of a specific visual language, GENGED generates a syntax-directed graphical editor for this language. GENGED, as well as each visual language defined using GENGED, is based on algebraic graph grammars. A sentence is given by a graphical structure consisting of a logical (abstract syntax) and a visual level (concrete syntax). Both levels are connected by layout operations. Visual language rules are defined by graph grammar rules. The underlying logical structure, however is hidden from the user but it is essential for a formal presentation and manipulation of graphical structures on both levels. The manipulations are performed by a graph transformation machine working on the logical level, whereas a graphical constraint solver manages the layout the user works with.\",\"PeriodicalId\":185794,\"journal\":{\"name\":\"Proceedings. 1998 IEEE Symposium on Visual Languages (Cat. No.98TB100254)\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"49\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1998 IEEE Symposium on Visual Languages (Cat. No.98TB100254)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VL.1998.706133\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 1998 IEEE Symposium on Visual Languages (Cat. No.98TB100254)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VL.1998.706133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
GENGED: a generic graphical editor for visual languages based on algebraic graph grammars
GENGED is a generic graphical editor supporting the graphical definition of visual languages. Given an alphabet and rules of a specific visual language, GENGED generates a syntax-directed graphical editor for this language. GENGED, as well as each visual language defined using GENGED, is based on algebraic graph grammars. A sentence is given by a graphical structure consisting of a logical (abstract syntax) and a visual level (concrete syntax). Both levels are connected by layout operations. Visual language rules are defined by graph grammar rules. The underlying logical structure, however is hidden from the user but it is essential for a formal presentation and manipulation of graphical structures on both levels. The manipulations are performed by a graph transformation machine working on the logical level, whereas a graphical constraint solver manages the layout the user works with.