Click here to Skip to main content
15,867,704 members
Articles / Programming Languages / C#

Parsing a postfix expression in C#, my naive approach

Rate me:
Please Sign up or sign in to vote.
5.00/5 (7 votes)
22 Nov 2010CPOL 20.9K   3  
There was a request about in Q&A. The question was deleted, anyway I think the subject may be interesting.

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.
21 Dec 2010Morten Nilsen
Here is my take on the same, using Lambda expressions and slightly more advanced regular expression features:I have not tested this code, so errors may exist.This implementation will ignore unrecognized tokens. namespace Postfix { class Parser { static Dictionary<string,...
Please Sign up or sign in to vote.
21 Dec 2010Andreas Gieriet
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...
Please Sign up or sign in to vote.
19 Dec 2010YangChunJiang
Regex combined = new Regex(@"\G(\s+(?[+-*/])|\s*(?-?[0-9]+))", RegexOptions.ExplicitCapture);This line has an error:parsing "\G(\s+(?[+-*/])|\s*(?-?[0-9]+))" - [x-y] range in reverse order.

License

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


Written By
Software Developer (Senior) Biotecnica Instruments S.p.A.
Italy Italy




Debugging? Klingons do not debug. Our software does not coddle the weak. Bugs are good for building character in the user.
-- The Klingon programmer



Beelzebub for his friends [^].





Comments and Discussions