Exercise 4.10

Page 79

An alternate organization uses getline to read an entire input line; this makes getch and ungetch unnecessary. Revise the calculator to use this approach.

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

#define LOWVAR 'a'
#define HIGHVAR 'z'
#define MAXOP 100
#define NUMBER '0'
#define MAXLINE 1000

int get_line(char[], int);
int getop(char[], char[]);
void push(double);
double pop(void);
double read(void);
void clear(void);
void assign(char, double);
double fetch(char);

/* To assign a variable provide a lowercase letter after the relevant number 
 * `2 a` will assign a = 2 
 * To access a variable, prefix with @ 
 * `2 a @a @a +` will assign a = 2 then will add `a + a` = `2 + 2` = 4 */

int main()
{
	int type;
	double op, op2;
	char in[MAXLINE];
	char s[MAXOP];

	get_line(in, MAXLINE);

	while ((type = getop(in, s)) != '\0') {
		switch (type) {
		case NUMBER:
			push(atof(s));
			break;
		case '+':
			push(pop() + pop());
			break;
		case '*':
			push(pop() * pop());
			break;
		case '-':
			op2 = pop();
			push(pop() - op2);
			break;
		case '/':
			op2 = pop();
			if (op2 != 0.0) {
				push(pop() / op2);
			} else {
				printf("error: zero divisor\n");
			}
			break;
		case '%':
			op2 = pop();
			if (op2 != 0.0) {
				push((int)pop() % (int)op2);
			} else {
				printf("error: zero divisor\n");
			}
			break;
		case '#': // print top element
			printf("\t%.8g\n", read());
			break;
		case '&': // duplicate top element
			push(read());
			break;
		case '~': // swap top two elements
			op = pop();
			op2 = pop();
			push(op);
			push(op2);
			break;
		case '!': // clear the stack
			clear();
			break;
		case '$':
			push(sin(pop()));
			break;
		case '?':
			push(exp(pop()));
			break;
		case '^':
			op2 = pop();
			push(pow(op2, pop()));
			break;
		case '@':
			printf("fetch error: @ must be followed by a variable name!\n");
			break;
		default:
			assign(type, pop());
			break;
		}
	}
	printf("\t%.8g\n", pop());
	return 0;
}

#define MAXVAL 100

int sp = 0;
double val[MAXVAL];

void push(double f)
{
	if (sp < MAXVAL) {
		val[sp++] = f;
	} else {
		printf("push error: stack full, can't push %g\n", f);
	}
}

double pop(void)
{
	if (sp > 0) {
		return val[--sp];
	} else {
		printf("pop error: stack empty\n");
		return 0.0;
	}
}

double read(void)
{
	if (sp > 0) {
		return val[sp - 1];
	} else {
		printf("read error: stack empty\n");
		return 0.0;
	}
}

void clear(void)
{
	sp = 0;
}

#include <ctype.h>

int pos = 0;
int getop(char in[], char out[])
{
	int i, c;

	/* Get first char, return if non-numeric */
	while ((out[0] = c = in[pos++]) == ' ' || c == '\t')
		;

	if (c == '@') {
		c = in[pos++]; // Bug if last char in `in`
		if (c < LOWVAR || c > HIGHVAR) {
			return '@';
		} else {
			sprintf(out, "%g", fetch(c));
			return NUMBER;
		}
	} else if (c == '\n' || c == EOF) {
		return '\0';
	} else if (!isdigit(c) && c != '.' && c != '-' && c != '+') {
		return c;
	}

	i = 0;
	/* Handle negative or positive sign */
	if (c == '-' || c == '+') {
		if (!isdigit(out[++i] = c = in[pos++])) {
			pos--;
			out[1] = '\0';
			return out[0];
		}
	}

	/* Fetch numeric string */
	if (isdigit(c)) {
		while (isdigit(out[++i] = c = in[pos++]))
			;
	}
	if (c == '.') {
		while (isdigit(out[++i] = c = in[pos++]))
			;
	}
	out[i] = '\0';

	/* Unget the last unread char */
	if (c != EOF) {
		pos--;
	}

	/* Return number indicator */
	return NUMBER;
}

#define BUFSIZE 100
int buf[BUFSIZE];
int bufp = 0;

int getch(void)
{
	return (bufp > 0) ? buf[--bufp] : getchar();
}

void ungetch(int c)
{
	if (bufp >= BUFSIZE) {
		printf("ungetch: too many characters\n");
	} else {
		buf[bufp++] = c;
	}
}

double vars[HIGHVAR - LOWVAR];

void assign(char c, double d)
{
	vars[c - LOWVAR] = d;
}

double fetch(char c)
{
	return vars[c - LOWVAR];
}

/* Copied from p69 */
int get_line(char s[], int lim)
{
	int c, i;

	i = 0;
	while (--lim > 0 && (c = getchar()) != EOF && c != '\n') {
		s[i++] = c;
	}
	if (c == '\n') {
		s[i++] = c;
	}
	s[i] = '\0';
	return i;
}