About this document
Lexical Analysis and Finite Automata by dewsfef is a document available to read on EtoBox.
The document discusses scanners (lexical analyzers) in compiler construction. It introduces regular expressions and languages. Regular expressions are notations used to describe regular languages. Common operators for regular expressions include concatenation, Kleene star, option, and alternation. Regular expressions can be represented as finite state automata for implementation. The document provides examples of regular expressions and their corresponding finite automata.
- Author
- dewsfef
- Language
- EN