JPH01147624A - Language processing system - Google Patents

Abstract

PURPOSE:To ensure the similar actuation to a compiler type language processing system at the processing carried out by a program and to shorten the processing time by starting an interpreter part at the sequential processing carried out by a command and to start an object code generating part at the processing carried out by a program respectively. CONSTITUTION:An input source program undergoes the analysis of the syntax structure through an intermediate code generating part 1 and is converted into an intermediate code of a reverse polish notation, a tree structure, etc. A decid ing part 6 counts the units divided by the ODH (carriage return) contained in a character string of an input intermediate code. Then the part 6 decides the sequential processing carried out by a command when said counted value is equal to 1 and starts an interpreter part 3. Thus the part 3 interprets and carries out the intermediate code. While the part 6 decides the processing carried out by a program in case the character string of the input intermediate code contains plural units divided by the ODH. Thus the part 6 starts an object code generating part 4.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to a language processing system that can perform sequential processing using commands and has a fast execution time.

[Conventional technology]

In general, language processing systems can be broadly divided into two types: interpreter type and compiler type. Figure 4 is a block diagram showing an example of an interpreted language processing system, and (1) converts the input source program into intermediate code such as the reverse Borland notation shown in Figure 6 or the tree structure shown in Figure 7. (2) is an intermediate code storage memory that stores the intermediate code generated by the intermediate code generation unit (1); (3) is an intermediate code storage memory that stores intermediate code for each instruction from the intermediate code storage memory (2); Enter
This is an interpreter section that executes the intermediate code while interpreting it.

Figure 5 is a block diagram showing an example of a compiler-type language processing system. (1) is a block diagram showing an example of a compiler-type language processing system. An intermediate code generator that converts into code,
(4) is an object code generation unit that converts the intermediate code generated by the above intermediate code generation unit (1) into a machine language object code, and (5) stores the object code generated by the above object code generation unit (4). This is object code storage memory.

Next, the operation will be explained.

In the interpreter-type language processing system shown in Fig. 4, the manually generated source program is generated by the intermediate code generator (1
), reverse Borland notation (Figure 6) and tree structure (Figure 7)
It is converted into intermediate code such as, and the intermediate code storage memory (
2).

Next, each instruction is read from the intermediate code storage memory (2) and executed while being interpreted by the interpreter section (3).

Therefore, although the interpreter type allows sequential processing of one instruction at a time, it takes time to interpret the intermediate code during execution.

On the other hand, in the compiler-type language processing system with the configuration shown in Figure 5, the input source program is processed by the intermediate code generator (1).
) and the reverse Polish method (Fig. 6) and the tree structure (Fig. 7).
The object code generator (4) then converts the code into a machine language object code that can be directly executed by a computer, and stores it in the object code storage memory (5). At runtime, the computer directly executes the object code.

Therefore, the compiler type stores it in memory in the form of a machine language object code that can be directly executed by a computer, so the execution time is fast. However, since object code is required for execution, sequential processing of one instruction at a time is not possible.

[Problem that the invention seeks to solve]

Since the conventional interpreter-type language processing system is configured as described above, there is a problem in that the execution time is slow because interpretation time is required to interpret the intermediate code at the time of execution. On the other hand, a compiler-type language processing system directly executes object code, so the execution time is fast, but there is a problem in that it cannot perform sequential processing using commands.

The present invention was made to solve the above-mentioned problems, and an object of the present invention is to provide a language processing system that has a fast execution time and can perform sequential processing using commands.

[Means for solving problems]

A language processing system according to the present invention is a language processing system that operates specific hardware according to a command string or program given by an operator, and generates intermediate code by parsing the command string or program given by the operator. an intermediate code generation unit that generates an intermediate code, an interpreter unit that interprets and executes the intermediate code, an object code generation unit that converts the intermediate code into a machine language object code, and an object code storage memory that stores the object code; The system is equipped with a determining section which sends a start signal to the interpreter section when a command string is given by the operator, and sends a start signal to the object code generator when a program is given.

The apparatus has a determining section that determines whether sequential processing is performed by commands or by a program, and includes an interpreter section for sequential processing using commands, an object code generation section for program processing, and an object code storage memory.

[Effect]

The determining section in this invention activates the interpreter section to perform sequential processing when given a command string, and activates the object code generating section to execute program processing when given a program.

(Example) Hereinafter, an example of the present invention will be described with reference to the drawings. 1st
In the figure, (1) is an intermediate code generator that converts the input source program into reverse Borland notation (Figure 6) or tree structure (Figure 7), etc., and (3) is an intermediate code generator that converts the input source program into reverse Borland notation (Figure 6) or tree structure (Figure 7). An interpreter section that interprets and executes the code, (4) an object code generation section that converts the intermediate code into a four-word object code when processing the program, and (5) the object code generation section (4). This is an object code storage memory that stores generated object codes.

Therefore, (6) is a judgment unit that starts the above-mentioned interpreter unit (3) when performing sequential processing using commands, and starts the above-mentioned object food generation unit (4) when performing processing using a program. ) has a built-in counter that counts the units of character strings delimited by carriage returns in the input character string, and when the count value is 1, it sends a start signal to the interpreter section (3), and when it is 2 or more At this time, an activation signal is sent to the object code generation section (4).

Next, the operation will be explained with reference to FIGS. 2(a) and 3(b) and FIG. The input source program is parsed by the intermediate code generator (1), and as a result is converted into intermediate code such as reverse Borland notation (FIG. 6) or tree structure (FIG. 7). Next, the judgment unit (6) counts the units delimited by 0D)l (carriage return) in the input intermediate code character string and steps S in FIG.
1), when the count number is 1 (FIG. 2(b), step S2 in FIG. 3), it is determined that sequential processing is performed by commands, and the interpreter section (3) is activated (step S3 in FIG. 3). ). Based on this, the interpreter section (3
) interprets and executes the above intermediate code.

In addition, when there are multiple units delimited by ODH (carriage return) in the character string of the manually generated intermediate code (steps S1 and 52 in FIG. 2(a) and FIG.
) is determined to be a program-based process, and the object code generator (4) is activated (step 54 in Figure 3).
. Based on this, the object code generator (4) converts the intermediate code into a machine language object code that can be directly executed by a computer, and converts the intermediate code into a machine language object code that can be directly executed by a computer.
5).

Therefore, since the object code in memory is directly executed during execution, the execution time is fast.

(Effects of the Invention) As described above, according to the present invention, the interpreter section is activated during sequential processing by a command, and the object code generation section is activated during processing by a program. Since it operates in the same way as a language processing system, the processing time is fast, and by activating the interpreter section, it is possible to perform sequential processing using commands.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of a language processing system according to an embodiment of the present invention, FIGS. 2(a) and (b) are explanatory diagrams showing an example of the determination method of the determination unit according to the present invention, and FIG. Flowchart of judgment, Figure 4 is a block diagram of a conventional interpreter type language processing system, Figure 5 is a block diagram of a conventional compiler type, Figure 6 is an explanatory diagram showing an example of reverse Borland notation, and Figure 7 is a block diagram of a conventional interpreter type language processing system. FIG. 2 is an explanatory diagram showing an example of a tree structure. (1) is intermediate code generation section, (2) is intermediate code storage memory, (3) is interpreter section, (4) is object code generation section, (5) is object code storage memory, (6) is judgment section . In each figure, the same reference numerals indicate the same or corresponding parts.

Claims (2)

[Claims] (1) In a language processing system that operates specific hardware according to a command string or program given by an operator, an intermediate code generation unit that generates intermediate code by parsing the command string or program given by the operator; , an interpreter section that interprets and executes the intermediate code, an object code generation section that converts the intermediate code into machine language object code, an object code storage memory that stores the object code, and a command string given by an operator. A language processing system comprising: a determining section that sends a start signal to the interpreter section when a program is given, and sends a start signal to the object code generator when a program is given. (2) The determination unit includes a counter that counts units of character strings delimited by carriage returns in the input character string, and when the count value is 1, it sends a start signal to the interpreter unit, and 2 2. The language processing system according to claim 1, wherein in the above case, an activation signal is sent to the object code generation section.