Create a programming language than can be interpreted in SML.

The project will be broken down into 4 phases, each with an associated milestone. The first phase concerns itself with defining the syntax of the language and can be accomplished by developing a context-free grammar for the language as well as a specification of the tokens that are used by that grammar. In the second phase, you will be asked to provide a description of the semantics of your language. An organized way to do this is to first define a model of computation (an abstract computer) and to then describe in general terms what it means to \execute" each construct in your language. In the third phase, you will construct a HATS domain for your language and define a type-checker for your language. The domain you construct will allow you to parse programs in your language, check for the presence of ambiguously defined constructs, view the parse tree corresponding to programs, and output the parse tree to a file. How this can be accomplished will be discussed in class (it is not covered in the text). In this phase are also required to (1) construct a small program in your language, and (2) using concepts and notations discussed in the text as well as in class, describe how your program gets executed. In the fourth phase, you will be asked to write a denotational-semantic based interpreter for your language. This interpreter must be written in ML.