CS453 Compiler Construction Instructor: Wim Bohm bohm@cs.colostate.edu Computer Science Building 470 TA: tba tba @cs.colostate.edu URL: http://www.cs.colostate.edu/~cs453 CS453 Lecture Introduction 1
Course Logistics (Highlights, see web page for more detail) Schedule Page and Home/News Read both of these daily. Lots of reading in the first couple of weeks. Resources Page Syllabus and Grading Professional Conduct Do your own work. Act like a professional in the lab. Participate Come to class and recitation. Ask questions and post answers on the RamCT discussion board. CS453 Lecture Introduction 2
Plan for Today Course Logistics (done) Interpreter and Compiler Structure, or Software Architecture A scanner/parser/interpreter for a simple expression language What is the difference between a compiler and an interpreter? Compilers class and reality – Why study compilers? Overview of Programming Assignments – The MeggyJava compiler we will be building. CS453 Lecture Introduction 3
Structure of a Typical Compiler Analysis Synthesis character stream lexical analysis IR code generation tokens “ words ” IR syntactic analysis optimization AST “ sentences ” IR semantic analysis code generation annotated AST target language interpreter CS453 Lecture Introduction 4
Expression Language: tokens Tokens: keyword(s): “ print ” operators/delimiters: “ + ” , ” - ” , “ * ” , “ ; ” integer literals: “ 0 ” , “ 1 ” , “ 2 ” ,…, ” 10 ” , “ 11 ” , … , “ 100 ” , … Symbols (Tokens+optional value) are formed by a scanner performing lexical analysis, while reading from a character stream eg: PRINT token+null, SEMI token+null, NUMBER token + Integer-value Valid tokens are defined by regular expressions, e.g.: NUMBER: [0-9]+ CS453 Lecture Introduction 5
Simple example: Expression Interpreter character stream (print 2+3*4; …) scanner lexical analysis tokens syntactic analysis parser plus plus interpreter calls to evaluate and print text (14, …) CS453 Lecture Introduction 6
Expression Language: sentences Sentences: Program sentences (statements here) are recognized by a parser. Valid programs are defined by a Grammar: Program::= stmts stmts::= stmts stmt | <empty> stmt::= PRINT exp SEMI exp::= exp + exp | exp – exp | exp * exp | NUMBER In our case, the parser evaluates the expressions and prints their values, i.e. the parser interprets the language In this week ’ s recitation you will be exercising with this language, and use tools to generate a scanner and a parser / interpreter CS453 Lecture Introduction 7
Why Compilers? CS453 Lecture Introduction 8
A LOT OF CONCEPTS, TOOLS, and CODE Compilers are large and complex software structures In this course you will learn a lot of concepts Regular and Context Free grammars, visitor pattern, architecture In this course you will use A LOT of tools Scanner generators and Parser Generators (recitation this week) Eclipse + version control Makefiles jar files assemblers (Meggy) hardware In this course you will write a lot of code 1000s of lines Don ’ t get behind! It will be hard, if not impossible, to catch up. CS453 Lecture Introduction 9
Example MeggyJava program MeggyJava: a Java subset for the Meggy toy we are playing with in this course. Example code: import meggy.Meggy; class PA3Flower { public static void main(String[] whatever){ { // Upper left petal, clockwise Meggy.setPixel( (byte)1, (byte)1, Meggy.Color.WHITE ); Meggy.setPixel( (byte)2, (byte)1, Meggy.Color.WHITE ); … … } } CS453 Lecture Introduction 10
Structure of the MeggyJava Compiler Analysis Synthesis character stream lexical analysis code gen tokens “ words ” Atmel assembly code syntactic analysis PA1: Write test cases in C++ and MeggyJava, and Atmel warmup AST “ sentences ” PA2: MeggyJava scanner and setPixel semantic analysis PA3: add exps and control flow (AST) PA4: add methods (symbol table) AST and symbol table PA5: add variables and objects CS453 Lecture Introduction 11
Before Next Time See schedule. Read all the pages of the website. Make sure you can ssh into CS linux machines. CS453 Lecture Introduction 12
Recommend
More recommend
