JPH0658675B2 - Syntax checking method - Google Patents

Description

The present invention relates to a syntax checking method, and more particularly to a syntax checking method for determining whether or not there is a contradiction in a statement description.

[Conventional technology]

In the conventional syntax checking method, at the time of recognizing each of the phrases constituting the sentence to be checked, whether or not a phrase that cannot be used in the same sentence as the phrase is already recognized in the check target is checked. I am looking into all the phrases that cannot be used in the same sentence as the phrase.

For example, when the phrase a and the phrase b cannot be used in the same sentence and the phrase a and the phrase c cannot be used in the same sentence, it is checked whether or not the phrase b is already recognized when the phrase a is recognized. , Also checks whether the phrase c has already been recognized.

[Problems to be Solved by the Invention]

In the conventional syntax checking method described above, for example, phrase a and phrase b
When and cannot be used in the same sentence, it is necessary to check whether or not phrase b has already been recognized when the phrase a is recognized, and conversely, when the phrase b is recognized, the phrase a has already been recognized.
It is necessary to perform processing to check whether or not is recognized.

As described above, in the conventional syntax checking method described above, at the time of recognizing each of the phrases forming the check target sentence, a phrase that cannot be used in the same sentence as the phrase is already recognized in the check target. It is necessary to check all the phrases that cannot be used in the same sentence as that phrase,
There is a disadvantage that the syntax check process becomes large and the processing time becomes long because of the redundant process.

Also, as the types of clauses that make up the syntax increase, checks for the increased clauses must be added to each other, so
There is a problem that the whole process must be changed.

An object of the present invention is to show a combination of phrases that cannot be used in the same sentence by a check matrix, and show a phrase that constitutes a check target sentence by a checked vector to prevent a contradiction of a combination of phrases that form a check target sentence. It is to provide a syntax check method that can be easily detected.

[Means for Solving the Problems]

The syntax check method of the present invention determines whether or not there is a contradiction in a combination of phrases that form a sentence to be checked, and detects a contradiction, in the syntax check method, (A) all the phrases used in the syntax A vector to be inspected having each bit position corresponding to 1 to 1 as a constituent element, and (B) a phrase having a row and a column corresponding to all the phrases used in the syntax, which cannot be used in the same sentence. A check matrix in which only the bit positions corresponding to the combinations are turned on, (C) For each of the tested vectors in the initial state where all the bit positions are turned off, Clause corresponding bit setting means for setting the bit position of the examined vector corresponding to each to ON state, and (D) the examined vector set by the clause corresponding bit setting means and the examination When each row of the check matrix corresponding to each bit position where the check vector is ON is called a check vector, a bit position where each check vector is ON and the check vector is ON Conflict detection means for determining whether there is a combination of phrases that cannot be used in the same sentence in the check target sentence by checking whether or not there is a case where the bit position matches with It is equipped with.

〔Example〕

 Next, embodiments of the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram showing an embodiment of the syntax checking system of the present invention.

The syntax check method of this embodiment shown in FIG.
It is determined whether or not there is a contradiction in the combination of phrases that form the, and if there is a contradiction in the check target sentence S, it is detected.

FIG. 2 is an object sentence description diagram of the Kobol language showing an example of the inspection object sentence S.

The inspection target sentence S in FIG. 2 is a PICTURE clause, PCCU.
It has an RS clause and a VLUE clause.

Also, the vector to be inspected 1 in FIG. 1 is a vector whose constituent elements are bit positions corresponding to all the phrases used in the syntax on a one-to-one basis.

FIG. 3 is a vector configuration diagram showing an example of the inspection vector 1.

The vector 1 to be inspected in FIG. 3 has bit positions that correspond one-to-one to the 16 phrases used in the syntax.

Furthermore, the check matrix 2 has a row and a column corresponding to all the phrases used in the syntax one-to-one, and turns on only the bit positions corresponding to the combinations of phrases that cannot be used in the same statement. ing.

FIG. 4 is a matrix configuration diagram showing an example of the inspection matrix 2.

As shown in FIG. 4, the check matrix 2 has respective rows and columns corresponding to the 16 phrases used in the syntax one-to-one, and bits corresponding to combinations of phrases that cannot be used in the same sentence. Only the position is turned on.

On the other hand, first, with respect to the tested vector 1 in the initial state in which all bit positions are off, the phrase corresponding bit setting means 3
Is activated each time one phrase of the sentence S to be inspected is recognized by the phrase recognizing means K, and the bit positions of the inspected vector 1 corresponding to the recognized phrase are set to the ON state.

In this case, as shown in FIG.
Bit positions 2, 5 and 7 respectively corresponding to the RE clause, the OCCURS clause and the VLUE clause are set to the ON state.

Next, the contradiction detecting means 4 first matches the inspected vector 1 of FIG. 3 set by the phrase corresponding bit setting means 3 with the inspected matrix 2 of FIG. 4, and the inspected vector 1 is ON. Check matrix 2 corresponding to each bit position
Each row of is extracted as a check vector.

In this case, the following three test vectors are fetched.

The check vector corresponding to bit position 2 → the check vector corresponding to 0100000001000000 bit position 5 → the check vector corresponding to bit position 000010100001000 bit → 7 It is determined whether or not there is a combination of phrases that cannot be used in the same sentence in the check target sentence S by checking whether or not there is a case where the bit position where the checked vector 1 is ON matches. can do.

In this case, the bit position in which the check vector corresponding to bit position 5 is ON and the bit position in which the tested vector 1 is ON match in the column of 7, and the check vector corresponding to bit position 7 is Since the bit position that is on and the bit position that the vector to be inspected 1 are on match in the column of 5, and there is a combination of phrases that cannot be used in the same sentence in the inspected sentence S, the conflict detection means 4 , Outputs an error message to the message output means M.

FIG. 5 is a flow chart showing an example of the operation of the contradiction detection means 4.

As shown in FIG. 5, the contradiction detecting means 4 firstly sets i, which is the bit position of the vector 1 to be inspected in FIG. 3, to an initial value 0 in step F1.

Next, in step F2, it is determined whether the bit position i of the vector to be inspected 1 is on or off. If it is on, the process proceeds to the next step F3. If it is off, the process is skipped and the process jumps to step F10. To do.

In the next step F3, a check vector corresponding to the bit position i is extracted from the check matrix 2 in FIG.

Next, in step F4, the logical product of the corresponding constituent elements of the vector under test 1 and the test vector is obtained, and the test vector having the result as the constituent element is created.

Next, in step F5, j indicating the bit position of the created check vector is set to 0, which is an initial value.

In the next step F6, it is determined whether the bit position of the check vector j is ON or OFF. Only when the bit position is ON, an error message is output to the message output means M in the next step F7.

Next, in step F8, 1 is added to j and the next step F
At 9, it is determined whether j has become 16, and when j is not 16 (NO), the process returns to step F6 and j is 16
Is. If (YES), the process moves to the next step F10.

In the next step F10, 1 is added to i, and the next step F
In 11, it is judged whether i becomes 16, and i becomes 16
If not (NO), the process returns to step F2 and i is 1
When it is 6 (YES), the process ends.

As described above, according to the syntax check method of the present embodiment, the combination of phrases that cannot be used in the same sentence is indicated by the check matrix, and the phrases forming the check target sentence are shown by the check vector, so that the check target sentence is It is possible to easily detect a contradiction in a combination of constituent phrases.

〔The invention's effect〕

As described above, according to the syntax check method of the present invention, the combination of phrases that cannot be used in the same sentence is indicated by the check matrix, and the phrases forming the check target sentence are indicated by the check vector to form the check target sentence. This has the effect that it is possible to easily detect a contradiction in a combination of phrases that are set.

Further, the syntax check method of the present invention, even when a new phrase is added or the handling of the phrase so far is changed, without changing the entire processing, the number of bits of the vector to be inspected and the check matrix can be changed. There is an effect that it is possible to easily deal with it by changing the size and the content.

[Brief description of drawings]

FIG. 1 is a block diagram showing an embodiment of the syntax check system of the present invention, FIG. 2 is a target sentence description diagram of the Kobol language showing an example of a check target sentence, and FIG. 3 is a vector showing an example of a checked vector. Configuration diagram, FIG. 4 is a matrix configuration diagram showing an example of the inspection matrix, and FIG. 5 is a flow chart showing an example of the operation of the contradiction detection means. 1 ... Inspected vector, 2 ... Inspection matrix, 3 ...
... phrase corresponding bit setting means, 4 ... contradiction detection means, K ...
Phrase recognition means, M ... Message output means, S ... Sentence sentence.

Claims (1)

[Claims] 1. A syntax check method for determining whether or not there is a contradiction in a combination of phrases constituting a sentence to be checked, and detecting the contradiction, in a syntax checking method, (A) one-to-one for all phrases used in a syntax A vector to be inspected having each bit position corresponding to as a constituent, and (B) a combination of phrases having one-to-one correspondence to all the phrases used in the syntax and which cannot be used in the same sentence. A check matrix in which only the bit positions corresponding to are turned on, (C) Corresponding to each of the phrases constituting the check target sentence for the checked vector in the initial state where all the bit positions are turned off Phrase-corresponding bit setting means for setting each bit position of the inspected vector to an ON state, (D) the inspected vector and the inspection matrix set by the phrase-corresponding bit setting means And each row of the check matrix corresponding to each bit position for which the tested vector is on is called a check vector, the bit position for which each check vector is on and the tested vector for Conflict detection means for determining whether or not there is a combination of phrases that cannot be used in the same sentence in the check target sentence by checking whether or not there is a case in which a certain bit position matches, for each check vector, A syntax check method characterized by the following.