Brad T. Vander Zanden. Constraint Grammars--A New Model for Specifying Graphical Applications. Human Factors in Computing Systems, Proceedings SIGCHI'89, Austin, TX, April, 1989, pp. 325-330.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and then maintained automatically by the system, for implementing several Past, Present and Future of User Interface Software Tools To appear in ACM TOCHI 12 draft of 09 16 99 different aspects of a user interface. Examples include Sketchpad [61] ThingLab [5] HIGGENS [19] CONSTRAINT [68], Garnet [34] Rendezvous [18] Amulet [36] and subArctic [20] With constraints, the designer can specify, for example, that a line must stay attached to a rectangle, or that a scroll bar must stay at the right of a window. Similarly, one could declare that the color, size, or position of ....

Vander Zanden, B.T. "Constraint Grammars--A New Model for Specifying Graphical Applications," in Proceedings SIGCHI'89: Human Factors in Computing Systems. 1989. Austin, TX: pp. 325-330.

....are constrained by equations. Because the system only allows one equation to be attached to each cell and because it only propagates values from parameters of an equation to a cell and not in the other direction, it can be thought of as a one way constraint system. A number of systems such as [Born81, Nels85, Born86a, Born86b, Duis86, Vand89, Hill92] have employed more general multi way constraints [Lele88] in the user 21 interface or graphical presentation domain. Multi way constraints are more expressive and support a larger class of computations. However, with this additional power comes some drawbacks. In particular, these techniques ....

Vander Zanden, B., "Constraint Grammars --- A New Model for Specifying Graphical Applications", Proceedings of CHI '89, Austin, TX, April 1989, pp. 325330.

....[Maulsby89a] Each program step is associated with a set of preconditions and postconditions to be met, which can include touch constraints. Vander Zanden developed a method of specifying graphical applications using constraint grammars to isolate the visual display from the data structures [Vander Zanden89] The second implementation of MatchTool, MatchTool 2, has a constraint based search and replace feature that, like the other techniques described in these chapters, works in conjunction with the graphics and interface editing modes of the Chimera editor. This chapter describes the motivation, ....

Vander Zanden, B. T. Constraint Grammars---A New Model for Specifying Graphical Applications. In CHI `89 Proceedings (Austin TX, April 30-May 4, 1989). ACM, New York, 1989, 325-330.

....and is more or less hidden in the code. There are only very few systems for generating a diagram editor that are based on a formal model. A concept is presented in [3] but not a generator. In the PAGG system [4] layout of diagrams is troublesome and editing inconvenient. The Constraint system [5] uses a grammar model based on context free grammars and constraints for automatic layout of diagrams. Context free grammars, however, do not permit direct representation of multidimensional relationships, as needed for the layout of diagrams. Furthermore, the editing capabilities are very ....

....for an intuitive representation of diagrams as illustrated in Fig. 2: nodes in a hypergraph stand for points (e.g. in the plane) hyperedges are diagram elements whose position is given by the nodes being visited by the hyperedge. A representation in systems which do not use hypergraphs [4, 5] would be significantly more complicated. Context free hypergraph grammars are analogously defined as context free (string) grammars and have similar properties [10] However, their expressiveness is higher than that of context free grammars. Terminal and nonterminal hyperedges are used in ....

[Article contains additional citation context not shown here]

B.T. Vander Zanden, "Constraint grammars - a new model for specifying graphical applications", in K. Bice and C. Lewis, editors, Proc. CHI'89, vol. 20 of SIGCHI Bulletin, pp. 325--330, Mar. 1989.

....interface behavior. However, interface layout and spatial relations between objects are also important. One approach to layout is simply to draw the interface. However, this method does not do very well when run time re sizing is allowed. Recent research has settled on constraint grammars[12] to solve this problem. Hudson s Apogee UIMS[4] has a particularly clever method for setting layout constraints graphically. INTERACTION OBJECT GRAPHS Interaction Object Graphs (IOGs) are designed to add widget specification to Interface Representation Graphs. They combine the data flow and ....

Vander Zanden, Bradley T., "Constraint Grammars -- A New Model for Specifying Graphical Applications," Proceedings of ACM CHI'89 Conference on Human Factors in Computing Systems, 1989, pp. 325-330.

....modifications to layout should be taken into account. This is generally not done by layout algorithms. Layout by Example [4] is based on fuzzy logic which makes possible adapting layout rules based on examples, but the system does not support layout while editing a diagram. Constraint grammars [5] allow for automatic layout in interactive environments. Equational constraints are used, however, equations determine relations between attributes in a definite way, just as non interactive layout algorithms usually do. Since constraint grammars are based on contextfree grammars, they do not ....

....of the diagram around the point of modification that is as small as possible. Thus, confusion of users due to unnecessary changes will be eliminated. We consider maintaining layout while editing diagrams interactively an important goal that has not been addressed by other systems such as [2] or [5]. terminal symbols event derivation receptors display objects display events interface interaction tree transformation constraint evaluation hypergraph mation dialog rules rules diagram editor editor specification tree grammar transforFigure 1: System overview Fig. 1 gives an overview of the ....

[Article contains additional citation context not shown here]

B.T. Vander Zanden, "Constraint grammars -- a new model for specifying graphical applications", SIGCHI Bulletin, vol. 20, pp. 313--318, Mar. 1989.

....of valid diagrams, however, isn t specified formally, but more or less hidden in the code. There are only very few systems for generating a diagram editor that are based on a formal model. In the PAGG system [4] layout of diagrams is troublesome and editing inconvenient. The Constraint system [9] uses a grammar model based on context free grammars and constraints for automatic layout of diagrams. A disadvantage is that context free grammars don t permit direct representation of multidimensional relationships, as needed for the layout of diagrams. Furthermore, the editing capabilities are ....

....(consisting of a simple statement and an if) is selected in the lower NSD. This editing style is solely based on selection and pressing buttons or choosing menu items. It is the only way of editing possible in diagram editors which can be generated with other tools like PAGG [4] or Constraints [9]. With DiaGen diagram editors with much more convenient editing operations can be specified. e.g. the modification from Fig. 1 to Fig. 2 can also be made by simply pressing the mouse button while the mouse pointer is located over the selected group, dragging this group to its destination, and ....

[Article contains additional citation context not shown here]

B.T. Vander Zanden. Constraint grammars - a new model for specifying graphical applications. In K. Bice and C. Lewis, editors, Proc. CHI'89, volume 20 of SIGCHI Bulletin, pages 325--330, March 1989.

....and is more or less hidden in the code. There are only very few systems for generating a diagram editor that are based on a formal model. A concept is presented in [5] but not a generator. In the PAGG system [6] layout of diagrams is troublesome and editing inconvenient. The Constraint system [7] uses a grammar model based on context free grammars and constraints for automatic layout of diagrams. Context free grammars, however, do not permit direct representation of multidimensional relationships, as needed for the layout of diagrams. Furthermore, the editing capabilities are very ....

....a derivation graph are mapped on the screen. Their image is composed of primitive elements (lines, text, etc. and also part of the specification. The remaining parts in Fig. 3 are for user interaction. 3 Diagram structure and layout Because of their one dimensional structure strings as used in [7] cannot represent multidimensional relationships directly. We use hypergraphs instead as internal models of diagrams being edited. A hypergraph is a generalization of a graph, in which edges are hyperedges, i.e. they can be connected to any (fixed) number of nodes. Each hyperedge has a type and a ....

[Article contains additional citation context not shown here]

B.T. Vander Zanden, "Constraint grammars - a new model for specifying graphical applications", in K. Bice and C. Lewis, editors, Proc. CHI'89, vol. 20 of SIGCHI Bulletin, pp. 325--330, Mar. 1989.

....draw the interface. This method does not do very well when run time re sizing is allowed. Drawing the interface provides an absolute layout of the objects in the interface without any information about which spatial relationships can be adjusted when the interface is re sized. Constraint grammars [Vander Zanden, 1989] solve this problem by using equations to specify the position of interface objects relative to a few, designer defined positions in the interface. e.g. the upper left corner of a window or the window s midpoint. Hudson s [1989] Apogee UIMS has a particularly clever method for graphically ....

Vander Zanden, B. T. 1989. Constraint grammars -- a new model for specifying graphical applications. Proceedings of the ACM CHI'89 Conference on Human Factors in Computing Systems, pp. 325-330.

....are only very few systems for generating a diagram editor that are based on a formal model. Just a concept for diagram editors is presented in [4] but a generator has not been realized. In the PAGG system [5] layout of diagrams is troublesome and editing inconvenient. The Constraint system [6] uses a grammar model based on contextfree grammars and constraints for automatic layout of diagrams. A disadvantage is that context free grammars do not permit direct representation of multidimensional relationships, as needed for the layout of diagrams. Furthermore, the editing capabilities are ....

....the position for insertion. Finally, the Insert button has to be pressed. This editing style is solely based on selection and pressing buttons or choosing menu items. It is the only way of editing possible in diagram editors which can be generated with other tools like PAGG [5] or Constraints [6]. The concept is the same as in the Synthesizer Generator [7] for syntax directed text editing. It is sufficient there, but for diagrams a more natural way of editing is desirable. With DiaGen diagram editors offering true direct manipulation can be specified. e.g. the modification from Fig. 1 to ....

[Article contains additional citation context not shown here]

B.T. Vander Zanden, "Constraint grammars - a new model for specifying graphical applications", in K. Bice and C. Lewis, editors, Proc. CHI'89, vol. 20 of SIGCHI Bulletin, pp. 325--330, Mar. 1989.

....interface behavior. However, interface layout and spatial relations between objects are also important. One approach to layout is simply to draw the interface. However, this method does not do very well when run time re sizing is allowed. Recent research has settled on constraint grammars[11] to solve this problem. Hudson s Apogee UIMS[4] has a particularly clever method for setting layout constraints graphically. INTERACTION OBJECT GRAPHS Interaction Object Graphs (IOGs) are designed to add widget specification to Interface Representation Graphs. They combine the data flow and ....

Vander Zanden, Bradley T., "Constraint Grammars -- A New Model for Specifying Graphical Applications," Proceedings of ACM CHI'89 Conference on Human Factors in Computing Systems, 1989, pp. 325-330.

No context found.

Brad T. Vander Zanden. Constraint Grammars--A New Model for Specifying Graphical Applications. Human Factors in Computing Systems, Proceedings SIGCHI'89, Austin, TX, April, 1989, pp. 325-330.

No context found.

Bradley T. Vander Zanden. Constraint grammars - a new model for specifying graphical application. In Conference on Human Factors in Computing Systems (CHI 89), pages 325--330. ACM SIGCHI, Addison-Wesley, May 1989.

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