CFP last date
20 May 2024
Reseach Article

A New Approach of Complier Design in Context of Lexical Analyzer and Parser Generation for NextGen Languages

by Biswajit Bhowmik, Abhishek Kumar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 6 - Number 11
Year of Publication: 2010
Authors: Biswajit Bhowmik, Abhishek Kumar
10.5120/1116-1462

Biswajit Bhowmik, Abhishek Kumar . A New Approach of Complier Design in Context of Lexical Analyzer and Parser Generation for NextGen Languages. International Journal of Computer Applications. 6, 11 ( September 2010), 21-25. DOI=10.5120/1116-1462

@article{ 10.5120/1116-1462,
author = { Biswajit Bhowmik, Abhishek Kumar },
title = { A New Approach of Complier Design in Context of Lexical Analyzer and Parser Generation for NextGen Languages },
journal = { International Journal of Computer Applications },
issue_date = { September 2010 },
volume = { 6 },
number = { 11 },
month = { September },
year = { 2010 },
issn = { 0975-8887 },
pages = { 21-25 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume6/number11/1116-1462/ },
doi = { 10.5120/1116-1462 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:55:07.973289+05:30
%A Biswajit Bhowmik
%A Abhishek Kumar
%T A New Approach of Complier Design in Context of Lexical Analyzer and Parser Generation for NextGen Languages
%J International Journal of Computer Applications
%@ 0975-8887
%V 6
%N 11
%P 21-25
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A compiler translates and/or compiles a program written in a suitable source language into an equivalent target language through a number of stages. Starting with recognition of token through target code generation provide a basis for communication interface between a user and a processor in significant amount of time. A new approach GLAP model for design and time complexity analysis of lexical analyzer is proposed in this paper. In the model different steps of tokenizer (generation of tokens) through lexemes, and better input system implementation have been introduced. Disk access and state machine driven Lex are also reflected in the model towards its complete utility. The model also introduces generation of parser. Implementation of symbol table and its interface using stack is another innovation of the model in acceptance with both theoretically and in implementation widely.

References
  1. Alfred V.Aho, Ravi Sethi, Jeffery D. Ullman, Addison-Wesley, 2007. Compilers- Principles, Techniques, and Tools.
  2. Torben Ægidius Mogensen, May 28, 2009. Basics of Compiler Design”, lulu, Extended Edition.
  3. David Galles, 2005. Modern Compiler Design, Addison-Wesley.
  4. William A. Barrett, 2005. Compiler Design, CmpE 152, FALL Version, San Jose State University.
  5. G.M6nier, G.Lorette, 1997. Lexical Analyzer based on a Self-Organizing Feature Map, IEEE Xplore, 0-8186-7898-4.
  6. Anthony Cox, Charles Clarke, 2003. Syntactic Approximation Using Iterative Lexical Analysis, IWPC’03, IEEE Xplore,1092-813A8
  7. Davide Pozza, Riccardo Sisto, Luca Durante, Adriano Valenzano, 2006. Comparing Lexical Analysis Tools for Buffer Overflow Detection in Network Software, IEEE Xplore, 0-7803-9575-1.
  8. William M. Waite, Assad Jarrahian, Michele H. Jackson, Amer Diwan, 2006. Design and Implementation of a Modern Compiler Course, ACM 1595930558/06/0006.
  9. Allen I. Holub, 2009. Compiler Design in C, Phi Learning.
  10. Santanu Chattophadhyay, 2005. Compiler Design, PH I.
  11. K.L.P. Mishra, N.Chandrasekharan, 2007. Theory of Computer Science, PHI, Third Edition.
  12. Lex table look up: www.gradsoft.kiev.ua
  13. Symbol table management: www.faculty.washington.edu
Index Terms

Computer Science
Information Sciences

Keywords

Tokens Lexeme Lex Tokenizer PDA Lookahead Pushback