Map
Index
Random
Help
th

QuoteRef: wirtN1_1966

topics > all references > ThesaHelp: references t-z



ThesaHelp:
ACM references m-z
Topic:
semantics by an abstract machine
Topic:
functional programming
Group:
function
Topic:
programming by sequential implementation
Group:
replacement or assignment
Topic:
van Wijngaarden grammar
Topic:
recursion
Group:
goals for a programming system
Topic:
programming language design
Topic:
programming language
Topic:
history of programming
Topic:
primitive functions
Topic:
machine independent programming
Topic:
evaluation in an environment
Group:
grammar
Topic:
semantic grammar
Topic:
pointers to data
Topic:
undefined, null, and other signal values
Topic:
boolean values, binary numbers, and bit strings
Topic:
constants
Topic:
type conversion
Topic:
dynamic type checking
Topic:
interpreter

Reference

Wirth, N., Weber, H., "EULER: A generalization of ALGOL, and its formal definition: Part I", Communications of the ACM, 9, 1, January 1966, pp. 13-25. Google

Other Reference

Wirth, N., Weber, H., "EULER: A generalization of ALGOL, and its formal definition: Part II," Communications of the ACM, 9.2:89-99, February 1996.

Quotations
abstract ;;Quote: define a programming language using a phrase structure syntax and interpretation rules; one-to-one correspondence to a parse; applied to a generalization of ALGOL
13 ;;Quote: a program is a sequence of steps even when represented as a functional form; e.g., nested functions and parameters
13+;;Quote: simple programs become complex functional forms; assignments and jumps have complex representations
14 ;;Quote: van Wijngaarden's approach may be too subtle and intricate to explain a programming language; highly recursive from simple rules
14 ;;Quote: programming languages are communication media with computers; semantics should be similar
14+;;Quote: fundamental semantic entities should reflect the computer's elementary operators
14 ;;Quote: separate language definition from program definition; van Wijngaarden grammars mix the two
15 ;;Quote: environment is the set of variables modified by the programming language; defines the meaning of a sentence
15 ;;Quote: a precedence grammar is unambiguous
15+;;Quote: every sentence of a programming language should have one and only one meaning; unambiguous grammar; each syntactic rule has a semantic rule
16 ;;Quote: @v is a reference, indirect assignment is v.<-E
16 ;;Quote: the value of a literal is the literal itself; e.g., true, false, and .capOmega. as undefined
16 ;;Quote: typetest operators to test literals; e.g., 'isn x' is true if x is a number
16+;;Quote: conversion operators to convert values; e.g., 'real x' produces a real number
89 ;;Quote: formal definition of Euler with translator and interpreter for an abstract machine; derived from Algol

Related Topics up

ThesaHelp: ACM references m-z (280 items)
Topic: semantics by an abstract machine (38 items)
Topic: functional programming (45 items)
Group: function   (12 topics, 232 quotes)
Topic: programming by sequential implementation (26 items)
Group: replacement or assignment   (5 topics, 38 quotes)
Topic: van Wijngaarden grammar (9 items)
Topic: recursion (16 items)
Group: goals for a programming system   (21 topics, 983 quotes)
Topic: programming language design (53 items)
Topic: programming language (29 items)
Topic: history of programming (91 items)
Topic: primitive functions (34 items)
Topic: machine independent programming (13 items)
Topic: evaluation in an environment (35 items)
Group: grammar   (8 topics, 181 quotes)
Topic: semantic grammar (23 items)
Topic: pointers to data (55 items)
Topic: undefined, null, and other signal values (34 items)
Topic: boolean values, binary numbers, and bit strings (44 items)
Topic: constants (21 items)
Topic: type conversion (33 items)
Topic: dynamic type checking (43 items)
Topic: interpreter (59 items)

Collected barberCB 11/03
Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.