I'm looking for some method in Turbo Pascal 7.0 or other similar tool like WiseCalculator to accomplish what i tried to show in this picture:
http://i53.tinypic.com/eur22s.jpg
However picture shows just very simple and basic version of idea and it only shows order of operations with first object A. Real challenge is if the boxes(named One, Two and Three) are more than 3 for example 10 and containing letters|numbers|symbols in one box also are 10 and then some code or program or function|formula should calculate every possible combination from those given letters|numbers|symbols in boxes and display as viewable list. Also contents and amount of boxes&contents are given either writing them in code file or program itself when it runs and asks for data in dialogue before it executes. I was thinking maybe do something with arrays but any other ideas would be nice.

Yes, take an array for each box and also an index for each array.
Then cascade the access of each array with its index in a for to do loop to generate all combinations or search.
If you have a max_entry variable for each arry you can represent a number for each compination and sign to a special compination:

curent_combination := curent_combination * max_entry_1 + index_1; {for each/all index(es) and its/their weight)
curent_combination := curent_combination * max_entry_2 + index_2;
...