|
operatorStack[MAX_STACK_SIZE];
/* precedence 지정*/
int InStackPrecedence[11] = {0,19,18,18,14,13,13,13,12,12,0};
int InComingPrecedence[11] = {20,19,18,18,15,13,13,13,12,12,0};
void getInfix(char infixExpr[]);
void infixToPostfix(char infixExpr[], char postfixExpr[]);
void printPostfix(char
|
|
|
operator)
1.1 이항 연산자(binary operator)
1.2 단항 연산자(unary operator)
1.3 대입 연산자(assignmentoperator)
2 관계 연산자(relational operator)
3 논리 연산자(logical operator)
4 비트 연산자(bit operator)
5 기타 연산자
5.1 콤마(,) 연산자
5.2 sizeof 연산자
5.3 형
|
|
|
|
operator...
# Two operands are popped from the stack...
--------------------------------------------------
# Operator: -
# Operand 1: 3
# Operand 2: 4
# Intermediate result: -1
--------------------------------------------------
# The intermediate result is pushed into the stack...
=====
|
|
|
Infix expression:\\n\");
getLine(strtemp);
minusHandling(strtemp);
} while(!isInfix());
operator_stack[0] = eos; // 연산자 스택에 end of stack값을 넣음
for(i = 0; i < (int)strlen(str) + 1; i++)
{
token = token_cost(i);
// 토큰이 피연산자일 때
if(token == operand && (str[i] >= \'0\' && str[i] &
|
|
|
|
Operator Stack] : * - +
[Operand Stack] : * / *
[Operator Stack] : - +
[Operand Stack] : - *
[Operator Stack] : +
[Operand Stack] : +
[Operator Stack] :
[트리생성완료]
[수식의 표현]
Tree - Original : A * B + C / ( D - ( E - F * G ) ) / H - I * J
Tree - infix :
|
|
메뉴펼치기
