JPH0820961B2 - Expression analysis processing method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Outline] In program translation, when one expression includes the other, such as the relationship between a logical expression, a character expression, and an arithmetic expression, the analysis processing of the expression is performed. , Speed up the processing by separating and simplifying for each type of expression.

[Industrial applications]

The present invention relates to an information processing system, and more particularly to an expression analysis processing method in a source program translation processing system.

[Conventional technology]

For example, in order to execute a source program written in a language such as an assembler on a computer, it is necessary to perform a translation process in a macro processing unit of the assembler and convert it into an object.

In the translation process, the expression in the source program is first decomposed into elements to identify the operators and operands that make up the expression. Next, the expression is analyzed and edited into a form that is easy to handle, and if it can be operated, the operation is executed, then converted into a code and output.

For example, in the case of the arithmetic expression A + B * C, the multiplication of B and C is executed first, and the result is edited into two operations for adding A. Generally, the analysis result is represented by using an intermediate information format such as 4-tuple (yutsumi) data for each operator type.

 Expression shows the analysis result of the example of the arithmetic expression described above.

The first item of each 4-set is an operator (OP), and the second and third items
Each of the items indicates the operand, and the last item indicates the storage location of the operation result. In the above example, the result of B * C is
stored in t _1, the result of A + t ₁ is stored in the t _2.

 Next, the expressions in the source program will be described.

The expressions include arithmetic expressions, character expressions, and logical expressions. Arithmetic expressions are described by addition, subtraction, multiplication, division, and exponentiation arithmetic operators and operands. The arithmetic operators are +,
It is represented by-, *, /, **.

Character expressions are used to represent examples of characters. For example, the character expression C (A, B) represents a substring of length B starting from the Ath character of the character variable C.

A logical expression represents a logical operation between two operands, and logical operators AND, OR, NOT, EQ, GE, etc. are used. Where AN
D, OR, NOT represent AND, NOT, and NOT operations, respectively, and EQ is an operation that returns true when the values of the left and right terms are equal, GE
Represents an operation that returns true when the left term is not arithmetically less than the right term.

Logical expressions can take other logical expressions, character expressions, and arithmetic expressions as operands, and character expressions can take other character expressions and arithmetic expressions as operands.

 In other words, there is an inclusive relation represented by logical expression ⊃ character expression ⊃ arithmetic expression among logical expressions, character expressions, and arithmetic expressions.

 Here is an example of a character expression containing an arithmetic expression:

(A + B * C) 'ABC' (A + B, C-D) Here, A + B * C, A + B, C-D included in the character expression is an arithmetic expression, and'ABC 'represents a character expression. The character expression'ABC 'indicates that the ABC enclosed in quotation marks (') is the ABC of the character string, not the variable ABC, and the right term (A + B, C-D) of the character string is the substring of the character string. The start position is A + B and the length is CD, and the left term of the character string represents the number of repetitions of the character string (substring). For example, (1 + 2 * 3) 'ABC' (3-1,3-2) means that 3-2 = 1 characters from the 3-1 = 2nd character of the character string ABC are repeated 1 + 2 * 3 = 7 times. are doing. The result of this calculation is BBBBBBB.

 Next, examples of logical expressions including character expressions and arithmetic expressions are shown.

((IA + IB) GE (IC-ID) OR (CA (IE * IF, IG / IH) EQ
'ABC') This logical expression is two logical expressions (IA + IB) GE (IC-ID) and CA (IE * IF, IG / IH) EQ that are connected by the OR operator.
It consists of'ABC ', and the logical expression on the left side consists of two arithmetic expressions IA + IB and IC-ID that are connected by the GE operator. In addition, the logical expression on the right is the two character expressions CA that are combined by the EQ operator.
It consists of (IE * IF, IG / IH) and'ABC '. Of these, the character expression on the left contains two arithmetic expressions IE * IF and IG / IH. In the entire logical expression, it means that IA + IB is larger than IC-ID, or if the character string of the IG / IE length starting from the IE * IF character of the character variable CA is ABC, it is true.

By the way, in the conventional source program translation processing, the expression analysis is performed collectively in one analysis processing unit without distinguishing logical expressions, character expressions, arithmetic expressions, etc. in advance. Etc. are sequentially processed while recognizing.

The type of expression can be identified by a statement in the program to be analyzed. For example, in an assembler, the types of expressions that can be described in each sentence are defined by a grammar as follows, and thus each type is recognized using this grammar. That is, it has been clarified prior to this processing to which type the entire expression belongs.

SETA instruction: Arithmetic expression SETB instruction: Logical expression SETC instruction: Character expression AIF instruction: Logical expression [Problems to be solved by the invention] In conventional expression analysis processing methods, various expressions such as logical expressions, character expressions, and arithmetic expressions are used. Since it analyzes all expressions in one processing unit, it is necessary to support all kinds of expressions.
For example, since all the operators such as +,-, *, / ,, AND, OR, ... are checked, the dictionary or table required for analysis becomes large, and the time required to look up the dictionary or table becomes long There was a problem that was slow.

[Means for solving problems]

The present invention speeds up processing by providing analysis processing units independently for each type of expression and reducing the analysis processing function of one processing unit when an inclusion relation is established between a plurality of types of expressions. Is intended.

 FIG. 1 shows the basic configuration of the present invention.

In the figure, 10 is an expression analysis processing unit, which analyzes expressions in the source program.

Reference numeral 11 is a formula distribution control unit for the inputted formula,
The three types of expressions, the first type expression, the second type expression, and the third type expression, which have an inclusive relationship, are identified, and the processing is instructed to the expression analysis unit of the corresponding type.

Reference numerals 12 to 14 denote formula analysis units of the first type, the second type, and the third type, respectively. Here, it is assumed that there is an inclusive relation of the first type expression ⊃ the second type expression ⊃ the third type expression between the expressions. However, the number of types of the first, second, and third equations is an example, and the number of types is not limited to three.

A common processing unit 15 performs processing independent of each expression analysis unit.

16-1 to 16-3, 17-1, 17-2, 18, and 19 are call information.

[Action]

In the configuration shown in FIG. 1, the expression distribution control unit 11 determines that the input expression is
It is determined which of the first type, the second type, and the third type it belongs to, and according to each type, the corresponding expression analysis unit is called via the call information 16-1 to 16-3 to analyze the expression. Ask.

For example, when the first type expression analysis unit 12 is called,
The first type expression analysis unit 12 executes a first type expression analysis process for the input expression.

However, if the expression includes an expression other than the first-type expression, for example, the second-type or the third-type expression, as elements, the corresponding call-expressions 17-1 and 17-2 are used. Request the processing to the analysis unit.

Similarly, when the called second type expression analysis unit 13 detects an element other than the second type expression during the analysis, the calling information 18 is used to request the third type expression analysis unit 14 for processing.

When the third type expression analysis unit 14 is called, the third type expression analysis process is performed on the requested expression. When a process other than the third type expression analysis process is required, the call information 19 is used to request the common processing unit 15 to perform the process.

In this way, by making the analysis functions of the first type expression, the second type expression, and the third type expression that are in the inclusive relationship independent, and allowing them to be called from a higher level, individual expression analysis processing is simplified. It

〔Example〕

FIG. 2 is a block diagram of a program translation processing system according to an embodiment of the present invention.

In the figure, 20 is a source file in which a source program is stored, 21 is a program translation processing system, 22 is an expression analysis processing section, 23 is an expression distribution control section, 24 is a logical expression analysis section, 25
Is a character expression analysis unit, 26 is an arithmetic expression analysis unit, 27 is a common processing unit, 28
Is an intermediate information storage unit, 29 is 4-group data, and 30 is an object file in which an object program is stored.

There are three types of expressions to which this embodiment is applied: a logical expression, a character expression, and an arithmetic expression, and between these expressions, there is an inclusion relation of logical expression ⊃ character expression ⊃ arithmetic expression. There is.

Therefore, the first type expression analysis unit 1 shown in FIG.
2, the second type expression analysis unit 13 and the third type expression analysis unit 14 correspond to the logical expression analysis unit 24, the character expression analysis unit 25, and the arithmetic expression analysis unit 26 of FIG. 2, respectively. Next, the operation of the expression analysis processing unit 22 will be described.

The expression distribution control unit 23 examines an expression in the source program extracted from the source file 20, and includes operators such as +, −, *, /, ', AND, OR, ... And parentheses included in the expression. , The operator is analyzed to analyze the basic syntax of the expression, and the cutout of the expression that is the unit and the type of the cutout expression are identified. Then, it is distributed to the expression analysis unit corresponding to the type of expression according to the order of calculation. That is, when the logical expression is identified, the logical expression analysis unit 24 is called to request the processing. Similarly, when a character expression and an arithmetic expression are identified, the character expression analysis unit 25 and the arithmetic expression analysis unit 26 are called to request processing.

Further, when the logical expression analysis unit 24 is called and a character expression or an arithmetic expression is detected in the element of the logical expression being analyzed, the character expression analysis unit 25 or the arithmetic expression analysis unit 26 is called for processing. Request.

When the character expression analysis unit 25 is called and an arithmetic expression is detected in an element of the character expression being analyzed, the arithmetic expression analysis unit 26 is requested to perform processing.

The logical expression analysis unit 24 need only have the identification and analysis function of only logical operators, and similarly, the character expression analysis unit 25 and the arithmetic expression analysis unit.
26 only needs to have a discrimination function and a parsing function between a character expression operator and an arithmetic operator, respectively.

The common processing unit 27 is responsible for independent common processing that cannot be processed by the above-described expression analysis units 24, 25, and 26.

Each expression analysis unit 24, 25, 26 edits the analysis result in a fixed-length 4-tuple data format and stores it in the intermediate information storage unit 28. The call of each expression analysis unit from the expression distribution control unit 28, or the call between the expression analysis units is performed according to the calculation order, and when the processing at the call destination is completed, the processing is returned to the calling source. For this reason, the order of the 4-group data stored in the intermediate information storage unit 28 also follows the operation order.

At that time, the unary operation form as shown in FIG. 3 (a) is obtained by inserting additional information to obtain the binary operation form 4 shown in FIG. 3 (b).
Converted to group data.

Further, the polynomial operation type as shown in FIG. 4 (a) is converted into a binary operation type 4-group data chain format as shown in FIG. 4 (b). The order of chaining is based on the evaluation order of expressions. Where OP, OP ₁ , OP ₂ , ..., OP _n are operators, T ₁ ,
T _2, ..., T _n Section _{(operand), R 1, R 2,} ..., R n represents a result information.

Next, as a specific example of the intermediate information creating process, the case of the above-described logical expression is shown below. Note that T1 to T8 represent temporary areas for storing the results.

After that, execution of operations and generation of objects are performed based on each operation.

In this way, by storing all of the results as intermediate information of fixed-length data, it is possible to simplify the address calculation when evaluating (executing an operation) expression and shortening the processing time.

The present invention is intended for the parsing processing based on the grammar for the three types of expressions in the program. Therefore, description of the semantic analysis for checking whether or not the expression has meaning in processing is omitted here. Therefore, if a meaningless expression such as an expression composed of a logical product of a logical expression and a character expression is identified in the analysis of the expression, it is determined as a grammatical error in the semantic analysis.

〔The invention's effect〕

According to the present invention, the expression analysis process in the program translation is significantly improved, and the program translation time can be shortened.

[Brief description of drawings]

FIG. 1 is a block diagram of the principle of the present invention, FIG. 2 is a block diagram of one embodiment of the present invention, FIG. 3 is an explanatory diagram showing an example (part 1) of conversion of an intermediate information format, and FIG. It is explanatory drawing (the 2) which shows the example of information format conversion. In FIG. 1, 10: Expression analysis processing unit 11: Expression distribution control unit 12: First type expression analysis unit 13: Second type expression analysis unit 14: Third type expression analysis unit 15: Common processing unit

Claims (1)

[Claims] 1. A translation processing system for a program including a plurality of types of expressions in which a predetermined inclusion relation is defined in advance between the expression types, and a plurality of expressions for independently analyzing the expressions for each of the plurality of types of expressions. The expression analysis unit (12,13,14) and the expression distribution control unit (11) that identifies the type of expression that appears in the program and requests the expression analysis unit of the applicable expression type for analysis. The expression analysis unit (12,13) at the higher level of the inclusion relation among the plurality of expression analysis units (12,13,14) indicates that the expression type of the expression type at the lower level of the inclusion relation is included in the elements of the requested expressions. An expression analysis processing method characterized in that, when an expression is detected, the expression analysis unit (13, 14) for analyzing the expression of the lower level type is requested to analyze the expression of the lower level type.