ELIMINATION OF SINGLE PRODUCTIONS AND MERGING NONTERMINAL SYMBOLS OF LR(1) GRAMMARS.DEMERS AJ.1975; COMPUTER LANGUAGES; G.B.; DA. 1975; VOL. 1; NO 2; PP. 105-119; BIBL. 6 REF.Article

A TECHNIQUE FOR SPEEDING UP LR(K) PARSERS = UNE TECHNIQUE POUR ACCELERER LES ANALYSEURS LR(K)AHO AV; ULLMAN JD.sdIN: 4TH ANNU. ACM SYMP. THEORY COMPUT. DENVER, COLO, 1972. PROC.; S.L.; DA. S.D.; PP. 251-263; BIBL. 10 REF.Conference Paper

Upper bounds on the size of LR(k) parsersUKKONEN, E.Information processing letters. 1985, Vol 20, Num 2, pp 99-103, issn 0020-0190Article

Extended use of null productions in LR(1) parser applicationsFINN, G. D.Communications of the ACM. 1985, Vol 28, Num 9, pp 961-972, issn 0001-0782Article

Truly prefix-correct chain-free LR(1) parsersHEILBRUNNER, S.Acta informatica. 1985, Vol 22, Num 5, pp 499-536, issn 0001-5903Article

LR(O) GRAMMARS GENERATED BY LR(O) PARSERSKEMP R.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 3; PP. 265-280; BIBL. 14 REF.Article