Methods for specifying static semantics

Authors:
M. H. Williams
Affiliations:
Department of Computer Science, Rhodes University, Grahamstown, South Africa
Venue:
Computer Languages
Year:
1981

Citing 10
Cited 0

The Vienna Definition Language

ACM Computing Surveys (CSUR)
A Sampler of Formal Definitions

ACM Computing Surveys (CSUR)
Semantic evaluation from left to right

Communications of the ACM
Production systems: or can we do better than BNF

Communications of the ACM
An all(1) compiler generator

SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
An extended attribute grammar for Pascal

ACM SIGPLAN Notices
Summary of the characteristics of several "modern" programming languages

ACM SIGPLAN Notices
Report on the algorithmic language ALGOL 68

Report on the algorithmic language ALGOL 68
A formal system for the specification of the syntax and translation of computer languages

AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
A formal notation for specifying static semantic rules

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

The formal specification of a programming language involves the specification of three types of rules: syntax, static semantics and semantics. Various methods have been proposed for specifying the static semantic rules of programming languages, but as yet no method has received general acceptance. This paper looks at several different specification techniques and attempts to isolate the basic mechanisms used by each of them and explain the pattern of development of specification techniques for static semantics.