A finite machine description of a lexical analysis using table look-up

Authors:
D. Soda;G. W. Zobrist
Affiliations:
Department of Mathematics & Computer Science, Lindenwood College, St. Charles, MO;Department of Computer Science, University of Missouri-Rolla, Rolla, MO
Venue:
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Year:
1989

Citing 4
Cited 0

The cost of lexical analysis

Software—Practice & Experience
An overview of VHDL language and technology

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Automatic generation of efficient lexical processors using finite state techniques

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

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 conplicated set of construction rules.