JPH0713821A - Method for editing data - Google Patents

Abstract

PURPOSE:To easily understand the whole image of even the deep data structure of a nest by developing and inserting the structure of data of low-order level at the reference place of data of high-order level and displaying the data structure after the insertion. CONSTITUTION:A data editing process system 10 has a command analytic part 11 which analyzes the contents of a command inputted from an input/output device 20 and a data structure development instructing part 12 which instructs the extraction of a structure, specified based on the result of an analysis by the command analytic part 11, from a structure data base 30. According to the instruction of the data structure development instruction part 12, the structure is taken out of the structure data base 30 and further the data structure of low-order level is developed according to the instruction of the data structure development instruction part 12. Then a data structure development part 14 inserts the structure at the reference place of the data of high-order level and the inserted structure of the data of high-order level is displayed on the input/ output device 20.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data editing method, and more particularly to a data editing method having a nested structure.

[0002]

2. Description of the Related Art Conventionally, when editing nested data, generally, the data is edited at each level (hierarchy) of the nest, and the structure of the lower level data is edited as another data structure. There is.

FIG. 6 is a diagram showing an editing method of each data structure in the conventional editing method. In FIG. 6, one 1
If one data structure is called a “structure”, 1 is a structure X, 2 is a structure Y nested in the structure X, and 3 is further nested in the structure Y. It is the structure Z that exists.

In FIG. 6, in the conventional editing method, for example, an upper data structure, that is, a structure X1 is displayed on a screen, and a lower data structure, that is, a structure Y2 referred to in the structure X. Is specified, and the contents of the structure Y2, which is the specified lower data structure, is called and displayed on another screen, and this is edited. Similarly, the content of the structure Z3 is called on another screen and edited.

[0005]

However, in the above-mentioned prior art, in the nested data structure, in order to understand the whole picture of the data structure, it is necessary to open a number of screens according to the nesting level. There is a problem that the larger the number of screens to open and the number of screens to open, that is, the deeper the nesting level, the easier it is to understand the whole picture of the data structure.

It is an object of the present invention to provide a data editing method which enables a user to easily understand the whole picture of a data structure having a deep nest.

[0007]

In order to achieve the above-mentioned object, according to the present invention, lower level data is referred to when lower level data is referred to in upper level with respect to data whose data structure is defined for each nesting level. The structure of the read lower level data is expanded and inserted at the reference point of the upper level data, and the data structure after the insertion is displayed.

[0008]

According to the above means, the nested data structure for each level is defined in advance, and when referring to the upper level data, the lower level data is incorporated into this upper level data. If so, the structure of this lower level data is read. Then, the structure of the read lower level data is expanded and inserted at the reference point of the upper level data. Then, the upper level data structure in which the lower level data structure is inserted is displayed.

As a result, even if the data structure has a deep nesting level, the data structure of the lower level is expanded and inserted into the data structure by expanding the data structure of the higher level. Can be easily understood.

[0010]

Embodiments of the present invention will now be described in detail with reference to the drawings. In all the drawings for explaining the embodiments, parts having the same function are designated by the same reference numerals, and repeated description thereof will be omitted.

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

In FIG. 1, 10 is a data editing processing system to which the present invention is applied, 20 is an input / output device for displaying command input / output and editing results, and 30 is a structure for storing structure data. It is a body database.

The data edit processing system 10 analyzes a content of a command input from the input / output device 20, and a command analysis unit 11 and a structure database which specifies a structure designated based on the result analyzed by the command analysis unit 11. A data structure expansion instruction unit 1 for instructing to extract from 30
2. A data reading unit 13 for extracting a structure from the structure database 30 based on the instruction of the data structure expansion instruction unit 12, and a lower level data structure is expanded according to the instruction of the data structure expansion instruction unit 12 A data structure expansion unit 14 to be inserted at a reference point of level data,
It is composed of a data structure display unit 15 for displaying the structure of the inserted upper level data on the input / output device 20.

Reference numeral 16 is a structure as data stored in the structure database 30 (hereinafter, structure data 16
That is).

In FIG. 1, when a data structure display instruction is input from the input / output device 20, control is passed to the data structure expansion instruction unit 12 via the command analysis unit 11, and the data structure expansion instruction unit 12 receives an instruction. Based on the data reading unit 13, the structure data from the structure database 30 to the structure data 16
Read out.

Then, the read structure data 16
If another structure data 16 is incorporated in the data, the data reading unit 13 further reads the incorporated structure data 16 and the data structure expansion unit 14 applies the corresponding structure data 16 to the original structure data 16. Deploy and insert in place. This expansion and insertion processing is repeated according to the nesting level.

In this way, the structure data 16 in which the lower-level structure is expanded and inserted into the upper-level structure
Is displayed on the input / output device 20 via the data structure display unit 15.

FIG. 2 is an image diagram of a data structure having a nest structure expanded by applying the present invention.

In FIG. 2A, the structure Y is added to the structure X1.
2 shows a nest structure in which the structure 2 is incorporated and the structure Z3 is further incorporated in the structure Y2. In this state, for example, when the expansion instruction of the structure X1 is performed as shown in FIG. 2B, the structures Y2 and Z3 are expanded in the structure X1 as shown in FIG. 2C. It will be displayed as the whole picture 4 of the inserted data structure.

FIG. 3 is a flow chart showing the processing procedure of data structure expansion to which the present invention is applied.

In FIG. 3, first, when a data structure display instruction is input from the input / output device 20, the instruction content input by the command analysis unit 11 is analyzed, and the instruction is passed to the data structure expansion instruction unit 12. Data reading unit 13
From the structure database 30 to the structure data 16
Is read.

Then, in accordance with the expansion instruction of the data structure expansion instruction unit 12, it is searched whether or not there is a character string that specifies another structure in the specified structures (step 31).
Then, if there is a character string that specifies another structure in the specified structure according to the search result (step 32: YES), the structure data 16 is read (step 33), and the read structure is read. The data 16 is developed based on the character string (step 34), and the process returns to step 31 and is processed.

The processing from step 31 to step 34 is repeated until there are no unexpanded structures (step 3
2: NO), the expanded structure is displayed on the input / output device 20 (step 35), and the process ends.

FIGS. 4A, 4B and 4C are diagrams showing a specific example in which the present invention is applied to expand data having a nest structure.

In FIG. 4A, 40 represents the data structure of the structure X1, 50 represents the data structure of the structure Y2, and 60 represents the data structure of the structure Z3.

Each structure is at level 4 of each structure.
01, a structure data type 402, and a structure name 403.

For example, the name 403 "a1" 405 of the "2" 404 of the level 401 in the structure X1 specifies the type 402 of "int" 406 as the data type 402, but FIG. This is the name 403, as shown in
It is indicated that “al” 405 is the name 403 given to the 4-byte numerical data area 416.

Further, the name 403 "a2" 408 of the "2" 407 of the level 401 in the structure X1 specifies the type 402 of the data type "char" 409, but FIG. 4B. This is the name 403, as shown in
“A2” 408 indicates that the name 403 is added to the 1-byte character data area.

In the data structure 50 of the structure Y2, "2" of the level 401, "b2" of the name 403 of the name 410.
(10) ”411 indicates that the data type 402 is“ char ”
Although a type of 412 is designated, as shown in FIG. 4C, this is the name 403 in which the name 403 “b2 (10)” 411 is given to the 1-byte character data area 417, and each 1 The byte area is "b2 (0)" 411-1,
"B2 (1)" 411-2, ... "b2 (9)" 411
-10 indicates that it can be referenced by name.

Also, level 401 "2" in the structure Y2.
The “* b4” 414 of the name 403 of the 413 specifies the type “char” 415 of the data type 402. However, as shown in FIG. 4C, this is “* b4” 414.
Indicates the name 403 assigned to the 4-byte address area, and the 1-byte character data area 4
This indicates that 17 addresses are stored.

FIGS. 5A, 5B and 5C are diagrams showing the expansion processing of a data structure having a nest structure. In FIG. 5A, the name 401 is now included in the structure X1.
A structure Y2 named "a3" 501 exists in
It is assumed that a structure Z having a name 401 of “b3” 502 exists in the structure Y2.

When the expansion instruction of the structure X1 is given as shown in FIG. 5B, the data type 402 is written in the structure X1.
The presence of the character string of "structY" 503 indicates that it is a nested structure, and the data type 40
Structure Y2 under the line of "structY" 503 of 2
Expand the data structure of.

Then, in the structure Y2, the data type 40
2 By the existence of the character string of "structZ" 504, it is understood that another nesting is performed, and "s
The data structure of the structure Z3 is expanded based on the character string "tructZ" 504.

The result thus developed is shown in FIG. 5 (C). As shown in FIG. 5C, a structure Y1 having one level 401 is expanded in the structure X1, and a structure Z3 having one level 401 in the structure Y2 is expanded. It can be seen that the final level 401 of the body X1 is “4”.

As described above, by using the data structure editing method to which the present invention is applied, the entire image of the data structure can be easily grasped even when the nest level (hierarchy) is deep. .

In this embodiment, the nest structure has been described at three levels, that is, the three-layer structure of the structures X, Y and Z, but the same processing is performed regardless of the nest depth. It is clear that this makes it possible to display an overview of the data structure.

In this embodiment, the example of displaying the whole image of the data by instructing the expansion of the structure X has been described. However, by specifying the expansion instruction of the structure Y, the portion of the structure X is indicated. It is also possible to develop the structure Y, which is a structure.

[0038]

As described above, according to the present invention,
For the data whose data structure is defined for each nesting level, the lower level data is read when the lower level data is referenced in the upper level, and the read lower level data structure is expanded to the reference point of the upper level data. Since the data structure after inserting is displayed after inserting, even if the nesting level is deep, the lower level data structure is not opened as a separate screen from the upper level data structure, You can easily understand the whole picture of the data structure including the data structure.

With this, it is possible to understand the existing data structure accurately in a short time.
This has the effect of facilitating editing work such as correction, or work of creating a program using such a nested data structure, thus improving work efficiency.

[Brief description of drawings]

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

FIG. 2 is a diagram showing an image when a data structure is developed by applying the present invention.

FIG. 3 is a flow chart showing a procedure for expanding a data structure according to the embodiment.

FIG. 4 is an explanatory diagram for explaining a nested data structure of the embodiment.

FIG. 5 is a diagram showing a data structure expansion process of the embodiment.

FIG. 6 is a diagram showing an image when a data structure is expanded by a conventional editing method.

[Explanation of symbols]

1 ... Structure X, 2 ... Structure Y, 3 ... Structure Z, 4 ... Overview of data structure, 10 ... Data editing processing system, 11
... Command analysis unit, 12 ... Data structure expansion instruction unit, 13
... Data reading section, 14 ... Data structure expanding section, 15 ...
Data structure display unit, 16 ... Structure data, 20 ... Input / output device, 30 ... Structure database.

Front Page Continuation (72) Inventor Osamu Nishiguchi 6-81 Onoe-cho, Naka-ku, Yokohama-shi, Kanagawa Hitachi Software Engineering Co., Ltd. In-house

Claims (1)

[Claims] 1. A method for editing data having a nest structure in which another data structure is incorporated in a data structure, wherein data defined for each nest level has a higher level than a lower level. At the time of referring to the data, the lower level data is read, the structure of the read lower level data is expanded and inserted at the reference point of the upper level data, and the data structure after the insertion is displayed. How to edit.