JPH0497426A - List output system for language processing program - Google Patents

Abstract

PURPOSE:To shorten the discrimination time of a called routine and to improve developing efficiency by outputting the line number of a line calling the routine to the final line position of the called routine. CONSTITUTION:This list output system includes the 1st registering means for registering the name of a routine to be called and the line number of a calling line based upon the analytical result of the line calling the routine, the 2nd registering means for registering the leading and final lines of the routine, a deciding means for deciding the final line of the routine to be called, and a list output means for outputting the line number of the line calling the routine to the final line position of the routine to be called as a list based upon the contents of the 1st and 2nd registering means and the deciding means. In the above constitution, the line number of the line calling the routine is outputted to the final line position of the routine to be called. Consequently, time required for discriminating a calling routine and a called routine can be shortened and the developing efficiency can be improved.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a list output method for a language processing program.

7 [Prior art] As shown in FIG. 4, a general language processing program 42
inputs a source file 41 and outputs an object file 43 containing machine instructions and a list file 44 containing the contents of the source file.

As shown in the block diagram of FIG. 5, the host machine 51 on which this language processing program runs accepts operation instruction commands for the language processing program input by the user, has an input/output device 52 that displays processing results, and an input/output device 52 that displays the processing results. It has an arithmetic unit 53 for performing processing, and an external storage device 54 for storing source file list files and the like.

In the following, an assembler will be explained as an example of a language processing program.

In an assembler, things that can be written in an assembler source file according to the assembler source syntax are:
There are machine instructions and registers, pseudo-instructions that direct assembler operations, and user-defined labels. Assume that the routine call has the syntax shown in Table 1 on the next page.

As shown in FIG. 6, each processing section of the assembler includes a starting line analysis section 61 that analyzes the file name and subcommand specified when starting the assembler, a file input section 62 that inputs an input file, and a source file input section 62 that inputs an input file. a main unit 63 that parses the syntax of the file according to the grammar and converts it into machine instructions;
File pressure section 64 that outputs a file based on the main body section
and a termination processing section 65.

Among the processes of the main body section 63, the processes of a conventional assembler related to list output are shown in the flowchart of FIG. First, one line of the source file is read in step 11, the last line is determined in step 12, and if it is not the last line, the contents of that line are analyzed in steps 13 to 15, and the next line is read (step 11 ).

MOVE ADD ADD A.V. numerical value AV, AW AV, numerical value No. table Let's go.

numbers, Store in register AW.

do.

Double the contents of register AW.

Add the numerical value and the contents of register AW do.

move.

Repeat this and if you get to the last line, step 1
In step 6, the process moves to generation of object information to generate an object at the location address specified in the source file. Thereafter, in step 18, the location address information, object information, line number, and source file contents are output as a list of processing results.

For example, in the case of the source file in Table 2 that follows the grammar in Table 1, list information as shown in Table 3 would be output.

2nd table row number Source program 1
MOVE2
CALL3
0ALL4
J UMP5 5ubl: 8 5ub2: ADD RETURN ADD RETURN AW, 1 ubl ub2 $ AW, AW AW, 10 Table 3 Location Ly upper l-1 Object) fxJL! jj-so
- Su 00000 B80100
1 MOVE AW, 10003
E80500 2 CALL
5ub10006 E80500 3
CALL 5ub20009 EB
FE 4 JUMP 5000B
5 5ubl:000B
03CO6ADD AW, AWoooD
C37RETURN oooE 8 5ub2゜0
00E 050AO09ADD AW, 1000
11 C310 RETURN [Problem to be Solved by the Invention] In the above-described conventional list output method, location address information, object information, line numbers, and source file contents 4 are displayed. Therefore, with this list output method, when debugging a source file,
When debugging while following the flow of routine processing,
When a routine is called from another routine, when the last line of the called routine is reached, it is unclear whether to return to this routine or the other routine.

Therefore, it is necessary to remember which routine is calling this routine, or to inform the called routine of the routine name or line number that called this routine every time control is transferred from one routine to another. I wrote it in the list. Therefore, when there are a large number of routines or when a routine is called many times, it takes a lot of time to determine from which routine a certain routine is called, resulting in a problem in that development efficiency decreases.

An object of the present invention is to solve this problem by outputting the line number of the line that calls this routine at the last line position of the called routine in the output of the list of called routines. An object of the present invention is to provide a method for outputting a list of language processing programs, which reduces the time required to determine routines and improves development efficiency.

[Means to solve the problem]

The configuration of the present invention is to input a language processing source file consisting of a plurality of routines, and output routines in a list output method of a language processing program that outputs information on the language processing results of the source file written by Nice as a list. a first registration means for registering a called routine name and a line number of the called line based on an analysis result of the calling line; a second registration means for registering the first line and last line of the routine; determining means for determining the last line of the routine to be called; The second registration means is characterized by comprising a list output means for outputting a list of line numbers of lines that call this routine at the last line position of the called routine based on the judgment means.

〔Example〕

Next, the present invention will be explained in detail with reference to the drawings. In this example,
Using an assembler as a language processing program, the source
By changing the control order using the JUMP instruction in each routine in the file, the entity of the routine is not written after the RETURN instruction.

FIG. 1 is a flowchart of processing of a block diagram according to an embodiment of the present invention, and FIG. 2 is a flowchart of processing in which the processing of FIG. 1 is applied to the source files shown in Table 2.

As shown in FIG. 6, each processing section of the assembler includes a start line analysis section 41 that analyzes the file name and subcommand specified when starting the assembler, a file input section 42 that inputs an input file, and a source file input section 42 that inputs an input file. The main unit 43 parses the syntax of the text according to the grammar and converts it into machine instructions, a file output unit 44 generates a file based on the main unit, and an end processing unit 45.

Among the processing of this main body, the processing related to list output first reads one line of the source file in step 11, determines whether it is the last line in step 12, and if it is not the last line, in step 13 that line calls a routine. If the line is to be called, the name of the routine to be called and the line number of the line to be called are registered, and in step 14, if it is the first line or last line of the routine, that line is registered. Then step 15
The line contents are analyzed and the process returns to step 11 to read the next line.

If this is repeated and the last row is reached, offset information is generated in step 16. Then, in step J7, it is determined whether there is a routine to be called. If there is a routine to be called, the last line of the routine to be called is determined in step 19, and in step 20, the last line of the routine to be called is determined. Prints the line number of the line that calls this routine at the line position. Furthermore, if there are no more routines to be called, a list pressure is performed in step 18.

Among the processes of this main body, the processes related to list output are performed as shown in the flowchart of FIG.

First, one line of the source file is read in step 11, and if it is determined in step 12 that it is not the last line, then in step 21 it is determined whether the line is a CALL instruction. If this is a CALL instruction, in step 22 the CALL
Register the label name written in the instruction and the current line number in the call table. As a result, the name of the routine to be called and the line number to be called are registered in the call table.

The call table registered for the source program in Table 2 is shown as shown in FIG. 3(a). That is, the line number 32 to be called is specified for the label name 31 of the routine to be called. Then step 1
In step 5, the line contents are analyzed. These processes 21.22 are
This corresponds to step 13 in FIG.

On the other hand, if it is not a CALL instruction, it is determined in step 23 whether the line is a label pseudo-instruction.

If this is a label pseudo-instruction, the label name and current line number are registered in the label table in step 24. As a result, the line number where the label is written is registered in the label table.

The label table registered for the source program in Table 2 is shown as shown in FIG. 3(b). That is, the line number 34 of the entry of the routine is indicated for the label name 33 of the called routine. Thereafter, in step 15, the line contents are analyzed.

If the line is not a label pseudo-instruction, it is determined in step 25 whether the line is a RETURN instruction. This is RE
If it is a TURN command, the current line number is registered in the return table in step 26. As a result, the last line of the routine is registered in the return table. The return table registered for the source blockrum in Table 2 is shown as shown in FIG. 3(c). That is, line number 35 of the last line of the called routine is shown.

These processes 23 to 26 correspond to step 14 in FIG. After that, or if it is not a RETURN command,
The line contents are analyzed in step 15, and the process returns to step 11 to read the next line. This is repeated, and when the last line is reached, object information is generated in step 16.

Thereafter, in step 27, it is determined whether there is an unsearched label name in the call table. This process 27 corresponds to step 17 in FIG. If there is an unsearched label name in step 27, the label table is searched for the label name in the call table in step 28, and the line number corresponding to the label in the label table is extracted. This will tell you the line number of the entry of the called routine. The line number 32 corresponding to the label name 31 of the call table in FIG. 3(a) is
Since this label name 31 matches the label name 33 in FIG. 3(b), it is the fifth line indicated by the entry line number 34.

Next, in step 29, the return table is searched for the line number immediately after the line number of the label searched in step 28. This tells you the last line of the called routine. The line number immediately after line number 34 in FIG. 3(b) is the seventh line indicated by line number 35 in the last line of FIG. 3(c). These processes 28 and 29 correspond to step 19 in FIG.

From the above, the line number to be called is line number 32 in Figure 3(a).
In the case where the second line shown in , the last line of the called routine is the seventh line shown by line number 35.

Next, step 28
The line number of the label name of the call table, that is, the line number where the routine is called, is output in step 30. This process 30 corresponds to step 20 in FIG. If there is an unsearched label name in the call table in step 27, the label table is searched again for the label name in the call table in step 28. When there are no unsearched label names in the call table, a list of processing results is output in step 18.

In this way, in the list output method of this embodiment, regarding the output of the list of called routines, the line number of the line that calls this routine can be output at the last line position of the called routine. .

For example, in the case of the source program in Table 2 that follows the grammar in Table 1, a list as shown in Table 4 can be output.

Table 4 0000 B80100 1
MOVE AY, 10003
E80500 2
CALL 5ub10006 E80500
3 CALL 5ub2
0009 EBFE 4
JUMP$0008
5 5ubl :000B
03CO6ADD AW, AWooooD'
C327RETURNoooE
8 5ub2:000E 05
0AOO9ADD AW, 100011 C3
310 RETURN Effects of the Invention] As explained above, in the language processing program using the list output method of the present invention, in addition to the conventional list output information, the line that calls this routine is added to the last line position of the called routine. By outputting the line number, each time a function is called and control is transferred from one routine to another, the called routine can remember the routine name or line number that called this routine. This eliminates the need to write in the list from time to time, reduces the time required to determine which routine is calling a particular routine, and improves the efficiency of source program creation, as well as the efficiency of source program creation. effective.

[Brief explanation of drawings]

Figure 1 is a flowchart of the list output method according to an embodiment of the present invention, and Figure 2 shows the process of Figure 1 in a source file (Table 2).
Flow diagram when applied to Figure 3 (a) and (b)
, (c) is a diagram showing the contents of a call file, a label table, and a return table used in this embodiment, FIG. 4 is a configuration diagram of files handled by a general program, and FIG.
The figure is a block diagram of a host machine on which the program of Figure 4 runs, Figure 6 is a block diagram showing the configuration of the program processing section of Figure 4, and Figure 7 is a flow diagram of an example of a conventional list output method. . 11-20. 21-30... Processing Stellaf, 3
1゜33...Label name of call routine, 32.
...Line number of the call line, 34 ...Line number of the entrance of the call routine, 35 ...Line number of the last line of the call routine, 41... Source file nope 42
... Language processing blockrum, 43 ... Object file, 44 ... List file, 51 ... Host machine, 52 ... Input/output device , 53... Arithmetic device, 54...
External storage device, 61... Commencement and departure department, 62.
... File input section, 63 ... Main body section, 64
. . . File output section, 65 . . . Termination processing section. Agent: Susumu Uchihara, Patent Attorney / IL Figure 3 (C) 4th Recommendation: Yuseki

Claims (1)

[Claims] In the list output method of a language processing program that inputs a language processing source file consisting of multiple routines and outputs a list of information on the language processing results of the source file written by the user, the analysis result of the line that calls the routine is a first registration means for registering a name of a called routine and a line number of a called line based on the method; a second registration means for registering a first line and a last line of the routine; and a second registration means for determining the last line of the called routine. and list output means for outputting a list of line numbers of lines that call this routine at the last line position of the called routine based on the first and second registration means and the judgment means. A list output method for a language processing program, characterized in that: