Click here to Skip to main content
15,885,914 members
Articles / Programming Languages / C#

Parsing a postfix expression in C#, my naive approach

Rate me:
Please Sign up or sign in to vote.
3.67/5 (5 votes)
19 Dec 2010CPOL 11.3K   1  
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.

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.
22 Nov 2010CPallini 3 alternatives  
There was a request about in Q&A. The question was deleted, anyway I think the subject may be interesting.
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...

License

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


Written By
United States United States
This member has not yet provided a Biography. Assume it's interesting and varied, and probably something to do with programming.

Comments and Discussions