| April 9 |
Part 3 of the compiler project has been assigned. |
| March 30 |
The due date for Project 2b has been extended to April 5, 2012. |
| March 19 |
Welcome back after the break!
I provided additional hints on implementing project 2b. |
| March 1 |
Start working on Part 2b of the compiler project. Examples of Syntax-Directed Definitions in Yacc are available on odin in my directory ~kochut/csx570/semant. |
| Feb 14 |
Continue working on your syntactic analyzers. Eliminate all reduce/reduce and shift/reduce conflicts (with the possible exception of the one due to the "dangling-else" problem). Bison manual has additional information on shift/reduce and reduce/reduce conflicts. As an exercise, create an SLR parsing table for the grammar given in the Ex. 4.6.9 on p. 259. |
| Feb 13 |
Review the algorithms for FIRST and FOLLOW (p. 220 in your text). Also, review sections 4.5 and 4.6 on bottom-up parsing and the SLR parsing table construction. |
| Feb 2 |
Part 2 of
the compiler project has been
assigned. Part A is due on February 29, 2012. Additional examples are in directory /home/profs/kochut/csx570/parser on odin. |
| Feb 1 |
Review the context-free languages (CFL), context-free grammars (CFG), derivations, leftmost- and rightmost-derivations, derivation trees, yields, and theorem of the equivalence of a derivation and a yield (sections 4.1 and 4.2 in your texts). |
| Jan 25 |
Please read section 3.9.5 in your textbooks on the direct conversion of a regular expression into an equivalent DFA. |
| Jan 18 |
Amir Abdolrashidi will be the TA for this course. The compiler project has been assigned. Part 1 is due on January 31, 2012. Additional examples are in directory /home/profs/kochut/csx570/lex-examples on nike.cs.uga.edu. |
| Jan 17 |
Please, review regular expressions, NFAs, and DFAs (sections 3.3, 3.4, and 3.6). |
| Jan 16 |
We have started lexical analysis. You should start reading Chapter 3, especially sections 3.1 and 3.2. |
| Jan 16 |
Please read Chapter 1 and optionally Chapter 2 in your text. Experiment with gcc to understand how a typical language processor works. |
Jan 10 |
Welcome! Classes will begin on 1/10/2012. I hope you will have a great time and
learn a lot! |