Due: ?? 2/??/16, at midnight. Turn in using the submit command.

Write a scanner that recognizes the tokens of Ada 95.

Due: ?? 02/??/16.

Create an JFLEX scanner that recognizes the tokens of Ada 95 and any other required code (eg drivers). Post your solution on BitBucket.

Due: ?? 03/03/16.

Create an CUP parser that parses the tokens of Ada 95 and any other required code (eg drivers). You may ignore tasks and other advanced language features, but you need to keep a list of features that you omit. Post your solution on BitBucket.

This homework is based on the Exercises at the end of Chapter 5 of the text (starting at page 173):

• 5.1 - Justify your answers.
• 5.3 - Show your first and follow sets, etc.
• 5.4
• 5.4.Extra: Give a leftmost derivation of the expression in 5.4 and identify the correspondence between each step of your derivation and (the already matched part of the input string and the stack contents). After you have completed this question, collaborate with your classmate to see if you have identified the same correspondence and report the results in your assignment. If you do not agree, collaborate so that you both see the correspondence, and add that result to your solution.
• 5.5
• 5.7 [In other words, show that every FSM has an equivalent LL(1) grammar. To do this, you will have to show that if a string is accepted by a FSM, then then it's generated by the grammar, and vice versa.).
• 5.Extra: Find the non-ambiguous IF-THEN-ELSE grammar that uses matched statements (see your 380 text) and determine whether that grammar is LL(1). You may use any resources that you can find but do not discuss it with each other until you have arrived at a solution. Cite any references that you use.
• For the last 3 problems, you can work together, but write up your own solution.

This homework is from the Questions at the end of Chapter 5 of the text (pages 110-111):

• 1.a, 1.b, 3

Due: Monday 02/11/08, at the beginning of class. No late submissions accepted.

This homework is from the Questions at the end of Chapter 3 of the text (pages 46-47):

• 3.a, 3.b, 3.c, 3.d, 3,f
• Note: To define the grammar, you can simply list the productions and assume that the variables appear on the LHS of productions and that the variable on the LHS of the first production is the start symbol.