JPS63289636A - Input editing device equipped with program attribute display function - Google Patents

Abstract

PURPOSE:To detect the input of misspelling by extracting a function name existing in an inputted program and classifying, discriminating and displaying a user definition function name and an undefined function name from the extracted element. CONSTITUTION:A function name extracting/sorting means 14 inputs the contents of a character string buffer 12 and decides whether each character string element is a function name or not. The sort of the character string can be decided by referring to a code name management table by using the character string as a key. The contents of the character string can be added or updated by registering the definition of a new number. After deciding the sort of each extracted function name, the means 14 transfers a light for the pair of the character position of the function name and color attribute to a display attribute management part 22. The management part 22 displays integrating functions of a specific format, integrating functions of a standard format, compiled user function names, other user function names, and undefined function names as respectively different color display attributes.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a program input/editing device, and particularly to a program attribute display suitable for checking and understanding the structure and syntax of a program.

[Prior Art] A program is usually written and input as a collection of character strings, so if these are simply displayed and output as character strings, the program becomes extremely difficult to understand. Therefore, programmers usually insert appropriate spaces and line breaks when inputting a program into an input editing device.

In addition, a pretty print function has been released in which the processing system of a programming language identifies the syntax and inserts an appropriate space at the beginning of the text, inserts a line break, or inserts a new line before outputting the text.

In addition, the program has a book structure, and the unit of the book structure is expressed by left and right parentheses.LIS P (L
In IST Processor), this structure display method is known in which the corresponding brackets are displayed with the same brightness or the same color (Japanese Patent Laid-Open No. 19939/1983).

Confirming the structure of a program using the main structure display is an important task, especially in LISP.

[Problems to be Solved by the Invention] The above-mentioned prior art does not take into account the display of attributes of program syntax elements, and is insufficient for checking and understanding the structure and syntax of a program, and for finding errors. was there.

In addition, the display of the program structure and attributes, including the conventional technology, can be performed when inputting or editing a program to immediately check and display it.
You need to be able to fix it.

An object of the present invention is to provide a program input editing device,
Its purpose is to display the structure of a program and the attributes of syntax elements in three different ways.

[Means for solving the problem] The above purpose is to
means for extracting function names, variable names, conditional syntax, repetition syntax, and block syntax, and classifying each function type and variable type from the extracted elements; means for classifying the elements of the extracted syntax according to attributes; The level of block syntax of extraction is achieved by means.

[Operation] The function name type classification means corresponds to the character string of the extracted function name. The type is determined by referring to the symbol name management table set in the execution environment of the language processing system. The symbol name management table stores the type of symbol name (character string element) when it is registered in the language processing system.

The variable name type classification means stores the data types of global variables in the symbolic name management table, but local variables are only temporarily created in a separate storage area during execution. Judgment is made individually based on the location of variables within.

That is, local variables are extracted from the same variable name as the function argument and the local variable declaration part in the block syntax. Classification by data type is achieved by detecting a local data type declaration statement and extracting the data type of a global variable by referring to a symbolic name management table.

In addition, the attributes of the elements of the conditional syntax and repetition syntax are identified by checking against a syntax table. The syntax table holds in advance the arrangement of the attributes of the elements corresponding to the syntax format determined by the language processing system. I'll keep it.

The means for the level of the block are the block identifier and the structure delimiter (left and right parentheses in LISP)
The level is displayed based on the count.

The structure of the various programs and the attribute display of the elements are selectively executed by each command, and are displayed in an identified manner without being mixed.

[Embodiment] FIG. 1 is a block diagram of the overall configuration of an embodiment of the input/editing device of the present invention. The dashed line in the figure is the control flow,
Solid lines indicate data flow.

Fig. 11 shows an input interpretation unit for character strings and commands input from an operator or programmer. conduct.

The input program is stored in 12 string buffers. 13 displays the contents of the character string buffer on the screen according to display attributes set in a display attribute management section 22, which will be described later.

In the example of FIG. 1, the function name in the input program is
This is a means of displaying with display attributes such as different display colors depending on the type of function.

Figure 1 14 shows the function name extraction and type classification means.
inputs the contents of the string buffer and determines whether each string element is a function name. By the way, the position where a function name can exist in the syntax (formula) of a program differs depending on the programming language.

For example, L I S P (Lisp Processo
r) program is (it+ i2...11...
), and each i1 is also described in a similar list format. As a general rule, the number 11 following the left parenthesis is the function name, and the following <ii is guaranteed to be the argument of that function. Therefore, in the LISP program, all string elements located after the left parenthesis are extracted as function name candidates, and a list is generated in which the strings are paired with the positions of the strings on the string buffer.

Next, the character strings that are candidates for the extracted function names are classified according to the type of function. By referring to the 15 symbol name management tables using the character string as a key, the type of function of the character string can be determined. The symbol name management table is prepared in the execution environment of the language processing system, and an example of its stored contents is shown in FIG. In the type column for each symbol, types such as functions built into the language processing system from the beginning, compiled user functions, user functions not yet compiled, etc. are listed.

By registering a new function definition, its contents are added or updated. The table also stores symbolic names of global variables and holds their current values. The value field for the function name is "niL" (meaning none), and the location of the function definition is indicated by a pointer. Here, a character string (symbol name) that does not exist in the symbol name management table is determined to be an undefined function. 14 determines the type of each extracted function name, and then transfers a list of pairs of character positions and color attributes of the function name to the display attribute management section 23. Figure 3 shows an example of displaying the types of function names used in the input program.
orm) in white, standard format built-in functions in sky blue, compiled user function names in blue, other user function names in yellow, and undefined function names in red. The type display of the function name in the input program allows you to check whether the input function has already been defined in languages such as LISP that construct programs by referring to functions, and also to prevent carelessness or misunderstanding. You can find misspellings by

The second embodiment is a means for displaying variable names in an input program with display attributes such as different display colors depending on the type of variable. FIG. 16 shows a variable name extraction/type classification means, which first inputs the contents of 12 character string buffers and determines whether each character string element is a variable name. The program is L
In the case of the ISP language, character string elements other than the function name are in principle interpreted as variables. A list of pairs of extracted variable names and positions of the variable names on the character string buffer is generated.

Next, the extracted variable names are classified into global variables that are valid across functions and local variables that are valid only within a specific syntax. In the LISP language, the same symbol (
The variable name (name) can be used as both a global variable and a local variable, and local variables are not stored in the symbol name management table, so it cannot be determined by referring to the symbol name management table. The classification is determined by the position of the variable name in the program, and the syntax in which the local variable is set is searched from the beginning of the program. Local variables are
Function arguments, block syntax (in LISP, LET statement,
PH10 statement), repetition syntax (00 statement in LISP)
is defined at a fixed position within. In LISP, variables other than local variables are basically interpreted as global variables. Even if it is a local variable, it is possible to specify a special variable that refers to the value of a global variable by a special declaration.Since this is not the essence of the invention, the explanation will be omitted.

After classifying the extracted variable names into local variables whose positions are determined by the syntax and global variables other than local variables, display attributes of each character string are set. The position data of each character string on the character buffer and the list of color attribute pair data are sent to the display attribute management section 22. In this embodiment, local variables are yellow and global variables are red. FIG. 4 shows an example of this display.

This embodiment is effective in preventing errors by forgetting to initialize local variables, discovering misspellings due to similar variables being displayed in different colors, and by checking and alerting global variables. Variables that are used only within a specified range (block) in a program are global variables, variables that are only initialized and are never referenced or updated can be visually checked, and variables that cannot be checked for errors due to syntax. This has the effect of discovering undesirable uses of .

It is also possible to classify and identify only the specified variable name, making it easy to check all the locations where the variable is referenced and updated in the program.

In addition, C language and Pa
In the Scal language, variables can be classified and identified by data type. In the means of item 16, the data type of the local variable is determined and classified by extracting a local type declaration statement, and the data type of the global variable is determined and classified by referring to the type column of the symbol name management table of item 15.

This embodiment has the effect of detecting illegal use of data types in input programs at an early stage.

The third embodiment extracts the condition judgment syntax in the program and creates the condition judgment part of one condition judgment part statement and the execution part when the condition is not satisfied (t
hen part) and the execution part when the condition is not satisfied (else).

FIG. 17 shows the conditional syntax extraction/element classification means.

17 inputs the program for the character string buffer described in 12 above, and extracts an IF statement and a C0ND statement from the input character string in the case of LISP. The range of one syntax is the range of the corresponding left and right parentheses.

Next, to classify the elements in the conditional syntax, reference is made to the syntax table 18 that describes the format of each syntax. FIG. 5 shows the contents of the syntax table. The table describes the data type and meaning of each argument of the IF statement and C0ND statement. IF
In the case of a statement, the number of arguments is 2 or 3, and the third argument may be omitted. Each argument must be a list (a sequence of elements) or an atom (
1 element), the first argument part is the condition determination part, the second argument is the execution part when the condition is not met, and the third argument is the execution part when the condition is not met.

In the case of a C0ND statement, the argument consists of a list of one or more, the first element (list or atom) of each argument list is the condition judgment part, and the second and subsequent elements of each argument are the execution part if the condition is not met. . The C0ND statement is a syntax that arranges various conditions and then executes 30 expressions when each condition is satisfied.

In Figure 5, the argument number and argument data type are [
] can be omitted, and () means that O or more can be specified.

As described above, by following the list of extraction conditional syntaxes according to the syntax format described in the syntax table, syntax elements are classified into predetermined attributes. Note that the contents of the syntax table may be incorporated into the program of the classification means.

As in the previous embodiment, a list of pair data of the position data on the character string buffer of the character string corresponding to each element of the syntax and the color attribute is sent to the display attribute management section 22. In Figure 6, IF
Syntax of 0 condition (IF
), the self-condition judgment part is colored red, the execution part when the condition is not met is colored yellow, and the execution part when the condition is not met is colored sky blue. Figure 6 is 1
The entire program is targeted for attribute display, and multiple IF
Example sentences are also shown. Multiple IF statements are color-coded for outer IF statements. The attribute display range can be determined by the position of the character cursor. To color code the inner IF statement, move the character cursor over the parentheses of the inner IF statement, and then start displaying the color of the conditional judgment syntax. This is possible. Note that the position of the character cursor is managed by the display attribute management section 22.

Particularly in the case of multiple branching syntax, the color-separated display of the present invention clarifies the flow of branching.

The fourth embodiment is a means for extracting repetitive syntax in a program and identifying and displaying expressions in a variable initialization section, end determination section, and execution section of the repetitive syntax.

FIG. 19 shows the repeated syntax extraction/element classification means,
Extract the 00 sentence from the string in the 12 string buffer.

Using the same procedure as for extracting function names, the elements of the 00 sentence are classified in the first order to extract the syntax (list) of Do as a function name.

As shown in the syntax table in Figure 5, the 00 statement takes a list of three or more arguments, and the first argument list of the extracted 00 statement is used as the variable initialization section and the second argument The list is determined to be the end determination part, and all the lists after the third argument are determined to be the execution part.

The procedure for setting color attributes is the same as in the previous embodiment. 0 in Figure 7
Repetition syntax (Do...) showing an example of attribute display for 0 sentences
In the 0 line display example where 0 is white, the initial setting part is sky blue, the end judgment part is red, and the execution part is yellow, the execution part further contains a Do syntax, but for the outermost 00 statement It is color coded. The inner 00 sentence can be color-coded by changing the attribute display range depending on the character cursor position, as in the third embodiment.

In the case of LISP, the D○ syntax has a complicated array of parentheses, so
This embodiment is useful for supporting confirmation of repeated structures.

In addition, 3rd. In the embodiment of the fourth invention, FIG. 17.19
When a syntax is extracted, if the number of arguments and data types of the extracted syntax do not match the contents of the syntax table shown in Figure 5, the elements of the syntax are not classified and the entire syntax is highlighted in red. Highlight it and display an error message.

The fifth embodiment is a means for displaying a syntax consisting of multiple blocks existing in an input program with different display attributes for character strings in the blocks for each block depth level.

FIG. 120 shows block syntax extraction/element classification means.

LIsp block syntax PROG, LET, and Do statements are extracted from the character strings in the 12 character string buffers. The extraction procedure is the same as the function name extraction, and the function name is PROG,
Extract the list of LET and Do. The range of each block level is determined by merging and sorting the list of the start position and end position of each block syntax on the character string buffer. Figure 8 shows an example of block level display, where the range of each block level is displayed in red, yellow,
Color-coded into blue, German, purple, and white. Note that, as in the previous invention, the display target range at the block level can be changed by the character cursor position.

The color coding according to the block level of this embodiment has the advantage that the effective range of control range local variables of program blocks can be visually checked.

The sixth embodiment is a means for displaying the depth level of the main structure of a program having a main structure such as LISP by color-coding the character strings in the program.

FIG. 121 shows this structure depth level determining means.

LISI' is a language in which the boundaries of book structures are expressed by left-finger brackets. 21 inputs the characters in the character string buffer 12, searches the left and right parentheses from the beginning, and searches the left parenthesis +1. The right parenthesis is counted as -1, and the depth level of each character string is determined. For each left and right parenthesis position,
Output the color attribute corresponding to the depth level at that point, and
The data is transferred to the display attribute management section No. 2. FIG. 9 is a display example of the color divisions according to the depth levels of this structure. The correspondence of colors for each level and the changes in the display target range for each color are the same as in the previous embodiment.

This embodiment has the advantage that it is possible to check the depth level of the syntax and to see any disturbances in the structure due to parenthesis input errors.

The seventh embodiment has almost the same purpose and means as the sixth embodiment, and in the display color coding, only the parentheses at the boundaries of this structure are displayed. The display example of this embodiment, in which only the process of setting the character string part to the original color is added, is effective when paying attention to the correspondence between the parentheses shown in FIG. In the sixth and seventh embodiments, the efficiency of checking is improved because the designated range of the program can be visually checked at one time, compared to the conventional method of repeating parenthesis correspondence one by one.

Note that in FIG. 10, the correspondence between the innermost parentheses does not indicate the color. Since we want to check the correspondence between parentheses that are usually far apart, we are trying to reduce the problems caused by multiple colors.

First to seventh embodiment means 14, 16, 17°19.2
0.21 is designed to be selected and executed by a command from the keyboard. Note that the identification display by the first to seventh means was realized by different color attributes, but in a monochrome display device, means such as changing the background pattern of the characters are adopted. Figure 1 22 is Figure 1 14.16
．． 17. 19.20.13 receives the pair data of the position on the character string buffer and the display attribute outputted from 21, and displays the character in the character buffer with the specified display attribute. control.

[Effects of the Invention] According to the means for identifying and displaying function names and variable names of the present invention, it is often possible to detect misspellings and spellings caused by the programmer's carelessness or misunderstanding. It is detected only after running or
According to the present invention, early release 1. If possible, you can greatly improve the productivity of your program.

According to the syntax attribute display means and the present structure display means of the present invention, it is possible to check the structure of a program with a complicated syntax structure. In the past, errors in the structure of a program often resulted in unexpected execution results, and it often took an unexpected amount of time to realize the error. The effect of being able to quickly check whether the input program matches the structure you intended is great. Furthermore, when understanding and reusing programs created by others, displaying program syntax attributes and structure is extremely useful.

[Brief explanation of the drawing]

FIG. 1 is an overall configuration diagram of an input editing device according to the present invention. Figure 2 is a symbolic name management table, Figure 3 is an example of displaying each type of function, Figure 4 is an example of displaying each type of variable, Figure 5 is a syntax table, Figure 6 is an example of conditional syntax attribute display, and Figure 7 is Example of repeated syntax attribute display, Figure 8 is an example of block syntax level display, Figure 9
The figure shows an example of displaying the depth level of the main structure, and item 10 shows an example of displaying the depth level of the boundary of the main structure. 14... Function name extraction/type classification means, 16... Variable name extraction/type classification means, 17... Conditional syntax extraction/element classification means, 19... Repetitive syntax extraction/element classification means, 20.・Block syntax extraction/element classification means, 21・
...Means for determining the depth level of this structure. 2nd Garden, 3rd Eye, 4th Figure 2, Evening Figure, 7th Concave, 3rd @ Zote, Figure 70

Claims (1)

[Claims] 1. In an input editing device capable of displaying and editing an input program on a screen, a function name existing in the input program is extracted, and the extracted function name is provided by a processing system. 1. An input editing device with a program attribute display function, characterized in that the input editing device has a means for classifying and displaying the names of built-in functions, compiled user-defined function names, uncompiled user-defined function names, and undefined function names. 2. In an input editing device that can display and edit the input program on the screen, extract the variable names that exist in the input program, and convert the extracted variable names into global variables that are valid across functions. An input editing device with a program attribute display function, further comprising a means for dividing and displaying local variables that are valid only within a specific range of a program, and a means for classifying and displaying variables according to their data types. . 3. In an input editing device that can display and edit the input program on the screen, extract the condition judgment syntax that exists in the input program, and execute the condition judgment part and the execution part when the condition is met of the extracted condition judgment syntax. 1. An input editing device with a program attribute display function, further comprising a means for identifying and displaying a section to be executed when a condition is not met. 4. In an input editing device that can display and edit the input program on the screen, extract the repetition syntax that exists in the input program, and execute the variable initialization part, end determination part, and execution part of the extracted repetition syntax. An input editing device with a program attribute display function, characterized in that a means for identifying and displaying the formula is added. 5. In an input editing device that can display and edit the input program on the screen, extract the syntax consisting of multiple blocks existing in the input program, and extract the syntax within the block for each depth level of the extracted multiple blocks. 1. An input editing device with a program attribute display function, characterized in that a means for displaying a character string with a different display attribute is added. 6. In an input editing device that can display and edit an input program on the screen, for a program having this structure, display character strings in the program with different display attributes for each depth level of this structure. An input editing device with a program attribute display function, characterized in that a means is added. 7. In an input editing device that can display and edit an input program on the screen, for a program having this structure, the delimiter at the start and end of this structure is displayed differently depending on the depth level of this structure. An input editing device with a program attribute display function, characterized in that a means for displaying attributes is added.