Download fulltext - DiVA Portal

Transcript
A APPENDICES
A
Appendices
A.1
A.1.1
RPN calculator source-code
rpn.h
#i f n d e f __RPN_H
#define __RPN_H
typedef enum RPNState RPNState ;
enum RPNState {
S_MAIN,
S_READING,
S_DONE,
S_ERROR
};
typedef struct RPN RPN;
struct RPN {
char ∗ i n p u t ;
RPNState s t a t e ;
i n t sp ;
int stack [ 1 0 0 ] ;
};
void push (RPN ∗ rpn , i n t n ) ;
i n t pop (RPN ∗ rpn ) ;
void t i c k (RPN ∗ rpn ) ;
i n t c a l c ( char ∗ e x p r ) ;
#endif /∗ __RPN_H ∗/
A.1.2
rpn.c
#include <c t y p e . h>
#include " rpn . h"
void push (RPN ∗ rpn , i n t n )
{
rpn−>s t a c k [ rpn−>sp++] = n ;
}
i n t pop (RPN ∗ rpn )
{
return rpn−>s t a c k [−−rpn−>sp ] ;
}
void t i c k (RPN ∗ rpn )
{
char i = ∗ rpn−>i n p u t ;
switch ( rpn−>s t a t e )
{
case S_MAIN:
if ( i s d i g i t ( i ))
{
push ( rpn , 0 ) ;
rpn−>s t a t e = S_READING;
return ;
}
i f ( i == ’+ ’ )
29