JP5020184B2 - Program analysis method and program creation method - Google Patents

Description

  The present invention relates to a program analysis method and a program creation method for analyzing a plurality of source programs that are not structured and specifying a reusable unit of the program.

In an organization that develops and maintains a large-scale software system, it is difficult to manage a large number of similar program assets created during long-term system maintenance. In particular, to ensure system reliability and safety, it is difficult to restructure a program with a delivery record, and to restructure the program structure to improve productivity. Is the basis.
In addition, the diversion source program was developed during the business establishment period, and structured programming is often not performed.
Patent Document 1 has been proposed as a method of typifying a common part of structured source programs.

Japanese Patent Laying-Open No. 2005-316707 (pages 3 to 8, FIG. 1)

In order to extract the customization range and remodeling range of programs that are not structured programming in designing diversion of large-scale software programs, in addition to checking the source programs of large-scale programs one by one in a human system Since there was no method, there was a problem that analysis took time.
In addition, when a malfunction occurs in a program, it is easy for human errors to enter because it is necessary to check the source program with a human system in order to select the target to be repaired among the programs that have been delivered. There was a problem.
Patent Document 1 categorizes a common part of a source program that is structured and is not about a source program that is not structured and programmed.

  The present invention has been made to solve the above-described problems, and even a program that is not structured can be divided into reusable component units, and these can be combined to reconstruct the program. It is an object of the present invention to obtain a program analysis method and a program creation method.

In the program analysis method according to the present invention, the unit extraction unit extracts a program sentence that is a component of a program for each source program from a plurality of source programs, and saves it in a tabular file , common elements The extraction unit extracts a program sentence that is only one program sentence in each source program and exists in all of the plurality of source programs as a common element, and stores it in the common element list data . In the second step, the semi-common element extraction unit extracts program sentences existing in a plurality of source programs as quasi-common elements within the same range delimited by the common elements of each source program, and stores them in the quasi-common element list data . third step, and the non-common element extraction unit, it either common elements and quasi common elements The stored program statements in a table format extracted as non-common elements, including a fourth step of storing the non-common component list data, the second, each element extracted by the third and fourth steps of The extracted original source program and the classification code indicating the position in the source program are given.

In the present invention, as described above, the unit extraction unit extracts a program sentence that is a component of a program for each source program from a plurality of source programs, and saves it in a tabular file , common elements The extraction unit extracts a program sentence that is only one program sentence in each source program and exists in all of the plurality of source programs as a common element, and stores it in the common element list data . In the second step, the semi-common element extraction unit extracts program sentences existing in a plurality of source programs as quasi-common elements within the same range delimited by the common elements of each source program, and stores them in the quasi-common element list data . third step, and the non-common element extracting section, stored in tabular form neither common elements and quasi common elements Extract the program statement as a non-common elements, including a fourth step of storing the non-common component list data, the second, each element extracted by the third and fourth steps of the extracted Since the original source program and the classification code indicating the position in the source program are assigned, even a program that is not structured programming can be divided into reusable component units.

Embodiment 1 FIG.
FIG. 1 is a conceptual diagram showing a program analysis method according to Embodiment 1 of the present invention.
In FIG. 1, the program analysis method has five extraction units and three list data.
The three list data correspond to each of the following three classifications of program sentences.
Common element: A unique program statement in one source program, which exists in all source programs. Those whose order has been changed by the program is not a common element.
Quasi-common element: A sentence that exists in multiple source programs and is not a common element. However, it must be within the same range delimited by common elements. When a plurality of continuous program statements correspond to quasi-common elements, they are collectively set as one quasi-common element. In addition, although the context with other quasi-common elements is also considered, this will be described later.
Non-common element: An element that is neither a common element nor a quasi-common element.
The word / symbol / number unit extraction unit 2 receives the source program 1 and extracts a fragment of the program divided in word / symbol / number units so that one program sentence corresponds to one line. Save in tabular format. (See step S01 in FIG. 2). The common element extraction unit 3 extracts, as a common element, a unique program sentence in one program, which is present in all source programs, and stores it in the common element list data 7 in the order in which it is found. . (See step S02 and step S03 in FIG. 2).

The inter-common element program sentence extraction unit 4 extracts program sentences existing between consecutive common elements in one source program. The quasi-common element extraction unit 5 repeatedly compares the program sentences existing between the same common elements extracted by the inter-common element program sentence extraction unit 4 for a plurality of source programs, and found the quasi-common The common element is registered in the semi-common element list data 8. (See step S04 in FIG. 2).
The non-common element extraction unit 6 deletes each element registered in the common element list data 7 and the quasi-common element list data 8 from the tabular data delimited by word / symbol / number units, and the remaining program Sentences are registered in the non-common element list data 9 in the order in which they are found. (See step S05 in FIG. 2).
Common elements, semi-common elements, and non-common elements may be collectively referred to as program elements.

  FIG. 2 is a flowchart showing processing of the program analysis method according to Embodiment 1 of the present invention.

FIG. 3 is a flowchart for explaining processing for creating a program sentence that is tabular data in the program analysis method according to the first embodiment of the present invention.
FIG. 3A is a flowchart, and FIG. 3B is a diagram showing the processing content of step S12.

  FIG. 4 is a flowchart for explaining processing for extracting a unique program sentence in a program in the program analysis method according to the first embodiment of the present invention.

  FIG. 5 is a flowchart for explaining processing for extracting common elements in the program analysis method according to the first embodiment of the present invention.

FIG. 6 is a flowchart for explaining the process of extracting the quasi-common element in the program analysis method according to the first embodiment of the present invention.
FIG. 7 is a diagram illustrating an example for explaining a range delimited by common elements in the process of extracting quasi-common elements in the program analysis method according to the first embodiment of the present invention.
FIG. 8 is a diagram showing an example for explaining the process of extracting the quasi-common element in the program analysis method according to the first embodiment of the present invention.
FIG. 9 is a flowchart illustrating processing for extracting non-common elements in the program analysis method according to the first embodiment of the present invention.

Next, the operation will be described.
The control operation by the program for realizing the program analysis method is as shown in the flowchart of FIG.
In FIG. 2, step S01 (first step) is extracted from the source program 1 in a table format divided in units of words / symbols / numbers. Next, in step S02, only one program sentence is extracted in one program, and then in step S03, the program sentence extracted in step S02 is common to all program sentences. If it is a sentence, it is stored in the common element list data 7 as a common element in the order of discovery. (Steps S02 and S03 constitute a second step.)
Next, in step S04 (third step), the range delimited by the common elements existing in the source program is processed in order from the front, and the program statements existing in the range are extracted from each source program. Then, compare the program statements that existed between the same common elements of different source programs, cut out the program statements that are common to at least two programs so that the number of common programs is as large as possible, and Register in the quasi-common element list data 8. In addition, the relative row / column of the first matching row and common element is recorded.

Finally, in step S05 (fourth step), each element registered in the common element list data 7 and the quasi-common element list data 8 is converted into a word / symbol / Deleted in units of numbers, cut out program sentences sandwiched between empty lines, and registers them in the non-common element list data 9 in the order in which they were found. In addition, the relative rows / columns of non-common elements and common elements in the program are recorded.
Here, the registration uses the classification codes (1) to (9) of the program sentence, and the file names “(1) (2) (3) (4) (5) (6) (7) (8) (9) "" means saving as a TXT file. The classification codes (1) to (9) will be described later.

By using the above-described method, common program sentences can be mechanically extracted and classified even in unstructured program sentences.
The program sentences stored in the common element list data 7, the semi-common element list data 8, and the non-common element list data 9 are stored with a classification code.

Here, the classification code means the following information.
(1): Classification symbol (common element) indicating whether it is a common element included in all of a plurality of source programs to be analyzed, a quasi-common element included in two or more source programs, or only one non-common element found : 1, Semi-common element: 2, Non-common element: 3)
(2): Order found as a common element, quasi-common element, and non-common element (3): If the element is included in a plurality of programs to be analyzed, the number of programs containing the element (4): The number of the closest common element among the common elements before the program statement. In the case of common elements, your number is entered.
(5): The relative number of rows with the common element recorded in (4). 0 for common elements.
(6): Number of program sentence components. Number of columns in tabular format.
(7): Date the program was created (8): Analysis source program number (9): Number of elements in the analysis source program

Next, examples of classification codes will be described.
“The quasi-common element found third when the analysis program is analyzing the inside of the source program, the quasi-common elements included in two of the five source programs are in three columns, The closest common element that exists in the 10th line in the source program B is the second common element in the 3rd line, and the relative number of lines from this common element is 7. Source program B (number 2) Was created on 2007/08/03. "
In this case, the sentence in the above “” is divided and explained every time the classification code is determined as follows.

When the analysis program is analyzing the source program,
Found third ... (2) is 3
Quasi-common element ... (1) is 2
Included in 2 source programs among 5 source programs ... (3) is 2
The quasi-common elements are 3 rows, ... (6) is 3
It exists in the 10th line in the source program B .... (9) is 10
The closest common element is the second common element in the third column, and (4) is 2
The relative number of rows from this common element is seven. ... (5) is 7
Source program B (number 2) is ... (8) is 2.
It is created on 2007/08/03. ... (7) is 2007/08/03
In summary,
(1) 2 (2) 3 (3) 2 (4) 2 (5) 7 (6) 3
(7) 20070803 (8) 2 (9) 10
It becomes.

Next, with reference to FIG. 3, step S01 of FIG. 2 will be described in detail.
In FIG. 3A, first, in step S11, program numbers (1 to N) are assigned to a plurality of source programs to be compared. Thereby, the classification codes (7) and (8) are acquired. Next, in step S12, the source program of the next program number is separated by blanks, commas, and parentheses, and read into a tabular format in units of words / symbols / numbers. As a result, the data is read as shown in FIG.
Next, in step S13, a line feed between program lines and a space between components in the program sentence are deleted. In step S14, a matrix of elements is acquired. Thereby, classification codes (9) and (6) are acquired. Next, in step S15, the undetermined classification code is #, and the source program sentence is “###### (6) (7) (8) (with the classification codes (1) to (9) as file names). 9) Save the file as “”.

Next, the process of step S02 of FIG. 2 will be described in detail with reference to FIG.
First, in step S21, a tabular file of program number N is read. In step S22, the word / symbol / number (program sentence) included in the next line is read. Next, in step S23, all the rows of the table-format file of program number N are processed in order, and it is determined whether there are one or more rows that are the same as the rows read in S22. In step S24, the read word / symbol / number is registered as a reference keyword. If YES, the process returns to step S22. Following step S24, in step S25, it is determined whether or not it is the last line of program number N. If YES, the process ends. If NO, the process returns to step S22.

Next, the processing in step S03 in FIG. 2 will be described in detail with reference to FIG.
First, in step S31, the next reference keyword is read. In step S32, it is determined whether or not the reference keyword is included in a position after the most recently found common element in all the source programs (by this, the classification code (3) = N, (5) = 0. If NO, the process returns to step S31. If YES, the reference keyword is numbered as a common element line by line in step S33. Thereby, the classification codes (1) (2) and (4) = (2) are acquired.
Next, in step S34, it is determined whether or not it is the last reference keyword. If NO, the process returns to step S31. If YES, the classification code of (1) to (9) is used as the file name in step S35. The program sentence is renamed and saved as “(1) (2) (3) (4) (5) (6) (7) (8) (9)”.

Next, with reference to FIGS. 6 to 8, the process of step S04 for extracting the quasi-common element will be described by using an example.
First, in step S41 in the flowchart shown in FIG. 6, the beginning of the range delimited by the common elements is set as the processing target. Specifically, the range from the beginning of the source program to the first common element is the processing target. FIG. 7 shows an example of the range to be processed.
In step S42, a processing target range is extracted for each source program. In step S43, it is searched whether or not the same program sentence exists for all the combinations of two source programs, and the same program sentence is extracted as a quasi-common element candidate in units of one line. In step S44, when continuous lines are extracted as quasi-common element candidates, it is checked whether they can be combined, and if they are combined, they are combined. In step S45, quasi-common element data is created. In step S46, it is checked whether there is an unprocessed range. If there is an unprocessed range, the next range is set as a processing target in step S47, and the process returns to step S42. If there is no unprocessed range, the process ends.

  The process of step S43 will be described with reference to FIG. 8A is a stage where the check between the programs 1 and 2 is completed, FIG. 8B is a stage where step S43 is completed, and FIG. 8C is a stage where step S44 is completed. It is. The order of processing a set of two source programs is the order shown in the upper part of FIG. Assume that a set of two source programs repeats checking all combinations that have not yet been processed with other source programs for one source program (referred to as a reference program). First, a combination of program 1 and another program is processed, then an unprocessed combination related to program 2 is processed, and finally a combination of program 3 and program 4 is checked.

In the check between two source programs, the program statement of the reference program is determined as the program statement to be processed (referred to as the reference program statement) in order from the front, and the other source program (referred to as the target program) is determined. Program statements (called target program statements) are processed in order from the front, and it is checked whether the target program statement is the same as the reference program statement. If they are the same, the reference program sentence and the target program sentence are extracted as quasi-common element candidates. If the semi-common element candidate can be extracted, the reference program sentence and the target program sentence are moved to the next line of the extracted semi-common element candidate. When extracting a quasi-common element candidate, if the reference program sentence is included in the already extracted quasi-common element candidates, the target program sentence is added to the quasi-common element candidate.
If the target program statement is different from the reference program statement, the next program statement is set as the target program statement, and if there is no program statement that is the same as the reference program statement even if the last program statement is processed in the target program, the reference program statement is Move to the program statement. In this way, when the check with the target program sentence is completed for all the reference program sentences, the check between the two source programs is finished.

  FIG. 8A shows a state after the check with the program 1 as the reference program and the program 2 as the target program is completed. The detected quasi-common element candidates are shown surrounded by a frame. Further, FIG. 8B shows a state after the check for all combinations of two source programs is completed. Initially, the program 3 is added to the quasi-common element candidate “AAA” extracted between the programs 1 and 2. “BBB” and “CCC” are consecutively arranged in the programs 1 and 2 and should be one quasi-common element, but are extracted as other candidates at this stage.

In step S44, the following processing is performed. The candidates for the quasi-common element are determined as processing targets (candidate candidates) in order, and in any source program that has the reference candidate, whether the program sentence at the next position of the program sentence that is the reference candidate is a candidate for the quasi-common element Check if. In the case of a quasi-common element candidate (referred to as a target candidate), it is checked whether the set of source programs having the reference candidate and the set of source programs having the target candidate are the same (the element has no excess or deficiency). If they are the same, the target candidate and the reference candidate are combined into one quasi-common element, and the program sentence of the original target candidate is set as the next reference candidate.
If it is not a quasi-common element candidate or if it is a quasi-semi-common element candidate but the set of source programs having the reference candidate is not the same, the reference candidate is used as a quasi-common element and the next quasi-common element candidate is selected. Make a reference candidate. In this way, all quasi-common element candidates are processed, and as shown in FIG. 8C, “BBB” and “CCC” become one quasi-common element. For example, if “MMM” on the second line of program 4 is a program sentence “BBB”, “BBB” is extracted as a quasi-common element common to program 1, program 2 and program 4, and “CCC” "Is still extracted as a quasi-common element common to program 1 and program 2.

  In step S45, the classification code (1) indicates 2 indicating a quasi-common element, (2) indicates the order of creation as a quasi-common element, and (3) indicates the number of programs having quasi-common candidates. , (4), the number of the common element before the range delimited by the common element is set. In the range before the first common element, the number “0” is set with the head of the source program as the virtual common element. In (5), the number of lines within a range delimited by common elements in each source program is set. Since (6) to (9) are determined in step S11, the file name of the program sentence is corrected and saved so as to be obtained from (1) to (5).

  In FIG. 8C, the second line of program 1 and the fourth line of program 2 are both “GGG”, but are not extracted as quasi-common elements. This is because the quasi-common element “BBB, CCC” is extracted. Since “GGG” is before “BBB, CCC” in program 1 and after in program 2, the context of the quasi-common elements is the same, so either “GGG” or “BBB, CCC” However, it cannot be extracted as a quasi-common element. This situation is called an intersection. In the processing method for extracting a quasi-common element described above, when a quasi-common element candidate is extracted, a search is performed from the next line, so that no intersecting quasi-common element is extracted.

In addition, if quasi-common element candidates, including those that intersect, are extracted and there are things that cannot be made quasi-common elements at the same time due to intersections, select so that the number of quasi-common elements is maximized. It may be. Also, if there are multiple program statements that have program statements and are candidates for quasi-common elements, the source code that has the same number of quasi-common elements is the one that has the same number of quasi-common elements. May be selected.
In the case where an intersection occurs with respect to a common element, in the processing method described above, a previously discovered element is regarded as a common element, and an intersecting element is not extracted as a common element. Either the common element or the quasi-common element or the sum of both may be selected, or the one where the intersection occurs may not be the common element.

Next, the processing in step S05 in FIG. 2 will be described in detail with reference to FIG.
First, in step S61, B = B + 1 is calculated. In step S62, C = C + 1 is calculated.
Next, in step S63, the line number (9) of the non-common element having the classification code “###### (6) (7) (8) (9)” and (8) have the same number classification. Get the relative row (5) with the row number (9) of the C-th common element with code (1) = 1 and have the smallest positive relative row “###### (6) Search for the file name (7) (8) (9) ".
In step S64, it is determined whether the line number (9) of the found file is smaller than the line number (9) of the C + 1th common element. If NO, the process returns to step S62. If YES, In step S65, (1) = 3, (3) = 1, which are non-common elements, and (2) = B from the found order B, and since the related common element is C, (4) = C A classification code “(1) (2) (3) (4) (5) (6) (7) (8) (9)” is attached and saved. Next, in step S66, it is determined whether or not “###### (6) (7) (8) (9)” exists. If NO, the process returns to step S61, and if YES, finish.

  According to the first embodiment, in this way, a common part is identified from a plurality of programs, and the positional relationship of other program sentences is acquired based on the location of the common part on the program, and further classified. With this method, there is an effect that the program statements constituting the program can be classified mechanically even in an unstructured program in which no function name or section name is included in the program.

Embodiment 2. FIG.
In the first embodiment, the method of analyzing the program sentence and classifying the similarity into three elements and storing the data has been described, but in the second embodiment, the classification code is used as shown in FIG. The display order was numbered, and the codes of common elements, semi-common elements, and non-common elements of the classification code were read and displayed separately for each column. As a result, the configuration of one program can be displayed so as to be understood at a glance.

FIG. 10 is a flowchart for determining the display order of the program analysis method according to the second embodiment of the present invention.
FIG. 11 is a diagram showing a screen example of a program element state of a single program in the program analysis method according to the second embodiment of the present invention.
In FIG. 11, the program statements are shown in the order found on the vertical axis for the common element 11, the quasi-common element 12, and the non-common element 13 of the classification code (1) on the horizontal axis.

Next, a flow for determining the display order will be described with reference to FIG.
In step S70, the display order is assigned to the common element (n). Next, in step S71, the display order is assigned to each element from the top in the order of decreasing relative rows among the elements having the common element (n) in the classification code. In step S72, n = n + 1 is calculated. In step S73, it is determined whether n> the maximum number of common elements. If NO, the process returns to step S70, and if YES, the process ends.

The method for displaying the program statements in the order in which they are incorporated in the source program from the classification code is as follows.
Display of common elements and non-common elements from "the classification code of the nearest common element in the divided program statements" and "the number of lines and characters corresponding to the relative distance from the nearest common element" Determine the line.
As shown in FIG. 10, the displayed elements are numbered according to the following rules for each element of the program.
An example of operation is given below.
After numbering the common element No. 1, the quasi-common element and the non-common element between the second common element are numbered. The quasi-common element and the non-common element having the first common element in the classification code are displayed in the lower row in order from the smallest relative row to the first common element.
Next, the second common element is numbered, and the quasi-common element and non-common element belonging to the common element are displayed in the lower row in order from the smallest relative row to the second common element ... In such a cycle, the display order is sequentially determined and displayed as shown in FIG.

  According to the second embodiment, as described above, by using the method of assigning the display order of the elements to be displayed based on the classification code to be displayed, all program sentences are displayed in relative lines to the common elements. There is an effect that can be done.

Embodiment 3 FIG.
In the second embodiment, a method has been described in which the configuration of the source program can be identified at a glance. However, it cannot be confirmed how much each element is included in the plurality of source programs to be analyzed. . Therefore, in the third embodiment, the presence or absence in the source program is displayed in a table format for all elements existing in the plurality of source programs.

FIG. 12 is a diagram showing a screen example of the inclusion status of all programs in the program elements of the program analysis method according to the third embodiment of the present invention.
In FIG. 12, based on the classification code, the horizontal axis represents the program name and creation date, and the vertical axis represents all the elements existing in multiple source programs (the same line is treated as one element). The presence or absence in the program is displayed in a table format.

  According to the third embodiment, bugs and specialized programs can be displayed in a tabular format so that the content of each element in the program can be confirmed at a glance using the classification code. When analyzing, it is easy to extract the location of the program to be investigated.

Embodiment 4 FIG.
In the third embodiment, the state of being used in a plurality of programs can be confirmed at a glance. However, the fourth embodiment uses the display format as in the third embodiment and is described on the vertical axis. A plurality of selected program elements are selected, the selected program elements are read from stored list data, and a program is constructed by combining them in the selected order.

FIG. 13 is a diagram showing an example of a screen for setting the inclusion elements of the program generated by the program analysis method according to the fourth embodiment of the present invention.
In FIG. 13, a check field is provided in the screen example of FIG. 12 so that program elements can be selected.
FIG. 14 is a flowchart showing program reconstruction processing of the program analysis method according to the fourth embodiment of the present invention.

  In the fourth embodiment, a check mark for selecting a program element is put in the check column shown in FIG. 13 to obtain the corresponding data as shown in FIG. 14 and combine the program elements in the selected order. The program is reconstructed by generating the program in tabular format and outputting it in text format.

Next, the flow at this time will be described with reference to FIG.
First, in step S81, the nth data (however, n = 1 at the first time) in the list of classification codes is read. In step S82, data is written in the nth row of the program generation table. In step S83, n = n + 1 is calculated. Next, in step S84, it is determined whether n exceeds the maximum number of classification code lists. If it exceeds, the process ends. If not, the process returns to step S81.

According to the fourth embodiment, when it is found that a quasi-common element or a non-common element contains a bug or an unnecessary program by this method, the user looks at the table shown in the third embodiment. The program can be regenerated by replacing or deleting the problem part.
In addition, the program can be easily reconstructed by editing the list format.

Embodiment 5 FIG.
In Embodiment 5, in the classification code, the elements included in the plurality of source programs to be analyzed are included in two or more programs, but are included in the source program after the date when the elements were created. In the case of an element that is not included, the corresponding source program and a program for detecting the element are included.

FIG. 15 is a flowchart showing processing for extracting problem elements in the program analysis method according to the fifth embodiment of the present invention.
For non-common elements, the date data included in the classification code is acquired, and the date data with the most recent source program creation date is listed.

In the fifth embodiment, as shown in FIG. 15, the date data included in the classification codes of all the quasi-common elements is acquired, and the classification code whose date data is not the creation date of the newest program is listed.
That is, in step S91, the creation dates and times of all source programs used for analysis are acquired from the source programs. Next, in step S92, the latest date / time is selected from the creation dates / times of all source programs. Next, in step S93, among all the quasi-common element classification codes obtained by analysis, the classification codes that do not include the latest date and time are recorded in a list format.

According to the fifth embodiment, there is a difference in the description in the source program having the same function from the date when the program element included in the classification code was produced and the number of programs including the program element. There is an effect that a certain quasi-common element and non-common element can be estimated mechanically.
Although the case where the semi-common element that is not the latest date and the non-common element of the latest date are extracted has been described, the date may not be the latest, and the creation date of any source program may be used. The target to be extracted is either a specified date, a newer than the specified date, a specified period before or after the specified date, such as a quasi-common element or non-common element included in the source program that has a predetermined time relationship Alternatively, both may be displayed in a list format.

It is a conceptual diagram which shows the program analysis method by Embodiment 1 of this invention. It is a flowchart which shows the process of the program analysis method by Embodiment 1 of this invention. It is a flowchart explaining the process which produces the program sentence which is tabular data in the program analysis method by Embodiment 1 of this invention. It is a flowchart explaining the process which extracts the unique program sentence in a program in the program analysis method by Embodiment 1 of this invention. It is a flowchart explaining the process which extracts a common element in the program analysis method by Embodiment 1 of this invention. It is a flowchart explaining the process which extracts a semi-common element in the program analysis method by Embodiment 1 of this invention. It is a figure which shows the example explaining the range divided | segmented by the common element in the process which extracts a semi-common element in the program analysis method by Embodiment 1 of this invention. It is a figure which shows the example explaining the process which extracts a quasi-common element in the program analysis method by Embodiment 1 of this invention. It is a flowchart explaining the process which extracts a non-common element in the program analysis method by Embodiment 1 of this invention. It is a flowchart which determines the display order of the program analysis method by Embodiment 2 of this invention. It is a figure which shows the example of a screen of the state of the program element of the single program of the program analysis method by Embodiment 2 of this invention. It is a figure which shows the example of a screen of the inclusion state of all the programs of the program element of the program analysis method by Embodiment 3 of this invention. It is a figure which shows the example of a screen which sets the content element of the program which the program analysis method by Embodiment 4 of this invention produces | generates. It is a flowchart which shows the process of the program reconstruction of the program analysis method by Embodiment 4 of this invention. It is a flowchart which shows the process which extracts the problem element of the program analysis method by Embodiment 5 of this invention.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Source program 2 Word / symbol / number unit extraction part 3 Common element extraction part 4 Inter-common element program sentence extraction part 5 Semi-common element extraction part 6 Non-common element extraction part 7 Common element list data 8 Semi-common element list data 9 Non-common element list data 11 Common element 12 Quasi-common element 13 Non-common element

Claims (6)

A first step in which a unit extraction unit extracts a program sentence that is a component of a program for each source program from a plurality of source programs, and stores the program sentence in a tabular file ;
The common element extraction unit extracts, as a common element, a program sentence that is only one program sentence in each source program and exists in all of the plurality of source programs, and common element list data The second step to save ,
A quasi-common element extraction unit extracts program sentences existing in a plurality of source programs as quasi-common elements within the same range delimited by the common elements of each source program, and stores them in quasi-common element list data Step,
And a non-common element extraction unit extracts, as a non-common element, a program sentence stored in the table format that is neither the common element nor the quasi-common element, and stores the non-common element list data in a fourth step . Including
Each element extracted in each of the second, third and fourth steps is assigned with an original source program extracted and a classification code indicating a position in the source program. A characteristic program analysis method.   2. The program sentence existing in one source program is displayed with the common element, the quasi-common element, and the non-common element in separate columns in the described order. Program analysis method.   2. The program analysis method according to claim 1, wherein the elements extracted from a plurality of source programs are displayed in a tabular form so that the presence / absence of each source program can be understood. The quasi-common element included in any source program that has a predetermined time relationship with the creation date of any one of the plurality of source programs is displayed in a list format. Item 4. The program analysis method according to any one of Items 3 to 3. The non-common element included in any one of the source programs having a predetermined time relationship with the creation date of any of the plurality of source programs is displayed in a list format. Item 4. The program analysis method according to any one of Items 3 to 3. What is required by the user using a screen that displays each element extracted from a plurality of source programs by the program analysis method according to claim 1 in a table format so that the presence or absence of each source program can be understood. A program creation method comprising creating a source program by combining selected elements if selected .

Images