Using Refactoring Techniques for Visual Editing of Hybrid Languages
(2013) Workshop on Refactoring Tools (WRT '13) p.17-20- Abstract
- In this paper we describe how techniques for refactoring can be used for visual editing of hybrid languages, that is, languages that have both a visual and a textual syntax. Textual languages have name rules that define how name uses are bound to name declarations. These bindings often correspond to connections in the visual language, and need to be taken into account in order to implement the visual edit operations correctly. We use inverse lookup functions, originally devised for renaming, for implementing visual editing operations for hybrid languages.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/4192050
- author
- Fors, Niklas LU and Hedin, Görel LU
- organization
- publishing date
- 2013
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Workshop on Refactoring Tools
- pages
- 17 - 20
- publisher
- Association for Computing Machinery (ACM)
- conference name
- Workshop on Refactoring Tools (WRT '13)
- conference dates
- 2013-10-27
- external identifiers
-
- scopus:84892936673
- ISBN
- 978-1-4503-2604-9
- DOI
- 10.1145/2541348.2541353
- project
- ELLIIT LU P05: Scalable Language Tools for Cyber-Physical Systems
- language
- English
- LU publication?
- yes
- id
- e12daf4f-5b74-4468-b053-1fe13119cc72 (old id 4192050)
- date added to LUP
- 2016-04-04 11:44:53
- date last changed
- 2022-01-29 22:25:39
@inproceedings{e12daf4f-5b74-4468-b053-1fe13119cc72, abstract = {{In this paper we describe how techniques for refactoring can be used for visual editing of hybrid languages, that is, languages that have both a visual and a textual syntax. Textual languages have name rules that define how name uses are bound to name declarations. These bindings often correspond to connections in the visual language, and need to be taken into account in order to implement the visual edit operations correctly. We use inverse lookup functions, originally devised for renaming, for implementing visual editing operations for hybrid languages.}}, author = {{Fors, Niklas and Hedin, Görel}}, booktitle = {{Workshop on Refactoring Tools}}, isbn = {{978-1-4503-2604-9}}, language = {{eng}}, pages = {{17--20}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{Using Refactoring Techniques for Visual Editing of Hybrid Languages}}, url = {{http://dx.doi.org/10.1145/2541348.2541353}}, doi = {{10.1145/2541348.2541353}}, year = {{2013}}, }