Click here to Skip to main content
15,886,032 members
Articles / General Programming / Algorithms

Converting Postfix Expressions to Infix

Rate me:
Please Sign up or sign in to vote.
5.00/5 (5 votes)
20 Jun 2012CPOL1 min read 18.8K   4  
This is an alternative for "Converting Postfix Expressions to Infix"

Alternatives

Members may post updates or alternatives to this current article in order to show different approaches or add new features.

Please Sign up or sign in to vote.
17 Jun 2012W. Michael Perkins 1 alternative  
This article provides a general algorithm and a C# implementation for converting expressions written in postfix or reverse Polish notation to infix.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)


Written By
Founder eXternSoft GmbH
Switzerland Switzerland
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 (German only).

Comments and Discussions