JPH0269832A - Definition operator processing method in expression processing - Google Patents

Abstract

PURPOSE:To easily program a processing characteristic to a user by previously generating a function auxiliary program in which the definition operator characteristic to the user is defined and the processing is mentioned, and outputting the function auxiliary program concerned as an expression processing result when the spelling of the definition operator appears in the processing of the expression. CONSTITUTION:The function auxiliary program 4, in which the definition operator is defined and the processing executed by the definition operator is mentioned, is previously generated. An expression analysis part 12 analyzes an inputted expression language, fetches the spelling of the definition operator, and a definition operator discrimination part 13 detects the function auxiliary program 4 corresponding to the spelling of the fetched definition operator and outputs it as the result of the expression processing. When the expression including the definition operator appears in the expression processing, the processing by the definition operator is developed and the processing characteristic to the user can be programmed by retrieving and detecting the function auxiliary program 4 corresponding to the spelling of the definition operator and storing it in relation to a procedure quotation list.

Description

[Detailed Description of the Invention] [Summary] Definition '/? that performs expression processing of definition operators appearing in expressions. i Operator processing concatenated processing method, a function subprogram that defines and processes a user-specific definition operator is created in advance, and when a weaving of definition operators appears in expression processing, a corresponding function subprogram is created. A function subprogram in which the definition of a definition operator and the processing to be executed by this definition operator are written in advance, with the purpose of outputting the result of expression processing and enabling processing using a definition operator defined by the user. It is equipped with an operator sub-register in which the spelling of the definition operator defined by this function subprogram and an index for associating it with this function subprogram are registered in advance, and the definition operator extracted from the input expression is provided. The system is configured to find a corresponding operator sub-register corresponding to the spelling, and output a binary function sub-program corresponding to the index of the found operator sub-register as the expression processing result of the defined operator.

[Industrial application field]

The present invention relates to a definition operator processing method for processing a definition operator appearing in an expression.

[Prior art and problems to be solved by the invention] Conventional compilers (for example, FORTRAN 77 compilers, etc.) do not allow expressions that perform special processing that the user wants to use.
It was not realized in the form of a defined operator (definition operator). For this reason, when a user frequently attempts to perform processing using a certain formula, there are problems in terms of not only ease of use but also accuracy.

In the present invention, a function subprogram that defines and processes a user-specific definition operator is created in advance, and when a slurry of the definition operator appears in expression processing, the corresponding function subprogram is used as the expression processing result. The purpose is to output and allow processing using defined operators defined by the user.

[Means to solve problems] Means for solving the problem will be explained with reference to FIG.

In FIG. 1, a function subprogram 4 is a program in which definition operators are defined and processing is described in advance.

The expression analysis unit 12 analyzes the input expression and extracts the spellings of definition operators and the like.

The definition operator determination unit 13 finds the function subprogram 4 corresponding to the spelling of the definition operator analyzed and extracted by the expression analysis unit 12.

[Effect]

As shown in FIG. 1, in the present invention, a function sub-program 4 is created in which a definition of a definition operator and a process to be executed by this definition operator are described in advance, and an expression analysis unit 12 The definition operator discriminator 13 finds the function subprogram 4 corresponding to the extracted definition operator's slurp, and outputs it as an expression processing result (for example, associates it with a procedure citation list). (stored).

Therefore, when an expression containing a definition operator appears during expression processing,
By searching and finding the function subprogram 4 that corresponds to the spelling of the definition operator, and storing it in association with the procedure citation list, it becomes possible to develop processing using the definition operation.

〔Example〕

Next, the configuration and operation of one embodiment of the present invention will be explained in detail using FIGS. 1 to 3.

In FIG. 1, an operator circumferential groove 1 is a register in which all operators including defined operators used in calculations are registered in the form of codes.

The operator sub-register 2 contains the spelling of the defined operator (for example, ", TE
IGl, ") and the index for the unit y13. In this operator sub-book 2, a plurality of operators having the same operator code may be chained together as shown in the figure.

The unit i'ii3 stores the base point convergence of the function subprogram 4.

Function subprogram 4 is the definition operator shown in ■.
TEIGl,'' and the processing executed by this definition operator.

Input 5 is converted into an expression (for example, “^
, TE[G1. This is a formula that is an analysis of B”).

The definition operator spelling shelf 6 is a pointer (PO
INTER).

The partition shelf 7 is for storing definition operator codes extracted from expressions.

The bunsetsu part 8 is a bunsetsu part (for example, a bunsetsu (
A, B), etc.).

The definition processing unit 11 is for performing definition processing such as defining a definition operator and writing the processing to be executed by the definition operator in advance as a function subprogram.

Next, the operation of the configuration shown in FIG. 1 will be sequentially explained.

First, a procedure in which the definition processing unit 11 creates a definition operator and a function subprogram 4 that defines a process by this definition operator will be explained.

(1-1) Definition The operator ", TETGl," is defined as shown in ■ in the figure.

(1-2) Define the types of variables A and B in the equation as shown in ■ in the figure.

The processing using variables A and B in equation (1-3) is defined as shown in ■ in the figure. This defines the process of finding the length of B of CHAR type and adding it to A of INT type.

By the above steps, the user-specific definition operator ", TE
IGl,” and the processing by this definition operator is defined.

Second, a procedure for the definition processing unit 11 to create a book in which definition operators are stored will be explained.

(2-1) Register the spelling of the definition operator ", TEIGl," in the operator sub-register 2 as shown in ■.

(2-2) Register the pointer to the unit 13 to be executed as shown in ■ in the operator substation list 2. At this time, at the same time, point the function subprogram 4 from the unit 71w3 as shown in the figure, and point the beginning of this operator substation list 2 from the code position of the corresponding definition operator of the operator circumferential groove 1 as shown in the figure. point. In addition, the spelling of multiple definition operators from the same code of the definition operator of operator circumferential groove 1 is ", TEIGl,
” “,TEIGl2. ”, they are connected by a chain (pointer) from the operator substation ′; Chain the grooves and index each unit chain from there.

Thirdly, the expression analysis unit 12 analyzes the input expression expression with a shelf (
Explain the steps for parsing an expression using (Stack).

(3-1) Clause section extracted from the first expression of input 5 “
A'' is stored in the phrase section 8 as shown in ■.

(3-2) The code of the delimiter part ", TEIG[," extracted from the first expression of input 5 is stored in the partition shelf 7 as shown in ■, and this delimiter part ".

The weaving of ``TEIGl,'' is stored in the spelling book 6-1, and the pointer pointing to this is stored in the definition operator spelling shelf 6 as shown in ■.

(3-3) The phrase part "B" extracted from the second expression of input 5 is stored in the phrase part 8 as shown in ■.

According to the above procedure, the expression language is analyzed, and information as shown in the figure is stored in each column.

Fourth, the determination made by the definition operator determination unit 13 when a definition operator appears as part of the second analysis will be described.

(4-1) As a continuation of (3-3), the code of the second delimiter part of the expression is compared with the code of the delimiter part currently stored in the delimiter shelf 7.

As a result of the comparison, the definition operator code has a higher priority, so the following is extracted.

Delimiter code Clause section 8 (A, B) Spelling 16-1: Weaving ", TEIGl," (4-2) Search and find a phrase with the same code as this extracted delimiter code from operator station 7fIJ1. .

(4-3) The definition of the operator peripheral groove 1 found in (4-2). Sip, (4-
The definition operator ``, TEIGI'' extracted in step 1) is sequentially compared to find the matching operator substation list 2. Here, since the spelling of ■ matches, this becomes the found operator substation 7IJ2.

(4-4) The type declaration of the function subprogram 4 ahead of the unit set 3 indicated from the operator substation register 2 found in (4-3), and the clause (A , B) and whether they match.

(4-5) If there is a match in the test in (4-4), it is determined that it is a definition operation, and a procedure quotation groove shown in FIG. 3 representing a function is created.

(4-6) If there is no match in the test in (4-4), the chains of elements and circumferential grooves shown in FIG. 2 that have the same weave and other definitions are sequentially traced and similarly searched.

Through the above procedure, the function subprogram 4 that matches the delimiter code, clause, and spelling of the definition operator is searched and found.

Fifth, the function subprogram 4 determined to be a definition operation in the fourth step.
etc., are stored in the procedure reference groove in Figure 3 as shown. A procedure citation is a book that stores information for solving functions. The function subprogram pointed to from the index of the circumference groove via this procedure is (4-5)
This is function subprogram 4 that was determined to be a definition operation.

[Brief explanation of the drawing]

FIG. 1 is an explanatory diagram of the configuration and operation of one embodiment of the present invention, and FIG.
The figure is an explanatory diagram when there are definition operators with the same spelling, and FIG. 3 shows an example of a procedure citation circumferential groove. In the figure, 2 is an operator sub-station list, 4 is a function sub-program, 5 is an input (formula word), 6 is a definition operator spelling shelf, 6-1 is a spelling shelf, 7 is a dividing shelf, 8 is a phrase shelf, 11 is a definition processing section, 12
13 represents an expression analysis unit, and 13 represents a definition operator determination unit. [Effects of the Invention] As explained above, according to the present invention, a function subprogram in which a user-specific definition operator is defined and processing is written is created in advance, and the spelling of the definition operator can be changed in expression processing. Since it is configured to output (store in the procedure reference groove) the corresponding function subprogram etc. as a result of formula processing when it appears, it is possible to develop processing using definition operators defined by the user. This allows user-specific processing to be easily programmed.

Claims (1)

[Claims] A definition operator processing method for processing a definition operator appearing in an expression includes: a function subprogram (4) in which a definition of a definition operator and a process to be executed by this definition operator are described in advance; , an operator sub-register (2) in which the spelling of the definition operator defined by this function sub-program (4) and an index for associating it with this function sub-program (4) are registered in advance; Find the corresponding operator sub-book (2) that corresponds to the spelling of the definition operator extracted from the expression, and create the function sub-program (4) corresponding to the index of the found operator sub-book (2). A definition operator processing method in expression processing, characterized in that it is configured to output as an expression processing result of a definition operator.