Back to results
US 2013/0159976 A1Published application
Abstract syntax tree transformation
AssigneeMicrosoft Corporation
InventorsCharles P. Jazdzewski, Michael C. Fanning
Life of this patent
Estimating the term…
Loading patent…
Loading patent…
AssigneeMicrosoft Corporation
InventorsCharles P. Jazdzewski, Michael C. Fanning
Estimating the term…
The transformation of an abstract syntax tree of a dynamic language program at evaluation time in a manner that is helpful for evaluating the program. For instance, the abstract syntax tree may be altered such that metadata is attached to variables generated during execution. The tree might also be altered to force code to execute faster or more likely than would occur otherwise. This might occur so that the dynamic language program might be executed at authoring time up to a halt point that represents a point of interest to the author. Without transformation of the abstract syntax tree, the execution might have not proceeded to the halt point or might have taken a long time. Once at the halt point, the program state at the halt point may be evaluated, allowing the program to perform functions such as generating an available symbol set at the halt point.
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 transforming an abstract syntax tree, the method comprising:
A method for facilitating evaluation of a dynamic language program, the method comprising:
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 transforming an abstract syntax tree, the method comprising:
Dependencies are inferred from the claim text.