CSS Prepare

optional · CSS study notes

Lexical Analysis

  • Input buffering: reading source code efficiently in blocks to minimize I/O operations
  • Tokens: the smallest meaningful units (keywords, identifiers, operators, literals) recognized via regular expressions
  • Finite automata: the theoretical machines (DFA/NFA) used to recognize whether input strings match a token's regular-expression pattern — the lexer is essentially a finite automaton implementation