Hardcoding finite state automata processing

Authors:
E. Ketcha Ngassam;Bruce W. Watson;Derrick G. Kourie
Affiliations:
FASTAR Research Group, Department of Computer Science, University of Pretoria, Pretoria 0002, South Africa;Department of Computer Science, University of Pretoria, Pretoria 0002, South Africa;Department of Computer Science, University of Pretoria, Pretoria 0002, South Africa
Venue:
SAICSIT '03 Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
Year:
2003

Citing 7
Cited 3

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Very fast LR parsing

SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Even faster LR parsing

Software—Practice & Experience
Hard-coding bottom-up code generation tables to save time and space

Software—Practice & Experience
Numerical recipes in C (2nd ed.): the art of scientific computing

Numerical recipes in C (2nd ed.): the art of scientific computing
The Software Optimization Cookbook

The Software Optimization Cookbook
Preliminary experiments in hardcoding finite automata

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata

Performance of hardcoded finite automata

Software—Practice & Experience - Research Articles
FIRE station: an environment for manipulating finite automata and regular expression views

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Deep packet inspection tools and techniques in commodity platforms: Challenges and trends

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

To hardcode and algorithm means to build into it the data that it requires. In this paper, we present various experiments in hardcoding the transition table of a finite state machine directly into string-recognizing code. Experiments are carried out in two phases. The first phase is limited to the analysis of the hardcoded behavior in relation to acceptance or rejection of a single symbol in some arbitrary state of some finite automaton. Then follows a simulation of the analysis of some hardcoded solution for recognizing an entire string. Measurements are provided to show the time efficiency gains by various hardcoded versions over the traditional table-driven approach.