/* * * Copyright 2012 lexergen. * This file is part of lexergen. * * lexergen is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * lexergen is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with lexergen. If not, see <http://www.gnu.org/licenses/>. * * lexergen: * A tool to chunk source code into tokens for further processing in a compiler chain. * * Projectgroup: bi, bii * * Authors: Johannes Dahlke * * Module: Softwareprojekt Übersetzerbau 2012 * * Created: Apr. 2012 * Version: 1.0 * */ package de.fuberlin.bii.regextodfaconverter.directconverter.syntaxtree.node; import java.util.ArrayList; import java.util.Iterator; import de.fuberlin.bii.regextodfaconverter.directconverter.syntaxtree.PrintHandler; import de.fuberlin.bii.utils.Test; /** * Stellt einen inneren Knoten in einem {@link Tree Baum} dar. * Der innere Knoten kann beliebig viele Kinder haben. * * @author Johannes Dahlke * */ @SuppressWarnings("rawtypes") public class ScalableInnerNode<Value> extends InnerNode<Value> { public ScalableInnerNode( Value value) { super( value); } /** * Fügt dem Knoten weitere Kindknoten hinzu. * @param childNodes */ public void addChilds( TreeNode ... childNodes) { for ( TreeNode childNode : childNodes) { addChild( childNode); } } @Override protected boolean canAddChild( TreeNode childNode) { return true; // there are no constraints } }