1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
/*
For information on this software or to report bugs please visit http://www.ranton.org
or email ranton@ranton.org

For custom software development and consulting please visit http://www.madlogic.com .

Copyright (c) 2003, Richard Neal Anton
All rights reserved.

Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:

*	Redistributions of source code must retain the above copyright notice, this list
	of conditions and the following disclaimer. 

*	Redistributions in binary form must reproduce the above copyright notice, this list
	of conditions and the following disclaimer in the documentation and/or other materials
	provided with the distribution. 

*	The name of the copyright holder may not be used to endorse or promote products 
	derived from this software without specific prior written permission. 

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/

// evaluate reverse polish notation mathematic operations.

#include <iostream>
#include <string>

using namespace std;


typedef enum {
	kOperand,
	kAdd,
	kSubtract,
	kMultiply,
	kDivide
} RPNType;

class RPNStep {
public:
	RPNStep(void);
	RPNStep(RPNType type, double operand=0.0); // operand is irrelevant unless type==kOperand
	RPNStep(const RPNStep& step);

	~RPNStep();

	const RPNStep& operator = (const RPNStep& step);

	// evaluate this, returns false if error like stack underflow for example
	bool Execute(double *bottom, double **pstack);

	RPNType GetType(void) const { return mType; }
	double GetOperand(void) const { return mOperand; }

protected:
	RPNType mType;
	double mOperand; // irrelevant unless mType==kOperand
};


RPNStep::RPNStep(void)
{
}

RPNStep::RPNStep(RPNType type, double operand)
{
	mType = type;
	mOperand = operand;
}

RPNStep::RPNStep(const RPNStep& step)
{
	mType = step.mType;
	mOperand = step.mOperand;
}

RPNStep::~RPNStep()
{
}

const RPNStep& RPNStep::operator = (const RPNStep& step)
{
	mType = step.mType;
	mOperand = step.mOperand;
	return *this;
}

bool CheckFor2(double *bottom, double *stack)
{
	stack -= 2;
	return ( stack >= bottom );
}

// evaluate this 
bool RPNStep::Execute(double *bottom, double **pstack)
{
	double top, bot, *stack = *pstack;

	switch(mType)
	{
	case kOperand:
		*stack++ = mOperand;
		break;

	case kAdd:
		if( !CheckFor2(bottom,stack) )
			return false;
		top = *(--stack);
		bot = *(--stack);
		*stack++ = bot + top;
		break;

	case kSubtract:
		if( !CheckFor2(bottom,stack) )
			return false;
		top = *(--stack);
		bot = *(--stack);
		*stack++ = bot - top;
		break;

	case kMultiply:
		if( !CheckFor2(bottom,stack) )
			return false;
		top = *(--stack);
		bot = *(--stack);
		*stack++ = bot * top;
		break;

	case kDivide:
		if( !CheckFor2(bottom,stack) )
			return false;
		top = *(--stack);
		bot = *(--stack);
		if( !top )
			return false; // divide by zero
		*stack++ = bot / top;
		break;

	}

	*pstack = stack;
	return true;
}

// display whatever this is
ostream& operator << ( ostream& os, const RPNStep& step )
{
	switch(step.GetType())
	{
	case kOperand:
		os << step.GetOperand();
		break;
	case kAdd:
		os << "+";
		break;
	case kSubtract:
		os << "-";
		break;
	case kMultiply:
		os << "*";
		break;
	case kDivide:
		os << "/";
		break;
	}
	return os;
}




int main(int argc, char **argv)
{
	cout << "Welcome to Eval!\n";

	const int kMaxSteps = 32;
	const int kStackSize = 64;

	string line;
	RPNStep steps[kMaxSteps];
	int nsteps, i;
	double bottom[kStackSize], *stack=bottom;
	bool good;

	for(;;)
	{
		nsteps = 0; // fresh start each time.

		// let them enter it
		for(;;)
		{
			cout << ": "; // our prompt
			cin >> line;

			// NOTE: Should strip leading and trailing whitespace,
			// and actually check that 'number's are really numbers.
			
			if( line == string("q") )
				return 0; // quit application
			else if( line == string("e") ) // done entering
				break; // exit loop
			else if( line == string("+") )
				steps[nsteps++] = RPNStep(kAdd);
			else if( line == string("-") )
				steps[nsteps++] = RPNStep(kSubtract);
			else if( line == string("*") )
				steps[nsteps++] = RPNStep(kMultiply);
			else if( line == string("/") )
				steps[nsteps++] = RPNStep(kDivide);
			else // assume a number
				steps[nsteps++] = RPNStep(kOperand,atof(line.c_str()));
		}

		// print it out
		for(i=0;i<nsteps;i++)
			cout << steps[i] << " ";
		cout << "= ";

		// evaluate it and print out the value
		good = true;
		for(i=0;i<nsteps;i++)
		{
			if( !steps[i].Execute(bottom,&stack) )
			{
				good = false;
				break;
			}
		}
		if( !good || stack <= bottom )
			cout << "Error\n";
		else
			cout << *(--stack) << "\n";
	}

	return 0;
}