Finite machine description of a lexical analysis using table look-up

Authors

Dominic Soda, Lindenwood College
George W. Zobrist, Lindenwood University

Document Type

Conference Proceeding

Publication Title

ACM Conference on Computer Science

Abstract

A lexical analysis is described using a finite state machine to express the top level of the algorithm. The lexical analyzer exploits table lookup to facilitate the determination of tokens. The table lookup procedure alleviates the process of developing a complicated set of construction rules.

DOI

10.1145/75427.75467

Publication Date

1-1989

Recommended Citation

Soda, Dominic and Zobrist, George W., "Finite machine description of a lexical analysis using table look-up" (1989). Faculty Scholarship. 259.
https://digitalcommons.lindenwood.edu/faculty-research-papers/259