Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.
VLDB 2026 Research / reviewers in the wild / expert

Jay Earley

dblp:90/6907 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1976
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 77% Programming languages and type systems · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization
parsing		 0.011968
R68-46 Use of Transition Matrices in Compiling · IEEE Trans. Computers 1968
Programming languages and type systems › grammar formalisms
context-free grammar		 0.011968
R68-46 Use of Transition Matrices in Compiling · IEEE Trans. Computers 1968

Methods — techniques the papers use, named apart from their topics

transition matrices · 0.0
YearPublicationVenuePosition
1976 High Level Iterators and a Method for Automatically Designing Data Structure Representation
Jay Earley
 Comput. Lang.1
1974 Ambiguity and Precedence in Syntax Description
Jay Earley
 Acta Informatica1
1973 Relational Level Data Structures for Programming Languages
Jay Earley
 Acta Informatica1
1968 R68-46 Use of Transition Matrices in Compiling
abstract
Since BNF (context-free) grammars have been found so useful in describing the syntax of programming languages, a large number of parsing algorithms for context-free grammars have been developed for use in compilers and compiler-writing systems. A significant class of these algorithms have the following properties.
Jay Earley
 IEEE Trans. Computers1