Fundamental principles of computer programming comes from mathematical logic. Mathematics enables programming languages to interpret and execute complex instructions. This project explores the possibl..
Fundamental principles of computer programming comes from mathematical logic. Mathematics enables programming languages to interpret and execute complex instructions. This project explores the possible application of mathematical logic within programming languages by developing a Boolean logic calculator in C++. The program implements a stack-based algorithm to convert infix notation (which we often use) to postfix notation (which computers can evaluate) and uses subsequent functions to evaluate the postfix notation. The program focuses on logic operators NOT, AND, and OR, classified with specific precedence hierarchies. Program analysis shows that the processes have linear time complexity, that is, O(n). The result suggests that stack-based algorithms successfully evaluate logic operations, but error handling needs more work in the future.
