|
|
1.1 ! root 1: @techreport{yacc, ! 2: author="Stephen C. Johnson", ! 3: title="Yacc -- Yet Another Compiler-Compiler", ! 4: institution="AT\&T Bell Laboratories", ! 5: year=1975,month="July", ! 6: type="Comp. Sci. Tech. Rep.", number=32} ! 7: ! 8: @inproceedings{popltree, ! 9: author={Alfred V. Aho and Mahadevan Ganapathi}, ! 10: title={Tree Matching and Code generation?????}, ! 11: booktitle={Proceedings of the Symposium on Principles of Programming ! 12: Languages}, ! 13: year="1985"} ! 14: ! 15: @phdthesis{henry, ! 16: author={Robert Rettig Henry}, ! 17: title={Graham-Glanville Code Generators}, ! 18: school={University of California at Berkeley}, ! 19: year=1984,month="May"} ! 20: ! 21: @phdthesis{gana, ! 22: author={Mahadevan Ganapathi}, ! 23: title={Retargetable Code Generator and Optimization using Attribute Grammars}, ! 24: school={University of Wisconsin -- Madision}, ! 25: year=1980} ! 26: ! 27: @book{dragon, ! 28: author={Alfred V. Aho and Jeffrey D. Ullman}, ! 29: title={Principles of Compiler Design}, ! 30: publisher={Addison Wesley}, year=1979, month="April"} ! 31: ! 32: @article{optimalcode, ! 33: author={Alfred V. Aho and Stephen C. Johnson}, ! 34: title={Optimal Code generation for Expression Trees}, ! 35: journal={Journal of the ACM},year=1976,volume=23,number=3, ! 36: pages={458-501},month="July"} ! 37: ! 38: @article{treematch, ! 39: author={Christoph M. Hoffmann and Michael J. O'Donnell}, ! 40: title={Pattern Matching in Trees}, ! 41: journal={Journal of the ACM},year=1982, ! 42: volume=29,number=1,month="January",pages={68-95}} ! 43: ! 44: @article{fgrep, ! 45: author={Alfred V. Aho and M. J. Corasick}, ! 46: title={Efficient string matching: An aid to bibliogrpahic search}, ! 47: journal={Communications of the ACM},volume=18,number=6,year=1975, ! 48: month="June",pages={333-340}} ! 49: ! 50: @unpublished{aho:gana:tjiang, ! 51: author={Alfred V. Aho and Mahadevan Ganapathi and Steven W. K. Tjiang}, ! 52: title={Code Generation Using Tree Matching}, ! 53: note={to be published}}
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.