/*
* Copyright 2012 PRODYNA AG
*
* Licensed under the Eclipse Public License (EPL), Version 1.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.opensource.org/licenses/eclipse-1.0.php or
* http://www.nabucco.org/License.html
*
* 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.nabucco.framework.generator.parser.syntaxtree;
/**
* Represents a grammar choice, e.g. ( A | B )
*/
public class NodeChoice implements Node {
public NodeChoice(Node node) {
this(node, -1);
}
public NodeChoice(Node node, int whichChoice) {
choice = node;
choice.setParent(this);
which = whichChoice;
}
public void accept(org.nabucco.framework.generator.parser.visitor.Visitor v) {
choice.accept(v);
}
public <R,A> R accept(org.nabucco.framework.generator.parser.visitor.GJVisitor<R,A> v, A argu) {
return choice.accept(v,argu);
}
public <R> R accept(org.nabucco.framework.generator.parser.visitor.GJNoArguVisitor<R> v) {
return choice.accept(v);
}
public <A> void accept(org.nabucco.framework.generator.parser.visitor.GJVoidVisitor<A> v, A argu) {
choice.accept(v,argu);
}
public void setParent(Node n) { parent = n; }
public Node getParent() { return parent; }
private Node parent;
public Node choice;
public int which;
}