our assignment is 4 fold: define the rules for recognizing all lexemes as their proper token define production rules for implementing the mathematical syntax of operators and operands make sure it conforms to the standard of an ll grammar make sure it properly enforces the correct precedence rules make sure it is not ambiguous in creating parses write a program that recognizes all tokens in a file write a program or an extension to the above program that determines if the tokens conform to the correct syntax.
