User guide Xbool, version 1.0 

It's possible to prompt this guide by typing java Xbool or java Xbool -h.

 Xbool 1.0 - a tool for boolean algebra

 author Gianluca Trigili
 
 This tool can find a minimum synthesis SOP expression for any boolean function

 -Syntax example of input expression of given boolean function : java Xbool <expression> 
 
    Expression can be any well formed infix boolean algebraic expression with at most 26 variables.
    Only lowercase latin letters are admitted.
    Boolean operators are coded as follows 
    AND = * , OR = + , NOT = - .
    The NOT operator has the highest priority, followed by AND, followed by OR.
    Each expression where parentheses are omitted by associativity of the binary operators,
    is considered as left associated expression : a+b+c -> ((a+b)+c).
    Example of expression : (a+b)*-c .
    The following expressions are interpreted in the same way : 
    (a+b)*c,(a+b)*(c),((a+b)*c),
    which means that delimiters are considered only if they are important.
    Example : java Xbool "(a+b)*c"
    If you want to see more details about the intermediate steps of the Quine-McCluskey process you can add the -v flag.
    With the -v flag the program output shows the coverage tables that are generated during the synthesis process.
    Each row of a coverage table relates to a prime implicant previously identified during the expansion process.
    Each column, on the other hand, relates to a minterm that occurs in the SOP form of the same function. 
    The row with index i refers to the prime implicant with the same index in the table of prime implicants.
    The column with index j refers to the minterm with the same index in the minterm table.