CARACTERISTIQUE D'AUTOMATE DES METHODES D'ANALYSE SYNTAXIQUE A COMMANDE REGULIEREANISIMOV AV.1976; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1976; NO 1; PP. 1-8; ABS. ANGL.; BIBL. 24 REF.Article

AMBIGUITY AND PRECEDENCE IN SYNTAX DESCRIPTION.EARLEY J.1975; ACTA INFORMAT.; ALLEM.; DA. 1975; VOL. 4; NO 2; PP. 183-192; BIBL. 10 REF.Article

THE SIZE OF LALR (1) PARSERS.PURDOM P.1974; B.I.T.; DANM.; DA. 1974; VOL. 14; NO 3; PP. 326-337; BIBL. 23 REF.Article

SUR UN PROCEDE DE REACTION A UNE ERREUR SYNTAXIQUE DANS UN TRADUCTEUR ORIENTE SYNTAXIQUEMENTKAPLUNOV MI; FILATOV VI.1974; ZH. VYCHISLIT. MAT. MAT. FIZ.; S.S.S.R.; DA. 1974; VOL. 14; NO 5; PP. 1345-1349; BIBL. 3 REF.Article

PREDICTION CONTROL PARSER: EXTENDED LINGOLTANAKA H; SATO T; MOTOYOSHI F et al.1979; IJCAI 79. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 6/1979/TOKYO; USA; S.L.: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE; DA. 1979; VOL. 2; PP. 868-870; BIBL. 6 REF.Conference Paper

ELIMINATION OF SINGLE PRODUCTIONS AND MERGING NONTERMINAL SYMBOLS OF LR(1) GRAMMARS.DEMERS AJ.1975; COMPUTER LANGUAGES; G.B.; DA. 1975; VOL. 1; NO 2; PP. 105-119; BIBL. 6 REF.Article

A TECHNIQUE FOR SPEEDING UP LR(K) PARSERS = UNE TECHNIQUE POUR ACCELERER LES ANALYSEURS LR(K)AHO AV; ULLMAN JD.sdIN: 4TH ANNU. ACM SYMP. THEORY COMPUT. DENVER, COLO, 1972. PROC.; S.L.; DA. S.D.; PP. 251-263; BIBL. 10 REF.Conference Paper

COMPILATION DES PROGRAMMES SUR UN CALCULATEUR DE COMMANDEDODONOV SB.1974; UPRAVL. SIST. MACH., U.S.S.R.; S.S.S.R.; DA. 1974; NO 6; PP. 62-65; ABS. ANGL.; BIBL. 4 REF.Article

AN ABSTRACT MACHINE THEORY FOR FORMAL LANGUAGE PARSERS.BENSON DB.1974; ACTA INFORMAT.; ALLEM.; DA. 1974; VOL. 3; NO 2; PP. 187-202; BIBL. 16 REF.Article

EXPERIENCE WITH A CONVERSATIONAL PARSER GENERATING SYSTEM.COHEN J.1975; SOFTWARE-PRACT. EXPER.; G.B.; DA. 1975; VOL. 5; NO 2; PP. 169-180; BIBL. 31 REF.Article

UTILISATION DE DEUX RELATIONS FAIBLES DE PRECEDENCE ENTRE LES SYMBOLES DETERMINANTS DANS UN ANALYSEUR SYNTAXIQUESHUMEJ AS.1975; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1975; NO 5; PP. 69-76; ABS. ANGL.; BIBL. 4 REF.Article

AUTOMATIC PROGRAM VERIFICATION I: A LOGICAL BASIS AND ITS IMPLEMENTATION.IGARASHI S; LONDON RL; LUCKHAM DC et al.1975; ACTA INFORMAT.; ALLEM.; DA. 1975; VOL. 4; NO 2; PP. 145-182; BIBL. 15 REF.Article

ZUSAMMENHANG STRUKTURELLER EIGENSCHAFTEN VON CHOMSKY-GRAMMATIKEN UND OPTIMALER SPRACHANALYSE. I = RELATION ENTRE LES CARACTERISTIQUES STRUCTURELLES D'UNE GRAMMAIRE DE CHOMSKY ET L'ANALYSE DU LANGAGEHOHBERG B.1972; ELEKTRON. INFORM.-VERARBEIT. KYBORN.; DTSCH.; DA. 1972; VOL. 8; NO 1; PP. 31-48; ABS. ANGL. RUSSE; BIBL. 19 REF.Serial Issue

A NOTE ON PRECEDENCE FUNCTIONS.KRISHNAMURTHY MS; RAMESHA CHANDRA HR.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 4; NO 4; PP. 99-100; BIBL. 1 REF.Article

TOUTE GRAMMAIRE LL(K) EST LR(K).GRIFFITHS M.1974; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., B; FR.; DA. 1974; VOL. 8; NO 2; PP. 55-58; BIBL. 2 REF.Article

TRANSFORMATION BIUNIVOQUE FINIE DE LANGAGESBARASHKO AS.1972; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1972; NO 6; PP. 144-145; BIBL. 2 REF.Serial Issue

The Edge-Pushing LR(k) AlgorithmCHEN, X; PAGER, D.Software engineering research & preactice. International conferenceWorldComp'2011. 2011, pp 471-477, isbn 1-60132-199-6 1-60132-200-3 1-60132-201-1, 7 p.Conference Paper

Parsing non-LR(k) grammars with YaccMERRILL, G. H.Software, practice & experience. 1993, Vol 23, Num 8, pp 829-850, issn 0038-0644Article

States merging in LR parserDILLIP KUMAR LENKA; KUMAR, Pawan.ACM SIGPLAN notices. 2006, Vol 41, Num 4, pp 24-29, issn 1523-2867, 6 p.Article

Disambiguation filters for scannerless generalized LR parsersVAN DEN BRAND, M. G. J; SCHEERDER, J; VINJU, J. J et al.Report - Software engineering. 2001, Num 25, pp 1-14, issn 1386-369XArticle

On the reduction of LR(k) parsersWOO-JUN PARK; MYUNG-JOON LEE; KWANG-MOO CHOE et al.Information processing letters. 1993, Vol 47, Num 5, pp 245-251, issn 0020-0190Article

Hashing as a compaction technique for LR parser tablesHORSPOOL, R. N; CORMACK, G. V.Software, practice & experience. 1987, Vol 17, Num 6, pp 413-416, issn 0038-0644Article

Lower bounds on the size of deterministic parsersUKKONEN, E.Journal of computer and system sciences (Print). 1983, Vol 26, Num 2, pp 153-170, issn 0022-0000Article

REALISATION DE L'ALGORITHME DE RECONNAISSANCE ET DE SELECTION DES MOTS A L'AIDE DE LA FONCTION DE COINCIDENCEVOLKOV VN; IVANISOV AV.1982; PROGRAMMIROVANIE; SUN; DA. 1982; NO 2; PP. 90-92Article

NIEKTORE PROBLEMY KONSTRUKCJI PARSEROW TYPU SLR(1) = QUELQUES PROBLEMES DANS LA CONSTRUCTION D'UN ANALYSEUR SYNTAXIQUE SLR(1)KROL J; ROSEK J.1982; PODSTAWY STEROWANIA; ISSN 0374-4094; POL; DA. 1982; VOL. 12; NO 3-4; PP. 117-133; ABS. ENG/RUS; BIBL. 24 REF.Article