International Business Machines Corporation

David Joseph Streeter

Michael S Karasick

John Joseph Barton

Danny Soroker

Harold Leon Ossher

Derek Bruce Inglis

Vincent Joseph Kruskal

Lee Richard Nackman

Ian Hugh Carmichael

Derek Lieber

A compiler having one or more separate components, each of which contains the source code of the compiler which is responsible for implementing a corresponding data representation. These components are responsible for all of the parts of compilation which depend on the corresponding data representation. In one aspect of the present invention, a compiler comprises: a converter for converting program code to object code; and a data representation implementor for isolating within the compiler information that relates to representation of data at runtime, wherein the converter accesses the data representation implementor to obtain information that is needed for converting any portion of the program code that is dependent on representation of data at runtime.

Compiler for supporting multiple runtime data representations

An extensible incremental compiler includes an incremental compiler which is configured to pass control to one or more extensions at one or more points in the compilation process. The extensible incremental compiler determines whether an extension is active at various points in the compilation process and, if so, transfers control to the active extension. The extension mechanism performs its programed functionality and then returns control back to the incremental compiler. The extensions are supplied to the incremental compiler via a linked library.

Extensible compiler and method

An enhanced compiler for compiling C&plus;&plus; programs without the use of forward declarations normally included in program header files. Through multiple parsing passes, the compiler extracts definitions for the declarations directly from the bodies of the C&plus;&plus; files. By saving the definitions to a persistent program representation, for example a program database, on subsequent sweeps, only definitions for new or changed declarations need be updated. In this way, C&plus;&plus; programs can be incrementally compiled on a declaration by declaration basis.

Incremental compilation of C&plus;&plus; programs

A priority queue is used to sequence template instantiations in compiling C++ programs. If the analysis of a C++ code fragment encounters a name that requires full instantiation and no matching full instantiation exists, the parse is terminated and rescheduled, and a full instantiation is scheduled as an antecedent of the failed parse. 'Antecedent' means that the failed parse code fragment will not be reparsed until after the full instantiation has succeeded. Only when the full instantiation has succeeded will the terminated parse be reconsidered. Parsing full instantiations may cause additional full instantiations. These are handled in the same manner; the additional instantiation is scheduled, and the current parse is failed and rescheduled. At the time of scheduling, the antecedent instantiation is marked with its dependent, so that the dependent chain give the chronology of the instantiation. This makes it easy to generate historical or 'traceback' information for meaningful error messages.

Growing community of inventors

Scarborough, Canada

David Joseph Streeter