Single file version available here.
Last updated on 2008-06-21.
To discuss, comment here.
| Next |
Table of Contents
Newsgroups: comp.text.tex
> I'm looking for something that will turn a labelled backeting, like > > (a (b c d) (e f)) > > into an ASCII tree, like > > a > /\ > / \ > / \ > b e > /\ | > / \ | > / \ | > c d f
qtree.sty will do what you want, I think. In fact, I use it for my English Syntax course, and I'm very happy with it. There are many others, though. You might check out the following links:
http://www.ifi.uio.no/~dag/ling-tex/ http://clwww.essex.ac.uk/latex4ling/
BTW, most tree-drawing macros won't work with pdflatex. In the case of qtree, you can comment out the reference to eepic.sty to make things pdflatex-compatible. The trees won't look as good as with LaTeX + eepic, but the result is definitely legible.
Hope this helps,
Joe
> http://www.ifi.uio.no/~dag/ling-tex/[] > http://clwww.essex.ac.uk/latex4ling/[]
I had forgotten about those resources. That was great. I found a link to Greg Lee's "tree" preprocessor which does what I want and is based on Chris Barker's program of the same name which is what I recall using in the mid '80s. In did the "examples" in the documentation have some from me.