mirror of
https://github.com/ruby/ruby.git
synced 2025-09-17 09:33:59 +02:00

r1002 | ser | 2004-06-07 07:45:53 -0400 (Mon, 07 Jun 2004) | 2 lines * Workin' in the coal mine, goin' down, down, down... r1003 | ser | 2004-06-08 22:24:08 -0400 (Tue, 08 Jun 2004) | 7 lines * Entirely rewrote the validation code; the finite state machine, while cool, didn't survive the encounter with Interleave. It was getting sort of hacky, too. The new mechanism is less elegant, but is basically still a FSM, and is more flexible without having to add hacks to extend it. Large chunks of the FSM may be reusable in other validation mechanisms. * Added interleave support r1004 | ser | 2004-06-09 07:24:17 -0400 (Wed, 09 Jun 2004) | 2 lines * Added suppert for mixed r1005 | ser | 2004-06-09 08:01:33 -0400 (Wed, 09 Jun 2004) | 3 lines * Added Kou's patch to normalize attribute values passed through the SAX2 and Stream parsers. r1006 | ser | 2004-06-09 08:12:35 -0400 (Wed, 09 Jun 2004) | 2 lines * Applied Kou's preceding-sibling patch, which fixes the order of the axe results r1009 | ser | 2004-06-20 11:02:55 -0400 (Sun, 20 Jun 2004) | 8 lines * Redesigned and rewrote the RelaxNG code. It isn't elegant, but it works. Particular problems encountered were interleave and ref. Interleave means I can't use a clean FSM design, and ref means the dirty FSM design has to be modified during validation. There's a lot of code that could be cleaned up in here. However, I'm pretty sure that this design is reasonably fast and space efficient. I'm not entirely convinced that it is correct; more tests are required. * This version adds support for defines and refs. r1011 | ser | 2004-06-20 11:20:07 -0400 (Sun, 20 Jun 2004) | 3 lines * Removed debugging output from unit test * Moved ">" in Element.inspect r1014 | ser | 2004-06-20 11:40:30 -0400 (Sun, 20 Jun 2004) | 2 lines * Minor big in missing includes for validation rules r1023 | ser | 2004-07-03 08:57:34 -0400 (Sat, 03 Jul 2004) | 2 lines * Fixed bug #34, typo in xpath_parser. r1024 | ser | 2004-07-03 10:22:08 -0400 (Sat, 03 Jul 2004) | 9 lines * Previous fix, (include? -> includes?) was incorrect. * Added another test for encoding * Started AnyName support in RelaxNG * Added Element#Attributes#to_a, so that it does something intelligent. This was needed by XPath, for '@*' * Fixed XPath so that @* works. git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/branches/ruby_1_8@6579 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
213 lines
6.7 KiB
Ruby
213 lines
6.7 KiB
Ruby
require 'rexml/parsers/baseparser'
|
|
require 'rexml/parseexception'
|
|
require 'rexml/namespace'
|
|
|
|
module REXML
|
|
module Parsers
|
|
class SAX2Parser
|
|
def initialize source
|
|
@parser = BaseParser.new(source)
|
|
@listeners = []
|
|
@procs = []
|
|
@namespace_stack = []
|
|
@has_listeners = false
|
|
@tag_stack = []
|
|
end
|
|
|
|
def add_listener( listener )
|
|
@parser.add_listener( listener )
|
|
end
|
|
|
|
# Listen arguments:
|
|
#
|
|
# Symbol, Array, Block
|
|
# Listen to Symbol events on Array elements
|
|
# Symbol, Block
|
|
# Listen to Symbol events
|
|
# Array, Listener
|
|
# Listen to all events on Array elements
|
|
# Array, Block
|
|
# Listen to :start_element events on Array elements
|
|
# Listener
|
|
# Listen to All events
|
|
#
|
|
# Symbol can be one of: :start_element, :end_element,
|
|
# :start_prefix_mapping, :end_prefix_mapping, :characters,
|
|
# :processing_instruction, :doctype, :attlistdecl, :elementdecl,
|
|
# :entitydecl, :notationdecl, :cdata, :xmldecl, :comment
|
|
#
|
|
# Array contains regular expressions or strings which will be matched
|
|
# against fully qualified element names.
|
|
#
|
|
# Listener must implement the methods in SAX2Listener
|
|
#
|
|
# Block will be passed the same arguments as a SAX2Listener method would
|
|
# be, where the method name is the same as the matched Symbol.
|
|
# See the SAX2Listener for more information.
|
|
def listen( *args, &blok )
|
|
if args[0].kind_of? Symbol
|
|
if args.size == 2
|
|
args[1].each { |match| @procs << [args[0], match, blok] }
|
|
else
|
|
add( [args[0], nil, blok] )
|
|
end
|
|
elsif args[0].kind_of? Array
|
|
if args.size == 2
|
|
args[0].each { |match| add( [nil, match, args[1]] ) }
|
|
else
|
|
args[0].each { |match| add( [ :start_element, match, blok ] ) }
|
|
end
|
|
else
|
|
add([nil, nil, args[0]])
|
|
end
|
|
end
|
|
|
|
def deafen( listener=nil, &blok )
|
|
if listener
|
|
@listeners.delete_if {|item| item[-1] == listener }
|
|
@has_listeners = false if @listeners.size == 0
|
|
else
|
|
@procs.delete_if {|item| item[-1] == blok }
|
|
end
|
|
end
|
|
|
|
def parse
|
|
@procs.each { |sym,match,block| block.call if sym == :start_document }
|
|
@listeners.each { |sym,match,block|
|
|
block.start_document if sym == :start_document or sym.nil?
|
|
}
|
|
root = context = []
|
|
while true
|
|
event = @parser.pull
|
|
case event[0]
|
|
when :end_document
|
|
handle( :end_document )
|
|
break
|
|
when :end_doctype
|
|
context = context[1]
|
|
when :start_element
|
|
@tag_stack.push(event[1])
|
|
# find the observers for namespaces
|
|
procs = get_procs( :start_prefix_mapping, event[1] )
|
|
listeners = get_listeners( :start_prefix_mapping, event[1] )
|
|
if procs or listeners
|
|
# break out the namespace declarations
|
|
# The attributes live in event[2]
|
|
event[2].each {|n, v| event[2][n] = @parser.normalize(v)}
|
|
nsdecl = event[2].find_all { |n, value| n =~ /^xmlns(:|$)/ }
|
|
nsdecl.collect! { |n, value| [ n[6..-1], value ] }
|
|
@namespace_stack.push({})
|
|
nsdecl.each do |n,v|
|
|
@namespace_stack[-1][n] = v
|
|
# notify observers of namespaces
|
|
procs.each { |ob| ob.call( n, v ) } if procs
|
|
listeners.each { |ob| ob.start_prefix_mapping(n, v) } if listeners
|
|
end
|
|
end
|
|
event[1] =~ Namespace::NAMESPLIT
|
|
prefix = $1
|
|
local = $2
|
|
uri = get_namespace(prefix)
|
|
# find the observers for start_element
|
|
procs = get_procs( :start_element, event[1] )
|
|
listeners = get_listeners( :start_element, event[1] )
|
|
# notify observers
|
|
procs.each { |ob| ob.call( uri, local, event[1], event[2] ) } if procs
|
|
listeners.each { |ob|
|
|
ob.start_element( uri, local, event[1], event[2] )
|
|
} if listeners
|
|
when :end_element
|
|
@tag_stack.pop
|
|
event[1] =~ Namespace::NAMESPLIT
|
|
prefix = $1
|
|
local = $2
|
|
uri = get_namespace(prefix)
|
|
# find the observers for start_element
|
|
procs = get_procs( :end_element, event[1] )
|
|
listeners = get_listeners( :end_element, event[1] )
|
|
# notify observers
|
|
procs.each { |ob| ob.call( uri, local, event[1] ) } if procs
|
|
listeners.each { |ob|
|
|
ob.end_element( uri, local, event[1] )
|
|
} if listeners
|
|
|
|
namespace_mapping = @namespace_stack.pop
|
|
# find the observers for namespaces
|
|
procs = get_procs( :end_prefix_mapping, event[1] )
|
|
listeners = get_listeners( :end_prefix_mapping, event[1] )
|
|
if procs or listeners
|
|
namespace_mapping.each do |prefix, uri|
|
|
# notify observers of namespaces
|
|
procs.each { |ob| ob.call( prefix ) } if procs
|
|
listeners.each { |ob| ob.end_prefix_mapping(prefix) } if listeners
|
|
end
|
|
end
|
|
when :text
|
|
normalized = @parser.normalize( event[1] )
|
|
handle( :characters, normalized )
|
|
when :processing_instruction, :comment, :doctype, :attlistdecl,
|
|
:elementdecl, :entitydecl, :cdata, :notationdecl, :xmldecl
|
|
handle( *event )
|
|
end
|
|
end
|
|
end
|
|
|
|
private
|
|
def handle( symbol, *arguments )
|
|
tag = @tag_stack[-1]
|
|
procs = get_procs( symbol, tag )
|
|
listeners = get_listeners( symbol, tag )
|
|
# notify observers
|
|
procs.each { |ob| ob.call( *arguments ) } if procs
|
|
listeners.each { |l|
|
|
l.send( symbol.to_s, *arguments )
|
|
} if listeners
|
|
end
|
|
|
|
# The following methods are duplicates, but it is faster than using
|
|
# a helper
|
|
def get_procs( symbol, name )
|
|
return nil if @procs.size == 0
|
|
@procs.find_all do |sym, match, block|
|
|
#puts sym.inspect+"=="+symbol.inspect+ "\t"+match.inspect+"=="+name.inspect+ "\t"+( (sym.nil? or symbol == sym) and ((name.nil? and match.nil?) or match.nil? or ( (name == match) or (match.kind_of? Regexp and name =~ match)))).to_s
|
|
(
|
|
(sym.nil? or symbol == sym) and
|
|
((name.nil? and match.nil?) or match.nil? or (
|
|
(name == match) or
|
|
(match.kind_of? Regexp and name =~ match)
|
|
)
|
|
)
|
|
)
|
|
end.collect{|x| x[-1]}
|
|
end
|
|
def get_listeners( symbol, name )
|
|
return nil if @listeners.size == 0
|
|
@listeners.find_all do |sym, match, block|
|
|
(
|
|
(sym.nil? or symbol == sym) and
|
|
((name.nil? and match.nil?) or match.nil? or (
|
|
(name == match) or
|
|
(match.kind_of? Regexp and name =~ match)
|
|
)
|
|
)
|
|
)
|
|
end.collect{|x| x[-1]}
|
|
end
|
|
|
|
def add( pair )
|
|
if pair[-1].respond_to? :call
|
|
@procs << pair unless @procs.include? pair
|
|
else
|
|
@listeners << pair unless @listeners.include? pair
|
|
@has_listeners = true
|
|
end
|
|
end
|
|
|
|
def get_namespace( prefix )
|
|
uris = (@namespace_stack.find_all { |ns| not ns[prefix].nil? }) ||
|
|
(@namespace_stack.find { |ns| not ns[nil].nil? })
|
|
uris[-1][prefix] unless uris.nil? or 0 == uris.size
|
|
end
|
|
end
|
|
end
|
|
end
|