| |
| | bibtex.bib |
 | | @BOOK{aho-sethi-ullman, AUTHOR = "Alfred V. Aho and Ravi Sethi and Jeffrey D. Ullman", TITLE = "{Compilers, Principles, Techniques, and Tools}", PUBLISHER = "Addison-Wesley", YEAR = 1986, ANNOTE = " Mentions (mostly) viable prefix property. |
 | | (pp104-105) " } @INPROCEEDINGS{horgan-moore, AUTHOR = "J. Horgan and D. Moore", TITLE = "{Techniques for Improving Language-Based Editors}", BOOKTITLE = "{Proc. |
 | | Hopcroft and Jeffrey D. Ullman", TITLE = "{Introduction to Automata Theory, Languages, and Computation}", PUBLISHER = "Addison-Wesley", YEAR = 1979, ANNOTE = " Has proof (as solved exercise) that every Context Free Language without epsilon has an operator grammer. |
| www.symbolicnet.org /areas/interfaces/bibtex.bib (1382 words) |
|