JPS62159235A - List processing system - Google Patents

Abstract

PURPOSE:To omit the decision of both a machine word program and a symbolic expression program in a program call mode by interpreting and executing a program written in a symbolic expression via a practicable program written in machine words. CONSTITUTION:A list processing language process system consists of a control part 11, an interpreting/executing part 12, a program 13 written in machine words, and a program 14 written in an S (symbolic) expression. The program 14 contains a program identifier 51 to point out a practicable program 52. Then the program 52 points out a program 53 written in an S expression. The part 11 sets a base register of the program to be called out when executing the program 13 or interpreting/executing the program 14 through the part 12. In such a case, each base address is set for execution of both programs written in machine words and the S expression respectively. In such a way the decision of both machine word and S expression programs can be omitted.

Description

Detailed Description of the Invention [Field of Application of the Invention] The present invention relates to a method for calling and executing a program in a list processing language processing system and an internal structure of the program. Both programs written in S-expression and programs written in S-expression are executable. Conventionally, when calling a program, it is determined whether the program is written in machine language or S expression.1 When calling a program written in machine language, the pace register and return address of the called program are determined. After setting, branch to the relevant program and execute the program, and when calling a program written in S expression, interpret and execute the program written in S expression and the address of the program written in S expression. A method has been adopted in which the pace register and return address of the interpretation execution section are set, and then the program branches to the interpretation execution section and the program written in S expression is interpreted and executed.

Usually, programs that emphasize speed are written in machine language, but the above method has the problem of requiring a determination every time the program is called, which takes time.

[Purpose of the invention]

An object of the present invention is to provide a method that makes it unnecessary to determine whether a program is written in machine language or S expression when calling a program.

[Summary of the invention]

The present invention prepares an executable machine language program corresponding to a program written in S expression, and branches to the interpretation execution part of the program written in S expression via it. A program written in machine language or written in S expression.

This eliminates the need to determine whether the program is a program that has been executed, and allows both programs to be called in the same manner.

[Embodiments of the invention]

An embodiment of the present invention will be described below with reference to the drawings.

FIG. 1 is a block diagram of a list processing language processing system showing an embodiment of the present invention, in which the control section 11゜interpretation execution section 1
The program consists of 13 programs written in 21 machine language and 14 programs written in S expression.

The program 13 written in machine language and the program 14 written in S expression are in a mutually callable relationship, and can also call themselves. The interpretation execution unit 12 is a part that interprets and executes a program written in S expression.

Next, FIG. 2 shows a structural diagram of a program written in machine language. A program 22 written in machine language is pointed to by a program identifier 21.

The program identifier 21 is, for example, the name of the program 511, and its definition is the program 2 written in machine language.
It points to 2.

FIG. 3 shows a configuration diagram of a program written in the conventional S expression. A program 32 written in S expression is pointed to by a program identifier 31. Like the program identifier 21 in FIG. 2, the program identifier 31 is, for example, a program name, and its definition points to a program 32 written in S expression.

Conventional methods in which the control section 11 shown in FIG. 1 executes a program 13 written in machine language using the flowchart shown in FIG. We will explain how to do this. first,
1! Obtain the program definition from the II identifier (step 10
1) Determine whether the program definition is written in machine language or S expression102) If the program is written in machine language, set the pace register for the program written in machine language. 103), set the return address 104), and branch to the machine language program (10
5) Run the program. In the case of a program written in S expression, set the address of the program written in S expression 106), set the base register of the interpretation execution section 107), and set the return address LO 8) - to the interpretation execution section. Branch (109) Interpret and execute the program 6 FIG. 5 shows a structural diagram of a program written in S expression as an embodiment of the present invention. program identifier 5
1 points to an executable program 52, and the executable program 52 points to a program 53 written in S expression. The program identifier 51 is 1, for example, a program name.

Executable program 52 is written in machine language.

The contents of the executable program 52 will be explained using the flowchart of FIG. First, the address of the program written in S expression is set (step 201), the pace register of the interpretation execution section is set (202), and the process branches to the interpretation execution section (203).

The flowchart in FIG. 7 shows the program 13 in which the control unit 11 in FIG. 1 is written in machine language when the structure of the program written in the S expression shown in FIG. A method of interpreting and executing the program 14 written in S expression using the interpretation execution unit 13 will be explained.

First, the pace register of the program to be called is set (step 301), the return address is set (302), the program is branched (step 303), and the program is executed. The pace register set (301) of the calling program is the base address of the calling program if it is written in machine language, or the reason for the program written in S expression as shown in Figures 2 and 5. This is because both the program 22 written in machine language and the executable program 52 are pointed to by the program identifier 21.51, and both are written in machine language.

Conventional program calling method FIG. 4 and the present invention (7)
Comparing the program calling method in FIG. 7 as an example with the case of calling a program written in machine language, it is found that the parts corresponding to steps 101 and 102 in FIG. 4 are deleted in FIG. has been done. Also, considering the case of calling a program written in S expression,
The processing corresponding to steps 106, 107, and 109 in FIG. 4 is performed in step 2 of the executable program shown in FIG.
01°202.203 respectively. In this case, branch to the executable program once (Step 3 in Figure 7).
03), branch to the interpretation execution section (step 203 in Figure 6).
), there is one more branch than in the case of the program call written in the S expression in FIG. 4, but the processing in steps 101 and 102 in FIG. 4 is deleted.

According to this embodiment, since it is possible to call a program without determining whether the program to be called is written in machine language or S expression, it is possible to call a program written in machine language. This has the effect of reducing call time.

〔Effect of the invention〕

According to the present invention, at the time of calling, it is determined whether the program is written in machine language or in S expression, that is,
Step io1 in FIG. , 102 are no longer necessary, which has the effect of reducing program calling time.

[Brief explanation of drawings]

Figure 1 is a block diagram of the list language processing system, Figure 2 is a structural diagram of a program written in machine language, Figure 3 is a structural diagram of a program written in conventional S representation, and Figure 4 is a diagram of the conventional program. Flowchart showing the program calling procedure, FIG. 5 is a structural diagram of a program written in S expression as an embodiment of the present invention, FIG. 6 is a flowchart showing the contents of the executable program of FIG. 5, FIG. 5 is a flowchart showing a program calling procedure when FIG. 5 is implemented. , 100 3 Figures 4 Figures

Claims (1)

[Claims] Programs written in machine language and S expressions (Symbolic Expressi)
On a processing system that can execute both programs written in S expression, the program written in S expression is interpreted and executed via an executable program written in machine language. , a list processing method characterized in that it is not necessary to determine between a program written in the machine language and a program written in the S expression.