Unformatted text preview: Thompson's Algorithm (converting a Regex into a NFA) Eliminating left-recursion Left factoring Writing a recursive descent parser Nullable, FIRST and FOLLOW sets Constructing and using LL(1) parse tables C. Structure of a flex file. How patterns and actions are presented in flex. D. Problems selected from (possibly modified): (some of the problems are solved in http://www.diku.dk/hjemmesider/ansatte/torbenm/Basics/solutions.pdf ) Exercise 2.2 a Exercise 2.3 a Exercise 2.7 Exercise 2.9 a,b Exercise 3.1 Exercise 3.2 Exercise 3.3 Exercise 3.4 Exercise 3.5 Exercise 3.6 Exercise 3.9 Exercise 3.10 Exercise 3.11 Exercise 3.14 (in addition show parsing of a sample string)...
View Full Document
This document was uploaded on 12/14/2010.
- Fall '09