TweetFollow Us on Twitter

MPW Calculator
Volume Number:9
Issue Number:1
Column Tag:Jörg's Folder

MPW Calculator Tool in C++

An MPW tool written in bare bones C++ - not with MacApp.

By Jörg Langowski, MacTech Magazine Regular Contributing Author

Note: Source code files accompanying this article are located on MacTech CD-ROM or source code disks.

After a long break, you’ll find another C++ example in my column. Not with MacApp - we’re going back to the basics here and show a simple ‘bare C++’ program that executes as an MPW tool, or in the Simple Input/Output Window environment (SIOW) provided by Apple.

I came across this example reading a book on C++, “Programming in C++”, by Stephen Dewhurst and Kathy Stark (1989, Prentice Hall). I very much recommend this book for those of you who want to get the basic notions of C++ and an idea of its ‘programming flavor’. It may be not as comprehensive as the “C++ programming language” by Stroustrup (Addison-Wesley), or as the manuals that come with Apple’s C++ compiler; but it contains a lot of examples and exercises.

One classic exercise in computer science is to write a parser for algebraic expressions, that is, a program that takes an input string like

(3 + 5) * (-4 + (2 - 9))

and calculates the result of this expression. In fact, what you do to compute that expression is to convert it into an internal representation, and then evaluate that representation.

You can represent the expression given above by a linked list:

where each node of the list either contains an operator or a number. Once the arithmetic expression is given in list form, evaluating it is easy and can be done in a straightforward, object oriented way. Suppose you define a class node (also in listing):

class node {
 protected:
 
 node() {}
 public:
 virtual ~node() {}
 virtual int set (int)
 { cout << "Error: node::set(int) undefined" << eoln;
  return 0;} 
 virtual int eval() 
 { cout << "Error: node::eval() undefined" << eoln; 
 return 0;} 
};

where the constructor and destructor do nothing at the moment; they will have to be overridden by the derived node classes. There are two more virtual methods: eval(), which returns the value of the node, and set(), which can ‘set something’ in the node if defined in a subclass. For the base class, the methods just print error messages and return zero. These methods will be overridden, and they are virtual because we want their behavior to be determined at run time. That is, if we define a pointer mynode *node and assign it an object of a subclass of node, the actual eval() or set() methods used will be the ones corresponding to the subclass of the object that the pointer contains.

We now define two types of subclasses of node: dyadic operators and other stuff. All dyadic operators will be derived from the subclass :

class dyad : public node {
 protected:
 node *left, *right;
 dyad(node *l, node *r) {left=l; right=r;}
 ~dyad() {delete left; delete right;}
};

dyad only defines the two nodes that the operator connects: the constructor assigns these two nodes to two instance variables, and the destructor deletes them again. The classes derived from dyad define the four arithmetic operations, and the assignment (see listing). For example, addition is defined as:

class plus : public dyad {
 public:
 plus(node *l, node *r) : dyad(l,r) {}
 int eval() { return left->eval() + right->eval();} 
};

where the constructor just calls the superclass constructor, and

eval() returns the value of the sum of the values of the left and right hand side of the plus operation.

For the ‘expression tree’ shown above, you need one more class: numbers, which are ‘end nodes’ of the list. Thus, they do not contain pointers to other nodes, but an integer value in an instance variable. Their constructor assigns the value, and their eval() method simply returns it:

class inumber : public node {
 int value;
 public:
 inumber(int v) {value = v;}
 int eval() {return value;}
};

Finally, the unary minus operator (uminus in the listing) will return the negative value of the node that it points to.

The listing contains two more node classes: variables (id) and the assignment operator (equals), Variables contain a pointer to the head of a symbol table, and a pointer to the entry of this variable into the symbol table. The symbol table is a linked list of entries, and the pointer to its head is a static class variable. This means that, unlike instance variables, the pointer is not created again for every object of the class, but only one copy exists. Thus, all objects of this class reference the same symbol table, which is just what you want.

Assume we create a new node for a variable with its name given by the *char pointer nm. The constructor then first looks up the name in the symbol table (see listing, method look); if it is already there, it will put a pointer to the symbol table entry in the instance variable ent of the node. Otherwise, it will add a new entry to the symbol table, put its pointer into ent, make the new entry the head of the list, and change the (static) pointer so that it references the new head. All other variable objects will now have an updated reference to the symbol table.

A variable is assigned a value by the assignment operation equals. When an equals node is created, its right and left hand sides are set just as for the arithmetic operations; when its eval() method is called, the variable on the left hand side is set to the result of the right hand side. No check is done whether the left hand side is really a node of class id; but only those nodes contain a set method. The assignment operation also returns a value (just as in C), the right hand side of the statement.

So now we have defined a syntax tree for simple arithmetic expressions with assignment of variables. If, lets say, root is the pointer to the root of this tree (the times symbol in the drawing), and we call root->eval(), the result returned should be the value of the expression, in our case (3 + 5) * (-4 + (2 - 9)) = -88. With the class definitions given so far, this should work. But how do we set up the syntax tree in the first place? We need a routine, an expression parser, that takes the string expression and constructs the tree from it.

In order to write the parser, we first need to formalize the syntax of our simple arithmetic expressions. Such a formal description would for instance look like this:

<expression> :== <term> { [+|-] <term> }
<term>   :== <factor> { [*|/] <factor> }
<factor> :== <identifier> | <inumber> |
 (<expression >) | -<factor> |
 <identifier> = <expression>

We then define three parser routines that return an object of class node: e(), t(), and f(), returning, respectively, a pointer to an expression, a term, and a factor. Each of these routines makes repeated calls to another routine scan(), which gets the next token from the input stream. A token is a separate syntactic element, such as an open or close bracket, an arithmetic operator, a number or an identifier. scan() returns a character value, either the ascii value of a symbol if the token consists of one symbol, or a special value > 127. For the special values ID and INT, additional information can be found in a static char variable; this string will be used for the value of a number or the name of a variable. Other possible values are BAD (the scanner found something it couldn’t interpret), or EOLN (end of line found).

The first of the three parser routines, e(), is called from the main program (see listing for main()). On entry, one token has been read from the input stream; then e() tries to parse the input into a valid arithmetic expression and assign a pointer to its syntax tree to root. It does so by calling t() (see listing), which makes a term out of one or several factors by calling f(), just like e() makes the expression out of one or several term. When e() encounters a plus or minus sign after a term, is makes a new plus resp. minus node which connects the first term with the next one. Same for t(); here eventually a times or divide node is made, which connects two factors. f(), finally, will look for a number or identifier token and return a pointer to the corresponding node; or it might find an open bracket or a minus sign, after which a new expression or a factor have to follow. When all these recursive calls have been evaluated and no syntax errors have been found, the top-level e() returns the expression’s syntax tree.

In order to get the value of the expression, all we have to do then is call root->eval(), and the syntax tree will be evaluated as described above.

As long as no syntax errors are found, the main program loops continuously and asks for new expressions; the names and values of identifiers are remembered from one evaluation to the next, so you can play around with stored values a little.

As you may imagine, it is not too difficult to add on to this extremely simple calculator program e.g. to implement exponentiation or to include functions like exp(), log() etc. The constructed syntax tree could also serve in a bigger program as an internal representation of a function that the user has typed in and that has to be evaluated a lot of times (and computed fast). One could even imagine to generate real machine code out of the syntax tree, which makes this program some kind of a rudimentary compiler. We’ll add to the example during the next columns.

On the source code disk, I have compiled two versions of the program, one as an MPW tool, and the other one using the Simple Input/Output Window mechanism. Actually, the only thing that has to be changed is the linking. The MPW sequence to create the two versions of the program look like the following:

cplus calc.cp
Link -w -c 'MPS ' -t MPST 
 calc.cp.o 
 "{CLibraries}"StdCLib.o 
 "{Libraries}"ToolLibs.o 
 "{Libraries}"Runtime.o 
 "{Libraries}"Interface.o 
 "{CLibraries}"CPlusLib.o 
 -o calc

Rez -a "{MPW}"Interfaces:Rincludes:SIOW.r -o calcAppl
Link -w -c 'JLMT' -t 'APPL' 
 calc.cp.o 
 "{CLibraries}"StdClib.o 
 "{MPW}"Libraries:Libraries:SIOW.o 
 "{Libraries}"Runtime.o 
 "{Libraries}"Interface.o 
 "{CLibraries}"CPlusLib.o 
 -o calcAppl

So the second version can be run also by those of you who don’t have MPW.

FORTHcoming

I’m still waiting for those MacForth contributions coming in we’d really like to see more of that in MacTutor. I’m sure there are quite a few of you satisfied MacForth users who have something interesting to write about. Please contact me: I promise that you get your space in this column. My network address has changed in the meantime, since our institute is going from the Bitnet to the Internet world; so in the future, please send messages to either of those three addresses (in order of preference):

 jl@macjl.embl-grenoble.fr
 langowski.j@applelink.apple.com
 langowsk@titan.embl-grenoble.fr 

(note the missing last letter in the name)

Meanwhile, we do have news from the Forth world. I don’t have to tell you that the NEON successor, Yerk, keeps being updated faster than I can write about it; you know that you can get the current version by ftp from oddjob.uchicago.edu. Mops, the NEON lookalike with real 680x0 machine code, can also be found there.

But here is something very interesting for those of you who used and liked Mach2, the Forth in which I did most of my examples here: Two users of Mach2, John Fleming who works at Motorola, and Steven Wiley, a molecular biologist at the University of Utah, got together and made all those modifications to Mach2 that the implementers should have done two years ago; now it is System7 and 32-bit compatible. It may also be soon in the public domain (non-commercial) like Yerk is, with the full source code available. You’ll hear more about it in one of the next columns. Until then.

Listing: The MPW calculator tool
// 
// calc.cp
//
// a simple calculator program
// based on an example from Dewhurst/Stark
// "Programming in C++"
//
// J. Langowski November 1992
//

#include <Ctype.h>
#include <StdIO.h>
#include <String.h>
#include <Stream.h>
#include <StdLib.h>

#define NIL 0

// basic syntax tree structure
//
class node {
 protected:
 node() {}
 public:
 virtual ~node() {}
 virtual int set (int)
 { cout << "Error: node::set(int) undefined" << eoln;
  return 0;} 
 virtual int eval() 
 { cout << "Error: node::eval() undefined" << eoln; 
 return 0;} 
};

class dyad : public node {
 protected:
 node *left, *right;
 dyad(node *l, node *r) {left=l; right=r;}
 ~dyad() {delete left; delete right;}
};
// operators
//
class plus : public dyad {
 public:
 plus(node *l, node *r) : dyad(l,r) {}
 int eval() { return left->eval() + right->eval();} 
};

class minus : public dyad {
 public:
 minus(node *l, node *r) : dyad(l,r) {}
 int eval() { return left->eval() - right->eval();}
};

class times : public dyad {
 public:
 times(node *l, node *r) : dyad(l,r) {}
 int eval() { return left->eval() * right->eval();}
};

class divide : public dyad {
 public:
 divide(node *l, node *r) : dyad(l,r) {}
 int eval() { return left->eval() / right->eval();}
};

class uminus : public node {
 node *operand;
 public:
 uminus(node *o) {operand = o;}
 ~uminus() {delete operand;}
 int eval() {return -operand->eval();}
};

class inumber : public node {
 int value;
 public:
 inumber(int v) {value = v;}
 int eval() {return value;}
};


// identifier table
//
class id;

class entry {
 char *name;
 int value;
 entry *next;
 entry (char *nm, entry *n) {
 name = strcpy (new char[strlen(nm) + 1], nm);
 value = 0;
 next = n;
 }
 friend id;
};

class id : public node {
 static entry *symtab;
 entry *ent;
 entry *look(char *);
 public:
 id(char *nm) {ent = look(nm);}
 int set(int i) {return ent->value = i;}
 int eval() {return ent->value;}
};

entry *id::look(char *nm) {
 for(entry *p = symtab; p; p = p->next)
 if(strcmp(p->name,nm) == 0) return p;


 return symtab = new entry(nm,symtab);
}

entry *id::symtab = NIL;

// assignment
//
class equals : public dyad {
 public:
 equals(node *t,node *e) : dyad(t,e) {}
 int eval()
 { return left->set(right->eval()); }
};


// parsing + evaluation
//

static char token;   // current token 
static char line[81];   // for reading identifiers + numbers
enum {ID = char(128), INT, EOLN, BAD}; // special tokens

node *e(), *t(), *f();    // parser routines 
 // for expression, term, factor

// input stream scanner, returns next token
//
char scan() {
 char c;
 while (1)
 switch (c = cin.get()) {
 case '+': case '-': case '*': case '/':
 case '(': case ')': case '=':
 return c;
 case ' ': case '\t':
 continue;
 case '\n': case '\r':
 return EOLN;
 default:
 if (isdigit(c)) {
 char *s = line;
 do*s++ = c;
 while(isdigit(c = cin.get()));
 *s = '\0'; 
 // terminate string just read
 cin.putback(c); 
 // had read one too much
 return INT;
 }
 
 if (isalpha(c)) {
 char *s = line;
 do*s++ = c;
 while(isalnum(c = cin.get()));
 *s = '\0'; 
 // terminate string just read
 cin.putback(c); 
 // had read one too much
 return ID;
 }
 
 return BAD; 
 // if nothing fits, syntax error
 }
}

// simple error routine
//
void error() { cout << "Syntax error." << endl; exit(255); }

// parser routines for expression, term, factor
//

// expression = term (+ -) term
node *e() {
 node *root = t();
 while (1)
 switch (token) {
 case '+':
 token = scan();
 root = new plus(root, t()); 
 break;
 case '-':
 token = scan();
 root = new minus(root, t());
 break;
 default:
 return root;
 }
}

// term = factor (* /) factor
node *t() {
 node *root = f();
 while (1)
 switch (token) {
 case '*':
 token = scan();
 root = new times(root, t()); 
 break;
 case '/':
 token = scan();
 root = new divide(root, t()); 
 break;
 default:
 return root;
 }
}

// factor = identifier | number | expression | -factor
node *f() {
 node *root = NIL;
 switch (token) {
 case ID:
 root = new id(line);
 token = scan();
 if (token == '=') {
 token = scan();
 root = new equals(root, e());
 }
 return root;
 case INT:
 root = new inumber(atoi(line));
 token = scan();
 return root;
 case '(':
 token = scan();
 root = e();
 if (token != ')' ) error();
 token = scan();
 return root;
 case '-':
 token = scan();
 return new uminus(f());
 default:
 error();
 }
}

// main program
//

void main() {
 node *root = NIL;
 while (1) {
 cout << "Enter expression: " << endl;
 token = scan();
 root = e();

 if (token == BAD) error();
 
 if (root != NIL)
 { 
     cout << "Result = " << root->eval() << endl;
     delete root; 
 }
 }
}

 

Community Search:
MacTech Search:

Software Updates via MacUpdate

TechTool Pro 9.5.1 - Hard drive and syst...
TechTool Pro has long been one of the foremost utilities for keeping your Mac running smoothly and efficiently. With the release of version 9, it has become more proficient than ever. TechTool... Read more
Jamf Pro 9.99.0 - Powerful sysadmin/ente...
Jamf Pro (formerly Casper Suite) is the EMM tool that delights IT pros and the users they support by delivering on the promise of unified endpoint management for Apple devices. At Jamf, connecting... Read more
VueScan 9.5.78 - Scanner software with a...
VueScan is a scanning program that works with most high-quality flatbed and film scanners to produce scans that have excellent color fidelity and color balance. VueScan is easy to use, and has... Read more
Adobe Lightroom 6.10.1 - Import, develop...
Adobe Lightroom is available as part of Adobe Creative Cloud for as little as $9.99/month bundled with Photoshop CC as part of the photography package. Lightroom 6 is also available for purchase as a... Read more
iPhoto Library Manager 4.2.7 - Manage mu...
iPhoto Library Manager allows you to organize your photos among multiple iPhoto libraries, rather than having to store all of your photos in one giant library. You can browse the photos in all your... Read more
Smultron 9.4 - Easy-to-use, powerful tex...
Smultron 9 is an elegant and powerful text editor that is easy to use. Use it to create or edit any text document. Everything from a web page, a note or a script to any single piece of text or code.... Read more
TextSoap 8.4 - Automate tedious text doc...
TextSoap can automatically remove unwanted characters, fix up messed up carriage returns, and do pretty much anything else that we can think of to text. Save time and effort. Be more productive. Stop... Read more
Merlin Project 4.2.3 - $349.00
Merlin Project is the leading professional project management software for OS X. If you plan complex projects on your Mac, you won’t get far with a simple list of tasks. Good planning raises... Read more
QuarkXPress 13.0.0.0 - Desktop publishin...
QuarkXPress 2017 is the new version that raises the bar for design and productivity. With non-destructive graphics and image editing directly within your layout, you no longer have to choose between... Read more
Path Finder 7.5 - Powerful, award-winnin...
Path Finder makes you a master of file management. Take full control over your file system. Save your time: compare and synchronize folders, view hidden files, use Dual Pane and full keyboard... Read more

Latest Forum Discussions

See All

Zombie Gunship Survival Beginner's...
The much anticipated Zombie Gunship Survival is here. In this latest entry in the Zombie Gunship franchise, you're tasked with supporting ground troops and protecting your base from the zombie horde. There's a lot of rich base building fun, and... | Read more »
Mordheim: Warband Skirmish (Games)
Mordheim: Warband Skirmish 1.2.2 Device: iOS Universal Category: Games Price: $3.99, Version: 1.2.2 (iTunes) Description: Explore the ruins of the City of Mordheim, clash with other scavenging warbands and collect Wyrdstone -... | Read more »
Mordheim: Warband Skirmish brings tablet...
Legendary Games has just launched Mordheim: Warband Skirmish, a new turn-based action game for iOS and Android. | Read more »
Magikarp Jump splashes onto Android worl...
If you're tired ofPokémon GObut still want something to satisfy your mobilePokémon fix,Magikarp Jumpmay just do the trick. It's out now on Android devices the world over. While it looks like a simple arcade jumper, there's quite a bit more to it... | Read more »
Purrfectly charming open-world RPG Cat Q...
Cat Quest, an expansive open-world RPG from former Koei-Tecmo developers, got a new gameplay trailer today. The video showcases the combat and exploration features of this feline-themed RPG. Cat puns abound as you travel across a large map in a... | Read more »
Jaipur: A Card Game of Duels (Games)
Jaipur: A Card Game of Duels 1.0 Device: iOS Universal Category: Games Price: $1.99, Version: 1.0 (iTunes) Description: ** WARNING: iPad 2, iPad Mini 1 & iPhone 4S are NOT compatible. ** *** Special Launch Price for a limited... | Read more »
Subdivision Infinity (Games)
Subdivision Infinity 1.03 Device: iOS Universal Category: Games Price: $2.99, Version: 1.03 (iTunes) Description: Launch sale! 40% Off! Subdivision Infinity is an immersive and pulse pounding sci-fi 3D space shooter. https://www.... | Read more »
Clash of Clans' gets a huge new upd...
Clash of Clans just got a massive new update, and that's not hyperbole. The update easily tacks on a whole new game's worth of content to the hit base building game. In the update, that mysterious boat on the edge of the map has been repaired and... | Read more »
Thimbleweed Park officially headed to iO...
Welp, it's official. Thimbleweed Park will be getting a mobile version. After lots of wondering and speculation, the developers confirmed it today. Thimbleweed Park will be available on both iOS and Android sometime in the near future. There's no... | Read more »
Pokémon GO might be getting legendaries...
The long-awaited legendary Pokémon may soon be coming to Pokémon GO at long last. Data miners have already discovered that the legendary birds, Articuno, Moltres, and Zapdos are already in the game, it’s just a matter of time. [Read more] | Read more »

Price Scanner via MacPrices.net

Huawei Unveils New ‘Business-Styled’ MateBook...
Huawei has introduced a trio of new MateBook laptops, expanding its mobile portfolio and building on its success in delivering attractive and powerful high-end devices. The company claims the HUAWEI... Read more
Deal! Gold 12-inch 1.2GHz Retina MacBook for...
Amazon has the 2016 Gold 12″ 1.2GHz Retina MacBook (MLHF2LL/A) on sale for $350 off MSRP for a limited time. Shipping is free: - 12″ 1.2GHz Gold Retina MacBook: $1249.99 $350 off MSRP We expect this... Read more
13-inch 2.0GHz MacBook Pros on sale for $100...
B&H has the non-Touch Bar 13″ 2.0GHz MacBook Pros in stock today and on sale for $100 off MSRP. Shipping is free, and B&H charges NY & NJ sales tax only: - 13″ 2.0GHz MacBook Pro Space... Read more
15-inch 2.2GHz Retina MacBook Pro, Apple refu...
Apple has Certified Refurbished 2015 15″ 2.2GHz Retina MacBook Pros available for $1699. That’s $300 off MSRP, and it’s the lowest price available for a 15″ MacBook Pro. An Apple one-year warranty is... Read more
Apple refurbished 9-inch and 12-inch iPad Pro...
Apple has Certified Refurbished 9″ and 12″ Apple iPad Pros available for up to $160 off the cost of new iPads. An Apple one-year warranty is included with each model, and shipping is free: - 32GB 9″... Read more
Apple Certified Refurbished iMacs available f...
Apple has Certified Refurbished 2015 21″ & 27″ iMacs available for up to $350 off MSRP. Apple’s one-year warranty is standard, and shipping is free. The following models are available: - 21″ 3.... Read more
Sale! 15-inch 2.6GHz Silver Touch Bar MacBook...
DataVision has the 15″ 2.6GHz Silver Touch Bar MacBook Pro (MLW72LL/A) on sale for $2199 including free shipping. Their price is $200 off MSRP, and it’s the lowest price available for this model (... Read more
A Kaby Lake Processor Upgrade For The MacBook...
Now they tell me! Well, actually Apple hasn’t said anything official on the subject, but last week Bloomberg News’s Mark Gurman and Alex Webb cited unnamed “people familiar with the matter”... Read more
Kodak’s Camera-First Smartphone EKTRA Launche...
The Eastman Kodak Company and Bullitt Group have announced the availability of a U.S. GSM version of the KODAK EKTRA Smartphone. The U.S. launch coincides with a software update addressing requests... Read more
Apple Launches App Development Curriculum for...
Apple today launched a new app development curriculum designed for students who want to pursue careers in the fast-growing app economy. The curriculum is available as a free download today from Apple... Read more

Jobs Board

Data Engineer - *Apple* Media Products - Ap...
Changing the world is all in a day's work at Apple . If you love innovation, here's your chance to make a career of it. You'll work hard. But the job comes with more Read more
*Apple* Store Leader Program - Apple, Inc (U...
…Summary Learn and grow as you explore the art of leadership at the Apple Store. You'll master our retail business inside and out through training, hands-on Read more
*Apple* Integration Specialist - A3 Solution...
Apple Integration Specialist Contract-To-HireWe are searching for dedicated, well-experienced and energetic individuals for an information technology corporation Read more
Sr. Software Engineer, *Apple* Online Store...
Changing the world is all in a day's work at Apple . If you love innovation, here's your chance to make a career of it. You'll work hard. But the job comes with more Read more
Senior Engineering Project Manager, *Apple*...
Changing the world is all in a day's work at Apple . If you love innovation, here's your chance to make a career of it. You'll work hard. But the job comes with more Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.