A powerful LL(K) covering transformationLEE, Gyung-Ok; CHOE, Kwang-Moo.SIAM journal on computing (Print). 2006, Vol 35, Num 2, pp 359-377, issn 0097-5397, 19 p.Article

PRACTICAL ERROR RECOVERY IN LR PARSINGSIPPU S; SOISALON SOININEN E.1982; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 9/1982-01-25/ALBUQUERQUE NM; USA; NEW YORK: ACM; DA. 1982; PP. 177-184; BIBL. 18 REF.Conference Paper

LR-PARSING OF EXTENDED CONTEXT FREE GRAMMARS.MADSEN OL; KRISTENSEN BB.1976; ACTA INFORMAT.; ALLEM.; DA. 1976; VOL. 7; NO 1; PP. 61-73; BIBL. 7 REF.Article

A CHARACTERIZATION OF LL(K) LANGUAGES.SOISALON SOININEN E; UKKONEN E.1976; IN: AUTOM. LANG. PROGRAM. INT. COLLOQ. 3; EDINBURGH; 1976; EDINBURGH; UNIV. PRESS; DA. 1976; PP. 20-30; BIBL. 16 REF.Conference Paper

A transformation method for reducing the number of states of bypassed Knuth LR (K) parsersTOKUDA, T.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1984, Vol 67, Num 5, pp 259-266, issn 0387-236XArticle

On the correct elimination of chain productions from LR parsersSCHMITZ, L.International journal of computer mathematics. 1984, Vol 15, Num 2, pp 99-116, issn 0020-7160Article

Contribution à la construction automatique d'analyseurs lexicographiques et syntaxiques = Contribution to the automatic design of parsers and dexicographical analyzerBOULLIER, Pierre.1984, Pagination multThesis

N-LINEAR SIMPLE MATRIX LANGUAGES AND N-PARALLEL LINEAR LANGUAGES.WOOD D.1977; REV. ROUMAINE MATH. PURES APPL.; ROUMAN.; DA. 1977; VOL. 22; NO 3; PP. 403-412; BIBL. 8 REF.Article

ON DIRECTLY CONSTRUCTING LR(K) PARSERS WITHOUT CHAIN REDACTIONS.LALONDE WR.1976; IN: CONF. REC. ACM SYMP. PRINC. PROGRAM. LANG. 3. SYMP.; ATLANTA, GA.; 1976; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1976; PP. 127-133; BIBL. 17 REF.Conference Paper

A SIMPLE TECHNIQUE FOR PARTIAL ELIMINATION OF UNIT PRODUCTIONS FROM LR(K) PARSERS.FOLIAT ML.1976; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1976; VOL. 25; NO 7; PP. 763-764; BIBL. 12 REF.Article

TRANSFORMING LR(K) GRAMMARS TO LR(1), SLR(1), AND (1,1) BOUNDED RIGHT-CONTEXT GRAMMARS.MICKUNAS MD; LANCASTER RL; SCHNEIDER VB et al.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 3; PP. 511-533; BIBL. 25 REF.Article

BUILDING COLLECTIONS OF LR (K) ITEMS WITH PARTIAL EXPANSION OF LOOKAHEAD STRINGSANCONA M; DODERO G; GIANUZZI V et al.1982; SIGPLAN NOT.; ISSN 0362-1340; USA; DA. 1982; VOL. 17; NO 5; PP. 25-28; BIBL. 9 REF.Article

QUELQUES RESULTATS CONCERNANT LA STRUCTURE DES GRAMMAIRES ALGEBRIQUESORMAN G.1977; STUD. CERC. MAT.; ROMAN.; DA. 1977; VOL. 29; NO 2; PP. 141-147; ABS. ANGL.; BIBL. 11 REF.Article

ENGINEERING A PRODUCTION CODE GENERATORCRAWFORD J.1982; SIGPLAN NOT.; ISSN 0362-1340; USA; DA. 1982; VOL. 17; NO 6; PP. 205-215; BIBL. 14 REF.Conference Paper

A practical method for finding the optimum postponement transformation for LR(k) parsersWITASZEK, J.Information processing letters. 1988, Vol 27, Num 2, pp 63-67, issn 0020-0190Article

On the size of parsers and LR(k)-grammarsHING LEUNG; WOTSCHKE, D.Theoretical computer science. 2000, Vol 242, Num 1-2, pp 59-69, issn 0304-3975Article

Lookahead LR parsing with regular right part grammarsCOLBY, J. E; BERMUDEZ, M. E.International journal of computer mathematics. 1997, Vol 64, Num 1-2, pp 1-15, issn 0020-7160Article

On the reduction of LR(k) parsersWOO-JUN PARK; MYUNG-JOON LEE; KWANG-MOO CHOE et al.Information processing letters. 1993, Vol 47, Num 5, pp 245-251, issn 0020-0190Article

LALR (1,1) Parser generation for regular right part grammarsCHAPMAN, N. P.Acta informatica. 1984, Vol 21, Num 1, pp 29-45, issn 0001-5903Article

The Edge-Pushing LR(k) AlgorithmCHEN, X; PAGER, D.Software engineering research & preactice. International conferenceWorldComp'2011. 2011, pp 471-477, isbn 1-60132-199-6 1-60132-200-3 1-60132-201-1, 7 p.Conference Paper

A Yacc extension for LRR grammar parsingSEITE, B.Theoretical computer science. 1987, Vol 52, Num 1-2, pp 91-143, issn 0304-3975Article

The nearest trapezoidal form of a generalized left right fuzzy numberABBASBANDY, S; AMIRFAKHRIAN, M.International journal of approximate reasoning. 2006, Vol 43, Num 2, pp 166-178, issn 0888-613X, 13 p.Article

On parsing and condensing substrings of LR languages in linear timeGOEMAN, H.Lecture notes in computer science. 1999, pp 22-42, issn 0302-9743, isbn 3-540-66652-4Conference Paper

ECLR-Attributed grammars: a practical class of LR-attributed grammarsSASSA, M; ISHIZUKA, H; NAKATA, I et al.Information processing letters. 1987, Vol 24, Num 1, pp 31-41, issn 0020-0190Article

Une extension de YACC, pour analyse des grammaires LRR, qui autorise un examen non borné du contexte droit et de la pile = An add-on for LR-pairer generators, such as YACC, for parsing LRR grammars, allowing unbounded examination of lookahead and stackSEITE, Bernard; NIVAT, Maurice.1986, 101 pThesis