Some suggestions for the use of tables in compilers

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Some suggestions for the use of tables in compilers

Full text

Pdf (136 KB)

Source

ACM SIGPLAN Notices archive
Volume 41 , Issue 2 (February 2006) table of contents

COLUMN: Technical correspondence table of contents

Pages: 29 - 33

Year of Publication: 2006

ISSN:0362-1340

Author

Mike Murphy

SGI (Silicon Graphics Inc)

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 16, Citation Count: 0

Additional Information:

abstract references index terms

Tools and Actions:	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/1137933.1137938 What is a DOI?

ABSTRACT

It is common practice in compilers to use tables to represent data, and then automatically generate code based on those tables (often known as "table-driven code"). Many compilers use machine description tables from which is automatically generated parts of the code generator, and there are often small pieces of table-driven code within a compiler. Sometimes these tables are very useful, but other times the tables themselves can become a maintenance nightmare. This paper uses examples from several SGI compilers to try and enumerate some guidelines for designing good tables and table-driven code.

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	C. A. R. Hoare, Hints on programming language design., Stanford University, Stanford, CA, 1973
	2	http://open64.sourceforge.net/.
	3	D. L. Parnas, On the criteria to be used in decomposing systems into modules, Communications of the ACM, v.15 n.12, p.1053-1058, Dec. 1972 [doi>10.1145/361598.361623]