Revised report on the algorithmic language ALGOL 68

@article{Wijngaarden2004RevisedRO,
  title={Revised report on the algorithmic language ALGOL 68},
  author={Adriaan van Wijngaarden and B. J. Mailloux and J. E. L. Peck and Cornelis H. A. Koster and Michel Sintzoff and Charles H. Lindsey and Lambert Meertens and R. G. Fisker},
  journal={Acta Informatica},
  year={2004},
  volume={5},
  pages={1-236}
}
The report gives a complete defining description of the international algorithmic language Algol 60. This is a language suitable for expressing a large class of numerical processes in a form suitably concise for direct automatic translation into the language of programmed automatic computers. 
A Boolean grammar for a simple programming language
A toy procedural programming language is defined, and a Boolean grammar for the set of well-formed programs in this language is constructed. This is apparently the first specification of a
Towards the 80th Anniversary of N. Wirth: Wirth's Syntactic Charts in the SYNTAX-Technology
  • B. Martynenko
  • Computer Science
    2014 Third International Conference on Computer Technology in Russia and in the Former Soviet Union
  • 2014
The Algol 68 syntax is defined with the two-level grammars of A. van Wijngaarden which generate recursively enumerable sets, their recognition problem being generally algorithmically insolvable. The
Algol 68
Algol 68 was designed by a working group (WG 2.1) of the International Federation for Information Processing (IFIP) in order to provide a general-purpose programming language that would be suitable
Applications of functional programmming in processing formal and natural languages
TLDR
This thesis describes two applications of functional programming to process formal and natural languages, and a toolkit for implementing natural language morphology in the functional language Haskell, which builds on ideas introduced by Huet in his computational linguistics toolkit Zen.
Practical LL(1)-based parsing of van Wijngaarden grammars
TLDR
An LL(1)-based algorithm is described for parsing a class of van Wijngaarden grammars, implemented in the concurrent programming language Occam, and well suited to execution on a multi-processor computer.
Compilers and Interpreters
TLDR
This chapter examines some of the characteristics of programming languages to find out how they are structured and defined.
Modular Programming Language Design
TLDR
The paper disucsses the concept separartely for syntax and processing, and quite important for the modularization are parametric snytactic rules(or generic functions in the domain of processing), which are particularly useful to deal with dependencies.
A decidability criterion for van Wijngaarden grammars
TLDR
Normal forms of van Wijngaarden grammars and restrictions which guarantee decidability are discussed and ALGOL 68 is considered under these views.
Understanding Programming Language Concepts Via Operational Semantics
  • Cliff B. Jones
  • Computer Science
    Domain Modeling and the Duration Calculus
  • 2007
TLDR
This paper revisits the language description task but uses operational (rather than denotational) semantics to illustrate that the crucial idea is thinking about an abstract model of something that one is trying to understand or design.
Symbol Binding and Resolution in Programming Languages
TLDR
This work proposes explicit operations to perform “binding”, which are frequently performed at compile time, thus capturing the notion of early binding that characterizes most languages.
...
...