Language binding system

Data processing: software development – installation – and managem – Software program development tool – Modeling

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C717S132000, C707S793000

Reexamination Certificate

active

07620933

ABSTRACT:
A method for determining a distance between a first node and a second node that share a root node within a structured program. A first node path between the first node and the root node is determined, and a first node depth is counted. A second node path between the second node and the root node is also determined, and a second node depth is likewise counted. One of the node paths that has a highest count is designated as the deepest path, and the other is designated as the shallowest path. The deepest path is descended to a depth that is equal to that of the shallowest path, and a distance count is increased by one count for each node that was descended on the deepest path to reach a depth that is equal to the shallowest path. Both the deepest path and the shallowest path are descended to the root node, and the distance count is increased by two counts for each node that was descended. The distance count is provided as the distance between the first node and the second node.

REFERENCES:
patent: 6871201 (2005-03-01), Yu et al.
patent: 7031948 (2006-04-01), Lee
patent: 7085280 (2006-08-01), Martin, IV
patent: 2008/0154926 (2008-06-01), Newman

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Language binding system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Language binding system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Language binding system will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4142693

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.