正则表达式

一、NFA的构造与匹配：

public class NFA 
{
	private int M;
	private Digraph G;
	private char[] re;
	public NFA(String regexp)
	{
		Stack<Integer> ops = new Stack<Integer>();
		M = regexp.length(); 
		G = new Digraph(M+1);
		re = regexp.toCharArray();
		for (int i = 0; i < M; i++)
		{
			int lp = i;
			if (re[i] == '(' || re[i] == '|')
				ops.push(i);
			else if (re[i] == ')')
			{
				int or = ops.pop();
				if (or == '|')
				{
					lp = ops.pop();
					G.addEdge(lp, or+1);
					G.addEdge(or, i);
				}
				else 
					lp = or;
			}
			if (i < M-1 && re[i+1] == '*')
			{
				G.addEdge(lp, i+1);
				G.addEdge(i+1, lp);
			}
			if (re[i] == '(' || re[i] == '*' || re[i] == ')')
				G.addEdge(i, i+1);
		}
		
	}
	public boolean recognizes(String txt)
	{
		Bag<Integer> pc = new Bag<Integer>();
		DirectedDFS dfs = new DirectedDFS(G, 0);
		for (int v = 0; v < G.V(); v++)
		{
			if (dfs.marked(v)) pc.add(v);
		}
		for (int i = 0; i < txt.length(); i++)
		{
			Bag<Integer> match = new Bag<Integer>();
			for (int v : pc)
				if (v < M)
					if(txt.charAt(i) == re[v] || re[v] == '.')
						match.add(v+1);
			pc = new Bag<Integer>();
			dfs = new DirectedDFS(G, match);
			for (int v = 0; v < G.V(); v++)
				if (dfs.marked(v)) pc.add(v);
			
		}
		for (int v : pc) 
			if (v == M)
				return true;
		return false;
	}
}