COMPILER CONSTRUCTION Principles and practice Kenneth C. Louden
COMPILER CONSTRUCTION Principles and Practice Kenneth C. Louden
2. Scanning Lexical Analysis) PART TWO
2. Scanning (Lexical Analysis) PART TWO
Contents PART ONE 2. 1 The Scanning Process 2.2 Regular Expression 2.3 Finite automata PART TWO 2. 4 From Regular expressions to dFas Open 2.5 Implementation of a TINY Scanner Open 2.6 Use of Lex to Generate a Scanner Automatically Openl
Contents PART ONE 2.1 The Scanning Process 2.2 Regular Expression 2.3 Finite Automata PART TWO 2.4 From Regular Expressions to DFAs [Open] 2.5 Implementation of a TINY Scanner [Open] 2.6 Use of Lex to Generate a Scanner Automatically [Open]
2. 4 From Regular expression To DFAS
2.4 From Regular Expression To DFAs
Main purpose Study an algorithm Translating a regular expression into a dfa via NFA Regular NFA DFA Program Expression
Main Purpose • Study an algorithm: – Translating a regular expression into a DFA via NFA. Regular Expression NFA DFA Program