Reusing expression graphs in computer programming languages

• US 8,549,464 B2
• Filed: 11/22/2010
• Issued: 10/01/2013
• Est. Priority Date: 11/22/2010
• Status: Active Grant

• Current Assignee: Zhigu Holdings Limited
• Original Assignee: Microsoft Corporation
• Inventors: Bond, Barry Clayton, Sewelson, Vivian, Leijin, Daniel Johannes Pieter, Litchev, Lubomir Boyanov
• Primary Examiner(s): Wong, Don
• Assistant Examiner(s): Rivera, Anibal
• Application Number:
  US12/952,077
• Publication Number:
  US 20120131537A1
• Time in Patent Office: 1,044 Days
• Field of Search: None
• US Class Current: 717/100
• CPC Class Codes: G06F 8/36 Software reuse

Abstract

A reusable expression graph system and method that generates reusable expression graphs that can be used with potentially different input parameters in order to achieve computational efficiency and ease of programming. Reusable expression graph mitigate the need to rebuild an expression for each new value. This is achieved in part by creating a node called a “parameter node.” The parameter node acts as a generic placeholder for a leaf node in the expression graph. In addition, the parameter node acts as a proxy for a bindable term of the leaf node, and the bindable term can be either a value or one or more additional expressions. The parameter node then is bound to the bindable term and the expression is evaluated with that bindable term instead of the placeholder. The parameter node created by embodiments of the reusable expression graph system and method works across many different programming languages.

Claims

1. A computing system comprising:

a processing unit; and

one or more computer storage media having computer readable instructions stored thereon that, when executed by the processing unit, cause the processing unit to;

build a reusable expression graph using a parameter node as a leaf node that acts as a placeholder, wherein the reusable expression graph represents an expression;

bind the parameter node to a bindable term such that the parameter node acts act as a proxy for the bindable term, the bindable term comprising another expression that contains a plurality of hard values; and

evaluate the expression using the bindable term comprising the another expression that contains the plurality of hard values.

2. The computing system of claim 1, wherein the computer readable instructions further cause the processing unit to:

receive a user input selecting the another expression, and

bind the parameter node to the bindable term comprising the another expression responsive to the user input.

3. The computing system of claim 1, wherein the computer readable instructions further cause the processing unit to:

reuse the reusable expression graph by;

binding the parameter node to another bindable term comprising a single hard value, and

reevaluating the expression with the parameter node bound to the another bindable term comprising the single hard value without rebuilding the expression.

4. The computing system of claim 1, wherein the computer readable instructions further cause the processing unit to:

reuse the reusable expression graph by;

binding the parameter node to another bindable term comprising a further expression, and

reevaluating the expression using the further expression instead of the another expression without rebuilding the expression.

5. The computing system of claim 4, wherein the further expression comprises multiple hard values that are different than the plurality of hard values of the another expression.

6. The computing system of claim 1, wherein the another expression comprises a directed acyclic graph.

7. One or more computer-readable memory devices or storage devices storing computer readable instructions which, when executed by a processing unit of a computing device, cause the processing unit to perform acts comprising:

building a reusable expression graph using a parameter node as a leaf node that acts as a placeholder, wherein the reusable expression graph represents a first expression;

binding the parameter node to a bindable term comprising a second expression that contains an embedded parameter; and

evaluating the first expression using the bindable term comprising the second expression that contains the embedded parameter.

8. The one or more computer-readable memory devices or storage devices of claim 7, wherein the reusable expression graph comprises another parameter node corresponding to the embedded parameter.

9. The one or more computer-readable memory devices or storage devices of claim 7, the acts further comprising:

reusing the reusable expression graph by;

binding the parameter node to another bindable term comprising a third expression, and

evaluating the first expression using the third expression instead of the second expression without rebuilding an entirety of the first expression.

10. The one or more computer-readable memory devices or storage devices of claim 9, wherein the third expression contains another embedded parameter.

11. The one or more computer-readable memory devices or storage devices of claim 9, wherein the third expression contains a hard value and does not contain another embedded parameter.

12. The one or more computer-readable memory devices or storage devices of claim 9, wherein the third expression contains a plurality of hard values.

13. The one or more computer-readable memory devices or storage devices of claim 7, wherein the parameter node has an associated data type indicating the parameter node takes an integer value.

14. The one or more computer-readable memory devices or storage devices of claim 7, wherein the parameter node has an associated data type indicating the parameter node takes a floating point value.

15. A computer-readable memory device or storage device storing a reusable expression graph, the reusable expression graph comprising:

an operator node containing an operator;

a first parameter node that acts as a first placeholder; and

a second parameter node that is joined to the first parameter node by the operator node,

wherein the first parameter node comprises at least one operator and at least one operand.

16. The computer-readable memory device or storage device of claim 15, further storing computer readable instructions which, when executed by a processing unit of a computing device, cause the processing unit to perform acts comprising:

evaluating an expression represented by the reusable expression graph, including evaluating the at least one operator and the at least one operand.

17. The computer-readable memory device or storage device of claim 16, the reusable expression graph further comprising a third parameter node.

18. The computer-readable memory device or storage device of claim 17, wherein the third parameter node further comprises a fourth parameter node.

19. The computer-readable memory device or storage device of claim 18, wherein the third parameter node further comprises another operator and the fourth parameter node is another operand.

20. The computer-readable memory device or storage device of claim 15, further storing computer readable instructions which, when executed by a processing unit of a computing device, cause the processing unit to perform acts comprising:

at a first time, evaluating an expression represented by the reusable expression graph by evaluating the at least one operator and the at least one operand;

binding the first parameter node to a different operator and a different operand; and

at a second time, evaluating the expression represented by the reusable expression graph by evaluating the different operator and the different operand instead of the at least one operator and the at least one operand without rebuilding an entirety of the expression.