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.
|Title of host publication||Proceedings of the 2003 annual research conference of the South African Institute of Computer Scientists and Information Technologists on Enablement through Technology (SAICSIT, Fourways, South Africa, September 17-19, 2003)|
|Editors||J. Eloff, xx et al.|
|Place of Publication||New York|
|Publisher||Association for Computing Machinery, Inc|
|Publication status||Published - 2003|
|Name||ACM International Conference Proceeding Series|
Ngassam, E. K., Watson, B. W., & Kourie, D. G. (2003). Hardcoding finite state automata processing. In J. Eloff, & X. et al. (Eds.), Proceedings of the 2003 annual research conference of the South African Institute of Computer Scientists and Information Technologists on Enablement through Technology (SAICSIT, Fourways, South Africa, September 17-19, 2003) (pp. 111-121). (ACM International Conference Proceeding Series; Vol. 47). Association for Computing Machinery, Inc.