Need an Algorithm to convert a boolen expression in InFix notation into its CAML format

Question

Need an Algorithm to convert a boolen expression in InFix notation into its CAML format. The expression may contain parenthesis, and logical operators: {AND, OR, NOT} with Relational operators: {<, >, >=, <=, <>,=}

A typical boolean expression may appear as follows:
a<2 AND (b>=4 OR c<>6 AND (d>=8 OR e=10))

The algorithm should be able to convert such an expression to its equivalent CAML XML format.

Thanks,
Nice Christmas/New Years gift is in the works for great ideas.
Howard