On the complexity of LL(k) testingSIPPU, S; SOISALON-SOININEN, E.Journal of computer and system sciences (Print). 1983, Vol 26, Num 2, pp 244-268, issn 0022-0000Article

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

NOTE TECHNIQUE D'UTILISATION DU TRANSFORMATEUR DE GRAMMAIRE LL (1)DELAUNAY M; GRABOWIECKI JF.1980; ; FRA; DA. 1980; IMAG-RR/234; 40 P.; 30 CM; ABS. ENG; BIBL. 4 P.;[RAPP. RECH.-LAB. INFORM. MATH. APPL. GRENOBLE; VOL. RR-234]Report

A DIRECT BRANCHING ALGORITHM FOR CHECKING EQUIVALENCE OF STRICT DETERMINISTIC VS. LL(K) GRAMMARSTOMITA E.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 2; PP. 129-154; BIBL. 23 REF.Article

CHARACTERIZATION OF THE LL (K) PROPERTYSIPPU S; SOISALON SOININEN E.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 596-608; BIBL. 8 REF.Conference Paper

LL-REGULAR GRAMMARSNIJHOLT A.1980; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1980; VOL. 8; NO 4; PP. 303-318; BIBL. 16 REF.Article

A METHOD FOR TRANSFORMING GRAMMARS INTO LL(K) FORMSOISALON SOININEN E; UKKONEN E.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 12; NO 4; PP. 339-369; BIBL. 30 REF.Article

CH (K) GRAMMARS: A CHARACTERIZATION OF LL (K) LANGUAGESNIJHOLT A; SOISALON SOININEN E.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 390-397; BIBL. 9 REF.Conference Paper

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

PGEN - A GENERAL PURPOSE PARSER GENERATORFLORIJN G; ROLF G.1981; STICHT. MATH. CENT., AFD. INFORM.; ISSN 0376-4028; NLD; DA. 1981; NO 157; 46 P.; BIBL. 5 REF.Serial Issue

Size/lookahead tradeoff for LL(k)-grammarsBERTSCH, E; NEDERHOF, M.-J.Information processing letters. 2001, Vol 80, Num 3, pp 125-129, issn 0020-0190Article