Java Expression Evaluator - ONLYSAMURAI

k so this is gonna be coded so it works like a compiler. taking strings of arithmetic expressions, tokenizing the elements then putting them in a parse tree, doing a postorder traversal, placing the elements into a stack which uses reverse polish notation to calculate k?

i know where to go from postorder traversal on..but i have done research to find all i can on parse/decision trees and expression evaluators/compilers and i can't find anything on constructing the tree. only.samurai much help would be appreciated..thx yall. peace.

if its only directed at samurai why dont you pm him?

yea….umm…..rather than pm me hit me up on aim or msn sometime…. i'll be gone for like all weekend….

but i can probably help out

I'm willing to help too. Catch me on AIM or IRC.

sleazoid wrote: if its only directed at samurai why dont you pm him?

he's the only one i know thats proficient in java so i just put his name in the subject to make sure he read it. if your good at java then try this. but yeah i'll try to contact you this weekend samurai. got xfire by any chance?