Automatic generation of efficient lexical processors using finite state techniques
From MaRDI portal
Publication:5551918
DOI10.1145/364175.364185zbMath0165.52003OpenAlexW2007130296WikidataQ56060441 ScholiaQ56060441MaRDI QIDQ5551918
W. L. Johnson, Douglas T. Ross, J. H. Porter, S. I. Ackley
Publication date: 1968
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/364175.364185
Related Items (4)
On the look-ahead problem in lexical analysis ⋮ From bidirectionality to alternation. ⋮ The complexity of restricted regular expressions and the synthesis problem for finite automata ⋮ A VLSI design for the parallel finite state automaton and its performance evaluation as a hardware scanner
This page was built for publication: Automatic generation of efficient lexical processors using finite state techniques
