The evaluation, classification and interpretation of expressions

Authors:
W. H. Burge
Affiliations:
Univac Division of Sperry Rand Corporation, NY
Venue:
ACM '64 Proceedings of the 1964 19th ACM national conference
Year:
1964

Citing 12
Cited 7

Realization of Events by Logical Nets

Journal of the ACM (JACM)
A Descriptive Language for Symbol Manipulation

Journal of the ACM (JACM)
A General Translation Program for Phrase Structure Languages

Journal of the ACM (JACM)
Two Families of Languages Related to ALGOL

Journal of the ACM (JACM)
Recursive processes and ALGOL translation

Communications of the ACM
Design of a separable transition-diagram compiler

Communications of the ACM
Specification languages for mechanical languages and their processors a baker's dozen: a set of examples presented to ASA x3.4 subcommittee

Communications of the ACM
Sequential formula translation

Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM
Report on the algorithmic language ALGOL 60

Communications of the ACM
A syntax controlled generator of formal language processors

Communications of the ACM
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)

The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)

Translator writing systems

Communications of the ACM
A reprogramming machine

Communications of the ACM
A Generalization of Jumps and Labels

Higher-Order and Symbolic Computation
Programming with(out) the GOTO

ACM '72 Proceedings of the ACM annual conference - Volume 2
Programming with(out) the GOTO

ACM SIGPLAN Notices - Special issue on control structures in programming languages
The equivalence of sequential and associate information structure models

ACM SIGPLAN Notices
Universal programming languages and processors: a brief survey and new concepts

AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I

Quantified Score

Hi-index	0.03

Visualization

Abstract

This paper is concerned with certain expressions which have values or which describe things, which will be called 'applicative expressions' (or AEs). This paper is divided into two parts: the first part describes one method of evaluating AEs; the second part describes AEs which are equivalent to regular expressions and Backus Normal Form expressions, and interprets these expressions in several different ways. They are interpreted as languages, recognizers for membership of a language, programs, state diagrams and sequential circuits. Applicative expressions are structured objects and should be distinguished from languages. Their operator-operand structure is always represented in the same way and is independent of the operator and operand.