Browse Prior Art Database

Duplicate Prevention in Keyword Conflict Detection Scheme

IP.com Disclosure Number: IPCOM000044765D
Original Publication Date: 1984-Jul-01
Included in the Prior Art Database: 2005-Feb-06
Document File: 2 page(s) / 14K

Publishing Venue

IBM

Related People

Olson, D: AUTHOR

Abstract

When compiling computer programs or commands, it is necessary to ensure that valid combinations of keywords are specified on command statements. It is also necessary to prevent duplicate keywords or synonyms from being specified on commands. Prior techniques have not guaranteed complete coverage of valid and invalid cases. Strictly pair-wise checking techniques require testing of all combinations of pairs of keywords to ensure that no conflicts exist, and these techniques will generally not successfully detect duplicate keywords or synonyms.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 53% of the total text.

Page 1 of 2

Duplicate Prevention in Keyword Conflict Detection Scheme

When compiling computer programs or commands, it is necessary to ensure that valid combinations of keywords are specified on command statements. It is also necessary to prevent duplicate keywords or synonyms from being specified on commands. Prior techniques have not guaranteed complete coverage of valid and invalid cases. Strictly pair-wise checking techniques require testing of all combinations of pairs of keywords to ensure that no conflicts exist, and these techniques will generally not successfully detect duplicate keywords or synonyms.

The basic solution to the problem of detecting keyword conflicts involves the use of masks to show relationships between keywords and the use of AND or OR logic to accumulate results. The difference between AND and OR logic is in which of the two possible values for a bit is dominant. In an AND operation, a zero bit is dominant. That is, if masks are ANDed together, each bit position in the result will be zero if either or both of the operands have zero values in the corresponding position. This fact allows the accumulation of zero values as composite results when combining masks. Similarly, a one-bit value is dominant in an OR operation. Thus, OR operations can be used to accumulate one values as the composite results. The technique of this invention can use either AND or OR operations, but for purposes of the examples given, AND operations are used.

For the purposes of the technique described, masks are collections of bits that are related in particular ways. There is a set of masks for each set of keywords, each mask being associated with one keyword. Each mask contains two bits for each keyword in the set. The values of these bits for both the associated keyword and the other keywords in the set provide the basis that allows the invention to work. There are two functions which are accommodated by the techniques of the invention: 1. Accumulate (or restrict) the set of keywords that

are valid with all of the previously processed

keywords.

2. Accumulate a usable list of the keywords that have

been specified. The...