Even though infix expression is easy for humans to understand, it is hard for the computers to comprehend. According to Sayan Mahapatra from GeekforGeeks , “Prefix and Postfix expressions can be evaluated faster than an infix expression. This is because we don’t need to process any brackets or follow operator precedence rule.” Using postfix expression eliminates the problem of confusion due to precedence. For example, an infix expression such as 2$3&4. One does not know if 2$3 should be applied first or 3&4 without knowing the precedence . In addition, Postfix expression can be easily calculated with the Stack base algorithm .
Dr. Hongbiao Zheng
Copyright the Author(s)
"Postfix Form to Infix Form,"
SACAD: John Heinrichs Scholarly and Creative Activity Days: Vol. 2022, Article 49.
Available at: https://scholars.fhsu.edu/sacad/vol2022/iss2022/49