⇤ ← Revision 1 as of 2014-01-22 01:13:32
4350
Comment:
|
4351
|
Deletions are marked like this. | Additions are marked like this. |
Line 5: | Line 5: |
<<Anchor(textbook)>>Charles N. Fisher, Ron K. Cytron, Richard J. LeBlanc, Jr, ''Crafting a Compiler'', Addison-Wesley, 1^ed^, [[http://www.addall.com/New/submitNew.cgi?query=978-0-13-606705-4+&type=ISBN|ISBN-13: 978-0-13-606705-4]] | <<Anchor(textbook)>>Charles N. Fisher, Ron K. Cytron, Richard J. !LeBlanc, Jr, ''Crafting a Compiler'', Addison-Wesley, 1^ed^, [[http://www.addall.com/New/submitNew.cgi?query=978-0-13-606705-4+&type=ISBN|ISBN-13: 978-0-13-606705-4]] |
Textbook
Charles N. Fisher, Ron K. Cytron, Richard J. LeBlanc, Jr, Crafting a Compiler, Addison-Wesley, 1ed, ISBN-13: 978-0-13-606705-4
Course Description
CSCI498 --- COMPILER DESIGN: An introductory course to the design and construction of compilers. Topics include scanning (lexical analysis), context free grammars, recursive descent (top-down) parsing, LR (bottom up) parsing, syntax directed translation, syntax trees, expression trees, parse trees, intermediate representation, register allocation and target code generation. Students will construct their own tool chain for compiling a simple language, tracking the relevant course topics as they are covered.
Computer Organization (CSCI341), Software Engineering (CSCI306) and Intro to Linux (CSCI274).
Learning Goals
The objectives of this course are to introduce students to theory and tools behind language compilers. Upon successful completion of this course, the student will have practiced and improved their coding, code review, communication and collaboration skills; and be knowledgeable of:
- The steps taken by most compilers to translate a program listing to either another language or target code for a machine.
The theory of lexical analysis, regular expressions, deterministic finite automata (DFAs), non-deterministic finite automata (NFAs), and how to use scanner generators (eg flex).
- The fundamental principles of context free grammars as well as their associated attributes and properties.
- Constructs for expressing operator precedence and associativity in context free grammars, as well as how language ambiguities are detected and worked around by modern compiler tools.
- The theory and implementation of top-down and bottom up parsing, the generation of parse trees, and their translation to abstract syntax trees (ASTs).
- The evaluation of program statements at the CPU op-code and register level.
Learning Methods
This course is taught in two pedagogical styles:
- The first portion of the course (approximately 3-4 weeks) will be taught in a traditional lecture format taking the opportunity to use ad-hoc partner or group work when appropriate.
- The balance of the semester will use formal learning groups of 4--5 students each. Students will solve problems in compiler design and implementation during formal lecture period, and work outside of lecture on the development of a compiler.
- Students should attend lecture having completed the current reading (research) assignment.
Student Evaluation
Students should familiarize themelves with the collaboration policy for graded work.
Grade Component |
Course Grade Weight |
Notes |
Participation |
5% |
Instructor and peer evaluation |
Individual Quiz and Assignment scores |
10% |
From "part one" of the course |
Group Quizzes and Assignment score |
10% |
From "part two" of the course |
Final Exam |
25% |
The final exam must be passed (60% or more) |
Group Project scores |
50% |
Contingent on acceptable participation scores. |
Weights
Quizzes and assignment scores may we worth different numbers of points, but their percentile grades are all weighted the same when calculating their contribution to your course grade.
Group Quizzes and "Assignments"
- Groups earn the median score of the members' individual quiz grades.
- Group "assignments" will result in one grade for the entire group.
Details
Students and student groups have one week to review and contest graded work. Contact the instructor via Email with any assignment grading concerns.
- Assignments may not be re-submitted after they have been graded, even if the re-submission is before the assignment deadline.
Late Policy: 10% off for first 24 hours, 15% off for second 24 hours, 40% of for the third 24 hours (3 days late). Assignments posted 4 days or more after the due date are not graded. Weekends count as late days.
Institutional Support
Those students who qualify for disability accommodations must request Student Disability Services deliver each professor a Confidential Letter of Required Accommodations to ensure accommodations are met. More information is at this link.
The Writing Center, located in Stratton 306, is here to help all members of the Mines community with writing projects at any stage of the writing process. Writing Consultants will help you understand an assignment; brainstorm, develop and organize ideas; cite sources; narrow your focus; and/or fine-tune your writing for polish, clarity, adherence to grammatical conventions, etc. You are welcome to bring in your scholarship letters, application letters, theses, dissertations, academic journal articles, resumes, cover letters, research papers, summaries, abstracts, NHV essays, EPICS writing assignments, and personal writing projects with which you would like help. To make an appointment, please visit our online scheduling system at: http://mines.mywconline.com. Questions can be directed to Shira Richman, Writing Center Director, at: srichman@mines.edu or 303-273-3484. We look forward to working with you.