1 Parse Tree OK ! Parse query OK ! Compil OK ! Run OK !
3 /descendant::a[descendant::c[child::e and not descendant::f[not descendant::e]/descendant::g]]/descendant::b[child::g]
11 <f id="1" value="2"> <g/> <h/> </f>
14 <j> <k/> <l/> <m/> </j>
18 # Query states: { q₁ q₂ q₈ q₉ }
19 # Recognizing states: { q₀ q₃ q₄ q₅ q₆ q₇ }
20 # Selecting states: { q₁ }
21 # Bottom states: { q₂ q₈ q₉ }
23 # Queries transitions:
24 | q₁ ----F(b)---> ↓₁q₀
25 | q₂ ----Cof(ø)---> ↓₁q₂ ∨ ↓₂q₂ ∨ ↓₁q₁ ∨ ↓₂q₁
26 | q₈ ----F(a)---> (↓₁q₂ ∨ ↓₁q₁) ∧ ↓₁q₇
27 | q₈ ----Cof(ø)---> ↓₁q₈ ∨ ↓₂q₈
28 | q₉ ----Cof(ø)---> ↓₁q₈
29 # Recognizing transitions:
30 | q₀ ----F(g)---> ⊤ | q₀ ----Cof(ø)---> ↓₂q₀
32 | q₃ ----Cof(ø)---> ↓₁q₃ ∨ ↓₂q₃
34 | q₄ ----Cof(ø)---> ↓₁q₄ ∨ ↓₂q₄
35 | q₅ ----F(f)---> ̅↓̅₁̅q̅₄ ∧ ↓₁q₃
36 | q₅ ----Cof(ø)---> ↓₁q₅ ∨ ↓₂q₅
37 | q₆ ----F(e)---> ⊤ | q₆ ----Cof(ø)---> ↓₂q₆
38 | q₇ ----F(c)---> ↓₁q₆ ∧ ̅↓̅₁̅q̅₅
39 | q₇ ----Cof(ø)---> ↓₁q₇ ∨ ↓₂q₇