HINWEIS: Diese Seiten sind veraltet. Bitte erwägen Sie, auf die Seiten des Nachfolgesystems DEViL zu wechseln.
Visual expressions are represented as trees in VL-Eli. A context free grammar defines the structure of such trees. Nodes of the tree can hold attributes of arbitrary types. Further, they can hold cross references to other tree nodes.
Visual representations are computed out of the abstract tree by an attribute evaluator. Modifications of such a visual representation leads in turn to a change of the underlying abstract structure. Not only the computation of visual representations, but also structural transformation, analysis and translation is specified by attribute evaluators.
There are libraries of reusable specifications for commonly-encountered subtasks, which are called specification modules. They can be combined and adapted to the actual needs in a flexible manner. In the problem domain of editor implementation specification modules encapsulate so called visual patterns. The concept of visual patterns allows the language designer to reuse and combine common visual constructs on a high level of abstraction. In many cases, visual languages can be completely implemented by application of visual patterns.
A visual patterns does not only encapsulate properties of a visual representation, it also encapsulates specialized interaction and layout mechanisms. So, our specification technique has the potential to generate intuitive and user-friendly editors.
Our implementation is based on the Eli system. In this way, all Eli tools for analysis and transformation can be reused. Tcl/Tk is used to implement the user interface. Further, the constraint solver Parcon is integrated. VL-Eli consists of 8000 lines for Tcl scripts, 1000 lines of Shell scripts, 5000 lines specifying the specification language vtree, and a 12000 lines for the implementation for some visual patterns.
A complete, possibly more up-to-date list of the working group's publications is
available at the
publications page.