Global ETD Search

31	A UNIX port of the Perkin-Elmer Pascal run-time library Townsend, Harvard Charles January 2010 (has links) Typescript (photocopy). / Digitized by Kansas Correctional Industries Compiling (Electronic computers) Coroutines (Computer programs) UNIX (Computer file)
32	The design of an interdata implementation of the U. S. Navy MINI- COBOL Anderson-Rovia, Terry Wayne January 2010 (has links) Digitized by Kansas Correctional Industries Compiling (Electronic computers) Minicomputers
33	Natural language analysis via augmented transition networks (ATN) Lazaro, Jose Ma. U. J January 2010 (has links) Typescript (photocopy). / Digitized by Kansas Correctional Industries Compiling (Electronic computers) LISP (Computer program language) ATN (Computer program)
34	The development and analysis of a portable runtime library accessable to all FORTRAN, COBOL and PASCAL compilers under the UNIX system 5 operating system Payne, Kendall Robert January 2010 (has links) Typescript (photocopy). / Digitized by Kansas Correctional Industries Compiling (Electronic computers) Coroutines (Computer programs) UNIX (Computer file)
35	Interfacing of a Euclid compiler to a Pascal code generator Hsu, Pohwa January 2011 (has links) Typescript (photocopy). / Digitized by Kansas Correctional Industries Compiling (Electronic computers) EUCLID (Computer program language) Computer interfaces
36	Java bytecode compilation for high-performance, platform-independent logical inference Arte, Ashish. Sturgill, David Brian. January 2005 (has links) Thesis (M.S.)--Baylor University, 2005. / Includes bibliographical references (p. 146-148).
37	A feasibility study on compiling reactive problem solution methods for an Al domain Kaul, Lothar 07 May 1991 (has links) This paper investigates the feasibility of compiling the functionality of a decision theoretic problem solving engine into a set of rules or functionally similar construct. The decision theoretic engine runs in exponential time, while the rule set runs in linear time at worst. The main question that will determine the feasibility is whether the size of the rule set is small enough to be of practical use. Based on the tests run, size does not appear to be a limiting factor in compiling rule sets. / Graduation date: 1992 Decision-making -- Data processing Compiling (Electronic computers) Artificial intelligence
38	Compilation of combinational logic units for universal AHPL Chen, Duan-Ping January 1981 (has links) No description available. Compiling (Electronic computers) Computer programming.
39	SIMPLIFYING CODE GENERATION THROUGH PEEPHOLE OPTIMIZATION Davidson, Jack W. (Jack Winfred) January 1981 (has links) 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. Compiling (Electronic computers) Debugging in computer science. PO (Computer program)
40	A translator for languages generated by context-free grammars/ Gillespie, William Gordon January 1974 (has links) No description available. Machine translating. Compiling (Electronic computers)

Search results