The first project involves modifying the attached lexical analyzer and the compilation listing generator code. You need to make the following modifications to the lexical analyzer, scanner.l:

- A new token ARROW should be added for the two character punctuation symbol =>. - The following reserved words should be added: case, else, endcase, endif, if, others, real, then, when - Each reserved words should be a separate token. The token name should be the same as the lexeme, but in all upper case. - Two additional logical operators should be added. The lexeme for the first should be or and its token should be OROP. The second logical operator added should be not and its token should be NOTOP. - Five relational operators should be added. They are =, /=, >, >= and <=. All of the lexemes should be represented by the single token RELOP. - One additional lexeme should be added for the ADDOP token. It is binary -. - One additional lexeme should be added for the MULOP token. It is/. - A new token REMOP should be added for the remainder operator. Its lexeme should be rem. - A new token EXPOP should be added for the exponentiation operator. Its lexeme should be **. - A second type of comment should be added that begins with // and ends with the end of line. As with the existing comment, no token should be returned. - The definition for the identifiers should be modified so that underscores can be included, however, consecutive underscores, leading and trailing underscores should not be permitted. - A real literal token should be added. It should begin with a sequence of one or more digits following by a decimal point followed by zero or more additional digits. It may optionally end with an exponent. If present, the exponent should begin with an e or E, followed by an optional plus or minus sign followed by one or more digits. The token should be named REAL_LITERAL. - A Boolean literal token should be added. It should have two lexemes, which are true and false. The token should be named BOOL_LITERAL.

You must also modify the header file tokens.h to include each the new tokens mentioned above.

The compilation listing generator code should be modified as follows:

1. The lastLine function should be modified to compute the total number of errors. If any errors occurred the number of lexical, syntactic and semantic errors should be displayed.

If no errors occurred, it should display Compiled Successfully. It should return the

total number of errors.

The appendError function should be modified to count the number of lexical, syntactic

and semantic errors. The error message passed to it should be added to a queue of

messages that occurred on that line.

The displayErrors function should be modified to display all the error messages that

have occurred on the previous line and then clear the queue of messages.

An example of the output of a program with no lexical errors is shown below:

1 // Program with no errors 2 3 function test1 returns boolean; 4 begin 5 7 + 2 > 6 and 8 = 5 * (7 - 4); 6 end;

Compiled Successfully

Here is the required output for a program that contains more than one lexical error on the same line:

1 -- Function with two lexical errors

2

3 function test2 returns integer;

4 begin

5 7 $ 2 ^ (2 + 4); Lexical Error, Invalid Character $ Lexical Error, Invalid Character ^

6 end;

Lexical Errors 2

Syntax Errors 0

Semantic Errors 0

Skeleton Code

scanner.l

----------------------------------------

%{ #include #include

using namespace std;

#include "listing.h" #include "tokens.h"

%}

%option noyywrap

ws [ \t ]+ comment \-\-.* line [ ] id [A-Za-z][A-Za-z0-9]* digit [0-9] int {digit}+ punc [\(\),:;] %%

{ws} { ECHO; } {comment} { ECHO; nextLine();} {line} { ECHO; nextLine();} "<" { ECHO; return(RELOP); } "+" { ECHO; return(ADDOP); } "*" { ECHO; return(MULOP); } begin { ECHO; return(BEGIN_); } boolean { ECHO; return(BOOLEAN); } end { ECHO; return(END); } endreduce { ECHO; return(ENDREDUCE); } function { ECHO; return(FUNCTION); } integer { ECHO; return(INTEGER); } is { ECHO; return(IS); } reduce { ECHO; return REDUCE; } returns { ECHO; return(RETURNS); } and { ECHO; return(ANDOP); } {id} { ECHO; return(IDENTIFIER);} {int} { ECHO; return(INT_LITERAL); } {punc} { ECHO; return(yytext[0]); } . { ECHO; appendError(LEXICAL, yytext); } %%

int main() { firstLine(); FILE *file = fopen("lexemes.txt", "wa"); int token = yylex(); while (token) { fprintf(file, "%d %s ", token, yytext); token = yylex(); } lastLine(); fclose(file); return 0; }

tokens.h

----------------------------------------

enum Tokens {RELOP = 256, ADDOP, MULOP, ANDOP, BEGIN_, BOOLEAN, END, ENDREDUCE, FUNCTION, INTEGER, IS, REDUCE, RETURNS, IDENTIFIER, INT_LITERAL};

listing.cc

---------------------------------------

// Compiler Theory and Design // Dr. Duane J. Jarc

// This file contains the bodies of the functions that produces the compilation // listing

#include #include

using namespace std;

#include "listing.h"

static int lineNumber; static string error = ""; static int totalErrors = 0;

static void displayErrors();

void firstLine() { lineNumber = 1; printf(" %4d ",lineNumber); }

void nextLine() { displayErrors(); lineNumber++; printf("%4d ",lineNumber); }

int lastLine() { printf(" "); displayErrors(); printf(" "); return totalErrors; } void appendError(ErrorCategories errorCategory, string message) { string messages[] = { "Lexical Error, Invalid Character ", "", "Semantic Error, ", "Semantic Error, Duplicate Identifier: ", "Semantic Error, Undeclared " };

error = messages[errorCategory] + message; totalErrors++; }

void displayErrors() { if (error != "") printf("%s ", error.c_str()); error = ""; }

listing.h

----------------------------------------

enum ErrorCategories {LEXICAL, SYNTAX, GENERAL_SEMANTIC, DUPLICATE_IDENTIFIER, UNDECLARED};

void firstLine(); void nextLine(); int lastLine(); void appendError(ErrorCategories errorCategory, string message);