JP3216660B2 - Data type and data constant expansion method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data type expansion processing method in a language processing system for converting a source program into a target program.

More specifically, the present invention relates to a data type and a data constant expansion processing method which are effective in a data processing program in which each performs the same data definition and fixes a constant usable in each data definition to the data definition. .

[0003]

2. Description of the Related Art Conventionally, in this type of data type expansion processing method and data constant expansion processing method, a data type within a range specified by a program language specification is described for each individual data in each program. Was converted to a program.

[0004] In addition, constants that can be used as data types are also described in individual equivalent condition comparison statements within the range specified by the programming language specification.

Hereinafter, the prior art will be described with a specific example.

For example, consider a system consisting of a group of programs that refer to branch numbers having the following types and values as common data.

01 Branch number PIC 9 (5). … (1) The attribute of the data branch number is a 5-digit external decimal value that can be taken 00,01,02,05: Branch number in Tohoku area… (2) 10,11,18,20: Branch number in Kanto area ... (3) Numbers of 30 or more and 38 or less: Branch numbers in the Chubu area ... (4) In programs that refer to the branch numbers that are the common data described above, it is necessary to accurately define the data in the description (1). . When the number of programs constituting the system is as small as a few, the burden is not so large, but a system composed of hundreds or thousands of programs requires a great deal of man-hours. In addition, a description error is likely to occur, which causes a reduction in system reliability. The program description for determining whether the value of the branch number as the common data is logically the branch number in the Kanto area is as follows.

IF branch number = 10 OR branch number = 11 OR branch number = 18 OR branch number = 20 THEN ... (5) All programs that determine whether the branch number is logically located in the Kanto area are accurately described. Statement (5) must be described. When the number of programs constituting the system is as small as a few, the burden is not so large, but a system composed of hundreds or thousands of programs requires a great deal of man-hours. In addition, a description error is likely to occur, which causes a reduction in system reliability.

Further, since the attribute of the branch number, which is the common data, is insufficient with the conventional five digits of the external decimal,
If the number is expanded to eight digits in external decimal, all the definitions of the branch numbers, which are common data of the programs constituting the system, must be corrected. When the number of programs constituting the system is as small as a few, the burden is not so large, but a system composed of hundreds or thousands of programs requires a great deal of man-hours. In addition, a description error is likely to occur, which causes a reduction in system reliability.

Similarly, if a branch having a branch number 15 is newly added to the Kanto area among the possible values of the branch number as the common data, it is determined whether the branch number is logically the Kanto area. The program description (5) for determining whether or not to do so must be changed as shown below.

IF branch number = 10 OR branch number = 11 OR branch number = 18 OR branch number = 15 OR branch number = 20 THEN ... ~ (6) The description sentence (5) is changed to the description sentence (6). The task to do is
When the number of programs constituting the system is as small as a few, the burden is not so large, but a system composed of hundreds or thousands of programs requires a great deal of man-hours. In addition, a description error is likely to occur, which causes a reduction in system reliability.

The method according to the prior art will be described with reference to the drawings.

FIG. 11 is a diagram showing a system configuration according to the prior art.

FIG. 12 is a diagram showing a processing program of a data type analysis process according to the prior art. FIG. 13 is a diagram illustrating a processing process of an analysis process of an equivalent condition comparison statement according to the related art. FIG. 14 is a diagram showing a process of processing an equivalent condition comparison statement, but FIG. 14 will be described in comparison in the embodiments.

As shown in FIG. 12, in the data type analysis processing, when a source program is input, the lexical analysis processing is first performed by the lexical analysis means to generate token strings T091-T095, and then the token strings are analyzed by the data analysis means. Data parsing was performed according to the syntax rules of the language processing system, and the correct syntax was converted to an internal format.

The data description sentence (1) according to the prior art is obtained by vocabulary analysis by the vocabulary analysis means.
1, T092, T093, T094, and T095, and are parsed by data parsing means. Token T091 is a numeric token representing 01, token T0
92 is a user language token representing a branch number, and a token T
093 is a reserved word token representing PIC, token T0
94 is a character string token representing S9 (5), T095
Is. Is a reserved word token representing.

Similarly, as shown in FIG. 13, in the analysis processing of the equivalent condition comparison sentence, when the source program is input, first, the vocabulary analysis means performs vocabulary analysis processing to perform a token sequence T101.
ＴT1017, and then the procedural analysis means performs procedural syntax analysis on the token sequence in accordance with the syntax rules of the language processing system, and converts the correct syntax into an internal format.

The equivalent condition comparison statement (6) in the prior art is composed of 17 tokens T101, T102,.
7, the information represented by each token is shown in FIG.
It is as shown in FIG.

[0019]

In such a conventional method, when constructing a large-scale system in which common data reference and data setting are performed, the creator intentionally writes the definition of common data in each program into each program. There is a problem that coding requires a large number of man-hours and that errors tend to occur, thereby lowering the reliability of the system.

There is no restriction on the logical values that can be used in the common data, and it is necessary to consciously describe the logically comparable values when referring to the common data in the description of the equivalent condition comparison statement in each program. There is a problem that a large number of man-hours are required, and errors tend to occur, thereby lowering the reliability of the system.

Similarly, when the type of the common data is changed, or the value that can be taken by the common data is expanded or changed, the definition statement of the common data in each program is corrected, and the equivalent condition of the common data is changed. The values described in the comparison sentence must be expanded or changed individually, which requires a large number of man-hours for correction, and causes a problem that errors tend to occur, thereby lowering the reliability of the system.

Therefore, an object of the present invention is to first store a data type and a value usable in the data type in a database, and use a type definition and an equivalence condition comparison expression of a data item commonly used in the entire system. To facilitate the description of the types of data items commonly used throughout the system and the description of the values that can be used in the equality condition comparison expressions, and to use the information in each program To prevent the system reliability from deteriorating, and to make it easy to change the type of data items commonly used in the entire system and to change the available values in the equivalent condition comparison expression or to modify the program when adding values, and to maintainability. It is to provide a data type and a data constant expansion method for improving the data type.

[0023]

In order to achieve the above object, a data type and data constant expansion method according to the present invention are required for data definition in a data type expansion process in a language processing system for converting a source program into a target program. A database is provided with entries of data type information including the internal representation format of the data type information and the name of the data type information, and the source program describes the name of the data type as the type name in the definition of the data item. When the source program is input, the data type information obtained by reading the database using the data type name as a key is converted by the type information conversion means into the format of the target program.

In addition, data type information necessary for data definition and possible value information usable for the data type and an entry of possible value information name usable for the data type for the name of the data type information Is provided as a subordinate entry of the data type information entry, and when the source program is input, the data item defined by the data type information is associated with the data item name and the data type information by the type information table creating means. A table is created, and in the source program, the name of the possible value information is described as a comparison partner of an equivalence condition comparison statement using a data item defined by the data type information as a comparison item, and the source program is When input, the value information conversion means of the data item defined by the data type information After determining whether the name of the possible value information entry dependent on the data type information entry on the database matches the name of the possible value information described in the equivalent comparison condition, the name of the possible value information matches. In this case, the equivalent condition comparison statement is converted into a target program format from possible value information obtained by reading the database with the possible value name described in the source program as a key. I do.

[0025] Further, information of possible values in a data type is set as two or more discrete values, and a database is provided which includes the possible value information and a plurality of discrete values. The equivalence condition comparison statement is converted into the format of the target program from possible value information obtained by reading the database using the name of the possible value as a key.

Further, information of a possible value in a data type is set as a continuous value represented by an upper limit value and a lower limit value, and the possible value information is composed of a continuous value represented by an upper limit value and a lower limit value. Providing a database having names of possible value information as entries, and converting the equivalence condition comparison statement into a target program format from possible value information obtained by reading the database using the possible value names as keys. It is characterized by.

[0027]

According to the above construction, there is provided a database having entries of data type information consisting of an internal representation form of data type information necessary for data definition and a name of the data type information,
In the source program to be input, the name of the data type of the entry of the database commonly used in the entire system is described as the type name in the definition of the data item. Such a source program is input, and the data type information obtained by reading the database with the data type name as a key by the type information conversion means is converted into the format of the target program.

Alternatively, a database is provided in which entries of available value information that can be used in a data type and names of available available value information are registered as subordinate entries of data type information entries, and data is defined by the data type information. Creates a correspondence table of data item names and data type information from the data items that have been added, and in the source program to be input, the name of the value information that can be taken by the dependent entry of the database as the comparison partner of the equivalence condition comparison statement that uses the data items as comparison items Is described.

By inputting such a source program, the value information conversion means determines whether or not the name of the possible value information entry in the database matches the name of the possible value information described in the equivalent comparison condition in the source program. judge.

If the names match, the equivalent condition comparison statement is converted into the form of the target program from the possible value information obtained by reading the database using the possible name of the value as a key. This makes it easy to describe the types of data items that can be used and to describe the values that can be used in the equivalence condition comparison expression, prevent the reliability from being lowered due to incorrect descriptions in the programs, and use the data that is shared by the entire system. This makes it easy to change the type definition of an item, change an available value in an equality condition comparison expression, and modify a program when adding it.

[0031]

Next, embodiments of the present invention will be described with reference to the drawings.

FIG. 1 is a configuration diagram showing a system configuration showing an embodiment of the present invention.

The system shown in FIG. 1 comprises a source program SP, a language processing system CP, a knowledge database DB, a target program OP, a workstation WS, and a type information table TT.
BL1.

The workstation WS is for inputting a source program to the language processing system CP. The language processing system CP includes vocabulary analysis means, type information conversion means, data analysis means, value information conversion means, procedure analysis means, It is composed of a target program generating means and a type information table TTBL1, and converts a source program SP into a target program OP.

The knowledge database DB has a data type information entry including a data type name and data type information as shown in FIG. 2 and a value name and a value information which can be obtained in each data type shown in FIG. The possible value information entry consisting of is stored in advance.

Referring to FIG. 2, the knowledge database DB
The data type information entry includes a key part, an attribute part, a significant digit part, and a possible value information name part. The key part is a name for the data type and a reference key for the knowledge database DB. The attribute part is an attribute of the data type named in the key part (for example, an external decimal number, an internal decimal number,
Bit string B indicating binary numbers, alphanumeric characters, Japanese characters, etc.)
1, B2, B3,... B31, B32. The significant digit portion indicates the number of significant digits of the data attribute indicated by the attribute portion. For example, if the attribute part is a bit attribute, it indicates the number of bits, and if the attribute part is an alphanumeric character, it indicates the number of bytes. The possible value information name part indicates a name for a value available in the data type, and is composed of one or more columns of names. The name of the possible value information is used as a key when referring to the possible value information entry of the knowledge database DB.

A possible value information entry of the knowledge database DB shown in FIG. 3 includes a key portion, a format portion, and the number and value portions of possible values.

The key part is a name of a value that can be named and a reference key of the knowledge database DB. The format part is a bit string BB1, BB2, BB3,... Indicating a possible value format (for example, a single value, a continuous value including an upper limit and a lower limit, and a discrete value including a plurality of values).
BB31 and BB32. The number of possible values indicates the number of subsequent value parts. For example, if the possible value format indicates a single value, it indicates 1, if the possible value format indicates a continuous value, it indicates 2, and if the possible value format indicates a discrete value, Represents 2 or more. The value part is repeated by the number indicated by the number of possible values, and each indicates a physical value.

For the following description, data attribute entries (key names are store numbers) as shown in FIG. 4 and FIG.
Possible value information entries (key names are Tohoku area, Kanto area, Chubu area) as shown in
B is assumed to be registered.

Next, the processing operation of the data type expansion system according to the first embodiment of the present invention will be described.

FIG. 6 shows a process of a data type expansion system according to the first embodiment of the present invention. Hereinafter, the flow of processing of the data type expansion method according to the method of the present invention will be described with reference to FIGS. 6, 4, and 5.

First, when defining a data item in a source program, a data type name registered in advance in the knowledge database DB is described instead of a data type description defined in a programming language as a data type. Description sentence (1) listed above
It is as follows if shown corresponding to.

01 branch number USAGE store number. (7) In the description (7), the store number is the name of the data attribute of the data item branch number. When a source program described as a description sentence (7) is input to the language processing system CP,
As shown in FIG. 6, first, vocabulary analysis is performed by the vocabulary analysis means, and the description sentence (7) is converted into five tokens T1 to T5. The token T1 is a numeric token corresponding to the numeral 01 in the description (7), and the tokens T2, T3, and T4 are user words and reserved words corresponding to the user word branch number, the reserved word USAGE, and the user word store number, respectively. token. The token T5 is: Is a reserved word token corresponding to.

Next, type information conversion means is activated for these token strings T1 to T5, and type information conversion is performed.

In the type information conversion process, the token strings T1 to T
Enter "5" and the user word name "store number" of the user word token next to the reserved word token representing the USAGE of the token T3.
Access to the knowledge database DB by using
Of the data type information entry TI1 shown in FIG. TI1
, The attribute part and the significant digit corresponding to the store number are analyzed, and the input token T3 and token T4 are replaced with the token T6 representing the reserved word PIC and the character 9 (5) representing the data type and the significant digit 9 (5). Convert to token T7.

As a result, the token sequence generated by the type information conversion process is a token sequence of T1, T2, T6, T7, and T5. The token sequences T1, T2, T6, T7, T5 are
It is the input for the next data parsing. This token sequence is
The token strings T091, T092, T0 output by the vocabulary analysis corresponding to the description sentence (1) in the conventional method shown in FIG.
93, T094, and T095, it is understood that the description sentence (7) is analyzed in the same manner as the description sentence (1) of the prior art by the data type expansion processing of the method of the present invention.

In the type information processing in this case, the token T2 indicating the data name and the token T4 indicating the key of the data type information next to the reserved word USAGE are used for the value information conversion processing described below. TTBL1 which is a correspondence table between the data type information name and the data type information name is created.

Next, a description will be given of a method of expanding data constants in the analysis of an equivalence condition comparison statement according to the second embodiment of the present invention.

Description sentence (5) used in the description of the prior art
Has determined whether the data name branch number is logically a branch number in the Kanto area. The same thing as this determination will be described by the method of the present invention. The following equivalent condition comparison statement is described in advance in the source program.

IF branch number = Kanto district THEN ~ ... (8) The description sentence (8) is equivalent to the description sentence (5) explained in the prior art, and the value of the data name branch number is equal to the branch number in the Kanto area. expressing. The method of the present invention for processing the description sentence (8) equivalently to the description sentence (5) will be described with reference to FIG.

FIG. 7 shows a process of processing the data constant expansion method of the equivalent condition comparison statement according to the second embodiment of the present invention. In FIG. 7, first, vocabulary analysis processing is performed, and a description sentence (8) described in advance in the source program is expanded into token strings T51, T52, T53, T54, and T55. Next, the value information conversion processing means is activated and inputs the token strings T51, T52, T53, T54, T55.

In the value information conversion process, the input token sequence is analyzed, and a user word token T52 appearing after the reserved word IF and a reserved word token T53 representing = and an equivalent comparison condition statement are obtained from the user word token T54. Extract. Then =
The user word tokens T52 and T54 appearing immediately before / after the reserved word token T53 indicating the type information table TT
A search is made to see if the data is registered as the data name of BL1.
The correct statement is that either one is registered or both are not registered, so if both are registered, an error will be displayed, and if both are not registered, End the value information conversion and input the next token string. In this embodiment, the branch number is registered in the type information table TTBL1, but the Kanto area is not registered. Therefore, it is understood that the data indicated by the branch number is defined in advance by the description of the type information name. Next, the type information table TT
The data type information name store number corresponding to the branch number is obtained from BL1. Next, the knowledge database DB is searched using the data type information name store number as a key. In the knowledge database DB,
Since an entry as shown in FIG. 4 is registered in advance,
The data type information entry TI1 is referred to.

Next, it is checked whether or not the name indicated by the other token of the equivalence condition comparison statement exists in the name of the value information section in TI1, and if not, an error is displayed and processing of the next token string is performed. Is carried out. In this embodiment, the Kanto area indicated by the token T54 exists. Next, the knowledge database DB is searched using the Kanto area as a key. By the same operation, the value information entry CI2 is searched as shown in FIG. Since the format part of this CI2 is a discrete type, the token string of the equivalent comparison condition statement in which the comparison partner of the equivalent comparison condition statement for the data name "branch number" is made to correspond to the value part of the value information entry is logically By linking with a reserved word token indicating a connector OR, the same number of values as the value information entry can take is generated. As a result, as shown in FIG. 7, the token strings T51, T52, T53, T54, T55
Are token strings T51, T56, T57, T58, T5
9, T510, T511, T512, T513, T51
4, T515, T516, T517, T518, T51
9, T520 and T55. The converted token sequence is a token sequence T101... T1017 which is an output of the vocabulary analysis shown in FIG.
Is the same as From the above, the description sentence (8) by this method is
It can be seen that it is interpreted in the same manner as the description sentence (5) in the prior art, and it can be understood that the data name branch number can be logically determined to be a branch in the Kanto area.

The above is a description of the data constant expansion method in the case where value information that can be taken as two or more discrete values is set.
The fourth embodiment has been described above, but a fourth embodiment will be described in which information of possible values is set as a continuous value expressed by an upper limit and a lower limit. Consider whether or not the data name branch number shown in the description (1) is a branch in the Chubu district shown in the description (4). The description in the prior art is as follows.

IF branch number> = 30 AND branch number <= 38 THEN... (9) The result of the vocabulary analysis process of the description sentence (9) according to the conventional technique is a token string T11 output by the vocabulary analysis process of FIG.
2, T113, T114, T115, T116, T11
7, T118, T119, and T1110. The description that is logically the same as the description sentence (9) in this method is as follows.

IF branch number = Chubu district THEN ... (10) This means that the description sentence (9) and the description sentence (10) are interpreted in the same manner by this method. Description sentence by this method (10)
8 is shown in FIG. Referring to FIG. 8, in the vocabulary analysis process, a description sentence (10) described in advance is input, and token strings T61, T62, T63, T64, and T65 are developed. Next, the value information conversion processing means is activated and inputs the token strings T61, T62, T63, T64, T65.

In the value information conversion processing, the input token sequence is analyzed, and a user word token T62 appearing after the reserved word IF and a reserved word token T63 representing = and an equivalent comparison condition statement are obtained from the user word token T64. Extract. Then =
Is searched for the user word tokens T62 and T64 appearing immediately before / after the reserved word token T63 indicating whether or not they are registered as data names in the type information table TTBL1. In the correct description, either one is registered or both are not registered, so if both are registered, an error will be displayed, and if both are not registered, the value will be displayed. The information conversion is completed and the next token string is input. In this embodiment, the branch number is registered in the type information table TTBL1, but the Chubu area is not registered. Therefore, it is understood that the data indicated by the branch number is defined in advance by the description of the type information name. Next, type information table T
The data type information name store number corresponding to the branch number is obtained from TBL1. Next, the knowledge database DB is searched using the data type information name store number as a key. Since an entry as shown in FIG. 4 is registered in the knowledge database DB in advance, the data type information entry TI1 corresponding to the data type information entry is referred to. Next, it is checked whether or not the name indicated by the other token of the equivalence condition comparison statement exists in the name of the value information section in TI1, and if not, an error is displayed and the processing of the next token string is performed. . In the present embodiment, a central area indicated by the token T64 exists. Next, the knowledge database DB is searched using the Chubu district as a key. By the same operation, the value information entry CI3 shown in FIG.
Is searched. Since the format part of this CI3 is a continuous type, the token string of the comparison condition statement in which the lower limit value of the comparison condition statement of the greater-than condition for the data name "branch number" corresponds to the value part of the value information entry is described. , A comparison condition in which the upper limit value of the comparison condition statement of the less-than condition for the data name “branch number” is made to correspond to the second value part of the value information entry by linking with a reserved word token indicating a logical connector AND. Generate a token sequence for the statement. As a result, as shown in FIG. 8, the token strings T61, T62, T63, T64, T65 are subjected to the value conversion processing.
Are the token strings T61, T66, T67, T68, T6
9, T610, T611, T612, and T65. The token sequence as a result of the conversion is the same as the token sequence T111... T1110 which is the output of the vocabulary analysis shown in FIG. From the above, it can be understood that the description sentence (10) according to the present method is interpreted in the same manner as the description sentence (9) in the prior art, and that the data name and the branch number can be logically determined to be a branch in the Chubu district. Understand.

Finally, a case where the attribute of the data indicated by the branch number is extended from the conventional five-digit external decimal to six-digit external decimal, and 15 is added to the branch number indicating the Kanto area will be described.

In this case, in the conventional system, the description (1) must be changed to the following description.

01 Branch number PIC 9 (6). … (11) Also, the equivalence comparison statement for whether the data name is in the Kanto area is
The description (5) must be changed to the description (6). This description change is not a burden when the number of programs constituting the system is as small as several, but requires a great deal of man-hours in a system composed of hundreds or thousands of programs. In addition, a description error is likely to occur, which causes a reduction in system reliability.

On the other hand, according to the method of the present invention, the information registered in the knowledge database is changed from the contents shown in FIGS. 4 and 5 to the contents shown in FIGS. What is necessary is clear if the contents of FIGS. 4 and 5 are replaced with the contents of FIGS. 9 and 10 and the embodiment described above is repeated as it is.

[0062]

As described above, according to the present invention, a data type and a value usable in the data type are stored in a database, and the type definition and equivalent of a data item commonly used in the entire system are stored. It is used to expand the values that can be used in conditional comparison expressions to facilitate the type definition of data items that are commonly used throughout the system and the description of values that can be used in equivalent condition comparison expressions, and between programs. It is possible to prevent a decrease in the reliability of the system due to the above illegal combination.

Further, it is possible to easily change the type definition of the data item commonly used in the entire system and change the usable value in the equivalent condition comparison expression or to modify the program when adding the value, thereby improving maintainability. And so on.

[Brief description of the drawings]

FIG. 1 is a system configuration diagram according to an embodiment of the present invention.

FIG. 2 is a diagram showing data type information entries of the knowledge database shown in FIG. 1;

FIG. 3 is a diagram showing a value information entry of the knowledge database shown in FIG. 1;

FIG. 4 is a diagram showing a specific example of the data type information entry shown in FIG. 2;

FIG. 5 is a diagram showing a specific example of a value information entry shown in FIG. 3;

FIG. 6 is a diagram showing a processing process of a data type expansion system according to the first embodiment of the present invention.

FIG. 7 is a diagram showing a processing process of a data constant expansion method according to a second embodiment of the present invention.

FIG. 8 is a diagram showing a processing process of a data constant expansion method according to a fourth embodiment of the present invention.

9 is a diagram showing a data attribute extension of the data type information entry shown in FIG. 4;

FIG. 10 is a diagram showing addition of a value part of the value information entry shown in FIG. 5;

FIG. 11 is a system configuration diagram of a conventional technique.

FIG. 12 is a diagram showing a processing process of a conventional data type analysis process.

FIG. 13 is a diagram showing a processing process of an analysis process of an equivalent condition comparison sentence in the related art.

FIG. 14 is a diagram showing a processing process of an analysis process in a case where possible values are continuous values in the related art.

[Explanation of symbols]

 SP source program WS workstation CP language processing system DB knowledge database OP target program TTBL1 type information table TI1 to TI2 data type information entry CI1 to CI4 value information entry T1 to T1110 token

──────────────────────────────────────────────────続 き Continued on the front page (58) Field surveyed (Int.Cl. ⁷ , DB name) G06F 9/45 G06F 9/06 G06F 9/44

Claims (3)

(57) [Claims] 1. A source program is converted into a target program.
In Data type expansion method in the language processing system for data type information and said take-up available at the possible value information and the available data types in data type for the name of the data type information necessary for data definition A database in which the entry of the name of the value information to be obtained is registered as a subordinate entry of the entry of the data type information , and the data type information is used when the source program is input .
To create a description Karade over <br/> data item name definition data defined data items have a correspondence table of the data type information
And type information table generating means, in said source program name of the take-up possible value information as a comparison partner equivalence condition comparison statement that the comparison item the data item of which de <br/> over data defined by the data type information and values describing information converting means, prior to the said database of said data items that are data defined by the data type information by the previous SL value information converting means
Determining the name of the serial data type information the up get value information describing the comparison condition with the name entry in the dependent possible values information the equivalent condition comparison statement entry is whether determine <br/> constant or consistent means and, after said determination, said take-up to obtain the value information name if a match was obtained by reading the database the name of the take-up possible values described in the raw starting programs as the key of the winding obtained value information data type expansion method, characterized by comprising converting means for converting the equivalent condition compared statement format of the eye <br/> programs from. 2. The data type expansion system according to claim 1 , wherein the information on the possible values in the data type is set as two or more discrete values, and the information comprises the possible value information and a plurality of discrete values. and an entry name of the take-up possible value information
A second database is provided and obtained by reading out the second database using the name of the possible value as a key
Datatype <br/> expansion method, characterized by converting said up possible value information the equivalent condition compared statement format of the object program. In Data type expansion method as claimed in claim 1, further comprising: setting the information of the up possible values of the data type as a continuous value represented by the upper and lower limit values, the said take-up to obtain the value information the third <br/> database with the name of the take-up possible values information of contiguous value represented by the upper limit value and the lower limit value and an entry is provided, the third database name of the take-up obtained value as a key data type expansion method, characterized in that conversion from the preparative <br/> Ri obtained value information obtained by reading the equivalent condition compared statement format of the object program.