mirror of
https://github.com/corda/corda.git
synced 2025-01-09 06:23:04 +00:00
e6ad10de04
Based on the just-implemented PikeVM, let's test it with a specific regular expression. At this point, no parsing is implemented but instead an explicit program executing a(bb)?a is hardcoded. Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
30 lines
737 B
Java
30 lines
737 B
Java
/* Copyright (c) 2008-2013, Avian Contributors
|
|
|
|
Permission to use, copy, modify, and/or distribute this software
|
|
for any purpose with or without fee is hereby granted, provided
|
|
that the above copyright notice and this permission notice appear
|
|
in all copies.
|
|
|
|
There is NO WARRANTY for this software. See license.txt for
|
|
details. */
|
|
|
|
package regex;
|
|
|
|
/**
|
|
* A minimal implementation of a regular expression engine.
|
|
*
|
|
* @author Johannes Schindelin
|
|
*/
|
|
public class RegexPattern extends Pattern {
|
|
private PikeVM vm;
|
|
|
|
public RegexMatcher matcher(CharSequence string) {
|
|
return new RegexMatcher(vm, string);
|
|
}
|
|
|
|
RegexPattern(String regex, int flags, PikeVM vm) {
|
|
super(regex, flags);
|
|
this.vm = vm;
|
|
}
|
|
}
|