File:  [Research Unix] / researchv10no / cmd / twig / doc / manual / mybib.bib
Revision 1.1.1.1 (vendor branch): download - view: text, annotated - select for diffs
Tue Apr 24 17:21:35 2018 UTC (8 years, 1 month ago) by root
Branches: belllabs, MAIN
CVS tags: researchv10, HEAD
researchv10 Norman

@techreport{yacc,
author="Stephen C. Johnson",
title="Yacc -- Yet Another Compiler-Compiler",
institution="AT\&T Bell Laboratories",
year=1975,month="July",
type="Comp. Sci. Tech. Rep.", number=32}

@inproceedings{popltree,
author={Alfred V. Aho and Mahadevan Ganapathi},
title={Tree Matching and Code generation?????},
booktitle={Proceedings of the Symposium on Principles of Programming
Languages},
year="1985"}

@phdthesis{henry,
author={Robert Rettig Henry},
title={Graham-Glanville Code Generators},
school={University of California at Berkeley},
year=1984,month="May"}

@phdthesis{gana,
author={Mahadevan Ganapathi},
title={Retargetable Code Generator and Optimization using Attribute Grammars},
school={University of Wisconsin -- Madision},
year=1980}

@book{dragon,
author={Alfred V. Aho and Jeffrey D. Ullman},
title={Principles of Compiler Design},
publisher={Addison Wesley}, year=1979, month="April"}

@article{optimalcode,
author={Alfred V. Aho and Stephen C. Johnson},
title={Optimal Code generation for Expression Trees},
journal={Journal of the ACM},year=1976,volume=23,number=3,
pages={458-501},month="July"}

@article{treematch,
author={Christoph M. Hoffmann and Michael J. O'Donnell},
title={Pattern Matching in Trees},
journal={Journal of the ACM},year=1982,
volume=29,number=1,month="January",pages={68-95}}

@article{fgrep,
author={Alfred V. Aho and M. J. Corasick},
title={Efficient string matching: An aid to bibliogrpahic search},
journal={Communications of the ACM},volume=18,number=6,year=1975,
month="June",pages={333-340}}

@unpublished{aho:gana:tjiang,
author={Alfred V. Aho and Mahadevan Ganapathi and Steven W. K. Tjiang},
title={Code Generation Using Tree Matching},
note={to be published}}

unix.superglobalmegacorp.com

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.