REUSING EXPRESSION GRAPHS IN COMPUTER PROGRAMMING LANGUAGES

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...

Full description

Saved in:
Bibliographic Details
Main Authors LITCHEV LUBOMIR BOYANOV, LEIJIN DANIEL JOHANNES PIETER, SEWELSON VIVIAN, BOND BARRY CLAYTON
Format Patent
LanguageEnglish
Published 24.05.2012
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:Application Number: US20100952077