ufal / perl-pmltq

Query engine and query language for trees in PML format
3 stars 2 forks source link

extend PML-TQ language with immediately-(follows/precedes) relation #51

Open matyaskopp opened 7 years ago

matyaskopp commented 7 years ago

this can be shortcut for this complicated constructions: a-node $a := []; a-node $b := [ord = $a.ord + 1, same-tree-as $a];

or a-root [ descendant a-node $a := [], descendant a-node $b := [ord = $a.ord + 1] ];