/* * Copyright 2015 * Ubiquitous Knowledge Processing (UKP) Lab and FG Language Technology * Technische Universität Darmstadt * * 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 de.tudarmstadt.ukp.clarin.webanno.constraints.visitor; import static org.junit.Assert.assertEquals; import java.io.FileInputStream; import java.util.LinkedHashMap; import java.util.Map; import java.util.Map.Entry; import org.junit.Test; import de.tudarmstadt.ukp.clarin.webanno.constraints.grammar.ConstraintsGrammar; import de.tudarmstadt.ukp.clarin.webanno.constraints.grammar.syntaxtree.Parse; import de.tudarmstadt.ukp.clarin.webanno.constraints.visitor.ImportVisitor; public class ImportVisitorTest { @Test public void test() throws Exception { ConstraintsGrammar parser = new ConstraintsGrammar(new FileInputStream( "src/test/resources/rules/6.rules")); Parse p = parser.Parse(); Map<String, String> imports = new LinkedHashMap<>(); p.accept(new ImportVisitor(), imports); for (Entry<String, String> e : imports.entrySet()) { System.out.printf("[%s] is short for [%s]%n", e.getKey(), e.getValue()); } assertEquals("de.tudarmstadt.ukp.dkpro.core.api.segmentation.type.Lemma", imports.get("Lemma")); } }