anchor.diff:      tree(Rest, append_stack_child(norm({Tag, Attrs}), S));
   tree([{start_tag, Tag, Attrs, false} | Rest], S) ->
       tree(Rest, stack(norm({Tag, Attrs}), S));
  +tree([T={pi, _Raw} | Rest], S) ->
  +    tree(Rest, append_stack_child(T, S));
   tree([T={pi, _Tag, _Attrs} | Rest], S) ->
       tree(Rest, append_stack_child(T, S));
   tree([T={comment, _Comment} | Rest], S) ->
  
positive.code:             S
      end.
  
  tokenize_literal(Bin, S) ->
      tokenize_literal(Bin, S, []).
  
  tokenize_literal(Bin, S=#decoder{offset=O}, Acc) ->
      case Bin of
  
negative.code:             tokenize_word(Bin, ?INC_COL(S), C);
          <<_:O/binary, C, _/binary>> when not ?IS_WHITESPACE(C) ->
              %% Sanity check for whitespace
              tokenize_literal(Bin, S)
      end.
  
  tokenize_word(Bin, S, Quote) ->
  