Exercise 5-6. Rewrite appropriate programs from earlier chapters and exercises with pointers instead of array indexing. Good possibilities include getline() (Chapters 1 and 4), atoi(), itoa(), and their variants (Chapters 2, 3, and 4), reverse() (Chapter 3), and strindex() and getop() (Chapter 4).
1 2 +
1 2 * 3 + 5 -
-1 2 +
-1 -2 -
4 3 %
2 0 %
1 3 /
1 0 /
#include <stdio.h> // for printf(), getchar(), EOF
#include <stdlib.h> // for atof()
#define MAXOP 100 // max size of operand or operator
#define NUMBER '0' // signal that a number has been found
int getop(char *); // get the next operand or operator
void push(double); // push operand on stack
double pop(void); // pop operand from stack
int main()
{
int type, i1, i2;
double op2; // second operand for -, /, %
char s[MAXOP]; // operand or operator
while((type = getop(s)) != EOF)
{ // nonempty line ending with EOF will not be executed
switch(type)
{
case NUMBER :
push(atof(s));
break;
case '+' :
push(pop() + pop());
break;
case '-' :
op2 = pop();
push(pop() - op2);
break;
case '*' :
push(pop() * pop());
break;
case '/' :
op2 = pop();
if (op2 != 0.0)
{push(pop() / op2);}
else {printf("Error: zero divisor\n");}
break;
case '%' :
i2 = pop(); // automatic conversions
i1 = pop(); // from double to int
if (i2 != 0.0)
{push(i1 % i2);} // automatic conversion from int to double, argument of push()
else {printf("Error: zero divisor\n");}
break;
case '\n' :
printf("\t%.8g\n", pop()); // top of stack
break;
default :
printf("Unknown command: %s\n", s);
break;
}
}
return 0;
}
#define MAXVAL 100 // stack size
double val[MAXVAL]; // value stack
double *sp = val; // stack pointer (*val is top of stack)
void push(double f) // push f on (top of) stack
{
if (sp < val+MAXVAL) {*sp++ = f;}
else {printf("Error: stack full, can't push %g\n", f);}
}
double pop(void) // pop and return top value from stack
{
if (sp > val) {return *--sp;}
else
{
printf("Error: stack empty\n");
return 0.0;
}
}
#include <ctype.h> // for isdigit()
int getch(void);
void ungetch(int);
int getop(char *s) // get next operator or numeric operand
{
int c;
while ((*s = c = getch()) == ' ' || c == '\t') // skip beginning whitespace (' ', '\t')
{} // last value read in *s is not ' ' or '\t', but could be '\n' or EOF
*(s+1) = '\0'; // end string
if (!isdigit(c) && c != '.' && c != '+' && c != '-')
{return c;} // not a number, probably an operator (or '\n' or EOF)
// here c is digit or '.' or '+' or '-'
if (c == '+' || c == '-') // unary or binary sign
{
c = getch();
if (!isdigit(c) && c != '.')
{
ungetch(c);
return *s; // binary '+' or '-'
}
else // c is digit or '.'
{
if (*s == '-') {s++;} // s[0] == '-'
// if (*s == '+') {} // skip adding '+' to s
*s = c; // digit or '.'
}
}
if (isdigit(c)) // collect integer part
{ // *s contains c (digit)
while (isdigit(*++s = c = getch()))
{}
} // here *s is not a digit
if (c == '.') // collect fraction part
{ // *s contains c (*s == '.')
while (isdigit(*++s = c = getch()))
{}
} // here *s is not a digit
*s = '\0'; // end string containing number (operand)
ungetch(c); // if (c == EOF), the next getop() will return EOF, ending the program
return NUMBER;
}
// buffer for ungetch():
int buf = EOF-1; // not a real character, not even EOF
int getch(void) // get a (possibly pushed-back) character
{
if (buf < EOF)
{
return getchar();
}
int temp = buf; // buf >= EOF
buf = EOF-1; // reset buf
return temp;
}
// push character back on input (make it available for the next getch()):
void ungetch(int c)
{
buf = c;
}
/*
gcc calc1.c -o calc1
./calc1
1 2 +
3
1 2 + 3 * 4 /
2.25
-1 2 +
1
-1 -2 +
-3
-1 2 + 3 *
3
2 0 /
Error: zero divisor
2 // pop() called by '\n' returns first operand, still on stack
1 2 /
0.5
2 3 %
2
4 2 %
0
4 1 %
0
4 3 %
1
4 0 %
Error: zero divisor
Error: stack empty // nothing pushed, '\n' calls pop():
0 // value returned by pop() for an empty stack
a b +
Unknown command: a
Unknown command: b
Error: stack empty // nothing pushed, pop() called by +
Error: stack empty // pop() called by '\n'
0 // value returned by pop() for an empty stack
1 2 9
9 // pop() called by '\n'
+
3 // 1 + 2
1 2 c
Unknown command: c
2 // pop() called by '\n'
3 +
4 // 1 + 3
CTRL^D (EOF) or CTRL^C in Linux, CTRL^Z + Enter in Windows
./calc1 < compute.txt
3 // 1 2 +
0 // 1 2 * 3 + 5 -
1 // -1 2 +
1 // -1 -2 -
1 // 4 3 %
Error: zero divisor // 2 0 %
Error: stack empty // nothing pushed, '\n' calls pop():
0 // value returned by pop() for an empty stack
0.33333333 // 1 3 /
Error: zero divisor // 1 0 /
1 // pop() called by '\n' returns first operand, still on stack
*/
*****************************************************************************************
*****************************************************************************************
*****************************************************************************************
*****************************************************************************************
*****************************************************************************************
#include <stdio.h> // for printf(), getchar(), EOF
#include <stdlib.h> // for atof()
#define MAXLINE 1000 // max line length
#define MAXOP 100 // max size of operand or operator
#define NUMBER '0' // signal that a number has been found
int getLine(char *, int); // getline() is declared in stdio.h
char line[MAXLINE];
int lp; // line pointer
int getop(char *); // get the next operand or operator
void push(double); // push operand on stack
double pop(void); // pop operand from stack
int main()
{
int type, i1, i2, len;
double op2; // second operand for -, /, %
char s[MAXOP]; // operand or operator
while((len = getLine(line, MAXLINE)) > 0)
{ // nonempty line ending with EOF will not be executed
lp = 0; // reset
while(lp < len)
{
type = getop(s);
switch(type)
{
case NUMBER :
push(atof(s));
break;
case '+' :
push(pop() + pop());
break;
case '-' :
op2 = pop();
push(pop() - op2);
break;
case '*' :
push(pop() * pop());
break;
case '/' :
op2 = pop();
if (op2 != 0.0)
{push(pop() / op2);}
else {printf("Error: zero divisor\n");}
break;
case '%' :
i2 = pop(); // automatic conversions
i1 = pop(); // from double to int
if (i2 != 0.0)
{push(i1 % i2);} // automatic conversion from int to double, argument of push()
else {printf("Error: zero divisor\n");}
break;
case '\n' :
printf("\t%.8g\n", pop()); // top of stack
break;
default :
printf("Unknown command: %s\n", s);
break;
} // end of switch()
// if (type == '\n') {break;} // out of inner while()
} // end of inner while()
} // end of outer while()
return 0;
} // end of main()
// getLine(): read a line into s, return length
int getLine(char *s, int lim)
{
int c = EOF; // initialize
char *p;
// getchar() is only executed if --lim > 0:
for (p = s; (--lim > 0) && (c = getchar()) != EOF && c != '\n'; p++)
{ // from 0 to lim-2; s[lim-2]='\n' or not, s[lim-1]='\0'
*p = c;
}
if (c == '\n') // i < (lim-1), getchar() executed
{
*p = c; // '\n'
p++;
}
*p = '\0'; // the null character ends a string
return p-s; // max(p-s) == (lim-1), assuming (lim-1) > 0
}
#define MAXVAL 100 // stack size
double val[MAXVAL]; // value stack
double *sp = val; // stack pointer (*val is top of stack):
void push(double f) // push f on (top of) stack
{
if (sp < val+MAXVAL) {*sp++ = f;}
else {printf("Error: stack full, can't push %g\n", f);}
}
double pop(void) // pop and return top value from stack
{
if (sp > val) {return *--sp;}
else
{
printf("Error: stack empty\n");
return 0.0;
}
}
#include <ctype.h> // for isdigit()
int getop(char *s) // get next operator or numeric operand
{
int c;
while ((*s = c = line[lp++]) == ' ' || c == '\t') // skip beginning ' ', '\t'
{} // last value read in s[0] is not ' ' or '\t', but could be '\n' or EOF
*(s+1) = '\0'; // end string
if (!isdigit(c) && c != '.' && c != '+' && c != '-')
{return c;} // not a number, probably an operator (or '\n')
// here c is digit or '.' or '+' or '-'
if (c == '+' || c == '-') // unary or binary sign
{
c = line[lp++];
if (!isdigit(c) && c != '.')
{
lp--;
return *s; // binary '+' or '-'
}
else // c is digit or '.'
{
if (*s == '-') {s++;} // s[0] == '-'
// if (*s == '+') {} // skip adding '+' to s
*s = c; // digit or '.'
}
}
if (isdigit(c)) // collect integer part
{ // *s contains c (digit)
while (isdigit(*++s = c = line[lp++]))
{}
} // here *s is not a digit
if (c == '.') // collect fraction part
{ // *s contains c (*s == '.')
while (isdigit(*++s = c = line[lp++]))
{}
} // here s[i] is not a digit
*s = '\0'; // end string containing number (operand)
lp--; // line[] does not contain EOF
return NUMBER;
}
/*
gcc getcalc.c -o getcalc
./getcalc
1 2 +
3
1 2 + 3 * 4 /
2.25
-1 2 +
1
-1 -2 +
-3
-1 2 + 3 *
3
2 0 /
Error: zero divisor
2 // pop() called by '\n' returns first operand, still on stack
1 2 /
0.5
2 3 %
2
4 2 %
0
4 1 %
0
4 3 %
1
4 0 %
Error: zero divisor
Error: stack empty // nothing pushed, '\n' calls pop():
0 // value returned by pop() for an empty stack
a b +
Unknown command: a
Unknown command: b
Error: stack empty // nothing pushed, pop() called by +
Error: stack empty // pop() called by '\n'
0 // value returned by pop() for an empty stack
1 2 9
9 // pop() called by '\n'
+
3 // 1 + 2
1 2 c
Unknown command: c
2 // pop() called by '\n'
3 +
4 // 1 + 3
CTRL^D (EOF) or CTRL^C in Linux, CTRL^Z + Enter in Windows
./getcalc < compute.txt
3 // 1 2 +
0 // 1 2 * 3 + 5 -
1 // -1 2 +
1 // -1 -2 -
1 // 4 3 %
Error: zero divisor // 2 0 %
Error: stack empty // nothing pushed, '\n' calls pop():
0 // value returned by pop() for an empty stack
0.33333333 // 1 3 /
Error: zero divisor // 1 0 /
1 // pop() called by '\n' returns first operand, still on stack
*/