Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/800004.807950acmconferencesArticle/Chapter ViewAbstractPublication PagesplanConference Proceedingsconference-collections
Article

The NYU Ada translator and interpreter

Published: 01 January 1980 Publication History
  • Get Citation Alerts
  • Abstract

    The NYU-Ada project is engaged in the design and implementation of a translator-interpreter for the Ada language. The objectives of this project are twofold: a) to provide an executable semantic model for the full Ada language, that can be used for teaching, and serve as a starting point for the design of an efficient Ada compiler; b) to serve as a testing ground for the software methodology that has emerged from our experience with the very-high level language SETL. In accordance with these objectives, the NYU-Ada system is written in a particularly high-level, abstract SETL style that emphasizes clarity of design and user interface over speed and efficiency. A number of unusual design features of the translator and interpreter follow from this emphasis. Some of these features are described below. We also discuss the question of semantic specification of programming languages, and the general methodology of “Software Prototyping” of which the NYU-Ada system is a sizeable example.

    References

    [1]
    Preliminary Ada Reference Manual, SIGPLAN NOTICES, Vol.14, No. 6, June 1979, part A.
    [2]
    Ichbiah,J.D. et al.: Rationale for the Design of the Ada Programming Language, SIGPLAN NOTICES, Vol.14,No.6,June 1979,B.
    [3]
    Dewar, R.B.K. et al: Programming by refinement, as Exemplified by the SETL representation Sublanguage. TOPLAS, Vol.1, No.1 (July 1979) pp.27-49
    [4]
    Dewar,R.B.K. and Schonberg.E.:the elements of SETL style. Proceedings of the 1979 ACM National Conference (Oct.1979) pp.24-32.
    [5]
    Fisher,G. and Burke,M.: Syntax error recovery in LALR(1) parsers. Courant Institute report (In preparation).
    [6]
    Cii Honeywell Bull: Formal Definition of ADA (Interim Draft) October 1979 (Unpublished).
    [7]
    Habermann,N. and Nassi,I.K.: Efficient implementation of Ada Tasks. Sept.1979 (Unpublished Draft)
    [8]
    Persch,G. et al.: Overloading in Ada, Universitat Karlsruhe, Report 23/79 (Nov. 1979) Unpublished.

    Cited By

    View all
    • (2005)A highly parallel Ada task schedulerAda: Moving Towards 200010.1007/3-540-55585-4_22(275-286)Online publication date: 28-May-2005
    • (1991)Efficient loop-level parallelism in AdaProceedings of the conference on TRI-Ada '91: today's accomplishments; tomorrow's expectations10.1145/126551.126568(166-179)Online publication date: 1-Dec-1991
    • (1982)An efficient method for handling operator overloading in AdaProceedings of the AdaTEC Conference on Ada10.1145/3304133.3304148(107-111)Online publication date: 6-Oct-1982

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SIGPLAN '80: Proceedings of the ACM-SIGPLAN symposium on The ADA programming language
    January 1980
    242 pages
    ISBN:0897910303
    DOI:10.1145/800004
    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 1980

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 11 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2005)A highly parallel Ada task schedulerAda: Moving Towards 200010.1007/3-540-55585-4_22(275-286)Online publication date: 28-May-2005
    • (1991)Efficient loop-level parallelism in AdaProceedings of the conference on TRI-Ada '91: today's accomplishments; tomorrow's expectations10.1145/126551.126568(166-179)Online publication date: 1-Dec-1991
    • (1982)An efficient method for handling operator overloading in AdaProceedings of the AdaTEC Conference on Ada10.1145/3304133.3304148(107-111)Online publication date: 6-Oct-1982

    View Options

    View options

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media