R68-46 Use of Transition Matrices in Compiling. - Jay Earley (IEEE Trans. Computers, 1968)

An Efficient Context-Free Parsing Algorithm. - Jay Earley (Commun. ACM, 1970)

A formalism for translator interactions. - Jay Earley; Howard E. Sturgis (Commun. ACM, 1970)

Toward an Understanding of Data Structures. - Jay Earley (Commun. ACM, 1971)

A Method for Incrementally Compiling Languages with Nested Statement Structure. - Jay Earley; Paul Caizergues (Commun. ACM, 1972)

Relational Level Data Structures for Programming Languages - Jay Earley (Acta Informatica, 1973)

High level operations in automatic programming. - Jay Earley (SIGPLAN Symposium on Very High Level Languages, 1974)

Ambiguity and Precedence in Syntax Description. - Jay Earley (Acta Informatica, 1974)

Syntax extension using a run time model. - Jay Earley (Int. J. Parallel Program., 1974)

High Level Iterators and a Method for Automatically Designing Data Structure Representation. - Jay Earley (Comput. Lang., 1976)

An Efficient Context-Free Parsing Algorithm (Reprint). - Jay Earley (Commun. ACM, 1983)