An Iteration Theorem for Simple Precedence Languages

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An Iteration Theorem for Simple Precedence Languages

Full text

Pdf (720 KB)

Source

Journal of the ACM (JACM) archive
Volume 30 , Issue 4 (October 1983) table of contents

Pages: 820 - 833

Year of Publication: 1983

ISSN:0004-5411

Authors

Yael Krevner	Computer Science Department, Tel-Aviv University, Tel-Aviv 69978, Israel
Amiram Yehudai	Computer Science Department, Tel-Aviv University, Tel-Aviv 69978, Israel

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 23, Citation Count: 0

Additional Information:

references 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/2157.322408 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	Alfred V. Aho , Jeffrey D. Ullman, The Theory of Parsing, Translation, and Compiling, Prentice Hall Professional Technical Reference, 1972
	2	Alfred V. Aho , Jeffrey D. Ullman, Theory of Parsing, Translation and Compiling, Prentice Hall Professional Technical Reference, 1973
	3	BAR-HRt~L, Y., Pmtt~s, M., xND SrL~M}R, E.On formal properties of simple phrase structure grammars. Z. Phonetik Sprachwlss. Kommumkat 14 (1961), 143-172
	4	BF.~Tr~, J.C.Two iteration theorems for the LL(k) languages. Theor. Comput. Sc~ 12 (1980), 193-228.
	5	BOASSON, L.Two iteration theorems for some families of languages. J. Comput. Syst. Scl. 7 (1973), 583-596.
	6	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]
	7	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]
	8	GRA~, S.L. Extended precedence languages, bounded right context languages and determimsuc languages. In Conf. Rec l lth IEEE Syrup. on Switching and Automata Theory (Santa Monica, Calif, 1970), IEEE, New York, pp. 175-180.
	9	M.A. A. Harrison , M. A. Harrison, Introduction to Formal Language Theory, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1978
	10	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 [doi>10.1145/321850.321851]
	11	KaNO, K.N. Iteration theorems for famdies of strict deterministic languages. Theor. Comp. Sc~. I0 (1980), 317-333.
	12	KRe~, Y.An iteration theorem for simple precedence languages. Master's thesis, Tel-Aviv Univ., Tel-Aviv, Israel, 1981.
	13	O6D~N, W.F.lntercalauon theorems for pushdown store and stack languages. Ph.D. dissertation, Stanford Univ., Stanford, Calif., 1968
	14	OoI)Elq, W.F.A helpful result for proving inherent ambiguity Math. Systems Theory 2 (1968), 191-194.
	15	ROSF.i~KRAN'rz, D.I., L~wIs, P.M., AND Sa'EAR~S, R E.A simple language which is not a precedence language Unpublished manuscript, 1968.
	16	SLrDBOROUOH, I.H. Private communicaUon, 1979.
	17	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]
	18	YEHUDAI, A.A new def'midon for stmple precedence grammars. BIT 19 (1979), 282-284.