This is the authors' abstract. We don't add key points for this paper.
The problem of processing and interpreting character-strings in a systematic, efficiently implementable manner has given rise to a variety of decision- (or transition-) table and transition-diagram techniques. These have been used in the design and/or coding of string-oriented processors, such as lexical analysis portions of compilers. All these techniques share in common the idea of an input driven transition control.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Oliver et al. (1976) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: