ON THE COMPLETE COVERING PROBLEM FOR LR(K) GRAMMARS.MICKUNAS MD.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 1; PP. 17-30; BIBL. 9 REF.Article

AN ALTERNATIVE APPROACH TO THE IMPROVEMENT OF LR(K) PARSERS.BACKHOUSE RC.1976; ACTA INFORMAT.; ALLEM.; DA. 1976; VOL. 6; NO 3; PP. 277-296; BIBL. 12 REF.Article

NECESSARY AND SUFFICIENT CONDITIONS FOR A POWER LANGUAGE TO BE DETERMINISTIC.SHYAMASUNDAR RK.1975; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1975; VOL. 5; NO 2; PP. 133-142; BIBL. 5 REF.Article

ON THE ABILITY TO COVER LR (K) GRAMMARS WITH LR (1), SLR (1), AND (1,1) BOUNDED-CONTEXT GRAMMARS.MICKUNAS MD; SCHNEIDER VB.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 109-121; BIBL. 19 REF.Conference Paper

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

A METATHEOREM FOR UNDECIDABLE PROPERTIES OF FORMAL LANGUAGES AND ITS APPLICATION TO LRR AND LLR GRAMMARS AND LANGUAGESHEILBRUNNER S.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 1; PP. 49-68; BIBL. 16 REF.Article

PRAKTISCHE BOUNDED-RIGHT-CONTEXT ANALYSE MIT KLEINEN SPEICHERPLATZVERBRAUCH. = ANALYSE PRATIQUE BOUNDED-RIGHT-CONTEXT AVEC PEU DE MEMORISATIONRECHENBERG P.1976; ELEKTRON. RECHEMANLAGEN; DTSCH.; DA. 1976; VOL. 18; NO 1; PP. 5-14; BIBL. 6 REF.Article

CHARACTERIZATIONS OF LR (O) LANGUAGES. (EXTENDED ABSTRACT.).GELLER MM; HARRISON MA.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 103-108; BIBL. 16 REF.Conference Paper

LA DETERMINATION DE LA PROPRIETE LR(K)SOCENEANTU A.1977; BUL. STI. TEH. INST. POLITEH. "TRAIAN VUIA" TIMISOARA; ROMAN.; DA. 1977; VOL. 22; NO 1; PP. 222-224; ABS. ANGL.; BIBL. 4 REF.Article

An efficient incremental LR Parser for grammars with Epsilon productionAGRAWAL, R; DETRO, K. D.Acta informatica. 1983, Vol 19, Num 4, pp 369-376, issn 0001-5903Article

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

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

TRANSLATIONS ON A SUBCLASS OF LR(K) GRAMMARSSOISALON SOININEN E.1982; BIT (NORD. TIDSKR. INF. BEHANDL.); ISSN 0006-3835; SWE; DA. 1982; VOL. 22; NO 3; PP. 303-312; BIBL. 9 REF.Article

ON LLP(K) GRAMMARS AND LANGUAGESPITTL J.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 2; PP. 149-175; BIBL. 20 REF.Article

PRACTICAL METHOD FOR OPTIMIZING LR (K) PARSER USING MATRIX STRUCTUREAOE J; YAMAMOTO Y; SHIMADA R et al.1979; SYST. COMPUT. CONTROLS; ISSN 0096-8765; USA; DA. 1979 PUBL. 1981; VOL. 10; NO 4; PP. 1-10; BIBL. 18 REF.Article

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 NEW METHOD FOR IMPLEMENTING LR(K) TABLESANCONA M; GIANUZZI V.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 4-5; PP. 171-176; BIBL. 13 REF.Article

KOMBINIERTE TOPDOWN/BOTTOMUP-SYNTAXANALYSE VON LR(K)-GRAMMATIKEN = ANALYSE SYNTAXIQUE DESCENDANTE ASCENDANTE COMBINEE DE GRAMMAIRES LR(K)THIMM D.1978; ELEKTRON. RECHENAULAGEN; DEU; DA. 1978; VOL. 20; NO 5; PP. 212-219; ABS. ENG; BIBL. 18 REF.Article

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

SR(S,K) PARSERS: A CLASS OF SHIFT-REDUCE BOUNDED-CONTEXT PARSERSWORKMAN DA.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 2; PP. 178-197; BIBL. 8 REF.Article

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

Page / 3