CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

State Merging in LR Parser under Count based Reduction

by R. D. Solomon Raju, Pawan Kumar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 100 - Number 17
Year of Publication: 2014
Authors: R. D. Solomon Raju, Pawan Kumar
10.5120/17616-8235

R. D. Solomon Raju, Pawan Kumar . State Merging in LR Parser under Count based Reduction. International Journal of Computer Applications. 100, 17 ( August 2014), 19-31. DOI=10.5120/17616-8235

@article{ 10.5120/17616-8235,
author = { R. D. Solomon Raju, Pawan Kumar },
title = { State Merging in LR Parser under Count based Reduction },
journal = { International Journal of Computer Applications },
issue_date = { August 2014 },
volume = { 100 },
number = { 17 },
month = { August },
year = { 2014 },
issn = { 0975-8887 },
pages = { 19-31 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume100/number17/17616-8235/ },
doi = { 10.5120/17616-8235 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:30:12.077042+05:30
%A R. D. Solomon Raju
%A Pawan Kumar
%T State Merging in LR Parser under Count based Reduction
%J International Journal of Computer Applications
%@ 0975-8887
%V 100
%N 17
%P 19-31
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

An LR parser shows error only during scanning input symbol. Error is never shown during the reduction of a handle (substring of stack) into nonterminal. It is because a symbol is put into the stack only when it is guaranteed to be the correct one. If the method of reduction of a handle is known then errors can also be shown during reduction. Hence a wrong symbol can be shifted on the stack and error can be detected during reduce operation. It may permit the merging of few states. The simplest type of reduction scheme is to remove few symbols (the number of symbols equal to the length of the handle) from the top of the stack and push the corresponding nonterminal on the stack. In this paper, a state merging scheme is proposed under this method of reduction.

References
  1. Alfred V, Aho, Ravi Sethi, and Jeffery D. Ullaman, Compiler: Principles, Techniques and Tools, 1986, Addison-Wesley
  2. Dillip Kumar and Pawan Kumar, State Merging in LR parser, ACM SIGPLAN notices, Vol 41(4), pp 24-29, 2006
  3. Anderson T, Syntactic Analysis of LR (k) languages. PhD Thesis, University Newcastle-upon- Tyne, Northumberland, England, 1972
  4. Anderson T, Eve J, and Horning, J J, "Efficient LR(1) parsers. " Acla Informatics 2 , pp 12-39, 1973
  5. Deremer F. L, "Simple LR(k) grammars " Comm. ACM 14,Vol 7, pp 453-460, 1971
  6. Floyd R. W, "Syntactic analysis and operator precedence " J. ACM 10,Vol 3, pp 316-333, 1963
  7. Lalonde W R, Lee E S, and Homing J. J, "An LALR (k) parser generator. " Proc. IFIP Congress 71 TA-3, North-Holland Publishing Co. , Amsterdam, the Netherlands, pp 153-157, 1971
  8. Pager D, "On the incremental approach to left- to-right parsing " Technical Report PE 238, Information Sciences Program, Univ. Hawaii, Honolulu, Hawan, 1972a
  9. Pager D, "A fast left-to-right parser for context-free grammars. " Technical Report PE 240, Information Sciences Program, Univ. Hawaii, Honolulu, Hawaii, 1972b
Index Terms

Computer Science
Information Sciences

Keywords

LR Parser Handle Stack CFG (Context Free Grammar)

Powered by PhDFocusTM