can represent recursive data structures, such as binary trees or linked lists.
は二分木や連結リストのような再帰的なデータ構造体を表現できる。 - JM
To provide an information processor for performing the retrieval of a structure pattern appearing several times in a plurality of tree structures by recursive processing for every place to which a node is added. 複数の木構造内で複数回現れる構造パターンの探索において、ノードを加えた場所毎に再帰的処理による探索を行うようにした情報処理装置を提供する。 - 特許庁
Copyright (c) 2001 Robert Kiesling. Copyright (c) 2002, 2003 David Merrill. The contents of this document are licensed under the GNU Free Documentation License. Copyright (C) 1999 JM Project All rights reserved.