• DOI:10.1145/362851.362872
Corpus ID: 5596672

Use of transition matrices in compiling

@article{Gries1968UseOT,
  title={Use of transition matrices in compiling},
  author={D. Gries},
  journal={Commun. ACM},
  year={1968},
  volume={11},
  pages={26-34}
}

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

View on ACM

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed