-
Notifications
You must be signed in to change notification settings - Fork 2
/
xmlformat.rb
executable file
·1542 lines (1245 loc) · 47.5 KB
/
xmlformat.rb
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#!/usr/bin/ruby -w
# vim:set ts=2 sw=2 expandtab:
# xmlformat.rb - XML document reformatter
# Copyright (c) 2004, 2005, Kitebird, LLC. All rights reserved.
# Some portions are based on the REX shallow XML parser, which
# is Copyright (c) 1998, Robert D. Cameron. These include the
# regular expression parsing variables and the shallow_parse()
# method.
# This software is licensed as described in the file LICENSE,
# which you should have received as part of this distribution.
# Differences from Perl version:
# - Pattern for classifying token as text node is different.
# (cannot use !~ op for case)
# - It's important to use \A and \z|\Z rather than ^ and $ in pattern
# matches on tokens, because ^ and $ might match after/before a
# newline for a token that spans multiple lines!
require "getoptlong"
PROG_NAME = "xmlformat"
PROG_VERSION = "1.04"
PROG_LANG = "Ruby"
# ----------------------------------------------------------------------
# XMLFormat module
# Contains:
# - Methods for parsing XML document
# - Methods for reading configuration file and operating on configuration
# information.
module XMLFormat
# ----------------------------------------------------------------------
# Module methods
# warn - print message to stderr
# die - print message to stderr and exit
def warn(*args)
#$stderr.print args
end
def die(*args)
$stderr.print args
exit(1)
end
# ----------------------------------------------------------------------
# Module variables - these do not vary per class invocation
# Regular expressions for parsing document components. Based on REX.
# Compared to Perl version, these variable names use more Ruby-like
# lettercase. (Ruby likes to interpret variables that begin with
# uppercase as constants.)
# spe = shallow parsing expression
# se = scanning expression
# ce = completion expression
# rsb = right square brackets
# qm = question mark
@@text_se = "[^<]+"
@@until_hyphen = "[^-]*-"
@@until_2_hyphens = "#{@@until_hyphen}(?:[^-]#{@@until_hyphen})*-"
@@comment_ce = "#{@@until_2_hyphens}>?"
@@until_rsbs = "[^\\]]*\\](?:[^\\]]+\\])*\\]+"
@@cdata_ce = "#{@@until_rsbs}(?:[^\\]>]#{@@until_rsbs})*>"
@@s = "[ \\n\\t\\r]+"
@@name_strt = "[A-Za-z_:]|[^\\x00-\\x7F]"
@@name_char = "[A-Za-z0-9_:.-]|[^\\x00-\\x7F]"
@@name = "(?:#{@@name_strt})(?:#{@@name_char})*"
@@quote_se = "\"[^\"]*\"|'[^']*'"
@@dt_ident_se = "#{@@s}#{@@name}(?:#{@@s}(?:#{@@name}|#{@@quote_se}))*"
@@markup_decl_ce = "(?:[^\\]\"'><]+|#{@@quote_se})*>"
@@s1 = "[\\n\\r\\t ]"
@@until_qms = "[^?]*\\?+"
@@pi_tail = "\\?>|#{@@s1}#{@@until_qms}(?:[^>?]#{@@until_qms})*>"
@@dt_item_se =
"<(?:!(?:--#{@@until_2_hyphens}>|[^-]#{@@markup_decl_ce})|\\?#{@@name}(?:#{@@pi_tail}))|%#{@@name};|#{@@s}"
@@doctype_ce =
"#{@@dt_ident_se}(?:#{@@s})?(?:\\[(?:#{@@dt_item_se})*\\](?:#{@@s})?)?>?"
@@decl_ce =
"--(?:#{@@comment_ce})?|\\[CDATA\\[(?:#{@@cdata_ce})?|DOCTYPE(?:#{@@doctype_ce})?"
@@pi_ce = "#{@@name}(?:#{@@pi_tail})?"
@@end_tag_ce = "#{@@name}(?:#{@@s})?>?"
@@att_val_se = "\"[^<\"]*\"|'[^<']*'"
@@elem_tag_se =
"#{@@name}(?:#{@@s}#{@@name}(?:#{@@s})?=(?:#{@@s})?(?:#{@@att_val_se}))*(?:#{@@s})?/?>?"
@@markup_spe =
"<(?:!(?:#{@@decl_ce})?|\\?(?:#{@@pi_ce})?|/(?:#{@@end_tag_ce})?|(?:#{@@elem_tag_se})?)"
updated_regex ="#{@@text_se}|#{@@markup_spe}".gsub("+)?","*)")
@@xml_spe = Regexp.new(updated_regex)
# ----------------------------------------------------------------------
# Allowable formatting options and their possible values:
# - The keys of this hash are the allowable option names
# - The value for each key is list of allowable option values
# - If the value is nil, the option value must be numeric
# If any new formatting option is added to this program, it
# must be specified here, *and* a default value for it should
# be listed in the *DOCUMENT and *DEFAULT pseudo-element
# option hashes.
@@opt_list = {
"format" => [ "block", "inline", "verbatim" ],
"normalize" => [ "yes", "no" ],
"subindent" => nil,
"wrap-length" => nil,
"entry-break" => nil,
"exit-break" => nil,
"element-break" => nil
}
class XMLFormatter
# Object creation: set up the default formatting configuration
# and variables for maintaining input and output document.
def initialize
# Formatting options for each element.
@elt_opts = { }
# The formatting options for the *DOCUMENT and *DEFAULT pseudo-elements can
# be overridden in the configuration file, but the options must also be
# built in to make sure they exist if not specified in the configuration
# file. Each of the structures must have a value for every option.
# Options for top-level document children.
# - Do not change entry-break: 0 ensures no extra newlines before
# first element of output.
# - Do not change exit-break: 1 ensures a newline after final element
# of output document.
# - It's probably best not to change any of the others, except perhaps
# if you want to increase the element-break.
@elt_opts["*DOCUMENT"] = {
"format" => "block",
"normalize" => "no",
"subindent" => 0,
"wrap-length" => 0,
"entry-break" => 0, # do not change
"exit-break" => 1, # do not change
"element-break" => 1
}
# Default options. These are used for any elements in the document
# that are not specified explicitly in the configuration file.
@elt_opts["*DEFAULT"] = {
"format" => "block",
"normalize" => "no",
"subindent" => 2,
"wrap-length" => 0,
"entry-break" => 1,
"exit-break" => 1,
"element-break" => 1
}
# Run the *DOCUMENT and *DEFAULT options through the option-checker
# to verify that the built-in values are legal.
err_count = 0
@elt_opts.keys.each do |elt_name| # ... for each element
@elt_opts[elt_name].each do |opt_name, opt_val| # ... for each option
opt_val, err_msg = check_option(opt_name, opt_val)
if err_msg.nil?
@elt_opts[elt_name][opt_name] = opt_val
else
warn "LOGIC ERROR: #{elt_name} default option is invalid\n"
warn "#{err_msg}\n"
err_count += 1
end
end
end
# Make sure that the every option is represented in the
# *DOCUMENT and *DEFAULT structures.
@@opt_list.keys.each do |opt_name|
@elt_opts.keys.each do |elt_name|
if !@elt_opts[elt_name].has_key?(opt_name)
warn "LOGIC ERROR: #{elt_name} has no default '#{opt_name}' option\n"
err_count += 1
end
end
end
if err_count > 0
raise "Cannot continue; internal default formatting options must be fixed"
end
end
# Initialize the variables that are used per-document
def init_doc_vars
# Elements that are used in the document but not named explicitly
# in the configuration file.
@unconf_elts = { }
# List of tokens for current document.
@tokens = [ ]
# List of line numbers for each token
@line_num = [ ]
# Document node tree (constructed from the token list)
@tree = [ ]
# Variables for formatting operations:
# @out_doc = resulting output document (constructed from document tree)
# @pending = array of pending tokens being held until flushed
@out_doc = ""
@pending = [ ]
# Inline elements within block elements are processed using the
# text normalization (and possible line-wrapping) values of their
# enclosing block. Blocks and inlines may be nested, so we maintain
# a stack that allows the normalize/wrap-length values of the current
# block to be determined.
@block_name_stack = [ ] # for debugging
@block_opts_stack = [ ]
# A similar stack for maintaining each block's current break type.
@block_break_type_stack = [ ]
end
# Accessors for token list and resulting output document
def tokens
return @tokens
end
def out_doc
return @out_doc
end
# Methods for adding strings to output document or
# to the pending output array
def add_to_doc(str)
@out_doc << str
end
def add_to_pending(str)
@pending << str
end
# Block stack maintenance methods
# Push options onto or pop options off from the stack. When doing
# this, also push or pop an element onto the break-level stack.
def begin_block(name, opts)
@block_name_stack << name
@block_opts_stack << opts
@block_break_type_stack << "entry-break"
end
def end_block
@block_name_stack.pop
@block_opts_stack.pop
@block_break_type_stack.pop
end
# Return the current block's normalization status or wrap length
def block_normalize
return @block_opts_stack.last["normalize"] == "yes"
end
def block_wrap_length
return @block_opts_stack.last["wrap-length"]
end
# Set the current block's break type, or return the number of newlines
# for the block's break type
def set_block_break_type(type)
@block_break_type_stack[@block_break_type_stack.size-1] = type
end
def block_break_value
return @block_opts_stack.last[@block_break_type_stack.last]
end
# Read configuration information. For each element, construct a hash
# containing a hash key and value for each option name and value.
# After reading the file, fill in missing option values for
# incomplete option structures using the *DEFAULT options.
def read_config(conf_file)
elt_names = nil
in_continuation = false
saved_line = ""
File.open(conf_file) do |fh|
fh.each_line do |line|
line.chomp!
next if line =~ /^\s*($|#)/ # skip blank lines, comments
if in_continuation
line = saved_line + " " + line
saved_line = ""
in_continuation = false
end
if line !~ /^\s/
# Line doesn't begin with whitespace, so it lists element names.
# Names are separated by whitespace or commas, possibly followed
# by a continuation character or comment.
if line =~ /\\$/
in_continuation = true
saved_line = line.sub(/\\$/, "") # remove continuation character
next
end
line.sub!(/\s*#.*$/, "") # remove any trailing comment
elt_names = line.split(/[\s,]+/)
# make sure each name has an entry in the elt_opts structure
elt_names.each do |elt_name|
@elt_opts[elt_name] = { } unless @elt_opts.has_key?(elt_name)
end
else
# Line begins with whitespace, so it contains an option
# to apply to the current element list, possibly followed by
# a comment. First check that there is a current list.
# Then parse the option name/value.
if elt_names.nil?
raise "#{conf_file}:#{$.}: Option setting found before any " +
"elements were named.\n"
end
line.sub!(/\s*#.*$/, "")
line =~ /^\s*(\S+)(?:\s+|\s*=\s*)(\S+)$/
opt_name, opt_val = $1, $2
raise "#{conf_file}:#{$.}: Malformed line: #{$_}" if opt_val.nil?
# Check option. If illegal, die with message. Otherwise,
# add option to each element in current element list
opt_val, err_msg = check_option(opt_name, opt_val)
raise "#{conf_file}:#{$.}: #{err_msg}\n" unless err_msg.nil?
elt_names.each do |elt_name|
@elt_opts[elt_name][opt_name] = opt_val
end
end
end
end
# For any element that has missing option values, fill in the values
# using the options for the *DEFAULT pseudo-element. This speeds up
# element option lookups later. It also makes it unnecessary to test
# each option to see if it's defined: All element option structures
# will have every option defined.
def_opts = @elt_opts["*DEFAULT"]
@elt_opts.keys.each do |elt_name|
next if elt_name == "*DEFAULT"
def_opts.keys.each do |opt_name|
next if @elt_opts[elt_name].has_key?(opt_name) # already set
@elt_opts[elt_name][opt_name] = def_opts[opt_name]
end
end
end
# Check option name to make sure it's legal. Check the value to make sure
# that it's legal for the name. Return a two-element array:
# (value, nil) if the option name and value are legal.
# (nil, message) if an error was found; message contains error message.
# For legal values, the returned value should be assigned to the option,
# because it may get type-converted here.
def check_option(opt_name, opt_val)
# - Check option name to make sure it's a legal option
# - Then check the value. If there is a list of values
# the value must be one of them. Otherwise, the value
# must be an integer.
if !@@opt_list.has_key?(opt_name)
return [ nil, "Unknown option name: #{opt_name}" ]
end
allowable_val = @@opt_list[opt_name]
if !allowable_val.nil?
if !allowable_val.find { |val| val == opt_val }
return [ nil, "Unknown '#{opt_name}' value: #{opt_val}" ]
end
elsif !opt_val.is_a?(Integer)
if opt_val =~ /^\d+$/
opt_val = opt_val.to_i
else
return [ nil, "'#{opt_name}' value (#{opt_val}) should be an integer" ]
end
end
return [ opt_val, nil ]
end
private :check_option
# Return hash of option values for a given element. If no options are found:
# - Add the element name to the list of unconfigured options.
# - Assign the default options to the element. (This way the test for the
# option fails only once.)
def get_opts(elt_name)
opts = @elt_opts[elt_name]
if opts.nil?
@unconf_elts[elt_name] = 1
opts = @elt_opts[elt_name] = @elt_opts["*DEFAULT"]
end
return opts
end
private :get_opts
# Display contents of configuration options to be used to process document.
# For each element named in the elt_opts structure, display its format
# type, and those options that apply to the type.
def display_config
# Format types and the additional options that apply to each type
format_opts = {
"block" => [
"entry-break",
"element-break",
"exit-break",
"subindent",
"normalize",
"wrap-length"
],
"inline" => [ ],
"verbatim" => [ ]
}
@elt_opts.keys.sort.each do |elt_name|
puts elt_name
opts = @elt_opts[elt_name]
format = opts["format"]
# Write out format type, then options that apply to the format type
puts " format = #{format}"
format_opts[format].each do |opt_name|
puts " #{opt_name} = #{opts[opt_name]}"
end
puts
end
end
# Display the list of elements that are used in the document but not
# configured in the configuration file.
# Then re-unconfigure the elements so that they won't be considered
# as configured for the next document, if there is one.
def display_unconfigured_elements
elts = @unconf_elts.keys
if elts.empty?
puts "The document contains no unconfigured elements."
else
puts "The following document elements were assigned no formatting options:"
puts line_wrap(elts.sort.join(" "), 0, 0, 65).join("\n")
end
elts.each do |elt_name|
@elt_opts.delete(elt_name)
end
end
# ----------------------------------------------------------------------
# Main document processing routine.
# - Argument is a string representing an input document
# - Return value is the reformatted document, or nil. An nil return
# signifies either that an error occurred, or that some option was
# given that suppresses document output. In either case, don't write
# any output for the document. Any error messages will already have
# been printed when this returns.
def process_doc(doc, verbose, check_parser, canonize_only,
show_unconf_elts)
init_doc_vars
# Perform lexical parse to split document into list of tokens
warn "Parsing document...\n" if verbose
shallow_parse(doc)
if (check_parser)
warn "Checking parser...\n" if verbose
# concatentation of tokens should be identical to original document
if doc == tokens.join("")
puts "Parser is okay"
else
puts "PARSER ERROR: document token concatenation differs from document"
end
return nil
end
# Assign input line number to each token
assign_line_numbers
# Look for and report any error tokens returned by parser
warn "Checking document for errors...\n" if verbose
if report_errors > 0
warn "Cannot continue processing document.\n"
return nil
end
# Convert the token list to a tree structure
warn "Convert document tokens to tree...\n" if verbose
if tokens_to_tree > 0
warn "Cannot continue processing document.\n"
return nil
end
# Check: Stringify the tree to convert it back to a single string,
# then compare to original document string (should be identical)
# (This is an integrity check on the validity of the to-tree and stringify
# operations; if one or both do not work properly, a mismatch should occur.)
#str = tree_stringify
#print str
#warn "ERROR: mismatch between document and resulting string\n" if doc != str
# Canonize tree to remove extraneous whitespace
warn "Canonizing document tree...\n" if verbose
tree_canonize
if (canonize_only)
puts tree_stringify
return nil
end
# One side-effect of canonizing the tree is that the formatting
# options are looked up for each element in the document. That
# causes the list of elements that have no explicit configuration
# to be built. Display the list and return if user requested it.
if show_unconf_elts
display_unconfigured_elements
return nil
end
# Format the tree to produce formatted XML as a single string
warn "Formatting document tree...\n" if verbose
tree_format
# If the document is not empty, add a newline and emit a warning if
# reformatting failed to add a trailing newline. This shouldn't
# happen if the *DOCUMENT options are set up with exit-break = 1,
# which is the reason for the warning rather than just silently
# adding the newline.
str = out_doc
if !str.empty? && str !~ /\n\z/
warn "LOGIC ERROR: trailing newline had to be added\n"
str << "\n"
end
return str
end
# ----------------------------------------------------------------------
# Parse XML document into array of tokens and store array
def shallow_parse(xml_document)
@tokens = xml_document.scan(@@xml_spe)
end
# ----------------------------------------------------------------------
# Extract a tag name from a tag and return it. This uses a subset
# of the document-parsing pattern elements.
# Dies if the tag cannot be found, because this is supposed to be
# called only with a legal tag.
def extract_tag_name(tag)
match = /\A<\/?(#{@@name})/.match(tag)
return match[1] if match
raise "Cannot find tag name in tag: #{tag}"
end
private :extract_tag_name
# ----------------------------------------------------------------------
# Assign an input line number to each token. The number indicates
# the line number on which the token begins.
def assign_line_numbers
line_num = 1;
@line_num = [ ]
@tokens.each do |token|
@line_num << line_num
line_num += token.count "\n"
end
end
private :assign_line_numbers
# ----------------------------------------------------------------------
# Check token list for errors and report any that are found. Error
# tokens are those that begin with "<" but do not end with ">".
# Returns the error count.
# Does not modify the original token list.
def report_errors
err_count = 0
@tokens.each_index do |i|
token = @tokens[i]
if token =~ /\A</ && token !~ />\Z/
warn "Malformed token at line #{@line_num[i]}, token #{i+1}: #{token}\n"
err_count += 1
end
end
warn "Number of errors found: #{err_count}\n" if err_count > 0
return err_count
end
# ----------------------------------------------------------------------
# Helper routine to print tag stack for tokens_to_tree
def print_tag_stack(label, stack)
if stack.size < 1
warn " #{label}: none\n"
else
warn " #{label}:\n"
stack.each_with_index do |tag, i|
warn " #{i+1}: #{tag}\n"
end
end
end
# Convert the list of XML document tokens to a tree representation.
# The implementation uses a loop and a stack rather than recursion.
# Does not modify the original token list.
# Returns an error count.
def tokens_to_tree
tag_stack = [ ] # stack for element tags
children_stack = [ ] # stack for lists of children
children = [ ] # current list of children
err_count = 0
# Note: the text token pattern test assumes that all text tokens
# are non-empty. This should be true, because REX doesn't create
# empty tokens.
@tokens.each_index do |i|
token = @tokens[i]
line_num = @line_num[i]
tok_err = "Error near line #{line_num}, token #{i+1} (#{token})"
case token
when /\A[^<]/ # text
children << text_node(token)
when /\A<!--/ # comment
children << comment_node(token)
when /\A<\?/ # processing instruction
children << pi_node(token)
when /\A<!DOCTYPE/ # DOCTYPE
children << doctype_node(token)
when /\A<!\[/ # CDATA
children << cdata_node(token)
when /\A<\// # element close tag
if tag_stack.empty?
warn "#{tok_err}: Close tag w/o preceding open tag; malformed document?\n"
err_count += 1
next
end
if children_stack.empty?
warn "#{tok_err}: Empty children stack; malformed document?\n"
err_count += 1
next
end
tag = tag_stack.pop
open_tag_name = extract_tag_name(tag)
close_tag_name = extract_tag_name(token)
if open_tag_name != close_tag_name
warn "#{tok_err}: Tag mismatch; malformed document?\n"
warn " open tag: #{tag}\n"
warn " close tag: #{token}\n"
print_tag_stack("enclosing tags", tag_stack)
err_count += 1
next
end
elt = element_node(tag, token, children)
children = children_stack.pop
children << elt
else # element open tag
# If we reach here, we're seeing the open tag for an element:
# - If the tag is also the close tag (e.g., <abc/>), close the
# element immediately, giving it an empty child list.
# - Otherwise, push tag and child list on stacks, begin new child
# list for element body.
case token
when /\/>\Z/ # tag is of form <abc/>
children << element_node(token, "", [ ])
else # tag is of form <abc>
tag_stack << token
children_stack << children
children = [ ]
end
end
end
# At this point, the stacks should be empty if the document is
# well-formed.
if !tag_stack.empty?
warn "Error at EOF: Unclosed tags; malformed document?\n"
print_tag_stack("unclosed tags", tag_stack)
err_count += 1
end
if !children_stack.empty?
warn "Error at EOF: Unprocessed child elements; malformed document?\n"
# TODO: print out info about them
err_count += 1
end
@tree = children
return err_count
end
# Node-generating helper methods for tokens_to_tree
# Generic node generator
def node(type, content)
return { "type" => type, "content" => content }
end
private :node
# Generators for specific non-element nodes
def text_node(content)
return node("text", content)
end
private :text_node
def comment_node(content)
return node("comment", content)
end
private :comment_node
def pi_node(content)
return node("pi", content)
end
private :pi_node
def doctype_node(content)
return node("DOCTYPE", content)
end
private :doctype_node
def cdata_node(content)
return node("CDATA", content)
end
private :cdata_node
# For an element node, create a standard node with the type and content
# key/value pairs. Then add pairs for the "name", "open_tag", and
# "close_tag" hash keys.
def element_node(open_tag, close_tag, children)
elt = node("elt", children)
# name is the open tag with angle brackets and attibutes stripped
elt["name"] = extract_tag_name(open_tag)
elt["open_tag"] = open_tag
elt["close_tag"] = close_tag
return elt
end
private :element_node
# ----------------------------------------------------------------------
# Convert the given XML document tree (or subtree) to string form by
# concatentating all of its components. Argument is a reference
# to a list of nodes at a given level of the tree. (If argument is
# missing, use the top level of the tree.)
# Does not modify the node list.
def tree_stringify(children = @tree)
str = ""
children.each do |child|
# - Elements have list of child nodes as content (process recursively)
# - All other node types have text content
if child["type"] == "elt"
str << child["open_tag"] +
tree_stringify(child["content"]) +
child["close_tag"]
else
str << child["content"]
end
end
return str
end
# ----------------------------------------------------------------------
# Put tree in "canonical" form by eliminating extraneous whitespace
# from element text content.
# children is a list of child nodes
# This function modifies the node list.
# Canonizing occurs as follows:
# - Comment, PI, DOCTYPE, and CDATA nodes remain untouched
# - Verbatim elements and their descendants remain untouched
# - Within non-normalized block elements:
# - Delete all-whitespace text node children
# - Leave other text node children untouched
# - Within normalized block elements:
# - Convert runs of whitespace (including line-endings) to single spaces
# - Trim leading whitespace of first text node
# - Trim trailing whitespace of last text node
# - Trim whitespace that is adjacent to a verbatim or non-normalized
# sub-element. (For example, if a <programlisting> is followed by
# more text, delete any whitespace at beginning of that text.)
# - Within inline elements:
# - Normalize the same way as the enclosing block element, with the
# exception that a space at the beginning or end is not removed.
# (Otherwise, <para>three<literal> blind </literal>mice</para>
# would become <para>three<literal>blind</literal>mice</para>).
def tree_canonize
@tree = tree_canonize2(@tree, "*DOCUMENT")
end
def tree_canonize2(children, par_name)
# Formatting options for parent
par_opts = get_opts(par_name)
# If parent is a block element, remember its formatting options on
# the block stack so they can be used to control canonization of
# inline child elements.
if par_opts["format"] == "block"
begin_block(par_name, par_opts)
end
# Iterate through list of child nodes to preserve, modify, or
# discard whitespace. Return resulting list of children.
# Canonize element and text nodes. Leave everything else (comments,
# processing instructions, etc.) untouched.
new_children = [ ]
while !children.empty?
child = children.shift
if child["type"] == "elt"
# Leave verbatim elements untouched. For other element nodes,
# canonize child list using options appropriate to element.
if get_opts(child["name"])["format"] != "verbatim"
child["content"] = tree_canonize2(child["content"], child["name"])
end
elsif child["type"] == "text"
# Delete all-whitespace node or strip whitespace as appropriate.
# Paranoia check: We should never get here for verbatim elements,
# because normalization is irrelevant for them.
if par_opts["format"] == "verbatim"
die "LOGIC ERROR: trying to canonize verbatim element #{par_name}!\n"
end
if !block_normalize
# Enclosing block is not normalized:
# - Delete child all-whitespace text nodes.
# - Leave other text nodes untouched.
next if child["content"] =~ /\A\s*\Z/
else
# Enclosing block is normalized, so normalize this text node:
# - Convert runs of whitespace characters (including
# line-endings characters) to single spaces.
# - Trim leading whitespace if this node is the first child
# of a block element or it follows a non-normalized node.
# - Trim leading whitespace if this node is the last child
# of a block element or it precedes a non-normalized node.
# These are nil if there is no prev or next child
prev_child = new_children.last
next_child = children.first
child["content"].gsub!(/\s+/, " ")
if (prev_child.nil? && par_opts["format"] == "block") ||
non_normalized_node(prev_child)
child["content"].sub!(/\A /, "")
end
if (next_child.nil? && par_opts["format"] == "block") ||
non_normalized_node(next_child)
child["content"].sub!(/ \Z/, "")
end
# If resulting text is empty, discard the node.
next if child["content"] =~ /\A\Z/
end
end
new_children << child
end
# Pop block stack if parent was a block element
end_block if par_opts["format"] == "block"
return new_children
end
private :tree_canonize2
# Helper function for tree_canonize().
# Determine whether a node is normalized. This is used to check
# the node that is adjacent to a given text node (either previous
# or following).
# - No is node is nil
# - No if the node is a verbatim element
# - If the node is a block element, yes or no according to its
# normalize option
# - No if the node is an inline element. Inlines are normalized
# if the parent block is normalized, but this method is not called
# except while examinine normalized blocks. So its inline children
# are also normalized.
# - No if node is a comment, PI, DOCTYPE, or CDATA section. These are
# treated like verbatim elements.
def non_normalized_node(node)
return false if node.nil?
case node["type"]
when "elt"
opts = get_opts(node["name"])
case opts["format"]
when "verbatim"
return true
when "block"
return opts["normalize"] == "no"
when "inline"
return false
else
die "LOGIC ERROR: non_normalized_node: unhandled node format.\n"
end
when "comment", "pi", "DOCTYPE", "CDATA"
return true
when "text"
die "LOGIC ERROR: non_normalized_node: got called for text node.\n"
else
die "LOGIC ERROR: non_normalized_node: unhandled node type.\n"
end
end
private :non_normalized_node