Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I need to implement a simple formula parser. What I am doing is first create a postfix notation and then evaluating the postfix string. Unfortunately, this algorithm doesn’t allow brackets i.e. (2+3)*a. Anyone knows how to extend the algorithm to allow brackets?
Thanks in advance,
Frank
The whole point of postfix notation is to eliminate the brackets in infix notation so that you can evaluate the expression more easily. If your current algorithm doesn’t allow brackets in the infix expression, then you’re using a bad algorithm.
The shunting yard algorithm will allow you to convert from infix to postfix even if the infix version has brackets.