 | 1983 |
|---|
| 10 |       | Jay Earley:
An Efficient Context-Free Parsing Algorithm (Reprint).
Commun. ACM 26(1): 57-61 (1983) |
| 1976 |
|---|
| 9 | | Jay Earley:
High Level Iterators and a Method for Automatically Designing Data Structure Representation.
Comput. Lang. 1(4): 321-342 (1976) |
| 1974 |
|---|
| 8 | | Jay Earley:
Ambiguity and Precedence in Syntax Description.
Acta Inf. 4: 183-192 (1974) |
| 7 | | Jay Earley:
Syntax extension using a run time model.
International Journal of Parallel Programming 3(3): 189-196 (1974) |
| 1973 |
|---|
| 6 |  | Jay Earley:
Relational Level Data Structures for Programming Languages
Acta Inf. 2: 293-309 (1973) |
| 1972 |
|---|
| 5 | | Jay Earley,
Paul Caizergues:
A Method for Incrementally Compiling Languages with Nested Statement Structure.
Commun. ACM 15(12): 1040-1044 (1972) |
| 1971 |
|---|
| 4 | | Jay Earley:
Toward an Understanding of Data Structures.
Commun. ACM 14(10): 617-627 (1971) |
| 1970 |
|---|
| 3 | | Jay Earley:
Toward an Understanding of Data Structures.
SIGFIDET Workshop 1970: 1-40 |
| 2 | | Jay Earley,
Howard E. Sturgis:
A formalism for translator interactions.
Commun. ACM 13(10): 607-617 (1970) |
| 1 | | Jay Earley:
An Efficient Context-Free Parsing Algorithm.
Commun. ACM 13(2): 94-102 (1970) |
Data released under the ODC-BY 1.0 license — See also our legal information page