JPH06332719A - Compiler code generating device - Google Patents

Abstract

PURPOSE:To improve transplantation to plural machines, to increase a compile speed, and to reduce a memory request amount by adding a header to each generated code, and inputting the changed content of the program dependency of the generated code. CONSTITUTION:At first, a code generation pattern is selected (S10). Next, the generation code table of the selected pattern is read (S11). The code is surrounded by a double quote ('') by each line, and the section from the head to a double colon (:) is the header. Successively, the setting of the content of the program dependency of the generated code is operated (S12). Thus, the header is added to each generated code, and the design of the development of the generated code is operated based on the header. Then, the header is added to each code, so that the change or exchange of the design code can be easily operated. Also, the codes are not generated in a batch, but divided and managed one by one, so that the kinds of the patterns of the generated codes can be decreased, and the number of the basic codes can be decreased.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a compiler development field for a compiler used in a program development environment and a compiler code generation system usable in a computer development field.

[0002]

2. Description of the Related Art Conventionally, the code generated by a compiler depends on the machine, and it is necessary to redesign the generated code every time the CPU of the machine changes. Along with this, it is necessary to completely change the source code of the compiler to match the new generated code. The more diverse the changes, the more mistakes and omissions. Even in the same CPU, if the generated code is changed, it is necessary to completely review the compiler source. Therefore, the number of man-hours related to development increases. Also, depending on how the generated code is held, the disk space used by the compiler source,
The amount of memory used during compilation is large.

[0003]

In the conventional method, there are many machine-dependent parts, and the work of changing the source and the work of debugging accompanying a code change occupy a considerable part of the development man-hour each time the CPU changes. In addition, not only the code design, but also the changes that are derived from it increase as the number of changes in the source itself increases, resulting in more mistakes and omissions. Even in the same CPU, when the generated code is changed, it is necessary to completely review the compiler source. Depending on how the generated code is held (classification of types of code generation patterns), the used disk capacity of the compiler source and the memory used during compilation increase. Therefore, there are many problems as described above in porting the compiler.

It is an object of the present invention to provide a compiler code generation device which overcomes the above-mentioned problems, is highly portable to a plurality of machines, hastens the compile speed, and has a small memory requirement.

[0005]

A compiler code generator according to the present invention is a compiler code generator which inputs a generated code table in which a header is attached to each generated code and a program-dependent change content of the generated code. And a means for analyzing the header, and a means for expanding the code based on the type of the header and the program-dependent change contents of the generated code.

[0006]

The generated code table in which a header is attached to each generated code and the program-dependent change contents of the generated code are input. The header is analyzed for each code, and the code is developed based on the header type and the program-dependent change contents of the generated code.

[0007]

Embodiments of the present invention will now be described in detail with reference to the drawings.

FIG. 2 is a block diagram of a compiler code generator according to an embodiment of the present invention. The present device is a control device 10 (CPU) that controls the entire computer including compiler code generation processing, an internal storage device 13 having a storage area of various programs for operating this control device,
An external storage device 14, a display device 12 (hereinafter referred to as a display device) for displaying a program under the control of the control device, and an input device 11 such as a keyboard for inputting various information including the program. To be done. An internal storage device 13, an external storage device 14, a display device 12, and an input device 11 are connected to the control device 10.

FIG. 1 is a flow chart showing the code generation processing of this apparatus. FIG. 3 is a sample program that is an example of code generation. FIG. 4 shows an input / output example. The code generation process will be described using a flowchart, a sample program, and an input / output example.

First, in step S10, a code generation pattern is selected. In the example of FIG. 3, the function cod
The close_gen of the egen is selected.

Next, in step S11, the generation code table of the selected pattern is read. In the example of FIG. 3, the generated code table close_code.
Read. The code is double quotes (") line by line
The header from the beginning to the double colon (:) is a header used in step S15. After that, in the generated code pattern, the upper case part is the part developed according to the type of the header in step S16.

Then, in step S12, the contents of program-dependent change of the generated code are set. In the example of FIGS. 3 and 4, the function gen_para
_Set sets the changed content. Variable f_p
“Abc” is set in rm, and the numerical value 5 is set in the variable c_cmnd. These values are used to expand the uppercase part of the code table.

At this stage, the preprocessing is completed, and then the generated code is analyzed for each copy to develop the code.

That is, in step S13, one copy of the code is taken out from the generated code table read in step S11. In the example of FIG. 3, the first code "F: opr1 F, xxx \ n" is retrieved.

Next, in step S14, it is determined whether the fetched code is the end code of the code table. If it is an exit code, end the series of processing,
If it is not the end code, the process proceeds to step S15.

In step S15, the meaning of the header is analyzed. In the example of FIG. 3, the types of the header are “A” and “
Three patterns of F "and" C "were prepared.

Next, in step S16, the code is expanded, if necessary, by reflecting the contents set in step S12. The header "A" is a pattern in which the code after the double colon is output as it is, and the code in step S16 is not expanded. As for the header “F”, the part of “F” shown in the character string is replaced with the function g
Change to the first argument set in en_para_set and output. The header “C” is similar to the header “F” in that the portion of “C” is the function gen_ of step S12.
Change to the second argument set in para_set () and output. In the example of FIGS. 3 and 4, the header of the first code is “F”, so “F” that is not the header in the code is the function gen_para in step S12.
It is replaced with the value "abc" set in _set.
In the third code, since the header is "C", the portion of "C" which is not the header in the code is processed by the function ge in step S12.
It is replaced by the value 5 set in n_para_set. The fourth code is output as it is because the header is "A".

Next, the code expanded in step S17 is sequentially output to the memory buffer or file.
In the example of FIGS. 3 and 4, the first code is output as opr1 abc, xxx shown in FIG.

Then, the process returns to step S13 to process the next code.

In the above embodiment, three types of header patterns are prepared, but this pattern is not limited to the above embodiment, and a new pattern may be used depending on the expanded form of the code.

When the generated code design is changed, only the generated code table (close_code []) is changed and the other parts are not required to be changed.
Correction work becomes efficient. Also, if the same code is generated partially, if the generated code table is shared,
Disk and memory usage can be reduced.

A design is performed in which a header is attached to each generated code and the generated code is expanded based on the header. Various patterns are prepared for the header according to the type of code, and an expanded form of each code is created according to the pattern. Since a header is attached to each code, the design code can be changed or replaced easily. Moreover, since the codes are not generated collectively but managed one by one, it is possible to reduce the types of patterns of generated codes and reduce the number of basic codes. Therefore, it is possible to reduce the disk usage of the compiler source and the memory usage when the compilation is executed.

As a result, the man-hours for development can be greatly reduced. Further, by reducing the amount of change source, it is possible to reduce change mistakes and change omissions.

[0024]

As described above, the compiler code generating apparatus of the present invention comprises means for analyzing the header and means for expanding the code based on the type of the header and the program-dependent change contents of the generated code. Therefore, it is possible to provide a compiler code generation device that is highly portable to multiple machines, has a high compile speed, and has a small memory requirement.

[Brief description of drawings]

FIG. 1 is a flowchart of a code generation process.

FIG. 2 is a configuration diagram of a compiler code generator according to an embodiment of the present invention.

FIG. 3 is a sample program that is an example of code generation.

FIG. 4 is an input / output example.

[Explanation of symbols]

 10 Control Device 11 Input Device 12 Display Device 13 Internal Storage Device 14 External Storage Device

Claims (1)

[Claims] 1. A generated code table in which a header is attached to each generated code, and a compiler code generation device which inputs the program-dependent change contents of the generated code as an input, and means for analyzing the header, A compiler code generation device, comprising means for expanding a code based on a type and a program-dependent change content of the generated code.