Do Question 2

2. [20 points] Create the state table and action table for the lexical analyzer in question 1. In the table below, write the new state, a slash and the action to take at this transition. Use state zero to represent a terminal failing state. The available actions are: O do nothing 1 Create a token containing the input symbol. 2 Add the input symbol to the end of the current token string. Write the input symbols (or groups of symbols) in the left column. input symbol state 1 state 2 state 3 state 4 state 5 letter space other There may or may not be more columns and rows than necessary. Consider a language similar to markup languages. Text is annotated by tags that are in the form text/ The label and following words are composed of letters. There is always a label with zero to many words following. Note that the end of the text impacted by the tag is indicated by a single slash (no ). The scanner must create tokens for the punctuation brackets and slash. A token should be created holding each label or word. Spaces inside the brackets should be ignored. Tokens must be created for the text. The text tokens can contain any characters, including spaces, except for and /. Valid string of the language: Start with text. The scanner makes a list of tokens./ No syntax checking./ The tokens should be: Start with text. important stuff The scanner makes a list of bold tokens. No syntax checking. Invalid strings: This string This string has a missing slash/ from HTML. The slash is not inside brackets. 1. [25 points) Draw circle and arrow graph showing a deterministic Finite State Automata (FSA) for a scanner that creates tokens for the markup language. Transitions between states are based on individual characters. This should be a Mealy machine that takes actions at the state transitions. Number the states from 1 to as large as needed. 2. [20 points] Create the state table and action table for the lexical analyzer in question 1. In the table below, write the new state, a slash and the action to take at this transition. Use state zero to represent a terminal failing state. The available actions are: O do nothing 1 Create a token containing the input symbol. 2 Add the input symbol to the end of the current token string. Write the input symbols (or groups of symbols) in the left column. input symbol state 1 state 2 state 3 state 4 state 5 letter space other There may or may not be more columns and rows than necessary. Consider a language similar to markup languages. Text is annotated by tags that are in the form text/ The label and following words are composed of letters. There is always a label with zero to many words following. Note that the end of the text impacted by the tag is indicated by a single slash (no ). The scanner must create tokens for the punctuation brackets and slash. A token should be created holding each label or word. Spaces inside the brackets should be ignored. Tokens must be created for the text. The text tokens can contain any characters, including spaces, except for and /. Valid string of the language: Start with text. The scanner makes a list of tokens./ No syntax checking./ The tokens should be: Start with text. important stuff The scanner makes a list of bold tokens. No syntax checking. Invalid strings: This string This string has a missing slash/ from HTML. The slash is not inside brackets. 1. [25 points) Draw circle and arrow graph showing a deterministic Finite State Automata (FSA) for a scanner that creates tokens for the markup language. Transitions between states are based on individual characters. This should be a Mealy machine that takes actions at the state transitions. Number the states from 1 to as large as needed