C언어 중급반 소스 - 나현재 강의 홈 - 후위연산 및 후위계산 위한 준비.

홈

ORACLE

WEB

C언어

APM

기획

JAVA

MsSql

C언어

2012. 02
일	월	화	수	목	금	토
			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

Counter

글수 61

후위연산 및 후위계산 위한 준비.

나현재

http://j.finfra.com/zbl/3189

2007.08.24 14:17:25 (*.129.63.220)

169

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define MAX_STACK_SIZE 100 /* maximum stack size */
#define MAX_EXPR_SIZE 100 /* max size of expression */

typedef enum { lparen, rparen, plus, minus, times, divide,
    mod, eos ,operand } precedence;
typedef struct{
    int precedence;
    float value;
}oper;

oper expr[MAX_EXPR_SIZE]; /* input string */
oper exprPost[MAX_EXPR_SIZE]; /* input string */
int exprPostCount=0;
int exprCount = 0;
int top = -1;
precedence stack[MAX_STACK_SIZE];
int top2 = -1;
oper stack2[MAX_STACK_SIZE];
/* isp and icp arrays ? index is value of precedence lparen, rparen,
plus, minus, times, divide, mode, eos */

void push(precedence item)
{
if(top >= MAX_STACK_SIZE - 1) {
    printf("stack_full()n");
    return;
}
stack[++top] = item;
}

precedence pop() {
    if(top == -1)
    {
        printf("stack_empty()n"); exit(0);
    }
    return stack[(top)--];
}

void push2(oper item)
{
if(top2 >= MAX_STACK_SIZE - 1) {
    printf("stack_full()n");
    return;
}
stack2[++(top2)] = item;
}

oper pop2() {
    if(top2 == -1)
    {
        printf("stack_empty()n"); exit(0);
    }
    return stack2[(top2)--];
}

static int isp[] = {0,19,12,12,13,13,13,0};
static int icp[] = {20,19,12,12,13,13,13,0};
precedence get_precedence(char symbol){
switch(symbol) {
    case '(': return lparen;
    case ')': return rparen;
    case '+': return plus;
    case '-': return minus;
    case '/': return divide;
    case '*': return times;
    case '%': return mod;
    case ' ': return eos;
    default: return operand;
}
}

void print_token(precedence t) {
    switch(t) {
        case lparen : printf("( " );break;
        case rparen : printf(") " );break;
        case plus : printf("+ " ); break;
        case minus : printf("- " ); break;
        case divide : printf("/ " ); break;
        case times : printf("* " ); break;
        case mod : printf("% " ); break;
        case eos : printf("eos " ); break;
        default: printf("n ");
    }
    //if(!isoperand)
        exprPost[exprPostCount++].precedence =t;
    //}
}

float instrToNum(char* st,int start,int end){
    int i,c=0;
    char numstr[100];
    for(i=start;i<=end;i++){
        numstr[c++]=st[i];
    }
    numstr[c]=0;
    return (float)atof(numstr);

}
void inputexpr(char *st){
    int i,tmp,exprcount=0;
    for(i=0,tmp=0;i<MAX_EXPR_SIZE;i++){
        if( !(('0'<= st[i] && st[i] <= '9')||st[i]=='.') ){
            if(tmp==i){
                expr[exprcount].precedence = get_precedence( st[tmp] );
                expr[exprcount++].value = 0;
                tmp++;

            }else{
                expr[exprcount].precedence = operand ;
                expr[exprcount].value = instrToNum(st,tmp,i-1) ;
                tmp=i;
                expr[++exprcount].precedence = get_precedence( st[tmp] );
                expr[exprcount++].value = 0.;

                tmp++;
            }
        }
        if(expr[exprcount-1].precedence == eos)
                break;
    }
    exprCount=exprcount;

}
void postfix(void) {
//
}

float eval(void)
{
//
}

int main()
{
char e[MAX_EXPR_SIZE]="3+((2*5)-4) ";

    inputexpr(e);
    postfix();

    printf("Result is %f.!n",eval());
}

이 게시물을..

엮인글 주소 : http://j.finfra.com/zbl/zbl/3189/956/trackback

2007.10.18 16:24:19 (*.129.63.220)

나현재

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define MAX_STACK_SIZE 100 /* maximum stack size */
#define MAX_EXPR_SIZE 100 /* max size of expression */

typedef enum { lparen, rparen, plus, minus, times, divide,
    mod, eos ,operand } precedence;
typedef struct{
    int precedence;
    float value;
}oper;

void push(precedence item)
{
if(top >= MAX_STACK_SIZE - 1) {
    printf("stack_full()n");
    return;
}
stack[++top] = item;
}

precedence pop() {
    if(top == -1)
    {
        printf("stack_empty()n"); exit(0);
    }
    return stack[(top)--];
}

void push2(oper item)
{
if(top2 >= MAX_STACK_SIZE - 1) {
    printf("stack_full()n");
    return;
}
stack2[++(top2)] = item;
}

oper pop2() {
    if(top2 == -1)
    {
        printf("stack_empty()n"); exit(0);
    }
    return stack2[(top2)--];
}

float instrToNum(char* st,int start,int end){
    int i,c=0;
    char numstr[100];
    for(i=start;i<=end;i++){
        numstr[c++]=st[i];
    }
    numstr[c]=0;
    return (float)atof(numstr);

}
void postfix(void) {
    oper token;
    int n = 0;
    top = 0;
    stack[0] = eos;
    for(token = expr[n++];
        token.precedence != eos;
        token = expr[n++]) {
            if(token.precedence == operand){
               // printf("%4.2f ", token.value);
                exprPost[exprPostCount++]=token;
            }
            else if(token.precedence == rparen) {

                while(stack[top] != lparen){
                    print_token(pop());
                }
                pop();
            }
            else {
                while(isp[stack[top]] >= icp[token.precedence]){
                    print_token(pop());
                }
                push(token.precedence);
            }
    }
    while((token.precedence = pop()) != eos)
        print_token(token.precedence);
    print_token(eos);
    printf("n");
}

float eval(void)
{
//
}

int main()
{
    char e[MAX_EXPR_SIZE]="3*(4-2) ";
    printf("%sn",e);
    inputexpr(e);
    {    int i;
        for(i=0;i<exprCount;i++){
            printf("%d %fn",expr[i].precedence,expr[i].value);
        }
    }

    postfix();
    {    int i;
        for(i=0;i<exprCount;i++){
            printf("%d %fn",exprPost[i].precedence,exprPost[i].value);
        }
    }
//    printf("Result is %f.!n",eval());
}

2007.10.18 16:24:19 (*.129.63.220)

나현재

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define MAX_STACK_SIZE 100 /* maximum stack size */
#define MAX_EXPR_SIZE 100 /* max size of expression */

typedef enum { lparen, rparen, plus, minus, times, divide,
    mod, eos ,operand } precedence;
typedef struct{
    int precedence;
    float value;
}oper;

void push(precedence item)
{
if(top >= MAX_STACK_SIZE - 1) {
    printf("stack_full()n");
    return;
}
stack[++top] = item;
}

precedence pop() {
    if(top == -1)
    {
        printf("stack_empty()n"); exit(0);
    }
    return stack[(top)--];
}

void push2(oper item)
{
if(top2 >= MAX_STACK_SIZE - 1) {
    printf("stack_full()n");
    return;
}
stack2[++(top2)] = item;
}

oper pop2() {
    if(top2 == -1)
    {
        printf("stack_empty()n"); exit(0);
    }
    return stack2[(top2)--];
}

float instrToNum(char* st,int start,int end){
    int i,c=0;
    char numstr[100];
    for(i=start;i<=end;i++){
        numstr[c++]=st[i];
    }
    numstr[c]=0;
    return (float)atof(numstr);

float eval(void)
{
    int i=0;
    oper tmp;
    float val1,val2,ret;
    while(exprPost[i].precedence!=eos){
        if(exprPost[i].precedence == operand){
            push2(exprPost[i]);
        }else{
            tmp = pop2();
            val2 = tmp.value;
            tmp = pop2();
            val1 = tmp.value;
            switch(exprPost[i].precedence){
                case plus: ret=val1+val2;break;
                case minus:ret=val1-val2;break;
                case times:ret=val1*val2;break;
                case divide:ret=val1/val2;break;
                case mod :ret= (float)((int)val1 % (int)val2) ;break;
                default:printf("error!!!n");
            }
            tmp.value = ret;
            tmp.precedence = operand;
            push2(tmp);
        }
        i++;
    }
    tmp = pop2();
    return tmp.value;
}

    postfix();
    {    int i;
        for(i=0;i<exprPostCount;i++){
            printf("%d %fn",exprPost[i].precedence,exprPost[i].value);
        }
    }
    printf("Result is %f.!n",eval());

}

2007.10.18 16:24:19 (*.129.63.220)

나현재

//디버그적용한
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define DEBUG 0
#define MAX_STACK_SIZE 100 /* maximum stack size */
#define MAX_EXPR_SIZE 100 /* max size of expression */

typedef enum { lparen, rparen, plus, minus, times, divide,
    mod, eos ,operand } precedence;
typedef struct{
    int precedence;
    float value;
}oper;

void push(precedence item)
{
if(top >= MAX_STACK_SIZE - 1) {
    printf("stack_full()n");
    return;
}
stack[++top] = item;
}

precedence pop() {
    if(top == -1)
    {
        printf("stack_empty()n"); exit(0);
    }
    return stack[(top)--];
}

void push2(oper item)
{ if(top2 >= MAX_STACK_SIZE - 1) {
    printf("stack_full()n");
    return;
}

stack2[++(top2)] = item;
}

oper pop2() {
oper tmp;

if(top2 == -1)
    {
        printf("stack_empty()n"); exit(0);
    }
tmp = stack2[top2];
top2--;
    return tmp;
}

void print_token(precedence t) {
#if DEBUG
    switch(t) {
        case lparen : printf("( " );break;
        case rparen : printf(") " );break;
        case plus : printf("+ " ); break;
        case minus : printf("- " ); break;
        case divide : printf("/ " ); break;
        case times : printf("* " ); break;
        case mod : printf("% " ); break;
        case eos : printf("eos " ); break;
        default: printf("n ");
    }
#endif
    //if(!isoperand)
        exprPost[exprPostCount++].precedence =t;
    //}
}

float instrToNum(char* st,int start,int end){
    int i,c=0;
    char numstr[100];
    for(i=start;i<=end;i++){
        numstr[c++]=st[i];
    }
    numstr[c]=0;
    return (float)atof(numstr);

int main()
{
char e[MAX_EXPR_SIZE];//="3*(4-2) ";
scanf("%s",e);
strcat(e," ");

#if DEBUG
printf("%sn",e);
#endif
inputexpr(e);
#if DEBUG
    {    int i;
        for(i=0;i<exprCount;i++){
            printf("%d %fn",expr[i].precedence,expr[i].value);
        }
    }
#endif
    postfix();
#if DEBUG
    {    int i;
        for(i=0;i<exprPostCount;i++){
            printf("%d %fn",exprPost[i].precedence,exprPost[i].value);
        }
    }
#endif
printf("Result is %f.!n",eval());

}

2007.10.18 16:24:19 (*.129.63.220)

나현재

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define DEBUG 0
#define MAX_STACK_SIZE 100 /* maximum stack size */
#define MAX_EXPR_SIZE 100 /* max size of expression */

typedef enum { lparen, rparen, plus, minus, times, divide,
    mod, eos ,operand } precedence;
typedef struct{
    int precedence;
    float value;
}oper;

void push(precedence item)
{
if(top >= MAX_STACK_SIZE - 1) {
    printf("stack_full()n");
    return;
}
stack[++top] = item;
}

precedence pop() {
    if(top == -1)
    {
        printf("stack_empty()n"); exit(0);
    }
    return stack[(top)--];
}

void push2(oper item)
{ if(top2 >= MAX_STACK_SIZE - 1) {
    printf("stack_full()n");
    return;
}

stack2[++(top2)] = item;
}

oper pop2() {
    oper tmp;

    if(top2 == -1)
    {
        printf("stack_empty()n"); exit(0);
    }
    tmp = stack2[top2];
    top2--;
    return tmp;
}

void print_token(precedence t) {
    #if DEBUG
    switch(t) {
        case lparen : printf("( " );break;
        case rparen : printf(") " );break;
        case plus : printf("+ " ); break;
        case minus : printf("- " ); break;
        case divide : printf("/ " ); break;
        case times : printf("* " ); break;
        case mod : printf("% " ); break;
        case eos : printf("eos " ); break;
        default: printf("n ");
    }
    #endif
    //if(!isoperand)
        exprPost[exprPostCount++].precedence =t;
    //}
}

float instrToNum(char* st,int start,int end){
    int i,c=0;
    char numstr[100];
    for(i=start;i<=end;i++){
        numstr[c++]=st[i];
    }
    numstr[c]=0;
    return (float)atof(numstr);

int main()
{
    int i=0;
    char t;
    char e[MAX_EXPR_SIZE];//="3*(4-2) ";
    //scanf("%s",e);
    while(1){
        t=getch();
        if(('0'<t && t<'9')||t==' '||t=='*' ||t=='/'||t=='-'||t=='+'||t=='%'){
            e[i++]=t;
            putch(t);
            if(t==' ')break;
        }
    }
    //strcat(e," ");

    #if DEBUG
    printf("%sn",e);
    #endif
    inputexpr(e);
    #if DEBUG
    {    int i;
        for(i=0;i<exprCount;i++){
            printf("%d %fn",expr[i].precedence,expr[i].value);
        }
    }
    #endif
    postfix();
    #if DEBUG
    {    int i;
        for(i=0;i<exprPostCount;i++){
            printf("%d %fn",exprPost[i].precedence,exprPost[i].value);
        }
    }
    #endif
    printf("Result is %f.!n",eval());

}

번호	제목	글쓴이	날짜	조회수
61	2진트리	나현재	2007-08-31	242
60	이중링크드리스트의 삽입과 삭제.	나현재	2007-08-29	266
59	링크드리스트 (삽입과 삭제) 1	나현재	2007-08-29	245
58	삽입소트(링크드리스트이용)	나현재	2007-08-29	179
57	링크드리스트 (삽입)	나현재	2007-08-28	155
56	링크드리스트 큐 1	나현재	2007-08-28	200
55	링크드리스트 스택 2	나현재	2007-08-27	463
54	간단한 링크드리스트 구현	나현재	2007-08-27	209
53	malloc,calloc,realloc 사용예	나현재	2007-08-27	2788
	후위연산 및 후위계산 위한 준비. 4	나현재	2007-08-24	169
51	미로찾기-spep4완성	나현재	2007-08-23	230
50	미로찾기-step3	나현재	2007-08-23	154
49	미로찾기-step2	나현재	2007-08-22	208
48	미로찾기-step1	나현재	2007-08-22	230
47	환형 큐(배열이용) - 간단소스	나현재	2007-08-21	206
46	큐(배열이용) - 초간단 소스	나현재	2007-08-21	122
45	스택(배열) - 초간단 2	나현재	2007-08-21	153
44	희소행렬 처리 간단 소스(sparse Matrix)	나현재	2007-08-20	240
43	자기참조구조체-메모리멥까지	나현재	2007-08-20	3010
42	c자료구조입문-2장 이진검색_재귀함수이용 1	나현재	2007-08-16	201

쓰기

첫페이지 1 2 3 4 끝페이지