FROM LL-REGULAR TO LL(1) GRAMMARS: TRANSFORMATIONS, COVERS AND PARSINGNIJHOLT A.1982; R.A.I.R.O., INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1982; VOL. 16; NO 4; PP. 387-406; ABS. FRE; BIBL. 12 REF.Article

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

LL-REGULAR GRAMMARS.JARZABEK S; KRAWCZYK T.1974; PRACE INST. MASZ. MAT.; POLSKA; DA. 1974; VOL. 16; NO 1; PP. 95-107; ABS. POL. RUSSE; BIBL. 7 REF.Article

EXTENSIONS SYNTAXIQUES DANS UN CONTEXTE LL(1).VIDART J.1974; ; S.L.; DA. 1974; PP. (150P.); BIBL. 5 P. 1/2; (THESE DOCT. 3E. CYCLE, SPEC. INF.; UNIV. SCI. MED.-INST. NATL. POLYTECH. GRENOBLE)Thesis

LL(K) PARSING BY A CANONICAL P.D.A. USING BOUNDED CONTEXT TECHNIQUE.TERRINE G; COUHAULT AM.1977; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1977; NO 222; PP. 1-18; ABS. ANGL.Serial Issue

A DIRECT ALGORITHM FOR CHECKING EQUIVALENCE OF LL(K) GRAMMARS.OLSHANSKY T; PNUELI A.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977; VOL. 4; NO 3; PP. 321-349; BIBL. 14 REF.Article

A CHARACTERIZATION OF LL(1) GRAMMARS.JOHNSON DB; SETHI R.1976; B.I.T.; DANM.; DA. 1976; VOL. 16; NO 3; PP. 275-280; BIBL. 11 REF.Article

ON TOP-DOWN PARSING OF ALGOL 68+MEERTENS LGLT; VAN VLIET JC.1981; STICHT. MATH. CENT., AFD. INFORM.; ISSN 0376-4028; NLD; DA. 1981; NO 182; 19 P.; BIBL. 14 REF.Serial Issue

ADA SYNTAX DIAGRAMS FOR TOP-DOWN ANALYSISBONET R; KUNG A; RIPKEN K et al.1981; SIGPLAN NOT.; ISSN 0362-1340; USA; DA. 1981; VOL. 16; NO 9; PP. 29-41Article

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

ON LL-REGULAR GRAMMARSPOPLAWSKI DA.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 18; NO 3; PP. 218-227; BIBL. 9 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

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

CONTRIBUTION A L'ETUDE DE L'ANALYSE SYNTACTIQUE: APPLICATIONS A L'ETUDE DE L'ANALYSE SYNTACTIQUE DETERMINISTE DESCENDANTE = CONTRIBUTION TO THE STUDY OF PARSING: APPLICATIONS TO THE STUDY OF TOP-DOWN DETERMINISTIC PARSINGHUA THANH HUY.1982; ; FRA; DA. 1982; PAG. MULT.; 30 CM; BIBL. 18 P.; TH. 3E CYCLE: MATH. APPL./PARIS 6/1982Thesis

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

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

Practical LL (1)-based parsing of van Wijngaarden grammarsFISHER, A. J.Acta informatica. 1985, Vol 21, Num 6, pp 559-584, issn 0001-5903Article

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

A COMPILER DEFINITION FACILITY BASED ON THE SYNTACTIC MACRO.CAMPBELL WR.1978; COMPUTER J.; G.B.; DA. 1978; VOL. 21; NO 1; PP. 35-41; BIBL. 9 REF.Article

AUTOMATIC RECOVERY AND CORRECTION OF SYNTACTIC ERRORS IN TOP-DOWN COMPILERS.GHEZZI C.1975; J. CYBERN.; U.S.A.; DA. 1975 PARU 1976; VOL. 5; NO 3; PP. 31-41; BIBL. 17 REF.Article