Symbol–Relation Grammars: A Formalism for Graphical Languages

Ferrucci, Filomena; Pacini, Giuliano; Satta, Giorgio; Sessa, María I.; Tortora, Genny; Tucci, Maurizio; Vitiello, Giuliana

doi:10.1006/inco.1996.0090

Cited by 41 publications

(21 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A second category uses relationships among visual symbols at a high level of abstraction. In this category we have Symbol-Relation Grammars (SRs) [Ferrucci et al 1996], Hypergraph Grammars Minas [1997Minas [ , 2002, and Layered Graph Grammars (LGGs) Schürr [1996, 1997]. Some of these grammar formalisms fall into the category of graph grammars, since they model visual sentences as graph-like structures.…”

Section: Related Workmentioning

confidence: 99%

“…Symbol-Relation Grammars (SR) views a visual sentence as a set of symbol occurrences and a set of relational items over symbol occurrences [Ferrucci et al 1996]. The drawback of this approach is that the membership problem for the whole class of SR languages is NP-hard, although several subclasses have been defined in order to reduce parsing inefficiency.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A framework for modeling and implementing visual notations with applications to software engineering

Costagliola

Deufemia

Polese

2004

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

We present a framework for modeling visual notations and for generating the corresponding visual programming environments. The framework can be used for modeling the diagrammatic notations of software development methodologies, and to generate visual programming environments with CASE tools functionalities. This is accomplished through an underlying modeling process based on the visual notation syntactic model of eXtended Positional Grammars (XPG, for short), and the associated parsing methodology, XpLR. In particular, the process requires the modeling of the basic elements (visual symbols) of a visual notation, their syntactic properties, the relations between them, the syntactic rules to formally define the set of feasible visual sentences, and a set of semantic routines performing additional checks and translation tasks. Such a process is completely supported by the VLDesk system, which enables the automatic generation of an editor for drawing visual sentences, as well as a processor for their recognition, parsing, and translation into other notations.The proposed framework also provides the basis for the definition of a meta-CASE technology. In fact, we can customize the generated visual programming environment in terms of the supported visual notation, its syntactic properties, and the translation rules. We have used this framework to model several diagrammatic notations used in software development methodologies, including those of the Unified Modeling Language.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

A framework for modeling and implementing visual notations with applications to software engineering

Costagliola

Deufemia

Polese

2004

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

show abstract

“…Positional grammars directly extend the traditional context-free grammars introducing more general spatial relations other than string concatenation. Related works and comparative discussions about grammatical formalisms for the description of visual languages can be found in Ferrucci, Pacini, Satta, Sessa, Tortora, Tucci and Vitiello (1996), Tucci, Vitiello and Costagliola (1994), Wittenburg (1992), Marriott (1994) and Golin (1991).…”

Section: Specifying Two-dimensional Language Syntaxmentioning

confidence: 99%

On the generation of interactive iconic environments

Costagliola¹,

Orefice²,

Polese

et al. 1999

International Journal of Human-Computer Studies

View full text Add to dashboard Cite

“…Visual Programming Languages (VPLs), which usually handle objects that do not possess inherent visual representation [1], have been frequently utilized in many fields of computer science including software engineering. Various approaches have been proposed to formally specify and parsing VPLs [2][3][4]. As a natural extension of formal grammar theory, graph grammars offer the mechanisms for formal specification and parsing of VPLs [5], just like formal grammars do for string languages.…”

Section: Introductionmentioning

confidence: 99%

Approach to Context Computation for Implicit Context-sensitive Graph Grammars

Zou¹,

Zeng²,

Liu³

et al. 2019

International Conferences on Distributed Multimedia Systems

View full text Add to dashboard Cite

Context-sensitive graph grammars are appropriate formalisms for specifying visual programming languages, as they are intuitive, rigorous, and expressive. Nevertheless, some of the formalisms whose contexts are implicitly or incompletely represented in productions, called implicit context-sensitive graph grammars, suffer inherent weakness in intuitiveness or limitations in parsing efficiency. Context tends to be a conceivable way to address this issue. Based on the formalization of context, this paper proposes an approach to the computation of context for implicit context-sensitive graph grammars. Moreover, the complexity of the four algorithms comprising the approach is analyzed and the applicability of the approach is discussed. The proposed approach paves the way for the applications of context in implicit graph grammar formalisms, such as facilitating comprehension of graph grammars and improving efficiency of general parsing algorithms.

show abstract

Symbol–Relation Grammars: A Formalism for Graphical Languages

Cited by 41 publications

References 46 publications

A framework for modeling and implementing visual notations with applications to software engineering

A framework for modeling and implementing visual notations with applications to software engineering

On the generation of interactive iconic environments

Approach to Context Computation for Implicit Context-sensitive Graph Grammars

Contact Info

Product

Resources

About