org.parboiled.matchers.AbstractMatcher Maven / Gradle / Ivy

Go to download
/*
 * Copyright (C) 2009-2011 Mathias Doenitz
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package org.parboiled.matchers;

import static org.parboiled.common.Preconditions.*;
import org.parboiled.MatcherContext;
import org.parboiled.Rule;
import org.parboiled.common.ImmutableList;
import org.parboiled.common.Utils;
import org.parboiled.trees.ImmutableGraphNode;

/**
 * Abstract base class of most regular {@link Matcher}s.
 */
public abstract class AbstractMatcher extends ImmutableGraphNode implements Matcher, Cloneable {
    private String label;
    private boolean nodeSuppressed;
    private boolean subnodesSuppressed;
    private boolean nodeSkipped;
    private Object tag;

    public AbstractMatcher(String label) {
        this(new Rule[0], label);
    }

    public AbstractMatcher(Rule subRule, String label) {
        this(new Rule[] {checkArgNotNull(subRule, "subRule")}, label);
    }

    public AbstractMatcher(Rule[] subRules, String label) {
        super(ImmutableList.of(toMatchers(checkArgNotNull(subRules, "subRules"))));
        this.label = label;
    }

    private static Matcher[] toMatchers(Rule[] subRules) {
        Matcher[] matchers = new Matcher[subRules.length];
        for (int i = 0; i < subRules.length; i++) {
            matchers[i] = (Matcher) subRules[i];
        }
        return matchers;
    }

    public boolean isNodeSuppressed() {
        return nodeSuppressed;
    }

    public boolean areSubnodesSuppressed() {
        return subnodesSuppressed;
    }

    public boolean isNodeSkipped() {
        return nodeSkipped;
    }

    public boolean areMismatchesMemoed() {
        return false;
    }

    public String getLabel() {
        return label;
    }

    public boolean hasCustomLabel() {
        // this is the default implementation for single character matchers
        // complex matchers override with a custom implementation
        return true;
    }

    @Override
    public String toString() {
        return getLabel();
    }

    public AbstractMatcher label(String label) {
        if (Utils.equal(label, this.label)) return this;
        AbstractMatcher clone = createClone();
        clone.label = label;
        return clone;
    }

    public Rule suppressNode() {
        if (nodeSuppressed) return this;
        AbstractMatcher clone = createClone();
        clone.nodeSuppressed = true;
        return clone;
    }

    public Rule suppressSubnodes() {
        if (subnodesSuppressed) return this;
        AbstractMatcher clone = createClone();
        clone.subnodesSuppressed = true;
        return clone;
    }

    public Rule skipNode() {
        if (nodeSkipped) return this;
        AbstractMatcher clone = createClone();
        clone.nodeSkipped = true;
        return clone;
    }

    public Rule memoMismatches() {
        return new MemoMismatchesMatcher(this);
    }

    public Object getTag() {
        return tag;
    }
    public void setTag(Object tagObject) {
        tag = tagObject;
    }

    // default implementation is to simply delegate to the context
    public MatcherContext getSubContext(MatcherContext context) {
        return context.getSubContext(this);
    }

    // creates a shallow copy
    private AbstractMatcher createClone() {
        try {
            return (AbstractMatcher) clone();
        } catch (CloneNotSupportedException e) {
            throw new IllegalStateException();
        }
    }

}