Logo Search packages:      
Sourcecode: jruby-joni version File versions  Download package

Node.java

/*
 * Permission is hereby granted, free of charge, to any person obtaining a copy of 
 * this software and associated documentation files (the "Software"), to deal in 
 * the Software without restriction, including without limitation the rights to 
 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies 
 * of the Software, and to permit persons to whom the Software is furnished to do
 * so, subject to the following conditions:
 * 
 * The above copyright notice and this permission notice shall be included in all
 * copies or substantial portions of the Software.
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 
 * SOFTWARE.
 */
package org.joni.ast;

import java.util.Set;

import org.joni.Config;
import org.joni.WarnCallback;
import org.joni.constants.NodeType;

00028 public abstract class Node implements NodeType {
    public Node parent;
    
    public abstract int getType();

    public final int getType2Bit() {
        return 1 << getType(); 
    }    
    
    protected void setChild(Node tgt){}         // default definition
    protected Node getChild(){return null;};    // default definition

    public void swap(Node with) {
        Node tmp;

        //if (getChild() != null) getChild().parent = with;
        //if (with.getChild() != null) with.getChild().parent = this;
        
        //tmp = getChild();
        //setChild(with.getChild());
        //with.setChild(tmp);
        
        if (parent != null) parent.setChild(with);
        
        if (with.parent != null) with.parent.setChild(this);

        tmp = parent;
        parent = with.parent;
        with.parent = tmp;
    }
    
    // overridden by ConsAltNode and CallNode
    public void verifyTree(Set<Node> set, WarnCallback warnings) {
        if (!set.contains(this) && getChild() != null) {
            set.add(this);
            if (getChild().parent != this) {
                warnings.warn("broken link to child: " + this.getAddressName() + " -> " + getChild().getAddressName());
            }
            getChild().verifyTree(set, warnings);
        }
    }     
    
    public abstract String getName();
    protected abstract String toString(int level);
    
    public String getAddressName() {
        return getName() + ":0x" + Integer.toHexString(System.identityHashCode(this));
    }
    
    public final String toString() {
        StringBuilder s = new StringBuilder();
        s.append("<" + getAddressName() + ">");
        s.append("\n  parent: " + (parent == null ? "NULL" : parent.getAddressName())); 
        return s + toString(0);
    }
    
    protected static String pad(Object value, int level) {
        if (value == null) return "NULL";
        
        StringBuilder pad = new StringBuilder("  ");
        for (int i=0; i<level; i++) pad.append(pad);
        
        return value.toString().replace("\n",  "\n" + pad);
    }
    
    public final boolean isInvalidQuantifier() {
        if (!Config.VANILLA) return false;

        ConsAltNode node;

        switch(getType()) {

        case ANCHOR:
            return true;
            
        case ENCLOSE:
            /* allow enclosed elements */
            /* return is_invalid_quantifier_target(NENCLOSE(node)->target); */
            break;
            
        case LIST:
            node = (ConsAltNode)this;
            do {
                if (!node.car.isInvalidQuantifier()) return false;
            } while ((node = node.cdr) != null);
            return false;
            
        case ALT:
            node = (ConsAltNode)this;
            do {
                if (node.car.isInvalidQuantifier()) return true;
            } while ((node = node.cdr) != null);
            break;
            
        default:
            break;
        }
        
        return false;
    }
    
    public final boolean isAllowedInLookBehind() {
        return (getType2Bit() & ALLOWED_IN_LB) != 0; 
    }
    
    public final boolean isSimple() {
        return (getType2Bit() & SIMPLE) != 0;
    }
}

Generated by  Doxygen 1.6.0   Back to index