You are allowed to use non-x (or #x, or ) to denote any character diferent from x x can also be a set of characters. Keyword → this throw | throws | try Each keyword will be identified in a separate accepting state, which is different from any state recognizing identifiers. Assume that the identifiers and keywords are defined as follows: identifier letter digit (- | letter)(- | letter | digit)* → a | b |. This question addresses the size of this DFA. Transcribed image text: (20pt) Keywords fit the definition of identifiers and scanners identify them as such, and then look them up a table of keywords, because otherwise the deterministic finite automaton is unnecessarily larger.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |