No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
I'm writing, essentially, a stack calculator where I can change an expression from normal(infix) notation to prefix and postfix and vice versa, and to be able to evaluate a postfix, prefix, or infix expression and return a value. I have been trying to use a switch statement to determine whether …
|
|
|
Ok, I want to say in advance that I am simply looking for insight right now. I regret to admit *lol* that I'll probably be back asking about something else soon after. I need to write a program using binary trees that functions, essentially, like a concordance. I simply need …
|
|
|
[code] public bool IsNum(char ch) { if (((ch >= '0') && (ch <= '9'))|| (ch == '.')) return true; else return false; }[/code] Why does this method work in a normal console app, but not in a class library that I am trying to write? If I copy this code …
|
|
|
[code] if(operatorStack.Peek() = '*') { //lowerPrecedence = true; strPostfix += operatorStack.Pop(); }[/code] OK I could really use some help here, I've tried this and other forums, and with all the superprogrammers we have out there no one will help me out on this..... Why am I getting a ": The …
|