**_The questions are NOW provided in FULL in the attachment.
These problems are in the popular textbook: Concepts of Programming Languages, sixth edition, Robert W. Sebesta, Addison-Wesley, 2003, ISBN 0-321-19362-8.
A. **Problem 1 from chapter 4 on page 186 of the Sebesta text**. Reference the LL grammar description on pages 173-176 of the text and the course notes from lectures 2 and 3 on LL grammars.
B. Transform the above grammar so that it is an LL (1) grammar
C. **Use the LL (1) grammar you develop in part B to code, debug, and test a C++ recursive-descent parser for the language generated by the grammar**. Submit a source listing for your parser and an IBM compatible floppy disk containing the C++ source code for the recursive-descent parser. Include testcase executions for both legal sentences generated from the grammar definition and sentences, which contain syntax errors.
2. Problem 8 from chapter 5 (parts a and b) on pages 226-227 of the Sebesta text.
**3. ** **Problem 10 from chapter 5 on page 228 of the Sebesta text.** Make a table for each program unit. The table should show the variables, which are visible in the program unit and the program unit in which the variable was declared.
**4. ** **Problem 9 from chapter 6 on page 288 of the Sebesta text.**
**5. ** **Problem 14 from chapter 6 on page 288 of the Sebesta text.**
**6. ** **Problem 9 from chapter 7 on page 315-316 of the Sebesta text.**
**7. ** **Problem 11 from chapter 7 on page 316 of the Sebesta text.**
**8. ** **Programming exercise 1 (part C) from chapter 8 on page 350 of the Sebesta text.**
**9. ** **Problem 5 from chapter 9 on page 395 of the Sebesta text.**
**10. ** **Problem 2 from chapter 10 on page 424-425 of the Sebesta text.**
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Very brief explaination if work.