-Parse query OK ! Parse Tree OK ! Compil OK ! Run OK !
+Parse Tree OK ! Parse query OK ! Compil OK ! Run OK !
##### Query #####
/descendant::a[descendant::c[child::e and not descendant::f[not descendant::e]/descendant::g]]/descendant::b[child::g]
+
##### Doc #####
<#document><a>
<b/>
<j> <k/> <l/> <m/> </j>
</a></#document>
- ##### ASTA #####
+##### ASTA #####
# Query states: { q₁ q₂ q₈ q₉ }
# Recognizing states: { q₀ q₃ q₄ q₅ q₆ q₇ }
# Selecting states: { q₁ }
- # Bottom states: { qâ\82\81 qâ\82\82 qâ\82\88 }
- # Tom states: { q₉ }
+ # Bottom states: { qâ\82\82 qâ\82\88 qâ\82\89 }
+ # Top states: { q₉ }
# Queries transitions:
| q₁ ----F(b)---> ↓₁q₀
| q₂ ----Cof(ø)---> ↓₁q₂ ∨ ↓₂q₂ ∨ ↓₁q₁ ∨ ↓₂q₁
| q₆ ----F(e)---> ⊤ | q₆ ----Cof(ø)---> ↓₂q₆
| q₇ ----F(c)---> ↓₁q₆ ∧ ̅↓̅₁̅q̅₅
| q₇ ----Cof(ø)---> ↓₁q₇ ∨ ↓₂q₇
-
- ##### Run #####
+
+##### RUN #####
+ # Mapping: ø