Understanding the bottom-up SLR parser

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Understanding the bottom-up SLR parser

Full text

Pdf (501 KB)

Source

Technical Symposium on Computer Science Education archive
Proceedings of the twenty-fifth SIGCSE symposium on Computer science education table of contents

Phoenix, Arizona, United States

Pages: 339 - 343

Year of Publication: 1994

ISBN:0-89791-646-8

Also published in ...

Authors

Sami Khuri	Department of Mathematics and Computer Science, San José State University, One Washington Square, SAn José, CA
Jason Williams	Department of Mathematics and Computer Science, San José State University, One Washington Square, SAn José, CA

Sponsor

SIGCSE: ACM Special Interest Group on Computer Science Education

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 18, Downloads (12 Months): 56, Citation Count: 3

Additional Information:

abstract 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/191029.191163 What is a DOI?

ABSTRACT

This paper describes an application of one of the important abstract concepts taught in a compiler construction course. It demonstrates how the techniques behind the bottom-up SLR parser can be used to perform computer animation. The different phases of the implementation presented are identical to the ones used by the traditional compiler for parsing source codes written in high-level languages. This application can be used either to explain the different phases of the traditional compiler, or as an illustration of the bottom-up SLR parsing techniques applied in a non-traditional environment.

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.

	Aho86	Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	Blin87	Blinn, J. "Nested Transformations and Blobby Man." IEEE Computer Graphics &Applications. October 1987: 59-65.
	Clar93	Matthew C. Clarke, Possible models diagrams: a visual alternative to truth tables, ACM SIGCSE Bulletin, v.25 n.1, p.232-236, March 1993
	Hill90	Francis S. Hill , John Griffin, Computer Graphics, Simon & Schuster, 1990
	Ho93	Chi Fai Ho , Christopher L. Morgan , Istvan Simon, An advanced classroom computing environment and its applications, ACM SIGCSE Bulletin, v.25 n.1, p.228-231, March 1993
	John75	Johnson, S. C. "YACC--yet another compiler-compiler." C.S. Tech. Report no. 32., Murray Hill, N.J., Bell Telephone Laboratories, 1975.
	Khur86	Sami Khuri, Counting nodes in binary trees, ACM SIGCSE Bulletin, v.18 n.1, p.182-185, February 1986
	Pars92	Thomas W. Parsons, Introduction to compiler construction, Computer Science Press, Inc., New York, NY, 1992
	Wells93	Drew Wells , Chris Young, Ray tracing creations generate 3-D photorealistic images on the PC, Waite Group Press, Corte Madera, CA, 1993

CITED BY 3

	Mona E. Lovato , Michael F. Kleyn, Parser visualizations for developing grammars with yacc, ACM SIGCSE Bulletin, v.27 n.1, p.345-349, March 1995
	Sami Khuri , Yanti Sugono, Animating parsing algorithms, ACM SIGCSE Bulletin, v.30 n.1, p.232-236, Mar. 1998
	Sami Khuri , Jason Williams, Neuralis: an artificial neural network package, ACM SIGCSE Bulletin, v.28 n.SI, p.25-27, 1996