| 摘要 |
PURPOSE:To know the route of input data by showing the processing procedure in a tree where a condition deciding part is defined as a node and setting the decision of conditions opposite to the binary value to add said decision of conditions to each data as an attribute member. CONSTITUTION:An attribute member Attr is obtained by setting Yes/No of the conditional branch opposite to 1/0 respectively. Then the member Attr is added to the input data to show a piece of data, and each of total four condi tional nodes P, Q, R and R', for example, is set opposite to each bit of the member Attr. Then the 1/0 is set at the bit position corresponding to the mem ber Attr when the input data passes through each conditional node. |
