Automatic generation of efficient lexical processors using finite state techniques

@article{Johnson1968AutomaticGO,
  title={Automatic generation of efficient lexical processors using finite state techniques},
  author={W. L. Johnson and J. H. Porter and Stephanie I. Ackley and D. T. Ross},
  journal={Commun. ACM},
  year={1968},
  volume={11},
  pages={805-813}
}
  • W. L. Johnson, J. H. Porter, +1 author D. T. Ross
  • Published 1968
  • Computer Science
  • Commun. ACM
  • The practical application of the theory of finite-state automata to automatically generate lexical processors is dealt with in this tutorial article by the use of the AED RWORD system, developed at M.I.T. as part of the AED-1 system. This system accepts as input descriptions of the multicharacter items or of words allowable in a language given in terms of a subset of regular expressions. The output of the system is a lexical processor which reads a string of characters and combines them into… CONTINUE READING
    55 Citations
    Constructing a finite automaton for a given regular expression
    • 14
    Design of a microprogrammed lexical microprocessor
    • Y. Chu
    • Computer Science
    • MICRO 8
    • 1975
    • 3
    A Language Independent Scanner Generator
    • 10
    • PDF
    On the look-ahead problem in lexical analysis
    • W. Yang
    • Computer Science
    • Acta Informatica
    • 2005
    • 4
    A VLSI design for the parallel finite state automaton and its performance evaluation as a hardware scanner
    • A. Hurson
    • Computer Science
    • International Journal of Computer & Information Sciences
    • 2004
    • 3
    A Portable Syntax Analyzer for Microcomputers