JPH0455937A - Program clean copy processor - Google Patents

Abstract

PURPOSE:To obtain an easy-to-see structure of a program by dividing the program into the meaningful least structure units and performing the clean copy processing based on these least structure units. CONSTITUTION:A source file 3 serving as an input device is produced when a user starts an editor 2 through a terminal 1 and performs the input and editing operations. In the clean copy processing, the file 3 is divided into the meaningful least structure units by a program structure analyzing part 4. A clean copy processing part 6 performs the clean copy processing while receiving those least structure units one by one from the part 4 and writes the processing result in a buffer 7. A remaining character counter part 5 which counts the remaining characters up to the end of a line has the largest number of characters per line as the initial value and receives the number of used characters from the part 6 to subtract these characters in sequence. When the due processing is through up to the end of a sentence, the contents of the buffer 7 are transferred to an output file 8. Then the next line is processed. Thus an easy-to-see structure is secured even with such programs that includes the long calculation formulas, the formulas including the multiple parentheses, or the indention due to the multiple repetitive and multiple decision structures.

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial Field of Application] The present invention is used in the fair copying process of computer source programs. The present invention relates to a cleanup process for making the program structure of a source program of a computer program easier to see, and particularly to an apparatus that performs a process of dividing one sentence into two lines.

〔overview〕

The present invention is a program cleanup processing device that cleans up computer program structure so that it is easy to read.The present invention divides a program into meaningful minimum structural units and performs cleanup processing based on these minimum structural units. This makes the structure easier to see.

[Conventional technology]

Computer programs are generally entered manually using a manual editing program called an "editor." To make the program structure easier to read, spaces are often inserted as appropriate, and indentation is often used to clarify structures such as repetition and branching.

Programs created in this way can be created more efficiently in later debugging and maintenance processes if they are created in accordance with certain rules, but care must be taken when entering input into the editor. On the contrary, doing so will reduce input efficiency.

Therefore, as shown in Figure 4, an efficient method is to sacrifice the legibility of the program structure and insert only the minimum necessary blank spaces during input, and then perform the clean-up process all at once after manual input is completed. It is possible to create standardized source programs with no individual differences.

Conventionally, this type of cleanup processing is provided to users as a source program cleanup utility on a computer. If you specify the input source program file, the output optical file after cleansing, and various optional functions (for example, indent width and white space processing method), the cleansing process will be performed according to the specified rules unless there are fatal errors. Now you can get the output file. Figure 5 is a version of the source program in Figure 4 that has been edited using the FORTRAN formatting utility, with loop structures, conditional branches,
You can easily recognize the destinations of control statements, and the program structure is easier to see.
50 characters per line).

[Problem to be solved by the invention]

In conventional formatting processing methods, when a sentence spans multiple lines or is split into two lines due to indentation due to repetition or judgment, the line is unconditionally split at the end of the line, regardless of the meaning of the command or statement.

Therefore, due to the effects of long calculation formulas, formulas containing multiple parentheses, and indentation due to multiple repetitions and multiple judgment structures, sentences that were originally on a single line are unconditionally separated, making the program difficult to read. . Lines 210 to 220 in Figure 5 show an example of this.
When converted into characters, the term "C3*Y (K-1)" is separated at the end of the line. In actual situations, 80 or 136 characters are often used per line, but “D
When multiplexed "O" and "IP" statements are created, the number of characters that can be placed per line is limited due to indentation, so such cases are frequently seen.

The present invention is intended to solve these problems, and aims to provide a device that can eliminate commands and statements from being divided at the end of sentences and make the program structure easier to see.

[Means to solve the problem]

The present invention is a program structure analysis device that processes a source program edited and input into a source file by an editor in response to an input instruction from a terminal. a remaining character count unit that counts the number of characters remaining to the end of the line, and a cleanup process from the beginning of the line for each decomposed minimum structure, and when the output value of the remaining character count unit becomes a negative value, The present invention is characterized by comprising a formatting processing unit that divides a sentence into the next line as a continuation line.

[Effect]

Breaks down program commands and statements into the smallest meaningful structure and counts the number of characters left until the end of the line. For each decomposed minimum structure, a clean-up process is performed from the beginning of the line, and when the count value becomes a negative value, the remaining sentence is divided into the next line as a continuation line.

This prevents commands and statements from being unconditionally split at the end of a sentence, and even if the program contains long calculation expressions, expressions with multiple parentheses, or indentation due to multiple repetitions or multiple judgment structures, the program The structure can be made easier to see.

〔Example〕

Next, embodiments of the present invention will be described based on the drawings.

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention.

The embodiment of the present invention includes a program structure analysis unit 4 that decomposes program commands and statements manually edited into a source file 3 by an editor 2 in response to manual instructions from a terminal 1 into a meaningful minimum structure, and a remaining character number counting unit 5 that counts the number of characters in the text, and a remaining character number counting unit 5 that performs a cleanup process from the beginning of the line for each decomposed minimum structure.
The present invention includes a fair copy processing unit 6 that divides the remaining sentence into the next line for continuity when the output value of becomes a negative value, and a buffer 7 that temporarily stores the processing result and transfers it to an output file 8.

The input source file 3 is created by the user starting the editor 2 from the terminal 1 and performing input and editing. In the cleanup process, the source file 3 is first decomposed into a meaningful minimum structure by the program structure analysis section 4. The fair copying processing section 6 performs fair copying processing while receiving the structural units one by one from the analysis section, and writes the result to the buffer 77. The remaining character number counting unit 5 until the end of a line has the maximum number of characters in one line as an initial value, and receives the number of used characters from the fair copying processing unit 6 and subtracts them sequentially. When the processing is completed to the end of the sentence, the contents of the buffer 7 are transferred to the output file 8, and processing moves on to the next line.

A series of processing steps performed on a line-by-line basis is shown in the flowchart of FIG. First, in process 11, the number of remaining characters is set to, for example, 50.
Set to . Next, the statement number at the beginning of the line, the mark to indicate whether it is a comment line, and the jump destination number of the control statement are processed, and the number of characters required is calculated. If there is no corresponding item, insert a blank space. This is subtracted from the number of remaining characters and the processing result is written into the buffer 7.

Subsequently, indentation processing is performed regarding repetitive structures and conditional judgment sentences. The main part of the fair copying process starts from process 14, in which the first minimum structural unit (one delimiter of a command or statement) is received from the program structure analysis section 4 and the number of characters is calculated. This is subtracted from the number of remaining characters, and if the result is not negative, it is determined that it can be placed in the corresponding line, and the minimum structural unit is written into the buffer 7 as is. Repeat this until the end of the sentence.

If the subtraction result becomes negative during the process, write the line feed code to buffer 7, write the next line number that has been processed up to that point, perform the necessary indentation, and then write the minimum structural unit to buffer 7. Write. In this way, when all the processing for the target line read from the source file 3 is completed, in step 20 the contents of the buffer 7 are written to the output file 8 as the result of the clean-up process, and the process moves on to the next target line.

FIG. 3 is a diagram showing a program list after fair copy processing in the embodiment of the present invention. The problem of processing 210 lines in the conventional example shown in FIG. 5 is solved in FIG. 3 by delimiting the end of the sentence with a meaningful expression. In other words, the fourth minimum structural unit “C2*X (K-2
)”, the number of characters remaining was 3, so if we placed the next “03*Y(K-1)” (number of characters 9), the subtraction result would be negative, 3-9=-6. The fifth minimum structural unit is not placed at line 210, but is newly placed at line number 220 for continuity.The formatting process other than adding continuations is no different from the conventional example.

The foregoing explanation has been given using a FORTRAN77 file as an example of a source program, but the fair copy processing method according to the present invention
This is not limited to ORT RA N77 (it can be applied to other computer programming languages in exactly the same way).

〔Effect of the invention〕

As explained above, according to the present invention, by dividing a program into meaningful minimum structural units and performing a cleanup process based on these minimum structural units, commands and statements can be unconditionally divided at the end of sentences. This has the effect of making the program structure easier to see even in programs that include long calculation formulas, formulas containing multiple parentheses, or indentation due to multiple repetitions or multiple judgment structures.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention. FIG. 2 is a flowchart showing the processing steps of the embodiment of the present invention. FIG. 3 is a diagram showing a program list after fair copy processing in the embodiment of the present invention. FIG. 4 is a diagram showing a source program list manually created by the user using an editor in the embodiment of the present invention. FIG. 5 is a diagram showing a program list that has been formatted using a conventional FORTRAN formatting utility. 1... Terminal, 2... Editor, 3... Source file, 4... Program structure analysis section, 5... Remaining character number counting section, 6... Fair copy processing section, 7... Buffer ,
Death...output file.

Claims (1)

[Claims] 1. In a program cleanup processing device that cleans up a source program edited and input into a source file by an editor in response to input instructions from a terminal, program commands and statements are decomposed into a meaningful minimum structure. A program structure analysis section that counts the number of remaining characters to the end of the line, a remaining character count section that counts the number of characters remaining until the end of the line, and a cleanup process from the beginning of the line for each decomposed minimum structure, so that the output value of the remaining character count section becomes a negative value. A program formatting processing device comprising: a formatting processing unit that sometimes divides a remaining sentence into the next line as a continuation line.