| Home | Trees | Indices | Help |
|---|
|
|
A rewriter that uses the given alphabet and matcher to compile simple matchers.
The "use" parameter controls when regular expressions are substituted. If true, they are always used. If false, they are used only if they are part of a tree that includes repetition. The latter case generally gives more efficient parsers because it avoids converting already efficient literal matchers to regular expressions.
|
|||
|
|||
|
|||
|
Inherited from Inherited from |
|||
|
|||
|
Inherited from |
|||
|
|||
|
|
| Home | Trees | Indices | Help |
|---|
| Generated by Epydoc 3.0.1 on Sun May 13 16:31:06 2012 | http://epydoc.sourceforge.net |