 
 
	 
In file ../include/ling_class/EST_Relation_tree.h:
| inline EST_Item* next_leaf | (const EST_Item* n) | 
Return next leaf in tree given <parameter>n</parameter>.
Return next leaf in tree given <parameter>n</parameter>. If <parameter>n</parameter> is a terminal node, next_leaf() will return the next leaf in the tree. If <parameter>n</parameter> is not terminal, this will return the leftmost terminal node dominated by <parameter>n</parameter>. This will return 0 only when the last leaf in the relation has been passed.
Alphabetic index HTML hierarchy of classes or Java
 
This page is part of the 
Edinburgh Speech Tools Library documentation
Copyright  University of Edinburgh 1997
Contact:  
         speech_tools@cstr.ed.ac.uk