Yes, I think so.
Perhaps even a representation as simple as:
['*', 3, ['+', 3, 2]]
Then you can imagine a recursive walk over that expression using a rule that matches [op('+'), number, number] and rewrites it to the sum, reducing that to ['*', 3, 5] , and another rule like [op('*'), number, number] and reduces that to 15, and then you're done.
[op('+'), number, number]
['*', 3, 5]
[op('*'), number, number]
Great idea, thanks!
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Yes, I think so.
Perhaps even a representation as simple as:
Then you can imagine a recursive walk over that expression using a rule that matches
[op('+'), number, number]and rewrites it to the sum, reducing that to
['*', 3, 5], and another rule like
[op('*'), number, number]and reduces that to 15, and then you're done.
Great idea, thanks!