JP2001034482A - Compile device, program optimizing device, compile processing method and recording medium - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a technique generalizing optimization processing in compile processing. SOLUTION: This compile device is provided with a pre-processing type program optimizing device 6 for generating an optimized primitive program 7 described in high standard language by generating and optimizing inside date in a binary tree format from a primitive program 1, a semantic analysis device 51 for generating a data structure by applying the semantic analysis to the optimized primitive program, and a code generating device 52 for generating an object program by generating a code from the data structure.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

[0001] 1. Field of the Invention [0002] The present invention relates to a program optimization technique in a compiling device.

[0002]

2. Description of the Related Art When a computer executes a source program described in a high-level language, language processing for compiling the source program and generating a target program described in a machine language or an assembler language is performed.

Further, in recent compiling apparatuses, not only a source program is simply converted into a target program, but also the speed of executing the target program is increased.
Optimization processing for reducing the storage area occupied by the target program is often performed at the time of compilation.

[0004] In the compiling process involving the optimization process, first, the lexical analysis process and the syntax analysis process of the source program are sequentially performed, and then the optimization process is performed. Then, the target program is generated by performing code generation from the data that has been optimally processed.

Here, an example of a conventional compiling device for performing an optimization process will be briefly described with reference to FIG. As shown in FIG. 5, the compiling device 3 of the conventional example includes:
It comprises a syntactic and semantic analyzer 31, an optimizer 32, and a code generator 33. The compiling device 3 compiles the source program 1 into an assembler program 2 under the control of the computer 4.

In the compiling process, first,
The lexical analysis process and the lexical analysis process of the source program 1 are sequentially performed by the syntactic and semantic analysis device 31 to generate internal data. Next, the optimization device 32 optimizes the internal data to generate optimized internal data. further,
The code generator 33 generates an assembler language instruction from the optimized internal data, and executes the assembler program 2
Generate

[0007]

However, in a conventional compiling apparatus, an intermediate phase of a compiling process such as optimization is usually internally designed based on an internal data format of an input of the phase. This internal data format differs in a detailed expression format for each compiling device. For this reason, conventionally, it is necessary to design a dedicated optimization device for each compiling device, and when the design of the compiling device is changed, it is necessary to newly design the optimization device. Was.

Particularly, in the field of embedding, a small central processing unit has been developed for each user. For this reason, a cross compiling device for the small central processing unit is also separately developed. As a result, a great deal of effort and time has been spent designing a dedicated optimization device for each compiling device.

SUMMARY OF THE INVENTION The present invention has been made to solve the above-described problem, and has as its object to provide a technique capable of generalizing an optimization process in a compiling process.

[0010] In addition, in Japanese Patent Publication No. 2636665,
In an information processing apparatus having an optimizing compiler based on a preprocessor system, a technique for optimizing a source program under measurement so as to prevent the optimization of an original source program from being taken out in collecting execution information of the optimized program has been disclosed. ing. However, even in the technology disclosed in this publication, no consideration has been given to generalizing the optimization processing of the original source program itself.

[0011]

In order to achieve this object, according to the compiling apparatus of the first aspect of the present invention,
A program optimization device that optimizes a source program and generates an optimized source program written in a high-level language, a semantic analysis device that performs a semantic analysis of the optimized source program and generates a data structure, and And a code generation device for generating a code to generate a target program.

As described above, according to the present invention, at the stage before the semantic analysis processing of the compilation processing, the optimization processing of the source program is performed to generate the optimized source program described in a high-level programming language. I do. High-level programming languages are unified by the JIS standard. As a result, the optimization source program is also unified by the JIS standard. Therefore, the optimizing source program can be compiled by an arbitrary compiling device. Therefore, according to the present invention, the versatility of the program optimization processing device can be improved regardless of the compiler device.

According to a second aspect of the present invention, there is provided a program optimizing device, comprising: means for converting a source program into internal data in a binary tree format; means for optimizing the internal data; Means for generating an optimized source program from internal data.

In the binary tree data structure, the description form of the program is directly converted into data. For this reason, the internal data in the binary tree format can hold all the information of the source program at the programming language level. As a result, if the internal data in the binary tree format is generated and optimized, all information of the source program can be used for optimization.

By generating a binary tree internal data structure and optimizing it, there is no risk of information being lost due to the generation of the internal data, and there is no danger of suppressing the optimization. An optimized source program can be reliably generated.

According to a third aspect of the present invention, there is provided a program optimizing apparatus for converting a source program into binary tree format internal data prior to compiling, optimizing the internal data, Means for generating an optimized source program described in a high-level language from the optimized internal data.

As described above, according to the program optimizing apparatus of the present invention, optimization is performed prior to compiling to generate an optimized source program, so that the program optimizing apparatus has versatility regardless of the compiler apparatus. Further, since the internal data in the binary tree format is generated and optimized, it is possible to reliably generate the optimized source program in a high-level language.

According to the fourth aspect of the present invention, a lexical analyzer for dividing a source program into words, a high-level language parse unit for converting each word into individual data, and From an internal data generating unit that generates internal data in a binary tree format, an optimization processing unit that generates optimized internal data by optimizing the generated internal data, and rearranging the optimized internal data into a list structure. The configuration includes an internal data parse unit that generates a single-row data structure, and a program generation unit that sequentially converts the data structure and generates an optimized source program.

Further, according to the compiling method of the present invention, when compiling the source program and generating the target program, the source program is optimized and the optimized source program described in a high-level language is used. In this method, a data structure is generated by performing a semantic analysis of the optimized source program, and a code is generated from the data structure to generate a target program.

As described above, according to the compiling method of the present invention, an optimized source program is generated by performing optimization before compiling, so that versatility can be given to the program optimizing process regardless of the compiler device. it can.

According to the recording medium of the present invention, when compiling the source program and generating the target program, the source program is optimized and the optimized source program described in a high-level language is used. A compilation control program for causing a computer to execute a process of generating, a process of generating a data structure by performing a semantic analysis of the optimized source program, and a process of generating a code from the data structure and generating a target program is recorded. It is.

By causing a computer to read and execute the program recorded on the recording medium of the present invention,
The optimization process can be executed regardless of the compiling device.

[0023]

Embodiments of the present invention will be described below with reference to the drawings. Note that the compiling process in each of the following embodiments is executed by a computer (electronic computer) controlled by a program. This program is provided, for example, by a recording medium. As the recording medium, for example, a magnetic disk, a semiconductor memory, or any other computer-readable medium can be used. Also, the program recorded on the recording medium can be read by a computer via a communication line.

First, an outline of the compiling device of the embodiment will be described with reference to FIG. As shown in FIG.
The compiling device 1 is controlled by a computer 4. The compiling device 1 optimizes the source program 1 to generate an optimized source program 7 described in a high-level language, and a program optimizing device 6 that compiles the optimized source program 7 to generate an assembler program 2 And a basic compiling device 50 that generates

The basic compiling device 50 performs a semantic analysis of the optimizing source program 7 to generate a data structure, and a code generating device that generates a code from the data structure to generate the assembler program 2. 52. The configuration and functions of the syntactic and semantic analysis device 51 and the code generation device 52 are as follows.
It has the same configuration and function as the conventional syntactic and semantic analysis device 31 and code generation device 33 shown in FIG.

Therefore, the program optimizing device 6
Is a preprocessing-type program optimizing device 6 that performs optimization processing of the source program 1 to generate an optimization source program 7 at a stage before the semantic analysis processing of the compilation processing.
It is.

Next, the configuration of the program optimizing device 6 will be described with reference to FIG. FIG. 2 is a functional block diagram of the compiling device, particularly for explaining the internal configuration of the program optimizing device 6. As shown in FIG. 2, the program optimizing device 6 includes a lexical analyzer 51, a high-level language parsing device 62, and an internal data generator 63 as means for converting a source program into binary tree format internal data. It comprises an optimization processing device 64 as a means for optimizing data, and an internal data parse device 65 and a program generation device 66 as a means for generating an optimized source program from the optimized internal data.

Then, the source program 1 is optimized by the program optimizing device 6 and the optimized source program 2 is optimized.
First, the lexical analyzer 61 recognizes each character of the source program 1 according to the specification of the input high-level language (high-level language) describing the source program 1, and converts the source program 1 into a word. Divide each.

Subsequently, the high-level language parsing device 62 determines the arrangement of the words divided by the lexical analyzer 61, and compares the arrangement order with the syntax of the language specification. Then, as a result of the comparison, if the word order and the syntax match, each word is turned into information as individual data. If the results of the comparison do not match, a message indicating that there is an error in the input is output, and the process is terminated.

Next, the internal data generator 63 generates internal data in the form of a binary tree from the data computerized by the high-level language parsing device 62.

Here, the binary tree format will be described with reference to FIG. First, FIG. 3A shows a part of a source program. FIG. 3B shows a data structure in which the source program shown in FIG. 3A is converted into information and represented in a conventional internal format.

The optimizing device 32 of the conventional compiling device 3
In, when the information is converted to information for optimization,
The data structure was described in this conventional internal format. This conventional internal format is a general-purpose machine language that can be understood by a computer, in which instructions are arranged in the order in which the computer performs processing.

By the way, when data is converted into information in a conventional internal format, the program operates correctly as the final operation of the program by the computer, but the data is at a computer level rather than the level of the original source program. It's getting closer. For this reason, the data represented in the conventional internal format lacks information as compared with the information of the original source program.

For this reason, when the data of the conventional internal format is optimized, due to the lack of information, after the optimization process,
It may be difficult to generate an optimized source program described in a high-level language.

Therefore, in the present embodiment, the internal data is represented by a binary tree method. Here, FIG.
3A shows a data structure in which the source program shown in FIG. In a binary tree data structure, the data structure itself conforms to the description of a high-level language. Therefore, according to the binary tree format, the description form of the program can be directly converted into data.
As a result, the binary tree format internal data can hold information on the source program at the programming language level.

Thus, if an internal data structure of the binary tree format is generated and optimized, there is no loss of information due to the generation of the internal data, so there is no danger that the optimization will be suppressed. An optimized source program can be reliably generated.

Next, the data structure of the binary tree format will be described in detail with reference to FIG. For example, in the lexical analyzer 61, the program “A = B”
It is broken down into three words, "A", "=", and "B".

The programming language can be broadly divided into (1) terminal data (memory and values) and (2) data representing expressions and symbols of sentences. The words “A” and “B” correspond to (1) terminal data. On the other hand, the word “=” corresponds to data representing an expression.

As described above, each of these words is checked by the high-level language parsing device 62 to determine whether or not the arrangement of words matches the grammar of the program. Generated.

Here, FIG. 4A shows a state where the program "A = B" is represented in a binary tree format. Then, inside the actual computer, the binary tree format shown in FIG. 4A is stored in the memory as a data structure shown in FIG. 4B.

Note that "A" in the data structure of FIG.
The “execution address” indicates the address of A when the input program is executed, and the “holding address of A” indicates the address of the area holding the data of A in the optimization device. I have. Also, for the address of B,
Same as A.

Next, the internal data in the binary tree format generated in this way is passed to the optimization processing device 64. The optimization processing device 64 optimizes the internal data generated by the internal data generation device 63 by the optimization means 640, and generates optimized internal data. The optimization means 6
In the optimization by 40, any well-known means conventionally known can be used.

Subsequently, the internal data parse device 65 first recognizes the structure of each of the optimized internal data generated by the optimization processing device 64 by comparing it with the internal data syntax. Since the internal data has already been turned into information,
There is no need for lexical analysis. In addition, since the syntax is already compared in the high-level parse device 62, the structure of the internal data always matches the internal data syntax here. further,
The internal data parse device 65 rearranges the internal data into a list structure and generates a one-row data structure.

Finally, the program generating device 66 sequentially converts the data structure to generate an optimized source program. Here, an example of a source program and an optimized source program obtained by optimizing the source program will be described. First, in Table 1 below,
An example of a part of a source program is shown.

[0045]

[Table 1]

In the program shown in Table 1, "10" is substituted for "i" in the first line, but the value of "i" is "10" in the second line. Then, "5" is substituted for "j" only when it is "10". The determination in the second line has substantially no meaning. Therefore, when the program in Table 1 is optimized,
Generally, the programs shown in Table 2 below are obtained.

[0047]

[Table 2] i = 10; j = 5; func (j);

By the way, if "i" is not used in the subsequent program, delete "i = 10;"
As shown in Table 3 below, further optimization can be achieved.

[0049]

[Table 3] j = 5; func (j);

Further, if "j" is not used in the subsequent program, as shown in Table 4 below,
Further optimization can be achieved.

[0051]

[Table 4] func (5);

As described above, when the source program shown in Table 1 is input, an optimized source program described in any of Tables 2 to 4 described in a high-level language is generated.

The high-level programming language is standardized by the JIS standard. As a result, the optimization source program is also J
It is unified by IS standard. Therefore, if optimization is performed prior to compilation to generate an optimized source program, and this optimized source program is compiled by the basic compiler device 50, the compilation process can be performed by any compilation device. As a result, the versatility of the program optimization processing device can be improved.

In the above-described embodiment, an example in which the present invention is configured under specific conditions has been described. However, the present invention can be variously modified. For example, in the above-described embodiment, an example has been described in which an assembler program is generated as a target program. However, the present invention is not limited to this. For example,
A machine language may be generated as a target program. Also,
In the present invention, the language of the source program is not limited as long as it is a high-level language.

[0055]

As described in detail above, according to the present invention, at the stage before the semantic analysis processing of the compile processing,
Optimize the source program to generate an optimized source program written in a high-level programming language. High-level programming languages are unified by the JIS standard. As a result, the optimization source program is also unified by the JIS standard. Therefore, the optimizing source program can be compiled by an arbitrary compiling device. Therefore, according to the present invention, versatility can be given to the program optimizing process.

Further, internal data in a binary tree format is generated,
By optimizing this, all the information of the source program can be used for optimization, so that an optimized source program described in a high-level language can be reliably generated.

[Brief description of the drawings]

FIG. 1 is a functional block diagram illustrating an outline of a configuration of a compiling device according to an embodiment of the present invention.

FIG. 2 is a functional block diagram for explaining a configuration of a program optimizing device constituting the compiling device of the embodiment.

FIG. 3A is an example of a source program;
(B) is an example of internal data in a conventional format, and (C)
Is an example of internal data in a binary tree format.

4A is a diagram illustrating an example of a binary tree format, and FIG. 4B is a diagram illustrating an example of a data structure of internal data in the binary tree format illustrated in FIG.

FIG. 5 is a functional block diagram for explaining a configuration of a conventional compiling device.

[Explanation of symbols]

 Reference Signs List 1 source program 2 assembler program 3 compiling device 4 computer 5 compiling device 6 program optimizing device 7 optimizing source program 31 syntactic and semantic analyzing device 32 optimizing device 33 code generating device 50 basic compiling device 51 syntactic and semantic analyzing device 52 code Generation device 61 Lexical analysis device 62 High-level language parse device 63 Internal data generation device 64 Optimization processing device 65 Internal data parse device 66 Program generation device 640 Optimization means

Claims (6)

[Claims] 1. A program optimization device for optimizing a source program and generating an optimized source program described in a high-level language, and a semantic analysis device for performing a semantic analysis of the optimized source program and generating a data structure. And a code generator for generating a target program by generating a code from the data structure. 2. The program optimizing device includes: means for converting the source program into internal data in a binary tree format; means for optimizing the internal data; and optimizing the source program from the optimized internal data. 2. The compiling device according to claim 1, further comprising: means for generating. 3. A means for converting a source program into internal data in a binary tree format prior to compilation, a means for optimizing the internal data, and an optimization described in a high-level language from the optimized internal data Means for generating a source program. 4. A lexical analyzer for dividing the source program into words, a high-level language parse unit for converting each of the words into individual data, and internal data in a binary tree format based on the converted data. An internal data generation unit for generating the internal data; an optimization processing unit for generating the optimized internal data by optimizing the generated internal data; and rearranging the optimized internal data into a list structure to generate a one-row data structure. 4. The program optimizing device according to claim 3, further comprising: an internal data parse unit that performs a sequential conversion of the data structure to generate an optimized source program. 5. When compiling a source program and generating a target program, the source program is optimized to generate an optimized source program described in a high-level language, and a semantic analysis of the optimized source program is performed. And generating a target program by generating a code from the data structure. 6. Compiling a source program to generate a target program, optimizing the source program to generate an optimized source program described in a high-level language, and analyzing the semantics of the optimized source program. And a computer-readable recording medium storing a compile control program for causing a computer to execute a process of generating a data structure by performing the above process and a process of generating a target program by generating a code from the data structure.