Parsing Nonlinear Languages

  • Authors:
  • Maurizio Tucci;Giuliana Vitiello;Gennaro Costagliola

  • Affiliations:
  • Univ. of Salerno, Salerno, Italy;Univ. of Salerno, Salerno, Italy;Univ. of Salerno, Salerno, Italy

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

The diagrammatic approach to user interfaces for computer-aided software development toolkits, visual query systems, and visual programming environments, is based on the use of diagrams and charts traditionally drawn on paper. In particular, the VLG system (Visual Language Generator) has been proposed to generate icon-oriented visual languages customized for given applications. The syntactical model underlying the interpretation of a visual language in VLG has been designed to describe icon-oriented visual languages. In order to enable the VLG system to apply to any kind of graphical languages, like diagrammatic ones, it is necessary to find a more general syntactical model able to support both their generation and interpretation. This paper addresses the comprehension of the features that a grammatical formalism for nonlinear languages must have to match any requirement for an efficient parsing. To this aim, relation grammars support an easy implementation of a general parsing algorithm for multidimensional languages, parametric with respect to the rewriting rules of the grammar. We compare the expressive power of relation grammars to grammatical formalisms for graph grammars.