Tocken 단위로 나눔 Regular Expressions ↓ Lexer Generator ↓ Source → Lexer (Finite Automata) → Streams of Tokens Finite automata (FSM: Finite State Machine) state 갯수가 finite start state는 한개 Regular Expressions Base Cases: - Symbol - Epsilon: empty string Induction Cases - Alternation(M|N) - Concatenation(MN) - Repetition(M*) => including zero How lexer generator make Lexer from REs? 1. change REs to f..