Investigation and implementation of a tree transformation system for user friendly programming
Chok, Mohamed B.
MacLennan, Bruce J.
Bradley, Gordon H.
MetadataShow full item record
The programming system (TTPS) described in this thesis is based on tree transformatioc techniques, commonly known as abstract transformation. The objects manipulated by the user through "TTPS" are: the templates, the transformation rules, and the programs. The templates define the syntactic and semantic language framework which will be used to parse and unparse both the rules and the program trees. The rules define the semantic behavior of the transformation process. The program represents the source tree which describes the problem to solve, and will be interpreted by a successive application of the supplied rules until they no longer apply. "TTPS" provides an appropriate environment for a large class of applications (e.g. system programming, code generation, structure transformation, simulation of syntax directed editors, and other conventional applications) , and supports many programming styles such as functional programming, conventional programming, and user defined style.
RightsCopyright is reserved by the copyright owner.
Showing items related by title, author, creator and subject.
MacLennan, Bruce J. (Monterey, California. Naval Postgraduate School, 1984-06); NPS52-84-007Abstract calculi (tree transformation systems, term rewriting systems) express computational processes by transformation rules operating on abstract structures (trees). They have applications to functional programming, ...
McLaughlin, Thomas Robert Jr. (Monterey, California. Naval Postgraduate School, 1973-03);This thesis considers mathematical techniques for computing the optimal allocation of weapons from m different systems against n undefended targets. A standard nonlinear programming problem is considered. A discussion ...
Ignizio, James P.; Thomas, Lyn C. (Monterey, California. Naval Postgraduate School, 1982-12); NPS55-82-035A number of approaches have been proposed (and several implemented) for the solution of lexicographic, multiobjective programming problems. These approaches may be divided into two classes. The first encompasses the ...