Syntax driven COBOL compilers—an assessment

@article{Layzell1983SyntaxDC,
  title={Syntax driven COBOL compilers—an assessment},
  author={Paul J. Layzell and J. M. Triance},
  journal={Software: Practice and Experience},
  year={1983},
  volume={13}
}
Most syntax analysis phases of COBOL compilers are written as sequences of procedural code instructions each of which validates a particular part of the syntax of a COBOL program. This paper examines the structure of a syntax driven COBOL compiler and a practical implementation is described. The problems encountered with this type of compiler construction are explained, and its advantages are examined. Finally, some other potential applications of syntax driven technology are suggested. 

References

SHOWING 1-9 OF 9 REFERENCES
Design of a separable transition-diagram compiler
A COBOL compiler design is presented which is compact enough to permit rapid, one-pass compilation of a large subset of COBOL on a moderately large computer. Versions of the same compiler for smaller
Compiler Construction for Digital Computers
TLDR
The techniques involved in writing compilers for high-level languages such as FORTRAN or PL/1, as well as semantic routines, are described.
An error-correcting parse algorithm
TLDR
It is the author's opinion that those algorithms which do the best job of error recovery are those which are restricted to simpler forms of formal languages.
Syntactic Analysis and Operator Precedence
TLDR
Three increasingly restricted types of formal grammar are phrase structure Grammars, operator grammars and precedence grammar, which form models of mathematical and algorithmic languages which may be analyzed mechanically by a simple procedure based on a matrix representation of a relation between character pairs.
Use of transition matrices in compiling
TLDR
The purpose of this paper is to illustrate that the technique is very efficient, and to describe an algorithm which generates a transition matrix from a suitable grammar, and other uses of transition matrices besides the usual ones of syntax checking and compiling.
Global Context Recovery: A New Strategy for Syntactic Error Recovery by Table-Drive Parsers
Described is a method for syntactic error recovery that is compatible with deterministic parsing methods and that is able to recover from many errors more quickly than do other schemes because it
A study of errors, error-proneness, and error diagnosis in Cobol
TLDR
Data is provided on Cobol error frequency for correction of errors in student-oriented compilers, improvement of teaching, and changes in programming language to imply high potential effectiveness for software-based correction of Cobol.
Practical syntactic error recovery
TLDR
A recovery scheme for syntax errors which provides automatically-generated high quality recovery with good diagnostic information at relatively low cost is described.