JPS5890248A - Inter-program control shifting system - Google Patents

Abstract

PURPOSE:To enable the mutual calling-out between a program of interpretation executing language and a program of compiling language, by shifting the control to the latter program on the basis of the request information given from the former program. CONSTITUTION:A described sentence 130 is provided to use newly a program 200 of the compiling type programming language to a program 100 of the interpretation executing type programming language. The information block necessary for the program 200 is produced by the sentence 130, and the control is shifted to the program 200. The control is then shifted again to a program 300 described by the interpretation executing type programming language by means of a described sentence 200 within the program 200.

Description

[Detailed description of the invention]

(Field of Application of the Invention) The present invention relates to an inter-program order movement control method between an interpreted and executed programming language and a compiled programming language. (Prior art and its problems) In recent years, Jl'On, T11. AN (
Ii'0rlnulaTranslator), PL/
1 (1) rngram in language
gel) and other programming languages are popular, but the first programming language is still able to arrange the sentences written based on the language specifications in the same way. The corresponding ilN is converted into machine language for the child computer so that it can be directly executed by the ' machine, and later '
r1℃ child computer directly executes processing J1! There are many things that can be confused. In this way, the program sentences are arranged in the relevant city. A programming language that involves processing that involves converting it into machine language for child computers is called a compiled programming language. Compiled programming languages are not used for large-scale problem solving, and are often used by people with specialized knowledge of 'r11' and child computers. On the other hand, there is an interpretive programming language that allows computer users to easily program and immediately run the program to obtain the answer.
(A programming language
) and BASIC (Beginner' S Al l-
purposeSyml)olic In5truct
ion C0de) languages are representative languages. Interpreting and executing programming languages do not convert the sequence before the written program statement into machine language for the child computer, but once convert it into a sequence of data strings depending on each computer. Usually, this sequence of data strings is an intermediate word (intermediate l, anguage).
The process of generating this intermediate word is called the interpretation phase process. Next, through execution phase processing that sequentially executes the generated intermediate words, the combinations of the written program sentences are processed. Note that the execution phase process is a process that depends on the capacity of each computer. Such interpretive and executable programming languages are often used for creating small-scale programs of 100 lines or less, and when computers are used by people who are not specialized in computers, and are convenient. By the way, using an interpreted programming language, 1
As small-scale programs of about 00 lines or less are created one after another, it is often desirable to combine a group of these small-scale programs and develop them into a program with more expanded functions. At this time, this small-scale program is called a sub-program or sub-routine. Furthermore, sub-
Some programs are written in the same language specifications, so it is often difficult to use them, and it is often desirable to use subprograms written in other programming languages. in particular,
From a program in an interpretive programming language
This method uses subprograms written in compiled programming languages such as OILT, A, and N. There are many subprograms written in FOTl, Tn, and AN. , they are interpreter-executable programs TI' candy i

[: If it can be used from the program described above, the effects such as reduction of programming/development man-hours, effective use of sub-programs that were created in the past, and so on are immeasurable. However, at present, it is not possible to use a program written in any compiled language, such as FOR1'I'R5AN'l, from a program written in an interpretive/executable programming language. In particular, if the program has been converted into machine language for the computer (this is called an object program), it cannot be used from a program written in an interpretive programming language. (Object of the Invention) Therefore, an object of the present invention is to make it possible to use a program written in a compiled language such as FOR, TRA, or N from a program written in an interpretive programming language in an interpretive language processing program. conversely, a control method that allows a program written in an interpreted language to be used from a program written in a compiled language, i.e., an execution order between an interpreted programming language and a compiled language. The purpose of this project is to devise a movement control method and provide that control method. Specifically, (1) a new descriptive statement for using a compiled programming language is provided in an interpreted programming language, and (2) a program that executes the descriptive statement is written in a compiled programming language. (3) conversely, from a program written in a compiled language to a program written in a compiled language,
iZj:, when using a program written in
W (where the interpretation/execution programming language is called (, 11)
(4) The processing program generates an intermediate statement for calling the translation-execution type program and transfers control to the execution phase processing of the interpretation-execution type language processing program. By devising an order movement control method between such an execution type programming language and a compiled language, it is possible to connect different types of programming MK74, and it is possible to effectively utilize previously created programs and program The effect of reducing development man-hours is expected. (Example) The present invention will be explained in detail below with reference to an example. Fig. 1 shows a combination of programs made possible by the present invention. , l'l'C A program 200 written in a compiled language using the descriptive statement 130 in the program 100 written in an executable language
Control is transferred to the descriptive statement 220 in the program 200.
This indicates that control is transferred again to the program 300 written in the IQT4 interpretation/execution language. In the figure, numbered arrows between each program 100, 200, and 300 indicate the order in which control is transferred between the programs. In this way, the CA J,LTi"OR,T statement is used as a descriptive statement to call a program written in a compiled language from a program written in an interpreted/executable language. In the example, F Of(,']" R, A N is used as the compiled language.Here, in CALLFORT 5UBF(A, C, 2, I) of statement 130, CALF,Ii"O11,'] 'To call an ORT program using the fd command, '5UBF' is the program name, and the arguments are in parentheses.On the other hand, a program written in the compiled type language 2
This is a description statement 1l-J, a CALL statement, for calling a program written in an interpretation-executable language from 00. This CALL220 is Ii' OTl, 'l' 11
．． This is the CALL statement of the AN program description statement, and CALL EXC (SUBI, WKl, , WK2, 4.
In W), IT:XC' is a control program for calling a program written in an interpreter-executable language from a program in a compiled language (drive). It's called a program. ). Inside () is the argument to the EXC program, the first argument is '5UBI'
means the name of a program written as an interpreter-executable program. In the 2e:1 diagram, program 300 is '5UI
31'. The second and subsequent arguments are arguments to the program 300. Naturally, FOll, TR, A
If you specify another name in place of 'EXC' in the CALL statement in the N program 200 (9), you can call the program that was omitted from the description in FOR'['l(, AN Hyakuame).Similarly, Furthermore, even in a program written in an interpretive language, the program can be called by using the CALL statement.
An example is shown in which a CALL statement 150 is used in place of the ORT statement. In this case, the program 200 in FIG. 1 is not called, but the interpreting and executing language program 300 in which the program 100 was written is called. Note that the processing methods for CALLFO)t, T statement 130, and CALL EXC statement 220 will be described in detail later. FIG. 3 is a block diagram of a processing scheme for interpretive-executable programming languages that includes execution phase processing 3000 of the present invention. The programs 100 and 300 shown in FIG.
It is stored in the program storage file 500, and the intermediate language (:[ntermediate:[
, anguage) is generated for each program (10) Durham and stored in the intermediate 114i program storage file 1500. On the other hand, a program written in a compiled language, in this example, 1i”O
f(, Tl(, Program 300 written in AN language
is stored in the source program storage file 550, and compile processing 1 of
050, an object program is generated that can be converted into the electronic computer machine m1. Here, the machine language of electronic computers is 2 words that can be executed inscribed by 9 electronic computers.
It refers to 13F expanded in the form of base number representation. The generated object program is stored in file 1550. Here, the input to the interpretation phase processing 1000 and the compilation processing 1050 is from the files 500 and 55.
Not only 0, but even if I input the card directly, I don't get II/7. Next, the mantissa intermediate language program and object program are combined by a concatenation process 2000 and stored in an executable program storage file 2500. The file 2500 is used when it is desired to place Fl and execute it in the execution phase process 3000 (11), but it is not necessary when it is executed in the execution phase process 3000 immediately after processing in the concatenation process 2000. The execution phase process 3000 uses the output from the file 2500 or the concatenation process 2000 as an input categorizer to sequentially process intermediate language sequences and machine language sequences. The interpretation phase process 1000 generates intermediate words as shown in FIG. 4 for the descriptive sentences in the individual programs 100 and 300 shown in FIGS. 1 and 2. The intermediate word 110 in FIG. 4 is a general format of four arithmetic operation instructions, including (1) instruction code, (2) additional information, (3) first operand, (4) second operand, (5) and third operand. is configured. The additional information and the meaning of each operand flag are shown in the lower part of FIG. 4. Note that the number at the top of the intermediate word 110 indicates the number of bytes from the beginning of the intermediate word. (12) Intermediate words in Figure 4 are the basic form, and there are cases where one line of descriptive text can be decomposed into multiple intermediate words. For example, the descriptive sentence 120 in the program 100 in FIG. 1 is C=AUSB+2, and when this is converted into intermediate words, it becomes a combination of two intermediate words 111 and 112 as shown in FIG. The intermediate word 111 multiplies the contents of variable name "A" by the contents of variable name "B" and stores the result in the work area (EPLVALI) of the execution phase processing program, which is recognized by the flag of the third operand. The intermediate word 112 represents that 2 is added to the contents of the work area (J (PLVALl)) and the result is stored in the area with the variable name "C". This is a correspondence table between the number and the location of the corresponding intermediate word.The intermediate word of each written statement in a program written in an interpretive language is determined by the format of the intermediate grr and the length of the intermediate word depending on each written statement. Although this is different, an instruction code is always set in the first byte of the intermediate KtF.
) The intermediate language forms of the CALLI"ORT statement and the CALL statement will be described in detail later. FIG. 6 shows each processing unit in the execution phase process 3000. , roughly divided into an instruction execution control unit 400 that controls the execution of each instruction developed into an intermediate language, and an execution processing unit 410 that performs processing based on each instruction code.
10 is Figure 4. The four arithmetic operation processing unit 420 that processes the intermediate word of the four arithmetic operations as shown in FIG. 5, the CALLFOR, T shown in FIG.
Statement 130, RETtJRN statement 320, or CALL
Instruction execution 110 order control unit 4 that processes the EXC statement 220
It consists of 30 etc. The instruction execution control unit 400
A control table as shown in FIG. 7 is created by referring to each intermediate word. Next, control is transferred to each processing section 420, 430, etc. within the instruction execution processing section 410 in accordance with each instruction code. Here, the control table created by the instruction execution control unit 400 is
parameter Li5t), then E
l) LLI8T serves as communication information between the instruction execution control unit (14) 400 and the instruction execution processing unit 4]0. Wl; El in Figure 7),] YoJ, T S i' field names and meanings i'', l: η), as shown in Figure 8. Here, the numerical values shown in Figure η57 represents the byte position (1 byte is 8 bits),
This EPLLIST consists of 48 bytes. FIG. 9 shows the processing of the fib instruction execution control section 400 of FIG. 6 in relation to the instruction execution processing section 410. From the 9th sea, the instruction execution control unit 400 has three locations as operation start locations: start entrance 4o1 (entry + 1), start entrance 402 (entry ≠ 2), and λ start input ITI 403 (entry ≠ 3). be. Start entrance/I (+1.
l(+When starting program execution or FO described later)?
'I' Ii is used when control is transferred from a program written in a compiled language such as the AN language to the jvC parallel programming language. Starting person n40
2 is a determination process 408. Where J'l!
After executing 409, etc., it becomes the starting point when executing the next command. Risk-1 Entrance 4031 (Jl, execution processing unit 4
This is the return entry point from 10 (T5). As the process starts from the start entrances 401 and 402,
By processing 404, the EPT and LIST shown in FIG.
(7) in EPLOI), El) LIADII,. Each field of EPLINST is confirmed, and judgment processing 1 is performed.
At step 405, it is determined whether the command in question is an execution order change command. Here, the execution order change commands are CA, LLFOT (, T statement, I of the descriptive statement 330 in the program 300) of the descriptive statement 130 used in the program 100 in FIG. CAL of 150 descriptive sentences
L statement, etc., and the instruction code is X'90 in hexadecimal notation.
' (X means hexadecimal representation.) This is an intermediate word. In cases other than execution order change commands, the remaining fields of EPLLIST shown in FIG.
PLLIST is delivered. In the present invention, it is possible to call a program written in the Konno-Iru type language from a program written in the Interpretation-Execution-type language Ktt, or conversely, to call a program written in the Konno-Iru type language (16). It is a control method for calling a program written in an executable language.j
'l'r interpretation execution type word*/FT 17) CALLI”O
l(, '[' sentence (descriptive sentence 130 in Figure 1), I?, I bow 'J' U T1.N sentence (descriptive sentence 320 in Figure 1), C
A L :r, sentences (descriptive sentence 150 in Figure 2), etc. become execution order change instructions, and the instruction codes (values set in EPL OP) in those intermediate words are expressed in hexadecimal, respectively. X'AE', X'9F'. It becomes X'9E'. Therefore, in the processing of the instruction execution control 400, the determination process 1! of FIG. ! After 405,
The processing will be carried out immediately. Each description M below
' The control transfer processing method between itts will be explained. First, a processing method for when a program written in a compiled language is called from a program written in an executable language, that is, to transfer control to a program written in a compiled language will be described. We will use FOR and TRAN, which are typical compiled languages. As mentioned earlier, this is done using the CALLFORT statement (17) of the descriptive statement 130 in the program 100 shown in FIG. 1'8'j m in the CALLFORT statement 130 is the first
The intermediate word 114 shown in FIG. This CAL
In the LFOll and T statements, there are four arguments to the FORTRAN program name '5UBF', and the intermediate word consists of a total of 28 bytes. In intermediate language 114,
The 1st byte of the 0th byte is an instruction code corresponding to the CALLFORT statement, and X'AE' is set in hexadecimal representation. The first byte represents the number of arguments. 12th by two bites from the second bite to the third bite groove
Indicates the method for storing the address of the argument after the byte. This is called an argument flag, and bit position 0
Each bit up to bit position 15 corresponds to each argument. The length of the argument flag is 2 bytes if the number of arguments is 16 or less, and 4 bytes if there are 17 or more.
If there are 33 or more, the number increases to 6 bytes. The meaning of the argument flag is ``o'' if the content of the argument area of the intermediate word indicates an address, and ``1'' if the content of the argument area indicates an argument value (18). Therefore, in descriptive sentence 130, there are four arguments, and the third argument is not a variable name but a direct numerical value, so the number 2 is entered in the corresponding argument area of the intermediate word, and the argument flag is AlsoX'0200'
(The second bit counting from the PRO bit is l", which means that the argument value is stored in the η1, 3rd argument area.) The address of the program drive routine is stored in 4 bytes.The address of this drive routine is W (F
01L'l' f(, A In the three cases where the compiled program of N is called, the program 450 in FIG.
The address of the internal entry point \CA L F 0111T 451 is stored, and when an interpretation execution type program is called from a compiled program of FOR, TlLAN (described later), the address of the entry point EXCR 453 is stored. Note that in this example, F 011. T II, AN
The target is I'L/1 and COBOL (C
OmmOn 13uissinessQriented
1. (19
) All you have to do is enter this address and praise it. Entrance point 452 (EXC) and entry point 453 in program 450
The usage of (EXC 几) will be described later. 4 bytes B, FORTll, ANF from the 8th byte of intermediate word 114
It shows the address where the program '5UBF' 200 exists, and the 12th and subsequent bytes are the argument area. The instruction execution control unit 400 in FIG. 6 executes the processing routine in the execution processing unit 410 using EPLLIST as a parameter, that is, CALLII'011. The processing flow diagram when control is transferred to the instruction code processing routine of the T statement is shown in Figure 1.
Shown in Figure 1. From FIG. 11, processing 1 starts from the fourth byte of the intermediate word 114 to the address (α
. ) and execute ft7 to the program at that address value.
1J? ! l-Transfer. When a compiled language program is called from an interpretation/execution language Ktf program, processes 2 to 10 are selected. Process 2 is to secure a save area for general-purpose registers in the electronic calculation area for communication between F O1(, 'I' I(, AN programs), and the save area is shown in FIG. 12 (20). It can be configured with 72 bytes as shown in Figure 12.
70 is ¥CAI, FOI1. Indicates the save area secured by the T program 450, and the area 480 is 1;'OR,TJ
? It represents the save area for the AN program 'S UH, l'i'.The area 470 secured by the processing FJ!
When control is transferred to 5UI3F', that 'SU]3
The F' program saves the registers in the order of the register numbers shown in FIG. 12, and the existence of the save area is \CALFOILT program 4 shown in FIG.
'5U from 50 to register number 13 (abbreviated as R13)
The i3F' program 200 is informed. From process 3 to process 7, FOIl, 'J"11.AN
Parameter list l-(P
The format of the parameter list is shown in FIG. 13. From Figure 13, one entry in the parameter list consists of 4 bytes, and entries for 1161 arguments are created, and the first byte of the last entry is expressed in hexadecimal as X'80'.
It is meant that the final parameter is (21
) Taste. The existence address of this parameter list is \
CALLFO1 (, T program 450 to 'SUM' program 200 with register number 1 (abbreviated as R, 1)
be informed. Note that the intermediate word 114 is determined by the determination process 5.
When the number of arguments in is zero, register number 1 (R
, 1) by zeroing out the contents of '5UBF1
Tells the program that there are no arguments. Process 6 is the argument flag of the intermediate word 114 shown in FIG.
and parameter list 46 by checking the argument area sequentially.
It establishes the content of 0. Specifically, the corresponding bit of the argument flag is checked in correspondence with the argument, and (1) If it is indicated in the address value (B'0')', the contents of the argument stored in the intermediate word are added to the parameter list. stored in each entry. In other words, β'1. in the intermediate word 114 in FIG. β′1. β′4 is a parameter
It is stored in the corresponding entry in the list. (2) If the constant value (B'l') is indicated, the address of the relevant argument area in the intermediate language 114 is stored (22). That is, the address α of the argument 3 area in the intermediate language 114 in FIG. 10 is all stored in the entry in the parameter list. Process. Through the above process 6, the relationships between each IJ and each argument in the parameter list (PA, RMLIST) 460 in FIG. 10 are as shown by arrows 461 to 464. Processing 7 is T! ``OI(, T It, AN program'
When returning from 5UBF '200, address calculation for the next intermediate word to be executed is performed. Processing 8 is Ii'011. of '5UBF'. This is a process to transfer control to the TJLAN program 200, and the sub program existence address (α/,) indicated by 4 bytes from the 8th byte of the intermediate word 114 is stored in register number 15 (abbreviated as R15). Then, the return address from the sub program 200 is set in register number 14 (abbreviated as 11 and 14), and control is transferred to the sub program. Control can be transferred by branching to the address of the contents of register number 15. As mentioned above, T;'01(,TI
(, Inter-program control transfer in AN program (2)
3) How to use the time register? il - shown in FIG. Please refer to the following publication for details on the communication rules between nologograms, including how to use this register. "11 ■TAC VO82/VO33 optimization l"01 (
, '1' I(, AN Ushikawa User's Guide) Hitachi, Ltd. Sanmeizu Tatami 8080-3-208 Also, this embodiment describes the method of transferring control to the F Of(, T I(, AN program). Although it is necessary to transfer control to a program written in assembler if it conforms to this rule, it is also possible to transfer control to a program written in assembler.
' OL(, T b, description in language other than AN - ei' =
Even when transferring control to a program, the program drive routine to be performed in accordance with the command in figure 1 is
It is difficult to create the AhFORT program instead of 4500. Once again in Figure 11, the execution form of the program changes from the operating mode in which intermediate words are interpreted and executed sequentially to the sequence of electronic dividers (gf).
This means that the operation mode is switched to an operation mode that is directly executed. (24) Proguzino 200 of 1i"OLL'l'H,AN is executed 161 tangently by the surface 1 child i-i calculator, and 1,1
I (J > TUfl, N sentence 230 in the figure, town bijl
il) The control returns to step 9 of the 111th step 1. The address at which the next intermediate word of the phantom, interpretation-executable program is executed in process 9 is EPLL, T S 'I shown in FIG.
After setting E1)L NA D It in `` and setting necessary flags, the process returns to the start entry 403 in the execution control unit 400 in step 11!10. Therefore, the processing program of the interpreter-executable language (execution phase department! When viewed from the town, CALLFOH,
F OI (, T R,
1, CA, T, LPOR for AN program 200 etc.
, it can be considered that the T-sentence Metropolitan Ordinance is being processed. Naturally, compiled programs at ten types, such as FOR, T1. It is possible to call a similar compilation type lf4 program from an AN program. Next, a control method when an interpretation/execution type 1ftF program is called from a compiled type M program will be described. An example of this usage is shown in FIG.
This occurs when the interpreter-executable language program 300 is called from 20. In the F OR1' I(, AN program, a CALL L statement calls a program called EXC, and the program 'EXC' becomes the processing program for control transfer. Among the arguments to the EXC program, the first As mentioned above, the argument is the program name of the interpreter-executable language program.The "EXC" program is \CALF' shown in Figure 10.
at an entry point 452 within the ORT processing program 450;
The operational concept line of this program is shown in Fig. 15. EXC”
The program controls the interface between the compiled language and the interpreted/executable program, and performs the following processing. (1) Programs in compiled languages, such as F
ORT) It performs processing based on communication rules from the LAN program, specifically, register saving processing and parameter list reception processing. (2) Based on the parameter list 465, create the intermediate word 115 (26) of the CALL statement in the interpretation/execution language. (3) CAI the next instruction of middle 1iiJ#fi 115
JLJI"OJ(, Create intermediate word 11G of T statement, address of program drive routine ';r-"J":
Restart point in “XC” program “EXCIji453
shall be. ('I) Middle 1'rt1%'+ 115 no CA L
Start entry 4 in the execution phase process/100 as the execution address of the L statement (r lIl'r interpretation execution language)
0 Transfer i17 control to J. (5) Locate the j: intermediate word 115 in the execution phase process 400, and execute the corresponding CA, LL instruction (instruction code: X'
Control is transferred to the liquor processing program in the execution processing unit 410 of 9E'). Note that the processing method of the cAIJL instruction will be described later. (6) A program written in an interpretation/execution language (in this embodiment, the program 300 in FIG. 1) is sequentially interpreted and executed. (7) 11 of glograms written in an interpretive-executive language,
E T U It, N sentence (description sentence 320 in the present example TE-+ program 3oo) or the real YAN ADS-DO J,! I
! Execute by 3000 and (3) generate /c
CA, LLFO+1. T(27) Instruction I:I-I start 1167%0. (8) CALIJ”01 (, intermediate word 116 of Tkaryo
, the address of the program drive routine is "EXC", the restart address of the program "E"
X(Jt"(α".), and in the processing flow diagram of the CALLFORT command shown in FIG. 11, processing 11
．． 12 is selected. (9) EXCR,”U at entry point 453,”E
The registers retired by the processing at the "XC" entry point 452 are recovered, and the program returns to the program written in the compiled language, that is, the program that called the "EXC" program once. By devising a program, it is possible to transfer control from a compiled-type program to a program written in the tactile-type language flat, and return the written version. Ru. FIG. 16 shows a processing flow diagram of the EXC" program entry point 452.
When 0 calls this "EXC" program (28), various information is stored in the register shown in FIG. 14, so the contents of the register are saved in the area shown by register 13. That is, referring to FIG. 12 which shows the relationship of save areas, area 470 is an area secured by the called program, and area 480 is an area secured by the called program. Therefore, processing 1
5, the contents of the register are saved in the area 470, and the contents of the register are saved in the area 48.
Allocate a new 0. Note that the newly secured area for register saving is different from the area secured by the ¥CALF'On and T programs described above. Also, I!
;XC” program entry point 452, EXCR” entry point 4
53 and ¥CALri”Oll, T program entry point 45
1 exists within the same program 450, but there is no particular need for this. This is ¥C
A],,F' 01(,T program is (rfli
(This is because the register save area and the register save area secured by the program at the EXC program entry point are different. However, the register save area secured by the program at the EXC program entry point and the
It is better to use the same program (29) as the "CR" program entry point. In process 16, register 1 (R1
) points to the parameter list fPAI(, MLI 8T
) CAL as shown in intermediate language 115 based on 465
A relationship is established in which the L sentence (municipal ordinance code: X'9E') is shown by the production arrow group 466. Note that if the contents of register 1 are zero,
That is, if the parameter list does not exist, the argument area (from the 8th byte) of the intermediate word 115 is not generated. The format of the intermediate word of the CAT, L sentence will be described later. Process 17 is CALFOI(, T statement (instruction code: X'
AE') Intermediate language 116 is generated, and compared to the intermediate language 114 shown in FIG. 10, the number of arguments is zero, the argument flag is ), but \CALFOI is not the T entry point 451, but the address of the EXC 几" entry point 453, and the storage area (8th byte to 11th byte) of the address where the sub program exists is zero. It is a characteristic. "EXC" program entry point 452 (processing flow (30)
) The figure was generated in Figure 16) (,'ALLJI'OJ(
, in the intermediate word 116 of the 'l' statement, the address (α".) of the program drive routine is set to the address of the EXCI+," entry point 453, and the "EXC"
Il, "The processing of the entry point 453 is) Takeshaku execution type I Plt,
Compilation from processing of a program written in j
Performs the process of transferring control to the program written in I1 Kaname. EXC11, " Entrance point location] ψ flow shown in Figure 11, Processing + tx1. Location: r++>12. 1 in Processing 11
:, Process 15 at the "EXC" entry point restores the contents of the hacksaw register, and Process 12 is the process of returning to the program written in the compiled language. Since the return destination address is set in the register 14 as shown in FIG. 14, control can be transferred to the address of the contents of the register 14. Next, interpret execution l-1! The method of transferring control between programs written in languages will be explained. This is ``E
Intermediate language 115 created at XC'' program entry point 452
This is because the program being called is written in an interpretable language. (31) In general, all the writing methods shown in Figure 2 are used to communicate between programs written in an interpretive/executable language. The intermediate words corresponding to descriptive sentences 150, 310, and 320 in FIG. 2 are intermediate words 117, 118, and 117, respectively. IH). In the intermediate language 117, the second byte is the instruction code corresponding to the CAI, L statement, which is X'9E' in hexadecimal notation.
becomes. Rabbit: 1 byte 1] represents the number of arguments, and the second
The two bytes from the byte to the third byte are the argument hook. The argument flag indicates how to store the argument area in the intermediate word, and how to use it is as described above for CALL
FOll is the same as the intermediate word argument flag of the T sentence. That is, from bit position O to bit position 15 of the argument flag
Each bit in the trench corresponds to each argument, and if the content of the argument area indicates the address of a variable, it will be “0”.
”, and if the content of the argument area indicates the substance of the argument, it becomes 1”. For example, in the example of the descriptive sentence 150, the third argument is a literal take, and the value 2 is entered in the argument area of the intermediate word 117. (32) Therefore, the argument flag is X'2000 in hexadecimal notation.
' becomes. The length of this argument flag is 2 bytes υ if the number of arguments is 16 or less, and 4 bytes if there are 17 or more.
Bytes, increases to 6 bytes when 33 or more. Furthermore, the "EXC" program entry point 45 shown in FIG.
All bits of the argument flag of the intermediate language 115 generated in step 2 are always 0''. The 4 bytes starting from the 4th byte of the intermediate language 117 indicate the location of the subprogram, that is, the program 300 to be called. The address (α,) where the descriptive sentence 310 exists is stored.The 8th and subsequent bytes become the argument area, and one argument per 9
4 bytes are reserved. M[j-; In the example of Is statement 150, the argument lli! The number of ifs is 4, the argument area is 16 pies), the basic part of the CALL instruction is 8 bytes, and the total length is 24 bytes, which is the intermediate KI+117. FIG. 18 shows the processing section 43 in the instruction execution processing section 410.
It is necessary because it shows the processing procedure of the CALL instruction regarding 0. As shown in FIG. 18, the process 20 stores the address of the intermediate word 118 on the program side (33), which is later used to calculate the execution value. Also, by processing 21, 5UBROUTINE in FIG.
The address of the @1 argument in the intermediate word 117 of the CALL statement is stored in the intermediate word 118 corresponding to the sentence 310, and the arrow 12
The first relationship is broken. Determination process 22 is a process of checking the consistency of the number of arguments between the calling program and the program on the called side, and if there is a mismatch, processes 23 to 26 are performed. This can be done with error handling. Judgment process 27 checks whether the number of arguments can be equal to zero, and if the number of arguments is zero, process 28.
29 is selected. 5UHRO[JTIN
E-sentences 310 writers 10 master sentences can be executed. If the number of arguments is 1 or more, processes 30 to 32 are selected. Processing 30 converts the contents of the argument areas in intermediate words 115 and 117 (34) of the CALL statement shown in FIGS. 15 and 17 to the argument area in intermediate word 118 corresponding to 8 in the argument area is the intermediate word 1 of the CALL statement.
This is done by checking the argument flags in 15 and the intermediate word 117. That is, each bit of the argument flag corresponds to each argument,
If the bit indicates (1) address value (B'O')Q, the content indicated by that value is stored in the corresponding argument area in the intermediate word 118. For example, the content pointed to by β1 is γ1 to the variable, and that γl is 4 from the 8th byte in the intermediate word 118.
Store in bytes. (2) If it indicates a constant value (B"11"), store that value.For example, the bit value of the argument flag corresponding to the third argument of Kouma Tori 117 is Ll'l'. The value of 2, which is necessary for the value of , β, is the argument 3 in the intermediate word 118
Area (bytes are stored in the first area, processing is performed. Here, if a collection of multiple data strings such as array data is specified as an argument, A If)
The duty bit value (35) of the argument flag in N4j 115, 117 is one with B'l', l131(, OtJ'l'I
The starting address of the array data is entered in the argument area in the intermediate language 118 of the NE statement, and as a result, the array data in the program 100 can be referenced from the program 300 in FIG. On the other hand, 200 programs written in a compiled language
(See Figure 1) to J (11) When a program written in the interpretive language is called, the "EXC" program 452, which is a program drive routine, intervenes (15 (see figure), this "15X
C'' program 452 is the intermediate language 115 shown in FIG.
is generated, and the argument flags at this time are all bit values "0"
”. Therefore, when passing array data as a variable from the program 200 written in a compiled language to the program 300 written in an interpreted language, FO)i, TH, AN accent is used. Report IPTR=AD
]))(, (ARAY(I)) function call,
Variable name I P'J"
t, A. First storage address k Mt-N of Y:
This is a function to Referring again to FIG. 18, the SUI:IR, OUT. The iNE statement 310 will be written. Each descriptive statement in the program 300 in FIGS. 1 and 2 is executed, and the descriptive statement 320 1 (, 1 sound: "J' U 11.
When an N statement is encountered, a process is performed to control the program execution order and return the entire program 300 to the program that called it. Descriptive sentence 320 n. The intermediate word of the E T U rLN sentence is as shown in intermediate word 119. That is, the 0th byte of the intermediate word 119 is it,l:TUIl. The instruction code X'91+1 of the N instruction is stored, and the first byte is zero. The address of the intermediate word 118 of the SUBIL01J'l'INE statement 310 is set in the four bytes from the second byte to the fifth byte I]. FIG. 19 shows the processing procedure for the RETURNm command regarding the processing (37) in the instruction execution processing unit 410. By processing 35, the address (α
1) and locate 118 intermediate words. Processing 36 is processing for setting the address Kl of the argument area of the program that called the own subprogram 300. If the number of arguments is zero according to determination process 37, processes 38 and 39 are selected. In process 38, the start address of the argument area obtained in process 36 (PTI (, 3) total 1 cPL
By storing it in EPLNADR in LIST, it is possible to return to the descriptive statement next to the descriptive statement that called this program 300. If the number of arguments is not zero, process 40 to process 42
is selected. The process 40 calls this program sequentially based on the information in the argument area in the intermediate language 118 [...candy 11
5 and the intermediate language 117 are moved to the argument area. At this time, check the corresponding bit of the argument flag in the intermediate word of the CALL instruction, and if it is indicated in (1) address value (H'O')', the corresponding bit in the intermediate word 118 of the called program side is checked. (38) Move the information in the argument area to the area indicated by the contents of the argument area of the intermediate language 117 on the called 10-gram side. For example, argument 1 of the 8th byte in intermediate Nit 118
The area whose content is indicated by the content of the 8th byte of the intermediate word 117, that is, β. It will be moved to the address. (2) If a constant value (13'l') is indicated, processing is performed without moving the information in the relevant argument area within the intermediate language 118. In the above processing, the entire argument area of intermediate language 117 is pointed every time one argument is processed.
TJl, 3 is transformed by 4. Therefore, process 4
After repeating the above processing argument several times within 0,
11 has ended and here it is! /I 1 when moving to 1
' T1.3 is to locate the next intermediate word of the CALL statement that is required by the HI statement statement that called this subprogram 300. Processing/11. ．． 42 is the same process as process 38゜:15), and the next descriptive statement after the descriptive statement that called the Kizab program 300 can be executed; From program 300 in Jiji 2 to (39) program 100. Control will return I+1. On the other hand, from program 200 to program 300 in FIG.
1. flj control is transferred to the intermediate word 116 next to the intermediate word 1150 shown in FIG. 15, and as mentioned earlier, by executing the intermediate word 116, "
EXCII, ``The processing at the program entry point 453 is completed, and as a result, control is returned to the program 200 written in the compiled language.As explained above, according to the present invention, Between the written program and the program written in the compiled layer one-store programming language,
By providing a control system that allows two standing programs to call each other's program statements, the following effects can be expected. (1) It can be used from a compiled-type name-ame program that has been created in the past. (2) Programs in interpreted and executed languages can be used from programs in compiled languages. (40) (3) Due to (1) and (2), it is expected that the number of man-hours required for program development will be reduced.

[Brief explanation of drawings]

Figure 1 shows the interpretation-execution type word trr! A diagram showing an example of using a combination of a program written in N1 and a program written in compiled language.
Figure 3 is a diagram showing the processing procedure from interpretation to execution of a program sentence in the execution type programming implication, Figure 4 is generated when all the descriptive sentences in the program sentence are written. Figure 5 shows the general format of an information block called an intermediate word.
Figure 6 shows an example of the instruction execution process.
Figure 7 shows the structure of the execution processing section.
'A diagram showing the format of the communication information block between the T control section and the execution processing section, Figure 8 shows the complete contents of the communication information block,
Figure 9 shows the processing procedure of the instruction execution control unit, and Figure 10 shows the format of the CALLFOH, 'l' statement expanded into intermediate words and the parameters used in the processing program. 41) A diagram showing the relationship with the list, Figure 11 is CALLFOR
Figure 12 is a diagram showing the processing flow of the T instruction.
Figure 14 shows the format of a parameter list, Figure 14 shows the contents of registers used when communicating between programs written in a compiled programming language, and Figure 15 shows the format of a compiled programming language. A diagram showing the format of the intermediate language generated by the interface program when a program in an interpreting/executing language is called from the program. Figure 16 is a diagram showing the processing flow of the interface program, and Figure 17 is the interpreting/executing language. A diagram showing the relationship between intermediate words of program communication description sentences in a type language,
FIG. 18 shows C A L J in the instruction execution processing section,
, a diagram showing the processing procedure of a statement, FIG. 19 is a diagram showing the processing procedure of 2 H, ETIJRN, or
Demeru. Agent Patent attorney Toshiyuki Usuda (゛(42) f] zu Minyu 4 Figure 5 Ward 4ρθ Fungus 7 Figure 1 Figure 3 Figure 1 // Figure 4 balls ≧ /-N N N~ GCALF PATROO
AXC scale: Processing of the knee
//U-color (Tamunsu Z cold story 20 pieces) 1
Lutosista's Uchihibi friend f interim record ql light H pay 3 470 barrels,? (pTg4
“E・” Excx-Ei 4
FAFMLLSTl
tl'-7゛o7"taa! 3 5 Ino 1 Seventh Girl Nnoi 3D Rimachi and lma tD
し・→'n-Ycs e Beg for FARMLIST, Fuyusho T Iku and 351 Season'I7, 77 and 輯・<'(6. fJψto'100 holes PARMLIS
TI = present qP. This is 4 mouths νL7 7rrR4-r=roADR"4"t 8 (d, 1 傅7 this poem book 2 D rim
Navel, -7Tzu-7F No.I07・N4 將蒲7ζ°", Y7"7'07'tA (9 12 Figure ■ Force /: 5 Figure t θ 17r-375Ro τo) 74 b mouth TJ+g Fig.-323- r sword tq Fig.

Claims (1)

[Scope of Claims] 1. Between a program that operates an electronic cash machine written in an interpretive programming language and a program that operates a child computer written in a compiled programming language, (1) (2) An interface program that operates the information block intervenes to transfer control between the two programming languages. (3) When transferring control from a program written in an interpreted programming language to a program written in a compiled programming language, a program written in a compiled programming language is required based on request information from the program written in the interpreted language. (4) when transferring control from a program written in a compiled programming language to a program written in an interpreted programming language; is based on request information from a program using a compiled programming language.
(5) generating information blocks and instructions for control transfer suitable for transferring control between programs in an interpretive programming language; and (5) interpreting and executing the generated instructions. (6) transfer the control of descriptive statement execution to the program written in (6) by the return command statement from the program to which control has been transferred, and transfer the control of descriptive statement execution to the program that called the program and performed iLI. Control movement method between programs.