Automatic generation of efficient lexical processors using finite state techniques

DOI10.1145/364175.364185MaRDI QIDQ5551918zbMATH OpenOpenAlexDBLPWikidataFDO

Authors W. Johnson, J. H. Porter, S. I. Ackley, Douglas T. Ross

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

zbMATH Keywords

numerical analysis

Cited in

(4)

• The complexity of restricted regular expressions and the synthesis problem for finite automata
• From bidirectionality to alternation.
• On the look-ahead problem in lexical analysis
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5551918)