Deterministic Finite State Automaton that implements some XML-like grammar.
Deterministic Finite State Automaton that implements some XML-like grammar. The only state it keeps is: * A buffer of characters that have yet to be consumed * Two namespace stacks (a default namespace stack and a stack of namespace prefix to URI mappings)
Other than that, it processes input one character at a time, and emits SAX events to the given receiver.
It does no validation.
It knows nothing about DTDs or external entities.
It does nothing with processing instructions (other than emit them to the ContentHandler)
It does not handle errors (nor emit them) except for a few catastrophic parse errors (in which case it will throw an exception)
It won't issue an endDocument event until close() is called (at which point it will emit one immediately)