Description: In this assignment, you will build a simple lexer for arithmetic expressions. A lexer breaks an put str g to tokens, each of which is a unit of the expression. We consider the follow g as tokens: (1) the symbols,+,--‐, ( and ), (2) variable name consist g of alpha--‐
umeric characters and underscore, and (3) teger numeric constants. You do not have to dist guish between the three k ds of tokens for now.
File list (Check if you may need any files):
lastassim.java
Lexer.java
Download