On the pLR Parsability of Visual Languages

Authors:
GENNARO COSTAGLIOLA;VINCENZO DEUFEMIA;FILOMENA FERRUCCI;CARMINE GRAVINO
Affiliations:
-;-;-;-
Venue:
HCC '01 Proceedings of the IEEE 2001 Symposia on Human Centric Computing Languages and Environments (HCC'01)
Year:
2001

Citing 0
Cited 2

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

ACM Transactions on Software Engineering and Methodology (TOSEM)
Visual language implementation through standard compiler-compiler techniques

Journal of Visual Languages and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The widespread use of visual languages has motivatedthe need for grammar-based tools to support designers inthe definition and implementation of graphicalenvironments. The effective use of such systems requiresefficient parsing techniques. The VLCC system makes useof a suitable LR-like methodology that allows us toefficiently parse visual sentences [1]. However there existparticular grammars which are non pLR parsable becausethey can produce run-time conflicts during the parsing ofsome sentences. In this paper we will introduce analgorithm that statically verifies the pLR parsability of apositional grammar by detecting whether or not it wouldproduce run-time conflicts.