Microsoft Technology Licensing, LLC

Daniel James Moseley

Felix Gerard Torquil Ifor Andrew

Christopher Douglas Edmonds

Michael C Fanning

Timothy Scott Rice

Andrew R Sterland

Simon Calvert

Elliot H Omiya

Gregg Bernard Miskelly

Robert Alan Paveza

Harold L Pierson, Iii

Francisco Javier Wong

Andriy Stasyuk

Zhaochuan Gao

Karthik Vivek Nadig

Taylor C Woll

Jeffrey T Fisher

Stephen Harris Toub

Margus Veanes

Sridhar S Madhugiri

Brian Faris Chapman

Olli Ilari Saarikivi

Jose Rodrigo Perez Rodriguez

Harold L Iii Pierson

Gregg Miskelly

Techniques are described herein that are capable of constructing a finite automaton using regular expression derivatives to simulate behavior of a backtracking engine. The behavior indicates an order in which paths in an input regular expression are to be evaluated by the backtracking engine. The finite automaton is constructed to include a graph that includes a root node that represents the input regular expression. Regular expressions are derived such that each derived regular expression is a regular expression derivative of the input regular expression or of another derived regular expression. Priorities are assigned to alternations in the derived regular expressions to correspond to priorities indicated by the behavior. Nodes that represent the respective derived regular expressions and transitions between respective pairs of nodes are caused to be included in the graph. Priorities, which correspond to the order, are assigned to respective branches of the graph.

Finite automaton construction using regular expression derivatives to simulate behavior of a backtracking engine

A method for diagnosing computer readable instructions related to transfers of control is disclosed. A state transition of a unit of execution within a logical operation providing an event handler for a Document Object Model is logged during runtime of the computer readable instructions. Diagnostic information of the logical operation is associated with the state transition. The state transition and associated diagnostic information is provided for retrieval at a selected point in the computer readable instructions.

Diagnostics of state transitions

A method for diagnosing computer readable instructions related to transfers of control is disclosed. A state transition of a unit of execution within a logical operation is logged during runtime of the computer readable instructions. Diagnostic information of the logical operation is associated with the state transition. The state transition and associated diagnostic information is provided for retrieval at a selected point in the computer readable instructions.

A fingerprint is computed from selected metadata of binary files, and used in determining whether to regenerate code-behind file(s). In one case, after ascertaining that a binary-file-set's current metadata-fingerprint differs from a previous metadata-fingerprint, the corresponding code-behind-file-set is regenerated. A code-behind file may also be regenerated, even though its current fingerprint matches its previous fingerprint, because its metadata has changed. If the current fingerprint matches the previous fingerprint and metadata is unchanged, regeneration can be avoided. The fingerprint may consist of, or merely contain, definitions of classes, properties, and other items, and may be limited to metadata that is used when generating the code-behind-file-set. System assemblies are not fingerprinted. Timestamps may be used. Metadata-fingerprint computation code and regeneration determination code are described. Metadata-fingerprints may be used in developing applications with web-based application code frameworks, frameworks having code for rendering a user interface, other frameworks, XAML, C#, and other programming languages.

Code regeneration determination from selected metadata fingerprints

Growing community of inventors

Redmond, WA, United States of America

Daniel James Moseley