1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
/*
* [The "BSD license"]
* Copyright (c) 2010 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 org.junit.Test;
/** 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 {
@Test 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);
}
@Test 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);
}
@Test 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);
}
@Test 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);
}
@Test 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);
}
@Test 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);
}
@Test public void testDoubleQuoteEscape() {
String grammar =
"lexer grammar T; \n" +
"A : '\\\\\"';\n" + // this is A : '\\"', which should give "\\\"" at Java level;
"B : '\\\"';\n" + // this is B: '\"', which shodl give "\"" at Java level;
"C : '\\'\\'';\n" + // this is C: '\'\'', which shoudl give "''" at Java level
"D : '\\k';\n"; // this is D: '\k', which shoudl give just "k" at Java level;
boolean found =
rawGenerateAndBuildRecognizer(
"T.g", grammar, null, "T", false);
boolean expecting = true; // should be ok
assertEquals(expecting, found);
}
@Test public void testBlankRuleGetsNoException() {
String grammar =
"grammar T;\n" +
"a : sync (ID sync)* ;\n" +
"sync : ;\n" +
"ID : 'a'..'z'+;\n";
boolean found =
rawGenerateAndBuildRecognizer(
"T.g", grammar, "TParser", "TLexer", false);
boolean expecting = true; // should be ok
assertEquals(expecting, found);
}
}
|
