US 2013/0159967 A1Published application

Available symbol set generation using untyped variable

AssigneeMicrosoft Corporation

InventorsCharles P. Jazdzewski, Michael C. Fanning

Life of this patent

Estimating the term…

Loading patent…

Abstract

The facilitated computation of an available symbol set at code locations in a dynamic language program, in which the program is executed up to a particular halt point for which an available symbol set is to be generated. At the halt point, a type of a value of a particular variable may be used in order to generate the available symbol set. However, at the halt point, the variable does not yet have a value of a useful type (e.g., null or undefined), which is possible in a dynamic language program. Rather than return an error, the principles described herein returns an arbitrary symbol set anyway. Specifically, the variable had previously been annotated with information represented accessed type information for the variable, even though the variable has not formally been defined. This annotated information may be used to generate the available symbol set.

Claims20

Dependent claims

A computer program product comprising one or more computer-readable media having thereon computer-executable instructions that are structured such that, when executed by the one or more processors of a computing system, causes the computing system to perform a method for facilitating computation of an available symbol set at code locations in a dynamic language program, the method comprising:

an act of the computing system accessing a dynamic language program;
an act of accessing type information for at least one variable of the dynamic language program;
an act of annotating the variable with information representing the accessed type information without declaring the variable as being of a particular type;
an act of executing the dynamic language program;
an act of halting execution of the dynamic language program at a halt point in which an available symbol set would be derived based on a value of the variable having a useful type;
an act of determining that the variable does not have a value of a useful type to formulate an available symbol set at the halt point;
an act of accessing the annotated information to determine the type information;
and
an act of generating the available symbol set based on the type information even though the variable does not have a value of a useful type at the halt point.

6 more elements

A method for a computing system to facilitate computation of an available symbol set at code locations in a dynamic language program, the method comprising:

an act of the computing system accessing a dynamic language program;
an act of the computing system accessing type information for at least one variable of the dynamic language program;
an act of the computing system annotating the variable with information representing the accessed type information without declaring the variable as being of a particular type;
an act of executing the dynamic language program;
an act of halting execution of the dynamic language program at a halt point in which an available symbol set would be derived based on a value of the variable having a useful type;
an act of determining that the variable does not have a value of a useful type to formulate an available symbol set at the halt point;
an act of accessing the annotated information to determine the type information;
and
an act of generating the available symbol set based on the type information even though the variable does not have a value of a useful type at the halt point.

6 more elements

Dependencies are inferred from the claim text.