4. [10 points) Draw a Finite State Automaton to recognize the above strings. 5. [10 points] Draw a DFA to recognize Words of upper and lower case letters separated by spaces, periods or commas. and Quote strings starting and ending with a quote including anything Examples: This is a "good example" ABC"d e!" Computer Science Incorrect examples: unbalanced "quote 6. [15 points) Write a state transition table to implement the DFA of question 5. Show the actions a Mealy machine should take at the transitions to save the words and quote strings as individual tokens. 7. [10 points] Draw a DFA to recognize A single question mark, ?, defines a comment to the end of the line Double question marks, ??, define a comment that ends with another pair of question marks 8. [10 points) Merge the two above DFA (Q5 & 07) to recognize words, quote strings and comments. 9. [15 points Write a state transition table to implement the DFA of question 8. Show the actions a Mealy machine should take at the transitions to save the words and quote strings as individual tokens. Comments should be discarded. with OX and can contain the digits 0 to 9 and the letters A to F. Octal constants start with zero and can only contain the digits 0 to 7. [10 points) Draw a Finite State Automaton to recognize C++ integer constants. Write a regular expression that defines a string that starts with an "A", ends with a different "A" and has an even number (zero is an even number) of B's in the middle mixed up with any number of additional A's. For example: ABBA or ABABBABA or ABBBBABBA or AA [10 points) Draw a Finite State Automaton to recognize the above strings. . [10 points] Draw a DFA to recognize Words of upper and lower case letters separated by spaces, periods or commas. and Quote strings starting and ending with a quote including anything. Examples: This is a "good example" ABC"d e!" Computer Science Incorrect examples: unbalanced "quote . [15 points) Write a state transition table to implement the DFA of question 5. Show the actions a Mealy machine should take at the transitions to save the words and quote strings as individual tokens. [10 points] Draw a DFA to recognize A single question mark, ?, defines a comment to the end of the line Double question marks, ??, define a comment that ends with another pair of question marks [10 points] Merge the two above DFA (Q5 & Q7) to recognize words, quote strings and comments. 115 points) Write a state transition table to implement the DFA of question 8. Show the actions a Mealy machine should take at the transitions to save the words and quote strings as individual tokens. Comments should be discarded. 4. [10 points] Draw a Finite State Automaton to recognize the above strings. 5. [10 points) Draw a DFA to recognize Words of upper and lower case letters separated by spaces, periods or commas. and Quote strings starting and ending with a quote including anything. Examples: This is a "good example" ABC"d e!" Computer Science Incorrect examples: unbalanced "quote 6. [15 points) Write a state transition table to implement the DFA of question 5. Show the actions a Mealy machine should take at the transitions to save the words and quote strings as individual tokens. 7. [10 points] Draw a DFA to recognize A single question mark, ?, defines a comment to the end of the line Double question marks, ??, define a comment that ends with another pair of question marks 6. [15 points) Write a state transition table to implement the DFA of question 5. Show the actions a Mealy machine should take at the transitions to save the words and quote strings as individual tokens. 7. [10 points) Draw a DFA to recognize A single question mark, ?, defines a comment to the end of the line Double question marks, ??, define a comment that ends with another pair of question marks 8. [10 points) Merge the two above DFA (Q5 & Q7) to recognize words, quote strings and comments. 4. [10 points) Draw a Finite State Automaton to recognize the above strings. 5. [10 points] Draw a DFA to recognize Words of upper and lower case letters separated by spaces, periods or commas. and Quote strings starting and ending with a quote including anything Examples: This is a "good example" ABC"d e!" Computer Science Incorrect examples: unbalanced "quote 6. [15 points) Write a state transition table to implement the DFA of question 5. Show the actions a Mealy machine should take at the transitions to save the words and quote strings as individual tokens. 7. [10 points] Draw a DFA to recognize A single question mark, ?, defines a comment to the end of the line Double question marks, ??, define a comment that ends with another pair of question marks 8. [10 points) Merge the two above DFA (Q5 & 07) to recognize words, quote strings and comments. 9. [15 points Write a state transition table to implement the DFA of question 8. Show the actions a Mealy machine should take at the transitions to save the words and quote strings as individual tokens. Comments should be discarded. with OX and can contain the digits 0 to 9 and the letters A to F. Octal constants start with zero and can only contain the digits 0 to 7. [10 points) Draw a Finite State Automaton to recognize C++ integer constants. Write a regular expression that defines a string that starts with an "A", ends with a different "A" and has an even number (zero is an even number) of B's in the middle mixed up with any number of additional A's. For example: ABBA or ABABBABA or ABBBBABBA or AA [10 points) Draw a Finite State Automaton to recognize the above strings. . [10 points] Draw a DFA to recognize Words of upper and lower case letters separated by spaces, periods or commas. and Quote strings starting and ending with a quote including anything. Examples: This is a "good example" ABC"d e!" Computer Science Incorrect examples: unbalanced "quote . [15 points) Write a state transition table to implement the DFA of question 5. Show the actions a Mealy machine should take at the transitions to save the words and quote strings as individual tokens. [10 points] Draw a DFA to recognize A single question mark, ?, defines a comment to the end of the line Double question marks, ??, define a comment that ends with another pair of question marks [10 points] Merge the two above DFA (Q5 & Q7) to recognize words, quote strings and comments. 115 points) Write a state transition table to implement the DFA of question 8. Show the actions a Mealy machine should take at the transitions to save the words and quote strings as individual tokens. Comments should be discarded. 4. [10 points] Draw a Finite State Automaton to recognize the above strings. 5. [10 points) Draw a DFA to recognize Words of upper and lower case letters separated by spaces, periods or commas. and Quote strings starting and ending with a quote including anything. Examples: This is a "good example" ABC"d e!" Computer Science Incorrect examples: unbalanced "quote 6. [15 points) Write a state transition table to implement the DFA of question 5. Show the actions a Mealy machine should take at the transitions to save the words and quote strings as individual tokens. 7. [10 points] Draw a DFA to recognize A single question mark, ?, defines a comment to the end of the line Double question marks, ??, define a comment that ends with another pair of question marks 6. [15 points) Write a state transition table to implement the DFA of question 5. Show the actions a Mealy machine should take at the transitions to save the words and quote strings as individual tokens. 7. [10 points) Draw a DFA to recognize A single question mark, ?, defines a comment to the end of the line Double question marks, ??, define a comment that ends with another pair of question marks 8. [10 points) Merge the two above DFA (Q5 & Q7) to recognize words, quote strings and comments