Total Precedence Relations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Total Precedence Relations

Full text

Pdf (1.19 MB)

Source

Journal of the ACM (JACM) archive
Volume 17 , Issue 1 (January 1970) table of contents

Pages: 14 - 30

Year of Publication: 1970

ISSN:0004-5411

Author

Alain Colmerauer

Université de Montréal, Département d'Informatique, Québec, Canada

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 23, Citation Count: 9

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/321556.321559 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	COLMERAUER, A. Pr6c6dence, analyse syntaxique et langages de programmation. Thesis, U. de Grenoble, Grenoble, France, Sept. 1967.
	2	Robert W. Floyd, Syntactic Analysis and Operator Precedence, Journal of the ACM (JACM), v.10 n.3, p.316-333, July 1963 [doi>10.1145/321172.321179]
	3	GINSBURG, S., AND GREIBACH, S. 1)eterministic context-free languages. Inform. Contr. 9 (Dec. 1966), 620-648.
	4	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 [doi>10.1145/364914.364943]
	5	PAIR, C. Arbres, piles et compilation. Rev. Franc. Trait. Inf. 7, 3 (1964), 199-216.
	6	Stephen Warshall, A Theorem on Boolean Matrices, Journal of the ACM (JACM), v.9 n.1, p.11-12, Jan. 1962 [doi>10.1145/321105.321107]
	7	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 [doi>10.1145/365153.365162]
	8	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]

CITED BY 9

	Kou-Chung Tai, Noncanonical SLR(1) Grammars, ACM Transactions on Programming Languages and Systems (TOPLAS), v.1 n.2, p.295-320, Oct. 1979
	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
	Jacques Cohen, A view of the origins and development of Prolog, Communications of the ACM, v.31 n.1, p.26-36, Jan. 1988
	Alain Colmerauer , Philippe Roussel, The birth of Prolog, ACM SIGPLAN Notices, v.28 n.3, p.37-52, March 1993
	C. Duong-Kien , H.-J. Hoffman , D. Muth, A improvement to Martin's algorithm for computation of linear precedence functions, Communications of the ACM, v.19 n.10, p.576-577, Oct. 1976
	L. Presser , J. McAfee, An Algorithm for the Design of Simple Precedence Grammars, Journal of the ACM (JACM), v.19 n.3, p.385-395, July 1972
	Alain Colmerauer , Philippe Roussel, The birth of Prolog, History of programming languages---II, ACM Press, New York, NY, 1996
	Jacques Cohen, A tribute to Alain Colmerauer, Theory and Practice of Logic Programming, v.1 n.6, p.637-646, November 2001
	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