Class Hierarchy

• lepl.matchers.memo.NoMemo
• lepl.matchers.core.OperatorMatcher
• lepl.matchers.core.OperatorMatcher
• lepl.matchers.core.OperatorMatcher
• lepl.matchers.core.OperatorMatcher
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• unittest.TestCase
• lepl.matchers.transform.Transformable
• threading.local
• threading.local
• object: The most base type
  • exceptions.BaseException: Common base class for all exceptions
    • exceptions.Exception: Common base class for all non-exit exceptions.
      • lepl.core.config.ConfigurationError: Error raised for problems with configuration.
      • lepl.support.context.ContextError: Exception raised on problems with context.
      • lepl.stream.maxdepth.FullFirstMatchException: The exception raised by FullFirstMatch.
      • lepl.lexer.support.LexerError: Errors associated with the lexer
      • lepl.matchers.matcher.MatcherTypeException: Used to flag problems related to matcher types.
      • lepl.matchers.memo.MemoException: Exception raised for problems with memoisation.
      • lepl.support.node.NodeException: Exception raised when we have problems dynamically creating nodes.
      • lepl.lexer.lines.monitor.OffsideError: The exception raised by problems when parsing whitespace significant code.
      • lepl.regexp.core.RegexpError: An error associated with (problems in) the regexp implementation.
      • lepl.support.graph.Reset: An exception that can be passed to dfs_edges to reset the traversal.
      • exceptions.StandardError: Base class for all standard Python exceptions that do not represent interpreter exiting.
        • exceptions.SyntaxError: Invalid syntax.
          • lepl.matchers.error.Error: Subclass Node and Python's SyntaxError to provide an AST node that can be raised as an error via node_throw or sexpr_throw.
      • lepl.regexp.rewriters.Unsuitable: Exception thrown when a sub-node does not contain a suitable matcher.
      • lepl.support.graph._LineOverflow: Used internally in ConstructorStr.
  • lepl.regexp.core.BaseGraph: Describes a collection of connected nodes.
  • lepl.core.dynamic.BaseVar
  • lepl.bin.bits.BitIterator: A sequence of bits (used by BitString).
  • lepl.bin.bits.BitString: A sequence of bits, of arbitrary length.
  • lepl.bin.bits.ByteIterator: A sequence of bytes (used by BitString).
  • lepl.support.lib.CircularFifo: A FIFO queue with a fixed maximum size that silently discards data on overflow.
  • lepl.core.config.ConfigBuilder: Accumulate configuration through chained methods.
  • lepl.stream.iter.Cons: A linked list cell that is a lazy wrapper around an iterable.
  • lepl.support.graph.ConstructorGraphNode: An interface that provides information on constructor arguments.
  • lepl.support.graph.ConstructorWalker: Tree walker (it handles cyclic graphs by ignoring repeated nodes).
  • lepl.core._test.parser.InstanceMethodTest.Foo
  • lepl.core.manager.GeneratorRef: This contains the weak reference to the GeneratorWrapper and is stored in the GC priority queue.
  • lepl.core.parser.GeneratorWrapper: Associate basic info about call that created the generator with the generator itself.
  • lepl.stream.core.HashKey: Used to store a value with a given hash.
  • lepl.regexp.interval.Intervals: A set of possible values for a character, described as a collection of intervals.
  • lepl.support.lib.LogMixin: Add standard Python logging to a class.
  • lepl.stream.core.MutableMaxDepth: Track maximum depth (offset) reached and the associated stream.
  • lepl.support.context.Namespace: A store for global definitions.
  • lepl.support.context.NamespaceMixin: Allow access to global (per-thread) values.
  • lepl.regexp.core.NfaToDfa: Convert a NFA graph to a DFA graph (uses the usual superset approach but does combination of states in a way that seems to fit better with the idea of character ranges).
  • lepl.matchers.support.NoTrampoline: A matcher that does not require the trampoline.
  • lepl.core.rewriters.NodeStats: Provide statistics and access by type to nodes.
  • lepl.core.rewriters.NodeStats2: Avoid using graph code (so we can check that...)
  • lepl.matchers.transform.NullTransformation
  • lepl.core.config.ParserMixin: Methods to configure and generate a parser or matcher.
  • lepl.support.graph.PostorderWalkerMixin: Add a 'postorder' method.
  • lepl.support.graph.Proxy: A simple proxy that allows us to re-construct cyclic graphs.
  • lepl.regexp.rewriters.RegexpContainer: The container referred to above, which carries a regular expression and an alternative matcher "up the tree" during rewriting.
  • lepl.matchers.matcher.Relations: Some kind of parent/child management for wrapped classes that I no longer understand, but which appears to be used and working (it doesn't look like rocket science, but until it breaks I don't care enough to know more...)
  • lepl.support.context.Scope: Base class supporting dedicated syntax for particular options.
  • lepl.support.graph.SimpleWalker: This works like ConstructorWalker for generic classes.
  • lepl.core.monitor.StackMonitor: An interface expected by trampoline(), called to track stack growth.
  • lepl.stream.factory.StreamFactory: Given a value (typically a sequence), generate a stream.
  • lepl.regexp.interval.TaggedFragments: Similar to Fragments, but associates a value with each initial interval; on retrieval returns a list of all values associated with fragment.
  • lepl.matchers.transform.TransformationWrapper: Helper object that composes transformations and also keeps a list of the separate transformations for introspection.
  • lepl.core.monitor.ValueMonitor: An interface expected by trampoline(), called to track data flow.
  • lepl.support.graph.Visitor: The interface required by the walkers.
  • lepl.support.warn.Warning
  • basestring: Type basestring cannot be instantiated; it is the base for str and unicode.
    • unicode: unicode(string [, encoding[, errors]]) -> object
  • lepl.cairo.context.cset: Allow automatic scoping of the given parameters.
  • dict: dict() -> new empty dictionary dict(mapping) -> new dictionary initialized from a mapping object's (key, value) pairs dict(iterable) -> new dictionary initialized as if via: d = {} for k, v in iterable: d[k] = v dict(**kwargs) -> new dictionary initialized with the name=value pairs in the keyword argument list.
  • int: int(x[, base]) -> integer
    • lepl.bin.bits.Int: An integer with a length (the number of bits).
  • list: list() -> new empty list list(iterable) -> new list initialized from iterable's items