I managed to confuse myself pretty well.

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.

1 files changed, 26 insertions, 0 deletions

diff --git a/src/token.cpp b/src/token.cpp
index 30f3566..c591e6a 100644
--- a/src/token.cpp
+++ b/src/token.cpp
@@ -55,6 +55,32 @@ Token::~Token()
     }

 }

 

+Token &Token::operator=( const Token &rhs )

+{

+    switch( eType )

+    {

+        case tNumber:

+            delete nVal;

+            break;

+

+        case tVariable:

+        case tCommand:

+        case tString:

+            delete sVal;

+            break;

+

+        default:

+            break;

+    }

+    eType = rhs.eType;

+    sVal = rhs.sVal;

+

+    Token &rMod = const_cast<Token &>(rhs);

+    rMod.sVal = 0;

+

+    return *this;

+}

+

 Bu::Formatter &operator<<( Bu::Formatter &f, Token::Type eType )

 {

     switch( eType )