A W-Grammar Description for ADA.

Abstract

This thesis explores the formal definition of the syntax and static semantics of the Ada programming language. Several notational forms were compared and the particular notational form chosen is a double level grammar called the W-grammar. W-grammars were first used in the formal definition of Algol 68. Two W-grammars are presented. The first W-grammar is a translation of the modified BNF notation used in the Ada Language Reference Manual, and the second demonstrates the description of Ada's static semantics in W-grammar format. In the author's opinion, the W-grammars fall short of this goal since they are less readable than BNF for determining Ada's syntax, and experience shows that programmers most often refer to references to answer questions about syntax. However, a W-grammar description of Ada is still useful to computer scientists who need more than a simple understanding of the syntax and rudimentary description of the semantics. A formal semanatic definition of Ada is needed by system designers for multiple targets, by compiler designers, and by individuals needing formal correctness proofs of Ada programs.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1986
Accession Number
ADA177802

Entities

People

  • Roy A. Flowers

Organizations

  • Air Force Institute of Technology

Tags

Communities of Interest

  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Classification
  • Compilers
  • Computer Programming
  • Computers
  • Context Free Grammars
  • Electrical Engineering
  • Engineering
  • Grammars
  • High Level Languages
  • Language
  • Linguistics
  • Multiple Targets
  • Programming Languages
  • Semantics
  • Translations

Fields of Study

  • Computer science

Readers

  • Database Systems and Applications
  • Software Verification and Validation.