The formal definition of semantics by string automata

Authors:
G. Kampen;J. L. Baer
Affiliations:
Computer Science Department, University of Illinois, Urbana, IL 61081, U.S.A.;Computer Science Department, University of Washington, Seattle, WA 98105, U.S.A.
Venue:
Computer Languages
Year:
1975

Citing 8
Cited 0

The Vienna Definition Language

ACM Computing Surveys (CSUR)
A formal semantics for computer languages and its application in a compiler-compiler

Communications of the ACM
EULER: a generalization of ALGOL and it formal definition: Part 1

Communications of the ACM
Formal languages and their relation to automata

Formal languages and their relation to automata
Data structure models for programming languages

ACM SIGPLAN Notices
The contour model of block structured processes

ACM SIGPLAN Notices
A data structure model of the B6700 computer system

ACM SIGPLAN Notices
Introduction to Oregano

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

An abstract machine called a string automaton (SA) is introduced in this paper. SAs are motivated by the need to formally define the semantics of programming languages in a manner accessible to the users of the language. The SA notation can be used to represent functions and computations in a clear, concise, graphical, and natural manner. After the class of SAs has been formally defined, it is shown how logic modules (resembling hardware circuit elements) and function modules (which define functions) can be expressed by SAs. Networks of SAs and their application to the construction of parsers is discussed. The definition of the language and hardware components of an interactive programming system by means of SAs is outlined.