Use of transition matrices in compiling

  title={Use of transition matrices in compiling},
  author={D. Gries},
  journal={Commun. ACM},
  • D. Gries
  • Published 1968
  • Computer Science
  • Commun. ACM
  • The construction of efficient parsing algorithms for programming languages has been the subject of many papers in the last few years. Techniques for efficient parsing and algorithms which generate the parser from a grammar or phrase structure system have been derived. Some of the well-known methods are the precedence techniques of Floyd, and Wirth and Weber, and the production langauge of Feldman. Perhaps the first such discussion was by Samelson and Bauer. There the concept of the push-down… CONTINUE READING
    25 Citations

    Figures, Tables, and Topics from this paper

    The use of transition matrices in a recursive-descent compiler
    • 2
    The Use of Symbol-State Tables
    • 8
    • PDF
    Design and implementation of a diagnostic compiler for PL/I
    • 56
    • PDF
    Efficient LL(1) error correction and recovery using only insertions
    • 35
    Compiler Error Messages Considered Unhelpful: The Landscape of Text-Based Programming Error Message Research
    • 12
    • PDF
    Historical Remarks on Compiler Construction
    • F. L. Bauer
    • History, Computer Science
    • Compiler Construction
    • 1976
    • 9
    Practical syntactic error recovery in compilers
    • 24
    Syntax driven COBOL compilers—an assessment


    Syntactic Analysis and Operator Precedence
    • 251
    • Highly Influential
    EULER: a generalization of ALGOL and it formal definition: Part 1
    • 210
    • Highly Influential
    Design of a separable transition-diagram compiler
    • 437
    • Highly Influential
    • PDF