JP2764782B2 - Data structure expansion method for COBOL programs - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to preprocessing of various analysis processes for an application program for reconstructing, redesigning, reusing parts, and maintaining an existing application program described in the COBOL language. And a data structure expansion method for structuring and expanding a data flow of an application program.

[0002]

2. Description of the Related Art In the case of restructuring, redesigning, reusing parts, and maintaining an application program, necessary analysis processing is performed using various analysis tools corresponding to each processing. Perform

Conventionally, in this type of analysis tool, a data structure that can be used in common between tools has not been established.
Each program structure was described in its own format. Therefore, when performing the analysis process of the application program, the analysis process, the expansion process,
It is necessary to develop a development format from the beginning, and there is a disadvantage that a great load is imposed on both time and labor.

[0004] In addition, even when an existing analysis result is diverted for an application program that has already been subjected to the same analysis processing, the description of the program structure is diverted to the description format of the analysis tool. , And there is a disadvantage that versatility is lost.

SUMMARY OF THE INVENTION The present invention solves the above-mentioned conventional problems for an application program described in the COBOL language and provides a description format of a versatile program structure that can be commonly used in various analysis processes. And to reduce the development load of various analysis tools.

[0006]

SUMMARY OF THE INVENTION In order to achieve the above object, the present invention relates to a COBOL program data structure expansion method for expanding a source program of an application program described in the COBOL language based on a data structure. A lexical analysis unit for decomposing a source program of an application program described in the COBOL language into lexical expressions, a lexical analysis unit for analyzing the lexical sequence obtained by the lexical analysis processing of the lexical analysis unit, From the result of the parsing process of the parsing unit, define the contents of the instructions in the above application program.
And as a target instruction definition part, the reference data items in an instruction statement of the instruction definition partial data item and updating data
When determining whether to correspond to data items, corresponding to the reference data item or updated data item, in the statement
Whether there are reference data items and update data items and their data
Application program for each statement with data items
Data consisting of defined positions that indicate physical appearance positions in the ram.
A data item analysis unit that analyzes the reference and update relationship in a command sentence of the data item by adding the information of the data item to the data item information, based on information obtained by the analysis processing of the data item analysis unit. And a data flow table creating unit for creating a data flow table in which the reference and update relation of the data item name in the above-mentioned statement are registered.

In such a data structure development method, a data flow table indicates a reference or update relationship of a data item name by a statement in an application program , and indicates a physical appearance position of the statement in the application program. And a search table in which a reference pointer indicating a registration position in the data table of a data item registered in the data table is registered.

[0008]

Embodiments of the present invention will be described below in detail with reference to the drawings. FIG. 1 is a block diagram showing a configuration of a data structure expansion method of a COBOL program according to an embodiment of the present invention.

In the data structure development method of the COBOL program of the present embodiment, a source program of an application program described in the COBOL language is input, data structure development processing is performed, and a data flow table 1 is created.
Expand to 0. The created table is stored in a predetermined storage device (not shown).

Here, the data flow table 10 indicates a reference or update relationship of a data item name by a statement in an application program, and registers a definition position of the statement in the program.
1 and a search table 12 indicating a relationship between a data item name indicating a reference or update relationship by the data table 11 and a statement referencing or updating the data item name. FIG. 8 shows an example of a source program described in the COBOL language of the application program.
FIG. 7 shows an example in which the source program is developed in the data flow table 10.

As shown in FIG. 1, the data structure expansion processing according to the present embodiment is obtained by a lexical analysis unit 1 for decomposing an input source program into lexical expressions which are basic elements in syntax, and an analysis by the lexical analysis unit 1. A parsing unit 2 for parsing the lexical string obtained, and a data item analyzing unit 3 for analyzing the relationship between the data items based on the analysis result of the parsing unit 2
And a data flow table creation unit 4 that creates the data flow table 10 based on information obtained by the analysis processing of the data item analysis unit 3.

FIG. 2 shows the flow of the data structure expansion processing. First, when the lexical analyzer 1 inputs a file of a source program of an application program, the input source program is decomposed into lexical characters (step S).
1). Then, the syntax analysis unit 2 performs syntax analysis on the lexical string, processes the syntax error, and identifies the type and structure of the command sentence (step S2).

Next, the data item analysis unit 3 sequentially inspects the imperative sentence from the lexical string subjected to the syntax analysis processing by the syntactic analysis unit 2 and determines whether there is a reference relation or an update relation of the data item in the imperative sentence. Detect and create data item information (step S3).

Next, the data flow table creation unit 4
Based on the data item information obtained by the analysis process of the data item analysis unit 3, a data flow table is created in which the reference and update relation of the data item name in the above-mentioned statement are developed based on a data structure composed of a table. (Step S4).

The above processes are repeated until all the command statements in the input program file have been processed (step S5).

As shown in FIG. 3, the data item analysis unit 3 includes a reference data item identification unit 31 for identifying a reference data item in a command sentence of an input file from another data item name.
And an update data item identifying means 32 for identifying an update data item in the same command statement from another data item name. As a result, data item information including the presence or absence of the reference data item and the update data item in the statement, and the physical definition position in the application program of each statement having these data items is created. here,
The reference data item refers to the name of the data item referenced in the statement, and the updated data item refers to the name of the data item updated in the statement.

FIG. 4 shows a flow of processing of the data item analysis unit 3. When the data item analysis unit 3 inputs the lexical sequence of the source program subjected to the syntax analysis, the reference data item identification unit 31 first converts the lexical sequence into a command sentence based on information obtained by the lexical analysis process and the syntax analysis process. It is determined whether there is a reference data item (step S
1). If there is a reference data item, the reference data item in the statement is added to the data item information (step S2). This identification process is repeated until there is no reference data item in the command sentence.

Next, the update data item identification means 32 determines whether there is an update data item in the command statement based on the information obtained by the lexical analysis processing and the syntax analysis processing (step S3). If there is an update data item, the update data item in the statement is added to the data item information (step S4). This identification process
Repeat until no update data item is left in the statement.

After the above identification processing, the data item analysis unit 3
Detects the defined position of the identified statement in the application program and adds it to the data item information (step S5). The data item information including the data item name and its defined position identified by each of the above processes is stored in a work memory or the like.

As shown in FIG. 5, the data flow table creating section 4 includes a table area securing means 41 for securing an area for storing a table in the storage area of the storage device, and a data item created by the data item analyzing section 3. It comprises a reading means 42 for reading information and a registration means 43 for registering predetermined information read by the reading means 42 in the area secured by the table area securing means 41.

FIG. 6 shows the flow of processing of the data flow table creation unit 4. When the data item information is created by the data item analysis unit 3, the data flow table creation unit 4 uses the table area securing unit 41 to store the data table 11 and the search table 12 in the storage area of the storage device.
Area is secured (step S1).

Next, the data item information is read by the reading means 42, and the information such as whether the definition position of the command statement in the program and the data item are referred to or updated is stored by the registering means 43 for each command statement. Is registered in the data table 11 (step S2).

Next, the data flow table creation unit 4
The registration unit 43 registers a reference pointer indicating a registration position in the data table 11 of the data item registered in the data table 11 in step S2 in the search table 12 (step S3). With this reference pointer,
In the search table 12, the relationship between the reference data item or the update data item and the command statement referencing or updating these data item names can be indicated. That is, by using the data item name as a key and calculating the registration position in the search table 12 using the reference pointer, the relationship between the data item name and the command statement is represented.

The above-described processing by the data flow table creation unit 4 is repeatedly performed while the reference data item or the update data item identified by the data item analysis unit 3 remains in the data item information. Then, when there are no more reference data items or update data items, the process ends (step S4).

[0025]

As described above, the present invention provides a COBO
Since the source program of the application program described in the L language is developed into a data flow table in which data item reference / update relationships are registered, the structure of the application program can be described in a general manner. By showing the reference or update relationship of the data item name, and showing the relationship between the data item name indicating the reference or update relationship and the command statement referencing or updating the data item name, various analysis tools Data exchange between them and development of a new analysis tool are facilitated, and there is an effect that time and labor can be reduced.

As a means for describing the program structure of an application program, reference to data items
By adopting a data flow table in which update relationships are registered, it is easy to refer to data item names or track update relationships when analyzing the flow of processing during program analysis, and There is an effect that it is possible to easily search for a corresponding statement by paying attention to the item name.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a configuration of a data structure expansion method of a COBOL program according to an embodiment of the present invention.

FIG. 2 is a flowchart showing the flow of processing of the data structure expansion method of FIG.

FIG. 3 is a functional block diagram illustrating functions of a data item analysis unit in FIG. 1;

FIG. 4 is a flowchart showing a flow of processing of a data item analysis unit in FIG. 3;

FIG. 5 is a functional block diagram illustrating functions of a data flow table creation unit of FIG. 1;

FIG. 6 is a flowchart showing a flow of processing of a data flow table creation unit of FIG. 5;

FIG. 7 is a diagram illustrating an example of a data flow table.

FIG. 8 is a diagram showing an example of a source program of an application program described in the COBOL language.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Lexical analysis part 2 Syntax analysis part 3 Data structure analysis part 4 Data flow table creation part 10 Data flow table 11 Data table 12 Search table

──────────────────────────────────────────────────続 き Continued on the front page (56) References “IPSJ Research Report” Vol. 93, NO. 4 (1993-1-19) (93-IS-42-11) "Information Processing Society of Japan" Vol. 92, NO. 79 (1992-9) (92-SE-87-1) (58) Field surveyed (Int. Cl. ⁶ , DB name) G06F 9/06

Claims (2)

(57) [Claims] 1. A data structure development method for a COBOL program which expands a source program of an application program described in a COBOL language based on a data structure, wherein a source program of the application program described in the COBOL language is lexically expressed. A lexical analysis unit to be decomposed; a lexical analysis unit that parses a sequence of lexical characters obtained by the lexical analysis processing of the lexical analysis unit; and a lexical analysis result of the lexical analysis unit. Instruction that defines the contents of the instruction
For the definition part , the data items in the statement in the instruction definition part are a reference data item and an update data item.
Judge whether it corresponds to the reference data item or the update data item .
Data items and update data items, and these data items
In the application program of each statement having an eye
Term consisting of defined positions that indicate physical appearance positions in the
A data item analysis unit for analyzing the reference and update relationship in the command sentence of the data item by adding the information of the data item to the eye information; and the instruction based on the information obtained by the analysis processing of the data item analysis unit. A data structure development method for a COBOL program, comprising: a data flow table creation unit for creating a data flow table in which a reference to a data item name in a statement and an update relationship are registered. 2. A data flow table showing a reference or update relationship of a data item name by a statement in an application program and an application of the statement.
A data table in which a defined position indicating a physical appearance position in a program and a reference pointer indicating a registered position in the data table of a data item registered in the data table are registered. 2. The COBO according to claim 1, comprising: a search table comprising:
Data structure expansion method for L programs.