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

ON THE GENERATIVE CAPACITY OF CONDITIONAL GRAMMARSPAUN G.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 43; NO 2; PP. 178-186; BIBL. 6 REF.Article

HYPERGRAMMARS: AN EXTENSION OF MACROGRAMMARS.RAYWARD SMITH VJ.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 14; NO 1; PP. 130-149; BIBL. 9 REF.Article

DIRECTION CONTROLLED PROGRAMMED GRAMMARSROZENBERG G.1972; ACTA INFORMAT.; ALLEM.; DA. 1972; VOL. 1; NO 3; PP. 242-252; BIBL. 7 REF.Serial Issue

SOME BASIC PROPERTIES OF K-BOUNDED INTERPRETATIONS OF GRAMMAR FORMSVARJU EC.1982; COMPUT. LINGUIST. COMPUT. LANG.; ISSN 0324-2048; HUN; DA. 1982; VOL. 15; PP. 51-73; BIBL. 4 REF.Article

ON FORM-EQUIVALENCE OF DETERMINISTIC PURE GRAMMAR FORMSHAGAUER J.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 18; NO 1; PP. 69-87; BIBL. 16 REF.Article

A PRIME DECOMPOSITION THEOREM FOR GRAMMATICAL FAMILIESGINSBURG S; GOLDSTINE J; SPANIER EH et al.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 3; PP. 315-361; BIBL. 7 REF.Article

PARALLEL CONTEXT-FREE ARRAY GRAMMAR NORMAL FORMSSHEN PEI WANG P.1981; COMPUT. GRAPH. IMAGE PROCESS.; ISSN 0146-664X; USA; DA. 1981; VOL. 15; NO 3; PP. 296-300; BIBL. 14 REF.Article

EXTENDING LOOKAHEAD FOR LR PARSERSBAKER TP.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 2; PP. 243-259; 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

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

PARTITIONED GRAMMARS AND SYNTAX ANALYZERSSCHWENKEL F.1972; LECTURE NOTES ECON. MATH. SYST.; GERM.; DA. 1972; NO 75; PP. 114-139; BIBL. 1 P. 1/2Serial Issue

REDUCING ALGEBRAIC TREE GRAMMARSLEGUY B.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 226-233; BIBL. 11 REF.Conference Paper

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

FIRST ORDER GRAPH GRAMMARS.COOK CR.1974; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1974; VOL. 3; NO 1; PP. 90-99; BIBL. 8 REF.Article

ON THE SYNTACTIC STRUCTURES OF UNRESTRICTED GRAMMARS. I. GENERATIVE GRAMMARS AND PHRASE STRUCTURE GRAMMARS.BUTTELMANN HW.1975; INFORM. AND CONTROL; U.S.A.; DA. 1975; VOL. 29; NO 1; PP. 29-80; BIBL. 12 REF.Article

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

A UNIVERSAL CONTEXT-FREE GRAMMAR.KASAI T.1975; INFORM. AND CONTROL; U.S.A.; DA. 1975; VOL. 28; NO 1; PP. 30-34; BIBL. 9 REF.Article

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

N-FOLD FUZZY GRAMMARSMIZUMOTO M; TOYODA J; TANAKA K et al.1973; INFORM. SCI.; U.S.A.; DA. 1973; VOL. 5; PP. 25-43; BIBL. 11 REF.Serial Issue

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

POSITION-RESTRICTED GRAMMAR FORMS AND GRAMMARSBLATTNER M; GINSBURG S.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 1; PP. 1-27; BIBL. 10 REF.Article

SPACE-RESTRICTED ATTRIBUTE GRAMMARSSCHMIDT EM.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 436-448; BIBL. 6 REF.Conference Paper

ON THE INFERENCE OF STOCHASTIC REGULAR GRAMMARS.VAN DER MUDE A; WALKER A.1978; INFORM. AND CONTROL; USA; DA. 1978; VOL. 38; NO 3; PP. 310-329; BIBL. 19 REF.Article

LEARNING OF FUZZY FORMAL LANGUAGETAMURA S; TANAKA K.1973; I.E.E.E. TRANS. SYST. MAN CYBERN.; U.S.A.; DA. 1973; VOL. 3; NO 1; PP. 98-102; BIBL. 11 REF.Serial Issue