| Age | Commit message (Collapse) | Author |
|---|
|
I believe this is because I'm using right tail recursion, but I'm not really
sure how I could change it for this program.
order of operations is being observed perfectly, but then operations are being
performed from right to left, not left to right. I think I may be reducing
too frequently, honestly.
|
|
That was actually really cool. Now to clean up the debugging code and write
the execution engine.
|
|
There's still more to do, however. It doesn't do math anymore, it produces
a script that can then be executed. Now we have to capture that script and
execute it.
|
|
I'm doing some reading up on LR(n) parsers, I just sort of started without
thinking about it this time, not a great approach. I feel like it can't hurt
to have an update on how this works anyway. I think the idea was solid, but
I was trying to do too much at once.
One question is what my goal should be for this. I could just solve the
equation as we go, or I could generate code that will let us solve the equation.
The later is obviously attractive in that it will let us run an expression
more than once, and maybe even define functions. I like that.
|
|
|
|
You no longer need to set the radix in the current radix.
|
|
|
|
|
|
|
