JPS62235643A - Program language translator - Google Patents

Abstract

PURPOSE:To convert a program of a large scale by a small memory capacity, by constituting the titled translator so that an unnecessary conversion data is stored in an auxiliary input/output device, after executing every one statement. CONSTITUTION:At the time of translating a source program which has been inputted from an input device 1, whether it is necessary as information until the end of a program unit or not is decided by an auxiliary output converting means 21, and unless it is necessary, a result of translation is saved in an auxiliary input/output device 7. In an auxiliary conversion input means 22, the translation is performed until the end and at the time of outputting a result of conversion to an output device 8, the contents of the auxiliary input/output device 7 are inputted to a conversion processing part 4. In this way, an unnecessary result of conversion is stored in the auxiliary input/output device, therefore, a large source program can be translated as it is, and a person's help for dividing the source program can be omitted.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a language translator, and particularly to a programming language translator for converting from a high-level language to another high-level language.

[Conventional technology]

Figure 3 shows a conventional programming language translator, where 1 is a floppy disk for inputting the source program before translation.

An input device such as a keyboard, 2 a lexical analysis processing unit that converts the entire source program into a string of marks, 3 a syntactic analysis processing unit that uses the processing results of the lexical analysis processing unit 2 as input and analyzes all the syntax, 4 a A conversion processing unit that executes actual conversion by inputting the processing result of the syntax analysis processing unit 3, and 5 is an information table for retaining information of the previous pass in memory at each bus of the above three-pass conversion. 6 is a central processing unit equipped with each of the processing units 2 to 4 and the memory 5, and also has a work memory for conversion, and 7 is a conversion unit created in each pass of each of the processing units 2 to 4. An auxiliary input/output device such as a Winchester disk is used to store the results as an intermediate language file, and 8 is an output device such as a floppy disk for outputting the conversion results.

Next, the operation will be explained according to the flowchart of program conversion shown in FIG.

First, the lexical analysis processing unit 2 reads one line of the source program from the input device 1 and performs lexical analysis on it (step
). Next, it is determined whether or not to leave this analysis result in the memory (step (2)), and if so, the analysis result is stored in the information table memory 5 (step (2)). Furthermore, the result is stored in the auxiliary input/output device 7 (step 2).

Continue this until the end of the entire program. The above is the first pass. Next, the syntax analysis processing unit 3 uses the auxiliary input/output device 7
One line of information is read from and parsed (step ■). It is determined whether or not to leave this result in the memory (step 2), and if so, the analysis result is stored in the information table memory 5 (step 2). Furthermore, the results are stored in the auxiliary input/output device 7 (step ①). Continue this until the end of the entire program. This is the second pass. Next, the conversion processing unit 4 reads out one line of information from the auxiliary input/output device 7, converts it (step ■), judges whether to leave the result in memory or not (step @), and if so, , stored in the information table memory 5 (step ■)
. Then, the conversion result is stored in the output device 8 (step 0
). Continue this until the end of the entire program. This is the third and final pass.

[Problem that the invention seeks to solve]

Conventional programming language translators are configured as described above, so in order to save memory, it is necessary to convert in a three-pass method or to divide the conversion processing unit 4 into several more passes. In addition to the fact that conversion takes a long time, converting using a one-pass method requires a large amount of memory. In addition, when converting a large program, there were problems such as the operator having to divide the large program into smaller pieces. This invention was made to solve the above problems. To provide a one-pass method programming language translator which can reduce the time required for language conversion by using a pass method and can convert even large programs without human intervention.

[Means for solving problems]

The programming language translator according to the present invention includes an auxiliary conversion output means that outputs an intermediate result to an auxiliary input/output device during translation, and an auxiliary conversion that inputs the intermediate result stored in the auxiliary input/output device from the auxiliary input/output device. The configuration is such that intermediate results of translation are sequentially input/output to an auxiliary input/output device using an input means.

[For production]

The programming language translator in this invention uses the conversion result of one statement after lexical analysis, syntactic analysis, and conversion as the subsequent conversion information, and leaves the result of the translation in the information table memory. Output to the auxiliary input/output device and save the conversion result in the auxiliary input/output device until the end of the program unit. When the end of the program unit is reached, the means for determining the input from the auxiliary input/output device determines whether the conversion result is in the memory or the auxiliary input/output device, and if it is in the auxiliary input/output device, the auxiliary input/output Acts as input from the device to the output device.

〔Example〕

Next, an embodiment of the present invention will be described with reference to the drawings.

In FIG. 1, reference numeral 21 denotes an auxiliary conversion output means, which, when translating the source program input from the input device 1, determines whether or not the information is necessary up to the end of the program unit, and if it is not necessary, translates the source program. Output and save the results to the auxiliary entry/exit interior [7]. Reference numeral 22 denotes an auxiliary conversion input means, which inputs -AFJ电目3-+rmatranslategoh to each program unit of the source program.
- When outputting all conversion results to the output device 8, it is determined whether each conversion result is stored in the memory or in the auxiliary input/output device 7, and if necessary, the auxiliary input/output device 7 is used. The conversion result is input from the input/output device 7 to the conversion processing section 4 . 23 is a processing unit 2.3.4 involved in conversion.

Auxiliary conversion output means 21. This is a program language translator equipped with an auxiliary conversion input means 22 and a memory storing programs and the like for executing each process.

Note that other blocks that are the same as those shown in FIG. 3 are given the same reference numerals, and redundant explanation thereof will be omitted.

Next, the operation of the embodiment of the present invention will be explained according to the flow chart of programming language translation shown in FIG.

It should be noted that processing steps having the same reference numerals as those in FIG. 4 operate in the same manner as in the conventional example, and a description of the operations will be omitted. first,
After successively performing the lexical analysis, syntactic analysis, and conversion processes (steps ■, ■, ■), the auxiliary device output unit 21 determines whether the conversion results are necessary for subsequent conversion (step 0).
If necessary, the conversion result is stored in the memory (step 0), and if not necessary, the auxiliary conversion output means 21 outputs the conversion result to the auxiliary input/output device 7 and stores it (step @).

In this way, translation continues until the end of the program as in the conventional example. Then, at the end of the program, output is performed to the output device 8. At this time, the auxiliary conversion input means 22 first determines whether one statement of the conversion result is in the information table memory 5 (
Step O).

If not, the conversion device input unit 22 inputs the conversion result from the auxiliary input/output device 7 to the conversion processing unit 4 (step @), and if it exists, outputs the conversion result in the information table memory 5 to the output device 8. (Step 0). The output of the conversion result up to the end of the conversion result is performed in the same manner as in the conventional example.

Note that in the above embodiment, the input device 1 and the auxiliary input/output device 7
Although the output device 8 and output device 8 are treated as different devices, they may be the same or two of them may be the same.

〔Effect of the invention〕

As described above, according to the present invention, the translation is 1
Since the structure is configured to execute one statement at a time and store unnecessary conversion results in the auxiliary input/output device as subsequent conversion data, it is possible to run a source program with a large program unit, and it is easy for a human to run such a source program. This eliminates the conventional effort of dividing the program and applying it to a translator, and has the effect of automatically converting a large program using a small memory. Furthermore, since the necessary parts are left in the memory, the time required for translation is also shorter than when storing everything in the auxiliary input/output device using the conventional multi-pass method.

[Brief explanation of drawings]

FIG. 1 is a block diagram of a programming language translator showing an embodiment of the present invention, FIG. 2 is a flowchart showing an embodiment of translation according to the invention, and FIG. 3 is a block diagram of a conventional programming language translator. A T7
+ &tr J rX71 ++J-stop→
t 7k 4q Ir) I L + +
It is a flowchart which shows the Example of /-11/-. In the figure, 1 is an input device, 8 is an output device, 23 is a central processing unit that performs translation processing, 21 is an auxiliary conversion output means, 22 is an auxiliary conversion input means, and 7 is an auxiliary input/output device. In addition, in the figures, the same reference numerals indicate the same or corresponding parts. Patent Applicant Mitsubishi Electric Corporation Agent Patent Attorney 1) Hiroshi Sawa ”°1 (2 others) ゛

Claims (1)

[Claims] An input device for inputting a source program, a central processing unit for executing processing for executing translation,
In a programming language translator equipped with an output device for outputting the translated program and an auxiliary input/output device for storing the execution results of the translation, the processing results in the central processing unit are necessary for subsequent conversion processing. The auxiliary conversion output means determines whether or not the conversion process exists, and if it is not necessary, stores the processing result in the auxiliary input/output device, and outputs all the conversion process results at the end of the program. determines whether or not exists in the information table memory in the central processing unit, and if it does not exist, inputs the processing result from the auxiliary input/output device to the output device by the auxiliary conversion input means. A programming language translator that is characterized by: