Description: Expression evaluation algorithms: the expression is evaluated in a high-level language compiler fundamental problem is a typical application example of the stack. Any expressions are the operands (operand), operators (operator) and boundary character (delimiter) composed. Either operand is a constant, it can be described as a variable or constant identifier operators can be divided into arithmetic operators, relational operators, and logical operators into three categories basic boundary operators and expressions have parentheses around terminator and so on. Because some operators than other operators may have a higher priority, so the expression can not be evaluated strictly from left to right. To properly handle expressions use a stack to achieve the correct sequence of instructions is an important technology.
To Search:
File list (Check if you may need any files):
ExpEvaluation.txt
Download