JPH05233278A - Method for branching processing to plural processing routines - Google Patents

Abstract

PURPOSE:To complete conditional decision only once, to simplify a program, to prepre maintenance, and to obtain generality by previously hierarchically defining plural processing switches in a data part. CONSTITUTION:In the case of branching to 'processing X' by using a data part processing switch based upon COBOL language, a condition for executing 'processing X' requires SW-1='1' (ON state), SW-2='1' (ON state) SW-3='0b (OFF state). Since each condition means SW-A='110', the 'processing X' is allowed to be executed when one condition SW-A='110' is satisfied. In the case of branching to 'processing X' also, the 'processing Y' is allowed to be executed so that the condition of SW-A='101' is satisfied similarly to the 'processing X'.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a computer programming technique, and more particularly to a programming technique by layering processing switches.

[0002]

2. Description of the Related Art Conventionally, this kind of programming technique is
The combination of processing switches was performed by multiple conditional statements.

For example, consider the case of branching to "process X" in FIG. When a processing switch is defined using the COBOL language in the conventional method, it becomes as shown in FIG.
When this processing switch is used, in order to branch to "processing X", the following three conditions must be satisfied.

SW-1 = “1” (ON state) SW-2 = “1” (ON state) SW-3 = “0” (OFF state) To judge these three conditions, the condition judgment is made. Must be done 3 times. The flow of the process is shown in the flowchart of FIG.

[0005]

In the above-mentioned conventional programming technique, since all combinations of processing switches must be set by conditional statements, the program is complicated and nesting is inevitably deep. In addition, when changing the conditions, it is necessary to modify the entire logic, which lacks versatility.

[0006]

According to a first aspect of the present invention, in a method of branching to a plurality of processing routines, a plurality of processing switches are hierarchically defined in advance, and the states of the processing switches are collectively checked. Then, the processing routine is branched to a processing routine which is predetermined for the state correspondence.

[0007]

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

FIG. 1 is a diagram showing an example of processing switch definition of the data part of the present invention in the COBOL language. Consider the case of pattern 2 in which the process switch is used to branch to "process X" in FIG.

The conditions for performing the "process X" are: SW-1 = "1" (ON state) SW-2 = "1" (ON state) SW-3 = "0" (OFF state) Must be

The states of ~ means that SW-A = "1".
10 ". Therefore, as shown in the flowchart of FIG. 2, when one condition of SW-A =" 110 "(step 1) is satisfied," process X "should be performed.

As another example, consider the case of branching to "processing Y" in FIG. 4 (pattern 3). Again,
Considering the same as in the case of “processing X”, SW−A = “10
If the condition "1" (step 2 in the figure) is satisfied,
It suffices to perform "process Y".

[0012]

As described above, according to the present invention, since the processing switches are hierarchically defined in the data part in advance, the condition judgment can be made only once, the program is simple, and the maintenance is also possible. It has the effect of being easy and versatile.

[Brief description of drawings]

FIG. 1 is a diagram showing an example of processing switch definition of a data part of the present invention in COBOL language.

FIG. 2 is a branching process flowchart in the present embodiment.

FIG. 3 is a diagram showing an example of a conventional processing switch definition of a data section in COBOL language.

FIG. 4 is a diagram showing a relationship between a state of a processing switch and a branch destination.

FIG. 5 is a flowchart of a conventional branching process.

[Explanation of symbols]

 Step 1 SW-A = "110" judgment step Step 2 SW-A = "101" judgment step

Claims (1)

[Claims] 1. A method of branching to a plurality of processing routines, wherein a plurality of processing switches are hierarchically defined in advance, and the states of the respective processing switches are collectively checked to perform processing predetermined in correspondence with the states. A method for branching to a multi-processing routine characterized by branching to a routine.