Program processing system and method

Abstract: A program processing system for processing a program including a first program division written in a first programming language and a second program division written in a second programming language comprises an operating system 100, a program processor 200 for compiling the first and second program divisions to produce first and second modules, and registering the second module by using an identifier assigned by the operating system when the first module is registered, and a program executor 300 for retrieving the second module by using the identifier assigned to the first module and executing the second module while executing the first module. This obviates generation of unnecessary identifiers and simplifies system configuration.

Description: The present invention relates to a program processing system and its processing method. More particularly, this invention is concerned with a system for processing a database processing application program created by embedding a database processing program written in SQL or other database processing language into a program written in COBOL, FORTRAN, or another general-purpose programming language. Figures 1 and 2 are flowcharts showing the source program compilation procedure in a conventional database processing system. Figure 3 shows a compilation result of a source program. Figure 4 is a flowchart showing the operation of the database processing request procedure required for executing a database processing program including compiled procedures. Figure 5 shows an example of a database processing program used for explanation. A general-purpose programming language used to write a database processing program shall be X, and a database processing language, Y. In Figure 5, 1 denotes a database processing program. 2 is a portion of the database processing program which is written in X, and 3, a portion written in Y. Herein, the Y portion starts and ends, for easy understanding, with "exec sq1" and "end exec". In this form, the portion is embedded in a program written in X. The program shown in Figure 5 retrieves a maximum income from a table s containing data under the condition that the income does not exceed 100, assigns the value to a variable, "maxincome", then outputs the result to a terminal. Then, the program retrieves a minimum income from the table s containing data under the condition that the income exceeds 200, assigns the value to a variable, "minincome", then outputs the result to the terminal. When a source code of a database processing program is entered, the program is compiled according to the operation shown in Figures 1 and 2. First, at a step 36, the operation starts. At a step 37, it is determined whether a source file to be compiled still resides. If it resides, processing A shown in Figure 2 is executed at a step 38. In the processing A, the operation starts at a step 45. It is determined at a step 46 whether any element to be processed still resides. If it does not reside, the A returns to the caller at a step 55. If an element resides, it is read at a step 47. At a step 48, it is determined whether the read element is "exec sq1". If it is not "exec sq1", the element is passed to a general X compiler, then compiled as an X program. Then, the operation returns to the step 46. If the read element is "exec sq1", the subsequent elements ending with "end exec" forms the Y program. This portion is designated as P at a step 50. At a step 51, the P is compiled to create an actual database processing procedure. Registered procedures are assigned mutually-different identifiers I so that they can be identified. The system, therefore, has a counter for generating the identifiers. Every time a procedure is created, the counter is incremented by 1 at a step 52 to provide a different identifier. The identifier is represented as I. At a step 53, the procedure and P as well as the identifier I are registered with the system. Next, at a step 54, the generated identifier I of the procedure is used as an argument to create a description of an X procedure call for invoking a general-purpose procedure (herein "sqlexec") which activates precompiled database processing. Figure 3 shows an example of a result of converting an example of Figure 5 according to the procedure. In this example, two Y descriptions 3 are compiled to create procedures having procedure identifiers 11 and 12, and converted into X general-purpose procedure calls "sqlexec". Finally, the thus-converted general-purpose procedures "sqlexec" are compiled as X program descriptions by an X compiler at a step 49. The above operation continues until no element is found in the source file. At last, the operation is returned to the caller at a step 55. When the operation is returned, the general program division of the source file is stored as an object module in a file by the X compiler. The database processing division as well as its source description are registered in a database processing procedure registration area of the system. In addition, information indicating whether an error is detected during compilation is retained. After that, the operation returns to the step 39. Then, it is determined whether an error is detected during compilation of the source file. If an error is found, all database processing procedures registered so far are invalidated. At a step 42, the procedures are deleted. The whole compilation procedure terminates with an error at a step 43. If no error is found, the operation returns to a step 37. Then, the next source file is handled. If no source file resides, object modules of general program divisions are link-edited at a step 40. If an error is detected in this process, all the database processing procedures are deleted at the step 42. The whole compilation procedure terminates with an error at the step 43. If link editing terminates normally, a sequence of compilation processes terminates normally at a step 44. Next, an execution system for a thus-compiled database processing program will be explained. A database processing program starts the operation as a program written and compiled by general X. As execution proceeds, if "sqlexec" is invoked, database processing is carried out based on the logic shown in Figure 4. That is, "sqlexec" starts execution at a step 57, and retrieves a database processing procedure having a procedure identifier I given as an argument at a step 59. At a step 60, it is determined whether the procedure retrieved is valid. If the procedure is valid, the procedure is executed at a step 61. Then, the operation is returned to the caller. If the procedure has been invalidated for some reason, a source description P pointed to by the I is retrieved from a database processing procedure registration area in the system at a step 62. At a step 63, the P is dynamically recompiled as a Y description to re-create a valid database processing procedure. Then, the I is re-registered as an identifier in the system. The database processing procedure is executed as a step 61. A registered database processing procedure becomes inoperative and invalid if, for example, the indexes structure of data which the procedure uses is deleted. The database processing system of the prior art provides the aforesaid operations, posing the problems below. (1) A database processing program is recompiled many times during debugging, but an executable load module is not created every time. Therefore, identifiers of database processing procedures are consumed extravagantly and used up for a limited period of time. When an attempt is made to cope with this problem, the operation of a database management system becomes complex. Besides, procedures which have already been registered must be deregistered frequently because of errors deriving from other causes. Since a database processing procedure registration area is subject to exclusive control, contention occurs among object-time procedure retrieval, and compile-time procedure registration and deregistration. This causes system performance to deteriorates remarkably. (2) A registered procedure is assigned a procedure identifier unique to a system under which the procedure is compiled. The procedure identifier of the procedure may be used in another procedure in another system. The procedure, therefore, cannot be executed without any change to its source code. A program written in a conventional general-purpose programming language can be freely transferred between machines of the same type merely by moving load modules. This is not true for database processing programs. To transfer a database processing application program to another system, all source programs must be moved to and recompiled under the system. Thus, it is very difficult to transfer a database processing application program from system to system. EP-A-0 373 132 shows a prior art system of this kind. In the system disclosed therein, a source code written in a host language (e.g. COBOL or C) includes statements in a supplemental language (i.e. SQL commands). A pre-compiler (12) communicates to a SQL parser any SQL commands embedded in the source code and receives back, in a standard, language-independent format, a task list identifying sequences of calls to library procedures which actually implement the execution, at run time, of the SQL commands. The present invention intends to solve the foregoing problems. More particularly, unique identifiers are assigned to database processing procedures without using a system-specific counter, thus preventing the operating procedure of a database management system from being complex because of rapid consumption of counter values. Unnecessary procedures are not registered to reduce contention among object-time procedure retrieval, and compile-time procedure registration and deregistration, and eventually improve system performance. Thus, the aforesaid problem (1) will be solved. A database processing program can be transferred to another system merely by moving load modules alone, wherein source files need not be recompiled. This provides a solution for the aforesaid problem (2). A program processing system according to the present invention is set out in appended claim 1. A program processing method according to the present invention is set out in appended claim 8. In a program processing system according to the present invention, identifiers which an operating system assigns to files or modules are employed so that reference can be made from a first module to a second module. Identifiers which the operating system assigns are unique within the system. Using the identifiers, files or modules inside the system will not be indistinguishable from others. A program processor compiles and registers a first program division and a second program division so that a second module can be invoked with an identifier assigned to a first module. Then, a program executor retrieves the second module according to the identifier assigned to the first module while executing the first module, then executes the second module. This obviates conventional counter control, resulting in a simple system operating procedure. In a program processing method according to the present invention, identifiers which an operating system assigns to files or modules are employed, and source programs are compiled to create executable modules. First, a first compilation process is implemented to compile a first program division and create a first module. A second compilation process translates a second program into a second module, references the first module to find the identifier of the first module, and provides the first module with reference information for referencing the second module. An editing process registers the first module with the operating system to obtain an identifier, and then registers the second module so that the second module can be referenced later with the identifier. Thus, an executable module is generated. Unlike in a conventional method, a counter need not be referenced. While the first module is being executed, reference information contained in the first module is used to retrieve the second module, and then the second module is executed. In a program processing system and its method according to the present invention, an identifier of a first module which an operating system assigns uniquely within a system is used to retrieve a second module for execution. This prevents unnecessary registration and provides a simple system operating procedure. In a program processing method according to the present invention, a module can be executed on another system. A compilation editing process compiles and edits a first program division to create a module, and holds a second program division in the module with its source description unchanged. An execution process converts the second program division into an executable format at once, if necessary, and executes it while executing the module. This means that the second program division of a module can be executed within the first program division. Consequently, modules can be transferred to other systems. In a program processing method according to the present invention, when a module is created, a portion which will be required after the module is transferred to other system is appended to the module. This permits creation of a module executable on other system to which the module is transferred. Figure 1 is a flowchart showing a compilation mode in a conventional database program processing system; Figure 2 is a flowchart showing a compilation mode in a conventional database program processing system; Figure 3 is an explanatory diagram of a compilation result of an example shown in Figure 5 using a conventional system; Figure 4 is a flowchart showing a portion for executing database processing in a conventional program processing system; Figure 5 shows an example of a program for explaining the present invention and a conventional program processing system; Figure 6 shows an embodiment of a program processing system for explaining a program processing apparatus according to the present invention; Figure 7 is a flowchart showing a compilation editing process of a program processing method according to the present invention; Figure 8 is a flowchart showing first and second compilation processes of a program processing method according to the present invention; Figure 9 is an explanatory diagram of a compilation result of an example shown in Figure 5 using an embodiment of the present invention; and Figure 10 is a flowchart showing an execution process of a program processing method according to the present invention. Embodiments of the present invention will be described in conjunction with Figures 6, 7, 8, 9, and 10. Herein, a program shown as an example (Figure 5) of a database processing program used for explaining the prior art will be used to explain the operations. Figure 6 is a block diagram of a program processing system according to the present invention. 100 denotes an operating system (hereafter, OS) for controlling compilation editing process of programs or execution of programs and managing by using identifiers source programs, object modules, load modules, and other program-related modules, and data files containing data. 200 denotes a program processor running under the OS to compile and edit programs, and 300, a program executor running under the OS 100 to execute programs. In the program processor 200, 210 denotes a compiler for compiling programs, and 220, a linkage editor for editing programs. 211 denotes a general program compiler, and 212, a database processing compiler for compiling database processing program divisions. In the program executor, 310 denotes a general program executor, and 320, a database processing executor for executing database processing program divisions. 321 denotes a recompiler for recompiling database processing program divisions, and 322, a re-registration unit for registering database processing programs which the recompiler 321 has recompiled, in the OS 100. 400 is an intermediate file which the database processing compiler 212 of the program processor 200 uses. 500 is a file which the OS 100, program processor 200, or program executor 300 uses. Figures 7 and 8 are flowcharts showing a source program compilation procedure of a program processing method according to the present invention. Figure 9 shows a source program representing a compilation result. Figure 10 is a flowchart showing the operation of a database processing request procedure required for executing a database processing program including compiled procedures. In Figure 7, 600 denotes a compilation editing process which the program processor 200 executes. 610 is a compilation process in the compilation editing process, and 620, an editing process. In Figure 8, 611 denotes a first compilation process in the compilation process 610, and 612, a second compilation process. In Figure 10, 700 is an execution process which the program executor 300 executes. In Figure 5, 1 indicates a source program, and 2, a first program division expressed in a first programming language. In this case, the first programming language is a general-purpose programming language X. 3 indicates a second program division expressed in a second programming language. In this case, the second programming language is a database processing language Y. Next, operations will be described. When a source code of a database processing program is entered, a program processor 200 operates to compile the program as shown in Figures 7 and 8. First, the operation starts at a step 4. At a step 5, a counter i whose value is provided as a relative database processing procedure identifier which is exclusively for the compilation is initialized to -1. The system is provided with the counter i which is valid exclusively during the compilation period, and generates relative identifiers. Every time a procedure is created, the counter is incremented by 1 to provide a different relative procedure identifier. Next, it is determined at a step 6 whether a source file to be compiled still resides. If it resides, processing A shown in Figure 8 is executed at a step 7. The processing A comprises a first compilation process 611 and a second compilation process 612. The first compilation process 611 compiles a first program division to create a first object module. The second compilation process 612 compiles a second program division to create a second object module, and provides the first object module with a call statement for referencing the second object module by using an identifier assigned to the load module of a program. That is to say, the processing A starts up at a step 14, and determines at a step 15 whether an element to be processed still resides. If the element does not reside, the A returns to the caller at a step 25. If it resides, the element is read at a step 16. At a step 17, it is determined whether the read element is "exec sql". If the read element is not "exec sql", the element is passed to a general compiler for a general-purpose programming language X, and then is compiled as an X program. Then, the operation is returned to the step 15. If the read element is "exec sql", the subsequent elements ending with "end exec" are identified as a program written in a database processing language Y. At a step 19, this portion is designated as P. Next, the P is compiled to create an actual database processing procedure at a step 20. At a step 21, the i is incremented by 1 to generate a new relative identifier. At a step 22, the procedure is placed temporarily in an intermediate file 400 together with the identifier or the i value. At the next step 23 (appending process), the P is appended as an i-th value of a character string variable, "prog", directly to the source program. At a step 24, a system procedure (getfid()) for getting file identifiers of load modules existent on an OS, an i value of a generated relative procedure identifier, and an address of an i-th element of "prog" are used as arguments to create a description of an X procedure call for invoking a precompiled general-purpose procedure (herein, " sqlexec ") for activating database processing. This description replaces the elements starting with "exec sql" and ending with "end exec". Figure 9 shows an example of a result of converting an example of Figure 5 using the foregoing procedure. In this example, two Y descriptions 3 in Figure 5 are compiled to create procedures having relative procedure identifiers 0 and 1, and are converted to X general-purpose procedure calls, "sqlexec". Finally, at a step 18, the thus-converted general-purpose procedures "sqlexec" are compiled as X program descriptions by an X compiler. The aforesaid operation continues until no element is found in the source file. Eventually, the operation is returned to the caller at a step 25. When the operation is returned, the compiled result of the general program division of the source file is stored as an object module in a file by the X-compiler. The compiled result of a database processing division is placed in the intermediate file together with the relative identifier i. The source description of a database processing division is contained in the object module. In addition, information indicating whether any error is detected during the compilation is held. After that, the operation returns to a step 8 shown in Figure 7. It is determined whether an error is detected during compilation of the source file. If an error is found, database processing procedures registered so far are all invalidated. At a step 9, the whole compilation procedure terminates with an error. At this time, since the database processing procedures have not been registered in the system, it is unnecessary to execute a procedure for deleting database processing procedures from a system. If no error is found, the operation returns to the step 6. Then, the next source file is handled. When a compilation process 610 terminates as described above, the program processor 200 passes the operation to a linkage editor 220. The linkage editor 220 edits first object modules of general program divisions to create a load module, and registers the module as a file in the OS 100. The linkage editor 220 also registers a second object module in the database processing procedure registration area so that the second object module can be referenced by using an identifier assigned to the load module. The operation of the linkage editor 220 will be explained in conjunction with an editing process 620 shown in Figure 7. When a compilation process 610 is complete, an editing process 620 link-edits object modules of a general program division. As a result, load modules of the general program division are created and placed in a file 500. When the load modules are registered in the OS 100, the OS 100 assigns uniquely-identifying file identifiers to the load modules. The identifiers may be, for example, names of the load modules or numbers assigned to the load modules. Any lexical unit can be used as identifiers as far as modules can be defined uniquely within the system. However, the identifiers must be referenced by the aforesaid system procedure, "getfid()", for getting file identifiers. If an error is detected in the process of creating a load module, the whole compilation procedure terminates with an error at a step 13. At this time, database processing procedures have not been registered in the system. Therefore, it is unnecessary to execute a procedure for deleting database processing procedures from the system. When the linkage editor terminates normally, the database processing procedures placed in the intermediate file are registered with procedure identifiers I in the system by using the file identifiers which have been already assigned by the OS 100 to the load modules and the relative identifiers i which have been used in the load modules. Then, the compilation editing process 600 terminates normally. Next, an execution system for a database processing program compiled as described above will be explained in conjunction with an execution process 700 of Figure 10. A database processing program or a program written in a general X and compiled is executed by a program executor 300. As execution proceeds, when "sqlexec" is invoked, database processing is done based on the logic shown in Figure 10. That is, a system procedure, "getfid()", is evaluated before "sqlexec" is executed, and then the file identifier of the load module existent on the OS is specified as the first argument of "sqlexec". The relative procedure identifier and the address of a source description of a Y database processing procedure area respectively specified as the second and third arguments. "sqlexec" starts execution at a step 27, specifies a combination of the first and second arguments of the three arguments as a procedure identifier I, and then retrieves a database processing procedure having the procedure identifier I as a step 28. At a step 30, it is checked if the retrieved procedure is valid. If the procedure is valid, the procedure is executed at a step 31. Then, the operation is returned to the caller at a step 35. If the procedure does not reside in the system or does reside but has already been invalidated for some reason, a recompilation registration process 710 is caused to operate. The recompilation registration process 710 obtains a source description P specified in the third argument from its own load module at a step 32, and then dynamically recompiles the source description P as a Y description to recreate a valid database processing procedure at a step 33. The procedure is registered in the system at a step 34, and then is executed at a step 31. In the past, the recompilation has been executed by retrieving a source description P from a database processing procedure registration area. This has made recompilation possible within the same system but impossible after a source description is incorporated into any other system. However, in an embodiment according to the present invention, the source description P resides in its own load module. Therefore, the recompilation can be done on any other system. Moreover, when the recompilation result is registered in the system by using the I, execution can be done on the different system thereafter. As explained in conjunction with the embodiment, a file identifier on an operating system of load modules invoking a procedure and an identifier comprising a combination of relative-number values in an application program of a database processing procedure are assigned to each database processing procedure. Since the file identifier of the load module is unique on the OS, overall identifiers of procedures become unique. That is, it is possible to assign unique identifiers of procedures, without assigning unique identifiers by counter values or the like which must be specifically managed in a system. Therefore, repeated compilation of a source program does not consume resources such as counter values. According to the aforesaid embodiment, a file identifier on an operating system of load modules of an application program and an identifier comprising a combination of relative-number values in the application program of a database processing procedure are assigned to a database processing procedure written in a database processing language. It is possible, therefore, to assign unique identifiers of procedures only to a finally produced load module, without consuming resources such as counter values, even if a source program is compiled repeatedly. In addition, the produced database processing procedure can be stored in an intermediate file temporarily, and then be registered in a system after normal processing of a general program division and other divisions has been terminated and confirmed. It is possible, therefore, to reduce contention among object-time procedure retrieval, and compile-time procedure registration and deregistration, and hence to improve system performance. Furthermore, in the embodiment, there has been explained a database program processing system in which, if a load module is transferred to another system, a source program of a database processing division is held in the load module corresponding to a general program division, the load module is executed on a destination database processing system, a database processing procedure corresponding to a database processing procedure registration area on the destination database processing system is retrieved by using an identifier of the database processing procedure. If no database processing procedure resides, the program of the database processing division in the load module is dynamically re-compiled and is newly registered in a database processing procedure registration area of a destination system by using a file identifier of a destination load module and relative numbers of the database processing procedure. Then, the database processing division is rerun. Thus, a user need not recompile a database application program, and can implant a database processing application merely by moving the load modules. Procedure identifiers defined as described above are used, and source program descriptions of database processing are held in a load module, not in a system, so that the load module is executed on a destination database processing system, and a database processing procedure corresponding to a database processing procedure registration area on the destination database processing system is retrieved by using the defined identifiers of the database processing procedure. If no database processing procedure resides, the program of the database processing division in the load module is dynamically re-compiled and is registered in a database processing procedure registration area of a destination system to further continue execution of the database processing division. Thus, a user need not re-compile a database application program, and can implant it only by means of the load module. In this case, the identifier of the database processing procedure is not a counter value or the like but a file identifier of the load module produced during execution on a system under which the application program is running. Therefore, the uniqueness of database processing procedures can be guaranteed. In the aforesaid embodiment, a file identifier and a relative identifier i are used in combination as a procedure identifier I, and then the procedure identifier I is assessed to retrieve a database processing procedure (second module). If only one database processing division 3 written in a database processing language is present within a source program 1, or database processing divisions 3 are integrated at one point within a source program, the relative identifier i may not be used. In this second embodiment, the database processing procedure (second module) can be retrieved by assessing the file identifier. In the aforesaid first embodiment, a source program 1 is written in a general-purpose programming language and a database processing language. Other programming languages will also do. A third embodiment, in which a source program comprises a first program division written in a first programming language and a second program division written in a second programming language, will also have the aforesaid advantages. A third program division written in a third programming language may be existent.

Claims: A system for compiling and executing a program (1), the program including a first program division (2) written in a first programming language and a second program division (3) written in a second programming language, the system using an operating system (100) for managing modules (500) by using identifiers and for controlling execution of the modules characterizing by comprising: (a) a program processor (200) including: (i) means (210,211,212) for compiling (18,20) the program to produce, from said first program division and said second program division, a first module (X,18) and a second module (Y,20), and for obtaining an identifier assigned by the operating system (100) to the first module, and (ii) means (220) for registering (12,34) the second module by also using the identifier assigned by the operating system (100) to the first module; and (b) a program executor (300) including: (i) means for executing said first module, (ii) means for retrieving the registered second module by also using the identifier assigned to said first module while executing said first module, and (iii) means (300) for executing said second module. The system of Claim 1, wherein said second module is assigned an identifier (I) which is also dependent upon the identifier of the first module, and said means for retrieving retrieves the registered second module by using the identifier assigned to said second module. The system of Claim 1, further comprising: means (210,211,212) for providing said first program division with reference information (getfid()) for referencing said second module by also using the identifier which was assigned to the first module when compiling the first program division; whereby said means (220) for registering registers said second module so that said second module can be referenced by also using the identifier assigned to said first module as provided by said reference information (getfid()). The system of Claim 1, further comprising: means (210,211,212) for compiling (18) said first program division to produce said first module (X), means (prog[i]) for holding said second program division in the first module; and means (300) for executing said first module, and means for converting (710) said second program division into an executable format while executing (700) said first module. The system of Claim 1, further comprising: means (210,211,212) for compiling (20) the second program division to create said second module (Y), means (220) for editing the program so as to replace the second program division with a unique identifier (I) to the second module, means (210,211,212) for appending (23) the program with a third program division written in the first programming language and designated in the first programming language as a constant (prog[i]) and representative of the second program division, and means for compiling (18) said edited and appended program to produce an executable module (X). The system of Claim 1, further comprising: means (210,211,212) for appending (23) the program with a third program division written in the first programming language and designated in the first programming language as a constant (prog[i]) and representative of the second program division; and means (210,211,212) for compiling (18) said first and third program divisions, as a program division in the first programming language, to produce an executable module (X). The system of Claim 1, further comprising: means (210,211,212) for compiling (20) the second program division to obtain said second module (Y); means (210,211,212) for replacing (24) the second program division in the program with information (sqlexec()) written in the first programming language and having a first identifier (getfid()) relative to the program; means (210,211,212) for compiling (18) the program in the first programming language to obtain a load module (X) to which a second identifier (i) is assigned by an operating system; means (220) for registering (12) the second module by using a third identifier (I) comprising the first and second identifiers. A method for compiling and executing a program (1) including a first program division (2) written in a first programming language and a second program division (3) written in a second programming language, characterized by the steps of: compiling (18,20) the program to produce from said first program division and said second program division of said program a first module (X,18) and a second module (Y,20), obtaining (getfid()) an identifier assigned to the first module by an operating system, registering (12,34) the second module by also using the identifier assigned to the first module; and executing said first module, retrieving the registered second module by also using the identifier assigned to said first module while executing said first module, and executing said second module. The method of Claim 8, wherein the identifier assigned to the first module by the operating system is an identifier used by the operating system during execution of the first module. The method of Claim 8, wherein the identifier (I) assigned to the second module includes a procedure name (getfid()) which is executed to obtain the identifier used by the operating system during execution of the first module. The method of Claim 8, wherein the second module is stored in an intermediate file (400) during compilation, and wherein the second module is registered (12,34) after compilation of the program. The method of Claim 8, wherein said second module is assigned an identifier (I) which is also dependent upon the identifier of the first module (getfid()), and further comprising the step of retrieving (29) the registered second module by using the identifier assigned to said second module. The method of Claim 8, further comprising the steps of: providing said first program division with reference information (getfid()) for referencing said second module by also using the identifier assigned to the first module obtained by compiling the first program division; compiling (18) said first program division to produce the first module (X), and for obtaining (getfid()) the identifier to the first module from the operating system; and registering (12,34) said second module so that said second module can be referenced by also using the identifier assigned to said first module as provided by said reference information (getfid()). The method of Claim 8, further comprising the steps of: compiling (18) said first program division to produce said first module (X), holding (prog[i]) said second program division in the first module; executing said first module, and converting (710) said second program division into an executable format while executing (700) said first module. The method of Claim 8, further comprising the steps of: compiling (20) the second program division to create said second module (Y), editing the program so as to replace the second program division with a unique identifier (I) to the second program module, appending (23) the program with a third program division written in the first programming language and designated in the first programming language as a constant (prog[i]) and representative of the second program division, and compiling (18) said edited and appended program to produce an executable module (X). The method of Claim 8, further comprising the steps of: appending (23) the program with a third program division written in the first programming language and designated in the first programming language as a constant (prog[i]) and representative of the second program division; and compiling (18) said first and third program divisions, as a program division in the first programming language, to produce an executable module (X). The method of Claim 8, further comprising the steps of: compiling (20) the second program division to obtain said second module (Y); replacing (24) the second program division in the program with information (sqlexec()) written in the first programming language and having a first identifier (getfid()) relative to the program; compiling (18) the program in the first programming language to obtain a load module (X) to which a second identifier (i) is assigned by an operating system; and registering (12,34) the second module by using a third identifier (I) comprising the first and second identifiers.

Inventors: FUSHIMI SHINYA, FUSHIMI, SHINYA, C/O MITSUBISHI DENKI K.K.
Applicants: MITSUBISHI ELECTRIC CORP, MITSUBISHI DENKI KABUSHIKI KAISHA
Application year: 1992
Main classification: G06F9
IPC codes: G06F9, G06F12