1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
/* Generated by re2c */
// re2c $INPUT -o $OUTPUT -i --posix-captures --dump-dfa-min --fixed-tags toplevel
{
YYCTYPE yych;
if (YYLIMIT <= YYCURSOR) YYFILL(1);
yych = *YYCURSOR;
switch (yych) {
case 'a':
yyt1 = YYCURSOR;
yyt2 = YYCURSOR;
goto yy2;
default:
yyt1 = YYCURSOR;
yyt2 = NULL;
yyt3 = NULL;
goto yy1;
}
yy1:
yynmatch = 2;
yypmatch[0] = yyt1;
yypmatch[2] = yyt2;
yypmatch[3] = yyt3;
yypmatch[1] = YYCURSOR;
{}
yy2:
++YYCURSOR;
if (YYLIMIT <= YYCURSOR) YYFILL(1);
yych = *YYCURSOR;
switch (yych) {
case 'a':
yyt2 = YYCURSOR;
goto yy2;
default:
yyt3 = YYCURSOR;
goto yy1;
}
}
debug/dfa_min.re:3:11: warning: rule matches empty string [-Wmatch-empty-string]
digraph DFA {
rankdir=LR
node[fontname=Courier]
edge[arrowhead=vee fontname=Courier]
n [shape=point] n -> n0 [style=dotted label=""]
n0 [height=0.2 width=0.2 label="0"]
subgraph { rank=same n0 [style=filled fillcolor=lightgray] dr0 [shape=none label="/1↑ 2↓ 3↓ (1 0 2 3)"] n0:s -> dr0:n [style=dotted minlen=0]}
n0 -> n1 [label="1/1↑ 2↑ "]
n1 [height=0.2 width=0.2 label="1"]
subgraph { rank=same n1 [style=filled fillcolor=lightgray] dr1 [shape=none label="/3↑ (1 0 2 3)"] n1:s -> dr1:n [style=dotted minlen=0]}
n1 -> n1 [label="1/2↑ "]
}
|
