Members may post updates or alternatives to this current article in order to show different
approaches or add new features.
This article provides a general algorithm and a C# implementation for converting expressions written in postfix or reverse Polish notation to infix.
I feel comfortable on a variety of systems (UNIX, Windows, cross-compiled embedded systems, etc.) in a variety of languages, environments, and tools.
I have a particular affinity to computer language analysis, testing, as well as quality management.
More information about what I do for a living can be found at my LinkedIn Profile
and on my company's web page