J. Rekers, andA.Schürr,AGraphBasedFramework for the implementation of Visual Environments, Proceedings of 12th IEEE Symposium on Visual Languages, Boulder, Colorado, USA, Sep. 3--6, 1996.  Home/Search   Document Not in Database   Summary   Related Articles

....of VPLs. SPARGEN [4] is a visual language compiler generator. Its generated parser supports additional action routines written in C . This allows it to specify complicated actions in the form of rules. It, however, does not support the generation of a visual programming environment. PROGRES [5,6,7] can generate both programming environments and parsing algorithms. But it cannot use existing programming languages (e.g. C, C , Java) to specify the actions of its rules directly. Instead, it uses a simple textual language which is a part of the system. This limits the functionality of target ....

....through graph transformations. There, however, has been no graph grammar that can handle a wide range of visual languages both effectively and efficiently. For example, if a grammar is expressive enough to represent various types of VPLs, its parsing algorithm usually reaches exponential time [5]. We have proposed a new type of graph grammar known as reserved graph grammar [10] which can effectively represent most existing types of diagrams with a parsing algorithm of polynomial time complexity. Figure 7 shows a reserved graph grammar for summation. The grammar completely describes the ....

J. Rekers, andA.Schürr,AGraphBasedFramework for the implementation of Visual Environments, Proceedings of 12th IEEE Symposium on Visual Languages, Boulder, Colorado, USA, Sep. 3--6, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC