Thomas J. Pennello

According to our database, Thomas J. Pennello authored at least 8 papers between 1978 and 1990.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of six.

1990

Compiler challenges with RISCs.

Thomas J. Pennello

IEEE Micro, 1990

1986

Very fast LR parsing.

Thomas J. Pennello

Proceedings of the 1986 SIGPLAN Symposium on Compiler Construction, 1986

1982

Efficient Computation of LALR(1) Look-Ahead Sets.

Frank DeRemer, Thomas J. Pennello

ACM Trans. Program. Lang. Syst., 1982

1981

Ada syntax chart.

Frank DeRemer, Thomas J. Pennello, William M. McKeeman

ACM SIGPLAN Notices, 1981

1980

A simplified operator identification scheme for Ada.

Thomas J. Pennello, Frank DeRemer, Richard Meyers

ACM SIGPLAN Notices, 1980

A syntax diagram for (preliminary) Ada.

Frank DeRemer, Thomas J. Pennello, Richard Meyers

ACM SIGPLAN Notices, 1980

1979

Efficient computation of LALR(1) look-ahead sets (with retrospective)

Thomas J. Pennello, Frank DeRemer

Proceedings of the 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999, 1979

1978

A Forward Move Algorithm for LR Error Recovery.

Thomas J. Pennello, Frank DeRemer

Proceedings of the Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978