JPH05150999A - Structuralization processing system for computer language - Google Patents

Abstract

PURPOSE:To easily perform control by enabling fast processing even by an interpreter system or a one-line compilation system when the structuralization processing of programming language for an industrial computer is performed. CONSTITUTION:A next time line index table 3, an intermediate language index table 4, and a machine language index table 5 are provided for program control, and a this time line pointer 1 and a next time line pointer 2 are operated by which the table positions of them are designated. When input is performed from a program, values are set on the tables 3. 4, and 5 sequentially, and corresponding program codes are set on an intermediate language area 6 and a machine language area 7 designated by the tables 4 and 5. However, the classification code of each text is set on the forefront of each area of the intermediate language area 6. When the program is executed, initial values are inputted to the pointers 1, 2 first, thence, it is decided whether or not a corresponding text shows the target of block structuralization. When it is not the target of block structuralization, the corresponding text is executed, and pointer update processing is performed.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a structured processing method for a real-time programming language of an industrial computer, and more particularly to a structured processing method for supporting a block structured statement.

[0002]

2. Description of the Related Art Programs for industrial computers are often written in a high-level language such as real-time BASIC so that a manufacturer can easily design them. However, since a computer can actually understand and execute a machine language, a program in a high-level language must either be translated and processed by an interpreter or processed once by a compiler and then executed. Will be done. However, in recent years, it is common to adopt a one-line compilation method that has the advantages of both interpreter and compiler expressions and processes one line at a time in consideration of work efficiency. On the other hand, in the case of BASIC, the program is “IF-THEN-EN
DIF "," DO ~ LOOP "," SELECT ~ E
"ND SELECT", a part of condition setting and execution contents corresponding to "~" is structured into a block structure, stored in a predetermined area and searched for in execution processing, and "GO".
There is a style in which the line number "○○○" of the non-block structure statement in which the execution content is written such as "TO ○○○" is specified and the line is jumped to that line number. Usually, these are mixed and used. There is.

[0003]

However, in a conventional computer language, when executing a block structure during execution of a programming language, an interpret or 1
Since it is necessary to transfer control to the inside or outside of the block structure between line-compilation units, such as lines, the corresponding block must be searched while sequentially recognizing the block structure at the time of execution, so "GOTO" Compared to the non-block structure part that uses a sentence, it takes more time to process and is inconvenient in practice. FIG. 4 is a flowchart showing an example of an execution process for a non-block structured statement, and FIG. 5 is a flowchart showing an example of a conventional execution process for a statement including a block structure. And 51 and 52 in the figure
The process indicated by is a particularly troublesome part. The present invention has been made in view of such problems, and enables high-speed processing even with an interpreter type or 1-line compile type programming language, and while making the best use of these advantages, the next line and the corresponding structural statement It is an object of the present invention to provide a structured processing method of a computer language that facilitates and speeds up the control of data.

[0004]

Means for solving the above-mentioned problem in the present invention is to store a high-level language corresponding to condition setting and execution contents in a block structure and store it in a predetermined area. In the structured processing method of the computer language to be searched, the next-row index table that specifies each row of the high-level language to be executed next, the intermediate language index table in the process of translating the high-level language into the machine language, and the execution processing are used. A machine language index table and a row index pointer of this time and a row index pointer of the next time, and when the control shifts to a block structure statement, the pointer is operated according to the position of the beginning, inside or end, and the control is performed on the next line. When migrating, only the next row index table is used, and the structural statement of the same nesting level or end is used. Are by structuring processing method of a computer language to search machine language index table using both next row index table and the intermediate language index table when search.

[0005]

The present invention provides an area having a table structure and a pointer for controlling the execution of a program in an industrial computer. The area is a table for designating the next row and an actual program (intermediate language or machine language). And a table that specifies. Similarly, the area and pointer of the table structure are also prepared for the block structure statement, and when the control is transferred to the block structure statement, the area and pointer of the block structure statement are set according to the positions such as the beginning, the inside, and the end of the block structure. Operate and operate the table that specifies the next row when transferring control to the next row. It is not necessary to investigate the position of the next line. When a block structure statement corresponding to the same nesting level or the end of the block structure is found, the table pointing to the next line and the table pointing to the intermediate language of each line are operated to perform a high-speed search.

[0006]

Embodiments of the present invention will now be described in detail with reference to the drawings. FIG. 1 is an explanatory diagram of an embodiment of the present invention. In the figure, 1 is the current row index pointer,
2 is the next row index pointer. In the present invention,
For program control, a next-row index table 3, an intermediate language index table 4, and a machine language index table 5 are provided, and the pointers 1 and 2 are operated to specify the table positions. At the time of program input, values are set in each table 3, 4, and 5 in the order of input. Further, the program code corresponding to the intermediate language area 6 and the machine language area 7 designated by these tables 4 and 5 is set. However, the classification code of each sentence is set at the beginning of each area of the intermediate language area 6. When executing the program, first, initial values are input to the index pointers 1 and 2. This time row index pointer 1
May have an initial value of "0", and the next-row index pointer 2 points to "0-th" in the next-row index table 3. Next, it is determined whether or not the corresponding sentence is a target for block structuring. If it is not a block structure sentence, the corresponding sentence is executed and the pointer updating process described later is performed. For the block structure statement, the nest pointer (STP) 21 and the structure table 22 shown in FIG. 2 are prepared,
The nest pointer 21 points to the position of the structure table 22. When the control is applied to the beginning of the block structure statement, the nest pointer 21 is advanced by "+1" to change the structure table 22.
Enter the type of block structure sentence in the TYP field.

Here, the types of block structure statements are as follows.

(1) Repeated sentence; "DO" sentence at the beginning,
Start with a "DO WHILE" statement or a "DO UNTIL" statement, and insert the same exit level statement as "EXIT D"
"O" sentence corresponds, and the end is "LOOP" sentence, "LOOP"
It ends with a "WHILE" statement or a "LOOP UNIL" statement.

(2) Condition judgment sentence; "IF to THE" at the beginning
Start with N "statement, the same nesting level statement is" ELSE "statement or" ELSE IF "statement, and ends with" END IF "
Ends with a sentence.

(3) Branch statement; the beginning is "SELECT C
Start with the "ASE" statement and the same nesting level statement is "CAS"
The E "sentence corresponds and ends at the" END SELECT "sentence.

FIG. 3 is a flowchart of the execution process of the embodiment. In the figure, when it reaches the beginning of the block structure sentence, the first processing is performed according to the type of sentence. When the sentence is a repetitive sentence, the sentence is saved as it is at the current position and the position is registered in the IND column of the structure table 22. In the case of a conditional judgment sentence, the judgment result is F of the structure table 22.
Enter "1" in the LG field. In the case of a branch statement, the data type of the operation result that is the branch condition is input to the TYP column of the structure table 22 and input to the DAT column of the actual data, or the pointer of the PTR column is operated. When the statement is an unconditional repeated statement, the processing at the beginning of the block structure statement does nothing and shifts control to the next line. If there is a condition determination, the determination is performed, and depending on the result, the next row index pointer 2 may be operated to shift the control to the row next to the last row of the same nest level block. In this case, the nest pointer 21 is returned by "-1". If the statement is a conditional statement and the result of the determination is "true", control is passed to the next line without performing anything. When the determination result is “false”, the block structure statement of the same nesting level or the index of the last row thereof is put into the next row index pointer 2. If the statement is a branch statement, control is transferred to the next line without doing anything. Figure 3
In the processing of the same nest level block structure statement,
The second processing is performed according to the type of sentence. In the case of a repeat statement, only the escape statement from the repeat is used, and the nest pointer 21
Is returned by "-1", and the index of the row next to the last row of the block is placed in the next row index pointer 2. In the case of the same nest level block structure statement of the condition judgment sentence, if it is a sentence including condition judgment, the condition judgment is performed and the result is input to the FLG column of the structure table 22. If the determination result is "true", nothing is performed and the control proceeds to the next line. When the determination result is “false”, the block structure statement of the same nesting level or the index of the last line thereof is set in the next line index pointer 2. If the statement does not include the condition determination, nothing is performed as in the case of "true", and the control shifts to the next line. If the statement is a branch statement, it is determined whether the operation result on the structure table 22 is satisfied, and if it is satisfied, nothing is performed and the control is shifted to the next line. If the result is not satisfied, the block structure statement at the same nesting level or the index of the last line is set in the next line index pointer 2. In the case of an unconditional branch statement, nothing is done and control is transferred to the next line. In FIG. 3, the last line of the block, that is, the process at the end is the third process according to the type of sentence. In the case of an unconditional repeated statement, the structure table 22
The designated destination of the index pointer of is set to the next row index pointer 2. If there is a condition determination, the determination is performed, and the designation destination of the index pointer of the structure table 22 is set to the next row index pointer 2 or no control is performed and the control shifts to the next row according to the determination result. In this case, the nest pointer 21 is "-1".
I will put it back. If the statement is a conditional decision statement, the nest pointer 21 is returned to "-1", and control is transferred to the next line without doing anything. Even if the statement is a branch statement, the nest pointer 21 is returned to "-1", and control is transferred to the next line without performing anything.
The current row index pointer 1 and the next row index pointer 2 are updated as follows. That is, (1) the old content of the next row index pointer 2 is set as the new content of the current row index pointer 1.

(2) The next row of the next row index table 3 is set as the new content of the next row index pointer 2.

As a result, it is confirmed whether or not the new content of the current row index pointer 1 is the last line of the program, and if it is not the last line, the flow is repeated, and if it is the last line, the program is ended.

The following effects are apparent in this embodiment.

(1) A programming language that interprets block structure statements or compiles one line enables high-speed processing.

(2) Immediate execution after correction or addition, which is an advantage of the interpreter system or the one-line compilation system, is possible, and debugging can be performed while stopping / restarting the program line by line.

(3) Control to the next line and control to the corresponding block structure statement can be performed easily and at high speed.

[0018]

As described above, according to the present invention, it is possible to perform high-speed processing even with an interpreter type or 1-line compile type programming language, and while taking advantage of these advantages, it is possible to move to the next line and the corresponding structural statement. It is possible to provide a structured processing method of a computer language that facilitates and speeds up control of.

[Brief description of drawings]

FIG. 1 is an explanatory diagram of an embodiment of the present invention.

FIG. 2 is an explanatory diagram of a pointer and a structure table according to the embodiment.

FIG. 3 is a flowchart of execution processing according to the embodiment.

FIG. 4 is a flowchart of execution processing of a conventional example.

FIG. 5 is a flowchart of execution processing of a conventional example.

[Explanation of symbols]

1 ... Current row index pointer, 2 ... Next row index pointer, 3 ... Next row index table, 4 ...
Intermediate language index table, 5 ... Machine language index table, 6 ... Intermediate language area, 7 ... Machine language area,
21 ... Nest pointer, 22 ... Structure table.

Claims (1)

[Claims] 1. A high-level language corresponding to condition setting and execution content is block-structured and stored in a predetermined area,
In the structured processing method of the computer language to be searched at the time of execution processing, the next-row index table that specifies each row of the high-level language to be executed next time, the intermediate language index table in the process of translating the high-level language into machine language,
Machine language index table used for execution processing,
It has a current row index pointer and a next row index pointer, and when the control shifts to a block-structured sentence, the pointer is operated according to the position of the beginning, internal or end, and when the control shifts to the next row, the next row A computer language characterized by using the index table only and searching the machine language index table using both the next row index table and the intermediate language index table when searching for structural statements with the same nesting level or end Structured processing method.