How (not) to code a finite state machine

Authors:
D. W. Jones
Affiliations:
Univ. of Iowa, Iowa City
Venue:
ACM SIGPLAN Notices
Year:
1988

Citing 7
Cited 0

Compiler construction: theory and practice (2nd ed.)

Compiler construction: theory and practice (2nd ed.)
Standard Pascal: User Reference Manual

Standard Pascal: User Reference Manual
Algorithms + Data Structures = Programs

Algorithms + Data Structures = Programs
Compiler Construction

Compiler Construction
Theory and Practice of Compiler Writing

Theory and Practice of Compiler Writing
Compiler Construction for Digital Computers

Compiler Construction for Digital Computers
Compilers: Principles, Techniques, and Tools (2nd Edition)

Compilers: Principles, Techniques, and Tools (2nd Edition)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The standard advice for those coding a finite state machine is to use a while loop, a case statement, and a state variable. This is usually bad advice! The reasons for this are explored here, and better advice is formulated.