chapter3-finite_automata_NFA_to_DFA.pptVIP

◎2005 ECNU SEI Compilers: Principles, Techniques, and Tools lec01-lexicalanalyzer 3.4 Token Recognition (P.98) What Else Does Lexical Analyzer Do? (P.99) Constructing Transition Diagrams for Tokens (P.99) Example TDs (P.100) Example 3.7: All RELOPs (P.101) Example 3.8, 3.10 : id and delim (P.101) When a token is recognized, one of the following must be done: If keywords: return 0 If ID in symbol table: return entry of symbol table If ID not in symbol table: install id and return the new entry of symbol table Placing keywords in the symbol table is almost essential and is coded by hand, or placing keywords in other table called keywords/reserved-words table. Example 3.9 : Unsigned #s (P.102) QUESTION : Answer What Else Does Lexical Analyzer Do? (P.102) Implementing Transition Diagrams (P.104) When Failures Occur: (P.105) 3.6 Finite Automata (P.113) A recognizer for a language is a program that takes a string x, and answers “yes” if x is a sentence of that language, and “no” otherwise. We call the recognizer of the tokens as a finite automaton. A finite automaton can be: deterministic(DFA) or non-deterministic (NFA) This means that we may use a deterministic or non-deterministic automaton as a lexical analyzer. Finite Automata (cont.) Finite Automata (cont.) Both deterministic and non-deterministic finite automaton recognize regular sets. Which one? deterministic – faster recognizer, but it may take more space non-deterministic – slower, but it may take less space Deterministic automatons are widely used lexical analyzers. First, we define regular expressions for tokens; Then we convert them into a DFA to get a lexical analyzer for our tokens. Algorithm1: Regular Expression ? NFA ? DFA (two steps: first to NFA, then to DFA) Algorithm2: Regular Expression ? DFA (directly convert a regular expression into a DFA) NFAs DFAs A strong relationship between finite automata and regular expression Transition: record a change from one state to another upon a match o