> I did this in 1993 in a first year programming class. > I look around at home and see if I still have the notes ... > > (Hint: when righting the parser to evaluate infix expressions, you use a stack. > It turns out that this stack is in fact a postfix representation. Cool eh?) > anyone else here used the computer language forth? It's all stack.rpn based. It is very cool and I will implement it in one of the robots I am presently contemplating building with my son. (see previous threads re IO programming etc)
-- Nick Rout <[EMAIL PROTECTED]>
