Syntactic Analysis and Operator Precedence

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Syntactic Analysis and Operator Precedence

Full text

Pdf (880 KB)

Source

Journal of the ACM (JACM) archive
Volume 10 , Issue 3 (July 1963) table of contents

Pages: 316 - 333

Year of Publication: 1963

ISSN:0004-5411

Author

Robert W. Floyd

Computer Associates, Inc., Woburn, Massachusetts

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 14, Downloads (12 Months): 94, Citation Count: 68

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321172.321179 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Edgar T. Irons, A syntax directed compiler for ALGOL 60, Communications of the ACM, v.4 n.1, p.51-55, Jan. 1961 [doi>10.1145/366062.366083]
	2	Robert W. Floyd, An algorithm for coding efficient arithmetic operations, Communications of the ACM, v.4 n.1, p.42-51, Jan. 1961 [doi>10.1145/366062.366082]
	3	CHOMSKY, N. On certain formal properties of grammars. Inform. Contr. 2 (1959), 137-167, 393-395.
	4	BAR-HILLEL, Y., PERLS, M., AND SHAMIR, E. On formal properties of simple phrase structure grammars. Zeit. Phonetik, Sprachwissen. Kommunik. 14 (1961), 143-172.
	5	Peter Naur , J. W. Backus , F. L. Bauer , J. Green , C. Katz , J. McCarthy , A. J. Perlis , H. Rutishauser , K. Samelson , B. Vauquois , J. H. Wegstein , A. van Wijngaarden , M. Woodger, Report on the algorithmic language ALGOL 60, Communications of the ACM, v.3 n.5, p.299-314, May 1960 [doi>10.1145/367236.367262]
	6	Melvin E. Conway, Letters to the editor: ALGOL 60 comment, Communications of the ACM, v.4 n.10, p.465, Oct. 1961 [doi>10.1145/366786.366810]

CITED BY 68

	I. H. Sudborough, On deterministic context-free languages, multihead automata, and the power of an auxiliary pushdown store, Proceedings of the eighth annual ACM symposium on Theory of computing, p.141-148, May 03-05, 1976, Hershey, Pennsylvania, United States
	Jerome Feldman , David Gries, Translator writing systems, Communications of the ACM, v.11 n.2, p.77-113, Feb. 1968
	Niklaus Wirth , Helmut Weber, EULER: a generalization of ALGOL and it formal definition: Part 1, Communications of the ACM, v.9 n.1, p.13-25, Jan. 1966
	Carlos Christensen , Michael Karr, IAM, a system for interactive algebraic manipulation, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, p.115-127, March 23-25, 1971, Los Angeles, California, United States
	Tomlinson G. Rauscher , Ashok K. Agrawala, On the syntax and semantics of horizontal microprogramming languages, Proceedings of the annual conference, p.52-56, August 27-29, 1973, Atlanta, Georgia, United States
	Robert W. Floyd, Bounded context syntactic analysis, Communications of the ACM, v.7 n.2, p.62-67, Feb. 1964
	Jacques Cohen, A view of the origins and development of Prolog, Communications of the ACM, v.31 n.1, p.26-36, Jan. 1988
	David S. Wise, Domolki's algorithm applied to generalized overlap resolvable grammars, Proceedings of the third annual ACM symposium on Theory of computing, p.171-184, May 03-05, 1971, Shaker Heights, Ohio, United States
	James N. Gray , Michael A. Harrison, Canonical Precedence Schemes, Journal of the ACM (JACM), v.20 n.2, p.214-234, April 1973
	A. E. Roberts, Jr., The construction of recognizers, Proceedings of the 1966 21st national conference, p.383-389, January 1966
	Francois Robert Broca , Richard E. Merwin, Direct microprogrammed execution of the intermediate text from a high-level language compiler, ACM SIGPLAN Notices, v.9 n.8, p.145-153, August 1974
	A. V. Aho , S. C. Johnson , J. D. Ullman, Deterministic parsing of ambiguous grammars, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.1-21, October 01-03, 1973, Boston, Massachusetts
	Tomlinson G. Rauscher, Towards a specification of syntax and semantics for languages for horizontally microprogrammed machines, ACM SIGPLAN Notices, v.9 n.8, p.98-112, August 1974
	William F. Atchison , Samuel D. Conte , John W. Hamblen , Thomas E. Hull , Thomas A. Keenan , William B. Kehl , Edward J. McCluskey , Silvio O. Navarro , Werner C. Rheinboldt , Earl J. Schweppe , William Viavant , David M. Young, Jr., Curriculum 68: Recommendations for academic programs in computer science: a report of the ACM curriculum committee on computer science, Communications of the ACM, v.11 n.3, p.151-197, March 1968
	Vaughan R. Pratt, Top down operator precedence, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.41-51, October 01-03, 1973, Boston, Massachusetts
	H. A. Maurer , A. Salomaa , D. Wood, A Supernormal-Form Theorem for Context-Free Grammars, Journal of the ACM (JACM), v.30 n.1, p.95-102, Jan. 1983
	Eberhard Bertsch, The storage requirement in precedence parsing, Communications of the ACM, v.20 n.3, p.192-194, March 1977
	Paul W. Abrahams, A final solution to the Dangling else of ALGOL 60 and related languages, Communications of the ACM, v.9 n.9, p.679-682, Sept. 1966
	A. V. Aho , S. C. Johnson , J. D. Ullman, Deterministic parsing of ambiguous grammars, Communications of the ACM, v.18 n.8, p.441-452, Aug. 1975
	T. V. Griffiths , S. R. Petrick, On the relative efficiencies of context-free grammar, Communications of the ACM, v.8 n.5, p.289-300, May 1965
	Bruce W. Arden , Bernard A. Galler , Robert M. Graham, The MAD definition facility, Communications of the ACM, v.12 n.8, p.432-439, Aug. 1969
	Stephen H. Unger, A global parser for context-free phrase structure grammars, Communications of the ACM, v.11 n.4, p.240-247, April 1968
	P. G. Moulton , M. E. Muller, DITRAN—a compiler emphasizing diagnostics, Communications of the ACM, v.10 n.1, p.45-52, Jan. 1967
	H. B. Hunt, III , J. D. Ullman , T. G. Szymanski, Operations on sparse relations, Communications of the ACM, v.20 n.3, p.171-176, March 1977
	Francois Robert Broca , Richard E. Merwin, Direct microprogrammed execution of the intermediate text from a high-level language compiler, Proceedings of the annual conference, p.57-63, August 27-29, 1973, Atlanta, Georgia, United States
	Jacques Loeck, An algorithm for the construction of bounded-context parsers, Communications of the ACM, v.13 n.5, p.297-307, May 1970
	Bruce W. Arden, The role of programming in a Ph.D. computer science program, Communications of the ACM, v.12 n.1, p.31-37, Jan. 1969
	C. Christensen, Programming Languages for Non-Numeric Processing—1: examples of symbol manipulation in the AMBIT Programming Language, Proceedings of the 1965 20th national conference, p.247-261, August 24-26, 1965, Cleveland, Ohio, United States
	D. Gries , M. Paul , H. R. Wiehle, Some techniques used in the ALCOR ILLINOIS 7090, Communications of the ACM, v.8 n.8, p.496-500, Aug. 1965
	David F. Martin, A Boolean matrix method for the computation of linear precedence functions, Communications of the ACM, v.15 n.6, p.448-454, June 1972
	Alfred V. Aho , Jeffrey D. Ullman, A technique for speeding up LR(k) parsers, Proceedings of the fourth annual ACM symposium on Theory of computing, p.251-263, May 01-03, 1972, Denver, Colorado, United States
	James N. Gray , Michael A. Harrison, On the Covering and Reduction Problems for Context-Free Grammars, Journal of the ACM (JACM), v.19 n.4, p.675-698, Oct. 1972
	A. V. Aho , P. J. Denning , J. D. Ullman, Weak and Mixed Strategy Precedence Parsing, Journal of the ACM (JACM), v.19 n.2, p.225-243, April 1972
	M. D. Mickunas , R. L. Lancaster , V. B. Schneider, Transforming LR(k) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars, Journal of the ACM (JACM), v.23 n.3, p.511-533, July 1976
	Alain Colmerauer, Total Precedence Relations, Journal of the ACM (JACM), v.17 n.1, p.14-30, Jan. 1970
	S. Crespi-Reghizzi , R. Morpurgo, A language for treating graphs, Communications of the ACM, v.13 n.5, p.319-323, May 1970
	Robert G. Trout, A compiler—compiler system, Proceedings of the 1967 22nd national conference, p.317-322, January 1967, Washington, D.C., United States
	David F. Martin, Programming Languages: Boolean matrix methods for the detection of simple precedence grammars, Communications of the ACM, v.11 n.10, p.685-687, Oct. 1968
	J. C. Boussard, An ALGOL compiler: construction and use in relation to an elaborate operating system, Communications of the ACM, v.9 n.3, p.179-182, March 1966
	G. Salton, Information science in a Ph.D. computer science program, Communications of the ACM, v.12 n.2, p.111-117, Feb. 1969
	J. D. Bunda , J. A. Gerth, APL two by two-syntax analysis by pairwise reduction, ACM SIGAPL APL Quote Quad, v.14 n.4, p.85-94, June 1984
	Arnold L. Rosenberg, On the Independence of Real-Time Definability and Certain Structural Properties of Context-Free Languages, Journal of the ACM (JACM), v.15 n.4, p.672-679, Oct. 1968
	Yael Krevner , Amiram Yehudai, An Iteration Theorem for Simple Precedence Languages, Journal of the ACM (JACM), v.30 n.4, p.820-833, Oct. 1983
	James R. Bell, A new method for determining linear precedence functions for precedence grammars, Communications of the ACM, v.12 n.10, p.567-569, Oct. 1969
	Alain Colmerauer , Philippe Roussel, The birth of Prolog, ACM SIGPLAN Notices, v.28 n.3, p.37-52, March 1993
	I. H. Sudborough, On the Tape Complexity of Deterministic Context-Free Languages, Journal of the ACM (JACM), v.25 n.3, p.405-414, July 1978
	Harold W. Lawson , David R. Doucette, A translation machine with automated top-down parsing, ACM SIGPLAN Notices, v.11 n.2, p.20-29, February 1976
	Biographies, IEEE Annals of the History of Computing, v.26 n.2, p.75-83, April 2004
	Sheila A. Greibach, A New Normal-Form Theorem for Context-Free Phrase Structure Grammars, Journal of the ACM (JACM), v.12 n.1, p.42-52, Jan. 1965
	Michael J. Fischer, Some properties of precedence languages, Proceedings of the first annual ACM symposium on Theory of computing, p.181-190, May 05-07, 1969, Marina del Rey, California, United States
	A. V. Aho , S. C. Johnson, LR Parsing, ACM Computing Surveys (CSUR), v.6 n.2, p.99-124, June 1974
	David Gries, Use of transition matrices in compiling, Communications of the ACM, v.11 n.1, p.26-34, Jan. 1968
	J. J. Horning , W. R. Lalonde, Empirical comparison of LR(k) and precedence parsers, ACM SIGPLAN Notices, v.5 n.11, November 1970
	James A. Brown, A development of APL2 syntax, IBM Journal of Research and Development, v.29 n.1, p.37-48, January 1985
	D. J. Cooke, On non-hierachical systems of binary operators, ACM SIGACT News, v.15 n.3, p.36-44, Summer-Fall 1983
	Alain Colmerauer , Philippe Roussel, The birth of Prolog, History of programming languages---II, ACM Press, New York, NY, 1996
	S. Crespi-Reghizzi , M. A. Melkanoff , L. Lichten, The use of grammatical inference for designing programming languages, Communications of the ACM, v.16 n.2, p.83-90, Feb. 1973
	Jacques Cohen, A tribute to Alain Colmerauer, Theory and Practice of Logic Programming, v.1 n.6, p.637-646, November 2001
	W. M. McKeeman , J. J. Horning , E. C. Nelson , D. B. Wortman, The XPL compiler generator system, Proceedings of the December 9-11, 1968, fall joint computer conference, part I, December 09-11, 1968, San Francisco, California
	Sean McDirmid, Living it up with a live programming language, ACM SIGPLAN Notices, v.42 n.10, October 2007
	Robert M. Graham, Bounded context translation, Proceedings of the April 21-23, 1964, spring joint computer conference, April 21-23, 1964, Washington, D.C.
	T. E. Cheatham, Jr. , Kirk Sattley, Syntax-directed compiling, Proceedings of the April 21-23, 1964, spring joint computer conference, April 21-23, 1964, Washington, D.C.
	Robert M. McClure, An appraisal of compiler technology, Proceedings of the November 16-18, 1971, fall joint computer conference, November 16-18, 1971, Las Vegas, Nevada
	T. E. Cheatham, Jr., The introduction of definitional facilities into higher level programming languages, Proceedings of the November 7-10, 1966, fall joint computer conference, November 07-10, 1966, San Francisco, California
	Victor Schneider, A system for designing fast programming language translators, Proceedings of the May 14-16, 1969, spring joint computer conference, May 14-16, 1969, Boston, Massachusetts
	T. E. Cheatham, Jr. , A. Fischer , P. Jorrand, On the basis for ELF: an extensible language facility, Proceedings of the December 9-11, 1968, fall joint computer conference, part II, December 09-11, 1968, San Francisco, California
	J. D. Ullman, Applications of language theory to compiler design, Proceedings of the November 16-18, 1971, fall joint computer conference, November 16-18, 1971, Las Vegas, Nevada
	Olivier Danvy , Kevin Millikin, Refunctionalization at work, Science of Computer Programming, v.74 n.8, p.534-549, June, 2009