Microsoft Technology Licensing, LLC

Sergey Dubinets

Evgeny Veselov

Brian Robert Marshall

Anton V Lapounov

Henricus Johannes Maria Meijer

Yan Valerie Leshinsky

Michael Lee Brundage

Christopher Lovett

Michael Philip Arcuri

Andrew Eyring Kimball

Todd F Pfleiger

Ralf Lammel

Mark W Fussell

Michael Joseph Morton

Arpan A Desai

Yana D Kadiyska

Chintan Mehta

A document is represented as a node tree in a document processing system. Edits to a node are represented in a change record that has a one-way link to the node. A text mark has a one-way link to the change record. It deletes that link when the changes represented by the change record are reflected in the text mark. A memory management system releases the memory allocated to the change record when no other object links to it.

Controlling mark positions in documents

The subject invention pertains to a system and method of extending programming languages to enable static inheritance. In particular, static subclasses can be defined which extend class functionality and/or behaviors without extending base class state. The subclasses can be specified to include static fields as well as static or instance methods and/or properties that provide a more specific interpretation of an object without extending the state thereof. Furthermore, a static subclass can be specified to provide for type aliasing. Casting is also enabled in both directions between base class type and derived class type in a convenient manner without run-time performance penalties. According to one aspect of the invention, the disclosed systems and methods can be employed to create specific programmatic context, for instance for accessing, manipulating, and type checking external data (e.g., XML).

Static inheritance systems and methods

Techniques are provided for performing focus inference when compiling an Extensible Markup Language Transforms (XSLT) stylesheet into a compiled XSLT processor. In XPath/XSLT, expression evaluation occurs with respect to the dynamic context. In XPath, the part of the dynamic context, related to the context node-set, is called the 'focus' of the expression. Conceptually, the focus would need to be systematically computed and propagated along the recursive execution of XSLT templates. This is costly. Focus inference enables the more efficient execution of XSLT programs since the inferred focus information can be used directly by a code generator in an XSLT compilation architecture.

XSLT/XPATH focus inference for optimized XSLT implementation

An incremental parser for hierarchical files is provided where the file can be parsed into a tree representation. Changes to the file can effectuate incremental changes to the tree such that the whole hierarchical file need not be reparsed; the incremental change modifies the necessary portions of the tree, not necessarily the entire tree. Moreover, the incremental parser can intelligently handle errors related to modification of the hierarchical file, such as unmatched tags corresponding to unmatched nodes in the tree. Such error handling provides operability with the malformed hierarchical file rather than providing an error and/or rejecting the file as modified.

Incremental parsing of hierarchical files

A method and system for downloading an editable web page having corresponding dynamic content. Dynamically rendered web pages are provided with a special script therein. In response to a client request for a dynamically rendered web page, the server sends the editable page with the script embedded therein. When the script is executed at the client, it creates a frame in the browser, and provides a reference to a DLL that is located on the server and the address for the same requested web page. The DLL is executed at the server and, in response, opens the dynamically rendered web page, retrieves dynamic content for the web page from a database, loads the dynamic content into the document, and returns the web page with the dynamic content to the browser as the content for the newly created frame.

Editable dynamically rendered web pages

A query runtime architecture and an exemplary application programming interface suitable for the architecture are presented. The architecture inputs one or more XML queries and views and enables the queries to be translated wherein the queries and views may be run over multiple data sources of different data models. The architecture incorporates front-end compilers which convert input queries and views into an intermediate language representation which represents the meaning of the respective query or view. The architecture may then allow the back-end compiling of the intermediate language representation to target languages compatible with the data sources desired to be queried. The architecture also allows the execution of those target compilations to extract the data requested of the queries. The invention also discloses an example application programming interface for the query runtime system.

Common query runtime system and application programming interface

Growing community of inventors

Bellevue, WA, United States of America

Sergey Dubinets