|
base[s] + c == t check[base[s] + c] == s
基于上述定义c;DAT的匹配过程如下:假设当前状态为sc;对于输入的字符c有:
t = base[s] + c; if check[t] = s then next state = t; else fail; endif
DAT匹配的过程相对简单c;很容易理解。
chives/2009/04/editor-content.html?cs=utf-8" name="DAT.E6.9E.84.E9.80.A0">base[0] = 100;
base[199]+'a'=197;
base(f)=-1 * f;
base(f)=-1 * base(f);
class="tags" href="/tags/STRUCT.html" title=struct>struct BC_st { int base; int check; };