[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

Program control via transition matrices: a novel application of micro-programming

Published: 01 March 1976 Publication History

Abstract

The problem of processing and interpreting character-strings in a systematic, efficiently implementable manner has given rise to a variety of decision-(or transition-) table and transition-diagram techniques. These have been used in the design and/or coding of string-oriented processors, such as lexical analysis protions of compilers. All these techniques share in common the idea of an input driven transition control.This report describes a micro-coded implementation fo a particularly rich concept--the transition matrix (TM). The micro-coded interpreter (ITM) executes the flow-of-control implicit within the structure of the TM. The TM may be coded in a natural, easy to use language (LTMφSP), and then be automatically translated into ITM-usable form by a user-level translator called TMφSP. The completed system (ITM and TMφSP) permits TM-oriented decision-making techniques to be utilized in virtually any task that can be described by means of transition matrix.

References

[1]
Aho, Alfred, V. and Jeffrey D. Ullman. The Theory of Parsing, Translation and Compiling; Volume 1 (Parsing). Prentice-Hall, (1972).
[2]
Conway, Melvin E. Design of a separable transition-diagram compiler, Communications of the ACM, Vol. 6, pp. 396--408 (July, 1963).
[3]
Gries, David. Compiler Construction for Digital Computers. John Wiley & Sons, (1971).
[4]
Gries, D., M. Paul, and H. R. Wiegle. "Some techniques used in the ALCOR ILLINOIS 7090", Communications of the ACM, Vol. 8, pp. 496--500 (August, 1965).
[5]
Johnson, W. L. et al. Automatic generation of efficient lexical processors using finite state techniques, Communications of the ACM, Vol. 11, pp. 805--813 (1968).
[6]
Lomet, D. B. A formalization of transition diagram systems, Journal of the ACM Vol. 20, No. 2, pp. 235--257 (April 1973).
[7]
Oliver, S. Ronald and Neil D. Jones. "Transition Matrix Interpreter User's Manual", a Technical Report of the University of Kansas Computer Science Department. To appear soon.
[8]
O'Neill, J. T. MUMPS Development Committee Manuals, National Bureau of Standards
[9]
Samelson, K. and F. L. Bauer. Sequential formula translation, Communications of the ACM, Vol. 3, pp. 76--83 (February, 1960).
[10]
Silberg, Bruce (ed.) SIGPLAN Notice: Special Issue on Decision Tables. Vol. 6, No. 8, (September, 1971).
[11]
Tixier, V. Recursive functions of regular expressions in language analysis, Stanford University Computer Science Technical Report CS-58 (March 1967).
[12]
Wirth, N. PL360, a programming language for the 360 computers, Journal of the ACM, Vol. 15, pp. 37--74 (January 1968).

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGMICRO Newsletter
ACM SIGMICRO Newsletter  Volume 7, Issue 1
March 1976
47 pages
ISSN:1050-916X
DOI:10.1145/1217202
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1976
Published in SIGMICRO Volume 7, Issue 1

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 136
    Total Downloads
  • Downloads (Last 12 months)47
  • Downloads (Last 6 weeks)5
Reflects downloads up to 12 Dec 2024

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media