3. Method for evaluating boolean expressions in a computer system comprising: creating a first vector from the boolean expression being evaluated by loading a first register with variable pointers corresponding with boolean variables in the expression and with two zeros preceding the first variable pointer and a zero between said variable pointers, creating a second vector from the boolean expression by loading a second register with values created from the boolean expression by combining the value of the boolean variables with the position numbers less one using an exclusive OR operation and using the false value of the variable in place of the true value when the variable is preceded by a logical AND operator, the created values being loaded in the odd positions of said second register starting with the third position thereof, the first position thereof being loaded with a zero and the even positions thereof being loaded with a one when the corresponding position of the variable in the boolean expression is bracketed by a left parenthesis preceded by a logical OR operator, with the value of the corresponding position of the last variable in the preceding product term and with a zero when there is no preceding product term, translating the contents of said first register using the boolean variables as a translate table, combining the translated contents of said first register with the contents of said second register using an exclusive OR operation, and translating the result produced from combining the translated contents of said first register with the contents of said second register using an exclusive OR operation where the result is used as the translate table as the result is changing during the translation, the result from last translation in the result being the value of the boolean expression evaluated.
3. Method for evaluating boolean expressions in a computer system comprising: creating a first vector from the boolean expression being evaluated by loading a first register with variable pointers corresponding with boolean variables in the expression and with two zeros preceding the first variable pointer and a zero between said variable pointers, creating a second vector from the boolean expression by loading a second register with values created from the boolean expression by combining the value of the boolean variables with the position numbers less one using an exclusive OR operation and using the false value of the variable in place of the true value when the variable is preceded by a logical AND operator, the created values being loaded in the odd positions of said second register starting with the third position thereof, the first position thereof being loaded with a zero and the even positions thereof being loaded with a one when the corresponding position of the variable in the boolean expression is bracketed by a left parenthesis preceded by a logical OR operator, with the value of the corresponding position of the last variable in the preceding product term and with a zero when there is no preceding product term, translating the contents of said first register using the boolean variables as a translate table, combining the translated contents of said first register with the contents of said second register using an exclusive OR operation, and translating the result produced from combining the translated contents of said first register with the contents of said second register using an exclusive OR operation where the result is used as the translate table as the result is changing during the translation, the result from last translation in the result being the value of the boolean expression evaluated. 6. The method of claim 3 where the boolean variables used as a translate table in the translation of the contents of said first register are loaded into a third register in positions succeeding the first position thereof in order according to the index numbers of said boolean variables, said first position of said third register being loaded with a zero.