A short proof of a conjecture of De Remer and Pennello

Authors:
Thomas J. Sager
Affiliations:
Univ. of Missouri-Rolla, Rolla
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1986

Citing 2
Cited 0

Efficient Computation of LALR(1) Look-Ahead Sets

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we offer a short proof of the DeRemer-Pennello conjecture that if the LR(0) automaton for a grammar G contains a state p and a nonterminal A such that (p, A) is a nonterminal transition, (p, A) includes+ (p, A) and Read(p, A) is not empty, then grammar G is not LR(k) for any k.