About this document
Lexical Analyzer in Compiler Design by Abhijit Karan is a document available to read on EtoBox.
This document discusses lexical analysis in compilers. It covers: 1) The lexical analyzer reads the source program character by character and produces tokens without returning all tokens at once. It returns a token when requested by the parser. 2) Tokens represent patterns of strings defined by regular expressions. They have a type and attribute to uniquely identify lexemes. 3) Finite automata like DFAs and NFAs are used to recognize tokens as they can recognize regular languages defined by regular exp
- Author
- Abhijit Karan
- Language
- EN