Generating parsers for BNF grammars. - Franklin L. Deremer (AFIPS Spring Joint Computing Conference, 1969)

Optimization using LR(k) techniques. - Franklin L. Deremer (ACM SIGPLAN Notices, 1970)

Simple LR(k) Grammars. - Frank DeRemer (Commun. ACM, 1971)

Feedback-free Modularization of Compilers. - William M. McKeeman; Frank DeRemer (Fachtagung über Programmiersprachen, 1974)

Review of Formalisms and Notation. - Frank DeRemer (Compiler Construction, 1976)

Lexical Analysis. - Frank DeRemer (Compiler Construction, 1976)

Transformational Grammars. - Frank DeRemer (Compiler Construction, 1976)

Programming-in-the-Large Versus Programming-in-the-Small. - Frank DeRemer; Hans H. Kron (IEEE Trans. Software Eng., 1976)

A Forward Move Algorithm for LR Error Recovery. - Thomas J. Pennello; Frank DeRemer (POPL, 1978)

Efficient computation of LALR(1) look-ahead sets (with retrospective) - Thomas J. Pennello; Frank DeRemer (Best of PLDI, 1979)

Summary of the characteristics of several "modern" programming languages. - Frank DeRemer; Philip Levy; Steve Hanson; Philip Jackson 001; Richard Jüllig; Tom Pittman (ACM SIGPLAN Notices, 1979)

Tree-affix dendrogrammars for languages and compilers. - Frank DeRemer; Richard Jüllig (Semantics-Directed Compiler Generation, 1980)

A syntax diagram for (preliminary) Ada. - Frank DeRemer; Thomas J. Pennello; Richard Meyers (ACM SIGPLAN Notices, 1980)

A simplified operator identification scheme for Ada. - Thomas J. Pennello; Frank DeRemer; Richard Meyers (ACM SIGPLAN Notices, 1980)

Ada syntax chart. - Frank DeRemer; Thomas J. Pennello; William M. McKeeman (ACM SIGPLAN Notices, 1981)

Efficient Computation of LALR(1) Look-Ahead Sets. - Frank DeRemer; Thomas J. Pennello (ACM Trans. Program. Lang. Syst., 1982)

Regular right-part attribute grammars. - Richard Jüllig; Frank DeRemer (SIGPLAN Symposium on Compiler Construction, 1984)