编译器原理 Compiler

Assignment 3 Due:  27 February at 11:59pm   Modify your parser from Assignment 2 to return an abstract syntax tree specified by  the following abstract syntax:   Program ∷= List<ParamDec> Block ParamDec ∷= type ident Block ∷= List<Dec>  List<Statement> Dec ∷= type ident Statement ∷= SleepStatement | WhileStatement | IfStatement | Chain | AssignmentStatement SleepStatement […]

Assignment 2 Due:  13 February at 11:59pm   Implement a recursive descent parser for the following context-free grammar:   program ::=  IDENT block program ::=  IDENT param_dec ( , param_dec )*   block paramDec ::= ( KW_URL | KW_FILE | KW_INTEGER | KW_BOOLEAN)   IDENT block ::= { ( dec | statement) * } dec ::= ( 

Assignment 1 Due:  30 Jan 2017 at 11:59pm   Implement a scanner for the programming language with the following lexical structure.   comment ::=   /*   NOT(*/)*  */ token ::= ident  | keyword | frame_op_keyword | filter_op_keyword | image_op_keyword | boolean_literal | int_literal  | separator  | operator ident ::= ident_start  ident_part*    (but not reserved) ident_start ::= 

Project Step 5 — Control Structures Due: November 1st This step builds on Step 4. Now that we are able to generate code for lists of statements, what happens if those lists of statements are embedded in control structures? (IF statements and FOR loops)? (Note: as in step 4, we will only have one function

Project Step 3 — Symbol Table Due: September 29th Your goal in this step is to process variable declarations and create Symbol Tables. A symbol table is a data structure that keeps information about non-keyword symbols that appear in source programs. Variables and function names are examples of such symbols. The symbols added to the

Project Step 2 — Parser Due: September 15th The second step of the project is building a parser. The job of a parser is to convert a stream of tokens (as identified by the scanner) into a parse tree: a representation of the structure of the program. So, for example, a parser will convert: A := B

Project Step 1 — Scanner Due: September 6th The first real step of the project is building the first phase of a compiler: the scanner (sometimes called a tokenizer). A scanner’s job is to convert a series of characters in an input file into a sequence of tokens — the “words” in the program. So, for example, the input

Project Step 0 — Test submission Due: August 25th Welcome to ECE 468 40% of your course grade in this class comes from your course project: you will be building an end-to-end compiler that takes programs written a simple language, translates them to assembly code that can run on a simulator, and performs some basic