Jay Earley

According to our database, Jay Earley authored at least 11 papers between 1968 and 1983.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1983

An Efficient Context-Free Parsing Algorithm (Reprint).

Jay Earley

Commun. ACM, 1983

1976

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

Jay Earley

Comput. Lang., 1976

1974

Syntax extension using a run time model.

Jay Earley

Int. J. Parallel Program., 1974

Ambiguity and Precedence in Syntax Description.

Jay Earley

Acta Informatica, 1974

High level operations in automatic programming.

Jay Earley

Proceedings of the ACM SIGPLAN Symposium on Very High Level Languages, 1974

1973

Relational Level Data Structures for Programming Languages

Jay Earley

Acta Informatica, 1973

1972

A Method for Incrementally Compiling Languages with Nested Statement Structure.

Jay Earley, Paul Caizergues

Commun. ACM, 1972

1971

Toward an Understanding of Data Structures.

Jay Earley

Commun. ACM, 1971

1970

A formalism for translator interactions.

Jay Earley, Howard E. Sturgis

Commun. ACM, 1970

An Efficient Context-Free Parsing Algorithm.

Jay Earley

Commun. ACM, 1970

1968

R68-46 Use of Transition Matrices in Compiling.

Jay Earley

IEEE Trans. Computers, 1968