ASA CMSC 430 Modifying the Attached Interpreter Project The third project involves modifying the attached interpreter so that it interprets programs for th

using namespace std;

#include “values.h”
#include “listing.h”
#include “symbols.h”

int yylex();
void yyerror(const char* message);

Symbols symbols;

int result;

%}

%error-verbose

%union
{
CharPtr iden;
Operators oper;
int value;
}

%token IDENTIFIER
%token INT_LITERAL

%token ADDOP MULOP RELOP
%token ANDOP

%token BEGIN_ BOOLEAN END ENDREDUCE FUNCTION INTEGER IS REDUCE RETURNS

%type body statement_ statement reductions expression relation term
factor primary
%type operator

%%

function:
function_header optional_variable body {result = $3;} ;

function_header:
FUNCTION IDENTIFIER RETURNS type ‘;’ ;

optional_variable:
variable |
;

variable:
IDENTIFIER ‘:’ type IS statement_ {symbols.insert($1, $5);} ;

type:
INTEGER |
BOOLEAN ;

body:
BEGIN_ statement_ END ‘;’ {$$ = $2;} ;

statement_:
statement ‘;’ |
error ‘;’ {$$ = 0;} ;

statement:
expression |
REDUCE operator reductions ENDREDUCE {$$ = $3;} ;

operator:
ADDOP |
MULOP ;

reductions:
reductions statement_ {$$ = evaluateReduction($0, $1, $2);} |
{$$ = $0 == ADD ? 0 : 1;} ;

expression:
expression ANDOP relation {$$ = $1 && $3;} |
relation ;

relation:
relation RELOP term {$$ = evaluateRelational($1, $2, $3);} |
term ;

term:
term ADDOP factor {$$ = evaluateArithmetic($1, $2, $3);} |
factor ;

factor:
factor MULOP primary {$$ = evaluateArithmetic($1, $2, $3);} |
primary ;

primary:
‘(‘ expression ‘)’ {$$ = $2;} |
INT_LITERAL |
IDENTIFIER {if (!symbols.find($1, $$)) appendError(UNDECLARED, $1);} ;

%%

void yyerror(const char* message)
{
appendError(SYNTAX, message);
}

int main(int argc, char *argv[])
{
firstLine();
yyparse();
if (lastLine() == 0)
cout << "Result = " << result << endl; return 0; } scanner.l /* Compiler Theory and Design Duane J. Jarc */ /* This file contains flex input file */ %{ #include

using namespace std;

#include “values.h”
#include “listing.h”
#include “tokens.h”

%}

%option noyywrap

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

{ws} { ECHO; }
{comment} { ECHO; nextLine();}
{line} { ECHO; nextLine();}
“<" { ECHO; yylval.oper = LESS; return(RELOP); } "+" { ECHO; yylval.oper = ADD; return(ADDOP); } "*" { ECHO; yylval.oper = MULTIPLY; 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; yylval.iden = (CharPtr)malloc(yyleng + 1); strcpy(yylval.iden, yytext); return(IDENTIFIER);} {int} { ECHO; yylval.value = atoi(yytext); return(INT_LITERAL); } {punc} { ECHO; return(yytext[0]); } . { ECHO; appendError(LEXICAL, yytext); } %% symbols.h // Compiler Theory and Design // Dr. Duane J. Jarc template
class Symbols
{
public:
void insert(char* lexeme, T entry);
bool find(char* lexeme, T& entry);
private:
map symbols;
};

template
void Symbols::insert(char* lexeme, T entry)
{
string name(lexeme);
symbols[name] = entry;
}

template
bool Symbols::find(char* lexeme, T& entry)
{
string name(lexeme);
typedef typename map::iterator Iterator;
Iterator iterator = symbols.find(name);
bool found = iterator != symbols.end();
if (found)
entry = iterator->second;
return found;
}

values.cc

// CMSC 430
// Duane J. Jarc

// This file contains the bodies of the evaluation functions

#include
#include
#include

using namespace std;

#include “values.h”
#include “listing.h”

int evaluateReduction(Operators operator_, int head, int tail)
{
if (operator_ == ADD)
return head + tail;
return head * tail;
}

int evaluateRelational(int left, Operators operator_, int right)
{
int result;
switch (operator_)
{
case LESS:
result = left < right; break; } return result; } int evaluateArithmetic(int left, Operators operator_, int right) { int result; switch (operator_) { case ADD: result = left + right; break; case MULTIPLY: result = left * right; break; } return result; } values.h // CMSC 430 // Duane J. Jarc // This file contains function definitions for the evaluation functions typedef char* CharPtr; enum Operators {LESS, ADD, MULTIPLY}; int evaluateReduction(Operators operator_, int head, int tail); int evaluateRelational(int left, Operators operator_, int right); int evaluateArithmetic(int left, Operators operator_, int right); CMSC 430 Project 3 The third project involves modifying the attached interpreter so that it interprets programs for the complete language. You may convert all values to double values, although you can maintain their individual types if you wish. When the program is run on the command line, the parameters to the function should be supplied as command line arguments. For example, for the following function header of a program in the file text.txt: function main a: integer, b: integer returns integer; One would execute the program as follows: $ ./compile < test.txt 2 4 In this case, the parameter a would be initialized to 2 and the parameter b to 4. An example of a program execution is shown below: $ ./compile < test.txt 2 4 1 2 3 4 5 6 7 8 9 10 11 12 13 14 function main a: integer, b: integer returns integer; c: integer is if a > b then
a rem b;
else
a ** 2;
endif;
begin
case a is
when 1 => c;
when 2 => (a + b / 2 – 4) * 3;
others => 4;
endcase;
end;
Compiled Successfully
Result = 0
After the compilation listing is output, the value of the expression which comprises the body of
the function should be displayed as shown above.
The existing code evaluates some of the arithmetic, relational and logical operators together with
the reduction statement and integer literals only. You are to add the necessary code to include all
of the following:






Real and Boolean literals
All additional arithmetic operators
All additional relational and logical operators
Both if and case statements
Functions with multiple variables
Functions with parameters
This project requires modification to the bison input file, so that it defines the additional the
necessary computations for the above added features. You will need to add functions to the
library of evaluation functions already provided in values.cc. You must also make some
modifications to the functions already provided.
You are to submit two files.
1. The first is a .zip file that contains all the source code for the project. The .zip file
should contain the flex input file, which should be a .l file, the bison file, which should
be a .y file, all .cc and .h files and a makefile that builds the project.
2. The second is a Word document (PDF or RTF is also acceptable) that contains the
documentation for the project, which should include the following:
a. A discussion of how you approached the project
b. A test plan that includes test cases that you have created indicating what aspects
of the program each one is testing and a screen shot of your compiler run on that
test case
c. A discussion of lessons learned from the project and any improvements that could
be made
Grading Rubric
Criteria
Functionality
Meets
Does Not Meet
70 points
0 points
Functions with real and Boolean literals
evaluated correctly (5)
Functions with real and Boolean literals
not evaluated correctly (0)
Subtraction and division operators
evaluated correctly (5)
Subtraction and division operators not
evaluated correctly (0)
Remainder operator evaluated
correctly (5)
Remainder operator not evaluated
correctly (0)
Exponentiation operator evaluated
correctly (5)
Exponentiation operator not evaluated
correctly (0)
Additional relational operators
evaluated correctly (5)
Additional relational operators not
evaluated correctly (0)
Additional logical operators evaluated
correctly (5)
Additional logical operators not
evaluated correctly (0)
if conditional expressions evaluated
correctly (10)
if conditional expressions not
evaluated correctly (0)
case conditional expressions evaluated
correctly (10)
case conditional expressions not
evaluated correctly (0)
Functions with multiple variables
evaluated correctly (10)
Functions with multiple variables not
evaluated correctly (0)
Functions with parameters evaluated
correctly (10)
Functions with parameters not
evaluated correctly (0)
15 points
Test Cases
Includes test cases that test real and
Boolean literals (3)
Does not Include test cases that test
real and Boolean literals (3)
Includes test cases that test all
arithmetic operators (3)
Does not include test cases that test all
arithmetic operators (0)
Includes test cases that test all
relational and logical operators (3)
Does not include test cases that test all
relational and logical operators (0)
Includes test cases that test both
conditional expressions (3)
Does not include test cases that test
both conditional expressions (0)
Includes test cases with variables and
parameters (3)
Does not include test cases with
variables and parameters (0)
15 points
Documentation
0 points
Discussion of approach included (5)
Lessons learned included (5)
0 points
Discussion of approach not included (0)
Lessons learned not included (0)
Comment blocks with student name,
project, date and code description
included in each file (5)
Comment blocks with student name,
project, date and code description not
included in each file (0)

Purchase answer to see full
attachment