인하대 데이터구조 5주차 Homework02 infix, postfix

소개글

인하대 데이터구조 5주차 infix, postfix 결과보고서입니다! 2022년 1학기에 수강하여 작성했고 보고서 쓰는데 유용하게 이용해주셨으면 좋겠네요.
코드, 결과보고서 압축하여 첨부했습니다.

목차

1. Problem definition
2. Algorithm and simple code description(function’s role)
3. Results and results screen
4. Conclusion

본문내용

Problem definition
: The formula expressed in infix is input to stdin, converted to postfix and output to stdout.
Make sure that stdin accepts one expression and that postfix is still output to stdout so that it can continue taking other words, one by one, and exit if there is no input expression.
Performing form (Running command): ./a out <infix.txt> postfix.txt
ex) infix example:
13/4-5+6*7
5*(6+7)
Postfix example:
13 4 / 5 – 6 7 * +
5 6 7 + *
(1) Processable binary operator: *,/,+,-,(,)

참고 자료

없음

압축파일 내 파일목록

Homework02_Datastructure.hwp
InfixToPostfix.cpp