Algorithm 265: find precedence functions [L2]

Authors:
Niklaus Wirth
Affiliations:
Stanford Univ., Stanford, CA
Venue:
Communications of the ACM
Year:
1965

Citing 2
Cited 3

Serial Correlation in the Generation of Pseudo-Random Numbers

Journal of the ACM (JACM)
Algorithm 133: Random

Communications of the ACM

A Boolean matrix method for the computation of linear precedence functions

Communications of the ACM
A new method for determining linear precedence functions for precedence grammars

Communications of the ACM
The use of PASCAL as a teaching tool in introductory, intermediate and advanced computer science courses

SIGCSE '78 Papers of the SIGCSE/CSA technical symposium on Computer science education

Quantified Score

Hi-index	48.25

Visualization

Abstract