| Home | Trees | Indices | Help |
|---|
|
|
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
Inherited from Inherited from Inherited from |
|||
|
|||
|
Inherited from |
|||
|
|||
|
Run a sub-search. We support multiple searches (stacks) so that we can invoke the same interpreter for lookaheads etc. This is a simple trampoline - it stores state on a stack and invokes the visitor interface on each graph node. Visitor methods return either the new node and state, or raise Fail on failure, or Match on success. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| Home | Trees | Indices | Help |
|---|
| Generated by Epydoc 3.0.1 on Tue Jun 29 03:38:23 2010 | http://epydoc.sourceforge.net |