Make-Up Test Wednesday in CFLAT
Things you should know for the make-up test:
- Phases of compilation
- Symbol table
-Compute the first and follow sets of a grammar.
- Given first and follow sets, construct a LL(1) table. 
- Given a LL(1) table, trace an input using the table. 
- Given a grammar, outline the recursive descent parser for the grammar.  If the grammar is not in the right form for recursive descent parser, fix it. 
- Given a problem, write a lex and a yacc file to parse the input. 
- Grammar modifications
   - Remove lambda, remove unit, remove left recursion
 

For the final project, if you pick the option of writing a cheat detector for CST116 labs.  You'll need to:
1)  Get 5 actual labs from Todd or Randy
2)  Read and Parse those .cpp files (You might need to add some rules to your grammar to include C++ statements)

3)  Compute metrics on those programs.  You must compute the following metrics:
  Total  Number lines of code
-  Total  Number of program tokens
-   Total Number of statements
-  Number of each type of statemenst (if,while, assignment, etc.)
-  Number of operators 
-  Number of function calls
-  Number of functions
-  Highest nesting level
-  Total number of identifiers
-  Average identifier length
-  Longest identifier length
-  Longest function length
-  Percentage of comment lines - percent of source lines containing comments
-  Number of parameters per function
-  Number of types used
- Average function length
-  Number of directly recursive calls

-  Recursive Descent Example

-  LL1 Follow Set construction example (in class 2/11/09)
 

• Gradebook
• Official Documentation Standard
• Academic Integrity Policy

Reading:  Chapters 1, 2, & 8

Lab #1:  Due Monday, Jan. 19 (Lexical Analyzer and Preprocessor)
Lab#1 Check-Off List

HW#1:  Due Monday, Jan. 12

Reading:  Chapter 3

Notes:  Grammar Transformations
Notes:  Top-Down Parsers

HW#2:  Due Friday, Jan. 16

HW#3: Due Monday, Jan. 26

C Minus Grammar Example

Some Slides on STL Map
A sample LL(1) header file

 Lab# 2 (Due Wednesday, Feb. 4)
Lab#2 Check-Off List

No Class on Wednesday or Friday

No Lab this week

Reading:  Chapter 4

Lecture:  Lex and Yacc
Lecture:  Lex and Yacc2

NEW Lex/Yacc Files for C++

• VS 2005 Template
• VS2008 Template
• Small Lex/Yacc Example
• MiniC Lex/Yacc Example
• Expressions Example
• Parse Tree Example
• MiniPascalExample

NEW README for Pargen/Lab4 stuff

Misc. Lex/Yacc Files (mostly written in C)

• Sample LEX files:
• test1.l
• wordCount.l
• Sample YACC files
• MiniC Lex
• MiniC Yacc
• SymbolTable Example
• ParseTree Example
• Mini Pascal Example

HW#4: Due Friday, Feb. 13th

Lab# 3 (Due Wednesday, Feb. 18th)
Lab#3 Check-Off List

Lab #4:  (Due Monday, Mar. 2nd )
Please include input and output files with your lab submission. 

Test#2 Friday, March 6th

Project: DUE on Monday, Mar. 16th. (No Late Projects accepted).  Project check-off on Monday, 1-4pm

Project Check-Off List

Make-up Test on Wednesday, March 11th (in CFLAT)