A finite machine description of a lexical analysis using table look-up

ABSTRACT

A lexical analysis is described using a finite state machine to express the top level of the algorithm. The lexical analyzer exploits table lookup to facilitate the determination of tokens. The table lookup procedure alleviates the process of developing a conplicated set of construction rules.

REFERENCES

• 1: W. K. Marshall, G. W. Zobrist, W. Bach, and A. Richards,,"A Functional Mapping for Microprocessor Simulatlon , Proceedings 1985 IEEE Microprocessor Forum, Atlantic City, NJ, 1985, pp. 15-19.
• 2: G. W. Zobrist and Brian Smith, "A Functional Mapping for 8 Microcontroller Simulation", Proceedings 1986 IEEE Workstation_ Technology and Systems Conference, Atlantic City, NJ, 1986, pp. 37-45.
• 3: Walter L. Johnson , James H. Porter , Stephanie I. Ackley , Douglas T. Ross, Automatic generation of efficient lexical processors using finite state techniques, Communications of the ACM, v.11 n.12, p.805-813, Dec. 1968 [doi>10.1145/364175.364185]
• 4: W. M. Waite, The cost of lexical analysis, Software—Practice & Experience, v.16 n.5, p.473-488, May 1986 [doi>10.1002/spe.4380160508]
• 5: Alfred V. Aho , Margaret J. Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM, v.18 n.6, p.333-340, June 1975 [doi>10.1145/360825.360855]
• 6: VHDL Language Reference Manual, D r a f t IEEE Standard 1076/A, CAD Language Systems, December 1986.
• 7: Moe Shahdad, An overview of VHDL language and technology, Proceedings of the 23rd ACM/IEEE conference on Design automation, p.320-326, July 1986, Las Vegas, Nevada, United States

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.4 Processors
          Subjects: Parsing

Additional Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.2 Grammars and Other Rewriting Systems
          Subjects: Parsing

General Terms:
Languages