Visual Meta-Programming Notation
MetadataShow full item record
This paper describes a draft of visual notation for meta-programming. The main suggestions of this work include specialized data structures (lists, tuples, trees), data item associations that provide for creation of arbitrary graphs, visualization of data structures and data flows, graphical notation for pattern matching (list, tuple, and tree patterns, graphical notation for context free grammars, streams), encapsulation means for hierarchical rules design, two-dimensional data-flow diagrams for rules , visual control constructs for conditionals and iteration, default mapping rules to reduce real-estate requirements for diagrams, and dynamic data attributes. Two-dimensional data flow diagrams improve readability of a meta-program. The abstract syntax type definitions for common programming languages and related default mappings (parsing and de-parsing) provide for a practically feasible reuse of those components.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
Auguston, Mikhail; Berzins, Valdis; Bryant, Barrett (2001-10-14);This paper presents a relatively simple visual notation for meta-programming that spans multiple levels of abstraction. Two-dimensional data flow provides readable representations of meta-programs that expose potential ...
Papaliakos, Vasilios (Monterey, California. Naval Postgraduate School, 2004);This thesis proposes a design for content repurposing of electrical diagrams for presentation in small-screen wireless handheld devices. Content repurposing is the on-line adaptation of content to fit device capabilities ...
Sasao, T.; Butler, Jon T. (2003-05);We consider the path length in decision diagrams for multiple-valued functions. This is an important measure of a decision diagram, since this models the time needed to evaluate the function. We consider the path length ...