PARSING STRATEGIES: A CONCISE SURVEY. PRELIMINARY REPORTNIJHOLT A.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 103-120; BIBL. 3 P.Conference Paper

A SURVEY OF NORMAL FORM COVERS FOR CONTEXT FREE GRAMMARSNIJHOLT A.1980; ACTA INF.; ISSN 0001-5903; DEU; DA. 1980; VOL. 14; NO 3; PP. 271-294; BIBL. 34 REF.Article

FROM LEFT-REGULAR TO GREIBACH NORMAL FORM GRAMMARSNIJHOLT A.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 1; PP. 51-55; BIBL. 14 REF.Article

A LEFT PART THEOREM FOR GRAMMATICAL TREESNIJHOLT A.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 25; NO 1; PP. 51-63; BIBL. 10 REF.Article

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

ON SATISFYING THE LL-ITERATION THEOREMNIJHOLT A.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 1; PP. 91-94; BIBL. 8 REF.Article

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

GRAMMAR FUNCTORS AND COVERS: FROM NON-LEFT-RECURSIVE TO GREIBACH NORMAL FORM GRAMMARSNIJHOLT A.1979; B.I.T.; DNK; DA. 1979; VOL. 19; NO 1; PP. 73-78; BIBL. 3 REF.Article

SIMPLE CHAIN GRAMMARS AND LANGUAGESNIJHOLT A.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 3; PP. 287-309; BIBL. 23 REF.Article

STRUCTURE PRESERVING TRANSFORMATIONS ON NON-LEFT-RECURSIVE GRAMMARSNIJHOLT A.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 446-459; BIBL. 44 REF.Conference Paper

ON THE COVERING OF LEFT RECURSIVE GRAMMARS.NIJHOLT A.1977; IN: ACM SYMP. PRINC. PROGRAM. LANG. 4; LOS ANGELES; 1977; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1977; PP. 86-96; BIBL. 3 REF.Conference Paper

TRANSLATOR WRITING TOOLS SINCE 1970: A SELECTIVE BIBLIOGRAPHY (JUNE 1982)MEIJER H; NIJHOLT A.1982; SIGPLAN NOTICES; ISSN 0362-1340; USA; DA. 1982; VOL. 17; NO 10; PP. 62-72Article

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

AMiLP '95NIJHOLT, A; SCOLLO, G.Theoretical computer science. 1998, Vol 199, Num 1-2, issn 0304-3975, 249 p.Serial Issue

CSP-CASL : A new integration of process algebra and algebraic specificationROGGENBACH, Markus.Theoretical computer science. 2006, Vol 354, Num 1, pp 42-71, issn 0304-3975, 30 p.Conference Paper

Counting with range concatenation grammarsBOULLIER, P.Theoretical computer science. 2003, Vol 293, Num 2, pp 391-416, issn 0304-3975, 26 p.Article

The inclusion problem for some subclasses of context-free languagesASVELD, P. R. J; NIJHOLT, A.Theoretical computer science. 2000, Vol 230, Num 1-2, pp 247-256, issn 0304-3975Article

Polymorphic syntax definitionVISSER, E.Theoretical computer science. 1998, Vol 199, Num 1-2, pp 57-86, issn 0304-3975Article

Algebraic translations, correctness and algebraic compiler constructionJANSSEN, T. M. V.Theoretical computer science. 1998, Vol 199, Num 1-2, pp 25-56, issn 0304-3975Article

Algebraic Methods in Language ProcessingNIJHOLT, A; SCOLLO, G; HEYLEN, D et al.Theoretical computer science. 2003, Vol 293, Num 2, issn 0304-3975, 240 p.Serial Issue

Dominance constraints with Boolean connectives: a model-eliminative treatmentDUCHIER, Denys.Theoretical computer science. 2003, Vol 293, Num 2, pp 321-343, issn 0304-3975, 23 p.Article

Algebraic processing of programming languagesRUS, T.Theoretical computer science. 1998, Vol 199, Num 1-2, pp 105-143, issn 0304-3975Article

Algebraic methods in language processingNIJHOLT, A; SCOLO, G; MÖNNICH, U et al.Theoretical computer science. 2006, Vol 354, Num 1, issn 0304-3975, 170 p.Conference Proceedings

Uniqueness logicHARRINGTON, Dana.Theoretical computer science. 2006, Vol 354, Num 1, pp 24-41, issn 0304-3975, 18 p.Conference Paper

wMSO theories as grammar formalismsROGERS, James.Theoretical computer science. 2003, Vol 293, Num 2, pp 291-320, issn 0304-3975, 30 p.Article