A Syntax Definition Method for Vi - sual Specification Languages
نویسندگان
چکیده
Today, the syntax of visual specification languages such as UML is typically defined using metamodeling techniques. However, this kind of syntax definition has drawbacks. In particular, graphic metamodels are not powerful enough, so they must be augmented by a constraint language. In this report, we present a text-based technique for the syntax definition of a graphic specification language. We exploit the fact that in a graphic specification language, most syntactic features are independent of the layout of the graph. So we map the graphic elements to textual ones and define the context-free syntax of this textual language in EBNF. Using our mapping, this grammar also defines the syntax of the graphic language. Simple spatial and context-sensitive constraints are then added by attributing the context-free grammar. Finally, for handling complex structural and dynamic information in the syntax, we give a set of operational rules that work on the attributed EBNF. We explain our syntax definition technique by applying it to the modeling language ADORA which is being developed in our research group. We also briefly discuss the application of our technique to the syntax definition of UML. Copyright c © 2003 by Institut für Informatik der Universität Zürich, Yong Xia and Martin Glinz
منابع مشابه
A Language Definition Method for Visual Specification Languages
Language definition is always an important topic in the field of computer science. For textual specification and programming languages, there are already lots of mature methods of language definition. However, for visual specification languages, especially the so called wide spectrum graphical modelling languages, the existing solutions are far from satisfactory. ADORA[27] is a modelling techni...
متن کاملRigorous EBNF-based Definition for a Graphic Modeling Language
Today, the syntax of visual specification languages such as UML is typically defined using meta-modelling techniques. However, this kind of syntax definition has drawbacks. In particular, graphic meta-models are not powerful enough, so they must be augmented by a textual constraint language. As an alternative, we present in this paper, a text-based technique for the syntax definition of a graph...
متن کاملModel driven engineering of a tableau algorithm for description logics
This paper presents a method for implementing tableau algorithm for description logics (DLs). The architectures of the present DL reasoners such as RACER or FaCT were developed using programming languages as Java or LISP. The implementations are not based on original definition of the abstract syntax, but they require transformation of abstract syntax into concrete syntax implementation languag...
متن کاملFormal Semantics for the Java Modeling Language
A common critique of formal methods in software development practise is, that they are not readily understandable and thus not widely used (see for instance [Nam97]). The Java Modeling Language (JML) was created in an attempt to bridge that gap. By building upon the syntax of Java it is meant to be easily accessible to the common user – who might not be skilled in formal modeling. Due to this a...
متن کاملA Metamodel for SDL-2000 in the Context of Metamodelling ULF
Today the syntax of many languages is defined by using context-free grammars. These syntax definitions suffer from a major drawback: grammars do not allow the definition of abstract, reusable concept definitions. Especially in families of related languages, where multiple languages often share the same concepts, this limitation leads to unnecessary reproduction of concept definitions and a miss...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003