This distribution has been tested as part of the cpan-testers
effort to test as many new uploads to CPAN as possible. See
http://testers.cpan.org/
Please cc any replies to cpan-testers@perl.org to keep other
test volunteers informed and to prevent any duplicate effort.
--
Dear Mark Nodine,
This is a computer-generated report for Text-BibTeX-BibStyle-0.02
on perl-5.6.2, created automatically by CPAN-Reporter-1.02
and sent to the CPAN Testers mailing list.
If you have received this email directly, it is because the person testing
your distribution chose to send a copy to your CPAN email address; there
may be a delay before the official report is received and processed
by CPAN Testers.
Thank you for uploading your work to CPAN. However, it appears that
there were some problems with your distribution. If these results are
not what you expect, please consult "Notes for CPAN Authors" on
the CPAN Testers Wiki: http://cpantest.grango.org
Sections of this report:
* Tester comments
* Program output
* Prerequisites
* Environment and other context
------------------------------
TESTER COMMENTS
------------------------------
Additional comments from tester:
[none provided]
------------------------------
PROGRAM OUTPUT
------------------------------
Output from '/usr/bin/make test':
PERL_DL_NONLAZY=1 /home/david/cpantesting/perl-5.6.2/bin/perl
"-MExtUtils::Command::MM" "-e" "test_harness(0, 'blib/lib', 'blib/arch')" t/*.t
t/10_built_in....ok
t/20_xampl.......bibs/xampl.bib, line 29, warning: 125 characters of junk seen
at toplevel
# Failed test 'abbrv'
# at t/20_xampl.t line 47.
# got: 'Warning--empty author in whole-journal
# Warning--empty title in whole-journal
#
# \newcommand{\noopsort}[1]{} \newcommand{\printfirst}[2]{#1}
# \newcommand{\singleletter}[1]{#1} \newcommand{\switchargs}[2]{#2#1}
# \begin{thebibliography}{10}
#
# \bibitem{article-minimal}
# L.~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock {\em \mbox{G-Animal's} Journal}, 1986.
#
# \bibitem{article-full}
# L.~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock {\em \mbox{G-Animal's} Journal}, 41(7):73+, July 1986.
# \newblock This is a full ARTICLE entry.
#
# \bibitem{article-crossref}
# L.~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock In {\em \mbox{G-Animal's} Journal\/} \cite{whole-journal}, pages
73+.
# \newblock This is a cross-referencing ARTICLE entry.
#
# \bibitem{whole-journal}
# {\em \mbox{G-Animal's} Journal}, 41(7), July 1986.
# \newblock The entire issue is devoted to gnats and gnus (this entry is a
# cross-referenced ARTICLE (journal)).
#
# \bibitem{whole-set}
# D.~E. Knuth.
# \newblock {\em The Art of Computer Programming}.
# \newblock Four volumes. Addison-Wesley,
# {\noopsort{1973a}}{\switchargs{--90}{1968}}.
# \newblock Seven volumes planned (this is a cross-referenced set of BOOKs).
#
# \bibitem{inbook-minimal}
# D.~E. Knuth.
# \newblock {\em Fundamental Algorithms}, chapter 1.2.
# \newblock Addison-Wesley, {\noopsort{1973b}}1973.
#
# \bibitem{inbook-full}
# D.~E. Knuth.
# \newblock {\em Fundamental Algorithms}, volume~1 of {\em The Art of Computer
# Programming}, section 1.2, pages 10--119.
# \newblock Addison-Wesley, Reading, Massachusetts, second edition, 10~Jan.
# {\noopsort{1973b}}1973.
# \newblock This is a full INBOOK entry.
#
# \bibitem{inbook-crossref}
# D.~E. Knuth.
# \newblock {\em Fundamental Algorithms}, section 1.2.
# \newblock Volume~1 of {\em The Art of Computer Programming\/}
\cite{whole-set},
# second edition, {\noopsort{1973b}}1973.
# \newblock This is a cross-referencing INBOOK entry.
#
# \bibitem{book-full}
# D.~E. Knuth.
# \newblock {\em Seminumerical Algorithms}, volume~2 of {\em The Art of Computer
# Programming}.
# \newblock Addison-Wesley, Reading, Massachusetts, second edition, 10~Jan.
# {\noopsort{1973c}}1981.
# \newblock This is a full BOOK entry.
#
# \bibitem{book-crossref}
# D.~E. Knuth.
# \newblock {\em Seminumerical Algorithms}.
# \newblock Volume~2 of {\em The Art of Computer Programming\/}
\cite{whole-set},
# second edition, {\noopsort{1973c}}1981.
# \newblock This is a cross-referencing BOOK entry.
#
# \bibitem{book-minimal}
# D.~E. Knuth.
# \newblock {\em Seminumerical Algorithms}.
# \newblock Addison-Wesley, {\noopsort{1973c}}1981.
#
# \bibitem{booklet-minimal}
# The programming of computer art.
#
# \bibitem{booklet-full}
# J.~C. Knvth.
# \newblock The programming of computer art.
# \newblock Vernier Art Center, Stanford, California, Feb. 1988.
# \newblock This is a full BOOKLET entry.
#
# \bibitem{incollection-minimal}
# D.~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In {\em High Speed Computer and Algorithm Organization}. Academic
# Press, 1977.
#
# \bibitem{incollection-full}
# D.~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In D.~J. Lipcoll, D.~H. Lawrie, and A.~H. Sameh, editors, {\em High
# Speed Computer and Algorithm Organization}, number~23 in Fast Computers,
# part~3, pages 179--183. Academic Press, New York, third edition, Sept. 1977.
# \newblock This is a full INCOLLECTION entry.
#
# \bibitem{incollection-crossref}
# D.~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In Lipcoll et~al. \cite{whole-collection}, pages 179--183.
# \newblock This is a cross-referencing INCOLLECTION entry.
#
# \bibitem{whole-collection}
# D.~J. Lipcoll, D.~H. Lawrie, and A.~H. Sameh, editors.
# \newblock {\em High Speed Computer and Algorithm Organization}.
# \newblock Number~23 in Fast Computers. Academic Press, New York, third
edition,
# Sept. 1977.
# \newblock This is a cross-referenced BOOK (collection) entry.
#
# \bibitem{manual-minimal}
# {\em The Definitive Computer Manual}.
#
# \bibitem{manual-full}
# L.~Manmaker.
# \newblock {\em The Definitive Computer Manual}.
# \newblock Chips-R-Us, Silicon Valley, silver edition, Apr.-May 1986.
# \newblock This is a full MANUAL entry.
#
# \bibitem{mastersthesis-minimal}
# {\'{E}}.~Masterly.
# \newblock Mastering thesis writing.
# \newblock Master's thesis, Stanford University, 1988.
#
# \bibitem{mastersthesis-full}
# {\'{E}}.~Masterly.
# \newblock Mastering thesis writing.
# \newblock Master's project, Stanford University, English Department, June-Aug.
# 1988.
# \newblock This is a full MASTERSTHESIS entry.
#
# \bibitem{misc-minimal}
# This is a minimal MISC entry.
#
# \bibitem{misc-full}
# J.-B. Missilany.
# \newblock Handing out random pamphlets in airports.
# \newblock Handed out at O'Hare, Oct. 1984.
# \newblock This is a full MISC entry.
#
# \bibitem{inproceedings-minimal}
# A.~V. Oaho, J.~D. Ullman, and M.~Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In {\em Proc. Fifteenth Annual ACM Symposium on the Theory of
# Computing}, 1983.
#
# \bibitem{inproceedings-full}
# A.~V. Oaho, J.~D. Ullman, and M.~Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In W.~V. Oz and M.~Yannakakis, editors, {\em Proc. Fifteenth Annual
# ACM Symposium on the Theory of Computing}, number~17 in All ACM Conferences,
# pages 133--139, Boston, Mar. 1983. The OX Association for Computing
# Machinery, Academic Press.
# \newblock This is a full INPROCEDINGS entry.
#
# \bibitem{inproceedings-crossref}
# A.~V. Oaho, J.~D. Ullman, and M.~Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In OX{\singleletter{stoc}} \cite{whole-proceedings}, pages 133--139.
# \newblock This is a cross-referencing INPROCEEDINGS entry.
#
# \bibitem{whole-proceedings}
# The OX Association for Computing Machinery.
# \newblock {\em Proc. Fifteenth Annual Symposium on the Theory of Computing},
# Boston, 1983.
# \newblock This is a cross-referenced PROCEEDINGS.
#
# \bibitem{proceedings-minimal}
# {\em Proc. Fifteenth Annual Symposium on the Theory of Computing}, 1983.
#
# \bibitem{proceedings-full}
# W.~V. Oz and M.~Yannakakis, editors.
# \newblock {\em Proc. Fifteenth Annual Symposium on the Theory of Computing},
# number~17 in All ACM Conferences, Boston, Mar. 1983. The OX Association for
# Computing Machinery, Academic Press.
# \newblock This is a full PROCEEDINGS entry.
#
# \bibitem{phdthesis-minimal}
# F.~P. Phony-Baloney.
# \newblock {\em Fighting Fire with Fire: Festooning {F}rench Phrases}.
# \newblock PhD thesis, Fanstord University, 1988.
#
# \bibitem{phdthesis-full}
# F.~P. Phony-Baloney.
# \newblock {\em Fighting Fire with Fire: Festooning {F}rench Phrases}.
# \newblock {PhD} dissertation, Fanstord University, Department of French,
# June-Aug. 1988.
# \newblock This is a full PHDTHESIS entry.
#
# \bibitem{techreport-minimal}
# T.~Terrific.
# \newblock An {$O(n \log n / \! \log\log n)$} sorting algorithm.
# \newblock Technical report, Fanstord University, 1988.
#
# \bibitem{techreport-full}
# T.~T{\'{e}}rrific.
# \newblock An {$O(n \log n / \! \log\log n)$} sorting algorithm.
# \newblock Wishful Research Result~7, Fanstord University, Computer Science
# Department, Fanstord, California, Oct. 1988.
# \newblock This is a full TECHREPORT entry.
#
# \bibitem{unpublished-minimal}
# U.~{\"{U}}nderwood, N.~{\~N}et, and P.~{\={P}}ot.
# \newblock Lower bounds for wishful research results.
# \newblock Talk at Fanstord University (this is a minimal UNPUBLISHED entry).
#
# \bibitem{unpublished-full}
# U.~{\"{U}}nderwood, N.~{\~N}et, and P.~{\={P}}ot.
# \newblock Lower bounds for wishful research results.
# \newblock Talk at Fanstord University (this is a full UNPUBLISHED entry),
Nov.,
# Dec. 1988.
#
# \bibitem{random-note-crossref}
# Volume~2 is listed under Knuth \cite{book-full}.
#
# \end{thebibliography}
# '
# expected: 'Warning--empty author in whole-journal
# Warning--empty title in whole-journal
#
# \newcommand{\noopsort}[1]{} \newcommand{\printfirst}[2]{#1}
# \newcommand{\singleletter}[1]{#1} \newcommand{\switchargs}[2]{#2#1}
# \begin{thebibliography}{10}
#
# \bibitem{article-minimal}
# L.~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock {\em \mbox{G-Animal's} Journal}, 1986.
#
# \bibitem{article-full}
# L.~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock {\em \mbox{G-Animal's} Journal}, 41(7):73+, July 1986.
# \newblock This is a full ARTICLE entry.
#
# \bibitem{article-crossref}
# L.~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock In {\em \mbox{G-Animal's} Journal\/} \cite{whole-journal}, pages
73+.
# \newblock This is a cross-referencing ARTICLE entry.
#
# \bibitem{whole-journal}
# {\em \mbox{G-Animal's} Journal}, 41(7), July 1986.
# \newblock The entire issue is devoted to gnats and gnus (this entry is a
# cross-referenced ARTICLE (journal)).
#
# \bibitem{whole-set}
# D.~E. Knuth.
# \newblock {\em The Art of Computer Programming}.
# \newblock Four volumes. Addison-Wesley,
# {\noopsort{1973a}}{\switchargs{--90}{1968}}.
# \newblock Seven volumes planned (this is a cross-referenced set of BOOKs).
#
# \bibitem{inbook-minimal}
# D.~E. Knuth.
# \newblock {\em Fundamental Algorithms}, chapter 1.2.
# \newblock Addison-Wesley, {\noopsort{1973b}}1973.
#
# \bibitem{inbook-full}
# D.~E. Knuth.
# \newblock {\em Fundamental Algorithms}, volume~1 of {\em The Art of Computer
# Programming}, section 1.2, pages 10--119.
# \newblock Addison-Wesley, Reading, Massachusetts, second edition, 10~Jan.
# {\noopsort{1973b}}1973.
# \newblock This is a full INBOOK entry.
#
# \bibitem{inbook-crossref}
# D.~E. Knuth.
# \newblock {\em Fundamental Algorithms}, section 1.2.
# \newblock Volume~1 of {\em The Art of Computer Programming\/}
\cite{whole-set},
# second edition, {\noopsort{1973b}}1973.
# \newblock This is a cross-referencing INBOOK entry.
#
# \bibitem{book-minimal}
# D.~E. Knuth.
# \newblock {\em Seminumerical Algorithms}.
# \newblock Addison-Wesley, {\noopsort{1973c}}1981.
#
# \bibitem{book-full}
# D.~E. Knuth.
# \newblock {\em Seminumerical Algorithms}, volume~2 of {\em The Art of Computer
# Programming}.
# \newblock Addison-Wesley, Reading, Massachusetts, second edition, 10~Jan.
# {\noopsort{1973c}}1981.
# \newblock This is a full BOOK entry.
#
# \bibitem{book-crossref}
# D.~E. Knuth.
# \newblock {\em Seminumerical Algorithms}.
# \newblock Volume~2 of {\em The Art of Computer Programming\/}
\cite{whole-set},
# second edition, {\noopsort{1973c}}1981.
# \newblock This is a cross-referencing BOOK entry.
#
# \bibitem{booklet-minimal}
# The programming of computer art.
#
# \bibitem{booklet-full}
# J.~C. Knvth.
# \newblock The programming of computer art.
# \newblock Vernier Art Center, Stanford, California, Feb. 1988.
# \newblock This is a full BOOKLET entry.
#
# \bibitem{incollection-minimal}
# D.~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In {\em High Speed Computer and Algorithm Organization}. Academic
# Press, 1977.
#
# \bibitem{incollection-full}
# D.~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In D.~J. Lipcoll, D.~H. Lawrie, and A.~H. Sameh, editors, {\em High
# Speed Computer and Algorithm Organization}, number~23 in Fast Computers,
# part~3, pages 179--183. Academic Press, New York, third edition, Sept. 1977.
# \newblock This is a full INCOLLECTION entry.
#
# \bibitem{incollection-crossref}
# D.~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In Lipcoll et~al. \cite{whole-collection}, pages 179--183.
# \newblock This is a cross-referencing INCOLLECTION entry.
#
# \bibitem{whole-collection}
# D.~J. Lipcoll, D.~H. Lawrie, and A.~H. Sameh, editors.
# \newblock {\em High Speed Computer and Algorithm Organization}.
# \newblock Number~23 in Fast Computers. Academic Press, New York, third
edition,
# Sept. 1977.
# \newblock This is a cross-referenced BOOK (collection) entry.
#
# \bibitem{manual-minimal}
# {\em The Definitive Computer Manual}.
#
# \bibitem{manual-full}
# L.~Manmaker.
# \newblock {\em The Definitive Computer Manual}.
# \newblock Chips-R-Us, Silicon Valley, silver edition, Apr.-May 1986.
# \newblock This is a full MANUAL entry.
#
# \bibitem{mastersthesis-minimal}
# {\'{E}}.~Masterly.
# \newblock Mastering thesis writing.
# \newblock Master's thesis, Stanford University, 1988.
#
# \bibitem{mastersthesis-full}
# {\'{E}}.~Masterly.
# \newblock Mastering thesis writing.
# \newblock Master's project, Stanford University, English Department, June-Aug.
# 1988.
# \newblock This is a full MASTERSTHESIS entry.
#
# \bibitem{misc-minimal}
# This is a minimal MISC entry.
#
# \bibitem{misc-full}
# J.-B. Missilany.
# \newblock Handing out random pamphlets in airports.
# \newblock Handed out at O'Hare, Oct. 1984.
# \newblock This is a full MISC entry.
#
# \bibitem{inproceedings-minimal}
# A.~V. Oaho, J.~D. Ullman, and M.~Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In {\em Proc. Fifteenth Annual ACM Symposium on the Theory of
# Computing}, 1983.
#
# \bibitem{inproceedings-full}
# A.~V. Oaho, J.~D. Ullman, and M.~Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In W.~V. Oz and M.~Yannakakis, editors, {\em Proc. Fifteenth Annual
# ACM Symposium on the Theory of Computing}, number~17 in All ACM Conferences,
# pages 133--139, Boston, Mar. 1983. The OX Association for Computing
# Machinery, Academic Press.
# \newblock This is a full INPROCEDINGS entry.
#
# \bibitem{inproceedings-crossref}
# A.~V. Oaho, J.~D. Ullman, and M.~Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In OX{\singleletter{stoc}} \cite{whole-proceedings}, pages 133--139.
# \newblock This is a cross-referencing INPROCEEDINGS entry.
#
# \bibitem{whole-proceedings}
# The OX Association for Computing Machinery.
# \newblock {\em Proc. Fifteenth Annual Symposium on the Theory of Computing},
# Boston, 1983.
# \newblock This is a cross-referenced PROCEEDINGS.
#
# \bibitem{proceedings-minimal}
# {\em Proc. Fifteenth Annual Symposium on the Theory of Computing}, 1983.
#
# \bibitem{proceedings-full}
# W.~V. Oz and M.~Yannakakis, editors.
# \newblock {\em Proc. Fifteenth Annual Symposium on the Theory of Computing},
# number~17 in All ACM Conferences, Boston, Mar. 1983. The OX Association for
# Computing Machinery, Academic Press.
# \newblock This is a full PROCEEDINGS entry.
#
# \bibitem{phdthesis-minimal}
# F.~P. Phony-Baloney.
# \newblock {\em Fighting Fire with Fire: Festooning {F}rench Phrases}.
# \newblock PhD thesis, Fanstord University, 1988.
#
# \bibitem{phdthesis-full}
# F.~P. Phony-Baloney.
# \newblock {\em Fighting Fire with Fire: Festooning {F}rench Phrases}.
# \newblock {PhD} dissertation, Fanstord University, Department of French,
# June-Aug. 1988.
# \newblock This is a full PHDTHESIS entry.
#
# \bibitem{techreport-minimal}
# T.~Terrific.
# \newblock An {$O(n \log n / \! \log\log n)$} sorting algorithm.
# \newblock Technical report, Fanstord University, 1988.
#
# \bibitem{techreport-full}
# T.~T{\'{e}}rrific.
# \newblock An {$O(n \log n / \! \log\log n)$} sorting algorithm.
# \newblock Wishful Research Result~7, Fanstord University, Computer Science
# Department, Fanstord, California, Oct. 1988.
# \newblock This is a full TECHREPORT entry.
#
# \bibitem{unpublished-minimal}
# U.~{\"{U}}nderwood, N.~{\~N}et, and P.~{\={P}}ot.
# \newblock Lower bounds for wishful research results.
# \newblock Talk at Fanstord University (this is a minimal UNPUBLISHED entry).
#
# \bibitem{unpublished-full}
# U.~{\"{U}}nderwood, N.~{\~N}et, and P.~{\={P}}ot.
# \newblock Lower bounds for wishful research results.
# \newblock Talk at Fanstord University (this is a full UNPUBLISHED entry),
Nov.,
# Dec. 1988.
#
# \bibitem{random-note-crossref}
# Volume~2 is listed under Knuth \cite{book-full}.
#
# \end{thebibliography}
# '
bibs/xampl.bib, line 29, warning: 125 characters of junk seen at toplevel
# Failed test 'alpha'
# at t/20_xampl.t line 47.
# got: 'Warning--empty author in whole-journal
# Warning--empty title in whole-journal
#
# \newcommand{\noopsort}[1]{} \newcommand{\printfirst}[2]{#1}
# \newcommand{\singleletter}[1]{#1} \newcommand{\switchargs}[2]{#2#1}
# \begin{thebibliography}{OX{\singleletter{stoc}}83b}
#
# \bibitem[Aam86a]{article-minimal}
# L[eslie]~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock {\em \mbox{G-Animal's} Journal}, 1986.
#
# \bibitem[Aam86b]{article-full}
# L[eslie]~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock {\em \mbox{G-Animal's} Journal}, 41(7):73+, July 1986.
# \newblock This is a full ARTICLE entry.
#
# \bibitem[Aam86c]{article-crossref}
# L[eslie]~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock In {\em \mbox{G-Animal's} Journal\/} \cite{whole-journal}, pages
73+.
# \newblock This is a cross-referencing ARTICLE entry.
#
# \bibitem[GAJ86]{whole-journal}
# {\em \mbox{G-Animal's} Journal}, 41(7), July 1986.
# \newblock The entire issue is devoted to gnats and gnus (this entry is a
# cross-referenced ARTICLE (journal)).
#
# \bibitem[Knu68]{whole-set}
# Donald~E. Knuth.
# \newblock {\em The Art of Computer Programming}.
# \newblock Four volumes. Addison-Wesley,
# {\noopsort{1973a}}{\switchargs{--90}{1968}}.
# \newblock Seven volumes planned (this is a cross-referenced set of BOOKs).
#
# \bibitem[Knu73a]{inbook-minimal}
# Donald~E. Knuth.
# \newblock {\em Fundamental Algorithms}, chapter 1.2.
# \newblock Addison-Wesley, {\noopsort{1973b}}1973.
#
# \bibitem[Knu73b]{inbook-full}
# Donald~E. Knuth.
# \newblock {\em Fundamental Algorithms}, volume~1 of {\em The Art of Computer
# Programming}, section 1.2, pages 10--119.
# \newblock Addison-Wesley, Reading, Massachusetts, second edition, 10~January
# {\noopsort{1973b}}1973.
# \newblock This is a full INBOOK entry.
#
# \bibitem[Knu73c]{inbook-crossref}
# Donald~E. Knuth.
# \newblock {\em Fundamental Algorithms}, section 1.2.
# \newblock Volume~1 of {\em The Art of Computer Programming\/}
\cite{whole-set},
# second edition, {\noopsort{1973b}}1973.
# \newblock This is a cross-referencing INBOOK entry.
#
# \bibitem[Knu81a]{book-full}
# Donald~E. Knuth.
# \newblock {\em Seminumerical Algorithms}, volume~2 of {\em The Art of Computer
# Programming}.
# \newblock Addison-Wesley, Reading, Massachusetts, second edition, 10~January
# {\noopsort{1973c}}1981.
# \newblock This is a full BOOK entry.
#
# \bibitem[Knu81b]{book-crossref}
# Donald~E. Knuth.
# \newblock {\em Seminumerical Algorithms}.
# \newblock Volume~2 of {\em The Art of Computer Programming\/}
\cite{whole-set},
# second edition, {\noopsort{1973c}}1981.
# \newblock This is a cross-referencing BOOK entry.
#
# \bibitem[Knu81c]{book-minimal}
# Donald~E. Knuth.
# \newblock {\em Seminumerical Algorithms}.
# \newblock Addison-Wesley, {\noopsort{1973c}}1981.
#
# \bibitem[Kn{\printfirst{v}{1987}}]{booklet-minimal}
# The programming of computer art.
#
# \bibitem[Knv88]{booklet-full}
# Jill~C. Knvth.
# \newblock The programming of computer art.
# \newblock Vernier Art Center, Stanford, California, February 1988.
# \newblock This is a full BOOKLET entry.
#
# \bibitem[Lin77a]{incollection-minimal}
# Daniel~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In {\em High Speed Computer and Algorithm Organization}. Academic
# Press, 1977.
#
# \bibitem[Lin77b]{incollection-full}
# Daniel~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In David~J. Lipcoll, D.~H. Lawrie, and A.~H. Sameh, editors, {\em
# High Speed Computer and Algorithm Organization}, number~23 in Fast
Computers,
# part~3, pages 179--183. Academic Press, New York, third edition, September
# 1977.
# \newblock This is a full INCOLLECTION entry.
#
# \bibitem[Lin77c]{incollection-crossref}
# Daniel~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In Lipcoll et~al. \cite{whole-collection}, pages 179--183.
# \newblock This is a cross-referencing INCOLLECTION entry.
#
# \bibitem[LLS77]{whole-collection}
# David~J. Lipcoll, D.~H. Lawrie, and A.~H. Sameh, editors.
# \newblock {\em High Speed Computer and Algorithm Organization}.
# \newblock Number~23 in Fast Computers. Academic Press, New York, third
edition,
# September 1977.
# \newblock This is a cross-referenced BOOK (collection) entry.
#
# \bibitem[Man]{manual-minimal}
# {\em The Definitive Computer Manual}.
#
# \bibitem[Man86]{manual-full}
# Larry Manmaker.
# \newblock {\em The Definitive Computer Manual}.
# \newblock Chips-R-Us, Silicon Valley, silver edition, April-May 1986.
# \newblock This is a full MANUAL entry.
#
# \bibitem[Mas88a]{mastersthesis-minimal}
# {\'{E}}douard Masterly.
# \newblock Mastering thesis writing.
# \newblock Master's thesis, Stanford University, 1988.
#
# \bibitem[Mas88b]{mastersthesis-full}
# {\'{E}}douard Masterly.
# \newblock Mastering thesis writing.
# \newblock Master's project, Stanford University, English Department,
# June-August 1988.
# \newblock This is a full MASTERSTHESIS entry.
#
# \bibitem[Mis]{misc-minimal}
# This is a minimal MISC entry.
#
# \bibitem[Mis84]{misc-full}
# Joe-Bob Missilany.
# \newblock Handing out random pamphlets in airports.
# \newblock Handed out at O'Hare, October 1984.
# \newblock This is a full MISC entry.
#
# \bibitem[OUY83a]{inproceedings-minimal}
# Alfred~V. Oaho, Jeffrey~D. Ullman, and Mihalis Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In {\em Proc. Fifteenth Annual ACM Symposium on the Theory of
# Computing}, 1983.
#
# \bibitem[OUY83b]{inproceedings-full}
# Alfred~V. Oaho, Jeffrey~D. Ullman, and Mihalis Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In Wizard~V. Oz and Mihalis Yannakakis, editors, {\em Proc.
Fifteenth
# Annual ACM Symposium on the Theory of Computing}, number~17 in All ACM
# Conferences, pages 133--139, Boston, March 1983. The OX Association for
# Computing Machinery, Academic Press.
# \newblock This is a full INPROCEDINGS entry.
#
# \bibitem[OUY83c]{inproceedings-crossref}
# Alfred~V. Oaho, Jeffrey~D. Ullman, and Mihalis Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In OX{\singleletter{stoc}} \cite{whole-proceedings}, pages 133--139.
# \newblock This is a cross-referencing INPROCEEDINGS entry.
#
# \bibitem[OX{\singleletter{stoc}}83a]{whole-proceedings}
# The OX Association for Computing Machinery.
# \newblock {\em Proc. Fifteenth Annual Symposium on the Theory of Computing},
# Boston, 1983.
# \newblock This is a cross-referenced PROCEEDINGS.
#
# \bibitem[OX{\singleletter{stoc}}83b]{proceedings-minimal}
# {\em Proc. Fifteenth Annual Symposium on the Theory of Computing}, 1983.
#
# \bibitem[OY83]{proceedings-full}
# Wizard~V. Oz and Mihalis Yannakakis, editors.
# \newblock {\em Proc. Fifteenth Annual Symposium on the Theory of Computing},
# number~17 in All ACM Conferences, Boston, March 1983. The OX Association for
# Computing Machinery, Academic Press.
# \newblock This is a full PROCEEDINGS entry.
#
# \bibitem[PB88a]{phdthesis-minimal}
# F.~Phidias Phony-Baloney.
# \newblock {\em Fighting Fire with Fire: Festooning {F}rench Phrases}.
# \newblock PhD thesis, Fanstord University, 1988.
#
# \bibitem[PB88b]{phdthesis-full}
# F.~Phidias Phony-Baloney.
# \newblock {\em Fighting Fire with Fire: Festooning {F}rench Phrases}.
# \newblock {PhD} dissertation, Fanstord University, Department of French,
# June-August 1988.
# \newblock This is a full PHDTHESIS entry.
#
# \bibitem[Ter88a]{techreport-minimal}
# Tom Terrific.
# \newblock An {$O(n \log n / \! \log\log n)$} sorting algorithm.
# \newblock Technical report, Fanstord University, 1988.
#
# \bibitem[T{\'{e}}r88b]{techreport-full}
# Tom T{\'{e}}rrific.
# \newblock An {$O(n \log n / \! \log\log n)$} sorting algorithm.
# \newblock Wishful Research Result~7, Fanstord University, Computer Science
# Department, Fanstord, California, October 1988.
# \newblock This is a full TECHREPORT entry.
#
# \bibitem[{\"{U}}{\~N}{\={P}}]{unpublished-minimal}
# Ulrich {\"{U}}nderwood, Ned {\~N}et, and Paul {\={P}}ot.
# \newblock Lower bounds for wishful research results.
# \newblock Talk at Fanstord University (this is a minimal UNPUBLISHED entry).
#
# \bibitem[{\"{U}}{\~N}{\={P}}88]{unpublished-full}
# Ulrich {\"{U}}nderwood, Ned {\~N}et, and Paul {\={P}}ot.
# \newblock Lower bounds for wishful research results.
# \newblock Talk at Fanstord University (this is a full UNPUBLISHED entry),
# November, December 1988.
#
# \bibitem[Vol]{random-note-crossref}
# Volume~2 is listed under Knuth \cite{book-full}.
#
# \end{thebibliography}
# '
# expected: 'Warning--empty author in whole-journal
# Warning--empty title in whole-journal
#
# \newcommand{\noopsort}[1]{} \newcommand{\printfirst}[2]{#1}
# \newcommand{\singleletter}[1]{#1} \newcommand{\switchargs}[2]{#2#1}
# \begin{thebibliography}{OX{\singleletter{stoc}}83b}
#
# \bibitem[Aam86a]{article-minimal}
# L[eslie]~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock {\em \mbox{G-Animal's} Journal}, 1986.
#
# \bibitem[Aam86b]{article-full}
# L[eslie]~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock {\em \mbox{G-Animal's} Journal}, 41(7):73+, July 1986.
# \newblock This is a full ARTICLE entry.
#
# \bibitem[Aam86c]{article-crossref}
# L[eslie]~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock In {\em \mbox{G-Animal's} Journal\/} \cite{whole-journal}, pages
73+.
# \newblock This is a cross-referencing ARTICLE entry.
#
# \bibitem[GAJ86]{whole-journal}
# {\em \mbox{G-Animal's} Journal}, 41(7), July 1986.
# \newblock The entire issue is devoted to gnats and gnus (this entry is a
# cross-referenced ARTICLE (journal)).
#
# \bibitem[Knu68]{whole-set}
# Donald~E. Knuth.
# \newblock {\em The Art of Computer Programming}.
# \newblock Four volumes. Addison-Wesley,
# {\noopsort{1973a}}{\switchargs{--90}{1968}}.
# \newblock Seven volumes planned (this is a cross-referenced set of BOOKs).
#
# \bibitem[Knu73a]{inbook-minimal}
# Donald~E. Knuth.
# \newblock {\em Fundamental Algorithms}, chapter 1.2.
# \newblock Addison-Wesley, {\noopsort{1973b}}1973.
#
# \bibitem[Knu73b]{inbook-full}
# Donald~E. Knuth.
# \newblock {\em Fundamental Algorithms}, volume~1 of {\em The Art of Computer
# Programming}, section 1.2, pages 10--119.
# \newblock Addison-Wesley, Reading, Massachusetts, second edition, 10~January
# {\noopsort{1973b}}1973.
# \newblock This is a full INBOOK entry.
#
# \bibitem[Knu73c]{inbook-crossref}
# Donald~E. Knuth.
# \newblock {\em Fundamental Algorithms}, section 1.2.
# \newblock Volume~1 of {\em The Art of Computer Programming\/}
\cite{whole-set},
# second edition, {\noopsort{1973b}}1973.
# \newblock This is a cross-referencing INBOOK entry.
#
# \bibitem[Knu81a]{book-minimal}
# Donald~E. Knuth.
# \newblock {\em Seminumerical Algorithms}.
# \newblock Addison-Wesley, {\noopsort{1973c}}1981.
#
# \bibitem[Knu81b]{book-full}
# Donald~E. Knuth.
# \newblock {\em Seminumerical Algorithms}, volume~2 of {\em The Art of Computer
# Programming}.
# \newblock Addison-Wesley, Reading, Massachusetts, second edition, 10~January
# {\noopsort{1973c}}1981.
# \newblock This is a full BOOK entry.
#
# \bibitem[Knu81c]{book-crossref}
# Donald~E. Knuth.
# \newblock {\em Seminumerical Algorithms}.
# \newblock Volume~2 of {\em The Art of Computer Programming\/}
\cite{whole-set},
# second edition, {\noopsort{1973c}}1981.
# \newblock This is a cross-referencing BOOK entry.
#
# \bibitem[Kn{\printfirst{v}{1987}}]{booklet-minimal}
# The programming of computer art.
#
# \bibitem[Knv88]{booklet-full}
# Jill~C. Knvth.
# \newblock The programming of computer art.
# \newblock Vernier Art Center, Stanford, California, February 1988.
# \newblock This is a full BOOKLET entry.
#
# \bibitem[Lin77a]{incollection-minimal}
# Daniel~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In {\em High Speed Computer and Algorithm Organization}. Academic
# Press, 1977.
#
# \bibitem[Lin77b]{incollection-full}
# Daniel~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In David~J. Lipcoll, D.~H. Lawrie, and A.~H. Sameh, editors, {\em
# High Speed Computer and Algorithm Organization}, number~23 in Fast
Computers,
# part~3, pages 179--183. Academic Press, New York, third edition, September
# 1977.
# \newblock This is a full INCOLLECTION entry.
#
# \bibitem[Lin77c]{incollection-crossref}
# Daniel~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In Lipcoll et~al. \cite{whole-collection}, pages 179--183.
# \newblock This is a cross-referencing INCOLLECTION entry.
#
# \bibitem[LLS77]{whole-collection}
# David~J. Lipcoll, D.~H. Lawrie, and A.~H. Sameh, editors.
# \newblock {\em High Speed Computer and Algorithm Organization}.
# \newblock Number~23 in Fast Computers. Academic Press, New York, third
edition,
# September 1977.
# \newblock This is a cross-referenced BOOK (collection) entry.
#
# \bibitem[Man]{manual-minimal}
# {\em The Definitive Computer Manual}.
#
# \bibitem[Man86]{manual-full}
# Larry Manmaker.
# \newblock {\em The Definitive Computer Manual}.
# \newblock Chips-R-Us, Silicon Valley, silver edition, April-May 1986.
# \newblock This is a full MANUAL entry.
#
# \bibitem[Mas88a]{mastersthesis-minimal}
# {\'{E}}douard Masterly.
# \newblock Mastering thesis writing.
# \newblock Master's thesis, Stanford University, 1988.
#
# \bibitem[Mas88b]{mastersthesis-full}
# {\'{E}}douard Masterly.
# \newblock Mastering thesis writing.
# \newblock Master's project, Stanford University, English Department,
# June-August 1988.
# \newblock This is a full MASTERSTHESIS entry.
#
# \bibitem[Mis]{misc-minimal}
# This is a minimal MISC entry.
#
# \bibitem[Mis84]{misc-full}
# Joe-Bob Missilany.
# \newblock Handing out random pamphlets in airports.
# \newblock Handed out at O'Hare, October 1984.
# \newblock This is a full MISC entry.
#
# \bibitem[OUY83a]{inproceedings-minimal}
# Alfred~V. Oaho, Jeffrey~D. Ullman, and Mihalis Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In {\em Proc. Fifteenth Annual ACM Symposium on the Theory of
# Computing}, 1983.
#
# \bibitem[OUY83b]{inproceedings-full}
# Alfred~V. Oaho, Jeffrey~D. Ullman, and Mihalis Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In Wizard~V. Oz and Mihalis Yannakakis, editors, {\em Proc.
Fifteenth
# Annual ACM Symposium on the Theory of Computing}, number~17 in All ACM
# Conferences, pages 133--139, Boston, March 1983. The OX Association for
# Computing Machinery, Academic Press.
# \newblock This is a full INPROCEDINGS entry.
#
# \bibitem[OUY83c]{inproceedings-crossref}
# Alfred~V. Oaho, Jeffrey~D. Ullman, and Mihalis Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In OX{\singleletter{stoc}} \cite{whole-proceedings}, pages 133--139.
# \newblock This is a cross-referencing INPROCEEDINGS entry.
#
# \bibitem[OX{\singleletter{stoc}}83a]{whole-proceedings}
# The OX Association for Computing Machinery.
# \newblock {\em Proc. Fifteenth Annual Symposium on the Theory of Computing},
# Boston, 1983.
# \newblock This is a cross-referenced PROCEEDINGS.
#
# \bibitem[OX{\singleletter{stoc}}83b]{proceedings-minimal}
# {\em Proc. Fifteenth Annual Symposium on the Theory of Computing}, 1983.
#
# \bibitem[OY83]{proceedings-full}
# Wizard~V. Oz and Mihalis Yannakakis, editors.
# \newblock {\em Proc. Fifteenth Annual Symposium on the Theory of Computing},
# number~17 in All ACM Conferences, Boston, March 1983. The OX Association for
# Computing Machinery, Academic Press.
# \newblock This is a full PROCEEDINGS entry.
#
# \bibitem[PB88a]{phdthesis-minimal}
# F.~Phidias Phony-Baloney.
# \newblock {\em Fighting Fire with Fire: Festooning {F}rench Phrases}.
# \newblock PhD thesis, Fanstord University, 1988.
#
# \bibitem[PB88b]{phdthesis-full}
# F.~Phidias Phony-Baloney.
# \newblock {\em Fighting Fire with Fire: Festooning {F}rench Phrases}.
# \newblock {PhD} dissertation, Fanstord University, Department of French,
# June-August 1988.
# \newblock This is a full PHDTHESIS entry.
#
# \bibitem[Ter88a]{techreport-minimal}
# Tom Terrific.
# \newblock An {$O(n \log n / \! \log\log n)$} sorting algorithm.
# \newblock Technical report, Fanstord University, 1988.
#
# \bibitem[T{\'{e}}r88b]{techreport-full}
# Tom T{\'{e}}rrific.
# \newblock An {$O(n \log n / \! \log\log n)$} sorting algorithm.
# \newblock Wishful Research Result~7, Fanstord University, Computer Science
# Department, Fanstord, California, October 1988.
# \newblock This is a full TECHREPORT entry.
#
# \bibitem[{\"{U}}{\~N}{\={P}}]{unpublished-minimal}
# Ulrich {\"{U}}nderwood, Ned {\~N}et, and Paul {\={P}}ot.
# \newblock Lower bounds for wishful research results.
# \newblock Talk at Fanstord University (this is a minimal UNPUBLISHED entry).
#
# \bibitem[{\"{U}}{\~N}{\={P}}88]{unpublished-full}
# Ulrich {\"{U}}nderwood, Ned {\~N}et, and Paul {\={P}}ot.
# \newblock Lower bounds for wishful research results.
# \newblock Talk at Fanstord University (this is a full UNPUBLISHED entry),
# November, December 1988.
#
# \bibitem[Vol]{random-note-crossref}
# Volume~2 is listed under Knuth \cite{book-full}.
#
# \end{thebibliography}
# '
bibs/xampl.bib, line 29, warning: 125 characters of junk seen at toplevel
bibs/xampl.bib, line 29, warning: 125 characters of junk seen at toplevel
# Failed test 'plain'
# at t/20_xampl.t line 47.
# got: 'Warning--empty author in whole-journal
# Warning--empty title in whole-journal
#
# \newcommand{\noopsort}[1]{} \newcommand{\printfirst}[2]{#1}
# \newcommand{\singleletter}[1]{#1} \newcommand{\switchargs}[2]{#2#1}
# \begin{thebibliography}{10}
#
# \bibitem{article-minimal}
# L[eslie]~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock {\em \mbox{G-Animal's} Journal}, 1986.
#
# \bibitem{article-full}
# L[eslie]~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock {\em \mbox{G-Animal's} Journal}, 41(7):73+, July 1986.
# \newblock This is a full ARTICLE entry.
#
# \bibitem{article-crossref}
# L[eslie]~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock In {\em \mbox{G-Animal's} Journal\/} \cite{whole-journal}, pages
73+.
# \newblock This is a cross-referencing ARTICLE entry.
#
# \bibitem{whole-journal}
# {\em \mbox{G-Animal's} Journal}, 41(7), July 1986.
# \newblock The entire issue is devoted to gnats and gnus (this entry is a
# cross-referenced ARTICLE (journal)).
#
# \bibitem{whole-set}
# Donald~E. Knuth.
# \newblock {\em The Art of Computer Programming}.
# \newblock Four volumes. Addison-Wesley,
# {\noopsort{1973a}}{\switchargs{--90}{1968}}.
# \newblock Seven volumes planned (this is a cross-referenced set of BOOKs).
#
# \bibitem{inbook-minimal}
# Donald~E. Knuth.
# \newblock {\em Fundamental Algorithms}, chapter 1.2.
# \newblock Addison-Wesley, {\noopsort{1973b}}1973.
#
# \bibitem{inbook-full}
# Donald~E. Knuth.
# \newblock {\em Fundamental Algorithms}, volume~1 of {\em The Art of Computer
# Programming}, section 1.2, pages 10--119.
# \newblock Addison-Wesley, Reading, Massachusetts, second edition, 10~January
# {\noopsort{1973b}}1973.
# \newblock This is a full INBOOK entry.
#
# \bibitem{inbook-crossref}
# Donald~E. Knuth.
# \newblock {\em Fundamental Algorithms}, section 1.2.
# \newblock Volume~1 of {\em The Art of Computer Programming\/}
\cite{whole-set},
# second edition, {\noopsort{1973b}}1973.
# \newblock This is a cross-referencing INBOOK entry.
#
# \bibitem{book-full}
# Donald~E. Knuth.
# \newblock {\em Seminumerical Algorithms}, volume~2 of {\em The Art of Computer
# Programming}.
# \newblock Addison-Wesley, Reading, Massachusetts, second edition, 10~January
# {\noopsort{1973c}}1981.
# \newblock This is a full BOOK entry.
#
# \bibitem{book-crossref}
# Donald~E. Knuth.
# \newblock {\em Seminumerical Algorithms}.
# \newblock Volume~2 of {\em The Art of Computer Programming\/}
\cite{whole-set},
# second edition, {\noopsort{1973c}}1981.
# \newblock This is a cross-referencing BOOK entry.
#
# \bibitem{book-minimal}
# Donald~E. Knuth.
# \newblock {\em Seminumerical Algorithms}.
# \newblock Addison-Wesley, {\noopsort{1973c}}1981.
#
# \bibitem{booklet-minimal}
# The programming of computer art.
#
# \bibitem{booklet-full}
# Jill~C. Knvth.
# \newblock The programming of computer art.
# \newblock Vernier Art Center, Stanford, California, February 1988.
# \newblock This is a full BOOKLET entry.
#
# \bibitem{incollection-minimal}
# Daniel~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In {\em High Speed Computer and Algorithm Organization}. Academic
# Press, 1977.
#
# \bibitem{incollection-full}
# Daniel~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In David~J. Lipcoll, D.~H. Lawrie, and A.~H. Sameh, editors, {\em
# High Speed Computer and Algorithm Organization}, number~23 in Fast
Computers,
# part~3, pages 179--183. Academic Press, New York, third edition, September
# 1977.
# \newblock This is a full INCOLLECTION entry.
#
# \bibitem{incollection-crossref}
# Daniel~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In Lipcoll et~al. \cite{whole-collection}, pages 179--183.
# \newblock This is a cross-referencing INCOLLECTION entry.
#
# \bibitem{whole-collection}
# David~J. Lipcoll, D.~H. Lawrie, and A.~H. Sameh, editors.
# \newblock {\em High Speed Computer and Algorithm Organization}.
# \newblock Number~23 in Fast Computers. Academic Press, New York, third
edition,
# September 1977.
# \newblock This is a cross-referenced BOOK (collection) entry.
#
# \bibitem{manual-minimal}
# {\em The Definitive Computer Manual}.
#
# \bibitem{manual-full}
# Larry Manmaker.
# \newblock {\em The Definitive Computer Manual}.
# \newblock Chips-R-Us, Silicon Valley, silver edition, April-May 1986.
# \newblock This is a full MANUAL entry.
#
# \bibitem{mastersthesis-minimal}
# {\'{E}}douard Masterly.
# \newblock Mastering thesis writing.
# \newblock Master's thesis, Stanford University, 1988.
#
# \bibitem{mastersthesis-full}
# {\'{E}}douard Masterly.
# \newblock Mastering thesis writing.
# \newblock Master's project, Stanford University, English Department,
# June-August 1988.
# \newblock This is a full MASTERSTHESIS entry.
#
# \bibitem{misc-minimal}
# This is a minimal MISC entry.
#
# \bibitem{misc-full}
# Joe-Bob Missilany.
# \newblock Handing out random pamphlets in airports.
# \newblock Handed out at O'Hare, October 1984.
# \newblock This is a full MISC entry.
#
# \bibitem{inproceedings-minimal}
# Alfred~V. Oaho, Jeffrey~D. Ullman, and Mihalis Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In {\em Proc. Fifteenth Annual ACM Symposium on the Theory of
# Computing}, 1983.
#
# \bibitem{inproceedings-full}
# Alfred~V. Oaho, Jeffrey~D. Ullman, and Mihalis Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In Wizard~V. Oz and Mihalis Yannakakis, editors, {\em Proc.
Fifteenth
# Annual ACM Symposium on the Theory of Computing}, number~17 in All ACM
# Conferences, pages 133--139, Boston, March 1983. The OX Association for
# Computing Machinery, Academic Press.
# \newblock This is a full INPROCEDINGS entry.
#
# \bibitem{inproceedings-crossref}
# Alfred~V. Oaho, Jeffrey~D. Ullman, and Mihalis Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In OX{\singleletter{stoc}} \cite{whole-proceedings}, pages 133--139.
# \newblock This is a cross-referencing INPROCEEDINGS entry.
#
# \bibitem{whole-proceedings}
# The OX Association for Computing Machinery.
# \newblock {\em Proc. Fifteenth Annual Symposium on the Theory of Computing},
# Boston, 1983.
# \newblock This is a cross-referenced PROCEEDINGS.
#
# \bibitem{proceedings-minimal}
# {\em Proc. Fifteenth Annual Symposium on the Theory of Computing}, 1983.
#
# \bibitem{proceedings-full}
# Wizard~V. Oz and Mihalis Yannakakis, editors.
# \newblock {\em Proc. Fifteenth Annual Symposium on the Theory of Computing},
# number~17 in All ACM Conferences, Boston, March 1983. The OX Association for
# Computing Machinery, Academic Press.
# \newblock This is a full PROCEEDINGS entry.
#
# \bibitem{phdthesis-minimal}
# F.~Phidias Phony-Baloney.
# \newblock {\em Fighting Fire with Fire: Festooning {F}rench Phrases}.
# \newblock PhD thesis, Fanstord University, 1988.
#
# \bibitem{phdthesis-full}
# F.~Phidias Phony-Baloney.
# \newblock {\em Fighting Fire with Fire: Festooning {F}rench Phrases}.
# \newblock {PhD} dissertation, Fanstord University, Department of French,
# June-August 1988.
# \newblock This is a full PHDTHESIS entry.
#
# \bibitem{techreport-minimal}
# Tom Terrific.
# \newblock An {$O(n \log n / \! \log\log n)$} sorting algorithm.
# \newblock Technical report, Fanstord University, 1988.
#
# \bibitem{techreport-full}
# Tom T{\'{e}}rrific.
# \newblock An {$O(n \log n / \! \log\log n)$} sorting algorithm.
# \newblock Wishful Research Result~7, Fanstord University, Computer Science
# Department, Fanstord, California, October 1988.
# \newblock This is a full TECHREPORT entry.
#
# \bibitem{unpublished-minimal}
# Ulrich {\"{U}}nderwood, Ned {\~N}et, and Paul {\={P}}ot.
# \newblock Lower bounds for wishful research results.
# \newblock Talk at Fanstord University (this is a minimal UNPUBLISHED entry).
#
# \bibitem{unpublished-full}
# Ulrich {\"{U}}nderwood, Ned {\~N}et, and Paul {\={P}}ot.
# \newblock Lower bounds for wishful research results.
# \newblock Talk at Fanstord University (this is a full UNPUBLISHED entry),
# November, December 1988.
#
# \bibitem{random-note-crossref}
# Volume~2 is listed under Knuth \cite{book-full}.
#
# \end{thebibliography}
# '
# expected: 'Warning--empty author in whole-journal
# Warning--empty title in whole-journal
#
# \newcommand{\noopsort}[1]{} \newcommand{\printfirst}[2]{#1}
# \newcommand{\singleletter}[1]{#1} \newcommand{\switchargs}[2]{#2#1}
# \begin{thebibliography}{10}
#
# \bibitem{article-minimal}
# L[eslie]~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock {\em \mbox{G-Animal's} Journal}, 1986.
#
# \bibitem{article-full}
# L[eslie]~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock {\em \mbox{G-Animal's} Journal}, 41(7):73+, July 1986.
# \newblock This is a full ARTICLE entry.
#
# \bibitem{article-crossref}
# L[eslie]~A. Aamport.
# \newblock The gnats and gnus document preparation system.
# \newblock In {\em \mbox{G-Animal's} Journal\/} \cite{whole-journal}, pages
73+.
# \newblock This is a cross-referencing ARTICLE entry.
#
# \bibitem{whole-journal}
# {\em \mbox{G-Animal's} Journal}, 41(7), July 1986.
# \newblock The entire issue is devoted to gnats and gnus (this entry is a
# cross-referenced ARTICLE (journal)).
#
# \bibitem{whole-set}
# Donald~E. Knuth.
# \newblock {\em The Art of Computer Programming}.
# \newblock Four volumes. Addison-Wesley,
# {\noopsort{1973a}}{\switchargs{--90}{1968}}.
# \newblock Seven volumes planned (this is a cross-referenced set of BOOKs).
#
# \bibitem{inbook-minimal}
# Donald~E. Knuth.
# \newblock {\em Fundamental Algorithms}, chapter 1.2.
# \newblock Addison-Wesley, {\noopsort{1973b}}1973.
#
# \bibitem{inbook-full}
# Donald~E. Knuth.
# \newblock {\em Fundamental Algorithms}, volume~1 of {\em The Art of Computer
# Programming}, section 1.2, pages 10--119.
# \newblock Addison-Wesley, Reading, Massachusetts, second edition, 10~January
# {\noopsort{1973b}}1973.
# \newblock This is a full INBOOK entry.
#
# \bibitem{inbook-crossref}
# Donald~E. Knuth.
# \newblock {\em Fundamental Algorithms}, section 1.2.
# \newblock Volume~1 of {\em The Art of Computer Programming\/}
\cite{whole-set},
# second edition, {\noopsort{1973b}}1973.
# \newblock This is a cross-referencing INBOOK entry.
#
# \bibitem{book-minimal}
# Donald~E. Knuth.
# \newblock {\em Seminumerical Algorithms}.
# \newblock Addison-Wesley, {\noopsort{1973c}}1981.
#
# \bibitem{book-full}
# Donald~E. Knuth.
# \newblock {\em Seminumerical Algorithms}, volume~2 of {\em The Art of Computer
# Programming}.
# \newblock Addison-Wesley, Reading, Massachusetts, second edition, 10~January
# {\noopsort{1973c}}1981.
# \newblock This is a full BOOK entry.
#
# \bibitem{book-crossref}
# Donald~E. Knuth.
# \newblock {\em Seminumerical Algorithms}.
# \newblock Volume~2 of {\em The Art of Computer Programming\/}
\cite{whole-set},
# second edition, {\noopsort{1973c}}1981.
# \newblock This is a cross-referencing BOOK entry.
#
# \bibitem{booklet-minimal}
# The programming of computer art.
#
# \bibitem{booklet-full}
# Jill~C. Knvth.
# \newblock The programming of computer art.
# \newblock Vernier Art Center, Stanford, California, February 1988.
# \newblock This is a full BOOKLET entry.
#
# \bibitem{incollection-minimal}
# Daniel~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In {\em High Speed Computer and Algorithm Organization}. Academic
# Press, 1977.
#
# \bibitem{incollection-full}
# Daniel~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In David~J. Lipcoll, D.~H. Lawrie, and A.~H. Sameh, editors, {\em
# High Speed Computer and Algorithm Organization}, number~23 in Fast
Computers,
# part~3, pages 179--183. Academic Press, New York, third edition, September
# 1977.
# \newblock This is a full INCOLLECTION entry.
#
# \bibitem{incollection-crossref}
# Daniel~D. Lincoll.
# \newblock Semigroups of recurrences.
# \newblock In Lipcoll et~al. \cite{whole-collection}, pages 179--183.
# \newblock This is a cross-referencing INCOLLECTION entry.
#
# \bibitem{whole-collection}
# David~J. Lipcoll, D.~H. Lawrie, and A.~H. Sameh, editors.
# \newblock {\em High Speed Computer and Algorithm Organization}.
# \newblock Number~23 in Fast Computers. Academic Press, New York, third
edition,
# September 1977.
# \newblock This is a cross-referenced BOOK (collection) entry.
#
# \bibitem{manual-minimal}
# {\em The Definitive Computer Manual}.
#
# \bibitem{manual-full}
# Larry Manmaker.
# \newblock {\em The Definitive Computer Manual}.
# \newblock Chips-R-Us, Silicon Valley, silver edition, April-May 1986.
# \newblock This is a full MANUAL entry.
#
# \bibitem{mastersthesis-minimal}
# {\'{E}}douard Masterly.
# \newblock Mastering thesis writing.
# \newblock Master's thesis, Stanford University, 1988.
#
# \bibitem{mastersthesis-full}
# {\'{E}}douard Masterly.
# \newblock Mastering thesis writing.
# \newblock Master's project, Stanford University, English Department,
# June-August 1988.
# \newblock This is a full MASTERSTHESIS entry.
#
# \bibitem{misc-minimal}
# This is a minimal MISC entry.
#
# \bibitem{misc-full}
# Joe-Bob Missilany.
# \newblock Handing out random pamphlets in airports.
# \newblock Handed out at O'Hare, October 1984.
# \newblock This is a full MISC entry.
#
# \bibitem{inproceedings-minimal}
# Alfred~V. Oaho, Jeffrey~D. Ullman, and Mihalis Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In {\em Proc. Fifteenth Annual ACM Symposium on the Theory of
# Computing}, 1983.
#
# \bibitem{inproceedings-full}
# Alfred~V. Oaho, Jeffrey~D. Ullman, and Mihalis Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In Wizard~V. Oz and Mihalis Yannakakis, editors, {\em Proc.
Fifteenth
# Annual ACM Symposium on the Theory of Computing}, number~17 in All ACM
# Conferences, pages 133--139, Boston, March 1983. The OX Association for
# Computing Machinery, Academic Press.
# \newblock This is a full INPROCEDINGS entry.
#
# \bibitem{inproceedings-crossref}
# Alfred~V. Oaho, Jeffrey~D. Ullman, and Mihalis Yannakakis.
# \newblock On notions of information transfer in {VLSI} circuits.
# \newblock In OX{\singleletter{stoc}} \cite{whole-proceedings}, pages 133--139.
# \newblock This is a cross-referencing INPROCEEDINGS entry.
#
# \bibitem{whole-proceedings}
# The OX Association for Computing Machinery.
# \newblock {\em Proc. Fifteenth Annual Symposium on the Theory of Computing},
# Boston, 1983.
# \newblock This is a cross-referenced PROCEEDINGS.
#
# \bibitem{proceedings-minimal}
# {\em Proc. Fifteenth Annual Symposium on the Theory of Computing}, 1983.
#
# \bibitem{proceedings-full}
# Wizard~V. Oz and Mihalis Yannakakis, editors.
# \newblock {\em Proc. Fifteenth Annual Symposium on the Theory of Computing},
# number~17 in All ACM Conferences, Boston, March 1983. The OX Association for
# Computing Machinery, Academic Press.
# \newblock This is a full PROCEEDINGS entry.
#
# \bibitem{phdthesis-minimal}
# F.~Phidias Phony-Baloney.
# \newblock {\em Fighting Fire with Fire: Festooning {F}rench Phrases}.
# \newblock PhD thesis, Fanstord University, 1988.
#
# \bibitem{phdthesis-full}
# F.~Phidias Phony-Baloney.
# \newblock {\em Figh
[Output truncated after 50K]
------------------------------
PREREQUISITES
------------------------------
Prerequisite modules loaded:
requires:
Module Need Have
----------------- ---- ----
HTML::Entities 0 1.35
Text::ASCIIMathML 0.7 0.7
Text::BibTeX 0 0.37
------------------------------
ENVIRONMENT AND OTHER CONTEXT
------------------------------
Environment variables:
LANG = en_GB
LANGUAGE = en_GB:en_US:en_GB:en
PATH = /usr/local/bin:/usr/bin:/bin:/usr/bin/X11:/usr/games
PERL5LIB =
PERL5_CPANPLUS_IS_RUNNING = 30564
PERL5_CPAN_IS_RUNNING = 30564
SHELL = /bin/bash
TERM = screen
Perl special variables (and OS-specific diagnostics, for MSWin32):
$^X = /home/david/cpantesting/perl-5.6.2/bin/perl
$UID/$EUID = 1000 / 1000
$GID = 1000 46 44 29 25 24 20 1000
$EGID = 1000 46 44 29 25 24 20 1000
Perl module toolchain versions installed:
Module Have
------------------- ------
CPAN 1.9203
Cwd 2.04
ExtUtils::CBuilder n/a
ExtUtils::Command 1.13
ExtUtils::Install 1.41
ExtUtils::MakeMaker 6.36
ExtUtils::Manifest 1.51
ExtUtils::ParseXS n/a
File::Spec 0.86
Module::Build 0.2808
Module::Signature n/a
Test::Harness 2.64
Test::More 0.67
YAML n/a
YAML::Syck n/a
version 0.7203
--
Summary of my perl5 (revision 5.0 version 6 subversion 2) configuration:
Platform:
osname=linux, osvers=2.4.27-3-686, archname=i686-linux
uname='linux pigsty 2.4.27-3-686 #1 tue dec 5 21:03:54 utc 2006 i686
gnulinux '
config_args='-Dprefix=/home/david/cpantesting/perl-5.6.2 -de'
hint=recommended, useposix=true, d_sigaction=define
usethreads=undef use5005threads=undef useithreads=undef
usemultiplicity=undef
useperlio=undef d_sfio=undef uselargefiles=define usesocks=undef
use64bitint=undef use64bitall=undef uselongdouble=undef
Compiler:
cc='cc', ccflags ='-fno-strict-aliasing -D_LARGEFILE_SOURCE
-D_FILE_OFFSET_BITS=64',
optimize='-O3',
cppflags='-fno-strict-aliasing'
ccversion='', gccversion='3.3.5 (Debian 1:3.3.5-13)', gccosandvers=''
intsize=4, longsize=4, ptrsize=4, doublesize=8, byteorder=1234
d_longlong=define, longlongsize=8, d_longdbl=define, longdblsize=12
ivtype='long', ivsize=4, nvtype='double', nvsize=8, Off_t='off_t',
lseeksize=8
alignbytes=4, usemymalloc=n, prototype=define
Linker and Libraries:
ld='cc', ldflags =' -L/usr/local/lib'
libpth=/usr/local/lib /lib /usr/lib
libs=-lnsl -lgdbm -ldl -lm -lc -lcrypt -lutil
perllibs=-lnsl -ldl -lm -lc -lcrypt -lutil
libc=/lib/libc-2.3.2.so, so=so, useshrplib=false, libperl=libperl.a
Dynamic Linking:
dlsrc=dl_dlopen.xs, dlext=so, d_dlsymun=undef, ccdlflags='-rdynamic'
cccdlflags='-fpic', lddlflags='-shared -L/usr/local/lib'
