International E-publication: Publish Projects, Dissertation, Theses, Books, Souvenir, Conference Proceeding with ISBN.  International E-Bulletin: Information/News regarding: Academics and Research

A Study and Analysis of Precedence Functions for Operator Precedence Parser in Compiler Design

    , , , ,

Author Affiliations

  • 1Department of Computer Science, Holkar Science College, DAVV, Indore, India
  • 2Department of Computer Science, Holkar Science College, DAVV, Indore, India
  • 3Department of Computer Science, Holkar Science College, DAVV, Indore, India
  • 4State Forensic Science Laboratory, Home (Police) Deptt., Govt. of MP, Sagar, India
  • 5Department of Computer Science, MGCGV, Chitrakoot, Satna, India

Res. J. Computer & IT Sci., Volume 4, Issue (3), Pages 1-3, March,20 (2016)

Abstract

The performance of a computer system rely on compiler technology which states that compiler is used as a mechanism in evaluating architectural approaches before a computer is manufactured. In compiler the parser obtains a string of symbols from the lexical analyzer and ascertains that the string of token names can be accepted by the grammar for the source language. Operator precedence parsing is implementation of shift reduce grammar. In this paper we have studied problem found in the operator precedence relation and precedence relation table. It takes a lot of space in memory to parse a given string. We try to design an algorithm by which one can construct a directed graph and derive the precedence function table for context free grammar by which less memory space is enough for parsing an input string and to motivate the researcher, while showing the future aspects in the area of compiler designing and error solving.

References

  1. Peter Ruzicka (1981)., Operator Precedence Parsing Algorithm is Polynomial in Time., Kybernetika, 17(5), 368-379.
  2. Xiao Yang and Jiancheng Wan (2005)., A Parsing Algorithm of Natural Language based on Operator Precedence., IEEE: Natural Language Processing and Knowledge Engineering, 73–78, ISBN: 0-7803-9361-9, DOI:10.1109/NLPKE.2005.1598710.
  3. Xiao Yang, Jiancheng Wan and Yongbo Qiao (2006)., A Binary Combinational Grammar for Chinese and Its Parsing Algorithm., IEEE, 761-766, ISBN: 0-7695-2528-8, DOI: 10.1109/ISDA.2006.253708.
  4. Data Syntax and Semantics (2015)., Data Syntax and Semantics, http://www-compsci.swan. ac.uk/~csjvt/JVTPublications/DSS (March2006).pdf, 20/07/2015.
  5. Alfered V. Aho, Monica S. Lam, Ravi Sethi and Jeffrey D. Ullman (2007)., Compilers., Pearson Education Inc., South Asia, 197-200, ISBN-978-81-317-2101-8.
  6. WIKIPEDIA (2015), Operator precedence parser., https://en.wikipedia.org/ wiki/Operator-precedence_parser, 15/07/2015.
  7. D.S. Henderson and M.R. Levy (1976)., An Extended Operator Precedence Parsing Algorithm., The Computer Journal, 19(3), 229-233.
  8. Arun Petrick (2015)., Operator precedence parser, http://compilerdesigndetails.blogspot.in/2012/02/operator-precedence-parsing.html,05/08/2015.
  9. Alessandro Barenghi et. al. (2013)., PAPAGENO: A Parallel Parser generator for Operator Precedence Grammars., International Journal of Grid and Utility Computing (IJGUC), 113(7), 245-249.
  10. Shashank Rajput (2015)., Operator precedence parser., http://cse.iitkgp.ac.in/~bivasm/notes/scribe/11CS10042.pdf,05/09/2015