1. /*
  2. * The Apache Software License, Version 1.1
  3. *
  4. *
  5. * Copyright (c) 1999-2002 The Apache Software Foundation. All rights
  6. * reserved.
  7. *
  8. * Redistribution and use in source and binary forms, with or without
  9. * modification, are permitted provided that the following conditions
  10. * are met:
  11. *
  12. * 1. Redistributions of source code must retain the above copyright
  13. * notice, this list of conditions and the following disclaimer.
  14. *
  15. * 2. Redistributions in binary form must reproduce the above copyright
  16. * notice, this list of conditions and the following disclaimer in
  17. * the documentation and/or other materials provided with the
  18. * distribution.
  19. *
  20. * 3. The end-user documentation included with the redistribution,
  21. * if any, must include the following acknowledgment:
  22. * "This product includes software developed by the
  23. * Apache Software Foundation (http://www.apache.org/)."
  24. * Alternately, this acknowledgment may appear in the software itself,
  25. * if and wherever such third-party acknowledgments normally appear.
  26. *
  27. * 4. The names "Xerces" and "Apache Software Foundation" must
  28. * not be used to endorse or promote products derived from this
  29. * software without prior written permission. For written
  30. * permission, please contact apache@apache.org.
  31. *
  32. * 5. Products derived from this software may not be called "Apache",
  33. * nor may "Apache" appear in their name, without prior written
  34. * permission of the Apache Software Foundation.
  35. *
  36. * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
  37. * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  38. * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  39. * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
  40. * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  41. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  42. * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
  43. * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
  44. * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  45. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
  46. * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  47. * SUCH DAMAGE.
  48. * ====================================================================
  49. *
  50. * This software consists of voluntary contributions made by many
  51. * individuals on behalf of the Apache Software Foundation and was
  52. * originally based on software copyright (c) 1999, International
  53. * Business Machines, Inc., http://www.apache.org. For more
  54. * information on the Apache Software Foundation, please see
  55. * <http://www.apache.org/>.
  56. */
  57. package com.sun.org.apache.xerces.internal.impl.dtd.models;
  58. import com.sun.org.apache.xerces.internal.impl.dtd.XMLContentSpec;
  59. import com.sun.org.apache.xerces.internal.xni.QName;
  60. /**
  61. * Content model leaf node.
  62. *
  63. * @version $Id: CMLeaf.java,v 1.2 2002/01/29 01:15:10 lehors Exp $
  64. */
  65. public class CMLeaf
  66. extends CMNode {
  67. //
  68. // Data
  69. //
  70. /** This is the element that this leaf represents. */
  71. private QName fElement = new QName();
  72. /**
  73. * Part of the algorithm to convert a regex directly to a DFA
  74. * numbers each leaf sequentially. If its -1, that means its an
  75. * epsilon node. Zero and greater are non-epsilon positions.
  76. */
  77. private int fPosition = -1;
  78. //
  79. // Constructors
  80. //
  81. /** Constructs a content model leaf. */
  82. public CMLeaf(QName element, int position) {
  83. super(XMLContentSpec.CONTENTSPECNODE_LEAF);
  84. // Store the element index and position
  85. fElement.setValues(element);
  86. fPosition = position;
  87. }
  88. /** Constructs a content model leaf. */
  89. public CMLeaf(QName element) {
  90. super(XMLContentSpec.CONTENTSPECNODE_LEAF);
  91. // Store the element index and position
  92. fElement.setValues(element);
  93. }
  94. //
  95. // Package methods
  96. //
  97. final QName getElement()
  98. {
  99. return fElement;
  100. }
  101. final int getPosition()
  102. {
  103. return fPosition;
  104. }
  105. final void setPosition(int newPosition)
  106. {
  107. fPosition = newPosition;
  108. }
  109. //
  110. // CMNode methods
  111. //
  112. // package
  113. public boolean isNullable()
  114. {
  115. // Leaf nodes are never nullable unless its an epsilon node
  116. return (fPosition == -1);
  117. }
  118. public String toString()
  119. {
  120. StringBuffer strRet = new StringBuffer(fElement.toString());
  121. strRet.append(" (");
  122. strRet.append(fElement.uri);
  123. strRet.append(',');
  124. strRet.append(fElement.localpart);
  125. strRet.append(')');
  126. if (fPosition >= 0)
  127. {
  128. strRet.append
  129. (
  130. " (Pos:"
  131. + new Integer(fPosition).toString()
  132. + ")"
  133. );
  134. }
  135. return strRet.toString();
  136. }
  137. // protected
  138. protected void calcFirstPos(CMStateSet toSet)
  139. {
  140. // If we are an epsilon node, then the first pos is an empty set
  141. if (fPosition == -1)
  142. toSet.zeroBits();
  143. // Otherwise, its just the one bit of our position
  144. else
  145. toSet.setBit(fPosition);
  146. }
  147. protected void calcLastPos(CMStateSet toSet)
  148. {
  149. // If we are an epsilon node, then the last pos is an empty set
  150. if (fPosition == -1)
  151. toSet.zeroBits();
  152. // Otherwise, its just the one bit of our position
  153. else
  154. toSet.setBit(fPosition);
  155. }
  156. } // class CMLeaf