1. CS410 Homework By Dr. Lee

2. Chapter 1 Homework Due: 1/30/2013 Search the detail definition from Internet for the following computer terms: 1.Interpreter 2.Compiler 3.Phases of a compiler 4.Regular Expressions 5.Lexical Analyzer 6.Context-free Grammars 7.Parser 8.Semantic Analyzer 9.Type Checker 10. Code Generator 11. Assembler 12. Linker 13. Loader Site your sources from Internet.

3. Chapter 2 Homework Due: 2/11/2013 Part A: Design a DFA for a chewing gum vending machine if each pack of chewing gum is 25 cents and the machine accepts only nickels, dimes and quarters. Note, there is no change for the machine. For example, if the customer drops into 30 cents, one pack of chewing gum will come out without changes. Part B: Do the following Exercises in Chapter 2: 1. (a), (c), (e), (g) 2. (a), (b), (c) 3. (a), (b), (c) 4. Give a DFA for each of the languages in question 1 (a), (c), (e), (g)

4. Chapter 3 Homework Due: 2/25/2013 Pages: 46-47 Do the following exercises: 1 (a,c,e), 2(a), 3(a,c)

5. Chapter 4 Homework Due: 3/4/2013 Do the following exercises on pp79-81: 1(a), 2(a), 3(a), 5. Exercise 9: Using the following example to prove that removing the left recursion from the original rules is correct. Example: T+T+T-T+T-T Before removing left recursion (original rules) E  E+E | E-E | T After removing left recursion E  TE’ E’  +TE’ | -TE’ | ε (Hint: Derive the example from the rules before and after removing left recursion respectively. If they are same then the new set of rules are correct. Show your conclusion.)

6. Chapters 6 & 7 Homework Due: 3/20/2013 Do the following exercises: Page 155: 1(a) & 1(b) Page 193: 5 (You may search for complete answers from Internet, explain your answer and show examples)

7. Chapters 8 Homework Due: 4/10/2013 Pages: 222-223 Do exercises: 1, 2 (from a to i).

8. Chapters 9 Homework Due: 4/22/2013 Pages: 254 Do exercises: 1, 3.

9. Chapter 10 Homework Due: 5/1/2013 Page: 279 Do Exercises: 1, 2, 4.