About this document
Lexical Analysis Overview and Concepts by Sudhakar Kumawat is a document available to read on EtoBox.
The document discusses lexical analysis in compiler design. It describes the role of the lexical analyzer in breaking the source code into tokens. Regular expressions are used to specify patterns for tokens, which are then implemented as finite state automata. Nondeterministic finite automata (NFAs) recognize these patterns more simply than deterministic finite automata (DFAs), but DFAs are more efficient for implementation. The document explains how NFAs corresponding to regular expressions can be converte
- Author
- Sudhakar Kumawat
- Language
- EN