Skip to search formSkip to main contentSkip to account menu

Simple LR parser

Known as: SLR parser, SLR(1) 
In computer science, a Simple LR or SLR parser is a type of LR parser with small parse tables and a relatively simple parser generator algorithm. As… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
An ultra-wide band (UWB) low noise amplifier (LNA) of bandwidth 9 kHz-0.5 GHz, gain more than 30 dB, flatness fluctuating in ±0.8… 
2010
2010
We present a formalisation of the theory of context-free languages using the HOL4 theorem prover. The formalisation of this… 
2004
2004
We show that LR(k) parsers can be represented as abstract interpretation of Shift-Reduce parser. 
1994
1994
This paper describes an application of one of the important abstract concepts taught in a compiler construction course. It… 
1987
1987
INTRODUCTION A production compiler, especially one written for a popular machine, may be used thousands of times every day. At an… 
1984
1984
A criterion is formally described which guarantees the correctness of a variety of chain-free LR parsers including the case of… 
1981
1981
This paper presents five different LR parser generators and an error recovery method which is derived directly from the LR parser… 
1979
1979
It is shown that if the basic method for eliminating single productions from canonical LR parsers developed by Pager is applied… 
1972
1972
  • A. AhoJ. Ullman
  • 1972
  • Corpus ID: 5827014