Jay Earley

发表

A method for incrementally compiling languages with nested statement structure

Jay Earley, Paul Caizergues, J. Earley, 1972, Commun. ACM.

Relational level data structures for programming languages

Jay Earley, J. Earley, 1973, Acta Informatica.

An efficient context-free parsing algorithm

Jay Earley, J. Earley, 1970, CACM.

FORMULA ALGOL MANUAL

Jay Earley, 1967 .

The implementation of formula ALGOL in FSL

Renato Iturriaga, Jay Earley, Tim Standish, 1966 .

An efficient context-free parsing algorithm

Jay Earley, J. Earley, 1970, Commun. ACM.

High Level Iterators and a Method for Automatically Designing Data Structure Representation

Jay Earley, J. Earley, 1976, Comput. Lang..

An overview of the vers2 project: high-level languages in automatic programming

Jay Earley, 1973 .

Toward an understanding of data structures

Jay Earley, J. Earley, 1971, SIGFIDET '70.

High level operations in automatic programming

Jay Earley, 1974 .

A formalism for translator interactions

Jay Earley, Howard E. Sturgis, J. Earley, 1970, CACM.

Toward an understanding of data structures

Jay Earley, 1970 .

An efficient context-free parsing algorithm

Jay Earley, J. Earley, 1970, Commun. ACM.

Ambiguity and precedence in syntax description

Jay Earley, J. Earley, 1975, Acta Informatica.

Syntax extension using a run time model

Jay Earley, 2004, International Journal of Computer & Information Sciences.