JPH04218833A - Program correction quantity deciding processor - Google Patents

Abstract

PURPOSE:To obtain a program correction quantity deciding processor by deciding the proper quantity of correction by a source program before correction and that after correction of a computer. CONSTITUTION:A table generating part constitutes a first table 4 and a second table 5 so that first arrangement order numbers and second identification numbers indicated by second arrangement order numbers are arranged in the first table 4 and second arrangement order numbers and first identification numbers indicated by first arrangement order numbers are arranged in the second table in accordance with the arrangement order with respect to same instruction statements between first and second source programs 1 and 2 and they correspond to each other respectively. A deciding processing part 6 takes out one item from each table and obtains the differences between two taken-out items with respect to first arrangement order number and first identification number and second arrangement order number and second identification number and concludes whether the instruction statement is not changed or is deleted or is added by prescribed deciding processing based on signs and magnitudes of differences and prescribed relations between both differences, and the item of one table for conclusion is advanced to successively perform the deciding processing.

Description

[Detailed description of the invention]

0001

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a program modification amount determination processing device for determining the modification amount of a source program in a computer by comparing both a source program before and after modification.

0002

[Background Art] When changing a computer program,
It is often necessary to accurately grasp the amount of correction.

In this case, by comparing the source program written in a certain programming language before and after the modification, it is possible to determine, for example, what was added to the new program, deleted from the old program, and what was added between the old and new programs. The number of steps for each unchanged command statement is determined as the amount of modification, and if necessary, the command statements of both programs are correlated to create a list showing additions, deletions, and no changes.

[0004] To do this, the two programs are compared by using either the source program before or after the modification as a reference, comparing both command statements in order of arrangement, and if they match, it is assumed that there is no change, and the following is done in both programs. Proceed to the imperative sentence.

[0005] In the case of a mismatch, if the pre-amendment is used as the standard, the pre-amendment statement is assumed to have been deleted, and
Only the pre-modification program advances to the next statement; if the post-modification is used as a reference, it is assumed that the post-modification statement has been added, and only the post-modification program advances to the next statement.

[0006] As the comparison progresses in this manner, if only one program ends first, it is determined that all remaining command statements of the remaining program have been deleted or added. FIG. 6 is a diagram illustrating, by way of example, the result of determining the amount of modification based on the above logic. FIG. 6(a) is an example based on the original program before modification, and FIG. 6(b) is an example. This is an example in which the same source program is taken as an example, and a modified source program is used as a reference.

In both FIGS. 6(a) and 6(b), examples of source programs before and after modification are shown on the left, as well as the correspondence of command statements and comparison steps to be compared between the two source programs.
etc., and the judgment results are shown on the right side.

[0008]

[Problem to be Solved by the Invention] According to the process for determining the amount of modification as described above, as is clear from comparing (a) and (b) in FIG. The results differ depending on whether (a), (
b) In some cases, it may not be possible to correctly determine whether or not there has been a change.

SUMMARY OF THE INVENTION An object of the present invention is to provide a program modification amount determination processing device that can automatically determine the modification amount by comparing the original program before and after modification, and obtain a reasonable modification amount determination result.

0010

Means for Solving the Problems FIG. 1 is a block diagram showing the configuration of the present invention. The figure shows the configuration of a program correction amount determination processing device, in which the first source program 1 of the computer
This device determines the amount of modification of a second source program 2 generated by modifying the second source program 2, and includes a table creation section 3 and a determination processing section 6.

[0011] The table creation unit 3 assigns numbers representing the arrangement order in each source program to each instruction statement of the first and second source programs as a first arrangement number and a second arrangement number. Then, the same instruction statements between the first and second source programs are associated in the order of arrangement for each instruction statement in each source program, and the first table 4 and the second table
Create table 5.

[0012] The first table 4 contains the first sequence number and the second sequence number.
The second table 5 has a column in which the second identification number represented by the array sequence number and the first identification number represented by the first sequence number are arranged, respectively. Configure as shown.

[0013] The determination processing unit 6 processes the first table 4 and the second table 4.
A determination process is performed by extracting one item from Table 5 in the order of the first and second arrangement numbers, and if there is no second identification number corresponding to the item in the first table, the first identification number corresponds to the first identification number. It is concluded that the instruction sentence has been deleted, and if there is no first identification number corresponding to the item in the second table, it is concluded that the instruction sentence with the second sequence number has been added.

[0014] Regarding the extracted two terms, find the difference between the first arrangement number and the first identification number, and the second arrangement number and the second identification number, and calculate the sign, magnitude, and identity of the difference. Through a predetermined determination process based on a predetermined relationship between the two differences, the instruction sentences corresponding to the first arrangement number and the second arrangement number are left unchanged, or the instruction sentence with the first arrangement number is deleted. One determination process is performed by determining whether the instruction statement with the second array order number has been added.

[0015] When the conclusion is made, it is output as judgment result 7, and only the term corresponding to the next array order of the term that is the subject of the conclusion is extracted from the first and second tables. The determination process is repeated.

[0016]

[Operation] With the processing device of the present invention, the table creation unit 3 creates a first table that shows the modification status based on the arrangement order of the program before modification and the arrangement of the program after modification based on the correspondence with the command statement after modification. A second table indicating the change status is created based on the order, and the determination processing unit 6 sequentially extracts one item from both tables, and if there is no correspondence, concludes that it should be deleted or added.

If there is a correspondence between the items in both tables, take the difference between the arrangement number of one table and the identification number of the other table, and calculate a predetermined value that takes into account the value and sign of the difference and the relationship between the two. Using the determination logic, for example, if the difference is 0, it is concluded that there is no change, and if the difference is not 0, a predetermined identification logic is used to conclude that there is a deletion or addition in the one with the larger amount of movement.

[0018] In this way, instead of comparing only one source program as a standard, the correspondence of instruction statements shifted by addition or deletion is performed, so it is possible to determine an appropriate amount of modification in accordance with the actual modification situation. It can be performed.

[0019]

[Embodiment] FIG. 2 is a diagram for explaining the first table and the second table created by the table creation section 3 by way of example. FIG. 2(a) is the same example of the source program as FIG. and the second sequence number are added respectively.

FIG. 2(b) is an example of the first table 4 and second table 5 created by the table creation process 3 of FIG. 1 using the program of FIG. 2(a) as input. When creating the first table 4, the table creation unit 3 uses the source program before modification (first source program) as a reference.
In the order of the first array sequence number, first search the modified source program (second source program) for an instruction statement that matches the instruction statement with the first array sequence number "1", in the order of the second array sequence number,
Since the second arrangement order number "1" matches, the second identification number of the first item of the first table is set to "1", and this statement is determined to have been handled.

Next, the remaining modified source program is searched for an instruction statement that matches the instruction statement with the first arrangement number "2" in the order of the second arrangement number, and if the second arrangement number "3" is Since they match, set the second identification number in the second column of the first table to "3".
The first table is created by performing this correspondence processing until the end of the original program before modification. In addition, in this example, the first array number "4" in the first table
There is no response.

Next, in creating the second table, the second table is created by using the modified source program as a reference and associating each statement with the source program before modification in the same manner as described above. create.

FIGS. 3 and 4 are diagrams showing an example of the processing flow of the determination processing section 6 in FIG. 1. In the figure, the part that branches into two paths with △ is a part that performs both processes, and there is no problem in executing either one first or in parallel.

When the determination processing unit 6 starts processing, it extracts one entry from the first table from the first entry in processing step 9a of FIG. 3, and extracts the second identification number corresponding to the first arrangement number in processing step 10a. It is determined whether the statement has been recorded, and if there is no correspondence, it is concluded that the statement indicated by the first sequence number has been "deleted" from the source program before modification.

Also from the second table, processing step 9b
In step 10b, it is determined whether the first identification number corresponding to the second arrangement number is recorded, and if there is no correspondence, the statement indicated by the second arrangement number is the modified source program. conclude that it was "added" to.

Processing step 10a and processing step 10
If there is a correspondence in b, both terms taken out from both tables are determined together in processing step 11 and subsequent steps, and in processing step 11, the difference x between the second identification number and the second sequence number, i.e. x=(second identification number)−(second sequence number) and the difference y between the first identification number and the first sequence number are calculated.

In processing step 12, it is determined whether x=0, and if it is 0, the instruction statement of the source program before modification is changed as is.
It is concluded that the program has been moved to the modified source program with no changes. Note that if x=0, then y=0 as a matter of course.

If x and y are not 0, it is determined whether x>0 in processing step 13, and if x>0, it is determined whether y>0 in processing step 14, and if y<0, "add" is performed. Judge, y
If >0, further compare the sizes of x and y in processing step 15, and if x<y, "add", if x>y, "delete",
If x=y, it is "undetermined".

If x<0, it is determined in processing step 16 whether y>0, and if y>0, it is determined to be "deletion";
If <0, it is "undetermined". Due to the above, “Undetermined”
In this case, the process based on the value of that term is suspended and the determination is made by referring to the subsequent terms of the first table and the second table according to the process flow of FIG.
8a, read the next item of the first table, and process step 19.
If the first table is finished, the process goes through step 26, and it is determined to be "added".

When the next term can be retrieved, it is determined whether there is a correspondence in processing step 20a. If there is no correspondence, the process returns to processing step 18a and the next term is retrieved. If there is a correspondence, the second table is extracted in processing step 21. It is processed together with the terms extracted from.

Processing step 18 is also performed for the second table.
b, 19b, and 20b in the same way, but identify it in process step 19b, and if the second table is finished, identify it in process step 26, and if only the second table is finished, select "delete". It is determined that

If both tables are not completed and there is a correspondence between the retrieved terms, in processing step 21 x and y defined in the same manner as in processing step 11 are calculated, and then processing in processing steps 22 to 25 is performed. In the processing step 13~
Judgment of "addition" or "deletion" is issued in the same way as in step 16, but in the case of the condition of "unjudgment" above, processing step 1 is issued.
The process returns to steps 8a and 18b.

In this way, when the processing in FIG. 3 results in "undetermined" and the processing in FIG. The conclusion is for the section whose judgment has been deferred as “undetermined”.

[0034] Through the above, "addition", "deletion" or "
If the conclusion is ``no change'', then in the case of ``add'', the processing of the term taken out from the second table is finished, in the case of ``deletion'', the processing of the term taken out from the first table is finished, and the conclusion is ``no change''. '', the processing of both terms retrieved from both tables is terminated.

When the term to be terminated is created in this way, processing returns to processing steps 9a and 9b so as to extract the next term only from the table of the term to be terminated.If only one term has been completed, the term to be extracted from the table is When the processing has progressed to processing step 11, processing for combining with the other remaining term begins.

[0036] Furthermore, if the processing proceeds in this way and one table is finished, but the first table remains, all the statements corresponding to the first sequence number of the remaining unprocessed terms are If you select "Delete" and the second table remains,
It is concluded that all command sentences corresponding to the second sequence number of the remaining unprocessed terms are "addition".

FIG. 5 is a diagram illustrating a case where the above processing is performed using the first and second tables of the example source program shown in FIG. 2. First, regarding the first term of both tables, a conclusion of "no change" is obtained through processing up to processing step 12.

[0038] Then, if we proceed to the next section for both tables, we get
Due to x and y as shown in FIG. 5A, x<y is established in processing step 15, and it is concluded that the instruction statement with the second array order number "2" is added.

Therefore, when only the second table is advanced, the relationship shown in FIG. 5(b) is reached, and when both tables are advanced with a conclusion of "no change", the result is "no change" again as shown in (c). Therefore, when advancing the terms in both tables, the term in the first table is the term with the first array order number "4" and there is no correspondence, so it is concluded to "delete" and only the terms in the first table are advanced.

As a result, "no change" is shown in FIG. 5(d).
Since this is the end of the second table, the last item remaining in the first table is "delete". The above results,
When drawn in correspondence with the processing results shown in Figure 6, Figure 6(c)
It can be seen that, compared with (a) and (b), a reasonable correction amount determination is made.

[0041]

[Effects of the Invention] As is clear from the above explanation, according to the present invention, regarding the determination of the amount of modification of a computer source program,
This has a significant industrial effect in that it is possible to determine an appropriate amount of correction in accordance with actual correction work.

[Brief explanation of the drawing]

[Figure 1] Block diagram showing the configuration of the present invention

[Figure 2]
Explanatory diagram of the first and second tables of the present invention

[Figure 3] Flowchart of the process of the present invention (Part 1)

[Figure 4] Process flow diagram of the present invention (Part 2)

[Fig. 5] Diagram illustrating a processing example of the present invention

[Figure 6] Diagram comparing the judgment results of various processes

[Explanation of symbols]

1 First primitive program 2 Second primitive program 3 Table creation part 4 1st table 5 Second table 6 Judgment processing unit 7 Judgment results

Claims (1)

[Claims] [Claim 1] First primitive program for a computer (1)
A device for determining the amount of modification of a second source program (2) generated by modifying the second source program, comprising a table creation section (3) and a determination processing section (6), The table creation unit (3) includes first and second source programs (
1 and 2), numbers representing the arrangement order on each source program are assigned as the first arrangement number and the second arrangement number, respectively, to ensure that the first and second source programs are identical. A first table (4) and a second table (5) are created by associating the instruction statements in each source program in order of arrangement, and the first table (4) is the first table (4).
The second table (5) lists the second sequence number and the first identification number represented by the first sequence number based on the column in which the sequence number and the second identification number represented by the second sequence number are arranged. The arrangement is such that the correspondence is indicated by the arranged terms, and the determination processing unit (6) uses the first table (4) and the second table (5).
), one item at a time is extracted in the order of the first and second array order numbers and a determination process is performed. If it is concluded that the instruction statement with the sequential number has been deleted, and there is no first identification number corresponding to the item in the second table, the second
Conclude that the instruction statement with the sequence number has been added, and calculate the difference between the first sequence number and the first identification number, and the second sequence number and the second identification number for the two extracted terms. , by a predetermined determination process based on the sign and magnitude of the difference, and a predetermined relationship between the two differences, the statement corresponding to the first arrangement number and the second arrangement number is unchanged or A single judgment process is performed by concluding whether the imperative statement with the 1st array order number has been deleted or whether the imperative statement with the 2nd array order number has been added. 2. A program modification amount determination processing device, characterized in that the program correction amount determination processing device is configured to extract only the term corresponding to the next array order of the term that is the subject of the conclusion from the table, and repeat the determination process. .