mirror of
https://github.com/marcin-szczepanski/jFuzzyLogic.git
synced 2025-01-07 05:10:28 +01:00
125 lines
4.0 KiB
Java
125 lines
4.0 KiB
Java
/*
|
|
[The "BSD licence"]
|
|
Copyright (c) 2005-2006 Terence Parr
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions
|
|
are met:
|
|
1. Redistributions of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
2. Redistributions in binary form must reproduce the above copyright
|
|
notice, this list of conditions and the following disclaimer in the
|
|
documentation and/or other materials provided with the distribution.
|
|
3. The name of the author may not be used to endorse or promote products
|
|
derived from this software without specific prior written permission.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
package org.antlr.test;
|
|
|
|
import junit.framework.TestCase;
|
|
|
|
/** General code generation testing; compilation and/or execution.
|
|
* These tests are more about avoiding duplicate var definitions
|
|
* etc... than testing a particular ANTLR feature.
|
|
*/
|
|
public class TestJavaCodeGeneration extends BaseTest {
|
|
public void testDupVarDefForPinchedState() {
|
|
// so->s2 and s0->s3->s1 pinches back to s1
|
|
// LA3_1, s1 state for DFA 3, was defined twice in similar scope
|
|
// just wrapped in curlies and it's cool.
|
|
String grammar =
|
|
"grammar T;\n" +
|
|
"a : (| A | B) X Y\n" +
|
|
" | (| A | B) X Z\n" +
|
|
" ;\n" ;
|
|
boolean found =
|
|
rawGenerateAndBuildRecognizer(
|
|
"T.g", grammar, "TParser", null, false);
|
|
boolean expecting = true; // should be ok
|
|
assertEquals(expecting, found);
|
|
}
|
|
|
|
public void testLabeledNotSetsInLexer() {
|
|
// d must be an int
|
|
String grammar =
|
|
"lexer grammar T;\n" +
|
|
"A : d=~('x'|'y') e='0'..'9'\n" +
|
|
" ; \n" ;
|
|
boolean found =
|
|
rawGenerateAndBuildRecognizer(
|
|
"T.g", grammar, null, "T", false);
|
|
boolean expecting = true; // should be ok
|
|
assertEquals(expecting, found);
|
|
}
|
|
|
|
public void testLabeledSetsInLexer() {
|
|
// d must be an int
|
|
String grammar =
|
|
"grammar T;\n" +
|
|
"a : A ;\n" +
|
|
"A : d=('x'|'y') {System.out.println((char)$d);}\n" +
|
|
" ; \n" ;
|
|
String found = execParser("T.g", grammar, "TParser", "TLexer",
|
|
"a", "x", false);
|
|
assertEquals("x\n", found);
|
|
}
|
|
|
|
public void testLabeledRangeInLexer() {
|
|
// d must be an int
|
|
String grammar =
|
|
"grammar T;\n" +
|
|
"a : A;\n" +
|
|
"A : d='a'..'z' {System.out.println((char)$d);} \n" +
|
|
" ; \n" ;
|
|
String found = execParser("T.g", grammar, "TParser", "TLexer",
|
|
"a", "x", false);
|
|
assertEquals("x\n", found);
|
|
}
|
|
|
|
public void testLabeledWildcardInLexer() {
|
|
// d must be an int
|
|
String grammar =
|
|
"grammar T;\n" +
|
|
"a : A;\n" +
|
|
"A : d=. {System.out.println((char)$d);}\n" +
|
|
" ; \n" ;
|
|
String found = execParser("T.g", grammar, "TParser", "TLexer",
|
|
"a", "x", false);
|
|
assertEquals("x\n", found);
|
|
}
|
|
|
|
public void testSynpredWithPlusLoop() {
|
|
String grammar =
|
|
"grammar T; \n" +
|
|
"a : (('x'+)=> 'x'+)?;\n";
|
|
boolean found =
|
|
rawGenerateAndBuildRecognizer(
|
|
"T.g", grammar, "TParser", "TLexer", false);
|
|
boolean expecting = true; // should be ok
|
|
assertEquals(expecting, found);
|
|
}
|
|
|
|
public void testDoubleQuoteEscape() {
|
|
String grammar =
|
|
"lexer grammar T; \n" +
|
|
"A : '\\\\\"';\n"; // this is A : '\\"';
|
|
boolean found =
|
|
rawGenerateAndBuildRecognizer(
|
|
"T.g", grammar, null, "TLexer", false);
|
|
boolean expecting = true; // should be ok
|
|
assertEquals(expecting, found);
|
|
}
|
|
|
|
}
|