ACM

Communications of the ACM

Home/Magazine Archive/January 1971 (Vol. 14, No. 1)/Comment on the conversion of decision tables to computer.../Abstract

Comment on the conversion of decision tables to computer programs

By Solomon L. Pollack
Communications of the ACM, January 1971, Vol. 14 No. 1, Page 52
10.1145/362452.362514
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

In their article [2] C. R. Muthukrishnan and V. Rajaraman have developed two excellent algorithms for conversion of limited entry and mixed entry decision tables to computer programs. I must, however, take issue with their contention that “…in general, the conditions may be very complicated and a compile time analysis will not be possible.” They then cite the following example in Figure 1(b).

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.