Weak and Mixed Strategy Precedence Parsing

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Weak and Mixed Strategy Precedence Parsing

Full text

Pdf (979 KB)

Source

Journal of the ACM (JACM) archive
Volume 19 , Issue 2 (April 1972) table of contents

Pages: 225 - 243

Year of Publication: 1972

ISSN:0004-5411

Authors

A. V. Aho	Bell Telephone Laboratories, Inc., 600 Mountain Aveune, Murray Hill, New Jersey
P. J. Denning	Department of Electrical engineering, computer Sciences Laboratory, Princeton University, Princeton, New Jersey
J. D. Ullman	Department of Electrical engineering, computer Sciences Laboratory, Princeton University, Princeton, New Jersey

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 35, 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/321694.321697 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	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]
	2	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]
	3	MCKEEMAN, W.M. An approach to computer language design. Tech. Rep. CS48, Comput. Sci. Dep., Stanford U., Stanford, Calif., 1966.
	4	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 [doi>10.1145/800169.805432]
	5	GRAHAM, S. L. Extended precedence languages, bounded right context languages and deterministic languages. Proc. IEEE llth Annual Symp. on Switching and Automata Theory, Oct. 1970, pp. 175-180.
	6	GRAY, J. N., AND HARRISON, M.A. Single pass precedence analysis. Proc. IEEE 10th Annual Symp. on Switching and Automata Theory, Oct. 1969, pp. 106-117.
	7	GRAY, J.N. Precedence parsers for programming languages. Ph.D. thesis, Dep. of Comput. Sci., U. of California, Berkeley, Calif., Sept. 1969.
	8	J. D. Ichbiah , S. P. Morse, A technique for generating almost optimal Floyd-Evans productions for precedence grammars, Communications of the ACM, v.13 n.8, p.501-508, Aug. 1970 [doi>10.1145/362705.362712]
	9	Alain Colmerauer, Total Precedence Relations, Journal of the ACM (JACM), v.17 n.1, p.14-30, Jan. 1970 [doi>10.1145/321556.321559]
	10	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 [doi>10.1145/363235.363255]
	11	James B. Morris, A result on the relationship between simple precedence languages and reducing transition languages, Proceedings of the second annual ACM symposium on Theory of computing, p.73-80, May 04-06, 1970, Northampton, Massachusetts, United States [doi>10.1145/800161.805152]
	12	Robert W. Floyd, Bounded context syntactic analysis, Communications of the ACM, v.7 n.2, p.62-67, Feb. 1964 [doi>10.1145/363921.363927]
	13	McKEEMAN, W. M., HORNING, J. J., AND WORTMAN, D.S. A Compiler Generator. Prentice- Hall, Englewood Cliffs, N.J., 1970.
	14	KNUTH, D.E. On the translation of languages from left to right. Inform. Contr. 8 (Oct. 1965), 607-639.
	15	GINSBURG, S., AND GREIBACH, S. A. Deterministic context free languages. Inform. Contr. 9 (Dec. 1966), 620-648.
	16	John E. Hopcroft , Jeffrey D. Ullman, Formal languages and their relation to automata, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1969
	17	ARO, A. V., AND ULLMAN, J .D . Precedence parsing procedures. Bell Telephone Labs. Mere., Murray Hill, N.J., 1970.
	18	Peter J. Denning , Jack B. Dennis , Joseph E. Qualitz, Machines, Languages and Computation, Prentice Hall Professional Technical Reference, 1978
	19	Alfred V. Aho , Jeffrey D. Ullman, Theory of Parsing, Translation and Compiling, Prentice Hall Professional Technical Reference, 1973
	20	D. J. Rosenkrantz , R. E. Stearns, Properties of deterministic top down grammars, Proceedings of the first annual ACM symposium on Theory of computing, p.165-180, May 05-07, 1969, Marina del Rey, California, United States [doi>10.1145/800169.805431]
	21	Franklin L. DeRemer, Simple LR(k) grammars, Communications of the ACM, v.14 n.7, p.453-460, July 1971 [doi>10.1145/362619.362625]
	22	HORNING, Z. J., AND LALONDE, W.R. Empirical comparison of LR(k) and precedeRce parsers. TR #1, U. of Toronto Comput. Syst. Res. Group, 1970.
	23	Jay Earley, An efficient context-free parsing algorithm, Communications of the ACM, v.13 n.2, p.94-102, Feb 1970 [doi>10.1145/362007.362035]

CITED BY 10

	Mario Schkolnick, Labelled precedence parsing, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.33-40, October 01-03, 1973, Boston, Massachusetts
	Henry D. Shapiro , M. Dennis Mickunas, A new approach to teaching a first course in compiler construction, ACM SIGCSE Bulletin, v.8 n.1, p.158-166, February 1976
	Mario Schkolnick, The equivalence of reducing transition languages and deterministic languages, Communications of the ACM, v.17 n.9, p.517-520, Sept. 1974
	Ivan M. Havel , Michael A. Harrison, On the Parsing of Deterministic Languages, Journal of the ACM (JACM), v.21 n.4, p.525-548, Oct. 1974
	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
	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 , S. C. Johnson, LR Parsing, ACM Computing Surveys (CSUR), v.6 n.2, p.99-124, June 1974
	James S. Daley, A laboratory approach to teaching compiler writing, ACM SIGCSE Bulletin, v.10 n.1, February 1978
	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
	A V Moura, Early error detection in syntax-driven parsers, IBM Journal of Research and Development, v.30 n.6, p.617-626, Nov. 1986