SIMSCRIPT II.5 Programming Language

Advanced Topics
one for each level of the genealogical tree. Assume that the number of levels in the tree and the
names (coded as integer numbers) of the family members arranged in proper order on data records
are given. A tree with the family data suitably arranged is first constructed using the following program:
preamble
normally mode is integer
define LEVEL and TREE as 1-dimensional arrays
end
read N
'' Number of levels
reserve LEVEL(*) as N
for I = 1 to N,
do
reserve TREE(*) as 2**(I-1)
read TREE
let LEVEL(I) = TREE(*)
let TREE(*) = 0
loop
stop
end
For N = 4, the memory structure at the end of program execution looks as shown in figure 6-9. To
print out a person's Kth-level ancestors, write:
read K
let TREE(*) = LEVEL(K)
for I = 1 to 2**(K-1)
print 1 line with TREE(I) as follows
Ancestor is **
To pick out specific ancestors, the tree can be searched until a matching code is found:
read CODE
for I = 1 to N,
do
let TREE(*) = LEVEL(I)
for J = 1 to 2**(I-1)
do
if TREE(J) equals CODE
print 1 line with CODE, J and I as follows
Ancestor ** found in position * of level *
stop
otherwise
loop
loop
print 1 line with CODE as follows
UNABLE TO FIND AN ANCESTOR WITH THE CODE **
stop
end
255