| 摘要 |
PROBLEM TO BE SOLVED: To efficiently realize the structure analysis of an array. SOLUTION: At first, prev(S) is calculated for a character string S to be processed, and as to all variables in the character string S, when the same variable is present at the upstream side of the variable, the variable is converted into a numerical value indicating an interval with the same variable, and when any same variable is not present at the upstream side of the variable, a character string S1 converted into '0' is obtained, and compl(S) is calculated. As for all the variables in the character string S, when any variable having a complementary relation is present at the upstream side of the variable, the variable is converted into a numerical value indicating an interval with the variable having the complementary relation, and when any variable having the complementary relation is not present at the upstream side of the variable, a character string S2 converted into '0' is calculated (102). Then, the character strings S1 and S2 are defined as a pair of corresponding character strings so that a single suffix (structure suffix tree) can be generated (104-114), and that the structure of an array indicated by the character string S can be analyzed by using the structure suffix tree. |
