2 // This software is now distributed according to
\r
3 // the Lesser Gnu Public License. Please see
\r
4 // http://www.gnu.org/copyleft/lesser.txt for
\r
6 // -- Happy Computing!
\r
8 package com.stevesoft.pat;
\r
10 /** This class provides a method for parsing the "s/.../.../" constructs
\r
16 final static char close(char c)
\r
18 // This switch statement does not behave
\r
19 // properly when compiled with jdk1.1.5
\r
50 final public static String codify(String s, boolean keepbs)
\r
52 return codify(s, 0, s.length(), keepbs);
\r
55 final public static String codify(String s, int i0, int iN, boolean keepbs)
\r
57 StringBuffer sb = new StringBuffer();
\r
58 boolean ucmode = false, lcmode = false, litmode = false;
\r
59 boolean uc1 = false, lc1 = false;
\r
60 boolean modified = false;
\r
61 for (int i = i0; i < iN; i++)
\r
63 char c = s.charAt(i);
\r
64 boolean mf = true, app = true;
\r
71 char c2 = s.charAt(i);
\r
90 uc1 = lc1 = ucmode = lcmode = litmode = false;
\r
128 if (litmode && needbs(c))
\r
135 return modified ? sb.toString() : s;
\r
138 final static char uc(char c)
\r
140 return CaseMgr.toUpperCase(c);
\r
143 final static char lc(char c)
\r
145 return CaseMgr.toLowerCase(c);
\r
148 final static boolean needbs(char c)
\r
150 if (c >= 'a' && c <= 'z')
\r
154 if (c >= 'A' && c <= 'Z')
\r
158 if (c >= '0' && c <= '9')
\r
169 final static Regex parse(String s)
\r
171 boolean igncase = false, optim = false, gFlag = false;
\r
172 boolean sFlag = false, mFlag = false, xFlag = false;
\r
174 StringBuffer s1 = new StringBuffer();
\r
175 StringBuffer s2 = new StringBuffer();
\r
176 int i = 0, count = 0;
\r
177 char mode, delim = '/', cdelim = '/';
\r
178 if (s.length() >= 3 && s.charAt(0) == 's')
\r
181 delim = s.charAt(1);
\r
182 cdelim = close(delim);
\r
185 else if (s.length() >= 2 && s.charAt(0) == 'm')
\r
188 delim = s.charAt(1);
\r
189 cdelim = close(delim);
\r
192 else if (s.length() >= 1 && s.charAt(0) == '/')
\r
201 RegSyntaxError.endItAll(
\r
202 "Regex.perlCode should be of the " +
\r
203 "form s/// or m// or //");
\r
205 catch (RegSyntax rs)
\r
209 for (; i < s.length(); i++)
\r
211 if (s.charAt(i) == '\\')
\r
216 else if (s.charAt(i) == cdelim && count == 0)
\r
221 else if (s.charAt(i) == delim && cdelim != delim)
\r
225 else if (s.charAt(i) == cdelim && cdelim != delim)
\r
229 s1.append(s.charAt(i));
\r
231 if (mode == 's' && cdelim != delim)
\r
233 while (i < s.length() && Prop.isWhite(s.charAt(i)))
\r
237 if (i >= s.length())
\r
241 RegSyntaxError.endItAll("" + mode + delim + " needs " + cdelim);
\r
243 catch (RegSyntax rs)
\r
247 cdelim = close(delim = s.charAt(i));
\r
253 for (; i < s.length(); i++)
\r
255 if (s.charAt(i) == '\\')
\r
260 else if (s.charAt(i) == cdelim && count == 0)
\r
265 else if (s.charAt(i) == delim && cdelim != delim)
\r
269 else if (s.charAt(i) == cdelim && cdelim != delim)
\r
273 s2.append(s.charAt(i));
\r
276 for (; i < s.length(); i++)
\r
278 char c = s.charAt(i);
\r
304 RegSyntaxError.endItAll("Illegal flag to pattern: " + c);
\r
306 catch (RegSyntax rs)
\r
311 Regex r = new Regex();
\r
314 String pat = s1.toString(), reprul = s2.toString();
\r
318 reprul = strip(reprul);
\r
321 r.ignoreCase |= igncase;
\r
331 r.setReplaceRule(new StringRule(reprul));
\r
335 r.setReplaceRule(ReplaceRule.perlCode(reprul));
\r
338 catch (RegSyntax rs)
\r
345 static String strip(String s)
\r
347 StringBuffer sb = new StringBuffer();
\r
348 for (int i = 0; i < s.length(); i++)
\r
350 char c = s.charAt(i);
\r
351 if (Prop.isWhite(c))
\r
358 while (i < s.length())
\r
360 if (s.charAt(i) == '\n')
\r
367 else if (c == '\\')
\r
370 sb.append(s.charAt(++i));
\r
377 return sb.toString();
\r