Matthew M. Geller

According to our database, Matthew M. Geller authored at least 10 papers between 1973 and 1978.

Collaborative distances:

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

1978

Test Data as an Aid in Proving Program Correctness.

Matthew M. Geller

Commun. ACM, 1978

1977

Economy of Description by Parsers, DPDA'S, and PDA'S.

Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman

Theor. Comput. Sci., 1977

On LR<i>(k)</i> Grammars and Languages.

Matthew M. Geller, Michael A. Harrison

Theor. Comput. Sci., 1977

Characteristic Parsing: A Framework for Producing Compact Deterministic Parsers, II.

Matthew M. Geller, Michael A. Harrison

J. Comput. Syst. Sci., 1977

Characteristic Parsing: A Framework for Producing Compact Deterministic Parsers, I.

Matthew M. Geller, Michael A. Harrison

J. Comput. Syst. Sci., 1977

1976

Normal forms of deterministic grammars.

Matthew M. Geller, Michael A. Harrison, Ivan M. Havel

Discret. Math., 1976

1975

Economy of Descriptions by Parsers, DPDA's, and PDA's

Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman

Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1974

Production Prefix Parsing (Extended Abstract).

Matthew M. Geller, Susan L. Graham, Michael A. Harrison

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1973

Strict Deterministic Versus LR(0) Parsing.

Matthew M. Geller, Michael A. Harrison

Proceedings of the Conference Record of the ACM Symposium on Principles of Programming Languages, 1973

Characterizations of LR(0) Languages (Extended Abstract)

Matthew M. Geller, Michael A. Harrison

Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973