article

Free access

Use of transition matrices in compiling

Author:

David GriesAuthors Info & Claims

Communications of the ACM, Volume 11, Issue 1

Pages 26 - 34

https://doi.org/10.1145/362851.362872

Published: 01 January 1968 Publication History

PDF eReader

References

[1]

BAYER, R., MURPHREE, E., JR., AND GRIES, D. User's manual for the ALCOR-ILIINOIS 7090 ALGOL-60 Translator, 2nd ed. U. of Illinois, Urbana, Ill. (Sept 1964).

Google Scholar

[2]

CONWAY, M. E. Design of a separable transition-diagram compiler. Comm. ACM 6 (July 1963), 396-408.

Digital Library

Google Scholar

[3]

EICKEL, J., PAUL, M., BAUER, F. L., AND SAMELSON, K. A syntax controlled generator of formal language processors. Comm. ACM 6 (Aug. 1963), 451-455.

Digital Library

Google Scholar

[4]

FELDMAN, J. A. A formal semantics for computer languages and its application in a compiler-compiler. Comm. ACM 9 (Jan. 1966), 3-9.

Digital Library

Google Scholar

[5]

------, AND GRIES, D. Translator writing systems. Comm, ACM 12 (Feb, 1968), in press.

Digital Library

Google Scholar

[6]

FLOYD, R. W. Syntactic analysis and operator precedence. J. ACM 10 (July 1963), 316-333.

Digital Library

Google Scholar

[7]

Bounded contex syntactic analysis, Comm. ACM 7 (Feb, 1964), 62-47.

Digital Library

Google Scholar

[8]

GRIES, D. The use of transition matrices in compiling. Tech. Rep. No. CS 57, Computer Science Dept., Stanford U., Stanford, Calif., March 17, 1967.

Digital Library

Google Scholar

[9]

PAUL, M., AND WIEHLE, H. R. Some techniques used in the ALCOR-ILLINOIS 7090. Cumm. ACM 8 (Aug. 1965), 496-500.

Digital Library

Google Scholar

[10]

HILL, V., LANGMAACK, H., SCHWARZ, H. R., AND SEEGMULLER, G. Efficient handling of subscripted variables in ALGOL 60 compilers. Proc. 1962 Rome Symposium on Symbolic Languages in Data Processing, Gordon and Breach, New York, 1962, pp. 311-340.

Google Scholar

[11]

NAUH, P. (ED.). Report on the algorithmic language ALGOL 60 60. Numer. Math. 2 (1960), 196-136; Comm. ACM 5 (May 1960), 299-314,

Digital Library

Google Scholar

[12]

Revised report on the algorithmic language ALCOL 60 Comm. ACM 6 (Jan. 1963), 1-17.

Digital Library

Google Scholar

[13]

SAMELSON, K., AND BAUER, F. L. Sequential formula translation. Comm. ACM 3 (Feb. 1960), 76-83.

Digital Library

Google Scholar

[14]

TIXIER, V., Recursive functions of regular expressions in language, analysis, Tech. Rep, CS 58, Computer Science Dept., Stanford U., Stanford Calif., March 1967.

Google Scholar

[15]

WIRTH, N., AND WERER, H. EULER: A generalization of ALCOL, and its formal definition, Part I, Comm. ACM 2 (Jan. 1966), 13-25.

Digital Library

Google Scholar

[16]

Burroughs B-5500 Information Processing Systems Extended ALCOL Language Manual.

Google Scholar

Cited By

View all

Layzell PTriance J(2006)Syntax driven COBOL compilers—an assessmentSoftware: Practice and Experience10.1002/spe.438013120513:12(1141-1155)Online publication date: 30-Oct-2006
https://doi.org/10.1002/spe.4380131205
Hua-Thanh-Huy (2005)Conception et optimisation des descentes recursivesInternational Symposium on Programming10.1007/3-540-09981-6_12(162-176)Online publication date: 26-May-2005
https://doi.org/10.1007/3-540-09981-6_12
van den Bosch P(1992)A bibliography on syntax error handling in context free languagesACM SIGPLAN Notices10.1145/131080.13109027:4(77-86)Online publication date: 1-Apr-1992
https://dl.acm.org/doi/10.1145/131080.131090
Show More Cited By

Use of transition matrices in compiling
1. Theory of computation
  1. Formal languages and automata theory

Recommendations

The restriction language for computer grammars of natural language

Over the past few years, a number of systems for the computer analysis of natural language sentences have been based on augmented context-free grammars: a context-free grammar which defines a set of parse trees for a sentence, plus a group of ...
The use of transition matrices in compiling
How features resolve syntactic ambiguity
SIGIR '71: Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval

Ambiguity is a pervasive and important aspect of natural language. Ambiguities, which are disambiguated by context, contribute powerfully to the expressiveness of natural language as compared to formal languages. In computational systems using natural ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 11, Issue 1

Jan. 1968

58 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/362851

Editor:
Gerard Salton
Cornell Univ., Ithaca, NY

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1968

Published in CACM Volume 11, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
489
Total Downloads

Downloads (Last 12 months)124
Downloads (Last 6 weeks)22

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Layzell PTriance J(2006)Syntax driven COBOL compilers—an assessmentSoftware: Practice and Experience10.1002/spe.438013120513:12(1141-1155)Online publication date: 30-Oct-2006
https://doi.org/10.1002/spe.4380131205
Hua-Thanh-Huy (2005)Conception et optimisation des descentes recursivesInternational Symposium on Programming10.1007/3-540-09981-6_12(162-176)Online publication date: 26-May-2005
https://doi.org/10.1007/3-540-09981-6_12
van den Bosch P(1992)A bibliography on syntax error handling in context free languagesACM SIGPLAN Notices10.1145/131080.13109027:4(77-86)Online publication date: 1-Apr-1992
https://dl.acm.org/doi/10.1145/131080.131090
Sheraga RGieser JEckhouse D(1981)Automatic microcode generation for horizontally microprogrammed processorsProceedings of the 14th annual workshop on Microprogramming10.5555/800075.802447(154-168)Online publication date: 1-Dec-1981
https://dl.acm.org/doi/10.5555/800075.802447
Sheraga RGieser J(1981)Automatic microcode generation for horizontally microprogrammed processorsACM SIGMICRO Newsletter10.1145/1014192.80244712:4(154-168)Online publication date: 1-Dec-1981
https://dl.acm.org/doi/10.1145/1014192.802447
Cheatham TKurtz T(1981)BASIC SessionHistory of Programming Languages10.1016/B978-0-12-745040-7.50016-8(515-549)Online publication date: 1981
https://doi.org/10.1016/B978-0-12-745040-7.50016-8
Fischer CMilton DQuiring S(1980)Efficient LL(1) error correction and recovery using only insertionsActa Informatica10.1007/BF0026399013:2(141-154)Online publication date: 1-Feb-1980
https://dl.acm.org/doi/10.1007/BF00263990
Pleban U(1979)The use of transition matrices in a recursive-descent compilerACM SIGPLAN Notices10.1145/872732.80696414:8(144-151)Online publication date: 1-Aug-1979
https://dl.acm.org/doi/10.1145/872732.806964
Pleban UJohnson S(1979)The use of transition matrices in a recursive-descent compilerProceedings of the 1979 SIGPLAN symposium on Compiler construction10.1145/800229.806964(144-151)Online publication date: 6-Aug-1979
https://dl.acm.org/doi/10.1145/800229.806964
Kurtz T(1978)BASICACM SIGPLAN Notices10.1145/960118.80837613:8(103-118)Online publication date: 1-Aug-1978
https://dl.acm.org/doi/10.1145/960118.808376
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Recommendations

The restriction language for computer grammars of natural language

The use of transition matrices in compiling

How features resolve syntactic ambiguity

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations