src/Pure/General/yxml.scala
author wenzelm
Mon, 19 Jan 2009 16:03:04 +0100
changeset 29563 4773c5c994dc
parent 29521 736bf7117153
child 31469 40f815edbde4
permissions -rw-r--r--
intern names of elements and attributes;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
27930
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
     1
/*  Title:      Pure/General/yxml.scala
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
     2
    Author:     Makarius
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
     3
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
     4
Efficient text representation of XML trees.
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
     5
*/
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
     6
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
     7
package isabelle
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
     8
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
     9
import java.util.regex.Pattern
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    10
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    11
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    12
object YXML {
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    13
27943
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    14
  /* chunk markers */
27930
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    15
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    16
  private val X = '\5'
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    17
  private val Y = '\6'
27960
65b10d8ef0c6 added parse_failsafe;
wenzelm
parents: 27946
diff changeset
    18
  private val X_string = X.toString
27945
d2dc5a1903e8 tuned parse performance: avoid splitting terminal Y chunk;
wenzelm
parents: 27944
diff changeset
    19
  private val Y_string = Y.toString
27930
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    20
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    21
  def detect(source: CharSequence) = {
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    22
    source.length >= 2 &&
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    23
    source.charAt(0) == X &&
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    24
    source.charAt(1) == Y
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    25
  }
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    26
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    27
27943
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    28
  /* iterate over chunks (resembles space_explode in ML) */
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    29
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    30
  private def chunks(sep: Char, source: CharSequence) = new Iterator[CharSequence] {
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    31
    private val end = source.length
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    32
    private var state = if (end == 0) None else get_chunk(-1)
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    33
    private def get_chunk(i: Int) = {
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    34
      if (i < end) {
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    35
        var j = i; do j += 1 while (j < end && source.charAt(j) != sep)
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    36
        Some((source.subSequence(i + 1, j), j))
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    37
      }
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    38
      else None
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    39
    }
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    40
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    41
    def hasNext() = state.isDefined
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    42
    def next() = state match {
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    43
      case Some((s, i)) => { state = get_chunk(i); s }
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    44
      case None => throw new NoSuchElementException("next on empty iterator")
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    45
    }
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    46
  }
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    47
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    48
27930
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    49
  /* parsing */
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    50
27993
6dd90ef9f927 simplified exceptions: use plain error function / RuntimeException;
wenzelm
parents: 27971
diff changeset
    51
  private def err(msg: String) = error("Malformed YXML: " + msg)
27930
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    52
  private def err_attribute() = err("bad attribute")
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    53
  private def err_element() = err("bad element")
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    54
  private def err_unbalanced(name: String) =
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    55
    if (name == "") err("unbalanced element")
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    56
    else err("unbalanced element \"" + name + "\"")
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    57
27944
2bf3f30558ed parse_attrib: more efficient due to indexOf('=');
wenzelm
parents: 27943
diff changeset
    58
  private def parse_attrib(source: CharSequence) = {
2bf3f30558ed parse_attrib: more efficient due to indexOf('=');
wenzelm
parents: 27943
diff changeset
    59
    val s = source.toString
2bf3f30558ed parse_attrib: more efficient due to indexOf('=');
wenzelm
parents: 27943
diff changeset
    60
    val i = s.indexOf('=')
2bf3f30558ed parse_attrib: more efficient due to indexOf('=');
wenzelm
parents: 27943
diff changeset
    61
    if (i <= 0) err_attribute()
29563
4773c5c994dc intern names of elements and attributes;
wenzelm
parents: 29521
diff changeset
    62
    (s.substring(0, i).intern, s.substring(i + 1))
27944
2bf3f30558ed parse_attrib: more efficient due to indexOf('=');
wenzelm
parents: 27943
diff changeset
    63
  }
27930
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    64
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    65
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    66
  def parse_body(source: CharSequence) = {
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    67
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    68
    /* stack operations */
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    69
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    70
    var stack: List[((String, XML.Attributes), List[XML.Tree])] = null
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    71
29180
wenzelm
parents: 29140
diff changeset
    72
    def add(x: XML.Tree) = (stack: @unchecked) match {
27930
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    73
      case ((elem, body) :: pending) => stack = (elem, x :: body) :: pending
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    74
    }
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    75
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    76
    def push(name: String, atts: XML.Attributes) =
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    77
      if (name == "") err_element()
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    78
      else stack = ((name, atts), Nil) :: stack
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    79
29180
wenzelm
parents: 29140
diff changeset
    80
    def pop() = (stack: @unchecked) match {
27930
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    81
      case ((("", _), _) :: _) => err_unbalanced("")
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    82
      case (((name, atts), body) :: pending) =>
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    83
        stack = pending; add(XML.Elem(name, atts, body.reverse))
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    84
    }
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    85
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    86
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    87
    /* parse chunks */
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    88
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    89
    stack = List((("", Nil), Nil))
27943
f34ff5e7728f replaced Pattern.split by chunks iterator (more efficient, resembles ML version more closely);
wenzelm
parents: 27930
diff changeset
    90
    for (chunk <- chunks(X, source) if chunk != "") {
27945
d2dc5a1903e8 tuned parse performance: avoid splitting terminal Y chunk;
wenzelm
parents: 27944
diff changeset
    91
      if (chunk == Y_string) pop()
d2dc5a1903e8 tuned parse performance: avoid splitting terminal Y chunk;
wenzelm
parents: 27944
diff changeset
    92
      else {
d2dc5a1903e8 tuned parse performance: avoid splitting terminal Y chunk;
wenzelm
parents: 27944
diff changeset
    93
        chunks(Y, chunk).toList match {
29563
4773c5c994dc intern names of elements and attributes;
wenzelm
parents: 29521
diff changeset
    94
          case "" :: name :: atts => push(name.toString.intern, atts.map(parse_attrib))
27945
d2dc5a1903e8 tuned parse performance: avoid splitting terminal Y chunk;
wenzelm
parents: 27944
diff changeset
    95
          case txts => for (txt <- txts) add(XML.Text(txt.toString))
d2dc5a1903e8 tuned parse performance: avoid splitting terminal Y chunk;
wenzelm
parents: 27944
diff changeset
    96
        }
27930
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    97
      }
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    98
    }
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
    99
    stack match {
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
   100
      case List((("", _), result)) => result.reverse
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
   101
      case ((name, _), _) :: _ => err_unbalanced(name)
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
   102
    }
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
   103
  }
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
   104
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
   105
  def parse(source: CharSequence) =
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
   106
    parse_body(source) match {
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
   107
      case List(result) => result
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
   108
      case Nil => XML.Text("")
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
   109
      case _ => err("multiple results")
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
   110
    }
27960
65b10d8ef0c6 added parse_failsafe;
wenzelm
parents: 27946
diff changeset
   111
29521
736bf7117153 added parse_body_failsafe;
wenzelm
parents: 29180
diff changeset
   112
736bf7117153 added parse_body_failsafe;
wenzelm
parents: 29180
diff changeset
   113
  /* failsafe parsing */
736bf7117153 added parse_body_failsafe;
wenzelm
parents: 29180
diff changeset
   114
736bf7117153 added parse_body_failsafe;
wenzelm
parents: 29180
diff changeset
   115
  private def markup_failsafe(source: CharSequence) =
736bf7117153 added parse_body_failsafe;
wenzelm
parents: 29180
diff changeset
   116
    XML.Elem (Markup.BAD, Nil,
736bf7117153 added parse_body_failsafe;
wenzelm
parents: 29180
diff changeset
   117
      List(XML.Text(source.toString.replace(X_string, "\\<^X>").replace(Y_string, "\\<^Y>"))))
736bf7117153 added parse_body_failsafe;
wenzelm
parents: 29180
diff changeset
   118
736bf7117153 added parse_body_failsafe;
wenzelm
parents: 29180
diff changeset
   119
  def parse_body_failsafe(source: CharSequence) = {
736bf7117153 added parse_body_failsafe;
wenzelm
parents: 29180
diff changeset
   120
    try { parse_body(source) }
736bf7117153 added parse_body_failsafe;
wenzelm
parents: 29180
diff changeset
   121
    catch { case _: RuntimeException => List(markup_failsafe(source)) }
736bf7117153 added parse_body_failsafe;
wenzelm
parents: 29180
diff changeset
   122
  }
736bf7117153 added parse_body_failsafe;
wenzelm
parents: 29180
diff changeset
   123
27960
65b10d8ef0c6 added parse_failsafe;
wenzelm
parents: 27946
diff changeset
   124
  def parse_failsafe(source: CharSequence) = {
65b10d8ef0c6 added parse_failsafe;
wenzelm
parents: 27946
diff changeset
   125
    try { parse(source) }
29521
736bf7117153 added parse_body_failsafe;
wenzelm
parents: 29180
diff changeset
   126
    catch { case _: RuntimeException => markup_failsafe(source) }
27960
65b10d8ef0c6 added parse_failsafe;
wenzelm
parents: 27946
diff changeset
   127
  }
65b10d8ef0c6 added parse_failsafe;
wenzelm
parents: 27946
diff changeset
   128
27930
2b44df907cc2 Efficient text representation of XML trees.
wenzelm
parents:
diff changeset
   129
}