JPH0247720A - Tree structure information comparing device - Google Patents

Abstract

PURPOSE:To automatize the comparing work and to improve the efficiency of software development and maintenance work by successively comparing nodes to be compared in inputted tree structure information by a node comparing means. CONSTITUTION:Module constitution relation information 11 and 12 are inputted to an input device 20 to set the contents of module constitution relation memory devices 31 and 32. Modules having respective values are taken as the comparison object modules. Modules (main and main) are first compared with each other. When they coincide with each other, modules (main and main) are held because both of them have slave modules, and respective slave modules (init and init) are next compared with each other. When they coincide with each other, modules (init and init) are held in the same manner and respective slave modules (open and open) are next compared with each other. When they coincide with each other, brother modules of modules (init and init) are next compared with each other because they have not slave modules neither brother modules.

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial Application Field] The present invention is used for creating computer software.

The present invention relates to a tree structure information comparison device that compares tree structure information, determines differences therebetween, and creates and outputs computer software.

〔overview〕

The present invention provides a tree structure information comparison device that compares tree structure information of software created using tree structure information and outputs difference information, in which tree structure information to be compared is input and stored in a storage device. and sequentially compare nodes to be compared in the tree structure information to determine whether they match,
By outputting the difference information determined to be inconsistent, differences in design information can be automatically determined, improving the efficiency of software development and maintenance work, and improving the quality of the software. It is something.

[Conventional technology]

As software systems become larger and the relationships between the modules that make up the system and the processing procedures of the modules themselves become more complex, it is becoming easier to understand software design information, such as expressing the structural relationships of modules and the processing procedures of each module. A method was needed. To deal with this, a method of expressing using a tree structure is now commonly used.

In the development and maintenance work of design information software, a situation often arises in which a worker wants to know the difference in design information that has been modified as a result of software improvement. Conventionally, there was no mechanical means to compare tree structure information and identify differences, and the only way to determine differences in software design information expressed using a tree structure was to manually compare printouts of the design information. It was done by

[Problems to be solved by the invention] As mentioned above, in the past, comparison of software design information using a tree structure was done manually, which required a large amount of man-hours to identify changes and other differences in design information. This has the disadvantage of hindering the efficiency of software development and maintenance work and degrading the quality of the software.

An object of the present invention is to eliminate the above-mentioned drawbacks, thereby making it possible to mechanically determine differences in design information, thereby improving the efficiency of software development and maintenance work, and improving the quality of software. The object of the present invention is to provide a tree structure information comparison device that can perform the following tasks.

[Means for solving problems]

The present invention provides a tree structure information comparison device comprising comparison means for comparing the tree structure information of software created using tree structure information and outputting difference information, wherein the comparison means an input means for inputting structural information;
two tree structure information storage means each storing the inputted tree structure information; a comparison shortening node instruction means for sequentially indicating the nodes to be compared in the tree structure information; The present invention is characterized in that it includes a node comparison means for determining whether or not the nodes match, and an output means for outputting difference information determined by the node comparison means as not matching.

[Effect]

The input means inputs tree structure information to be compared and stores each tree structure information in the tree structure information storage means. The node comparison means sequentially fetches nodes to be compared in the tree structure information designated by the comparison target node designation means from the tree structure information storage means, compares them, and determines whether or not they match; The difference information determined to be non-matching is outputted via the output means.

Therefore, the comparison of tree structure information is automatically performed without manual intervention, making it possible to improve the efficiency of software development and maintenance work and to improve the quality of the software.

〔Example〕

Embodiments of the present invention will be described below with reference to the drawings.

FIG. 1 is a block diagram showing one embodiment of the present invention. The present embodiment is a tree structure information comparison device 1 that includes a comparison means for comparing the tree structure information of software created using the tree structure information and outputting differences. An input device 20 as an input means for inputting module structure relationship information 11 and 12 as tree structure information, and module structure relationship storage as two tree structure information storage means for storing the input module relationship information 11 and 12, respectively. devices 31 and 32, a comparison target module designation device 40 as comparison target node designation means for sequentially designating nodes to be compared in the module relationship information 11 and 12, and a node designated by the comparison target module designation device 40. The module comparison device 50 includes a module comparison device 50 as a node comparison device for determining whether or not there is a match, and an output device 60 as an output device for outputting the difference information 70 determined by the module comparison device 50.

Here, the module configuration relationship information 11 and 12 is a tree-structured representation of the relationship between the modules that make up the system. Module configuration relationship storage devices 31 and 3
2 is the module number for each module, the name of the module, the modules that make up the own module (child modules), the modules that have the own module as a component (parent module), and the modules other than the own module that make up the parent module (older brother module). Module configuration relationship information 11 and 12 are stored, respectively. The input device 20 sets the contents of the module configuration relationship storage devices 31 and 32 according to the input module configuration relationship information 11 and 12. The module comparison device 50 compares the names of the modules specified by the module numbers from the comparison target module designation device 40, and notifies the comparison target module designation device 40 of a match or mismatch signal. The comparison target module instruction device 40 is
According to the match or mismatch signal notified from the module comparing device 50, the next module to be compared is determined and instructed to the module comparing device 50, and the determined difference information 70 is notified to the output device 60. The output device 60 outputs the difference information 70 notified from the comparison target module instruction device 40.

FIGS. 2(a) and 2(b) are explanatory diagrams showing examples of module configuration relationship information 11 and 12 of two systems. A line extending downward from the module means that the module is composed of modules connected by lines. That is, for example, in FIG. 2(a),
main is 1nit, 5eLvars, body,
Consists of term modules, 1 nit, b
ody, term are open, read, respectively.
This means that each module is composed of one module. This module configuration relationship is used in this embodiment as an example of tree structure information.

FIGS. 3(a) and 3(a) are explanatory diagrams showing storage examples of the module configuration relationship storage devices 31 and 32, respectively. One module is stored per line, and the module number field shows the serial number of the module, the child module field shows the number of the first module that makes up the module, and the parent module field shows the number of the module of which this module is a component. The sibling module column stores the number of the module other than the own module that constitutes the parent module, and the module name column stores the name of the own module.

Here, FIGS. 3(a) and 3(b) show how the module configuration relationship information 11 and 12 of FIGS. 2(a) and 3) are stored, respectively, and . represents that there is no corresponding module. .

FIG. 4 is a block diagram showing details of the comparison target module instruction device 40. As shown in FIG. The comparison target module instruction device 40 has module registers 41 and 42 and reserved module stacks 43 and 44 corresponding to the module configuration relationship storage devices 31 and 32. The module registers 41 and 42 store the number of the module currently being compared, and the module stacks 43 and 44 store the number of the module whose comparison has been suspended in order to compare child modules first. do. When a match signal is notified from the module comparison device 50, the contents of the module registers 41 and 42 are transferred to the module stacks 43 and 44, respectively, and the child modules are compared first, and when a mismatch signal is notified, the mismatch is detected. Search for a match among the older modules after the module that caused it. After checking the older module, the contents finally transferred to module stacks 43 and 44 are returned to module registers 41 and 42, respectively, and the pending comparison is continued.

A module that does not exist on the other side and a module whose name does not match that is determined during the comparison is notified to the output device 60 as difference information 70. Details of this operation will be explained later using FIG. 6.

FIG. 5 is a block diagram showing details of the module comparison device 50. The module comparison device 50 includes a module name comparator 51. Then, the name of the module specified by the module number from the comparison target module designation device 40 is compared, and if they match, a match signal is sent, and if they do not match, a mismatch signal is sent to the comparison target module designation device 40.
Return to.

The features of the present invention are as shown in FIG. 1, an input device 20 for inputting module configuration relationship information 11 and 12, module configuration relationship storage devices 31 and 32, a comparison target module instruction device 40, a module comparison device 50, This is because an output device 60 for outputting the difference information 70 is provided.

Next, the operation of this embodiment will be explained in detail with reference to the flow chart of FIG. That is, FIGS. 2(a) and (b)
) The operation from when the module configuration relationship information 11 and 12 shown in FIG.

The input device 20 inputs module configuration related information 11 and 12.
and based on the given module configuration relationships,
The contents of module configuration relationship storage devices 31 and 32 are set (step 31). The contents of the module configuration relationship storage devices 31 and 32 shown in FIGS. 3A and 3A are set from the module configuration relationship information 11 and 12 shown in FIGS. 2A and 2B, respectively.

Then, each root module is set as a comparison target module (step 32).

The comparison target module indicating device 40 and the module comparing device 50 execute the comparison in the following order, as shown in steps 83 to 318. At the beginning of operation module registers 41 and 42 are (ma in, m
a in) and there are no reserved modules.

The first comparison is made with (main, main) and there is a match. Because both have child modules (main, ma
in) and the following comparisons to each child module (
init, 1nit) and match. Similarly (in
it, 1nit) and perform the next comparison on each child module (open, open) to find a match.

Since neither (open, open) has a child module and does not have the next older module, it is the next older module of (init, 1nit), which is the last to hold off the next comparison. -c
trl-rec). In this case, there is no match, so the next older module (body, body)
Let be the new comparison target module. Each matches the other module that first caused the mismatch (se
Lvars, geLctrl-rec) to the current comparison target module (body, body), and select the matching module (body,
, body).

A subtree whose root is the module from the module that caused the first mismatch to the module immediately before the match, that is, 5et-va
Output rs, get-ctrl rec, and read as mutually modified subtrees. The matched module (body, body) is set as a new comparison target module. Because both have child modules (body
, body) and perform the next comparison in each child module (read, read) to find a match. (r
ead, react) have no child modules, and one read is the next older module ret.
ry, all the older modules after retry, that is, the subtree retry whose root is retry,
Close and open are assumed to have been added, and at the same time, the other subtree is output as if the subtree has been deleted.

The next comparison is made with the next older module (term, term) of the last suspended module (body, body) and they match. Because both have child modules (te
rm, term) and perform the next comparison in each child module (close, close) to find a match. (close, close) both have no child module and no next older module, so we postponed the next comparison until the end (term, term
), but there is no older module for both, and I put it on hold before that (ma i
Since there is no next older module in n, main), there are no longer any pending modules, and the comparison operation ends.

As a result, the module configuration related information 11 in FIG. 2(a)
In, set, vars is changed subtree, r
etry.

A subtree in which "close" and "open" have been deleted, and a subtree in which "get-ctrL rec" and "read" have been changed in the module configuration relationship information 12 of FIG.

It is output as a subtree with open added.

〔Effect of the invention〕

As explained above, the present invention compares tree structure information,
Since the differences are determined and output, it is possible to compare the design information of the tree-structured software, such as the configuration relationship of modules and the processing procedure of each module, which was conventionally determined by visual inspection. This has the effect of improving the efficiency and reliability of the work of determining differences in design information, such as understanding changed locations, and improving the quality of software.

70...Difference information, 1-S19...step.

Claims (1)

[Scope of Claims] 1. A tree structure information comparison device (1) comprising a comparison means for comparing the tree structure information of software created using the tree structure information and outputting difference information, the comparison means includes: an input means (20) for inputting the tree structure information (11, 12) to be compared; two tree structure information storage means (31, 32) for respectively storing the input tree structure information; Comparison target node designation means (40) for sequentially designating nodes to be compared in the tree structure information; and node comparison means (50) for determining whether or not the nodes designated by the comparison target node designation means match. , and output means (60) for outputting difference information (70) determined as not matching by the node comparison means.