Nothing Special   »   [go: up one dir, main page]

skip to main content
article
Open access

Generation of Compiler Symbol Processing Mechanisms from Specifications

Published: 01 April 1983 Publication History
First page of PDF

References

[1]
AHO, A.V., AND ULLMAN, J.D. Principles ~f Compiler Design. Addison-Wesley, Reading, Mass., 1977.
[2]
ALLEN, F.E., CARTER, J.L., HARRISON, W.H., LO~.WNER, P.G., TAPSCOTT, R.P., TREVlLLYAN, L.H., AND WEGMAN, M.N. The experimental compiling systems project. IBM Res. Rep. RC6718, IBM, Yorktown Heights, N.Y., 1977.
[3]
FELOMAN, J., AND GRIES, D. Translator writing systems. Commun. ACM 11, 2 (Feb. 1968), 77-113.
[4]
INTERMETmCS. Red language design rationale. CRDL item 0002AD, Intermetics, Cambridge, Mass., Mar. 1979.
[5]
JENSEN, K., AND WIRTH, N. Pascal User Manual and Report. Springer-Verlag, New York, 1978.
[6]
JOHNSON, S.C. YACC--Yet another compiler compiler. Tech. Rep. CSTR 32, Bell Laboratories, Murray Hill, N.J., 1974.
[7]
KERNIGHAN, B.W., AND RITCHIE, D.M. The M4 macro processor. UNIX Manual. Bell Laboratories, July 1977.
[8]
KOSTER, C.H.A. Using the CDL compiler-compiler. In Compiler Construction: An Advanced Course, F.L. Bauer and J. Eickel (Eds.). Springer-Verlag, New York, 1974, 366-426.
[9]
LAMPSON, B.W., HORmNG, J.J., LONDON, R.L., MITC~.LL, J.G., AND POPEK, G.L. Report on the programming language Euclid. SIGPLAN Notices (ACM) 12, 2 (Feb. 1977), 1-79.
[10]
LESK, M.E. LEX--A lexical analyzer generator. Tech. Rep. CSTR 39, Bell Laboratories, Murray Hi!i, N.J., 1975.
[11]
LEV~RETT, B.W., CATT~LL, R.G.G., HOBBS, S.O., NEWCOMER, J.M., REINER, A.H., SCHATZ, B.R., AND WULF, W.A. An overview of the production quality compiler-compiler project. Res. Pep. CMU-CS-79-105, Dep. of Computer Science, Carnegie-Mellon Univ., Pittsburgh, Penn., Feb. 1979.
[12]
McK~.EMAN, W.M. Compiler construction. In Compiler Construction: An Advanced Course, F.L. Bauer and J. Eickel (Eds.). Springer-Verlag, New York, 1974.
[13]
McKEEMAN, W.M., HORNINC, J.J., AND WORTMAN, D.B. A Compiler Generator. Prentice-Hall, Englewood Cliffs, N.J., 1970.
[14]
REISS, S.P. Automatic compiler production: The front end. Pes. Rep. 66, Dep. of Computer Science, Brown Univ., Providence, R.I., 1981.
[15]
SCHWANKE, B. Survey of scope issues in programming languages. Res. Pep. CS-78-131, Carnegie~ Mellon Univ., Pittsburgh, Penn., June 1978.
[16]
U.S. DEP. Ol~ DEFENSE. Reference Manual for the Ada Programming Language. July 1980.
[17]
WIRTH, N. Modula: A language for modular multiprogramming. Sofiw. Pract. Exper. 7, 1 (Jan.-Feb. 1977), 3-35.

Cited By

View all
  • (2017)Incremental whole program optimization and compilationProceedings of the 2017 International Symposium on Code Generation and Optimization10.5555/3049832.3049857(221-232)Online publication date: 4-Feb-2017
  • (2017)Incremental whole program optimization and compilation2017 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)10.1109/CGO.2017.7863742(221-232)Online publication date: Feb-2017
  • (2017)Name analysis for modern languages: a general solutionSoftware: Practice and Experience10.1002/spe.248947:11(1597-1631)Online publication date: 13-Mar-2017
  • Show More Cited By

Recommendations

Reviews

Martti J. Tienari

This is an interesting analysis of the roles of symbols in programming languages. A model of symbol processing is developed and is used to formalize the generation of the symbol processing portion of a compiler in a compiler generation system. The result can be viewed as a data abstraction for a compiler symbol table. Symbol table processing in a compiler has become complex as programming languages have evolved. However, scope rules are usually implemented by the symbol table routines without an illuminating formal analysis. An established formal basis for these aspects of language implementation would be most welcome. This paper is a pioneering work on formalizing scope issues of modern programming languages. One would sincerely hope that in the coming years we would be able to develop a clear and simple model for this purpose. The model put forward in this paper appears to be quite comprehehsive and complete. One gets the feeling that it is too complex and heavy. Who would improve and simplify the model__?__

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Programming Languages and Systems
ACM Transactions on Programming Languages and Systems  Volume 5, Issue 2
April 1983
138 pages
ISSN:0164-0925
EISSN:1558-4593
DOI:10.1145/69624
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1983
Published in TOPLAS Volume 5, Issue 2

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)90
  • Downloads (Last 6 weeks)11
Reflects downloads up to 25 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2017)Incremental whole program optimization and compilationProceedings of the 2017 International Symposium on Code Generation and Optimization10.5555/3049832.3049857(221-232)Online publication date: 4-Feb-2017
  • (2017)Incremental whole program optimization and compilation2017 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)10.1109/CGO.2017.7863742(221-232)Online publication date: Feb-2017
  • (2017)Name analysis for modern languages: a general solutionSoftware: Practice and Experience10.1002/spe.248947:11(1597-1631)Online publication date: 13-Mar-2017
  • (2014)Scoping rules on a platterProceedings of the 10th ACM SIGPLAN workshop on Generic programming10.1145/2633628.2633633(59-70)Online publication date: 26-Aug-2014
  • (2005)Implementing high-level identification specificationsCompiler Construction10.1007/3-540-55984-1_7(59-65)Online publication date: 1-Jun-2005
  • (2005)Logic-based specification of visibility rulesProgramming Language Implementation and Logic Programming10.1007/3-540-54444-5_88(63-74)Online publication date: 4-Jun-2005
  • (2005)Application development with the FNC-2 attribute grammar systemCompiler Compilers10.1007/3-540-53669-8_71(11-25)Online publication date: 4-Jun-2005
  • (2005)Incremental symbol processingCompiler Compilers and High Speed Compilation10.1007/3-540-51364-7_2(11-38)Online publication date: 1-Jun-2005
  • (1996)Towards a classification of visibility rulesACM SIGPLAN Notices10.1145/249094.24911631:1(44-50)Online publication date: 1-Jan-1996
  • (1995)Attribute grammar paradigms—a high-level methodology in language implementationACM Computing Surveys10.1145/210376.19740927:2(196-255)Online publication date: 1-Jun-1995
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media