Abstract
Early in the compilation process the source program appears as a stream of characters. The two subprocesses of “scanning” and “screening” constitute the process known as lexical analysis.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
DeRemer, F. L.: Transformational grammars for languages and compilers, Technical Report No. 50, Computing Laboratory, University of Newcastle upon Tyne, England, July 1973
Early, J.: An efficient context-free parsing algorithm. Comm. ACM 13, 94–102 (1970)
Gries, D.: Compiler construction for digital computers. New York: John Wiley and Sons 1971
Hoperoft, J. E., Ullman, J.D.: Formal languages and their relation to automata. Reading (Mass.): Addison-Wesley 1969
Johnson, W. R., Porter J.S., Ackley S.I., Ross D. T.: Automatic generation of efficient lexical processors using finite state techniques. Comm. ACM 11, 805–813 (1968)
Kleene, S.: Representation of events in nerve-sets. In: Automata Studies, Princeton ( N.J. ): Princeton Univ. Press 1956, pp. 3–42
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
DeRemer, F.L. (1974). Lexical Analysis. In: Bauer, F.L., Eickel, J. (eds) Compiler Construction. Lecture Notes in Computer Science, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21549-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-21549-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06958-4
Online ISBN: 978-3-662-21549-4
eBook Packages: Springer Book Archive