>Assuming you mean "infix to Reverse Polish", I guess you need something that >will parse mathematical expressions. You might like to check out Happy... >it's a parser generator for Haskell, and you could write your own infix to RPN >program using it. Alternatively, there is a parsing combinator library that's >probably a lot easier to work with, but less general. No way. Parser combinators are considerably more general than YACC-style tools. With parser combinators you can easily construct parsers for context-sensitive languages and beyond, but Happy is limited to generating parsers for simple context-free languages (modulo precedences). --FC
