Home | Trees | Indices | Help |
|
---|
|
object --+ | Grammar
A context-free grammar. A Grammar consists of a start state and a set of productions. The set of terminals and nonterminals is implicitly specified by the productions.
If you need efficient key-based access to productions, you can use a subclass to implement it.
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from |
|
|||
|
Create a new context-free grammar, from the given start state and set
of
|
repr(x)
|
str(x)
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0beta1 on Wed May 16 22:47:25 2007 | http://epydoc.sourceforge.net |