Thesis (M.S. in Modeling, Virtual Environments and Simulation)--Naval Postgraduate School, December 2003. / Thesis advisor(s): Don Brutzman, Curt Blais. Includes bibliographical references (p. 117-118). Also available online.

Thesis (M.Sc.)--York University, 2000. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 132-139). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pMQ59175

Thesis (M. Sc.)--York University, 2001. / Typescript. Includes bibliographical references (leaves 164-167). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pMQ66388.

Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: computation pushdown; XML; order-based Xquery processing; relational database; ordered SQL queries; data model mapping; XQuery; XML data mapping; SQL; XML algebra rewrite rules; XML document order. Includes bibliographical references (p. 64-67).

Thesis (M. Sc.)--York University, 2001. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 87-92). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pMQ67749.

Not available / text

No description available.

No description available.

Generators, or expressions capable of producing a sequence of results during evaluation, are found in one form or another in a number of programming languages. The use of generators has been limited by a lack of understanding of their operation. Control structures for generating expressions are usually patterned after the control structures found in conventional language designs. A notation for describing the static aspects of generators is presented in this dissertation. This notation is used to describe the operation of the generator-based control structures in Icon and to introduce several novel control structures based upon generator evaluation. Co-expressions are introduced as the expression-level equivalent of coroutines, and combined with generators to provide a powerful programming facility. Finally, machine and language independent models for implementation of goal-directed evaluation and co-expressions are presented.

Producing compilers that generate good object code is difficult. The early phases of the compiler, syntactical and lexical analysis, have been automated. The latter phases, code generation and optimization, are more difficult because of the wide range of machine architectures. This dissertation describes a technique for the rapid implementation of production-quality compilers though the use of a machine-independent retargetable peephole optimizer, PO. PO is retargeted by providing a description of the new machine. PO simplifies many of the tasks associated with developing compilers. It simplifies code generation by eliminating most of the case-analysis typically necessary to produce good code. It simplifies the optimization phase by collecting several disparate optimizations and generalizing them as peephole optimizations. PO also demonstrates the traditional optimizations, such as register allocation, common subexpression elimination, and removal of unreachable code, may be done more thoroughly and completely when information about the target machine is available.