Click here to Skip to main content
Click here to Skip to main content
Alternatives (3)

Parsing a postfix expression in C#, my naive approach

, 22 Nov 2010
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.

21 Dec 2010
Morten 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,...
21 Dec 2010
Andreas 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...
19 Dec 2010
YangChunJiang
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)

About the Author

CPallini
Software Developer (Senior) AEM 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 [^].



Follow on   LinkedIn

| | Privacy | Mobile
Web04 | 2.8.140718.1 | Last Updated 22 Nov 2010
Article Copyright 2010 by CPallini
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid