CS143: Section Handout + Code
Today we went over a few lex concepts as well as some of the theory backing the compiler including constructing a regular expression, converting it to an NDFA, then to a DFA, and then minimizing the number of states in the DFA. This process is very similar to what lex is doing behind the scenes with all those rules you've written for project 1!
The problems posed in the section handout are just for practice -- but feel free to ask us questions about them!
I've posted the code from the first bit of the section online (I apologize -- unfortunately it is not readable in the video). You can build the projects with 'make', and run the example code with 'cat input.txt | ./p1a' for example.
All the best,
~ David Underhill
- Announcements
- Schedule and Handouts
- Staff Info / Office Hours
- Email Archive
- Project FAQs
- Coding Guidelines
- Submission Instructions
- Lecture Videos