In processing a prefix expression- which part of the process was recur.pdf
0 likes12 views
The document discusses the recursive nature of processing prefix expressions, highlighting the value calculation as a recursive part. It also addresses methods to simplify infix expressions for easier program evaluation, suggesting conversion to fully parenthesized forms or transforming to prefix/postfix notations.
1 of 1
Download to read offline
More Related Content
More from sidkucheria (20)
Ad
Recently uploaded (20)
Ad
In processing a prefix expression- which part of the process was recur.pdf
- 1. In processing a prefix expression, which part of the process was recursive? Calculating the value of the prefix expression Determining the complexity of the prefix expression Checking the syntax of the prefix expression Finding the end of a prefix expression What can be done to an infix expression to make it easier to evaluate in a program? Nothing, they are always very complex to process Add all of the parenthesis making it a fully parenthesized infix expression Convert to prefix, then to postfix, then it can be easily evaluated Perform backtracking