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

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

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

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

ELIMINATING UNIT REDUCTIONS FROM LR(K) PARSERS USING MINIMUM CONTEXTSTOKUDA T.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 4; PP. 447-470; BIBL. 25 REF.Article

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

ON LALR (K) TESTINGSIPPU S; SOISALON SOININEN E.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 208-217; BIBL. 7 REF.Conference Paper

A SCHEME FOR LR(K) PARSING WITH ERROR RECOVERY. I: ERROR CORRECTIONSIPPU S; SOISALON SOININEN E.1980; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1980; VOL. 8; NO 3; PP. 189-206; BIBL. 9 REF.Article

LA GENERATION D'UN PROGRAMME PL POUR UNE ANALYSE SYNTAXIQUE DE BAS EN HAUTSOCENEANTU A.1977; BUL. STI. TEH. INST. POLITCH. "TRAIAN VUIA" TIMISOARA; ROMAN.; DA. 1977; VOL. 22; NO 1; PP. 225-228; ABS. ANGL.; BIBL. 8 REF.Article

ALGORITHMS FOR PRODUCING REDUCED LR(K) TABLES AND PARSERSANCONA M; GIANUZZI V; DODERO G et al.sdAICA '79. ASSOCIAZIONE ITALIANA PER IL CALCOLO AUTOMATICO. CONGRESSO/1979/BARI; ITA; BARI: UNIVERSITA DEGLI STUDI; DA. S.D.; VOL. 2; PP. 131-138; BIBL. 7 REF.Conference Paper

SYNTAKTYCZNE ANALIZATORY KONTUROW JAKO PARSERY GRAMATYK O REGULARNEJ PROEWEJ STRONIE (RRP) = ANALYSEURS SYNTAXIQUES DES CONTOURS COMME ANALYSEURS DE GRAMMAIRES REGULIERES DROITESJAKUBOWSKI R; MOSZNER P.1980; PODSTAWY STEROWAN.; POL; DA. 1980; VOL. 10; NO 4; PP. 363-378; ABS. ENG/RUS; BIBL. 7 REF.Article

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 SCHEME FOR LR(K) PARSING WITH ERROR RECOVERY. II: ERROR RECOVERYSIPPU P; SOISALON SOININEN E.1980; INTERNATION. J. COMPUTER MATH.; USA; DA. 1980; VOL. 8; NO 2; PP. 107-119; BIBL. 11 REF.Article

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