Revised Report on the Algorithmic Language ALGOL 68

@article{Wijngaarcien1977RevisedRO,
  title={Revised Report on the Algorithmic Language ALGOL 68},
  author={A. van Wijngaarcien and B. J. Mailloux and J. E. L. Peck and C. H. A. Kostcr and Michel Sintzoff and Charles H. Lindsey and Lambert Meertens and R. G. Fisker},
  journal={ACM SIGPLAN Notices},
  year={1977},
  volume={12},
  pages={1-70}
}
ion (a protonotion of a protonotion) 1.1.4.2.b acceptable to (a value acceptable to a mode) 2.1.3.6.d access (inside a locale) 2.1.2.c action 2.1.4.1.a active (action) 2.1.4.3.a af ter (in the textual order) 1.1.3.2.i akin (a production tree to a production tree) 1.1.3.2.k [alignment} 10.3.4.1.1.ff al ternative 1.1.3.2.c apostrophe l.l.3.1.a ar i thmetic value 2.1.3.1.a ascribe (a value or scene to an indicator) 4.8.2.a assign (a value to a name) 5.2.1.2.b asterisk l.l.3.1.a [balancing} 3.4.1… 
Type Disjointness in the Language of Effective Definitions
This paper presents portions of the LED type system. LED types include integer, boolean, variable, set, tuple, function, and union types as well as user-defined recursive types. To accommodate
Dijkstras fruchtbarer, folgenreicher Irrtum
TLDR
Bemerkenswerterweise kann nicht einmal objektorientiertes Programmieren mit ungeschachtelten Klassen die inhärente Komplexität der Verweisstrukturen zwischen Prozedurinkarnationen herunterschrauben, Strukturen können.
On the Borderline Between Grammars and Programs
TLDR
Some of the engineering considerations and trade-offs in the design of a new Compiler Description Language, CDL3, which is based on Extended Affix Grammars, where the affix rules are used to define tree types.
On parsing two-level grammars
  • L. Wegner
  • Computer Science
    Acta Informatica
  • 2004
TLDR
Under very natural restrictions it can be shown that for two-level grammars pairs (G, G′) there exists a 1 — 1 correspondence between leftmost derivations in G and left most derivation in G′.
Policy-based cryptographic key management: experience with the KRP project
  • D. Branstad, D. Balenson
  • Computer Science
    Proceedings DARPA Information Survivability Conference and Exposition. DISCEX'00
  • 2000
TLDR
The Policy-Controlled Cryptographic Key Release project addressed one part of key management by developing a formal language for specifying policies indicating to whom and under what conditions a cryptographic key could be accessed.
Semantic Specification Using Two-Level Grammars: Blocks, Procedures and Parameters
Formal specifications are presented for the complete syntax and semantics of an ALGOL-like language fragment, using a recently introduced definitional technique employing two-level grammars
LL versus LR parsing with illustrations from ALGOL 68
The relative merits of LL and LR parsing methods are compared, particular reference being made to ALGOL 68. The fact that LR methods can be applied to a wider class of languages does not seem to give
System programming in a high level language
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 85 REFERENCES
PLAIN ; STOWED ; REF to NONPROC procedure with PARAMETERS yielding MOID ; UNITED. NONSTOWED {47A} :: PLAIN ; REF to MODE ; PROCEDURE ; UNITED ; void
  • PLAIN ; STOWED ; REF to NONPROC procedure with PARAMETERS yielding MOID ; UNITED. NONSTOWED {47A} :: PLAIN ; REF to MODE ; PROCEDURE ; UNITED ; void
'and' 1.3.1.c, e 'balances' 3.2.1.f, g 'begins with' 1.3.1.h, i, j 'coincides with' 1.3.1.k, l 'contains' 1.3.1.m
  • 'and' 1.3.1.c, e 'balances' 3.2.1.f, g 'begins with' 1.3.1.h, i, j 'coincides with' 1.3.1.k, l 'contains' 1.3.1.m
10.2.3.10.b, g, h = / 10.2.3.0.a, 10.2.3.2.e, 10.2.3.3.d, 10.2.3.4.d, 10.2.3.5.c, d, 10.2.3.6.a, 10.2.3.7.g, u, v, w, x, 10.2.3.8.b, 10.2.3.9.a, 10.2.3.10.d, g, h ∨ 10
  • 10.2.3.10.b, g, h = / 10.2.3.0.a, 10.2.3.2.e, 10.2.3.3.d, 10.2.3.4.d, 10.2.3.5.c, d, 10.2.3.6.a, 10.2.3.7.g, u, v, w, x, 10.2.3.8.b, 10.2.3.9.a, 10.2.3.10.d, g, h ∨ 10
10.2.3.8.b, 10.2.3.9.a, 10.2.3.10.d, g, h % 10.2.3.0.a, 10.2.3.3.m %× 10
  • 10.2.3.8.b, 10.2.3.9.a, 10.2.3.10.d, g, h % 10.2.3.0.a, 10.2.3.3.m %× 10
10.2.3.8.e, 10.2.3.9.a, 10.2.3.10.b, g, h + 10.2.3.0.a, 10.2.3.3.i, j, 10.2.3.4.i, j, 10.2.3.5.a, b, 10.2.3.6.b, 10.2.3.7.j, k, p, q, r, s, 10.2.3.10.i, j
  • 10.2.3.8.e, 10.2.3.9.a, 10.2.3.10.b, g, h + 10.2.3.0.a, 10.2.3.3.i, j, 10.2.3.4.i, j, 10.2.3.5.a, b, 10.2.3.6.b, 10.2.3.7.j, k, p, q, r, s, 10.2.3.10.i, j
4.1.1. Syntax {The following mode-declarations (taken from 10.3.5.a) are reflected in the metaproduction rules A to K below
  • 4.1.1. Syntax {The following mode-declarations (taken from 10.3.5.a) are reflected in the metaproduction rules A to K below
A) FORMAT :: structured with row of PIECE field letter aleph mode
  • A) FORMAT :: structured with row of PIECE field letter aleph mode
A) mode format = struct(flex [1:0] piece F); B) mode piece = struct(int cp, count, bp, flex [1: 0] collection c); C) mode collection =union(picture, collitem)
  • A) mode format = struct(flex [1:0] piece F); B) mode piece = struct(int cp, count, bp, flex [1: 0] collection c); C) mode collection =union(picture, collitem)
ADIC {542C} :: DYADIC ; MONADIC
  • ADIC {542C} :: DYADIC ; MONADIC
B) PIECE :: structured with integral field letter c letter p integral field letter c letter o letter u letter n letter t integral field letter b letter p row of COLLECTION field letter c mode
  • B) PIECE :: structured with integral field letter c letter p integral field letter c letter o letter u letter n letter t integral field letter b letter p row of COLLECTION field letter c mode
...
1
2
3
4
5
...