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} }
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
Figures, Tables, and Topics from this paper
25 Citations
Efficient LL(1) error correction and recovery using only insertions
- Computer Science
- Acta Informatica
- 1980
- 35
Compiler Error Messages Considered Unhelpful: The Landscape of Text-Based Programming Error Message Research
- Computer Science
- ITiCSE
- 2019
- 12
- PDF
References
SHOWING 1-3 OF 3 REFERENCES
EULER: a generalization of ALGOL and it formal definition: Part 1
- Computer Science
- CACM
- 1966
- 210
- Highly Influential