Infix to prefix translator
Write a translation procedure INF-TO-PRE that converts infix notation into prefix notation.
(A ^ B / (C * D) ??" E + F) will be converted to (+ (- (/ (EXPT A B) (* C D)) E) F)
Assume the precedence of operations is exponentiation, division, multiplication, subtraction and then addition unless parentheses force something else (exponentiation is optional).
This is for LISP, not C, not Java, not C++, not C#. Don't email me saying you can do this in C or whatever. Its easy in those languages, I need this in LISP, if you can't do it dont bid.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):
a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment.
b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request.
3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).