Abstract
In this chapter further aspects of lexical analysis are considered. Firstly, the extra problems that programs written in Pascal, rather than the simpler P language, cause during lexical analysis are examined. Secondly, the use of tools to generate lexical analysers automatically is discussed. Finally, section 7.3 describes methods for saving all the identifiers to be found in a Pascal source program in a symbol table. This both reduces the total amount of data held in lexemes and provides a simple mechanism for storing identifier declarations and matching them to their corresponding uses during the semantic phase.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1988 P. C. Capon and P. J. Jinks
About this chapter
Cite this chapter
Capon, P.C., Jinks, P.J. (1988). Lexical analysis. In: Compiler Engineering Using Pascal. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-10401-7_7
Download citation
DOI: https://doi.org/10.1007/978-1-349-10401-7_7
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-47155-5
Online ISBN: 978-1-349-10401-7
eBook Packages: Computer ScienceComputer Science (R0)