Write complete tests for Lexer.
The Lexer accepts and tokenizes the three current frabjous programs (gol, mobility and sir). I need to confirm that the resulting tokens are correct, and then I need to write stress tests on the token parser to:
-
ensure certain regex expressions fail (like having leading 0's on integers and floating points) -
ensure all cases for expressions are tested
Edited by Alexander Dumais (add118)