Package net.sf.lapg.lex

Examples of net.sf.lapg.lex.RegexpParser

81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
      Assert.fail("parse failed: " + ex.getMessage());
    }
  }

  public void testUnicode() {
    RegexpParser rp = new RegexpParser();
    try {
      rp.compile(0, "string", "[\\x5151-\\x5252][\\x1000-\\x2000]");
    } catch (RegexpParseException ex) {
      Assert.fail("parse failed: " + ex.getMessage());
    }
    int[] expected = new int[0x8000];
    Arrays.fill(expected, 1);
    Arrays.fill(expected, 0x5151, 0x5252+1, 2);
    Arrays.fill(expected, 0x1000, 0x2000+1, 3);
    expected[0] = 0;
    rp.buildSets();
    Assert.assertEquals(Arrays.toString(expected), Arrays.toString(rp.getCharacterMap()));
  }
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
      Assert.assertTrue(th instanceof NumberFormatException);
    }
  }

  public void testParserExc() {
    RegexpParser rp = new RegexpParser();
    try {
      rp.compile(0, "string", "[\\x5151-\\x5252][\\x1000-\\x2000");
    } catch (RegexpParseException ex) {
      Assert.assertEquals("regexp contains unpaired brackets", ex.getMessage());
      Assert.assertEquals(29, ex.getErrorOffset());
    }

    try {
      rp.compile(1, "string1", "[\\x5151]]-\\x5252]][\\x1000-\\x2000");
    } catch (RegexpParseException ex) {
      Assert.assertEquals("unexpected closing brace, escape it to use as character", ex.getMessage());
      Assert.assertEquals(8, ex.getErrorOffset());
    }

    try {
      rp.compile(2, "empty", "");
    } catch (RegexpParseException ex) {
      Assert.assertEquals("regexp is empty", ex.getMessage());
      Assert.assertEquals(0, ex.getErrorOffset());
    }

    try {
      rp.compile(3, "paren", "(abc");
    } catch (RegexpParseException ex) {
      Assert.assertEquals("regexp contains unpaired parentheses", ex.getMessage());
      Assert.assertEquals(4, ex.getErrorOffset());
    }

    try {
      rp.compile(4, "paren2", "(abc))xyz");
    } catch (RegexpParseException ex) {
      Assert.assertEquals("regexp contains unpaired parentheses", ex.getMessage());
      Assert.assertEquals(5, ex.getErrorOffset());
    }

    try {
      rp.compile(5, "paren3", "((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((abc))");
    } catch (RegexpParseException ex) {
      Assert.assertEquals("regexp contains too much parentheses", ex.getMessage());
      Assert.assertEquals(126, ex.getErrorOffset());
    }

    try {
      rp.compile(5, "paren3", "aaa\\");
    } catch (RegexpParseException ex) {
      Assert.assertEquals("regexp contains \\ at the end of expression", ex.getMessage());
      Assert.assertEquals(4, ex.getErrorOffset());
    }

    try {
      rp.compile(5, "paren3", "aaa\\4a5!zzz");
    } catch (RegexpParseException ex) {
      Assert.assertEquals("regexp contains incomplete unicode symbol", ex.getMessage());
      Assert.assertEquals(7, ex.getErrorOffset());
    }

    try {
      rp.compile(5, "paren3", "aaa\\4a");
    } catch (RegexpParseException ex) {
      Assert.assertEquals("regexp contains incomplete unicode symbol", ex.getMessage());
      Assert.assertEquals(6, ex.getErrorOffset());
    }
  }
View Full Code Here
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
  public void testRegexpParserTime() {
    Assert.assertEquals("0000", toHex4(0));
    Assert.assertEquals("abcf", toHex4(0xabcf));
    Assert.assertEquals("75e1", toHex4(0x75e1));

    RegexpParser rp = new RegexpParser();
    try{
      for(int i = 0; i < 2000; i++) {
        rp.compile(i, "n"+i, "[\\x"+toHex4(i*10)+"-\\x"+toHex4(i*10+6)+"]");
      }
      for(int i = 0; i < 2000; i++) {
        rp.compile(i, "nb"+i, "[\\x"+toHex4(i*10+3)+"-\\x"+toHex4(i*10+8)+"]");
      }
    } catch(RegexpParseException ex) {
      Assert.fail("parse failed: " + ex.getMessage());
    }
    rp.buildSets();

    Assert.assertEquals(6002, rp.getSymbolCount());
  }
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
    Assert.assertEquals(6002, rp.getSymbolCount());
  }

  public void testRegexpParserInvertedSet() {
    RegexpParser rp = new RegexpParser();
    try {
      rp.compile(0, "string", "'[^'\n]+'");
      rp.compile(1, "percent", "%");
    } catch(RegexpParseException ex) {
      Assert.fail("parse failed: " + ex.getMessage());
    }
    rp.buildSets();
    Assert.assertEquals("[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]", Arrays.toString(rp.getCharacterMap()));

    int[] character2sym = rp.getCharacterMap();
    Assert.assertEquals(character2sym['%'], 3);
    Assert.assertEquals(character2sym['\''], 2);

    int[][] res = rp.getSetToSymbolsMap();
    Assert.assertEquals(1, res.length);
    Assert.assertEquals("[1, 3]", Arrays.toString(res[0]));
  }
View Full Code Here
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
    Assert.assertEquals(1, res.length);
    Assert.assertEquals("[1, 3]", Arrays.toString(res[0]));
  }

  public void testRegexpParser() {
    RegexpParser rp = new RegexpParser();
    try {
      rp.compile(0, "string", "[a-zA-Z_][a-zA-Z0-9_]*");
      rp.buildSets();
      Assert.assertEquals("[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1]", Arrays.toString(rp.getCharacterMap()));

      rp = new RegexpParser();
      rp.compile(0, "string", "[a-zA-Z_][a-zA-Z0-9_]*");
      rp.compile(1, "keyw", "do");
      rp.buildSets();
      Assert.assertEquals("[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 4, 1, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1]", Arrays.toString(rp.getCharacterMap()));

      rp = new RegexpParser();
      rp.compile(0, "string", "[a-w][p-z]");
      rp.compile(1, "string2", "[b-c][y-z]");
      rp.buildSets();
      Assert.assertEquals("[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 3, 6, 6, 1, 1, 1, 1, 1]", Arrays.toString(rp.getCharacterMap()));
      int[][] p = rp.getSetToSymbolsMap();
      Assert.assertEquals("[2, 4, 5]", Arrays.toString(p[0]));
      Assert.assertEquals("[3, 4, 6]", Arrays.toString(p[1]));
      Assert.assertEquals("[5]", Arrays.toString(p[2]));
      Assert.assertEquals("[6]", Arrays.toString(p[3]));
    } catch(RegexpParseException ex) {
View Full Code Here
TOP

Related Classes of net.sf.lapg.lex.RegexpParser

  • net.sf.lapg.test.cases.RegexpParseTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.