Abstract
Lexical analysis is the first and foremost step in the compilation process. The basic aim of this step is to convert stream of characters / symbols into words called tokens. These tokens are used by the other phases of a compiler. Many tools have been developed in the past that generate the tokenizer automatically. These tools are best suited for sequential processing. With the advent of multi-core processors it is possible to parallelize tokenization by exploiting the parallel constructs of the languages. In this paper we propose a parallel lexical analyzer which exploits loops and processor affinity concept to achieve parallelism in lexical analysis on multi-core machines. The results show substantial improvement in lexical analysis phase as compared to sequential version.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
