Microsoft Technology Licensing, LLC

Dennis Mark Canady

Ilan Gabriel Caron

Alan W Carter

Tom Corbett

Steven E Lees

Rajiv Kumar

David Gordon Bradlee

Mark L Roberts

In compiling source code organized in projects, unqualified name references are bound to program objects by searching namespaces in ascending hierarchical order from a current program unit to a current project. Namespaces within projects directly referenced by the current project are then searched. The search is completed at the first namespace in the search order which contains the matching name. Thus, program objects in projects directly referenced by the current project can be referenced by an unqualified name, without import or export lists of program elements.

Cross-project namespace compiler and method

Source code including application defined expressions and non-conforming identifiers are compiled to executable code. The source code is written with an application defined expression or non-conforming identifier enclosed between a predefined pair of matching separators, such as square brackets. When a sequence of characters between the predefined separators is encountered in the source code during compiling, a symbol table is searched for a matching identifier. If found, the characters are interpreted as a non-conforming identifier and bound to the matching identifier. If not found, the characters are interpreted as an application defined expression and bound to a function call for an evaluating function provided in an application library.

Compiler and method for evaluation of foreign syntax expressions in

A compiler and compiling method minimizes recompilation of a computer program after an edit. The program is organized in plural program units, such as modules. The units are each compiled through a sequence of compilation states, including plural intermediate compilation states. In compiling each of the program units, dependencies between units are recorded in a table. When an edit to a program unit is later attempted, the edited unit is decompiled to one of various intermediate compilation states according to the edit performed. Units dependent of the edited unit are decompiled to one of various intermediate compilation states according to the dependency of the dependent unit on the edited unit. When next compiling the program, the units are compiled from their respective intermediate compilation state. Units also can be saved in various intermediate compilation states to minimize compiling when the program is again loaded.

Module dependency based incremental compiler and method

Growing community of inventors

Redmond, WA, United States of America

Dennis Mark Canady