This homework I spoke of in a previous post is yet another parser for a class. We are done with the major part of the program, it now just needs a few minor touchups so we get an awesome A.
So what all does it do?
Handles parsing prefix expressions with the following data:
+, -, /, *, (), and let which is a cheap way of saying x=0.
It also handles infix notation for
+, – ,/ , *
We’re on our way. More later.