Parsing a postfix expression in C#, my naive approach

Andreas Gieriet

Rate me:

5.00/5 (1 vote)

21 Dec 2010CPOL

7.7K

For those who like dense code, here is a sample :) - Make the dictionary static readonly, init directly- Swap the arguments in the lambda expressions and call by direct pop from the stack- Make the regex simpler and put the logic of parsing into the Exec (the regex only tokenizes the...

Views

Daily Counts

License

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

Written By

Andreas Gieriet

Founder eXternSoft GmbH

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).

Parsing a postfix expression in C#, my naive approach

Views

License

Comments and Discussions