Design of a separable transition-diagram compiler

@article{Conway1963DesignOA,
  title={Design of a separable transition-diagram compiler},
  author={Melvin E. Conway},
  journal={Commun. ACM},
  year={1963},
  volume={6},
  pages={396-408}
}
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 machines require only two working tapes plus a compiler tape. The methods given are largely applicable to the construction of ALGOL compilers. 
View on ACM
melconway.com
458 Citations
Highly Influential Citations
17
Background Citations
86
Methods Citations
45
Results Citations
3

458 Citations

Citation Type

Citation Type

The design of a pascal compiler
  • N. Wirth
  • Computer Science
  • Softw. Pract. Exp.
  • 1971
The development of a compiler for the programming language PASCAL1 is described in some detail. Design decisions concerning the layout of program and data, the organization of the compiler including… Expand
Design highlights of CABAL: a compiler-compiler
The advantages offered by compilers over machine or assembly coding are well known to all of us. The personal satisfaction and minimal execution time of optimally perfect code rarely outweigh… Expand
Model, Design, and Evaluation of a Compiler for a Parallel Processing Environment
  • J. Baer, C. Ellis
  • Computer Science
  • IEEE Transactions on Software Engineering
  • 1977
TLDR
By modeling an existing sequential compiler, an understanding of the modifications necessary to transform the sequential structure into a pipeline of processes is gained and the pipelined compiler is evaluated through measurements and simulation. Expand
Syntax driven COBOL compilers—an assessment
TLDR
The structure of a syntax driven COBOL compiler and a practical implementation is described and some other potential applications of syntax driven technology are suggested. Expand
The Cobol Compiler for the Siemens 3003
TLDR
In the description of the compiler particular emphasis is placed on the error detection phase, where the source program is analysed with respect to syntax, data descriptions and operand types. Expand
Structuring Compiler Development
  • J. Horning
  • Computer Science
  • Compiler Construction
  • 1976
TLDR
This chapter is concerned with ways in which the development process can be structured to meet given objectives. Expand
A Method for the Syntax Directed Design of Multiprograms
TLDR
This paper shows how the notation for translation grammars may be used to derive a program in a conventional high level language such as Pascal or Cobol, and it is shown that more complex problems can be solved by simple pipeline structures of simple translations. Expand
Modern Compiler Design
"Modern Compiler Design" makes the topic of compiler design more accessible by focusing on principles and techniques of wide application. By carefully distinguishing between the essential (material… Expand
Concurrent programming : Microcomputers
This paper considers the construction of algorithms in a concurrent programming environment where several microcomputers share the same memory or each microcomputer has its own local memory. Not only… Expand
Control of sequence and parallelism in modular programs
TLDR
A variety of schemes for the specification and operation of parallel computation have been described recently, but they are not at a truly procedure- or problem-oriented language level but represent transliterations of machine or process-oriented operations. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 22 REFERENCES
A syntax directed generator
The recent proliferation of algebraic translators or "compilers"--programs which translate from an algebraic language (like ALGOL, IT, or Lo) to the hardware language of a digital computer--has… Expand
An Algorithm for Translating Boolean Expressions
TLDR
An algorithm for scanning Boolean expressions that takes a complex, relational expression and transforms it into an opt imal set of computing steps and is advantageous in that it fits into a general scheme for the translation of statements to machine language. Expand
Arithmetizing declarations: an application to COBOL
TLDR
A problem in the design of every COBOL processor: gleaning information from the item description entries of the Data Division is discussed, which is an "interpretive" rather than a "direct" one, in the sense that the specification to the processor of predefined interrelationships among elements of the source language is expressed not in machine code but in some nonmachine language which is interpreted during compilation. Expand
A Translator-Oriented Symbolic Programming Language
TLDR
The purpose of this note is the description of a target language which is designed with the sole aim of simplifying the task of translation as much as possible and may, if desired, be used directly as a symbolic language for hand coding. Expand
Compiling techniques for Boolean expressions and conditional statements in ALGOL 60
TLDR
In this note compiling routines will be described for Boolean expressions involving the operators V, / ~ and -1, which will then be used in describing proeedures for compiling conditional statements and Boolean assignment statements as defined in AL(mL 60). Expand
Handling identifies as internal symbols in language processors
TLDR
Although programs may be constructed in actual machine language, it has been demonstrated that machine language programs are obtained cheaply and more quickly if a symbolic language is used as a buffer between man and machine. Expand
A syntax directed compiler for ALGOL 60
TLDR
The author's algorithm is indebted to Arthur Anger, presently at Harvard University, for many helpful criticisms and suggestions, and for coding the algorithm on the UNiwxc 1105. Expand
On The Ambiguity Problem of Backus Systems
TLDR
Backus has developed an elegant method of defining well-formed formulas for computer languages such as ALGOL that consists of a finite sequence of letters from the alphabet. Expand
A t rans la to r -o r ien ted symbol ic language pr(~ g ramming language
  • J . ACM
  • 1952
a n d W a t t e n b u r g
  • ;OL 60. Comm. ACM
  • 1961
...
1
2
3
...