TL;DR: This paper explores the use of a formal notation called Production Systems in providing a readable and complete formal definition of syntax, and a small but significant subset of PL/I is considered.
Abstract: Since the development of BNF, the definition of the syntax of programming languages has been almost universally associated with context-free requirements. Yet numerous interesting and difficult issues in syntax stem from the context-sensitive requirements, notably the compatibility between the declaration of an identifier and its uses, the correspondence between actual and formal parameters, and issues arising from block structure.This paper explores the use of a formal notation called Production Systems in providing a readable and complete formal definition of syntax. As a practical illustration, a small but significant subset of PL/I is considered. A more detailed presentation, as well as the application to define abstract syntax and translations between languages, is given in a previous paper by the author.
TL;DR: This paper formally defines the semantics of GEBNF and its induced predicate logic languages, then applies Goguen and Burstall’s institution theory to prove that they form a sound and valid formal specification language for meta-modelling.
Abstract: Meta-modelling plays an important role in model driven software development. In this paper, a graphic extension of BNF (GEBNF) is proposed to define the abstract syntax of graphic modelling languages. From a GEBNF syntax definition, a formal predicate logic language can be induced so that meta-modelling can be performed formally by specifying a predicate on the domain of syntactically valid models. In this paper, we investigate the theoretical foundation of this meta-modelling approach. We formally define the semantics of GEBNF and its induced predicate logic languages, then apply Goguen and Burstall's institution theory to prove that they form a sound and valid formal specification language for meta-modelling.
TL;DR: 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.
Abstract: Towards the 80th Anniversary of N Wirth: Wirth's Syntactic Charts in the SYNTAX-Technology
TL;DR: A number of the problems associated with the definition of transfer syntax are described and a possible solution to these issues involving the development of an advanced encoding control notation is discussed.
Abstract: At present although the abstract structure of a protocol message can be formally defined, the actual format of the bits transmitted on the line or through the air cannot be formally specified The small number of standardised encoding rules available are only defined in informal text and in many application domains such as radio interfaces, they do not satisfy today’s requirements for very efficient transmission of information This paper describes a number of the problems associated with the definition of transfer syntax and then discusses a possible solution to these issues involving the development of an advanced encoding control notation