The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Syntactic Analysis and Operator Precedence
Open accessAbstract
Syntactic Analysis and Operatm• Precedence*RoBERT "\V.FLoYD libstmct.Three increasingly restricted types of formal grammar are phrase structure grammars, operator grammars and precedence grammars.Precedence grammars form models of mathematical and algorithmic languages which may Le analyzed mechanically by a simple procedure based on a matrix representation of a relation between character pairs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On certain formal properties of grammars
Chomsky, N. (1959) · Information and Control · doi:10.1016/s0019-9958(59)90362-6 · Cited by 1,588
An algorithm for coding efficient arithmetic operations
Floyd, R. W. (1961) · Communications of the ACM · doi:10.1145/366062.366082 · Cited by 29
Self-citation
Cited by
On the translation of languages from left to right
Knuth, D. E. (1965) · Information and Control · doi:10.1016/s0019-9958(65)90426-2 · Cited by 780
Atchison, W. F., Conte, S. D., Hamblen, J. W., Hull, T. E., Keenan, T. A., Kehl, W. B., McCluskey, E. J., Navarro, S. O., Rheinboldt, W. C., Schweppe, E. J., et al. (1968) · Communications of the ACM · doi:10.1145/362929.362976 · Cited by 468
(1968) · doi:10.1007/978-1-4615-9050-7_2 · Cited by 395
Grune, D., & Jacobs, C. J. H. (2008) · Monographs in Computer Science · doi:10.1007/978-0-387-68954-8 · Cited by 290
Colmerauer, A., & Roussel, P. (1993) · The second ACM SIGPLAN conference on History of programming languages · doi:10.1145/154766.155362 · Cited by 108
“Alain had a preference for this method, introduced by Robert Floyd [1967] to process nondeterministic languages, and was teaching it to all his students.”
ResultInfluential
Metadata
- Authors
- Floyd, R. W.
- Venue
- Journal of the ACM
- Published
- 1963-07
- Volume
- 10
- Issue
- 3
- Pages
- 316-333
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2097033551
- Cited by
- 253
- References
- 2
- FWCI
- 10.60
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.