1. In this assignment, you will develop an interpreter for a small language, called SpartanLang. The...

  

Transcribed Image Text:

1. In this assignment, you will develop an interpreter for a small language, called SpartanLang. The valid expressions for SpartanLang are given in Figure 1. SpartanLang supports mutable references. The state of these references is maintained in an environment, a mapping of variables to values. With mutable references, other language constructs become more useful, such as sequencing operations (e1; e2). Expressions values e ::= assignment variable dereferencing (i.e. getting a variable's value) sequential expressions binary operations conditional expressions while expressions I := e !x e; e e op e if e then e else e end while e do e end v ::= Values integer values boolean values i b op ::= +|- | * | > | >= | < | <= Bìnary operators Figure 1: Expressions in SpartanLang 2 YOUR ASSIGNMENT Create an interpreter for SpartanLang. You can assume that the parsing has been done for you - your job is to write an interpreter when given an abstract syntax tree (AST). Download interp.rkt from the course website and implement the evaluate function, as well as any additional functions it uses. The file test.rkt provides some additional testing cases (though not necessarily a comprehensive set of tests). The files parser.rkt and sl-run.rkt allow you to run on programs written in text files; test1.sparta is provided as an example. The input to evaluate consists of two arguments, an expression and the environment. The expression will be represented as a struct, which could be: • sp-val, representing some constant (such as 42 or true). 1. In this assignment, you will develop an interpreter for a small language, called SpartanLang. The valid expressions for SpartanLang are given in Figure 1. SpartanLang supports mutable references. The state of these references is maintained in an environment, a mapping of variables to values. With mutable references, other language constructs become more useful, such as sequencing operations (e1; e2). Expressions values e ::= assignment variable dereferencing (i.e. getting a variable's value) sequential expressions binary operations conditional expressions while expressions I := e !x e; e e op e if e then e else e end while e do e end v ::= Values integer values boolean values i b op ::= +|- | * | > | >= | < | <= Bìnary operators Figure 1: Expressions in SpartanLang 2 YOUR ASSIGNMENT Create an interpreter for SpartanLang. You can assume that the parsing has been done for you - your job is to write an interpreter when given an abstract syntax tree (AST). Download interp.rkt from the course website and implement the evaluate function, as well as any additional functions it uses. The file test.rkt provides some additional testing cases (though not necessarily a comprehensive set of tests). The files parser.rkt and sl-run.rkt allow you to run on programs written in text files; test1.sparta is provided as an example. The input to evaluate consists of two arguments, an expression and the environment. The expression will be represented as a struct, which could be: • sp-val, representing some constant (such as 42 or true).

Answer rating: 100% (QA)

kindly check the solutions below Working code implemented in C and appropriate comments provided for better understanding Here I am attaching code for all files maincpp parseRuncpp parseRunh valcpp va... View the full answer