Basic Keyword Conflict Detection Scheme
Original Publication Date: 1984-Aug-01
Included in the Prior Art Database: 2005-Feb-04
When compiling computer programs or commands, it is necessary to ensure that valid combinations of keywords are specified on command statements. 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. This is very time consuming and difficult to automate. The solution to this problem 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.