JP2009054125A - Document information display system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To analyze the grammar of a document and display acquired information without passing through a compiler linker using a grammar description file which a user can customize. <P>SOLUTION: The state of each character of the document is determined, and the information acquired from the state of each character is displayed, based on a state transition rule consisting of a plurality of ästate-character string-state transition destination in matching of character string} created in order to express the grammar of the document. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to a document information display system.

  Conventionally, a text editor has a function of coloring according to grammatical information incorporated in the editor, coloring a part or line that matches a regular expression, or coloring a keyword. In addition, in the integrated development environment (IDE), there is a function of coloring or complementing input based on identifier information acquired from the compiler / linker.

  In document editing systems and document reference systems, coloring based on grammatical information, complementary input, and display of additional information are useful for improving the quality and efficiency of document creation. However, traditional systems may want more information and more customizability. In addition, when compiling and linking in a dedicated environment is required, there are problems such as requiring the cost and risk of migration and being unable to use in a language that is not the target.

  SUMMARY OF THE INVENTION An object of the present invention is to analyze a document grammar and display information obtained by using a grammar description file that can be customized by a user without passing through a compiler / linker.

  The invention of claim 1 for solving this problem is a system configured as shown in FIG. In FIG. 1, reference numeral 1 denotes grammar storage means for storing a state transition rule made up of a plurality of {state, character string, state transition destination when matching character strings} created for the purpose of expressing the grammar of a document. .

  Reference numeral 2 denotes a document, which is an object of analysis.

  Reference numeral 3 denotes grammar analyzing / storing means, which determines and stores the state of each character of the document 2 in accordance with the state transition rules stored in the grammar storing means 1.

  Reference numeral 4 denotes display means for displaying information obtained from the state of each character determined by the grammar analysis / storage means 3.

  The procedure for determining the state of each character in the grammar analyzing / storing means 3 is as follows.

  The grammar analysis / storage means 3 has a pointer for storing the position of the character in the document and a state variable for storing the current state. At the beginning of processing, the pointer is at the beginning of the document and the state variables are in the initial state. The grammar analysis / storage unit 3 first searches the state transition rule of the grammar storage unit 1 for a case where “state” matches a state variable and “character string” matches a character string after the pointer. If there is a match, the state transition rule “state transition destination when matching character strings” is set as a new state transition destination in the state variable. Then, the pointer is advanced, and the state of the character between the old pointer and the new pointer is determined and stored in the state stored in the state variable. The above processing is repeated until the pointer reaches the end of the document.

  According to the present invention, a user-customizable grammar description file can be used to analyze document grammar and display information obtained without passing through a compiler / linker.

  Compared to the case of newly introducing an integrated development environment, it is not necessary to pass through a compiler or linker, and the development environment currently in use can be used as it is, so there is no need for migration costs and risks.

  Moreover, since the grammar can be customized by the user, it can be used even with programming languages that are not major. Furthermore, even in a language that does not have a static analysis function or an integrated development environment, a check function or a warning display function based on information obtained by the present invention can be used.

  Hereinafter, embodiments of the present invention will be described with reference to FIGS. 2 is a configuration diagram of an embodiment of the present invention, FIG. 3 is a basic grammar of a grammar description file, FIG. 4 is an example of a state transition operation, FIG. 5 is an example of a grammar analysis variable setting operation, and FIG. 7 is an example of a function call location storage operation, FIG. 7 is an example of a control structure storage operation, FIG. 8 is an example of a source analysis support operation, FIG. 9 is a description example of a grammar description file for displaying warning information, and FIG. FIG. 11 shows an example of a grammar description file description for C language.

  In FIG. 2, 1a and 1b are grammar description files, 1c is grammar description data, 2 is a document, 3 is grammar analysis / storage means, and 4 is display means. The document information display system is incorporated in a document editing system or a document reference system.

  The grammar description file is a file that stores a plurality of rules consisting of {arrangement of operations performed when a state / condition character string / condition character string matches} with specifications as shown in FIG.

  One state can be described by dividing it into a plurality of state [state name] {. When * is described in the state name, it represents an arbitrary state and indicates that the rule is common to all states. It is possible to describe a plurality of state names in [State Name] by separating them with commas, and in this case, the rules are common to the plurality of states.

  A regular expression can also be described as a conditional character string. In this case, R is described before double quotation, for example, R “[az] +”.

  The grammar description file can be described in multiple files. Although two files are described in FIG. 2, three or more files may be used. Files can be added for each project, team, and person in charge. In the added file, the grammatical structure cannot be changed greatly, but at least a rule for warning information display and check described later can be added. As a result, for example, a warning information display or a check rule can be added as a measure for preventing a recurrence when a problem occurs.

  The system reads a plurality of grammar description files, merges them for each state, and stores them in the memory as grammar description data 1c.

  Next, the grammar analyzing / storing unit 3 analyzes the grammar of the document 2 and determines the state for each character according to the procedure described below.

  The grammar analysis / storage means 3 has a pointer for storing the position of the character in the document and a state variable for storing the current state. At the beginning of processing, the pointer is at the beginning of the document and the state variables are in the initial state. A state in which the state name is “idle” in the grammar description data 1c is set as an initial state.

  From the grammar description data 1c, the condition character string in the current state is searched, and the character string after the current pointer of the document is found. If the length of each condition character string matches, it is considered a match.

  If a matching condition character string is found, operations corresponding to the condition character string are executed in order, and the pointer is advanced by the length of the condition character string. The state of the character between the old pointer and the new pointer is determined by the state stored in the state variable. However, depending on the operation to be performed, the state variable is changed before or after the pointer is advanced.

  If no matching condition character string is found, the pointer is advanced by one word or one symbol. The state of the character between the old pointer and the new pointer is determined by the state stored in the state variable.

  Even if a matching condition character string is not found, if default is described as a condition character string in the grammar description file, it is regarded as a match.

  FIG. 4 is an example of a state transition operation among the operations described in the grammar description file. For example, “ChangeState (x)” changes the state of the state variable to x and then advances the pointer. “ChangeStateFromNextChar (x)” advances the pointer and then changes the state of the state variable to x. “PushState (x)” saves the current state, changes the state variable state to x, and then advances the pointer. “PopState” changes the state of the state variable to the state stored in PushState, and then advances the pointer.

  Further, the grammar analysis / storage means 3 has a variable (hereinafter referred to as a grammar analysis variable) for storing the contents and position of the character string in the document. Also, it has an array (hereinafter referred to as a token stack) that sequentially stores the contents and position of analyzed tokens (a token is one word or symbol) in a document. Note that these conceptually store the contents and position of the character string, but the contents of the character string exist in the document. Therefore, in order to save memory and processing time, they are stored in the document. It is only necessary to memorize the position of.

  In the grammatical analysis variable, the contents and position of the character string are stored by the operation “SetVar˜” described in FIG. For example, a character string from the position where the operation “SetVarStart (x)” is executed to the position where the operation “SetVarEnd (x)” is executed is stored in the grammar analysis variable.

  In addition, the designated character string in the token stack is copied to the grammar analysis variable by the operation “SetVarWithTokenStack”.

  The character string stored in the grammar analysis variable can be stored in the grammar analysis / storage unit 3 as an identifier name of a function, a variable, or the like, for example, by the operation “AddIdentifier” illustrated in FIG.

  Further, the grammar analysis / storage unit 3 stores, for each line, the state of the line start position, the state saved by “PushState (x)”, and the identifier information stored in the line.

  When the document is edited, the edited line is analyzed again. However, since it is necessary to reconfigure the grammar analysis variable and token stack, grammar analysis is started by going back to the line where the line start position is in the initial state, and the line start position is the same as before editing. The grammar analysis ends with

  Finally, the display means 4 displays information obtained from the state for each character. For example, the characters in the comment part are displayed in red.

  Further, the display unit 4 can display various information and document check results based on the information stored in the grammar analysis / storage unit 3 by the operations described in FIGS. 6, 7, and 8. I can do it. Hereinafter, each operation described in FIGS. 6, 7, and 8 will be described.

    By the operation “AddIdentifier” illustrated in FIG. 6, the grammar analysis / storage unit 3 stores the character string stored in the grammar analysis variable as the name of an identifier such as a function / variable, additional information, or a type name. The position of the identifier name is stored. Further, by regarding the position between the positions of the names of two functions as the function definition position, the definition position information of each function can be obtained. Thereby, the display means 4 can display the following information.

  -Color and display identifier names such as function names and variable names on the document display screen, or display a list of identifier names such as function names and variable names in the document. In addition, by inputting the first few characters of the identifier name, the subsequent characters can be automatically complemented and input.

  -On the document display screen, clicking the name part of an identifier such as a function name or variable name, selecting it, or entering it on the keyboard, its category name (type of function, variable, etc.) and additional information ( Argument) and type name. It also displays the contents of function definitions and declarations.

  By the operation “Function Call” illustrated in FIG. 6, the grammar analysis / storage unit 3 stores the location of the function call and the function name thereof. Further, by analyzing all the documents in the same project, the call location of all functions and the relationship information of calling / calling between all functions can be obtained. The function call location is included in the information stored by the operation “AddIdentifier”. Thereby, the display means 4 can display the following information.

  -For the function currently selected on the document display screen, the name of the function calling the function is displayed retroactively (backtrace display). When there are multiple callers, display them at the same time, or display a mark indicating that there are multiple callers, so that the user can click to display other callers . Also, by clicking on the function name, the function definition and declaration are displayed.

  -Display the relationship between function calls / calls in tables and diagrams. Click a function name in the table or figure to display the definition and declaration of that function.

  -Compare the argument type with the formal argument type, and if they do not match, display a warning near the function call location on the document display screen. The type of the argument and the type of the dummy argument can be obtained from the information stored by the operation “AddIdentifier”.

  By the operation “ForLoopStart” described in FIG. 7, the grammar analysis / storage unit 3 stores the type and position of the control statement of the program. Thereby, the display means 4 can display the following information.

  -Display the control structure in a flowchart, PAD diagram, directed graph, etc. When the text on the document display screen is selected, the corresponding part in the flowchart or the like is highlighted. When one place in the flowchart or the like is clicked, the corresponding portion of the text in the document display screen is displayed.

  -Realize functions similar to debugger step execution on the source code. For example, when the pseudo step-in function button is clicked, if there is a call function in the currently selected line, the function definition is displayed, and the first line of the function definition is selected. If there is a conditional branch in the currently selected row, let the user choose which to go to. Lets the user choose to end or continue the iteration if there is an iteration end on the current selection line. Return to the caller's line with the pseudo step-out button. Furthermore, a back trace of the function call is displayed, and identifier information such as a local variable of the current function is displayed.

  -The control route is displayed with an arrow on the document display screen. For example, in the assembler language, an arrow is displayed with the JMP instruction location as the start point and the jump destination label location as the end point.

  -To check the completeness of the white box test, display a check box near the conditional branch on the document display screen so that the check box can be filled in. In addition, the coverage rate is displayed. The number of check boxes and titles are changed according to the type of coverage (branch coverage, etc.) set in advance. In addition, the contents of the document and the check entry information in the check box are collected together so that the test result can be saved in a separate file or printed.

  By the operation “DisplayWarning” illustrated in FIG. 8, the grammar analysis / storage unit 3 stores a portion where warning information is to be displayed. As a result, the display unit 4 displays the warning information at the corresponding location on the document display screen. The warning information is displayed in such a manner that the background color of the portion is first displayed in red and the content of the warning information is displayed when the portion is selected.

  Further, by the operation “DisplayWarningIf” described in FIG. 8, the grammar analysis / storage means 3 changes the location where warning information should be displayed only when a flag is set in the character string of the contents of the designated grammar analysis variable. Remember.

  The grammar analysis / storage unit 3 has an array for storing a flag-set character string. The character string in the specified grammatical analysis variable is added to the array by the operation “SetFlag”. The character string in the specified grammatical analysis variable is deleted from the array by the operation “ClearFlag”. All the contents of the array are deleted at the function definition boundary. By the operation “DisplayWarningIf”, the grammar analysis / storage unit 3 checks whether or not the character string of the content of the specified grammar analysis variable is included in the array, thereby determining whether or not a flag is set in the character string. Judging.

  Thus, for example, when it is necessary to check the length of the variable before passing the variable to the function, but the description of the length check of the variable is forgotten, warning information can be displayed. The grammar description file is described as shown in FIG. 9, and when the condition string matches the length check function name, the operation “SetFlag” is executed, and the condition string matches the function name whose length should be checked in advance. In such a case, the operation “DisplayWarningIf” is executed.

  By the operations “SymmetricCheckIn” and “SymmetricCheckOut” illustrated in FIG. 8, the grammar analysis / storage unit 3 stores the existence position of the character string to be corresponding 1: 1 and the type of the correspondence check. By using this and the information of the control structure obtained by the operation shown in FIG. 7, the display means 4 checks whether or not 1: 1 correspondence can not be obtained during program execution, and if there is a check error, A warning can be displayed.

  For example, by describing in a grammar description file as shown in FIG. 10, it is possible to check the 1: 1 correspondence of memory allocation / release. When the character string in the document matches the conditional character string “malloc”, the grammar analysis / storage unit 3 stores the location and the type of correspondence check “memoryallocate”. If the condition character string “free” is matched, the location and the type of correspondence check “memorylocate” are stored. The display means 4 traces several control routes according to the control structure of the program for each type of correspondence check, and passes through the location stored in “SymmetricCheckIn” and the location stored in “SymmetricCheckOut”. If there is a route that does not match the number of times, it is determined that 1: 1 correspondence is not achieved, and warning information is displayed.

  The operation “Import” shown in FIG. 8 causes the grammar analysis / storage means 3 to store that another file (for example, a C language header file) is imported there. As a result, the display means 4 can instruct the system to analyze the grammar of the imported file and the imported file in the imported file, and can display the obtained identifier information and the like.

  By the operations “IncIndent” and “DecIndent” illustrated in FIG. 8, the grammar analysis / storage unit 3 stores the indent level of each line. The initial indent level is 0, and is incremented by 1 by the operation “IncIndent” and decremented by 1 by the operation “DecIndent”. The indent width information is stored in the document. When the indent level is incremented by 1, the next line is indented to the right by the indent width from the current line. When the indent level is decremented by 1, the next line is indented. Is to the left of the current line by the indent width.

  By the operations “LeftValue” and “RightValue” shown in FIG. 8, the grammar analysis / storage means 3 stores the location of the assignment statement, and the character string in the grammar analysis variable is the left side value / right side value of the assignment statement. Remember. As a result, the display unit 4 searches for an identifier whose name is the character string stored as the left side value / right side value, and if the type of the left side value and the right side value does not match, the location of the assignment statement on the document display screen Warning information can be displayed in the vicinity of. This is particularly useful when using languages with insufficient type checking capabilities.

  FIG. 11 is an example of a grammar description file for storing a C language function name as an identifier and setting a comment in a document as a state comment. Although it is necessary to add more rules for practical use, they are described to assist understanding of the embodiments.

  The description of the grammar description file can be edited by the user with a graphical user interface, and it is preferable that the system converts the grammar description file into the grammar described in the present embodiment and saves it.

  The information display on the display means 4 is displayed in real time without requiring a complicated operation during document editing / referencing, and the document editing / referencing operation is not hindered by the slow processing speed. Good to do. In addition, information should be displayed at a location that does not interfere with editing / referencing of the document. The subject that performs the editing / reference work is a human being, and the point in carrying out the present invention is to appropriately support the person who performs the editing / reference work casually and appropriately.

  It is a principle block diagram of this invention.   It is a block diagram of embodiment of this invention.   This is the basic grammar of the grammar description file.   It is an example of a state transition operation.   It is an example of a grammar analysis variable setting operation.   It is an example of an identifier storing operation / function call location storing operation.   It is an example of control structure memory operation.   It is an example of a source analysis support operation.   It is a grammar description file description example of warning information display.   It is a grammar description file description example of a 1: 1 correspondence check.   It is an example of the grammar description file for C language.

Explanation of symbols

1 Grammar storage means 2 Document 3 Grammar analysis / storage means 4 Display means 1a, 1b Grammar description file 1c Grammar description data

Claims (1)

A grammar storage means for storing a state transition rule made up of a plurality of {states, character strings, state transition destinations when matching character strings}, created for the purpose of expressing the grammar of a document;
Grammar analysis / storage means for determining and storing the state of each character of the document in accordance with the state transition rules stored in the grammar storage means;
It comprises display means for displaying information obtained from the state of each character determined by the grammar analysis / storage means,
Document information display system.

Images