Home | Trees | Indices | Help |
|
---|
|
Create a NFA from a content model. Reminiscent of Thompson's algorithm for creating an NFA from a regular expression. See http://portal.acm.org/citation.cfm?doid=363387
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|
|||
__nfa = None
|
|
Interpret the term and update the NFA to support a path from start to end that is consistent with the term. Particles express looping operations with minimum and maximum iteration counts. Model groups express control structures: ordered and unordered sequences, and alternatives. Anything else is assumed to be a character in the automaton alphabet. |
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Thu Jan 28 08:39:51 2010 | http://epydoc.sourceforge.net |