Using Refactoring Techniques for Visual Editing of Hybrid Languages

Niklas Fors; Görel Hedin

doi:10.1145/2541348.2541353

Using Refactoring Techniques for Visual Editing of Hybrid Languages

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

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.

Original language	English
Title of host publication	Workshop on Refactoring Tools
Publisher	Association for Computing Machinery (ACM)
Pages	17-20
ISBN (Print)	978-1-4503-2604-9
DOIs	https://doi.org/10.1145/2541348.2541353
Publication status	Published - 2013
Event	Workshop on Refactoring Tools (WRT '13) - Indianapolis, US Duration: 2013 Oct 27 → …

Conference

Conference	Workshop on Refactoring Tools (WRT '13)
Period	2013/10/27 → …

Subject classification (UKÄ)

Computer Sciences

Access to Document

10.1145/2541348.2541353

ELLIIT LU P05: Scalable Language Tools for Cyber-Physical Systems
Hedin, G. (PI), Fors, N. (Researcher) & Öqvist, J. (Researcher)
2016/01/01 → 2020/12/31
Project: Research

Cite this

@inproceedings{e12daf4f5b744468b0531fe13119cc72,

title = "Using Refactoring Techniques for Visual Editing of Hybrid Languages",

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 = "Niklas Fors and G{\"o}rel Hedin",

year = "2013",

doi = "10.1145/2541348.2541353",

language = "English",

isbn = "978-1-4503-2604-9",

pages = "17--20",

booktitle = "Workshop on Refactoring Tools",

publisher = "Association for Computing Machinery (ACM)",

address = "United States",

note = "Workshop on Refactoring Tools (WRT '13) ; Conference date: 27-10-2013",

}

TY - GEN

T1 - Using Refactoring Techniques for Visual Editing of Hybrid Languages

AU - Fors, Niklas

AU - Hedin, Görel

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

U2 - 10.1145/2541348.2541353

DO - 10.1145/2541348.2541353

M3 - Paper in conference proceeding

SN - 978-1-4503-2604-9

SP - 17

EP - 20

BT - Workshop on Refactoring Tools

PB - Association for Computing Machinery (ACM)

T2 - Workshop on Refactoring Tools (WRT '13)

Y2 - 27 October 2013

ER -

Using Refactoring Techniques for Visual Editing of Hybrid Languages

Abstract

Conference

Subject classification (UKÄ)

Access to Document

Fingerprint

Projects

ELLIIT LU P05: Scalable Language Tools for Cyber-Physical Systems

Cite this