equal
deleted
inserted
replaced
1557 structure in a depth first manner, regardless of whether |
1557 structure in a depth first manner, regardless of whether |
1558 the part being traversed is nullable or not. |
1558 the part being traversed is nullable or not. |
1559 It put all possible bits that can be produced on such a traversal |
1559 It put all possible bits that can be produced on such a traversal |
1560 into a set. |
1560 into a set. |
1561 For example, if we are given the regular expression |
1561 For example, if we are given the regular expression |
1562 $((a+b)(c+d))^*$, the tree structure may be written as |
1562 $((a+b)(c+d))^*$, the tree structure may be written as\\ |
|
1563 \\ |
|
1564 \\ |
|
1565 \\ |
|
1566 \\ |
|
1567 \\ |
|
1568 \\ |
1563 \begin{center} |
1569 \begin{center} |
1564 \begin{tikzpicture} |
1570 \begin{tikzpicture} |
1565 \tikz[tree layout]\graph[nodes={draw, circle}] { |
1571 \tikz[tree layout]\graph[nodes={draw, circle}] { |
1566 * -> |
1572 * -> |
1567 {@-> { |
1573 {@-> { |