送交者: 红雨 于 2005-2-11, 20:06:55:

I just got a follow up from a phone interview. Here is one of the question I need the answer no late than tomorrow. I really appreciate it if anyone can help.

Thanks a looooooot!!!!!

========================================
Design a class structure to represent binary expressions in memory, such as
"(1+2)*3". Implement the eval() method which will return the numeric value of
the constant expression. You can assume that someone else is doing the parsing
of the text representation: they will simply call your constructors to store the
parsed version.

• If you are using LISP or Schema, it's really easy. - 松鼠 (0 bytes) 2005-2-12, 00:15:36
  • Thank you. - 红雨 (0 bytes) 2005-2-12, 03:22:27
• the best is to make a parent class expr, and a childern class - steven (285 bytes) 2005-2-11, 21:12:52
  • Thank you for your nice response! - 红雨 (15 bytes) 2005-2-12, 03:21:23
• I'd like to answer but seem unfair to other candidates - 火格Meshfire (0 bytes) 2005-2-11, 21:08:59

加跟贴