Sample table-driven finite-state machine
If I were a candidate, I'd judge what I think the quality of your code looks like based on this simple, and I'd have some concerns:


Your transition table depends on the values of the Lexeme enum not changing (say by inserting additional values). If this is the case I'd like there to be a comment on enum saying order is significant or having the values explicitly given orders. Otherwise I'd expect the actual numbers to not matter.
Your code contains a transition table. That's hard to read and hard to modify. Why would you do that? 
You've two extra sets of parens here:

while ((currentState &gt;= 0) &amp;&amp; (currentState != 7))

Your states and done via magic numbers and not an enum.
The check for -1 feels like it's in the wrong place. It is handling an error condition. But the other element of the switch isn't an error condition.